нУЁh$m╠V}э !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~─│┌┐└┘├┤┬┴┼▀▄ █ ▌ ▐ ░ ▒ ▓ ⌠ ■ ∙ √ ≈ ≤ ≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОП Я Р С Т У Ж В Ь Ы З Ш Э Щ Ч Ъ ─ │ ┌ ┐ └ ┘ ├ ┤ ┬ ┴ ┼ ▀ ▄ █ ▌ ▐ ░ ▒ ▓ ⌠ ■ ∙ √ ≈ ≤ ≥ ⌡ ° ² · ÷ ═ ║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьызшэщчъЮАБЦ Д Е Ф Г Х И Й К Л М Н О П Я Р С Т У Ж В!Ь!Ы!З!Ш!Э!Щ!Ч!Ъ!─!│!┌!┐!└!┘!├!┤!┬!┴!┼!▀!▄!█!▌!▐!░!▒!▓!⌠!■!∙!√!≈!≤!≥! !⌡!°!²!·!÷!═!║!╒!ё!є!╔!і!ї!╗!╘!╙!╚!╛!ґ!ў!╞!╟!╠!╡!Ё!Є!╣!І!Ї!╦!╧!╨!╩!╪!Ґ!Ў!©!ю!а!б!ц!д!е!ф!г!х!и!й!к!л!м!н!о!п!я!р!с!т!у!ж!в!ь!ы!з!ш!э!щ!ч!ъ!Ю!А!Б!Ц!Д!Е!Ф!Г!Х!И!Й!К!Л!М!Н!О!П!Я!Р!С!Т!У!Ж!В!Ь!Ы!З!Ш!Э!Щ!Ч!Ъ!─!│"┌"┐"└"┘"├"┤"┬"┴"┼"▀"▄"█"▌"▐"░"▒"▓"⌠"■"∙"√"≈"≤"≥" "⌡"°"²"·"÷"═"║"╒"ё"є"╔"і#ї#╗#╘#╙#╚#╛#ґ#ў#╞#╟#╠#╡#ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефгхийклмнопярстужвьыз$ш$&%None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР8 эщчъЮАБЦДЦ5None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР╡None2 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР( compaREST6A description of how to effectfully tie knots in type v, using the m monad, and by sharing some d$ data among the recursive instances. compaREST4Create some data that will be connected to this knot compaRESTйThis is what the knot will look like as a value to the inner computations compaRESTюOnce we're done and we're outside, tie the knot using the datum compaRESTAn effectful memoization monad. compaRESTRun a memoized computation. compaRESTУRun a potentially recursive computation. The provided key will be used to refer to the result of this computation. If during the computation, another attempt to run the computation with the same key is made, we run a tying-the-knot procedure.ШIf another attempt to run the computation with the same key is made *after we're done*, we will return the memoized value. compaREST9Disambiguate memoized computations with an arbitrary tag. compaRESTthe computation to memoize compaRESTkey for memoization None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР═None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРщ% compaREST2An item related to some path relative to the root r.' compaREST#Like a differece list, but indexed.) compaRESTнAll the possible ways to navigate between nodes in a heterogeneous tree form a quiver. The hom-sets of the free category constructed from this quiver are the sets of various multi-step paths between nodes. This is similar to a list, but indexed. The list is in reverse because in practice we append items at the end one at a time. %&'()+*,-./ -,)+*'(/%&.+5None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР!6 9 compaREST5A set of interactions having common unifying features? compaRESTУThe same issues can be rendered in multiple places and might require different ways of represnting them to the user.∙In practice each issue requires a maximum of two different representations: based on the context the issue might need to be rendered as "opposite" (<░) ⌠@ for example when rendering non-breaking changes everything should be reversed (a consequence of the way we generate non-breaking changes).─If _consumer_ doesn't have something, the element was "removed". If _producer_ doesn't have something, the element was "added".A compaREST╨An equivalence relation designating whether two issues are talking about the aspect of the schema. This is used to remove duplicates from the "reverse" error tree we get when we look for non-breaking changes. Generally if checking X->Y raises issue I, and checking Y->X raises issue J, I and J should be related.C compaRESTаThis is certainly an issue, we can demonstrate a "counterexample"D compaRESTоChange looks breaking but we don't have a complete comprehension of the problemE compaRESTйWe don't really support this feature at all, outside structural comparisonF compaRESTЮThis is not an issue in itself, but a clarifying comment providing context for some other issuesG compaREST:We detected an issue with one of the input schemata itselfK compaRESTKindV compaRESTeither request or response data(789:;<=>?@ABFCDEGHIJKLMNOPQRSTUVWXYZ[\]^(KLMNOPQRSTUVWXYZHIJBFCDEG=>?@A:;<\978[]^None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР"еl compaREST A list of AnItem r f#, but optimized into a prefix tree.r compaRESTThe number of leaves.y compaRESTSelect a subtree by prefix{ compaREST2Embed a subtree in a larger tree with given prefixjklmnopqrstuvwxyz{lmmjktsuvwxpqyz{ron None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР$┘▄ compaREST The type FormulaF f r ()А describes (modulo contents of errors) boolean formulas involving variables, conjunctions, and disjunctions. These operations (and the generated algebra) are monotonous. This ensures that fixpoints always exist, i.e. that x = f x has at least one solution. ▄█▌▐░▒▓⌠■ ▄█░▒▌▐▓⌠■ None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР% ≤≤None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР&╛ compaRESTHow to get from an a node to a b nodeг compaRESTжIf the given formula contains any issues, add another issue on top. Otherwise succeed.7.≥⌡ °²·÷═║╒ёє╔ії╗╘╙╚╛╛ў╞ґ╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юабцдефг3╚╛╙╘ї╗╟╠╡Ё≥⌡ °²ІЇ═║╒÷·ёє╔іЄ╣Ўюбацд©фге╦╧╩╪Ґ╨.None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР'?╛ў╞ґДЕ╛ў╞ґДЕNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР'╧ None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР(>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌IП╛ў╞ґ├┘╛ў╞ґ├┘>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌IПNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР)G║ compaREST!Some entity which is product-like╔ compaRESTNo required element found║╒єё╔╔║╒єёNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР*Ў╗ compaRESTЯA boolean formula (without "not") represented as a Disjunctive Normal Form: the formula is a disjunction of a set of clauses, each of which is a conjunction of a set of some elementary formulas. Invariant: no two disjuncts imply eachother ії╗╘╙╚╛ґў╞ ╗╘ії╛╚ґ╙ў╞None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР+ях compaRESTЫInvariant (for better memoization only): the "tail" of the trace is the "least" of the traces of the conjuncted schemata ╛ў╞ґйклмнопяхигфеЎ©юабцдрстужвьы ╛ў╞ґйклмнопяхигферстужвьы©юабцдЎNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР-Э compaRESTA Е whose type we know┐ compaRESTType of a JSON valueТУЖВЬЫЗШЭ│ЩЧЪ─┌┐┤┴┬├└┘┼▀▄█┐┤┴┬├└┘┼Э│ЩЧЪ─┌▀ТУЖВЬЫЗШ▄█None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР/÷ compaRESTыA primitive structural condition for the "top level" of a JSON value (of a specific type)б compaREST The order is lexicographical on a * Bool.╒ compaRESTthis has the right Ordў compaREST!formula for additional properties compaREST6schema for additional properties, Nothing means bottom( ⌡°²·÷єї═║╒ё╔і╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юа(ІЇ╦╧╠╡ЁЄ╣÷єї═║╒ё╔і╗╘╙╚╛ґў╞╟╨Ґ©Ў²· ⌡°юа╩╪None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПР0ЎувьжызшэщчъЮАызэшЮАчъувьжщЎNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРDX*С compaRESTуSome (openapi-supported) feature that we do not support was encountered in the schemaТ compaREST╚We couldn't prove that the branches of a oneOf are disjoint, and we will treat it as an anyOf, meaning we don't check whether the overlaps are excluded in a compatible wayУ compaRESTThe schema is actually invalidЖ compaREST2The schema contains a reference loop along "anyOf""allOf""oneOf".В compaRESTЧProducer doesn't place any restrictions on the types, but the consumer does. List what types remain available in the consumer.Ь compaRESTбin the producer this field used to be handled as part of "additionalProperties", and the consumer this is a specific "properties" entry. Only thrown when this change actually causes other issuesЫ compaRESTбin the consumer this field used to be handled as part of "additionalProperties", and the producer this is a specific "properties" entry. Only thrown when this change actually causes other issuesЗ compaRESTиconsumer requires a property that is not required/allowed in the producerШ compaREST>producer allows a property that is not allowed in the consumerЭ compaRESTЕproducer produces a specific value ($1), consumer has a condition that is not satisfied by said valueЩ compaRESTкconsumer only expects a specific value which the producer does not produce.Ч compaRESTюconsumer declares a maximum numeric value ($1), producer doesn'tЪ compaRESTчconsumer declares a maximum numeric value ($1), producer declares a weaker (higher) limit ($2)─ compaREST;consumer declares a minimum numeric value, producer doesn't│ compaRESTщconsumer declares a minimum numeric value ($1), producer declares a weaker (lower) limit ($2)┌ compaRESTсconsumer declares that the numeric value must be a multiple of $1, producer doesn't┐ compaRESTЬconsumer declares that the numeric value must be a multiple of $1, producer declares a weaker condition (multiple of $2)└ compaRESTТconsumer declares a string/number format, producer declares none or a different format (TODO: improve via regex #32)┘ compaRESTхconsumer declares a maximum length of the string ($1), producer doesn't.├ compaRESTЕconsumer declares a maximum length of the string ($1), producer declares a weaker (higher) limit ($2)┤ compaRESTхconsumer declares a minimum length of the string ($1), producer doesn't.┬ compaRESTДconsumer declares a minimum length of the string ($1), producer declares a weaker (lower) limit ($2)┴ compaRESTЭconsumer declares the string value must match a regex ($1), producer doesn't declare or declares different regex (TODO: #32)┼ compaRESTуconsumer declares the items of an array must satisfy some condition, producer doesn't▀ compaRESTЙproducer and consumer declare that an array must be a tuple of a fixed length, but the lengths don't match▄ compaREST▌consumer declares that the array is a tuple, but the producer doesn't, the length constraints match, but there were issues with the components█ compaRESTПproducer declares that the array is a tuple, but the consumer doesn't, and there were issues with the components▌ compaRESTУconsumer declares that the array is a tuple, but the producer doesn't, and there aren't sufficient length constraints▐ compaRESTгconsumer declares a maximum length of the array ($1), producer doesn't.░ compaRESTДconsumer declares a maximum length of the array ($1), producer declares a weaker (higher) limit ($2)▒ compaRESTгconsumer declares a minimum length of the array ($1), producer doesn't.▓ compaRESTЦconsumer declares a minimum length of the array ($1), producer declares a weaker (lower) limit ($2)⌠ compaREST=consumer declares that items must be unique, producer doesn't■ compaRESTшconsumer declares the properties of an object must satisfy some condition, producer doesn't∙ compaREST7producer allows additional properties, consumer doesn't√ compaRESTжconsumer declares a maximum number of properties in the object ($1), producer doesn't.≈ compaRESTСconsumer declares a maximum number of properties in the object ($1), producer declares a weaker (higher) limit ($2)≤ compaRESTжconsumer declares a minimum number of properties in the object ($1), producer doesn't.≥ compaRESTРconsumer declares a minimum number of properties in the object ($1), producer declares a weaker (lower) limit ($2) compaREST╨producer declares that the value must satisfy a disjunction of some conditions, but consumer's requirements couldn't be matched against any single one of them (TODO: split heuristic #71)⌡ compaREST╟consumer indicates that no values of this type are allowed, but we weren't able to conclude that in the producer (currently only immediate contradictions are checked, c.f. #70)° compaRESTЩconsumer indicates that no values in a particular partition are allowed, but we weren't able to conclude this in the producer2>ЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°СТУЖВЬЫЗШIРЯМНОП2>ЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°СТУЖВЬЫЗШIРЯМНОПNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРE|╠╠None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРEЮNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРGd╦ compaRESTParams have different names╧ compaREST?Consumer requires non-empty param, but producer gives emptyable╨ compaREST7Consumer requires mandatory parm, but producer optional╪ compaREST"Params encoded in different stylesҐ compaRESTOne of schemas not presented >╦╧╨╩╪ҐЎIЇ IЇ>╦╧╨╩╪ҐЎNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРH≈п compaREST²Fragment parameterized by parameter. The dynamic part may be either reference to some parameter (in context of operation) or dereferenced parameter itself.опрясспряоNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРINone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРIk>ПЯРЙКЛМIОН>ПЯРЙКЛМIОНNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРIСNone2 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХИЛПРJU>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРK>ПЯРЙКЛМ║╒÷═>ПЯРЙКЛМ║╒÷═None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРK∙ІІNone1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРKЫIОН╦ЇIОН╦Ї None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРLk>ПЯРЙКЛМДЕIОНЦ>ПЯРЙКЛМДЕIОНЦ!None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРM░┼ compaRESTParams from the PathItem▀ compaRESTжPath fragments traced from PathItem. Takes full list of operation-specific parametersз>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌ПЯРЙКЛМДЕ▌√≈■IПОН╦ЇЦ║╒═÷▄∙⌠╛ў╞ґД├┘·²°⌡ ≤≥▓░▐▒█ВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀ёєз┤┬┴┼▀ЧЪ─│┌┐└┘├ёЗШЭЩВЬЫє╛ў╞ґД├┘·²°⌡ ≤≥▓░▐▒█IПОН╦ЇЦ║╒═÷▄∙⌠>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌ПЯРЙКЛМДЕ▌√≈■"None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРOV0>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌ПЯРЙКЛМДЕ▌√≈■IПОН╦ЇЦ║╒═÷▄∙⌠0IПОН╦ЇЦ║╒═÷▄∙⌠>ЖВЬЫЪЯШЭЩЧ┐└РСТУЗ─│┌ПЯРЙКЛМДЕ▌√≈■&None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРPЯФ compaRESTLike ГЮ, but enforces a specific type list order. (Useful for deconstruction-directed type inference.)ХИЙФФ2#None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРSW╙ compaREST╚A "jet" is a way of simplifying expressions from "outside". The "jetted" expressions should still be completely valid and correct without the jets. Jets just make the expression more "optimized" by identifying patterns and replacing the expressions with "better" ones that have the same sematics.гThe term "jet" in this context was introduced in the Urbit project: $https://urbit.org/docs/vere/jetting/&The pattern fits well for simplifying Behavior tree paths.ії╗╘╙╚ї╗і╙╚╘None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРUrю compaRESTОAll changes that could be breaking are unsupported ⌠@ we don't know if there actually are any breaking changes.ц compaRESTforward C, D and Fд compaREST backward C, D and F, except those shadowed by Aе compaRESTforward and backward E (assumed to be the same anyway)ф compaRESTforward and backward G (assumed to be the same anyway)ЁЄ╣ІЇ╦╧╨╪╩ҐЎ©юабцдефгхийкллгхийабцдефкҐЎ©юІЇ╦╧ЁЄ╣╨╪╩$None1 "#$%&'(-./1256789:<=>?юабдинятжвыЮАЕХЛПРV<ЁЄ╣ІЇ╦╧╨╪╩ҐюЎ©абфецдгхийклзшзшК'()'*+'*,-./-01-234567889:;<=>?@ABCDEFGHIJKLMNOPQRSTTUUVWXYZ[\]^_`abcddefghijklmnopqrstuvwxyz{|}~─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟╠╡ЁЄ╣І Ї ╦ ╧ ╨ ╩ ╪ Ґ Ў © ю а б цдефгхийкклммнопярстужвьпызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐┐└┘░▒▓⌠■ ∙ √ ≈ ≤ ≥ ⌡ ° ² · ÷ ═ ║ ╒ ё є ╔ і ї ╗ ╘ ╙ ╚ ╛ ґ ў ╞ ╟ ╠ ╡ Ё Є ╣ І Ї ╦ ╧ ▓ ⌠ ■ ╨ ╩ ╪ ┐ └ ┘ ├ ┤ ┬ҐҐЎ©юааббцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВ┐└┘ЬЫЗШЭЩ├┤┬ЧЪ─│┌┐└┘├┤┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛╛ґўў╞╟╠╡ЁЄ╣ІЇ╦╧╨╩╪ҐЎ©юаабцдефгхийклмнопярстужвьызшэщчъЮАБЦДЕФГХИЙКЛМНОПЯРСТУЖВЬЫЗШЭЩЧЪ─│┌┐└┘├┤┬┴┼▀▄█▌▐░▒▓⌠■∙√≈≤≥ ⌡°²·÷═║╒ёє╔ії╗╘╙╚╛ґў╞╟Ї╦╧╠╡ЁЄ╣І▓⌠■╨╩╪Ї╦╧╨╩╪ҐЎ©юабцдефгхийк┐└┘Ї╦╧▓⌠■лмнопяр┐└┘стужвьызЇ╦╧▓⌠■┐└┘шэщчъЮАБЦДЕФГХИЙКЛМ▓⌠■Ї╦╧┐└┘├┤┬ЧЪ─│┌┐╠╡Ё╨╩╪НОП┐└┘├┤┬ЯРСТУЖВЬЫЗ┐└┘ШЭЩЧЪ▓⌠■Ї╦╧─│┌┐└┘├┤┬┴┼▀▄█▌┐└┘├┤┬ЧЪ─│┌┐└┘├▐░▒▓⌠■Ї╦╧╠╡Ё▓⌠■ ∙ √ ≈ ≤ ≥ ⌡ ° ┐ └ ┘ ├ ┤ ┬ Ї ╦ ╧ ▓ ⌠ ■!²!²!·!÷!÷!═!║!╒!ё!є!╔!і!ї!╗!╘!╙!╚!╚!╛!ґ!ў!╞!╟!╠!╡!Ё!Є!╣!І!Ї!╦!╧!╨!╩!╪!Ґ!Ў!©!ю!а!б!ц!д!е!ф!г!х!и!й!к!л!м!н!о!п!я!р!с!т!у!ж!в!ь!ы!з!ш!э!щ!ч!ъ!┐!└!┘!├!┤!┬!Ч!Ъ!─!│!┌!┐!Ю!└!┘!├!А!Б!Ц!Д!Ї!╦!╧!▓!⌠!■!Е!Ф!Г!▐!░!▒!▓!⌠!■!Х!И!Й!К!Л!М!Н!О!П!Я!Р!С!╠!╡!Ё!╨!╩!╪!Є!╣!І!Т!У!Ж!В!Ь!Ы!З!Ш!Э!Щ!Ч!Ъ"─"│"┌"┐"└"┘"├"┤"┬"┴"┐"└"┘"├"┤"┬"Ч"Ъ"─"│"┌"┐"└"┘"├"▐"░"▒"▓"⌠"■"Х"И"Й"К"Л"М#┼#▀#▀#▄#█#▌#▐#░#▒#▓#⌠#■#∙√≈≤≥≥ ⌡°²·÷═║╒ёёє╔ії╗╗╘╙╚╛ґў╞╟╠╡ЁЄ╣ІЇ╦╧$╨$╩%╪%Ґ%Ў%©%ю%а%б%ц%дефг&хийк&л&м&но(compaREST-0.1.0.1-3bYGGvx9wcfDTyy6k7sjUVData.OpenApi.Compare.SubtreeData.OpenApi.Compare.PathsData.OpenApi.Compare.ReportData.OpenApi.Compare.CommonData.OpenApi.Compare.MemoData.OpenApi.Compare.OrphansData.OpenApi.Compare.Behavior$Data.OpenApi.Compare.PathsPrefixTreeData.OpenApi.Compare.Formula)Data.OpenApi.Compare.Report.Html.TemplateData.OpenApi.Compare.References"Data.OpenApi.Compare.Validate.Link)Data.OpenApi.Compare.Validate.OAuth2Flows&Data.OpenApi.Compare.Validate.Products(Data.OpenApi.Compare.Validate.Schema.DNF+Data.OpenApi.Compare.Validate.Schema.Traced.Data.OpenApi.Compare.Validate.Schema.TypedJson0Data.OpenApi.Compare.Validate.Schema.JsonFormula.Data.OpenApi.Compare.Validate.Schema.Partition+Data.OpenApi.Compare.Validate.Schema.Issues,Data.OpenApi.Compare.Validate.Schema.Process$Data.OpenApi.Compare.Validate.Schema#Data.OpenApi.Compare.Validate.Param*Data.OpenApi.Compare.Validate.PathFragment$Data.OpenApi.Compare.Validate.Header-Data.OpenApi.Compare.Validate.MediaTypeObject,Data.OpenApi.Compare.Validate.SecurityScheme1Data.OpenApi.Compare.Validate.SecurityRequirement$Data.OpenApi.Compare.Validate.Server"Data.OpenApi.Compare.Validate.Sums'Data.OpenApi.Compare.Validate.Responses)Data.OpenApi.Compare.Validate.RequestBody'Data.OpenApi.Compare.Validate.Operation%Data.OpenApi.Compare.Validate.OpenApiData.OpenApi.Compare.Report.JetData.OpenApi.Compare.Run Data.HListData.OpenUnion.ExtrabaseData.Typeable.InternalTypeableControl.Category>>><<<$comonad-5.0.8-7B69j8qZOLQ9p9g2dwIP3EControl.Comonad.Env.ClassaskControl.Comonad.Trans.EnvlocalControl.Comonadextract*pandoc-types-1.22.1-EbcKbgjut7s2wZi6fSiAH8Text.Pandoc.DefinitionPandoczipAllKnotTier$sel:onKnotFound:KnotTier$sel:onKnotUsed:KnotTier$sel:tieKnot:KnotTier MonadMemo MemoStatemodifyMemoNoncerunMemounknotmemoWithKnotmemoTaggedWithKnot$fOrdInsOrdHashMap $fShowEnvT $fOrdEnvT$fEqEnvT$fOrdApiKeyLocation$fOrdApiKeyParams$fOrdHttpSchemeType$fOrdParamLocation$fOrdOpenApiItems $fOrdStyle$fOrdOpenApiType$fOrdXml$fOrdDiscriminator$fOrdAdditionalProperties$fOrdSchema$fOrdReferenced$fOrdReferenceAnItem DiffPathsPathsRootSnocAdditionalQuiverConstraints NiceQuiverstepcatDiffPaths $fOrdPaths $fEqPaths$fTestEqualitykPaths$fCategorykPaths$fOrdAnItem $fEqAnItem$fShowPathsAnIssueBehaviorOrientationForwardBackwardIssuableIssue describeIssue issueKind relatedIssues IssueKindCertainIssue ProbablyIssueUnsupportedComment SchemaInvalid BehavableBehavedescribeBehavior BehaviorLevelAPILevelServerLevelSecurityRequirementLevelSecuritySchemeLevel PathLevelOperationLevelPathFragmentLevelRequestLevel ResponseLevelHeaderLevelPayloadLevelSchemaLevelTypedSchemaLevel LinkLevel CallbackLevel withClasstoggleOrientationanIssueKindrelatedAnIssues $fToJSONIssue$fToJSONAnIssue$fEqOrientation$fOrdOrientation$fShowOrientation $fEqIssueKind$fOrdIssueKind$fShowIssueKind$fOrdAnIssue$fEqAnIssue $fShowAnIssueAStepPathsPrefixTreePathsPrefixNodemap partitionfilter filterWithKeysize singletonemptyfromListnullfoldWithtoListtakeSubtreelookupembed$fMonoidASet$fSemigroupASet$fToJSONASet$fMonoidPathsPrefixTree$fSemigroupPathsPrefixTree$fOrdPathsPrefixTree$fMonoidMergableObject$fSemigroupMergableObject$fToJSONPathsPrefixTree$fShowPathsPrefixTree $fOrdAStep $fEqAStep $fOrdASet$fEqASet $fShowASet$fEqPathsPrefixTreeFormulaFVarRefanErrorerrorsvariableeitherOf calculatemaxFixpoint mapErrors$fApplicativeFormulaF$fFunctorSomeFormulaF$fFunctorFormulaFtemplateSubtreeCheckEnvSubtreeLevelcheckStructuralCompatibilitycheckSemanticCompatibilitySemanticCompatFormulaCompatFormula'CompatM$sel:unCompatM:CompatMProdCons$sel:producer:ProdCons$sel:consumer:ProdConsTracedTraced'Trace TraceRoot SteppableStepInsOrdHashMapKeyStepClientSchemaServerSchematracedretraced stepTracedorientProdConsswapProdConscheckCompatibilitycheckSubstructurestructuralMaybestructuralMaybeWithstructuralListstructuralEqiohmStructuraliohmStructuralWithrunCompatFormulaembedFormulaissueAtanIssueanIteminvertIssueOrientationinvertIssueOrientationPstructuralIssueanyOfAtclarifyIssue$fSteppableInsOrdHashMapv$fSteppableTraceRootOpenApi$fApplicativeProdCons$fSwapEnvElementRoles'xFalse"$fSwapEnvElementRoles'ProdConsTrue$fSwapEnvRoles:$fSwapEnvRoles[]$fEqMemoKey$fOrdMemoKey$fFunctorCompatM$fApplicativeCompatM$fMonadCompatM$fMonadStateMemoStateCompatM$fEqProdCons $fOrdProdCons$fShowProdCons$fFunctorProdCons$fFoldableProdCons$fTraversableProdCons$fEqStep $fOrdStep $fShowStep $fEqStep0 $fOrdStep0$fShowStep0$fShowVoidQuiver$fOrdVoidQuiver$fEqVoidQuiver InlineStepdereference$fSubtreeReferenced$fSteppableReferenceda$fIssuableLinkLevel $fSubtreeLink $fEqIssue $fOrdIssue$fShowIssueSecuritySchemeStepRefreshUrlsDontMatchHttpSchemeTypesDontMatchApiKeyParamsDontMatchOpenIdConnectUrlsDontMatchCustomHttpSchemesDontMatch"ConsumerDoesNotSupportImplicitFlow"ConsumerDoesNotSupportPasswordFlow+ConsumerDoesNotSupportClientCridentialsFlow+ConsumerDoesNotSupportAuthorizationCodeFlowSecuritySchemeNotMatchedOAuth2ImplicitFlowNotEqualOAuth2PasswordFlowNotEqual#OAuth2ClientCredentialsFlowNotEqual#OAuth2AuthorizationCodeFlowNotEqual ScopesMissingDifferentSecuritySchemesCanNotHaveScopesScopeNotDefinedSecurityRequirementNotMetUndefinedSecuritySchemeOAuth2FlowParamsStepOAuth2FlowsFlow6$fBehavableSecurityRequirementLevelSecuritySchemeLevel$fIssuableSecuritySchemeLevel"$fIssuableSecurityRequirementLevel$$fSubtreeOAuth2AuthorizationCodeFlow$$fSubtreeOAuth2ClientCredentialsFlow$fSubtreeOAuth2PasswordFlow$fSubtreeOAuth2ImplicitFlow$fSteppableOAuth2Flowt$fSubtreeOAuth2Flow $fSteppableOAuth2FlowsOAuth2Flow$fSubtreeOAuth2Flows $fEqBehave$fOrdBehave$fShowBehave $fEqIssue0$fOrdIssue0$fShowIssue0ProductLike$sel:productValue:ProductLike$sel:required:ProductLike checkProductsDisjunctDNF LiteralDNFTopDNFSingleDisjunct BottomDNFfoldDNFforDNF$fBoundedMeetSemiLatticeDNF$fBoundedJoinSemiLatticeDNF$fLatticeDNF$fBoundedMeetSemiLatticeLiftA$fBoundedJoinSemiLatticeLiftA$fLatticeLiftA$fFunctorLiftA$fApplicativeLiftA$fEqDNF$fOrdDNF $fShowDNF$fEqDisjunct $fOrdDisjunct$fShowDisjunct PartitionPartitionLocationPHerePInPropertyPartitionChoiceCByEnumValue CByPropertiesDiscriminatorMappingDiscriminatorStepPropertiesStepConjunctedWithPartitioned AllOfStep OneOfStep AnyOfStepItemsObjectStepItemsArrayStepAdditionalPropertiesStepNotStepImplicitTopSchematracedAllOftracedAnyOftracedOneOftracedItemstracedAdditionalPropertiestracedDiscriminatortracedPropertiestracedConjunct%$fSteppableDiscriminatorInsOrdHashMap$fSteppableSchemaDiscriminator$fSteppableSchemaInsOrdHashMap$fSteppableSchemaReferenced$fSteppableReferencedReferenced$fEqPartitionLocation$fOrdPartitionLocation$fShowPartitionLocation$fEqPartitionChoice$fOrdPartitionChoice$fShowPartitionChoice $fEqStep1 $fOrdStep1$fShowStep1 $fEqStep2 $fOrdStep2$fShowStep2 $fEqStep3 $fOrdStep3$fShowStep3ForeachType$sel:forNull:ForeachType$sel:forBoolean:ForeachType$sel:forNumber:ForeachType$sel:forString:ForeachType$sel:forArray:ForeachType$sel:forObject:ForeachType TypedValueTNullTBoolTNumberTStringTArrayTObjectJsonTypeNullBooleanNumberStringArrayObjectdescribeJSONTypeuntypeValuefoldTypeforType_#$fBoundedMeetSemiLatticeForeachType#$fBoundedJoinSemiLatticeForeachType$fLatticeForeachType$fEqJsonType $fOrdJsonType$fShowJsonType$fShowForeachType$fOrdForeachType$fEqForeachType$fShowTypedValue$fOrdTypedValue$fEqTypedValueJsonFormula$sel:getJsonFormula:JsonFormula SomeCondition ConditionExactlyMaximumMinimum MultipleOfNumberFormat MaxLength MinLengthPatternStringFormatItems TupleItemsMaxItemsMinItemsUniqueItems Properties MaxProperties MinPropertiesProperty$sel:propRequired:Property$sel:propFormula:Property$sel:propRefSchema:PropertyBound Exclusive Inclusive showBound showCondition showJSONValueshowJSONValueInlinesatisfiesTypedcheckNumberFormatcheckStringFormatsatisfiesFormula satisfies $fOrdBound$fOrdSomeCondition$fEqSomeCondition$fEqJsonFormula$fOrdJsonFormula$fShowJsonFormula$fLatticeJsonFormula#$fBoundedJoinSemiLatticeJsonFormula#$fBoundedMeetSemiLatticeJsonFormula$fEqProperty $fOrdProperty$fShowProperty $fEqBound$fShowBound$fFunctorBound$fShowSomeCondition$fShowCondition$fOrdCondition $fEqConditionIntersectionResultDisjointSameNewpartitionSchemapartitionRefSchema runPartitionMselectPartitionrunIntersectionMintersectSchemaintersectRefSchematryPartition showPartition"$fBoundedMeetSemiLatticePartitions$fLatticePartitions$fEqIntersectionResult$fOrdIntersectionResult$fShowIntersectionResult$fEqPartitions$fOrdPartitions$fShowPartitions$fEqPartitionData$fOrdPartitionData$fShowPartitionDataInItemsInItem InPropertyInAdditionalPropertyInPartitionOfTypeNotSupportedOneOfNotDisjoint InvalidSchemaUnguardedRecursionTypesRestrictedAdditionalToPropertyPropertyToAdditionalPropertyNowRequiredUnexpectedPropertyEnumDoesntSatisfyNoMatchingEnumNoMatchingMaximumMatchingMaximumWeakNoMatchingMinimumMatchingMinimumWeakNoMatchingMultipleOfMatchingMultipleOfWeakNoMatchingFormatNoMatchingMaxLengthMatchingMaxLengthWeakNoMatchingMinLengthMatchingMinLengthWeakNoMatchingPatternNoMatchingItemsTupleItemsLengthChangedArrayToTupleTupleToArrayNoMatchingTupleItemsNoMatchingMaxItemsMatchingMaxItemsWeakNoMatchingMinItemsMatchingMinItemsWeakNoMatchingUniqueItemsNoMatchingPropertiesNoAdditionalPropertiesNoMatchingMaxPropertiesMatchingMaxPropertiesWeakNoMatchingMinPropertiesMatchingMinPropertiesWeakNoMatchingConditionTypeBecomesEmptyPartitionBecomesEmpty&$fBehavableTypedSchemaLevelSchemaLevel+$fBehavableTypedSchemaLevelTypedSchemaLevel&$fBehavableSchemaLevelTypedSchemaLevel$fIssuableSchemaLevel$fIssuableTypedSchemaLevel$fEqBehave0$fOrdBehave0 $fShowBehave0$fEqBehave1$fOrdBehave1 $fShowBehave1schemaToFormula$fMonadWriterwSilent$fFunctorSilent$fApplicativeSilent $fMonadSilent$fSubtreeSchema InParamSchemaParamNameMismatchParamEmptinessIncompatible ParamRequiredParamPlaceIncompatibleParamStyleMismatchParamSchemaMismatchPathFragmentsDontMatch$fSteppableParamReferenced$fSubtreeParam'$fBehavablePathFragmentLevelSchemaLevel$fIssuablePathFragmentLevel$fEqEncodingStyle$fOrdEncodingStyle$fShowEncodingStylePathFragmentParamPathFragment StaticPathDynamicPath parsePath$fSteppablePathFragmentParam$fSubtreePathFragment$fEqPathFragment$fOrdPathFragment$fShowPathFragment$fFunctorPathFragment!$fBehavableHeaderLevelSchemaLevel$fIssuableHeaderLevel$fSteppableHeaderReferenced$fSubtreeHeaderConsumerDoesntHaveResponseCodeParamNotMatchedPathFragmentNotMatched NoRequestBodyWithStatusCode PayloadSchemaMediaTypeSchemaRequiredMediaEncodingMissingEncodingNotSupported$fIssuableOperationLevel&$fBehavableOperationLevelResponseLevel $fSteppableEncodingInsOrdHashMap"$fSteppableMediaTypeObjectEncoding'$fSteppableMediaTypeObjectInsOrdHashMap$$fSteppableMediaTypeObjectReferenced$fSubtreeEncoding$fSubtreeMediaTypeObject"$fBehavablePayloadLevelSchemaLevel$fIssuablePayloadLevel($fSteppableSecuritySchemeTypeOAuth2Flows+$fSteppableSecuritySchemeSecuritySchemeType$fSubtreeSecurityScheme$fSubtreeSecurityRequirementEnumValueNotConsumedConsumerNotOpenServerVariableNotDefinedServerNotMatched$fIssuableServerLevel$fSubtree[]$$fBehavableOperationLevelServerLevel$fSubtree[]0$fSteppable[][]$fEqServerUrlPart$fShowServerUrlPart$fFunctorServerUrlPart$fFoldableServerUrlPart$fTraversableServerUrlPart checkSumsInHeaderResponsePayload!$fSteppableResponsesInsOrdHashMap$fSteppableResponseReferenced $fSteppableResponseInsOrdHashMap!$fSteppableResponseInsOrdHashMap0!$fSteppableResponseInsOrdHashMap1"$fSteppableResponseMediaTypeObject$fSteppableResponsesReferenced$fSubtreeResponse#$fBehavableResponseLevelHeaderLevel$$fBehavableResponseLevelPayloadLevel$fIssuableResponseLevel$fSubtreeResponses $fEqStep4 $fOrdStep4$fShowStep4 $fEqStep5 $fOrdStep5$fShowStep5 InPayloadRequestBodyRequiredRequestMediaTypeNotFound#$fSteppableRequestBodyInsOrdHashMap%$fSteppableRequestBodyMediaTypeObject$fSubtreeRequestBody#$fBehavableRequestLevelPayloadLevel$fIssuableRequestLevelProcessedPathItems,$sel:unProcessedPathItems:ProcessedPathItemsProcessedPathItem$sel:path:ProcessedPathItem$sel:item:ProcessedPathItemOperationMethod GetMethod PutMethod PostMethodDeleteMethod OptionsMethod HeadMethodPatchMethodTraceMethodMatchedOperation$sel:operation:MatchedOperation $sel:pathParams:MatchedOperation&$sel:getPathFragments:MatchedOperationOperationCallbackCallbackPathsStepCallbacksUnsupportedPathFragmentStep PathItemParamOperationMethodStepMatchedPathStepInOperationOperationMissingAtPathNoPathsMatchedAllPathsFailedOperationServersStep EnvServerStepOperationCallbackStep OperationSecurityRequirementStepOperationResponsesStepOperationRequestBodyStepOperationParamsStepSecurityRequirementStep InRequestInParam InFragmentpathItemMethodprocessPathItems&$fBehavableOperationLevelCallbackLevel$fIssuableCallbackLevel$fSubtreeCallback$fBehavableAPILevelPathLevel$fIssuableAPILevel1$fBehavableOperationLevelSecurityRequirementLevel%$fBehavableOperationLevelRequestLevel*$fBehavableOperationLevelPathFragmentLevel$fSteppableMatchedOperation[]%$fSteppableMatchedOperationReferenced.$fSteppableMatchedOperationSecurityRequirement$$fSteppableMatchedOperationResponses&$fSteppableMatchedOperationReferenced0&$fSteppableMatchedOperationReferenced1$fSubtreeMatchedOperation"$fBehavablePathLevelOperationLevel$fIssuablePathLevel%$fSteppableCallbackProcessedPathItems$fSubtreeProcessedPathItems&$fSteppableMatchedPathItemPathFragment$$fSteppableMatchedPathItemReferenced*$fSteppableMatchedPathItemMatchedOperation,$fSteppableProcessedPathItemsMatchedPathItem$fSubtreeMatchedPathItem$fEqMatchedPathItem$fEqProcessedPathItems$fShowProcessedPathItems$fEqProcessedPathItem$fShowProcessedPathItem$fEqOperationMethod$fOrdOperationMethod$fShowOperationMethod $fEqStep6 $fOrdStep6$fShowStep6 $fEqStep7 $fOrdStep7$fShowStep7 $fEqStep8 $fOrdStep8$fShowStep8 $fEqStep9 $fOrdStep9$fShowStep9 $fEqIssue1$fOrdIssue1$fShowIssue1$fEqBehave2$fOrdBehave2 $fShowBehave2$fEqBehave3$fOrdBehave3 $fShowBehave3$fEqBehave4$fOrdBehave4 $fShowBehave4$fSteppableOpenApiInsOrdHashMap $fSteppableOpenApiInsOrdHashMap0 $fSteppableOpenApiInsOrdHashMap1 $fSteppableOpenApiInsOrdHashMap2 $fSteppableOpenApiInsOrdHashMap3 $fSteppableOpenApiInsOrdHashMap4 $fSteppableOpenApiInsOrdHashMap5 $fSteppableOpenApiInsOrdHashMap6$$fSteppableOpenApiProcessedPathItems$fSubtreeOpenApi ReportJet' ReportJetReportJetResultConstructReportJetconstructReportJet$fConstructReportJetkkManyf$fConstructReportJetkkMaybef$fJetArgNonEmpty $fJetArgUnion $fJetArgf$fConstructReportJetkk->f$fFunctorReportJetReportTreeStyleHeadersTreeStyleFoldingBlockquotesTreeStyleReportConfig$sel:treeStyle:ReportConfig$sel:reportMode:ReportConfig ReportMode OnlyErrorsAllReportStatusBreakingChangesNoBreakingChangesOnlyUnsupportedChangesReportInput $sel:breakingChanges:ReportInput#$sel:nonBreakingChanges:ReportInput#$sel:unsupportedChanges:ReportInput$sel:schemaIssues:ReportInput CheckerOutput!$sel:forwardChanges:CheckerOutput"$sel:backwardChanges:CheckerOutputsegregateIssuesgenerateReport$fDefaultReportConfig$fMonoidReport$fSemigroupReport$fGenericReport$fEqReportMode$fGenericReportInput$fSemigroupReportInput$fMonoidReportInput$fToJSONReportInput$fGenericCheckerOutput$fSemigroupCheckerOutput$fMonoidCheckerOutput$fToJSONCheckerOutput runChecker runReport reassembleReassembleHListgetHHasHasAllHListHNilHCons singletonH$aeson-1.5.6.0-B9OtI9VBLiHCQs83ZG0jYcData.Aeson.Types.InternalValue@@>)open-union-0.4.0.0-DwxaFQqSl2rIAcxNNjr0veData.OpenUnion.Internal@>TryLiftUniontryLiftUnionSingletonUnion