[ { "path": "AUTHORS", "content": "Martin Gieseking \n\tauthor of dvisvgm\n\nYann Collet\n\tlibs/xxHash/xxhash.*\n\thttps://github.com/Cyan4973/xxHash\n\nGoogle Inc.\n\tlibs/brotli/*\n\tlibs/woff2/*\n\thttps://github.com/google/brotli\n\thttps://github.com/google/woff2\n\nAngus Johnson\n\tlibs/clipper/clipper.*\n\thttps://sourceforge.net/projects/polyclipping/\n\nMichael Park\n\tlibs/variant/include/mpark/*\n\thttps://github.com/mpark/variant\n\nAlexander Peslyak\n\tlibs/md5/*\n\nPeter Selinger\n\tlibs/potrace/*\n\thttps://potrace.sourceforge.net\n\n" }, { "path": "COPYING", "content": " GNU GENERAL PUBLIC LICENSE\n Version 3, 29 June 2007\n\n Copyright (C) 2007 Free Software Foundation, Inc. \n Everyone is permitted to copy and distribute verbatim copies\n of this license document, but changing it is not allowed.\n\n Preamble\n\n The GNU General Public License is a free, copyleft license for\nsoftware and other kinds of works.\n\n The licenses for most software and other practical works are designed\nto take away your freedom to share and change the works. By contrast,\nthe GNU General Public License is intended to guarantee your freedom to\nshare and change all versions of a program--to make sure it remains free\nsoftware for all its users. We, the Free Software Foundation, use the\nGNU General Public License for most of our software; it applies also to\nany other work released this way by its authors. You can apply it to\nyour programs, too.\n\n When we speak of free software, we are referring to freedom, not\nprice. Our General Public Licenses are designed to make sure that you\nhave the freedom to distribute copies of free software (and charge for\nthem if you wish), that you receive source code or can get it if you\nwant it, that you can change the software or use pieces of it in new\nfree programs, and that you know you can do these things.\n\n To protect your rights, we need to prevent others from denying you\nthese rights or asking you to surrender the rights. Therefore, you have\ncertain responsibilities if you distribute copies of the software, or if\nyou modify it: responsibilities to respect the freedom of others.\n\n For example, if you distribute copies of such a program, whether\ngratis or for a fee, you must pass on to the recipients the same\nfreedoms that you received. You must make sure that they, too, receive\nor can get the source code. And you must show them these terms so they\nknow their rights.\n\n Developers that use the GNU GPL protect your rights with two steps:\n(1) assert copyright on the software, and (2) offer you this License\ngiving you legal permission to copy, distribute and/or modify it.\n\n For the developers' and authors' protection, the GPL clearly explains\nthat there is no warranty for this free software. For both users' and\nauthors' sake, the GPL requires that modified versions be marked as\nchanged, so that their problems will not be attributed erroneously to\nauthors of previous versions.\n\n Some devices are designed to deny users access to install or run\nmodified versions of the software inside them, although the manufacturer\ncan do so. This is fundamentally incompatible with the aim of\nprotecting users' freedom to change the software. The systematic\npattern of such abuse occurs in the area of products for individuals to\nuse, which is precisely where it is most unacceptable. Therefore, we\nhave designed this version of the GPL to prohibit the practice for those\nproducts. If such problems arise substantially in other domains, we\nstand ready to extend this provision to those domains in future versions\nof the GPL, as needed to protect the freedom of users.\n\n Finally, every program is threatened constantly by software patents.\nStates should not allow patents to restrict development and use of\nsoftware on general-purpose computers, but in those that do, we wish to\navoid the special danger that patents applied to a free program could\nmake it effectively proprietary. To prevent this, the GPL assures that\npatents cannot be used to render the program non-free.\n\n The precise terms and conditions for copying, distribution and\nmodification follow.\n\n TERMS AND CONDITIONS\n\n 0. Definitions.\n\n \"This License\" refers to version 3 of the GNU General Public License.\n\n \"Copyright\" also means copyright-like laws that apply to other kinds of\nworks, such as semiconductor masks.\n\n \"The Program\" refers to any copyrightable work licensed under this\nLicense. Each licensee is addressed as \"you\". \"Licensees\" and\n\"recipients\" may be individuals or organizations.\n\n To \"modify\" a work means to copy from or adapt all or part of the work\nin a fashion requiring copyright permission, other than the making of an\nexact copy. The resulting work is called a \"modified version\" of the\nearlier work or a work \"based on\" the earlier work.\n\n A \"covered work\" means either the unmodified Program or a work based\non the Program.\n\n To \"propagate\" a work means to do anything with it that, without\npermission, would make you directly or secondarily liable for\ninfringement under applicable copyright law, except executing it on a\ncomputer or modifying a private copy. Propagation includes copying,\ndistribution (with or without modification), making available to the\npublic, and in some countries other activities as well.\n\n To \"convey\" a work means any kind of propagation that enables other\nparties to make or receive copies. Mere interaction with a user through\na computer network, with no transfer of a copy, is not conveying.\n\n An interactive user interface displays \"Appropriate Legal Notices\"\nto the extent that it includes a convenient and prominently visible\nfeature that (1) displays an appropriate copyright notice, and (2)\ntells the user that there is no warranty for the work (except to the\nextent that warranties are provided), that licensees may convey the\nwork under this License, and how to view a copy of this License. If\nthe interface presents a list of user commands or options, such as a\nmenu, a prominent item in the list meets this criterion.\n\n 1. Source Code.\n\n The \"source code\" for a work means the preferred form of the work\nfor making modifications to it. \"Object code\" means any non-source\nform of a work.\n\n A \"Standard Interface\" means an interface that either is an official\nstandard defined by a recognized standards body, or, in the case of\ninterfaces specified for a particular programming language, one that\nis widely used among developers working in that language.\n\n The \"System Libraries\" of an executable work include anything, other\nthan the work as a whole, that (a) is included in the normal form of\npackaging a Major Component, but which is not part of that Major\nComponent, and (b) serves only to enable use of the work with that\nMajor Component, or to implement a Standard Interface for which an\nimplementation is available to the public in source code form. A\n\"Major Component\", in this context, means a major essential component\n(kernel, window system, and so on) of the specific operating system\n(if any) on which the executable work runs, or a compiler used to\nproduce the work, or an object code interpreter used to run it.\n\n The \"Corresponding Source\" for a work in object code form means all\nthe source code needed to generate, install, and (for an executable\nwork) run the object code and to modify the work, including scripts to\ncontrol those activities. However, it does not include the work's\nSystem Libraries, or general-purpose tools or generally available free\nprograms which are used unmodified in performing those activities but\nwhich are not part of the work. For example, Corresponding Source\nincludes interface definition files associated with source files for\nthe work, and the source code for shared libraries and dynamically\nlinked subprograms that the work is specifically designed to require,\nsuch as by intimate data communication or control flow between those\nsubprograms and other parts of the work.\n\n The Corresponding Source need not include anything that users\ncan regenerate automatically from other parts of the Corresponding\nSource.\n\n The Corresponding Source for a work in source code form is that\nsame work.\n\n 2. Basic Permissions.\n\n All rights granted under this License are granted for the term of\ncopyright on the Program, and are irrevocable provided the stated\nconditions are met. This License explicitly affirms your unlimited\npermission to run the unmodified Program. The output from running a\ncovered work is covered by this License only if the output, given its\ncontent, constitutes a covered work. This License acknowledges your\nrights of fair use or other equivalent, as provided by copyright law.\n\n You may make, run and propagate covered works that you do not\nconvey, without conditions so long as your license otherwise remains\nin force. You may convey covered works to others for the sole purpose\nof having them make modifications exclusively for you, or provide you\nwith facilities for running those works, provided that you comply with\nthe terms of this License in conveying all material for which you do\nnot control copyright. Those thus making or running the covered works\nfor you must do so exclusively on your behalf, under your direction\nand control, on terms that prohibit them from making any copies of\nyour copyrighted material outside their relationship with you.\n\n Conveying under any other circumstances is permitted solely under\nthe conditions stated below. Sublicensing is not allowed; section 10\nmakes it unnecessary.\n\n 3. Protecting Users' Legal Rights From Anti-Circumvention Law.\n\n No covered work shall be deemed part of an effective technological\nmeasure under any applicable law fulfilling obligations under article\n11 of the WIPO copyright treaty adopted on 20 December 1996, or\nsimilar laws prohibiting or restricting circumvention of such\nmeasures.\n\n When you convey a covered work, you waive any legal power to forbid\ncircumvention of technological measures to the extent such circumvention\nis effected by exercising rights under this License with respect to\nthe covered work, and you disclaim any intention to limit operation or\nmodification of the work as a means of enforcing, against the work's\nusers, your or third parties' legal rights to forbid circumvention of\ntechnological measures.\n\n 4. Conveying Verbatim Copies.\n\n You may convey verbatim copies of the Program's source code as you\nreceive it, in any medium, provided that you conspicuously and\nappropriately publish on each copy an appropriate copyright notice;\nkeep intact all notices stating that this License and any\nnon-permissive terms added in accord with section 7 apply to the code;\nkeep intact all notices of the absence of any warranty; and give all\nrecipients a copy of this License along with the Program.\n\n You may charge any price or no price for each copy that you convey,\nand you may offer support or warranty protection for a fee.\n\n 5. Conveying Modified Source Versions.\n\n You may convey a work based on the Program, or the modifications to\nproduce it from the Program, in the form of source code under the\nterms of section 4, provided that you also meet all of these conditions:\n\n a) The work must carry prominent notices stating that you modified\n it, and giving a relevant date.\n\n b) The work must carry prominent notices stating that it is\n released under this License and any conditions added under section\n 7. This requirement modifies the requirement in section 4 to\n \"keep intact all notices\".\n\n c) You must license the entire work, as a whole, under this\n License to anyone who comes into possession of a copy. This\n License will therefore apply, along with any applicable section 7\n additional terms, to the whole of the work, and all its parts,\n regardless of how they are packaged. This License gives no\n permission to license the work in any other way, but it does not\n invalidate such permission if you have separately received it.\n\n d) If the work has interactive user interfaces, each must display\n Appropriate Legal Notices; however, if the Program has interactive\n interfaces that do not display Appropriate Legal Notices, your\n work need not make them do so.\n\n A compilation of a covered work with other separate and independent\nworks, which are not by their nature extensions of the covered work,\nand which are not combined with it such as to form a larger program,\nin or on a volume of a storage or distribution medium, is called an\n\"aggregate\" if the compilation and its resulting copyright are not\nused to limit the access or legal rights of the compilation's users\nbeyond what the individual works permit. Inclusion of a covered work\nin an aggregate does not cause this License to apply to the other\nparts of the aggregate.\n\n 6. Conveying Non-Source Forms.\n\n You may convey a covered work in object code form under the terms\nof sections 4 and 5, provided that you also convey the\nmachine-readable Corresponding Source under the terms of this License,\nin one of these ways:\n\n a) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by the\n Corresponding Source fixed on a durable physical medium\n customarily used for software interchange.\n\n b) Convey the object code in, or embodied in, a physical product\n (including a physical distribution medium), accompanied by a\n written offer, valid for at least three years and valid for as\n long as you offer spare parts or customer support for that product\n model, to give anyone who possesses the object code either (1) a\n copy of the Corresponding Source for all the software in the\n product that is covered by this License, on a durable physical\n medium customarily used for software interchange, for a price no\n more than your reasonable cost of physically performing this\n conveying of source, or (2) access to copy the\n Corresponding Source from a network server at no charge.\n\n c) Convey individual copies of the object code with a copy of the\n written offer to provide the Corresponding Source. This\n alternative is allowed only occasionally and noncommercially, and\n only if you received the object code with such an offer, in accord\n with subsection 6b.\n\n d) Convey the object code by offering access from a designated\n place (gratis or for a charge), and offer equivalent access to the\n Corresponding Source in the same way through the same place at no\n further charge. You need not require recipients to copy the\n Corresponding Source along with the object code. If the place to\n copy the object code is a network server, the Corresponding Source\n may be on a different server (operated by you or a third party)\n that supports equivalent copying facilities, provided you maintain\n clear directions next to the object code saying where to find the\n Corresponding Source. Regardless of what server hosts the\n Corresponding Source, you remain obligated to ensure that it is\n available for as long as needed to satisfy these requirements.\n\n e) Convey the object code using peer-to-peer transmission, provided\n you inform other peers where the object code and Corresponding\n Source of the work are being offered to the general public at no\n charge under subsection 6d.\n\n A separable portion of the object code, whose source code is excluded\nfrom the Corresponding Source as a System Library, need not be\nincluded in conveying the object code work.\n\n A \"User Product\" is either (1) a \"consumer product\", which means any\ntangible personal property which is normally used for personal, family,\nor household purposes, or (2) anything designed or sold for incorporation\ninto a dwelling. In determining whether a product is a consumer product,\ndoubtful cases shall be resolved in favor of coverage. For a particular\nproduct received by a particular user, \"normally used\" refers to a\ntypical or common use of that class of product, regardless of the status\nof the particular user or of the way in which the particular user\nactually uses, or expects or is expected to use, the product. A product\nis a consumer product regardless of whether the product has substantial\ncommercial, industrial or non-consumer uses, unless such uses represent\nthe only significant mode of use of the product.\n\n \"Installation Information\" for a User Product means any methods,\nprocedures, authorization keys, or other information required to install\nand execute modified versions of a covered work in that User Product from\na modified version of its Corresponding Source. The information must\nsuffice to ensure that the continued functioning of the modified object\ncode is in no case prevented or interfered with solely because\nmodification has been made.\n\n If you convey an object code work under this section in, or with, or\nspecifically for use in, a User Product, and the conveying occurs as\npart of a transaction in which the right of possession and use of the\nUser Product is transferred to the recipient in perpetuity or for a\nfixed term (regardless of how the transaction is characterized), the\nCorresponding Source conveyed under this section must be accompanied\nby the Installation Information. But this requirement does not apply\nif neither you nor any third party retains the ability to install\nmodified object code on the User Product (for example, the work has\nbeen installed in ROM).\n\n The requirement to provide Installation Information does not include a\nrequirement to continue to provide support service, warranty, or updates\nfor a work that has been modified or installed by the recipient, or for\nthe User Product in which it has been modified or installed. Access to a\nnetwork may be denied when the modification itself materially and\nadversely affects the operation of the network or violates the rules and\nprotocols for communication across the network.\n\n Corresponding Source conveyed, and Installation Information provided,\nin accord with this section must be in a format that is publicly\ndocumented (and with an implementation available to the public in\nsource code form), and must require no special password or key for\nunpacking, reading or copying.\n\n 7. Additional Terms.\n\n \"Additional permissions\" are terms that supplement the terms of this\nLicense by making exceptions from one or more of its conditions.\nAdditional permissions that are applicable to the entire Program shall\nbe treated as though they were included in this License, to the extent\nthat they are valid under applicable law. If additional permissions\napply only to part of the Program, that part may be used separately\nunder those permissions, but the entire Program remains governed by\nthis License without regard to the additional permissions.\n\n When you convey a copy of a covered work, you may at your option\nremove any additional permissions from that copy, or from any part of\nit. (Additional permissions may be written to require their own\nremoval in certain cases when you modify the work.) You may place\nadditional permissions on material, added by you to a covered work,\nfor which you have or can give appropriate copyright permission.\n\n Notwithstanding any other provision of this License, for material you\nadd to a covered work, you may (if authorized by the copyright holders of\nthat material) supplement the terms of this License with terms:\n\n a) Disclaiming warranty or limiting liability differently from the\n terms of sections 15 and 16 of this License; or\n\n b) Requiring preservation of specified reasonable legal notices or\n author attributions in that material or in the Appropriate Legal\n Notices displayed by works containing it; or\n\n c) Prohibiting misrepresentation of the origin of that material, or\n requiring that modified versions of such material be marked in\n reasonable ways as different from the original version; or\n\n d) Limiting the use for publicity purposes of names of licensors or\n authors of the material; or\n\n e) Declining to grant rights under trademark law for use of some\n trade names, trademarks, or service marks; or\n\n f) Requiring indemnification of licensors and authors of that\n material by anyone who conveys the material (or modified versions of\n it) with contractual assumptions of liability to the recipient, for\n any liability that these contractual assumptions directly impose on\n those licensors and authors.\n\n All other non-permissive additional terms are considered \"further\nrestrictions\" within the meaning of section 10. If the Program as you\nreceived it, or any part of it, contains a notice stating that it is\ngoverned by this License along with a term that is a further\nrestriction, you may remove that term. If a license document contains\na further restriction but permits relicensing or conveying under this\nLicense, you may add to a covered work material governed by the terms\nof that license document, provided that the further restriction does\nnot survive such relicensing or conveying.\n\n If you add terms to a covered work in accord with this section, you\nmust place, in the relevant source files, a statement of the\nadditional terms that apply to those files, or a notice indicating\nwhere to find the applicable terms.\n\n Additional terms, permissive or non-permissive, may be stated in the\nform of a separately written license, or stated as exceptions;\nthe above requirements apply either way.\n\n 8. Termination.\n\n You may not propagate or modify a covered work except as expressly\nprovided under this License. Any attempt otherwise to propagate or\nmodify it is void, and will automatically terminate your rights under\nthis License (including any patent licenses granted under the third\nparagraph of section 11).\n\n However, if you cease all violation of this License, then your\nlicense from a particular copyright holder is reinstated (a)\nprovisionally, unless and until the copyright holder explicitly and\nfinally terminates your license, and (b) permanently, if the copyright\nholder fails to notify you of the violation by some reasonable means\nprior to 60 days after the cessation.\n\n Moreover, your license from a particular copyright holder is\nreinstated permanently if the copyright holder notifies you of the\nviolation by some reasonable means, this is the first time you have\nreceived notice of violation of this License (for any work) from that\ncopyright holder, and you cure the violation prior to 30 days after\nyour receipt of the notice.\n\n Termination of your rights under this section does not terminate the\nlicenses of parties who have received copies or rights from you under\nthis License. If your rights have been terminated and not permanently\nreinstated, you do not qualify to receive new licenses for the same\nmaterial under section 10.\n\n 9. Acceptance Not Required for Having Copies.\n\n You are not required to accept this License in order to receive or\nrun a copy of the Program. Ancillary propagation of a covered work\noccurring solely as a consequence of using peer-to-peer transmission\nto receive a copy likewise does not require acceptance. However,\nnothing other than this License grants you permission to propagate or\nmodify any covered work. These actions infringe copyright if you do\nnot accept this License. Therefore, by modifying or propagating a\ncovered work, you indicate your acceptance of this License to do so.\n\n 10. Automatic Licensing of Downstream Recipients.\n\n Each time you convey a covered work, the recipient automatically\nreceives a license from the original licensors, to run, modify and\npropagate that work, subject to this License. You are not responsible\nfor enforcing compliance by third parties with this License.\n\n An \"entity transaction\" is a transaction transferring control of an\norganization, or substantially all assets of one, or subdividing an\norganization, or merging organizations. If propagation of a covered\nwork results from an entity transaction, each party to that\ntransaction who receives a copy of the work also receives whatever\nlicenses to the work the party's predecessor in interest had or could\ngive under the previous paragraph, plus a right to possession of the\nCorresponding Source of the work from the predecessor in interest, if\nthe predecessor has it or can get it with reasonable efforts.\n\n You may not impose any further restrictions on the exercise of the\nrights granted or affirmed under this License. For example, you may\nnot impose a license fee, royalty, or other charge for exercise of\nrights granted under this License, and you may not initiate litigation\n(including a cross-claim or counterclaim in a lawsuit) alleging that\nany patent claim is infringed by making, using, selling, offering for\nsale, or importing the Program or any portion of it.\n\n 11. Patents.\n\n A \"contributor\" is a copyright holder who authorizes use under this\nLicense of the Program or a work on which the Program is based. The\nwork thus licensed is called the contributor's \"contributor version\".\n\n A contributor's \"essential patent claims\" are all patent claims\nowned or controlled by the contributor, whether already acquired or\nhereafter acquired, that would be infringed by some manner, permitted\nby this License, of making, using, or selling its contributor version,\nbut do not include claims that would be infringed only as a\nconsequence of further modification of the contributor version. For\npurposes of this definition, \"control\" includes the right to grant\npatent sublicenses in a manner consistent with the requirements of\nthis License.\n\n Each contributor grants you a non-exclusive, worldwide, royalty-free\npatent license under the contributor's essential patent claims, to\nmake, use, sell, offer for sale, import and otherwise run, modify and\npropagate the contents of its contributor version.\n\n In the following three paragraphs, a \"patent license\" is any express\nagreement or commitment, however denominated, not to enforce a patent\n(such as an express permission to practice a patent or covenant not to\nsue for patent infringement). To \"grant\" such a patent license to a\nparty means to make such an agreement or commitment not to enforce a\npatent against the party.\n\n If you convey a covered work, knowingly relying on a patent license,\nand the Corresponding Source of the work is not available for anyone\nto copy, free of charge and under the terms of this License, through a\npublicly available network server or other readily accessible means,\nthen you must either (1) cause the Corresponding Source to be so\navailable, or (2) arrange to deprive yourself of the benefit of the\npatent license for this particular work, or (3) arrange, in a manner\nconsistent with the requirements of this License, to extend the patent\nlicense to downstream recipients. \"Knowingly relying\" means you have\nactual knowledge that, but for the patent license, your conveying the\ncovered work in a country, or your recipient's use of the covered work\nin a country, would infringe one or more identifiable patents in that\ncountry that you have reason to believe are valid.\n\n If, pursuant to or in connection with a single transaction or\narrangement, you convey, or propagate by procuring conveyance of, a\ncovered work, and grant a patent license to some of the parties\nreceiving the covered work authorizing them to use, propagate, modify\nor convey a specific copy of the covered work, then the patent license\nyou grant is automatically extended to all recipients of the covered\nwork and works based on it.\n\n A patent license is \"discriminatory\" if it does not include within\nthe scope of its coverage, prohibits the exercise of, or is\nconditioned on the non-exercise of one or more of the rights that are\nspecifically granted under this License. You may not convey a covered\nwork if you are a party to an arrangement with a third party that is\nin the business of distributing software, under which you make payment\nto the third party based on the extent of your activity of conveying\nthe work, and under which the third party grants, to any of the\nparties who would receive the covered work from you, a discriminatory\npatent license (a) in connection with copies of the covered work\nconveyed by you (or copies made from those copies), or (b) primarily\nfor and in connection with specific products or compilations that\ncontain the covered work, unless you entered into that arrangement,\nor that patent license was granted, prior to 28 March 2007.\n\n Nothing in this License shall be construed as excluding or limiting\nany implied license or other defenses to infringement that may\notherwise be available to you under applicable patent law.\n\n 12. No Surrender of Others' Freedom.\n\n If conditions are imposed on you (whether by court order, agreement or\notherwise) that contradict the conditions of this License, they do not\nexcuse you from the conditions of this License. If you cannot convey a\ncovered work so as to satisfy simultaneously your obligations under this\nLicense and any other pertinent obligations, then as a consequence you may\nnot convey it at all. For example, if you agree to terms that obligate you\nto collect a royalty for further conveying from those to whom you convey\nthe Program, the only way you could satisfy both those terms and this\nLicense would be to refrain entirely from conveying the Program.\n\n 13. Use with the GNU Affero General Public License.\n\n Notwithstanding any other provision of this License, you have\npermission to link or combine any covered work with a work licensed\nunder version 3 of the GNU Affero General Public License into a single\ncombined work, and to convey the resulting work. The terms of this\nLicense will continue to apply to the part which is the covered work,\nbut the special requirements of the GNU Affero General Public License,\nsection 13, concerning interaction through a network will apply to the\ncombination as such.\n\n 14. Revised Versions of this License.\n\n The Free Software Foundation may publish revised and/or new versions of\nthe GNU General Public License from time to time. Such new versions will\nbe similar in spirit to the present version, but may differ in detail to\naddress new problems or concerns.\n\n Each version is given a distinguishing version number. If the\nProgram specifies that a certain numbered version of the GNU General\nPublic License \"or any later version\" applies to it, you have the\noption of following the terms and conditions either of that numbered\nversion or of any later version published by the Free Software\nFoundation. If the Program does not specify a version number of the\nGNU General Public License, you may choose any version ever published\nby the Free Software Foundation.\n\n If the Program specifies that a proxy can decide which future\nversions of the GNU General Public License can be used, that proxy's\npublic statement of acceptance of a version permanently authorizes you\nto choose that version for the Program.\n\n Later license versions may give you additional or different\npermissions. However, no additional obligations are imposed on any\nauthor or copyright holder as a result of your choosing to follow a\nlater version.\n\n 15. Disclaimer of Warranty.\n\n THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY\nAPPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT\nHOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY\nOF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,\nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\nPURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM\nIS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF\nALL NECESSARY SERVICING, REPAIR OR CORRECTION.\n\n 16. Limitation of Liability.\n\n IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\nWILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS\nTHE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY\nGENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE\nUSE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF\nDATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD\nPARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),\nEVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF\nSUCH DAMAGES.\n\n 17. Interpretation of Sections 15 and 16.\n\n If the disclaimer of warranty and limitation of liability provided\nabove cannot be given local legal effect according to their terms,\nreviewing courts shall apply local law that most closely approximates\nan absolute waiver of all civil liability in connection with the\nProgram, unless a warranty or assumption of liability accompanies a\ncopy of the Program in return for a fee.\n\n END OF TERMS AND CONDITIONS\n\n How to Apply These Terms to Your New Programs\n\n If you develop a new program, and you want it to be of the greatest\npossible use to the public, the best way to achieve this is to make it\nfree software which everyone can redistribute and change under these terms.\n\n To do so, attach the following notices to the program. It is safest\nto attach them to the start of each source file to most effectively\nstate the exclusion of warranty; and each file should have at least\nthe \"copyright\" line and a pointer to where the full notice is found.\n\n \n Copyright (C) \n\n This program is free software: you can redistribute it and/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see .\n\nAlso add information on how to contact you by electronic and paper mail.\n\n If the program does terminal interaction, make it output a short\nnotice like this when it starts in an interactive mode:\n\n Copyright (C) \n This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n This is free software, and you are welcome to redistribute it\n under certain conditions; type `show c' for details.\n\nThe hypothetical commands `show w' and `show c' should show the appropriate\nparts of the General Public License. Of course, your program's commands\nmight be different; for a GUI interface, you would use an \"about box\".\n\n You should also get your employer (if you work as a programmer) or school,\nif any, to sign a \"copyright disclaimer\" for the program, if necessary.\nFor more information on this, and how to apply and follow the GNU GPL, see\n.\n\n The GNU General Public License does not permit incorporating your program\ninto proprietary programs. If your program is a subroutine library, you\nmay consider it more useful to permit linking proprietary applications with\nthe library. If this is what you want to do, use the GNU Lesser General\nPublic License instead of this License. But first, please read\n.\n" }, { "path": "INSTALL", "content": "Copyright 1994, 1995, 1996, 1999, 2000, 2001, 2002 Free Software\nFoundation, Inc.\n\n This file is free documentation; the Free Software Foundation gives\nunlimited permission to copy, distribute and modify it.\n\nBasic Installation\n==================\n\n These are generic installation instructions.\n\n The `configure' shell script attempts to guess correct values for\nvarious system-dependent variables used during compilation. It uses\nthose values to create a `Makefile' in each directory of the package.\nIt may also create one or more `.h' files containing system-dependent\ndefinitions. Finally, it creates a shell script `config.status' that\nyou can run in the future to recreate the current configuration, and a\nfile `config.log' containing compiler output (useful mainly for\ndebugging `configure').\n\n It can also use an optional file (typically called `config.cache'\nand enabled with `--cache-file=config.cache' or simply `-C') that saves\nthe results of its tests to speed up reconfiguring. (Caching is\ndisabled by default to prevent problems with accidental use of stale\ncache files.)\n\n If you need to do unusual things to compile the package, please try\nto figure out how `configure' could check whether to do them, and mail\ndiffs or instructions to the address given in the `README' so they can\nbe considered for the next release. If you are using the cache, and at\nsome point `config.cache' contains results you don't want to keep, you\nmay remove or edit it.\n\n The file `configure.ac' (or `configure.in') is used to create\n`configure' by a program called `autoconf'. You only need\n`configure.ac' if you want to change it or regenerate `configure' using\na newer version of `autoconf'.\n\nThe simplest way to compile this package is:\n\n 1. `cd' to the directory containing the package's source code and type\n `./configure' to configure the package for your system. If you're\n using `csh' on an old version of System V, you might need to type\n `sh ./configure' instead to prevent `csh' from trying to execute\n `configure' itself.\n\n Running `configure' takes awhile. While running, it prints some\n messages telling which features it is checking for.\n\n 2. Type `make' to compile the package.\n\n 3. Optionally, type `make check' to run any self-tests that come with\n the package.\n\n 4. Type `make install' to install the programs and any data files and\n documentation.\n\n 5. You can remove the program binaries and object files from the\n source code directory by typing `make clean'. To also remove the\n files that `configure' created (so you can compile the package for\n a different kind of computer), type `make distclean'. There is\n also a `make maintainer-clean' target, but that is intended mainly\n for the package's developers. If you use it, you may have to get\n all sorts of other programs in order to regenerate files that came\n with the distribution.\n\nCompilers and Options\n=====================\n\n Some systems require unusual options for compilation or linking that\nthe `configure' script does not know about. Run `./configure --help'\nfor details on some of the pertinent environment variables.\n\n You can give `configure' initial values for configuration parameters\nby setting variables in the command line or in the environment. Here\nis an example:\n\n ./configure CC=c89 CFLAGS=-O2 LIBS=-lposix\n\n *Note Defining Variables::, for more details.\n\nCompiling For Multiple Architectures\n====================================\n\n You can compile the package for more than one kind of computer at the\nsame time, by placing the object files for each architecture in their\nown directory. To do this, you must use a version of `make' that\nsupports the `VPATH' variable, such as GNU `make'. `cd' to the\ndirectory where you want the object files and executables to go and run\nthe `configure' script. `configure' automatically checks for the\nsource code in the directory that `configure' is in and in `..'.\n\n If you have to use a `make' that does not support the `VPATH'\nvariable, you have to compile the package for one architecture at a\ntime in the source code directory. After you have installed the\npackage for one architecture, use `make distclean' before reconfiguring\nfor another architecture.\n\nInstallation Names\n==================\n\n By default, `make install' will install the package's files in\n`/usr/local/bin', `/usr/local/man', etc. You can specify an\ninstallation prefix other than `/usr/local' by giving `configure' the\noption `--prefix=PATH'.\n\n You can specify separate installation prefixes for\narchitecture-specific files and architecture-independent files. If you\ngive `configure' the option `--exec-prefix=PATH', the package will use\nPATH as the prefix for installing programs and libraries.\nDocumentation and other data files will still use the regular prefix.\n\n In addition, if you use an unusual directory layout you can give\noptions like `--bindir=PATH' to specify different values for particular\nkinds of files. Run `configure --help' for a list of the directories\nyou can set and what kinds of files go in them.\n\n If the package supports it, you can cause programs to be installed\nwith an extra prefix or suffix on their names by giving `configure' the\noption `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.\n\nOptional Features\n=================\n\n Some packages pay attention to `--enable-FEATURE' options to\n`configure', where FEATURE indicates an optional part of the package.\nThey may also pay attention to `--with-PACKAGE' options, where PACKAGE\nis something like `gnu-as' or `x' (for the X Window System). The\n`README' should mention any `--enable-' and `--with-' options that the\npackage recognizes.\n\n For packages that use the X Window System, `configure' can usually\nfind the X include and library files automatically, but if it doesn't,\nyou can use the `configure' options `--x-includes=DIR' and\n`--x-libraries=DIR' to specify their locations.\n\nSpecifying the System Type\n==========================\n\n There may be some features `configure' cannot figure out\nautomatically, but needs to determine by the type of machine the package\nwill run on. Usually, assuming the package is built to be run on the\n_same_ architectures, `configure' can figure that out, but if it prints\na message saying it cannot guess the machine type, give it the\n`--build=TYPE' option. TYPE can either be a short name for the system\ntype, such as `sun4', or a canonical name which has the form:\n\n CPU-COMPANY-SYSTEM\n\nwhere SYSTEM can have one of these forms:\n\n OS KERNEL-OS\n\n See the file `config.sub' for the possible values of each field. If\n`config.sub' isn't included in this package, then this package doesn't\nneed to know the machine type.\n\n If you are _building_ compiler tools for cross-compiling, you should\nuse the `--target=TYPE' option to select the type of system they will\nproduce code for.\n\n If you want to _use_ a cross compiler, that generates code for a\nplatform different from the build platform, you should specify the\n\"host\" platform (i.e., that on which the generated programs will\neventually be run) with `--host=TYPE'.\n\nSharing Defaults\n================\n\n If you want to set default values for `configure' scripts to share,\nyou can create a site shell script called `config.site' that gives\ndefault values for variables like `CC', `cache_file', and `prefix'.\n`configure' looks for `PREFIX/share/config.site' if it exists, then\n`PREFIX/etc/config.site' if it exists. Or, you can set the\n`CONFIG_SITE' environment variable to the location of the site script.\nA warning: not all `configure' scripts look for a site script.\n\nDefining Variables\n==================\n\n Variables not defined in a site shell script can be set in the\nenvironment passed to `configure'. However, some packages may run\nconfigure again during the build, and the customized values of these\nvariables may be lost. In order to avoid this problem, you should set\nthem in the `configure' command line, using `VAR=value'. For example:\n\n ./configure CC=/usr/local2/bin/gcc\n\nwill cause the specified gcc to be used as the C compiler (unless it is\noverridden in the site shell script).\n\n`configure' Invocation\n======================\n\n `configure' recognizes the following options to control how it\noperates.\n\n`--help'\n`-h'\n Print a summary of the options to `configure', and exit.\n\n`--version'\n`-V'\n Print the version of Autoconf used to generate the `configure'\n script, and exit.\n\n`--cache-file=FILE'\n Enable the cache: use and save the results of the tests in FILE,\n traditionally `config.cache'. FILE defaults to `/dev/null' to\n disable caching.\n\n`--config-cache'\n`-C'\n Alias for `--cache-file=config.cache'.\n\n`--quiet'\n`--silent'\n`-q'\n Do not print messages saying which checks are being made. To\n suppress all normal output, redirect it to `/dev/null' (any error\n messages will still be shown).\n\n`--srcdir=DIR'\n Look for the package's source code in directory DIR. Usually\n `configure' can determine that directory automatically.\n\n`configure' also accepts some other, not widely useful, options. Run\n`configure --help' for more details.\n\n" }, { "path": "Makefile.am", "content": "## This file is part of dvisvgm\n## Copyright (C) 2005-2025 Martin Gieseking \n##\n## Process this file with automake.\n\ninclude $(top_srcdir)/aminclude_static.am\n\nAUTOMAKE_OPTIONS = foreign\nEXTRA_DIST = COPYING\nSUBDIRS = libs src\nif !TEXLIVE_BUILD\nSUBDIRS += tests doc\nendif\nACLOCAL_AMFLAGS = -I m4\n\nif USE_BUNDLED_LIBS\nAM_DISTCHECK_CONFIGURE_FLAGS = --enable-bundled-libs\nendif\n\nif CODE_COVERAGE_ENABLED\nlcov_dir=$(top_builddir)/lcov\nlcov_file=$(lcov_dir)/lcov.info\n\nlcov-report:\n\t@mkdir -p $(lcov_dir)\n\tlcov --capture --directory . --no-external -o $(lcov_file)\n\tgenhtml --title \"dvisvgm\" --num-spaces 2 --legend -o $(lcov_dir) $(lcov_file)\n\nlcov-clean:\n\t@rm -rf $(lcov_dir)\n\t@find . -name \"*.gcda\" -exec rm {} \\;\n\tlcov --zerocounters --directory .\n\ncoverage: lcov-clean check lcov-report\nendif\n" }, { "path": "NEWS", "content": "dvisvgm-3.6 (2025-12-08)\n- removed the restriction to process PDF-1.x files only (GH issue #291)\n- option --page: added evaluation of %P which expands to the maximum page\n number. Also, %(expr) is supported to evaluate arithmetic expressions,\n like %(P-1)\n- option --page: page numbers greater than the maximum page number are no\n longer replaced by the maximum page number but ignored\n- PDF handler: extended computation of opacity values (GH issue #292)\n- fixed lookup of character code 0 in character maps (GH issue #294)\n- fixed height and depth values shown when processing data created by\n the 'preview' package\n- updated bundled brotli library to version 1.2.0\n- some code improvements\n\ndvisvgm-3.5 (2025-05-23)\n- fonts are now embedded in deterministic order (GH issue #288)\n- different glyphs are now always assigned to different Unicode code points\n to prevent collisions (GH issue #287)\n- fixed font-related segmentation faults caused by malformed DVI files\n (GH issue #289)\n- fixed a regression that led to incorrect results produced by the\n SVG optimizer\n- DVI error messages now also mention the byte position where the\n error occurred in the DVI file\n- simplified the evaluation of PostScript operators\n- many code refactorings and improvements\n\ndvisvgm-3.4.4 (2025-03-06)\n- extended computation of Unicode points by looking for known glyph names\n- added some common glyph names not yet covered by the AGL table\n- added warning shown if unsupported PDF specials have been ignored\n- some additions to the manual page\n- several code improvements\n\ndvisvgm-3.4.3 (2025-01-04)\n- fixed index error in PS operator \"colorimage\" (GH issue #279)\n- updated bundled xxHash library to version 0.8.3\n- minor changes to the manual page\n\ndvisvgm-3.4.2 (2024-11-14)\n- fixed evaluation of Unicode data when converting PDF files (GH issue #276)\n- fixed horizontal character positioning in the PDF handler (GH issue #276)\n- fixed drawing of single-colored tensor product patches\n- use static creation and modification dates in TTF/WOFF fonts generated by\n dvisvgm in order to prevent varying SVG output for unchanged input files\n (GH issue #120)\n- small improvements of the manual page\n\ndvisvgm-3.4.1 (2024-09-16)\n- show number of page being processed when converting PDF files\n- added missing #include required as of GCC 15 (GH issue #273)\n\ndvisvgm-3.4 (2024-07-24)\n- option --embed-bitmaps is now also applied to images included with special\n dvisvgm:img\n- added macro {?cmyk(c,m,y,k)} to allow for directly specifying CMYK colors\n in literal SVG fragments\n- extended dvips color specials to distinguish between fill and stroke colors\n- added color special \"color set\" to replace the current color without pushing\n a new value onto the color stack\n- added macros {?fillcolor} and {?strokecolor} to retrieve the current fill and\n stroke color, respectively. Former macro {?color} equals {?fillcolor} and is\n still available too\n- replaced millimeter units with big point (bp) units in the message showing\n the extent of generated SVG file\n- fixed the detection of MIME types depending of file name suffixes\n- several small code improvements\n\ndvisvgm-3.3 (2024-04-10)\n- added file dvisvgm.map to the default font map files being looked up\n- added evaluation of #include and #includefirst present in font map files\n- changed conversion of CMYK colors to RGB so that the resulting colors are\n now similar to those created by Ghostscript and several PDF viewers\n- fixed invalid bounding boxes assigned when converting multiple DVI pages\n (GH issue #268)\n- fixed computation of internal Coons tensor points\n- updated bundled Google Test to version 1.12.1\n\ndvisvgm-3.2.2 (2024-03-07)\n- fixed the extraction of bitmaps from PS/EPS files that no longer worked\n since Ghostscript 10.02.1 due to the removal of GS-specific operators\n (GH issue #264)\n- minor automake updates required for TeX Live builds\n\ndvisvgm-3.2.1 (2024-02-29)\n- delayed loading of Ghostscript library to speed up the conversion of\n DVI files\twithout PS specials (GH issue #262)\n- some improvements required for TeX Live builds\n (patches by Karl Berry, GH issues #259, #260)\n- added more details to some DVI warning messages\n- added some further information to the manual page\n\ndvisvgm-3.2 (2024-01-11)\n- PDF handler: fixed a rounding issue that could lead to slightly bigger\n text extents (GH issue #256)\n- added macros {?pageno}, {?svgfile}, and {?svgpath} to the dvisvgm special\n commands\n- added separate verbosity flag 8 for user messages printed by special\n dvisvgm:message\n- added command-line option --message to allow for printing user messages\n after writing an SVG file (GH issue #258)\n- applied upstream patch regarding undefined type punning to the bundled\n woff2 library\n- few improvements of the manual page\n\ndvisvgm-3.1.2 (2023-10-12)\n- improved evaluation of graphic extents created by the 'preview' package\n (GH issue #246)\n- fixed computation of character boxes when using --exact-bbox (GH issue #248)\n- fixed memory error in optimizer module (GH issue #250)\n- updated bundled brotli library to version 1.1.0\n\ndvisvgm-3.1.1 (2023-08-29)\n- added evaluation of optional dash prefixes to command-line option --optimize\n to exclude selected optimizer modules\n- fixed invalid removal of clipping paths referenced in 'defs' section\n- fixed automatic calls of optimizer module 'remove-clippaths'\n- suppress Ghostscript warning about deprecated option -dNEWPDF (GH issue #245)\n- updated bundled xxHash library to version 0.8.2\n- few fixes in the manual page\n\ndvisvgm-3.1 (2023-07-06)\n- added command-line option --currentcolor to replace a given color with\n CSS variable 'currentColor' (GH issue #214)\n- added special dvisvgm:currentcolor to replace the currently active color\n with CSS variable 'currentColor' (GH issue #214)\n- added special 'dvisvgm:message' to print given texts to the console\n- added support for Omega Font Metric (OFM) files\n- added fallback mechanism for missing characters in OFM-based virtual fonts\n proposed by Takuji Tanaka (GH issue #241)\n- fixed handling of whitespace in PDF file paths (GH issue #233)\n- fixed vertical placement of \"vertical fonts\" in horizontal mode\n (GH issue #235)\n- fixed parsing of floating point numbers occurred with libc++ (GH issue #240)\n- fixed potential segmentation faults triggered by missing font files\n (GH issue #241)\n- fixed GLIBCXX assertion error in new PDF handler (GH issue #242)\n- improved handling of font subset prefixes in new, mutool-based PDF handler\n (GH issue #242)\n- several minor code improvements\n\ndvisvgm-3.0.4 (2023-03-10)\n- fixed issue that could prevent reading the output of subprocesses\n (GH issue #232)\n- removed optional dependency on libcrypto (OpenSSL) because the MD5 functions\n have been deprecated (always using the bundled MD5 function now)\n- added TeX Live conditionals to the build system (patch by Karl Berry)\n- small code and manual page improvements\n\ndvisvgm-3.0.3 (2023-02-21)\n- fixed resetting of character contexts (GH issue #227)\n- added missing #includes required for GCC 13\n\ndvisvgm-3.0.2 (2023-01-30)\n- fixed computation of font sizes in new PDF handler (GH issue #220)\n- fixed viewBox coordinates determined by new PDF handler (GH issue #223)\n- improved detection of font names used in PDF files (GH issue #224)\n- minor code improvements\n\ndvisvgm-3.0.1 (2023-01-10)\n- added support for the 64-bit GS library in TeX Live\n (patch sent by Akira Kakuto)\n- MacTeX: explicitly lookup libgs in /usr/local/lib (GH issue #197)\n- fixed character spacing when processing XDV glyph arrays (GH issue #198)\n- fixed invalid removal of non-redundant clipPath elements (GH issue #203)\n- fixed computation of the graphics extents printed to the console when using\n the preview package (GH issue #209)\n- several improvements of the autotool scripts (thanks to Sam James)\n- improved processing of fonts when using the new PDF handler\n\ndvisvgm-3.0 (2022-10-16)\n- added a new PDF handler based on mutool to keep the PDF functionality\n available which can no longer be realized with Ghostscript 10.1.0 due to\n the replacement of its PostScript-based PDF interpreter\n- replaced the bundled minimal Fontforge library (ff-woff) with a dedicated,\n newly implemented library for embedding TTF/WOFF data into the SVG files\n- added option --embed-bitmaps to embed bitmaps into the generated SVG files\n instead of referencing the external files\n- extended option --tmpdir to optionally suppress the creation of uniquely\n named subfolders\n- added filters :even and :odd to option --page to limit the given page ranges\n to even and odd page numbers respectively\n- fixed the call of ttfautohint to prevent potential memory errors\n\ndvisvgm-2.14 (2022-08-12)\n- added processing of SVG path elements inserted by \"raw\" specials in order to\n treat them similar to generated ones\n- added support for native font references lacking a file name suffix\n- improved lookup of native fonts\n- improved the removal of redundant SVG group elements\n- fixed conversion of empty glyphs to TTF/WOFF\n- updated bundled WOFF2 library\n\ndvisvgm-2.13.4 (2022-04-20)\n- fixed the size of bounding boxes applied when converting multiple pages\n (GH issue #182)\n- try to enable old PDF interpreter when using Ghostscript >= 9.56.0\n (dvisvgm does not work with Ghostscript's new PDF interpreter)\n\ndvisvgm-2.13.3 (2022-02-27)\n- added SVG optimizer module 'reassign-clippaths' that searches for duplicate\n clipPath elements, removes them, and updates the clip-path references\n- replaced method to clip embedded EPS/PDF graphics that usually results in\n faster rendering of the affected SVG sections\n- fixed a regression regarding transformations of embedded EPS/PDF graphics\n\ndvisvgm-2.13.2 (2022-02-23)\n- improved clipping of embedded EPS/PDF graphics (GH issue #176)\n\ndvisvgm-2.13.1 (2022-01-26)\n- added evaluation of expression {?(...)} to special dvisvgm:rawdef\n- fixed regression regarding positioning of PDF graphics (GH issue #174)\n- fixed some build issues\n\ndvisvgm-2.13 (2022-01-20)\n- allow for conversion of multiple EPS files given on the command-line\n- added variables n and N to option --output representing the current file\n number and total number of files given on the command-line, respectively\n- fixed selection of hash algorithm\n- improved computation of glyph height and depth\n- extended several paragraphs of the manual page with more detailed information\n- SVG optimizer: simplify transform attributes also when collapsing groups\n- updated bundled xxHash library to version 0.8.1\n- updated bundled gtest to version 1.11\n\ndvisvgm-2.12 (2021-08-16)\n- added transparency support of SVG elements created outside the PS handler\n (GH issue #148)\n- fixed spacing issue caused by unexpected newline characters in SVG output\n- fixed PS error occurred when defining (yet unsupported) PS shading patterns\n- fixed issue in color handling of PS tiling patterns (GH issue #158)\n- fixed displaced graphics occurred if PDF MediaBox is not located at the origin\n- fixed handling of root directories of file paths\n- improved handling of drive letters (Windows only)\n- several code refactorings and improvements\n\ndvisvgm-2.11.1 (2021-01-21)\n- fixed possible ambiguity of GID to charcode mappings (GH issue #147)\n- refactored representation of token objects in calculator class\n- few minor code and test improvements\n\ndvisvgm-2.11 (2020-11-28)\n- added fallback mechanism for JFM-based virtual fonts proposed\n by Takuji Tanaka (GH issue #144)\n- improved detection of proper CMap files for current encoding\n- fixed processing of Unicode surrogates present in CMap files\n- fixed handling of pdf:mapline and pdf:mapfile specials\n\ndvisvgm-2.10.1 (2020-09-22)\n- added support for new Ghostscript transparency operators\n .setfillconstantalpha and .setstrokeconstantalpha\n- added support for new Ghostscript versioning scheme introduced with GS 9.53.0\n- added few additional information to the manual page\n- updated bundled brotli library to version 1.0.9\n\ndvisvgm-2.10 (2020-08-12)\n- added evaluation of LuaTeX native font definitions\n- added computation of of italic correction for fake slanted glyphs\n- dvisvgm now creates dedicated temporary folders for each call of\n the program to prevent file collisions between different processes\n- added evaluation of internal GS operators '.fillstroke' and '.eofillstroke'\n introduced with GS 9.52 to implement PDF operators 'B' and 'B*'\n (GH issue #139)\n- fixed and improved optimization of nested group elements\n- fixed optimization of 'scale' transformation\n- fixed optimization of 'transform' attributes applied to images clipping paths\n- fixed processing of PS operator 'eoclip'\n- fixed processing of clipping path intersections with different\n fill rule properties\n- fixed processing of {?(...)} expressions (GH issue #136)\n- fixed error message about unmatched closing tags in XML parser\n- updated bundled FreeType library to version 2.10.2\n- updated bundled xxHash library to version 0.8\n\ndvisvgm-2.9.1 (2020-03-21)\n- added macro {?(expr)} to enable the evaluation of math expressions in\n raw SVG fragments (GH #130)\n- multiplication operator \"*\" preceding an opening parentheses can now be\n omitted in math expressions\n- fixed the evaluation of transformation command \"scale(c)\" which is now\n correctly treated as \"scale(c, c)\" (GH #131)\n- minor layout optimizations of the PDF manual page\n\ndvisvgm-2.9 (2020-03-13)\n- added processing of PS operators 'image' and 'colorimage' to embed bitmaps\n present in PS/PDF data into the generated SVG\n- added command-line option --bitmap-format to set the format used to embed\n bitmaps present in EPS/PDF files\n- added fallback method to retrieve the resolution of GF files if stdout\n of the Metafont subprocess can't be read through a pipe (GH #129)\n- fixed broken conversion of PS tiling patterns\n- fixed the functionality of PS operators 'xshow', 'yshow', and 'xyshow' for\n multibyte characters\n- fixed a PS error triggered by unsupported shading types < 4\n- prevent negative 'height' and 'width' attributes created by optimizer\n module 'simplify-transform'\n- fixed potential segfault caused by deep recursion in huge SVG trees\n- look for Ghostscript library name 'libgs.dylib.N' additionally to\n 'libgs.N.dylib' (Mac only)\n- ensure that 'make install' installs the bundled manual page if it can't be\n rebuilt due to missing build tools\n- updated bundled xxHash library to version 0.7.3\n\ndvisvgm-2.8.2 (2019-12-07)\n- if available, call 'mf-nowin' instead of 'mf' to process Metafont files\n (GH #121)\n- fixed handling of null device in PS operator 'restore' (GH #122)\n- fixed PS error triggered by backslashes in file paths (GH #123)\n- fixed build issue related to GCC on Solaris 11\n- some code cleanup\n\ndvisvgm-2.8.1 (2019-11-14)\n- added SVG optimizer module 'simplify-text'\n- added support for PS operator 'nulldevice'\n- copy absolute paths from special 'psfile' unchanged to the SVG file\n- some code refactorings\n\ndvisvgm-2.8 (2019-10-25)\n- added support for JPEG, PNG, PDF, and SVG files to special 'psfile'\n- added support for Ghostscript 9.50\n- added support for elliptical arc segments in graphics paths\n- added support for CMap operator 'begincidchar' (patch by Akira Kakuto)\n- added support for experimental 128-bit XXH3 hashes\n- extended optimizer module 'simplify-transform' to incorporate translation and\n scaling components into positional and size attributes\n- replaced CRC32 checksums used in cache files with XXH32 hashes\n- updated potrace to version 1.16\n- updated xxHash to version 0.7.2\n- updated gtest to 1.10\n- lots of code refactorings\n\ndvisvgm-2.7.4 (2019-07-28)\n- fixed memory issue occurred when calling Metafont\n- fixed rounding issue in color conversion (GH #116)\n- changed location of cache files from ~/.dvisvgm/cache to\n $XDG_CACHE_HOME/dvisvgm which usually expands to ~/.cache/dvisvgm (GH #112)\n- some minor refactorings\n\ndvisvgm-2.7.3 (2019-07-12)\n- fixed randomly missing glyph paths referenced by 'use' elements (GH #110)\n- minor update of the man page\n- some code refactorings\n\ndvisvgm-2.7.2 (2019-06-07)\n- adapted PostScript handler to incompatible changes introduced with\n Ghostscript 9.27 (removal of GS_PDF_ProcSet and pdfdict)\n\ndvisvgm-2.7.1 (2019-05-20)\n- fixed a bug in PS operator 'setmatrix' (GH #106)\n- fixed build issue reported on MacPorts\n (https://trac.macports.org/ticket/58347)\n- added source files required to access the MIKTeX session object\n (required due to deprecation of the MiKTeX SDK)\n\ndvisvgm-2.7 (2019-04-13)\n- added option --optimize to perform several optimizations on the\n generated SVG files (current optimizer modules: collapse-groups,\n group-attributes, remove-clippath, simplify-transform) (GH #97)\n- dvisvgm's \"raw\" specials are now parsed and converted to proper XML nodes\n- several improvements to SVG graphics path descriptions:\n * omit redundant spaces and leading zeros\n * omit line commands representing zero-length lines\n * improved detection of reflected control points in Bézier curve sequences\n- added evaluation of PS operators xshow, yshow, and xyshow\n- added evaluation of psfile/pdffile attribute 'clip' to clip the\n drawing region to the bounding box of the image being processed (GH #104)\n- added specials 'dvisvgm:bbox lock' and 'dvisvgm:bbox unlock' to disable and\n enable updating the bounding box of the current page (GH #105)\n- added optional modifier 'transform' to dvisvgm:bbox specials to allow for\n applying the current transformation to the bounding box\n- added macro '{?matrix}' to dvisvgm's 'raw' specials that expands to the\n current transformation matrix\n- renamed option --exact to --exact-bbox (backward compatible change)\n- updated the bundled xxHash library to version 0.7.0\n- lots of code refactorings\n\ndvisvgm-2.6.3 (2019-03-09)\n- create short RGB hex values for color attributes if possible\n- fixed rejection of paper formats, like A4, by option --bbox\n- fixed incomplete adaption of vertical orientation when processing\n EPS/PDF files\n- fixed handling of backslashes in EPS/PDF file paths (Windows only)\n- updated bundled Google Test library to version 1.8.1\n- some code refactorings and improvements of the build system\n\ndvisvgm-2.6.2 (2019-01-23)\n- fixed scaling of line properties in PS operator 'grestore'\n- fixed handling of PS operators 'charpath' and 'show' which may\n call each other internally\n- improved processing of PS operator 'clippath'\n- prevent visible side-effects of PS operator 'stringwidth'\n- updated bundled brotli library to version 1.0.7\n- some modifications of the build system to simplify maintenance in TeX Live\n\ndvisvgm-2.6.1 (2018-10-12)\n- added configuration option --disable-manpage to prevent generating\n the manual page (GH issue #93)\n- if configuration option --disable-bundled-libs is given and some of the\n required system libraries are missing, the corresponding bundled library\n is used as a fallback (GH issue #94)\n- updated bundled brotli library to version 1.0.6\n- fixed build issue occurred with GCC 4.8\n\ndvisvgm-2.6 (2018-09-08)\n- added option --page-hashes that allows for skipping the conversion of\n a page if its content hasn't changed\n- relaxed plausibility check of total page count stated in the postamble\n (this value overflows if the DVI file contains more than 65535 pages)\n- added validity checks for bop (begin of page) offsets present in the\n bop and post commands\n- some refactorings and minor improvements\n\ndvisvgm-2.5 (2018-08-08)\n- added multi-page support (option --page) to PDF mode (option --pdf)\n- added evaluation of transformation options in PDF mode\n- added support for all length units to option --transform\n- TeX Live Win32: look for Ghostscript DLL in the TL folders as well\n (thanks to Akira Kakuto for sending the patch)\n- potrace has been added again to the bundled third-party libraries\n- instead of linking the bundled libraries brotli, potrace, woff2, and\n xxhash, the configure script now looks for the corresponding system\n libraries by default\n- added option --enable-bundled-libs to the configure script to build and\n statically link the bundled libraries\n- some refactorings\n\ndvisvgm-2.4.2 (2018-07-18)\n- fixed height and depth values computed when using the preview package\n- removed additional borders from the bounding boxes of hyperlinked areas\n- prevent warnings if special \"psfile\" is called with argument \"/dev/null\"\n (e.g. option \"psfixbb\" of the preview package adds such specials)\n- \"make install\" no longer fails if the manpage can't be built\n\ndvisvgm-2.4.1 (2018-07-07)\n- fixed handling of delay parameter of option --progress\n- updated brotli library to version 1.0.5\n- updated woff2 library to version 1.0.2\n- updated URLs in manual page\n- several minor code refactorings\n\ndvisvgm-2.4 (2018-05-03)\n- added special 'pdffile' similar to 'psfile' to embed PDF graphics\n- added option --pdf to convert single-page PDF documents to SVG\n- reassigned short option -P from --progress to --pdf\n- added option --stdin to receive input from stdin\n- option --stdout can now be combined with option --zip\n- added processing of GS operators '.setshapealpha' and '.setblendmode'\n- fixed outer transformations applied to psfile specials\n- fixed computation of bounding boxes triggered by psfile specials\n- several code refactorings\n\ndvisvgm-2.3.5 (2018-03-23)\n- added evaluation of PS operator 'setpagedevice' in psfile specials\n- fixed evaluation of dvips color names\n- fixed warning printed when using Ghostscript 9.23\n\ndvisvgm-2.3.4 (2018-03-14)\n- fixed error message printed when adding a single '-' on the command-line\n- added missing data file that lead to failing tests (GH bug #87)\n- updated brotli library to version 1.0.3\n- some code refactorings\n\ndvisvgm-2.3.3 (2018-02-20)\n- fixed wrong behavior when requiring both default mapfiles and\n pdf:mapline or pdf:mapfile specials\n- fixed an exception thrown in case of unavailable fonts\n\ndvisvgm-2.3.2 (2018-02-08)\n- prevent the creation of redundant tspan elements\n- added support for new JFM format (patch by Hironobu Yamashita)\n- fixed build error occurred if GS development files were missing\n- fixed a potential memory issue regarding option --cache\n\ndvisvgm-2.3.1 (2018-01-12)\n- fixed the width of characters slanted by a mapfile entry (GH bug #82)\n- if ttfautohint fails for a font, dvisvgm now uses the unhinted font and\n prints a corresponding warning message\n- some code cleanup\n\ndvisvgm-2.3 (2017-12-28)\n- added experimental support for ttfautohint\n- updated xxHash to version 0.6.4\n- added configuration option to set location of libkpathsea (GH bug #71)\n- some improvements of the build system\n\ndvisvgm-2.2.3 (2017-12-12)\n- updated the bundled brotli library to version 1.0.2\n- fixed a potential memory issue\n- some code and test improvements\n\ndvisvgm-2.2.2 (2017-11-17)\n- fixed memory issue regarding font maps (GH bug #79)\n- avoid scientific notation of floating point numbers\n- minor code improvements\n\ndvisvgm-2.2.1 (2017-11-13)\n- fixed portability issue when building the manpage (GH bug #72)\n- fixed incomplete computation of PS line width (GH bug #77)\n- further code refactorings\n\ndvisvgm-2.2 (2017-10-19)\n- added evaluation of pdf:pagesize specials\n- added evaluation of PDF hyperlink specials\n- try to load Ghostscript dylib on Mac systems (patch by Toby Fleming, GH bug #66)\n- improved TPIC special handler, added evaluation of 'tx' special\n- length values in dvisvgm specials now accept unit specifiers\n- added pdftex.map to default mapfiles\n- fixed potential infinite loop after starting subprocesses (GH bug #68)\n- files included with psfile are now also searched in the texmf tree if not\n present in the current working directory (GH bug #69)\n- fixed transformation issue in computation of psfile position (GH bug #70)\n- updated bundled brotli, woff2, and xxhash libraries\n- several code refactorings and improvements\n\ndvisvgm-2.1.3 (2017-02-20)\n- fixed build failures of libfontforge on Solaris 10\n- increased code portablity\n\ndvisvgm-2.1.2 (2017-02-12)\n- bundled the googletest sources to simplify building and executing the tests\n- fixed a couple of issues related to LLVM's libc++\n (thanks to Mojca Miklavec and Rasmus Larsen for their help to isolate the problems)\n- fixed some potential memory leaks\n- removed 'restrict' keyword from xxHash sources to avoid C++ compilation errors\n (https://github.com/Cyan4973/xxHash/issues/88)\n\ndvisvgm-2.1.1 (2017-02-07)\n- don't rerun Metafont for missing fonts\n- fixed build failure on OS X (GH bug #65)\n- several minor code improvements and test enhancements\n\ndvisvgm-2.1 (2017-01-19)\n- added option --tmpdir to explicitly set temp folder\n- temporary files are no longer created in the current working directory by\n default but in the system's temp folder (GH bug #63)\n- added warning/error messages if temporary files could not be written\n- fixed collision of Unicode points in AGL table (GH bug #64)\n- retain letter case of filenames even if not significant (Windows only)\n- code refactorings and cleanup\n\ndvisvgm-2.0.4 (2016-11-16)\n- bundled reduced FontForge library (ff-woff) with the sources\n- minor fixes in manpage and --help texts\n- few code improvements\n\ndvisvgm-2.0.3 (2016-09-27)\n- fixed a regression in the character positioning of virtual fonts\n- fixed positioning of rules\n\ndvisvgm-2.0.2 (2016-09-19)\n- fixed computation of the character depths of native fonts\n- fixed a regression in the computation of DVI positions (GH bug #61)\n\ndvisvgm-2.0.1 (2016-09-03)\n- added optional argument parameter \"autohint\" to option --font-format in order\n to create autohinted TTF, WOFF, or WOFF2 fonts\n\ndvisvgm-2.0 (2016-08-29)\n- added option --font-format to select the data format of embedded fonts\n (currently supported formats: SVG, TTF, WOFF, WOFF2)\n- switched the code base from C++03 to C++11\n- reimplemented the command-line parser and the CommandLine class generator\n- major refactorings of several parts of the code\n\ndvisvgm-1.16 (2016-07-04)\n- added support for XDV version 7 introduced by XeTeX 0.99995\n- added optional processing of papersize specials\n- added support for length units cc, dd, and sp\n- fixed unit conversion in computation of bounding boxes\n- fixed propagation of resolution value to the glyph vectorizer\n- fixed transformation of background rectangle\n- prevent processing of corrupted GF files\n- major refactorings of the DVI reader and the SVG backend\n\ndvisvgm-1.15.1 (2016-04-19)\n- added explicit encoding attribute to the XML declaration again (GH bug #54)\n- added support for AGL character names of the form 'uFOO' and 'uniFOO'\n- fixed parsing of transformation parameters given on the command-line\n- minor code and test improvements\n\ndvisvgm-1.15 (2016-02-27)\n- added option --comments to add additional information to the SVG file\n- fixed a clipping bug in the PostScript handler\n- some code improvements and refactorings\n- moved test data files to a separate folder\n\ndvisvgm-1.14.2 (2016-01-20)\n- fixed handling of background color specials (now they affect all succeeding pages until the next change)\n- fixed a potential memory issue caused by accessing an invalid iterator\n- updated xxHash to version 0.5.0\n- added xxHash to the output of --version=1\n- minor additions to the manpage\n- added test case to validate the hash values used in Unicode.cpp\n\ndvisvgm-1.14.1 (2016-01-05)\n- fixed an issue in the PostScript handler that could lead to invalid SVG files\n if multiple DVI pages were converted\n- added checks for invalid GF files to prevent undefined behavior\n\ndvisvgm-1.14 (2015-12-28)\n- added evaluation of PSTricks specials 'pst:' and 'PST:'\n- the bounding box data created by the preview package is now adapted to create a tight box by default\n- added option --bbox=preview to apply the unmodified bounding box data created by the preview package\n- improved lookup of files located in the current working directory\n- fixed a memory issue related to graphics paths\n- improved extraction of kapathsea version number\n- minor code and test improvements\n\ndvisvgm-1.13 (2015-12-08)\n- added evaluation of PS operators 'ashow', 'awidthshow', and 'widthshow' (GH bug #49)\n- improved conversion of fonts referenced by PS code to graphics paths\n- redundant 'moveto' commands are now removed from paths\n- fixed issue concerning evaluation of PS operator 'setcolor'\n- fixed output of PS error messages\n- updated bundled xxHash library to revision 42\n- minor code refactorings and cleanup\n\ndvisvgm-1.12 (2015-11-18)\n- added option --colornames to replace RGB values by SVG color names\n- fixed resolving of character codes for fonts without supported chracater maps\n- fixed a memory issue that could occur when calling Metafont\n\ndvisvgm-1.11 (2015-09-21)\n- improved mapping of unknown characters to Unicode\n- improved handling of text elements in conjunction with \\specials (patch by Till Tantau)\n- fixed an issue that could lead to (invalid) U+0000 codepoints\n- prevent creating invalid XML by quoting xlink:title attributes properly\n- documentation: updated links to new website address\n\ndvisvgm-1.10 (2015-07-15)\n- added support for the new XDV format 6 created by XeTeX 0.99992\n- improved mapping of PostScript character names to Unicode points\n\ndvisvgm-1.9.2 (2015-04-08)\n- avoid retracing of fonts if option --no-fonts and --trace-all=y are given\n- skip tracer messages if no glyphs have been traced\n- extended the build system to generate code coverage reports\n- improved some tests of the test suite\n- some general code refactorings and improvements\n\ndvisvgm-1.9.1 (2015-02-28)\n- extended --output pattern syntax by arithmetic expressions and width specifiers\n- improved formatting of manpage\n- fixed Clang build issue (patch by Peter Breitenlohner)\n- fixed a build issue occurred with old MinGW compilers\n- code cleanup and refactorings\n\ndvisvgm-1.9 (2014-12-29)\n- added partial implementation of PostScript operator 'shfill' to create color\n gradient fills (supported shading types: free-form triangular, lattice-form\n triangular, Coons, and tensor-product patch meshes)\n- added options --grad-segments, --grad-overlap, and --grad-simplify to control\n the approximation of color gradients\n- added option --no-merge to create separate text elements for each character\n (patch by Khaled Hosny)\n- added a simple progress counter to the EPS to SVG converter\n- added opt2cpp.py as a free replacement for my non-free opt2cpp.xsl script\n (thanks to Khaled Hosny for the implementation and for providing it for free)\n- added lookup of Ghostscript library in the Windows registry\n- fixed validity check of DVI files\n- fixed interaction of color specials and PostScript color operators\n- several code refactorings and improvements\n\ndvisvgm-1.8.1 (2014-08-29)\n- unreferenced clipPath elements are now removed from the SVG files\n- fixed side-effects caused by unexpected bop/eop operators in\n PS specials (LP bug #1350688)\n- few improvements to configure.ac (patches by Khaled Hosny)\n- removed redundant code\n\ndvisvgm-1.8 (2014-07-29)\n- added option --clipjoin which tells dvisvgm to compute intersections\n of clipping paths itself and not to delegate this task to the SVG renderer\n- added option --relative to create relative rather than absolute path commands\n- added evaluation of PS operator 'clippath' which copies the current clipping\n path into the graphics path\n- fixed PS operator 'show' to prevent the creation of unintended path overlays\n- fixed memory leak in class FontEngine (patch by Khaled Hosny)\n- fixed unintended throwing of a DVIException when dvisvgm is called with\n option --list-specials\n- Cygwin builds of dvisvgm now look for the proper filename of the Ghostscript DLL\n\ndvisvgm-1.7 (2014-06-18)\n- all DVI files are pre-processed now to allow the implementation of\n advanced features that rely on data not available on the pages being\n converted\n- added support for internal hyperref links across pages\n- added \\special command dvisvgm:rawdef to insert raw SVG fragments to\n the section\n- added the new \\special commands dvisvgm:rawset, dvisvgm:endrawset, and\n dvisvgm:rawput to assign and access a sequence of SVG fragments via an\n identifier (LP feature request #1215878)\n- removed redundant elements from SVG files\n- fixed support of external fonts containing characters not mapped by the\n embedded unicode tables (LP bug #1276689)\n- fixed incorrect extent values shown in conjunction with the preview package\n- many refactorings and code improvements\n\ndvisvgm-1.6 (2014-04-22)\n- added option --zoom to \"visually\" scale the generated SVG graphics while\n preserving the original size and position values of the graphic objects\n- extended argument syntax of option --linkmark to allow to select the\n box/line color\n- changed default link marker from 'line' to 'box'\n- changed link markers to be only split on line breaks while extended in all\n other cases\n- if libgs is not directly linked to the binary, dvisvgm now looks for\n libgs.so.X instead of libgs.so (supported GS ABIs: X = 7, 8, 9)\n- removed time stamp and machine triplet from generated SVG files\n- some code improvements and refactorings\n\ndvisvgm-1.5.3 (2014-04-11)\n- improved positioning of PostScript graphics\n- fixed positioning of DVI rules/rectangles\n- switched internal computations from TeX points (pt) to PostScript points (bp)\n\ndvisvgm-1.5.2 (2014-01-10)\n- fixed handling of global font colors and color specials\n- several code improvements\n\ndvisvgm-1.5.1 (2013-10-29)\n- fixed processing of bounding box data created by the preview package\n- fixed processing of font definitions across DVI pages\n- fixed compilation issues occurred if processing of PS specials is disabled\n- don't print the logical page number if it's equal to the physical one\n- some minor code improvements\n\ndvisvgm-1.5 (2013-09-02)\n- added support for DVI format 3 as created by pTeX in vertical/tate mode\n- added support for DVI format 5 (XDV) as created by XeTeX\n- replaced numeric entity references by corresponding UTF-8 characters in\n generated SVG files\n- added px unit to font-size attributes as used in the stylesheet section\n to ensure correct computation of font sizes (LP bug #1215857)\n- various code refactorings\n\ndvisvgm-1.4 (2013-08-02)\n- added basic support for CMap files and CID-based fonts\n- added character mapping from CIDs to char codes based on the encoding tables of a non-CID font\n- added support for OTF fonts\n- added evaluation of bounding box data generated by the preview package\n- extended option --linkmark to mark hyperlinked areas with an arbitrary background color\n- PS handler: improved evaluation of PS header specials\n- PS handler: improved evaluation of operator 'show'\n- removed DOCTYPE declaration from generated SVG files\n- removed encoding attribute from xml declaration (replaces ISO-8859-1 with UTF-8)\n- various code improvements and refactorings\n\ndvisvgm-1.3 (2013-05-13)\n- added support for hyperref specials\n- added command-line option --linkmarker to select the way how to mark hyperlinked areas\n- dvisvgm builds for MiKTeX now try to access the Ghostscript DLL provided by MiKTeX so that\n it's no longer necessary to install Ghostscript separately\n- improved the handling of TFM files to avoid failures in case of malformed files\n- added evaluation of Japanese Font Metric (JFM) files\n- the bundled potrace library has been removed from the source tarball as it's easy to build\n the latest releases from the original sources available at http://potrace.sourceforge.net\n- several code refactorings\n\ndvisvgm-1.2.2 (2013-04-26)\n- fixed a bug that prevented the lookup of fontmap files\n- avoid throwing an exception but print a warning message if MiKTeX is not available\n- print a warning message if PostScript specials are found but ignored\n- added information about \"dvisvgm -E\" to the --help text and to the manpage\n- various code refactorings and cleanups\n\ndvisvgm-1.2.1 (2013-04-09)\n- updated bundled potrace library to version 1.11\n- avoid building bundled potracelib if system library is present (patch by Alexis Ballier)\n- allow background color specials to create white background rectangles\n- code refactorings and cleanup\n\ndvisvgm-1.2 (2013-03-01)\n- PostScript handler: added support of tiling patterns\n- PostScript handler: added support for EPS files with binary headers/footers\n- added option --eps to directly convert EPS files to SVG\n- added option --precision to select the number of decimal places used in the generated SVG files\n- added an optional argument to --help to choose a display variant\n- fixed the text alignment of the --help output\n- improved handling of PostScript operator \"show\"\n- choose the correct output location if the input file argument contains path specifiers (Windows only)\n\ndvisvgm-1.1 (2013-01-22)\n- added evaluation of pdf:mapline and pdf:mapfile specials\n- added evaluation of subfont file definitions (.sfd files)\n- added support for TTC (TrueType collection) fonts\n- added evaluation of font style parameters given in a font map definition\n- renamed option --map-file to --fontmap\n- the new option --fontmap allows multiple mapfile arguments and optional mode specifiers\n- if a PostScript error occurs, dvisvgm prints an error message together with the\n PS operand stack, as generated by Ghostscript\n- if font checksums don't match, dvisvgm prints a warning now\n- avoid throwing exceptions if referenced encoding files are not available\n- added support for 64bit Windows builds\n- removed compilation error when using a C++11 compiler (patch by Peter Breitenlohner)\n- some code refactorings and improvements\n\ndvisvgm-1.0.12 (2012-09-27)\n- print a message if the processing of PostScript specials is disabled\n- the resulting SVG is now scaled to bp (\"big point\" units) properly\n- added the evaluation of PS operators rectclip, rectfill, and rectstroke\n- ignore dvips operator bop if present in a PS special\n- fixed processing of special strings that contain newline characters\n\ndvisvgm-1.0.11 (2012-03-09)\n- added Ghostscript to library list printed by --version=yes\n- fixed a bug in the number parser that could lead to displaced objects (SF bug #3471097)\n- corrected the computation of bounding boxes of DVI rules (lp bug #948713)\n- improved code compatibility to make dvisvgm compile with clang++ (patch by Vladimir Lomov)\n- fixed formatting issues in the manual page\n- updated information about bug reporting (tracker moved to Launchpad)\n\ndvisvgm-1.0.10 (2011-12-18)\n- introduced environment variable DVISVGM_COLORS to allow user-defined message colors\n- fixed linking issue concerning libfreetype\n- fixed potential clashes of character IDs\n\ndvisvgm-1.0.9 (2011-10-13)\n- fixed segfault occurred in TeX Live Win32 caused by mf.exe being unavailable\n (thanks to Akira Kakuto for tracking down the issue)\n- updated bundled potrace library to version 1.10\n- some minor code improvements\n\ndvisvgm-1.0.8 (2011-05-31)\n- PS handler: added evaluation of PS operators save, restore, and grestoreall\n- PS handler: fixed potential segfault caused by invisible zero-length paths\n- fixed computation of current drawing position influenced by PS and DVI actions\n- don't stop Metafont conversions on errors any longer in order to convert\n buggy MF fonts properly\n\ndvisvgm-1.0.7 (2011-05-06)\n- improved overall handling of PS specials\n- fixed broken PS special subset 'ps::'\n- fixed scaling of PS line properties (width, dash distance, etc.)\n- fixed semantics of TPIC special 'ip' (doesn't draw polygon outlines any longer)\n\ndvisvgm-1.0.6 (2011-04-21)\n- fixed segfault occurred if a (malformed) DVI file calls set_char/put_char\n without preceding font definition\n- added CTRL-C handler\n- MiKTeX support updated to version 2.9\n- some code refactorings\n\ndvisvgm-1.0.5 (2011-03-01)\n- added optional integer argument to option -n to disable generation of elements\n- added missing unit to width/height attributes of svg root element (SF bug #3185773)\n- added integrity check to font cache files\n- updated bundled potrace library to version 1.9\n- fixed a couple of minor issues\n\ndvisvgm-1.0.4 (2010-12-18)\n- added missing line width/dash pattern scaling to PS handler\n- fixed scaling issue in PS positioning\n- fixed compilation issue related to FreeType 2.4.0\n\ndvisvgm-1.0.3 (2010-08-06)\n- applied some more portability patches for TeX Live\n- fixed a potential memory issue\n- fixed a transformation issue regarding special 'psfile' (SF bug #3037372)\n\ndvisvgm-1.0.2 (2010-06-22)\n- applied latest TeX Live portability patches sent by Peter Breitenlohner and Karl Berry\n- fixed a potrace name clash occurred on Mac OS X Tiger\n- fixed putchar() name clash occurred on Solaris\n- fixed a couple of conversion warnings\n- updated the test suite\n\ndvisvgm-1.0.1 (2010-06-11)\n- fixed a memory issue in the PS handler that could lead to a segfault (SF bug #3013392)\n- fixed a recursion issue in the PS handler\n- suppress ANSI color code when terminating\n\ndvisvgm-1.0 (2010-06-08)\n- conversion of multiple pages (must be enabled explicitly, see option --pages)\n- added transparency support to the PS handler\n- improved conversion results of the PS handler\n- added support for computation of local bounding boxes\n- optional colorization of dvisvgm messages (option --color)\n- improved progress indicator (option --progress)\n- a couple of improvements of the build system\n\ndvisvgm-0.9.1 (2010-04-23)\n- CSS style definitions omit unnecessary fonts now\n- SVG validity was broken when using font elements\n- fixed two memory issues that could lead to segfaults\n\ndvisvgm-0.9 (2010-03-25)\n- added option --exact and corresponding algorithms to compute the exact\n bounding boxes of characters\n- added option --keep that prevents deleting temporary font files\n- extended option --trace-all by an optional boolean argument controlling\n the re-tracing of glyphs\n- fixed bug in evaluation of embedded PS headers\n- several code refactorings\n\ndvisvgm-0.8.8 (2010-02-02)\n- added option --libgs and evaluation of environment variable LIBGS\n to overwrite the expected file name of the GS shared library\n (only available if dvisvgm isn't linked against libgs and GS support\n isn't completely disabled)\n- option --bbox can now be used to enlarge the minimal bounding box by\n a given amount\n- fixed bug in evaluation of option --page\n- applied patches sent by Peter Breitenlohner to prepare the integration of\n dvisvgm into TeX Live\n- some code refactorings\n\ndvisvgm-0.8.7 (2009-11-09)\n- fixed a bounding box issue concerning italic corrections\n- PS handler: zero-length paths are now drawn as dots\n- PS handler: fixed a path positioning issue\n- PS handler: colors set by color specials are now considered properly\n- added macro {?nl} to be used with special dvisvgm:raw\n\ndvisvgm-0.8.6 (2009-10-13)\n- renamed command-line option --bbox-format to --bbox\n- option --bbox can now be used to set an arbitrary bounding box\n- added the two special variants \"dvisvgm:bbox abs\" and \"dvisvgm:bbox fix\"\n- PS clipping path sequences and intersections are now handled correctly\n- fixed a PS bounding box bug\n- fixed a couple of PS positioning issues reported by John Bowman\n- fixed a bit shift overflow in the font tracer occurred on 64-bit systems\n\ndvisvgm-0.8.5 (2009-10-01)\n- added an optional depth parameter to special dvisvgm:raw\n- updated the man page\n- added LGPL license text needed for the gzstream wrapper classes\n\ndvisvgm-0.8.4 (2009-09-17)\n- improved the command-line parser to be more POSIX-compliant\n- added a simple progress indicator for time-consuming special operations\n- option --cache prints more information about the cached fonts\n- fixed a clipping bug in the PostScript handler\n (thanks to John Bowman for also providing a patch for this issue)\n- fixed a bug in computation of the PS bounding box\n- fixed a memory bug in the GF tracer module\n\ndvisvgm-0.8.3 (2009-08-28)\n- added basic evaluation of the PostScript \"show\" operator\n (handles PSTricks Type 3 fonts properly now)\n- improved checks for Ghostscript and potrace library in configure script\n- external Ghostscript and potrace development files are used if available\n- PostScript header/prologue files are now loaded regardless of converted page\n- replaced command-line option variant --cache=? by --cache\n\ndvisvgm-0.8.2 (2009-08-24)\n- changed license of dvisvgm to GPL version 3 or later\n- replaced getopt-based command-line parser by own implementation\n in order to simplify future internationalizations\n- fixed memory bug in fontmap reader\n\ndvisvgm-0.8.1 (2009-08-02)\n- added evaluation of more psfile parameters\n- fixed computation of bounding box in psfile special\n- fixed compilation errors and a conversion bug occurred on x64 systems\n\ndvisvgm-0.8 (2009-07-27)\n- experimental evaluation of PostScript specials has been added (requires\n a recent version of the Ghostscript shared library libgs.so or gsdll32.dll)\n- several code improvements and refactorings\n- fixed compilation bug occurred when using GCC 4.4.x\n\ndvisvgm-0.7.3 (2009-04-24)\n- fixed bug in font map reader that could cause a segmentation fault\n- fixed bug in creation of shorthand path drawing commands\n- fixed bug in TPIC special handler\n\ndvisvgm-0.7.2 (2009-04-02)\n- font caching has been added (speeds up embedding of bitmap fonts)\n- added option --trace-all that enables tracing of all glyphs of all\n bitmap fonts used in the current DVI file. Even glyphs that are currently\n not needed are considered. This avoids multiple calls of Metafont for the\n same fonts. In combination with the new caching functionality this can\n drastically increase the speed of successive dvisvgm calls.\n- if option --no-fonts is used, all glyph sizes are now computed correctly\n- use shorthand path commands in SVG fonts if possible\n\ndvisvgm-0.7.1 (2009-03-09)\n- evaluation of a subset of emTeX specials has been added\n- specials for embedding of raw SVG snippets have been added\n- evaluation of TPIC specials has been added\n- added background color support\n- added option -n, --no-fonts that replaces fonts by paths\n (enables applications w/o SVG font support to render dvisvgm's output properly)\n- moved defs to top of SVG file to make Firefox's SVG renderer happy\n- fixed bug in color handler\n\ndvisvgm-0.7 (2009-02-16)\n- basic support for evaluation of specials has been added\n- evaluation of color specials has been added\n- renamed command-line option -S to --no-specials and inverted previous behavior\n- selected special sets can be disabled by optional arguments to --no-specials\n (currently only color specials)\n- added option --no-style (see manpage for further details)\n- added optional '+' flag to option --map-file (see manpage for further details)\n- fixed \\magnificaton bug (dvi magnification factor is now applied properly)\n- fixed buggy call of maketfm/makemf in Windows/MiKTeX version\n- fixed buggy evaluation of command-line argument -m/--map-file\n- several internal code improvements\n\ndvisvgm-0.6.1 (2009-01-29)\n- added support for dvips map files\n- removed dependency on dvipdfm's map file (now ps2pk.map, psfonts.map or dvipdfm.map is used by default)\n- fixed compilation bug #2535497\n- some internal refactorings\n\ndvisvgm-0.6 (2009-01-23)\n- added support for varying font encodings\n- updated MiKTeX support using its COM interface\n- fixed incomplete handling of nested virtual fonts\n- fixed a font handling bug that could cause segmentation faults\n- fixed bug in matrix transformation code\n- updated bundled potrace library to version 1.8\n\ndvisvgm-0.5 (2007-03-26)\n- redesigned and improved font handling\n- added support for virtual fonts\n- evaluation of dvipdfm's map file to find font files with differing\n names (e.g. cork-lmr10 => lmr10)\n- automatic invocation of mktexmf etc. in case of missing font files (tfm, mf)\n- command-line option -m has been renamed to -M\n- added command-line options -m/--map-file and -n/--no-mktexmf\n- memory bug in StreamCounter class has been fixed\n- added sources of Peter Selinger's potrace library (part of potrace, https://potrace.sourceforge.net)\n to simplify the build process\n\ndvisvgm-0.4.3 (2007-01-03)\n- problem with changed freetype API (freetype version >= 2.2.1) has been fixed\n- updated MiKTeX support to version 2.5\n- minor code improvements\n- some unit tests based on CxxTest (http://cxxtest.sourceforge.net) have been added\n\ndvisvgm-0.4.2 (2005-09-22)\n- added SVG transformation options\n- some bugfixes in command line frontend and TFM handling\n- code refactorings to improve modularity and extensibility\n\ndvisvgm-0.4.1 (2005-09-02)\n- added option -b to specify the bounding box\n- added a manual page\n\ndvisvgm-0.4 (2005-08-24)\n- Added a glyph tracing module that vectorizes Metafont's bitmap output\n if no corresponding Type 1 font file is available.\n\ndvisvgm-0.3 (2005-08-10)\n- Initial public release with basic conversion functionality.\n" }, { "path": "README", "content": "dvisvgm -- A DVI to SVG converter\n\nDESCRIPTION\n\n dvisvgm is a utility for TeX/LaTeX users. It converts DVI, EPS, and\n PDF files to the XML-based scalable vector graphics format SVG.\n\n\nDEPENDENCIES\n\n dvisvgm relies on the following free libraries:\n * Clipper (https://www.angusj.com/delphi/clipper/documentation/Docs/Overview/_Body.htm)\n To compute the intersections of two curved paths, dvisvgm flattens the paths\n to polygons, intersects them using Clipper, and reconstructs the curves\n afterwards.\n\n * FreeType 2 (https://freetype.org)\n This library is used to extract the glyph outlines from vector fonts\n (PFB, OTF, TTF).\n\n * Ghostscript (https://www.ghostscript.com)\n The PostScript special handler requires the Ghostscript shared library\n libgs.so.N (Linux) or gsdll32.dll/gsdll64.dll (Windows) to be installed.\n If the configure script finds the corresponding Ghostscript development\n files on the system, it directly links against libgs.so.N, where N is the\n library's ABI version. Otherwise, the library is looked up during runtime,\n and the PostScript support is enabled only if the shared library can be\n found. Due to incompatible changes of the Ghostscript API, dvisvgm requires\n Ghostscript 8.31 or later.\n\n * kpathsea (https://tug.org/kpathsea)\n This library is part of the Web2C package and is usually installed in\n conjunction with a TeX distribution. kpathsea provides functions for\n searching files in the large texmf tree. Please ensure that you use the\n kpathsea version coming with or matching your TeX system.\n\n * potracelib (https://potrace.sourceforge.net)\n Peter Selinger's bitmap tracing library is utilized to vectorize Metafont's\n bitmap output. A recent version is also part of the dvisvgm sources.\n\n * ttfautohint (https://www.freetype.org/ttfautohint)\n dvisvgm can optionally be built with ttfautohint support to allow for\n autohinting the generated TrueType, WOFF, and WOFF2 fonts. Since this is\n still an experimental feature, ttfautohint support is disabled by default.\n The development files required for Windows can be found at\n https://github.com/mgieseki/ttfautohint-dll.\n\n * woff2 and brotli (https://github.com/google/woff2)\n These Google libraries are bundled with the dvisvgm sources. They are used\n to create WOFF2 from TrueType fonts.\n\n * xxHash (https://github.com/Cyan4973/xxHash)\n The xxHash library provides a fast hash algorithm. dvisvgm uses it to\n create unique integer values from PostScript character names in order to\n store them in a compact way together with their Unicode points. A recent\n version of xxHash is bundled with the dvisvgm sources.\n\n * zlib (https://www.zlib.net)\n This library is required to create compressed SVGZ files.\n\n\nBUILDING DVISVGM FROM SOURCE\n\n dvisvgm is written in C++11 (ISO C++ standard 2011) and requires an appropriate\n compiler, like GCC 4.9, Clang 3.3, or any later version. The configure script\n checks for the availability of C++11 support and adds the proper compiler\n options if necessary.\n\n Quick installation info:\n * ensure that the development packages of all libraries, listed above,\n are installed\n * type \"autoreconf -fi\" if \"configure\" is not present in the dvisvgm\n root folder\n * either type \"./configure\" if you don't want to use the bundled libraries\n brotli, potrace, woff2, and xxHash but link against the corresponding\n system libraries,\n or type \"./configure --enable-bundled-libs\" in order to build and\n statically link the bundled libraries.\n * type \"make\"\n * type \"make install\" as root (or \"sudo make install\")\n\n For generic configuration instructions see the file INSTALL.\n\n The configure script should recognize all necessary parameters.\n If a library is installed but not detected, specify its location\n as commandline parameter of configure, e.g.\n ./configure --with-freetype=/usr/local/freetype\n (all available options can be displayed with ./configure --help)\n\n The tracer module calls Metafont in case of lacking TFM or PFB files\n via a system call. Please ensure that Metafont is installed and\n reachable through the system's search path.\n\n If you don't like compiling the sources yourself, you can\n download pre-compiled executables for Windows and MiKTeX\n from the project website instead (see below).\n\n\nUSAGE\n Information about the command-line interface and the available options can be\n found in the manual page.\n\n\nADDITIONAL INFORMATION\n This package is available from CTAN (dviware/dvisvgm) and can be downloaded\n from the project website as well:\n\n https://dvisvgm.de\n\n Here you can find the sources, pre-compiled binaries and further additional\n information about the converter and related topics.\n\n If you've found a bug, please let me know. You can either send me an email or\n preferably use the bug tracker at GitHub (https://github.com/mgieseki/dvisvgm).\n\n\nCOPYRIGHT\n\n Copyright (C) 2005-2025 Martin Gieseking \n\n This program is free software; you can redistribute it and/or modify it\n under the terms of the GNU General Public License as published by the\n Free Software Foundation; either version 3 of the License, or (at your\n option) any later version.\n\n This program is distributed in the hope that it will be useful, but\n WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\n Public License for more details.\n\n See file COPYING for details.\n\n" }, { "path": "README.md", "content": "_dvisvgm_ – A fast DVI to SVG converter\n=============================================\n[![C/C++ CI](https://github.com/mgieseki/dvisvgm/actions/workflows/c-cpp.yml/badge.svg)](https://github.com/mgieseki/dvisvgm/actions/workflows/c-cpp.yml)\n[![Build Status](https://ci.appveyor.com/api/projects/status/0rbkw88js1on4g2u/branch/master?svg=true)](https://ci.appveyor.com/project/mgieseki/dvisvgm/branch/master)\n[![Copr Status](https://copr.fedorainfracloud.org/coprs/mgieseki/dvisvgm/package/dvisvgm/status_image/last_build.png)](https://copr.fedorainfracloud.org/coprs/mgieseki/dvisvgm/package/dvisvgm)\n[![Code Status](https://scan.coverity.com/projects/1099/badge.svg)](https://scan.coverity.com/projects/1099)\n[![License](https://img.shields.io/:license-GPL%20v3+-blue.svg)](https://www.gnu.org/licenses/gpl-3.0.en.html)\n[![Releases](https://img.shields.io/github/release/mgieseki/dvisvgm.svg)](https://github.com/mgieseki/dvisvgm/releases)\n\nDescription\n-----------\n\n_dvisvgm_ is a utility for TeX/LaTeX users. It converts\n[DVI](https://en.wikipedia.org/wiki/Device_independent_file_format),\n[EPS](https://en.wikipedia.org/wiki/Encapsulated_PostScript), and\n[PDF](https://en.wikipedia.org/wiki/PDF) files to the\nXML-based scalable vector graphics format [SVG](https://www.w3.org/TR/SVG).\nThe latest releases support standard DVI files (version 2) as well as DVI output\ncreated by [pTeX](https://ctan.org/pkg/ptex) in vertical mode (version 3),\nand [XeTeX](https://xetex.sourceforge.net) (versions 5 to 7, also known as XDV).\n\nTo get an impression of the conversion results, have a look at the\n[examples](https://dvisvgm.de/Examples) created with _dvisvgm_.\n\nShort overview of the main features:\n\n* Complete font support including [virtual fonts](https://texfaq.org/FAQ-virtualfonts), evaluation of [font encodings](https://texfaq.org/FAQ-whatenc), CMap files, sub-font definitions and font maps.\n* Glyph outlines of all required fonts are embedded into the generated SVG files.\n* The font data can be embedded in SVG, TrueType, WOFF, or WOFF2 format.\n* Glyph outlines of fonts that are not available in a vector format are generated on-the-fly by vectorizing [METAFONT](https://en.wikipedia.org/wiki/Metafont)'s bitmap output.\n* _dvisvgm_ allows to replace [font elements](https://www.w3.org/TR/SVG/fonts.html) by [paths](https://www.w3.org/TR/SVG/paths.html) so that applications without SVG font support are enabled to render dvisvgm's output properly.\n* Computes tight bounding boxes for the generated graphics, but supports common paper formats and arbitrary user-defined sizes as well.\n* Option `--eps` allows to convert [EPS](https://en.wikipedia.org/wiki/Encapsulated_PostScript) files to SVG.\n* Option `--pdf` allows to convert [PDF](https://en.wikipedia.org/wiki/PDF) documents to SVG.\n* [Intersections of clipping paths](https://dvisvgm.de/Clipping) can be computed directly instead of delegating this task to the SVG renderer which increases the compatibility of the generated SVG files.\n* Approximates PostScript [color gradient fills](https://dvisvgm.de/Gradients) not directly supported by SVG 1.1.\n* The generated SVG structure and data can be improved with the built-in [SVG optimizer](https://dvisvgm.de/Manpage/#opt-optimize).\n* Optionally creates compressed [SVGZ](https://en.wikipedia.org/wiki/Scalable_Vector_Graphics#Compression) files.\n* Provides options for applying page transformations, like translation, rotation, scaling, and skewing.\n* Evaluates several [specials](https://texfaq.org/FAQ-specials) including color, emTeX, tpic, hyperref/HyperTeX, papersize, PDF hyperlink and mapfile, as well as PostScript specials.\n* The converter was successfully tested on various Linux ([TeX Live](https://www.tug.org/texlive)) and Windows ([MiKTeX](https://www.miktex.org), TeX Live) systems.\n* _dvisvgm_ has been added to [TeX Live](https://www.tug.org/texlive), [MiKTeX](https://www.miktex.org), and [MacPorts](https://www.macports.org). It is therefore available for a wide range of operating systems.\n\n\nUsage\n-----\nFor detailed information about the command-line interface and all available\noptions of _dvisvgm_, see the [manual page](https://dvisvgm.de/Manpage).\n\n\nDependencies\n------------\n\n_dvisvgm_ relies on the following free libraries:\n\n* [Clipper](https://www.angusj.com/delphi/clipper/documentation/Docs/Overview/_Body.htm) \n To compute the intersection of two curved paths, _dvisvgm_ flattens the paths to\n polygons, intersects them using a slightly modified version of Clipper, and reconstructs\n the curves afterwards. A slightly modified version of Clipper is bundled with the sources.\n\n* [FreeType 2](https://freetype.org) \n This library is used to extract the glyph outlines from vector fonts (PFB, OTF, TTF).\n\n* [Ghostscript](https://www.ghostscript.com) \n The PostScript special handler requires the Ghostscript shared library `libgs.so.N` (Linux)\n or `gsdll32.dll`/`gsdll64.dll` (Windows) to be installed. If the configure script\n finds the corresponding Ghostscript development files on the system, it\n directly links against `libgs.so.N`, where _N_ is the library's ABI version.\n Otherwise, the library is looked up during runtime, and the PostScript support is\n enabled only if the shared library can be found. Due to incompatible changes of the\n Ghostscript API, _dvisvgm_ requires Ghostscript 8.31 or later.\n\n* [Kpathsea](https://tug.org/kpathsea) \n This library is part of the Web2C package and is usually installed in\n conjunction with a TeX distribution. Kpathsea provides functions for searching\n files in the large `texmf` tree. Please ensure that you use the kpathsea version\n coming with or matching your TeX system.\n\n* [potracelib](https://potrace.sourceforge.net) \n Peter Selinger's bitmap tracing library is utilized to vectorize Metafont's\n bitmap output. It's also bundled with the _dvisvgm_ sources.\n\n* [ttfautohint](https://www.freetype.org/ttfautohint) \n _dvisvgm_ can optionally be built with ttfautohint support to allow for autohinting the\n generated TrueType, WOFF, and WOFF2 fonts. Since this is still an experimental feature,\n ttfautohint support is disabled by default. To enable it, run `configure` with option\n `--with-ttfautohint`.\n\n* [woff2](https://github.com/google/woff2) and [brotli](https://github.com/google/brotli) \n These Google libraries are bundled with the _dvisvgm_ sources. They are used\n to create WOFF2 files from TrueType fonts.\n\n* [xxHash](https://github.com/Cyan4973/xxHash) \n The xxHash library provides a fast hash algorithm. _dvisvgm_ uses it to create\n unique integer values from PostScript character names in order to store them in\n a compact way together with their Unicode points. A recent version of xxHash is\n bundled with the _dvisvgm_ sources.\n\n* [zlib](https://www.zlib.net) \n This library is required to create compressed [SVGZ](https://en.wikipedia.org/wiki/Scalable_Vector_Graphics#Compression) files.\n\n\nBuilding dvisvgm from source\n----------------------------\n\n_dvisvgm_ is written in C++11 ([ISO C++ standard 2011](https://www.iso.org/standard/83626.html))\nand requires an appropriate compiler, like [GCC](https://gcc.gnu.org) 4.9, [Clang](https://clang.llvm.org) 3.3,\nor any later version. The configure script checks for the availability of C++11 support and\nadds the proper compiler options if necessary.\n\nQuick installation info:\n\n* ensure that the development packages of all libraries, listed above, are installed\n* type `autoreconf -fi` if `configure` is not present in the _dvisvgm_ root folder\n* either type `./configure` if you don't want to use the bundled libraries _brotli_, _potrace_, _woff2_, and _xxHash_ but link\nagainst the corresponding system libraries,\n* or type `./configure --enable-bundled-libs` in order to build and statically link the bundled libraries.\n* type `make`\n* type `make install` as root (or `sudo make install`)\n\nFor generic configuration instructions see the file INSTALL.\n\nThe configure script should recognize all necessary parameters.\nIf a library is installed but not detected, specify its location\nas command-line parameter of configure, e.g.\n`./configure --with-freetype=/usr/local/freetype`\n(all available options can be displayed with `./configure --help`)\n\nThe tracer module calls Metafont in case of lacking TFM or PFB files\nvia a system call. Please ensure that Metafont is installed and\nreachable through the system's search path.\n\nIf you don't like compiling the sources yourself, you can download\npre-compiled binaries for Windows and MiKTeX from the\n[project website](https://dvisvgm.de) instead.\n\n\nAdditional Information\n----------------------\n\nThis package is available from [CTAN](https://ctan.org/pkg/dvisvgm), and can be\ndownloaded from the [project website](https://dvisvgm.de) as well. There you find\nthe sources, [pre-compiled binaries](https://dvisvgm.de/Downloads), the\n[manual page](https://dvisvgm.de/Manpage), [FAQs](https://dvisvgm.de/FAQ) and further\ninformation about the converter and related topics.\n\nIf you've found a bug, please let me know. You can either send me an email or\npreferably use the [bug tracker at GitHub](https://github.com/mgieseki/dvisvgm/issues).\n\n\nCopyright\n---------\n\nCopyright © 2005–2025 [Martin Gieseking](mailto:martin.gieseking@uos.de)\n\nThis program is free software; you can redistribute it and/or modify it under the terms\nof the GNU General Public License as published by the Free Software Foundation; either\nversion 3 of the License, or (at your option) any later version.\n\nThis program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;\nwithout even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\nSee the [GNU General Public License](https://www.gnu.org/licenses/gpl-3.0.en.html) for more\ndetails.\n\n" }, { "path": "configure.ac", "content": "# This file is part of dvisvgm\n# Copyright (C) 2005-2025 Martin Gieseking \n#\n# Process this file with autoconf to produce a configure script.\n\nAC_PREREQ([2.69])\nAC_INIT([dvisvgm],[3.6],[martin.gieseking@uos.de])\nDATE=\"October 2025\"\nAC_CONFIG_SRCDIR(src)\nAC_CONFIG_HEADERS([config.h])\nAC_CONFIG_MACRO_DIR([m4])\nAC_CANONICAL_HOST\nAM_INIT_AUTOMAKE([subdir-objects dist-xz])\n\nAM_CONDITIONAL([TEXLIVE_BUILD], [test \"x$enable_texlive_build\" = xyes])\n\nAH_TEMPLATE([HOST_SYSTEM], [The machine triplet of the host system])\nAC_DEFINE_UNQUOTED([HOST_SYSTEM], [\"$host\"])\n\n# Checks for programs.\nAC_PROG_CC\nAC_PROG_CXX\nAX_CXX_COMPILE_STDCXX([11])\nAM_PROG_AR\nLT_INIT\n\nAC_LANG(C)\n\nAX_CHECK_COMPILE_FLAG([-Wmismatched-tags -Wno-mismatched-tags], [CXXFLAGS=\"$CXXFLAGS -Wno-mismatched-tags\"])\nAC_CHECK_HEADERS([sys/time.h sys/timeb.h xlocale.h])\nAC_HEADER_TIOCGWINSZ\n\nCPPFLAGS_SAVE=\"$CPPFLAGS\"\nCFLAGS_SAVE=\"$CFLAGS\"\nLDFLAGS_SAVE=\"$LDFLAGS\"\n\n# Check availability and usability of the kpathsea library\nAC_ARG_VAR(KPSE_CFLAGS, [C/C++ compiler flags for the kpathsea library])\nAC_ARG_VAR(KPSE_LIBS, [linker flags for the kpathsea library])\nAC_ARG_VAR(KPSE_LIBS, [])\nAC_ARG_WITH([kpathsea],\n\t[AS_HELP_STRING([--with-kpathsea=prefix], [set location of kpathsea library])],\n\t[with_kpathsea=\"$withval\"],\n\t[with_kpathsea=yes])\n\nAS_IF([test \"x$with_kpathsea\" != \"xyes\"],\n\t[KPSE_CFLAGS=\"-I$with_kpathsea/include\" KPSE_LIBS=\"-L$with_kpathsea/lib\"]\n\t[CPPFLAGS=\"$CPPFLAGS $KPSE_CFLAGS\" CFLAGS=\"$CFLAGS $KPSE_CFLAGS\" LDFLAGS=\"$LDFLAGS $KPSE_LIBS\"])\n\nAC_CHECK_HEADER([kpathsea/kpathsea.h],,\n\t[AC_MSG_ERROR([please install the kpathsea development package])])\nAC_CHECK_LIB([kpathsea], [kpse_find_file],,\n\t[AC_MSG_ERROR([libkpathsea not found, please install the corresponding package first])])\n\nAC_MSG_CHECKING([kpathsea version])\nAC_RUN_IFELSE([AC_LANG_SOURCE([#include \n\t#include \n\t#include \n\tint main() {\n\t\tFILE *f;\n\t\tf = fopen(\"kpseversion\", \"w\");\n\t\tif(!f) exit(1);\n\t\tfprintf(f, \"%s\\n\", KPSEVERSION);\n\t\tfclose(f);\n\t\texit(0);\n\t}])],\n\t[kpseversion=`cat kpseversion|sed 's/kpathsea version //'`], [kpseversion=], [kpseversion=unknown])\nAC_MSG_RESULT(\"$kpseversion\")\nrm -f kpseversion\nAS_IF([test -z \"$kpseversion\"],\n\t[AC_MSG_ERROR([Could not compile a simple kpathsea program -- check your installation])])\nAC_SUBST(KPSE_CFLAGS)\nAC_SUBST(KPSE_LIBS)\n\n# Check how to link Ghostscript\nhave_libgs=yes\nAC_CHECK_HEADER([ghostscript/iapi.h],\n\t[AC_CHECK_LIB(gs, gsapi_revision,, [have_libgs=no])],\n\t[have_libgs=no])\nAS_IF([test \"x$have_libgs\" = \"xno\"],\n\t# Ghostscript not found, check for dlopen\n\t[AC_CHECK_LIB(dl, dlopen,,\n\t\t[AC_DEFINE(DISABLE_GS, 1, [Set to 1 if PostScript support should be disabled])]\n\t\t[AC_MSG_WARN(PostScript support disabled)])])\n\n# Check for pkg-config\nPKG_PROG_PKG_CONFIG\n\n# Check for libraries.\nPKG_CHECK_MODULES([FREETYPE], [freetype2])\n\nAC_ARG_ENABLE([woff],\n\t[AS_HELP_STRING([--disable-woff], [Disable WOFF support @<:@default=no@:>@])],\n\t[],\n\t[enable_woff=yes])\nAM_CONDITIONAL([ENABLE_WOFF], [test \"x$enable_woff\" = \"xyes\"])\n\nAC_ARG_WITH([ttfautohint],\n\t[AS_HELP_STRING([--with-ttfautohint@<:@=prefix@:>@], [enable ttfautohint support (disabled by default)])],\n\t[with_ttfautohint=\"$withval\"],\n\t[with_ttfautohint=no])\n\n# Add option to enable linking of bundled libraries (brotli, potrace, woff2, xxhash).\nAC_ARG_ENABLE([bundled-libs],\n\t[AS_HELP_STRING([--enable-bundled-libs], [use bundled libraries instead of the system ones @<:@default=no@:>@])])\nAM_CONDITIONAL([USE_BUNDLED_LIBS], [test \"x$enable_bundled_libs\" = \"xyes\"])\n\n# If option --enable-bundled-libs is not given, look for system libraries of brotli, potrace, woff2, and xxhash.\nAS_IF([test \"x$enable_bundled_libs\" != \"xyes\"],\n\t[AC_CHECK_HEADER(potracelib.h,\n\t\t[AC_SEARCH_LIBS(potrace_trace, [potrace], [have_potrace=yes])])]\n\t[AC_CHECK_HEADER([xxhash.h],\n\t\t[AC_SEARCH_LIBS(XXH32, [xxhash], [have_xxhash=yes])])]\n\t[AS_IF([test \"x$enable_woff\" = \"xyes\"],\n\t\t[PKG_CHECK_MODULES(BROTLI, [libbrotlienc], [have_brotli=yes])]\n\t\t[PKG_CHECK_MODULES(WOFF2, [libwoff2enc], [have_woff2=yes])])])\nAM_CONDITIONAL(HAVE_POTRACE, [test \"x$have_potrace\" = \"xyes\"])\nAM_CONDITIONAL(HAVE_BROTLI, [test \"x$have_brotli\" = \"xyes\"])\nAM_CONDITIONAL(HAVE_WOFF2, [test \"x$have_woff2\" = \"xyes\"])\nAM_CONDITIONAL(HAVE_XXHASH, [test \"x$have_xxhash\" = \"xyes\"])\n\n# Dummy required for TL build sections in automake files\nAM_CONDITIONAL(WIN32, false)\n\nAS_IF([test \"x$enable_woff\" != \"xyes\"],\n\t[AC_DEFINE([DISABLE_WOFF], 1, [Define if WOFF support is disabled])],\n\t[AS_IF([test \"x$with_ttfautohint\" != \"xno\"],\n\t\t[AS_IF([test \"x$with_ttfautohint\" = \"xyes\"],\n\t\t\t# --with-ttfautohint without path => check via pkg-config\n\t\t\t[PKG_CHECK_MODULES([TTFAUTOHINT], [ttfautohint],,\n\t\t\t\t[AC_MSG_ERROR([can't locate ttfautohint, use \"--with-ttfautohint=path\" to specify its location])])],\n\t\t\t# --with-ttfautohint=/path/ttfautohint given\n\t\t\t[TTFAUTOHINT_CFLAGS=\"-I$with_ttfautohint/include\"]\n\t\t\t[TTFAUTOHINT_LIBS=\"-L$with_ttfautohint/lib\"])]\n\t\t[CPPFLAGS=\"$CPPFLAGS $TTFAUTOHINT_CFLAGS\" CFLAGS=\"$CFLAGS $TTFAUTOHINT_CFLAGS\" LDFLAGS=\"$LDFLAGS $TTFAUTOHINT_LIBS\"]\n\t\t[AC_CHECK_HEADERS([ttfautohint.h],, [AC_MSG_WARN([ttfautohint.h not found])])]\n\t\t[AC_CHECK_LIB([ttfautohint], [TTF_autohint],,\n\t\t\t[AC_MSG_WARN([no working ttfautohint library found])]\n\t\t\t[AC_CHECK_LIB(dl, dlopen,\n\t\t\t\t[AC_MSG_NOTICE([enabled dynamic loading of ttfautohint])],\n\t\t\t\t[AC_MSG_WARN([disabled ttfautohint support])])])]\n\t\t[AC_SUBST(TTFAUTOHINT_CFLAGS) AC_SUBST(TTFAUTOHINT_LIBS)])])\n\nAC_CHECK_LIB(z, gzopen)\n\n# Check for header files.\nAC_HEADER_DIRENT\n\nAC_CHECK_HEADERS_ONCE([libintl.h stdlib.h string.h strings.h unistd.h])\n\n# Check for typedefs, structures, and compiler characteristics.\nAC_HEADER_STDBOOL\nAC_TYPE_SIZE_T\nAC_STRUCT_TM\n\n# Check for library functions.\nAC_FUNC_STAT\nAC_CHECK_FUNCS_ONCE([ftime gettimeofday sigaction umask uselocale])\nAX_GCC_BUILTIN(__builtin_clz)\n\n# add options for selection of \"optional\" library locations\n# currently these libraries are mandatory; the --with-foo options\n# are used to specify the locations explicitly\n\nAC_ARG_WITH(zlib,\n\t[AS_HELP_STRING([--with-zlib=DIR], [set location of the zlib library])],\n\t[AS_IF([test \"x$withval\" != \"xno\"],\n\t\t[AS_IF([test \"x$withval\" != \"xyes\"], [ZLIB_DIR=$withval])]\n\t\t[AS_IF([test -n \"$ZLIB_DIR\"],\n\t\t\t[ZLIB_CFLAGS=\"-I$ZLIB_DIR -I$ZLIB_DIR/include\"]\n\t\t\t[ZLIB_LIBS=\"-L$ZLIB_DIR/lib\" -lz])])])\n\nAC_SUBST([ZLIB_CFLAGS])\nAC_SUBST([ZLIB_LIBS])\n\n# Check if the kpathsea headers are C++ safe\nAC_MSG_CHECKING([if the kpathsea headers are C++ safe])\nAC_LANG_PUSH([C++])\nAC_LINK_IFELSE([AC_LANG_PROGRAM([[#include ]],\n [[printf(\"%s\\n\", concat(\"one\", \"two\"))]])],\n [AC_MSG_RESULT([yes])],\n [AC_MSG_RESULT([no])\n AC_DEFINE([KPSE_CXX_UNSAFE], 1,\n [Define to 1 if the kpathsea headers are not C++ safe.])])\nAC_LANG_POP([C++])\n\nCPPFLAGS=\"$CPPFLAGS_SAVE\"\nCFLAGS=\"$CFLAGS_SAVE\"\nLDFLAGS=\"$LDFLAGS_SAVE\"\n\nAC_ARG_ENABLE([manpage],\n\t[AS_HELP_STRING([--disable-manpage], [disable generation of manual page @<:@default=no@:>@])])\nAS_IF([test \"x$enable_manpage\" != \"xno\"],[\n\tenable_manpage=\"no\"\n\t# Check for utilities required to build the manpage\n\tAC_CHECK_PROG(ASCIIDOC, asciidoc, yes)\n\tAS_IF([test \"x$ASCIIDOC\" = \"xyes\"], [\n\t\tAC_CHECK_PROG(XMLTO, xmlto, yes)\n\t\tAS_IF([test \"x$XMLTO\" = \"xyes\"], [\n\t\t\tAC_CHECK_PROG(XSLTPROC, xsltproc, yes)\n\t\t\tAS_IF([test \"x$XSLTPROC\" = \"xyes\"],[enable_manpage=\"yes\"])])])])\nAS_IF([test \"x$enable_manpage\" != \"xyes\"],\n\tAC_MSG_NOTICE([generation of manual page has been disabled]))\nAM_CONDITIONAL([BUILD_MANPAGE], [test \"x$enable_manpage\" = \"xyes\"])\n\nAX_CODE_COVERAGE\n\nAS_IF([ test \"$enable_code_coverage\" = \"yes\" ], [\n\t# disable optimization\n\tchangequote({,})\n\tCFLAGS=`echo $CFLAGS | sed 's/-O[1-9s]//g'`\n\tCXXFLAGS=`echo $CXXFLAGS | sed 's/-O[1-9s]//g'`\n\tchangequote([,])\n])\n\nAC_SUBST([dvisvgm_srcdir], ['$(top_srcdir)'])\nAC_SUBST(DATE)\nAC_SUBST(AM_CPPFLAGS)\nAC_SUBST(AM_LDFLAGS)\nAC_CONFIG_FILES([\n\tMakefile\n\tlibs/Makefile\n\tlibs/boost/Makefile\n\tlibs/brotli/Makefile\n\tlibs/clipper/Makefile\n\tlibs/md5/Makefile\n\tlibs/potrace/Makefile\n\tlibs/variant/Makefile\n\tlibs/woff2/Makefile\n\tlibs/xxHash/Makefile\n\tsrc/Makefile\n\tsrc/version.hpp\n\tsrc/fonts/Makefile\n\tsrc/optimizer/Makefile\n\tsrc/ttf/Makefile\n\ttests/Makefile\n\ttests/data/Makefile\n\tdoc/Makefile])\nAC_OUTPUT\n" }, { "path": "doc/Makefile.am", "content": "## This file is part of dvisvgm\n## Copyright (C) 2005-2025 Martin Gieseking \n##\n## Process this file with automake.\n\n# Don't try to install the manpage file if it can't be built due to missing utilities.\n# However, the distribution tarball should always contain a recent manpage. We ensure\n# this by adding a dist-hook rule below.\n\nman_MANS = dvisvgm.1\n\nEXTRA_DIST = $(man_MANS) \\\n\tconf-dblatex-man.xsl \\\n\tconf-dblatex-pdf.xsl \\\n\tdvisvgm.txt.in \\\n\tgenerate-dvisvgm-sty.xsl \\\n\ttweak-dblatex-pdf.xsl \\\n\ttweak-dblatex-tex.py \\\n\ttweak-db-refentry.xsl\n\nif BUILD_MANPAGE\n\nCONF_DBLATEX_MAN = $(dvisvgm_srcdir)/doc/conf-dblatex-man.xsl\nCONF_DBLATEX_PDF = $(dvisvgm_srcdir)/doc/conf-dblatex-pdf.xsl\nTWEAK_DBLATEX_PDF = $(dvisvgm_srcdir)/doc/tweak-dblatex-pdf.xsl\nTWEAK_DBLATEX_TEX = $(dvisvgm_srcdir)/doc/tweak-dblatex-tex.py\nTWEAK_DB_ARTICLE = $(dvisvgm_srcdir)/doc/tweak-db-article.xsl\nTWEAK_DB_REFENTRY = $(dvisvgm_srcdir)/doc/tweak-db-refentry.xsl\nGEN_DBLATEX_STY = $(dvisvgm_srcdir)/doc/generate-dvisvgm-sty.xsl\n\nDB_VARS = man.endnotes.list.enabled=0 man.endnotes.are.numbered=0 man.authors.section.enabled=0\n\ndvisvgm.1: dvisvgm-man.xml $(CONF_DBLATEX_MAN)\n\txmlto -m $(CONF_DBLATEX_MAN) $(addprefix --stringparam , $(DB_VARS)) man $<\n\ndvisvgm.pdf: dvisvgm-man.xml dvisvgm.sty $(CONF_DBLATEX_PDF) $(TWEAK_DBLATEX_PDF) $(TWEAK_DBLATEX_TEX)\n\tmv $< $<.tmp\n\txsltproc -o $< $(TWEAK_DBLATEX_PDF) $<.tmp\n\tdblatex -bxetex --texstyle=./dvisvgm.sty -p $(CONF_DBLATEX_PDF) -r plugin:$(basename $(TWEAK_DBLATEX_TEX)) $<\n\tmv $<.tmp $<\n\tmv $(basename $<).pdf $@\n\ndvi-pdf: dvisvgm.dvi\n\tdvipdfm $<\n\trm -f $<\n\ndvisvgm.dvi: dvisvgm.1\n\tgroff -Tdvi -mandoc ./$< >$@\n\ndvisvgm.html: dvisvgm-man.xml db2html.xsl\n\txsltproc -o $@ db2html.xsl $<\n\ndvisvgm.md: dvisvgm-man.xml db2md.xsl\n\txsltproc -o $@ db2md.xsl $<\n\ndvisvgm.epub: dvisvgm-article.xml\n\ta2x -darticle -fepub -L --icons --icons-dir=. $<\n\tmv $(basename $<).epub $@\n\n.SECONDARY: dvisvgm-article.xml dvisvgm-man.xml dvisvgm.sty\n\ndvisvgm-man.xml: dvisvgm.txt $(TWEAK_DB_REFENTRY)\n\tasciidoc -a icons -a 'iconsdir=.' -a badges -a 'revnumber=@VERSION@' --unsafe -bdocbook -dmanpage -o $@.tmp $<\n\txsltproc -o $@ $(TWEAK_DB_REFENTRY) $@.tmp\n\trm $@.tmp\n\ndvisvgm-article.xml: dvisvgm.txt $(TWEAK_DB_ARTICLE)\n\tasciidoc -a icons -a 'iconsdir=.' -a badges -a 'revnumber=@VERSION@' --unsafe -bdocbook -darticle -o $@.tmp $<\n\txsltproc -o $@ $(TWEAK_DB_ARTICLE) $@.tmp\n\trm $@.tmp\n\tsed -i \"s/{VERSION}/@VERSION@/\" $@\n\ndvisvgm.sty: dvisvgm-man.xml $(GEN_DBLATEX_STY)\n\txsltproc -o dvisvgm.sty $(GEN_DBLATEX_STY) $<\n\n.NOTPARALLEL:\ndvisvgm.txt: dvisvgm.txt.in ../configure.ac\n\tsed -e 's/@VERSION[@]/@VERSION@/g' -e 's/@PACKAGE_BUGREPORT[@]/@PACKAGE_BUGREPORT@/g' $< >$@\n\tif [ $< -nt ../configure.ac ]; \\\n\tthen touch -r $< $@; \\\n\telse touch -r ../configure.ac $@; \\\n\tfi\n\nepub: dvisvgm.epub\nhtml: dvisvgm.html\nman: dvisvgm.1\nmd: dvisvgm.md\npdf: dvisvgm.pdf\n\nendif\n\nclean:\n\trm -f dvisvgm.pdf dvisvgm.html dvisvgm.md dvisvgm-man.xml dvisvgm-article.xml dvisvgm.txt dvisvgm.sty dvisvgm.dvi dvisvgm.epub\n\ndistclean-local:\n\trm -f dvisvgm.pdf dvisvgm.html dvisvgm.md dvisvgm-man.xml dvisvgm-article.xml dvisvgm.txt dvisvgm.sty dvisvgm.dvi dvisvgm.epub dvisvgm.1\n\nif !BUILD_MANPAGE\n# Ensure that distribution tarballs always contain a recent manpage, i.e.\n# let \"make dist\" and \"make distcheck\" fail if dvisvgm.1 can't be built.\ndist-hook:\n\t@echo \"----------------------------------------------------------------\"; \\\n\techo \"manpage file dvisvgm.1 could not be built because one or more of\"; \\\n\techo \"the following utilities are missing: asciidoc, xmlto, xsltproc \"; \\\n\techo \"----------------------------------------------------------------\"; \\\n\tfalse;\nendif\n" }, { "path": "doc/conf-dblatex-man.xsl", "content": "\n\n\n\n \n \n \\fB\n \n \\fR\n \n\n \n \n \n (\\m[blue]\n \n \\m[])\n \n\n \n \n \n \n x\n \n \n\n" }, { "path": "doc/conf-dblatex-pdf.xsl", "content": "\n\n\n\n \n \\setmainfont{Source Serif 4} \n \\setsansfont{Source Sans 3} \n \\setmonofont[Scale=0.9]{Source Code Pro Medium} \n \n\n 0\n 0\n caution\n note\n \n tabular\n 0\n 1\n\n \n basicstyle=\\ttfamily\\small,backgroundcolor=\\color[gray]{0.9},columns=fullflexible,frame=single\n \n\n \n \n \n \n \n\n \n \n \n \n\n \n \n \\tableofcontents \n \n 2\n 1\n \n \n \n\n \n \n \n 2\n 1\n \n \n \n\n \n \n \\phantomsection\\pdfbookmark[3]{\n \n \n \n \n \n \n \n \n \n \n \n\n" }, { "path": "doc/dvisvgm.txt.in", "content": "//////////////////////////////////////////////////////////////////////////\n// This file is part of dvisvgm -- a fast DVI to SVG converter //\n// Copyright (C) 2005-2025 Martin Gieseking //\n// //\n// This program is free software; you can redistribute it and/or //\n// modify it under the terms of the GNU General Public License as //\n// published by the Free Software Foundation; either version 3 of //\n// the License, or (at your option) any later version. //\n// //\n// This program is distributed in the hope that it will be useful, but //\n// WITHOUT ANY WARRANTY; without even the implied warranty of //\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the //\n// GNU General Public License for more details. //\n// //\n// You should have received a copy of the GNU General Public License //\n// along with this program; if not, see . //\n//////////////////////////////////////////////////////////////////////////\n\ndvisvgm(1)\n==========\nMartin Gieseking <@PACKAGE_BUGREPORT@>\n:man source: dvisvgm\n:man version: @VERSION@\n:man manual: dvisvgm Manual\n:revdate: 2025-10-28 09:58 +0100\n\nName\n----\ndvisvgm - converts DVI, EPS, and PDF files to the XML-based SVG format\n\n\nSynopsis\n--------\n*dvisvgm* ['options'] 'file'[.dvi]\n\n*dvisvgm* --eps ['options'] 'file1'[.eps] 'file2'[.eps] ...\n\n*dvisvgm* --pdf ['options'] 'file'[.pdf]\n\n\nDescription\n-----------\nThe command-line utility *dvisvgm* converts DVI files, as generated by TeX/LaTeX, to the\nXML-based scalable vector graphics format SVG. It supports the classic DVI version 2 as\nwell as version 3 (created by pTeX in vertical mode), and the XeTeX versions 5 to 7 which are\nalso known as XDV. Besides the basic DVI commands, dvisvgm also evaluates many so-called\n'specials' which heavily extend the capabilities of the plain DVI format. For a more detailed\noverview, see section <> below.\n\nSince the current SVG standard 1.1 doesn't specify multi-page graphics, dvisvgm creates\nseparate SVG files for each DVI page. Because of compatibility reasons, only the first page\nis converted by default. In order to select a different page or arbitrary page sequences,\nuse option *-p* which is described below.\n\nSVG is a vector-based graphics format and therefore dvisvgm tries to convert the glyph outlines\nof all fonts referenced in a DVI page section to scalable path descriptions. The fastest way\nto achieve this is to extract the path information from vector-based font files available in\nPFB, TTF, or OTF format. If dvisvgm is able to find such a file, it extracts all necessary\noutline information about the glyphs from it.\n\nHowever, TeX's former main source for font descriptions is Metafont, which produces bitmap output\nin terms of GF files. That's why not all obtainable TeX fonts are available in a scalable format.\nIn these cases, dvisvgm tries to vectorize Metafont's output by tracing the glyph bitmaps.\nThe results are not as perfect as most (manually optimized) PFB or OTF counterparts, but are\nnonetheless really nice in most cases.\n\nWhen running dvisvgm without option *--no-fonts*, it creates 'font' elements (++...++)\nto embed the font data into the SVG files. Unfortunately, only few SVG renderers support these\nelements. Most web browsers and vector graphics applications don't evaluate them properly so\nthat the text components of the resulting graphics might look strange. In order to create more\ncompatible SVG files, command-line option *--no-fonts* can be given to replace the font elements\nby plain graphics paths. Most web browsers (but only few external SVG renderers) also support\nWOFF and WOFF2 fonts that can be used instead of the default SVG fonts. Option *--font-format*\noffers the functionality to change the format applied to the fonts being embedded. This, however,\nonly works when converting DVI files. Text present in PDF and PostScript files is always\nconverted to path elements.\n\n\nOptions\n-------\ndvisvgm provides a POSIX-compliant command-line interface with short and long option names.\nThey may be given before and/or after the name of the file to be converted. Also, the order of\nspecifying the options is not significant, i.e. you can add them in any order without changing\ndvisvgm's behavior. Certain options accept or require additional parameters which are directly\nappended to or separated by whitespace from a short option (e.g. +-v0+ or +-v 0+). Long options\nrequire an additional equals sign (+=+) between option name and argument but without any surrounding\nwhitespace (e.g. +--verbosity=0+). Multiple short options that don't expect further parameters can\nbe combined after a single dash (e.g. +-ejs+ rather than +-e -j -s+).\n\nLong option names may also be shortened by omitting trailing characters as long as the shortened\nname is still unambiguous. For example, option +--exact-bbox+ can be shortened to +--exact+,\n+--exa+, or +--ex+. In case of ambiguous abbreviations, dvisvgm prints an error message together\nwith all matching option names.\n\n*-b, --bbox*='fmt'::\nSets the bounding box of the generated SVG graphic to the specified format. This option only affects\nthe conversion of DVI files. SVG documents generated from PDF and PostScript always inherit the\nbounding boxes of the input files.\n+\nParameter 'fmt' takes either one of the format specifiers listed below, or a sequence of four comma-\nor whitespace-separated length values 'x1', 'y1', 'x2' and 'y2'. The latter define the absolute\ncoordinates of two diagonal corners of the bounding box. Each length value consists of a floating\npoint number and an optional length unit (pt, bp, cm, mm, in, pc, dd, cc, or sp). If the unit is\nomitted, TeX points (pt) are assumed.\n+\nIt's also possible to give only one length value 'l'. In this case, the minimal bounding box\nis computed and enlarged by adding (-'l',-'l') to the upper left and ('l','l') to the lower\nright corner.\n+\nAdditionally, dvisvgm also supports the following format specifiers:\n \n *International DIN/ISO paper sizes*;;\n A__n__, B__n__, C__n__, D__n__, where 'n' is a non-negative integer, e.g. A4 or a4 for DIN/ISO A4\n format (210mm × 297mm).\n \n *North American paper sizes*;;\n invoice, executive, legal, letter, ledger\n \n *Special bounding box sizes*;;\n[horizontal]\n *dvi* ::: page size stored in the DVI file\n *min* ::: computes the minimal/tightest bounding box\n *none* ::: no bounding box is assigned\n *papersize* ::: box sizes specified by 'papersize' specials present in the DVI file\n *preview* ::: bounding box data computed by the preview package (if present in the DVI file)\n//\n *Page orientation*;;\n The default page orientation for DIN/ISO and American paper sizes is 'portrait',\n i.e. 'width' < 'height'. Appending *-landscape* or simply *-l* to the format\n string switches to 'landscape' mode ('width' > 'height'). For symmetry reasons you can\n also explicitly add *-portrait* or *-p* to indicate the default portrait format.\n Note that these suffixes are part of the size string and not separate options. Thus,\n they must directly follow the size specifier without additional blanks.\n Furthermore, the orientation suffixes can't be used with *dvi*, *min*, and *none*.\n+\n[NOTE]\nOption *-b, --bbox* only affects the bounding box and does not transform the page content.\nHence, if you choose a landscape format, the page won't be rotated.\n+\n//\n\n//\n*-B, --bitmap-format*='fmt'::\nThis option sets the image format used to embed bitmaps that are extracted from PostScript or PDF data.\nBy default, dvisvgm embeds all bitmaps as JPEG images because it's the most compact of the two formats\nsupported by SVG. To select the alternative lossless PNG format, *--bitmap-format=png* can be used.\nThere are some more format variants dvisvgm currently supports even though +jpeg+ and +png+ should be\nsufficient in most cases. The following list gives an overview of the known format names which\ncorrespond to names of Ghostscript output devices.\n+\n--\n[horizontal]\n*none* ::: disable processing of bitmap images\n*jpeg* ::: color JPEG format\n*jpeggray* ::: grayscale JPEG format\n*png* ::: grayscale or 24-bit color PNG format depending on current color space\n*pnggray* ::: grayscale PNG format\n*pngmono* ::: black-and-white PNG format\n*pngmonod* ::: dithered black-and-white PNG format\n*png16* ::: 4-bit color PNG format\n*png256* ::: 8-bit color PNG format\n*png16m* ::: 24-bit color PNG format\n--\n+\nSince the collection of supported output devices can vary among local Ghostscript installations,\nnot all formats may be available in some environments. dvisvgm quits with a PostScript error message\nif the selected output format requires a locally unsupported output device.\n+\nThe two JPEG format specifiers accept an optional parameter to set the IJG quality level\nwhich must directly follow the format specifier separated by a colon, e.g. *--bitmap-format=jpeg:50*.\nThe quality value is an integer between 0 and 100. Higher values result in better image quality but\nlower compression rates and therefore larger files. The default quality level is 75 which is applied\nif no quality parameter is given or if it's set to 0.\n\n*-C, --cache*[='dir']::\nTo speed up the conversion process of bitmap fonts, dvisvgm saves intermediate conversion\ninformation in cache files. By default, these files are stored in +$XDG_CACHE_HOME/dvisvgm/+\nor +$HOME/.cache/dvisvgm+ if +XDG_CACHE_HOME+ is not set.\nIf you prefer a different location, use option *--cache* to overwrite the default. Furthermore,\nit is also possible to disable the font caching mechanism completely with option *--cache=none*.\nIf argument 'dir' is omitted, dvisvgm prints the path of the default cache directory together\nwith further information about the stored fonts. Additionally, outdated and corrupted cache files\nare removed.\n\n*-j, --clipjoin*::\nThis option tells dvisvgm to compute all intersections of clipping paths itself rather than\ndelegating this task to the SVG renderer. The resulting SVG files are more portable because\nsome SVG viewers don't support intersecting clipping paths which are defined by 'clipPath'\nelements containing a 'clip-path' attribute.\n\n*--color*::\nEnables colorization of messages printed during the conversion process. The colors can be\ncustomized via environment variable *DVISVGM_COLORS*. See the <>\nbelow for further information.\n\n*--colornames*::\nBy default, dvisvgm exclusively uses RGB values of the form '#RRGGBB' or '#RGB' to represent\ncolors in the SVG file. The latter is a short form for colors whose RGB components each \nconsist of two identical hex digits, e.g. +#123+ equals +#112233+.\nAccording to the SVG standard, it's also possible to use color names (like +black+ and +darkblue+)\nfor a limited number of https://www.w3.org/TR/SVG11/types.html#ColorKeywords[predefined colors].\nIn order to apply these color names rather than their RGB values, call dvisvgm with option\n*--colornames*. All colors without an SVG color name will still be represented by RGB values.\n\n*--comments*::\nAdds comments with further information about selected data to the SVG file. Currently, only\nfont elements and font CSS rules related to native fonts are annotated.\n\n*--currentcolor*[='color']::\nThis option tells dvisvgm to replace the specified color with CSS variable `currentColor` which\nholds the current foreground color set by CSS property `color`. This way an application or website\ncan change the color via CSS without the need to modify the SVG code.\n+\nThe optional argument of `--currentcolor` specifies the RGB color value to be replaced and must\nbe given as either https://www.w3.org/TR/css-color/#typedef-hex-color[six or three digit hex color value]\npreceded by character `#`, e.g. `#0000ff` or `#00f` for blue. If the optional argument is omitted, black\nis assumed.\n\n*--embed-bitmaps*::\nEmbeds the contents of bitmap files into the generated SVG files instead of adding file references.\nBecause of the base64-encoded data, the SVG files are usually much bigger but at the same time\nmore portable because they don't rely on external bitmap files.\n+\nThis option only affects bitmaps referenced in DVI/XDV files, e.g. by +\\includegraphics+ or\nspecial command +dvisvgm:img+ (see below). Bitmaps present in PostScript or PDF files are always\nembedded. Also see option *bitmap-format*.\n\n*-E, --eps*::\nIf this option is given, dvisvgm does not expect a DVI but a single or multiple EPS input files,\nand tries to convert them to SVG. In order to do so, a single 'psfile' special command is created\nand forwarded to the PostScript special handler.\nThis option is only available if dvisvgm was built with PostScript support enabled, and requires\nGhostscript to be available. See option *--libgs* for further information.\n\n*-e, --exact-bbox*::\nThis option tells dvisvgm to compute the precise bounding box of each character. By default,\nthe values stored in a font's TFM file are used to determine a glyph's extent. As these values are\nintended to implement optimal character placements and are not designed to represent the exact\ndimensions, they don't necessarily correspond with the bounds of the visual glyphs. Thus, width\nand/or height of some glyphs may be larger (or smaller) than the respective TFM values. As a result,\nthis can lead to clipped characters at the bounds of the SVG graphics. With option *--exact-bbox*\ngiven, dvisvgm analyzes the actual shape of each character and derives a usually tight bounding box.\n+\nThis option only affects the processing of DVI files. When converting EPS or PDF files, the bounding\nbox information stored in these files are used to derive the SVG bounding box.\n\n*-f, --font-format*='format'::\nSelects the file format used to embed font data into the generated SVG output when converting DVI\nor PDF files. The latter require the new mutool-based PDF handler introduced with dvisvgm 3.0 (also\nsee option *--pdf*). Option *--font-format* has no effect when converting PDF or PostScript files\nusing Ghostscript. Text fragments present in these files are then always converted to path elements.\n+\nFollowing formats are supported: +SVG+ (that's the default), +TTF+ (TrueType), +WOFF+, and +WOFF2+\n(Web Open Font Format version 1 and 2).\nBy default, dvisvgm creates unhinted fonts that might look bad on low-resolution devices. In order to\nimprove the display quality, the generated TrueType, WOFF, or WOFF2 fonts can be autohinted. The\nautohinter is enabled by appending +,autohint+ or +,ah+ to the font format,\ne.g. +--font-format=woff,autohint+ or +--fwoff,ah+. This functionality requires the\nhttps://freetype.org/ttfautohint[ttfautohint library]. If it's not available or can't be found,\ndvisvgm issues a corresponding warning message.\n+\nOption *--font-format* is only available if dvisvgm was built with WOFF support enabled.\n\n*-m, --fontmap*='filenames'::\nLoads and evaluates a single font map file or a sequence of font map files. These files are required\nto resolve font file names and encodings. dvisvgm does not provide its own map files but tries to read\navailable ones coming with dvips or dvipdfm. If option *--fontmap* is omitted, dvisvgm looks for the\ndefault map files 'dvisvgm.map', 'ps2pk.map', 'pdftex.map', 'dvipdfm.map', and 'psfonts.map' (in this order).\nOtherwise, the files given as option arguments are evaluated in the given order. Multiple filenames\nmust be separated by commas without leading and/or trailing whitespace.\n+\nBy default, redefined mappings do not replace previous ones. However, each filename can be preceded by\nan optional mode specifier (*+*, *-*, or *=*) to change this behavior:\n \n +mapfile;;\n Only those entries in the given map file that don't redefine a font mapping are applied, i.e.\n\t fonts already mapped keep untouched. That's also the default mode if no mode specifier is given.\n \n -mapfile;;\n Ensures that none of the font mappings defined in the given map file are used, i.e. previously\n defined mappings for the specified fonts are removed.\n \n =mapfile;;\n All mappings defined in the map file are applied. Previously defined settings for the same fonts\n are replaced.\n+\nIf the first filename in the filename sequence is preceded by a mode specifier, dvisvgm loads the\ndefault font map (see above) and applies the other map files afterwards. Otherwise, none of default\nmap files will be loaded automatically.\n+\nExamples: +--fontmap=myfile1.map,+myfile2.map+ loads 'myfile1.map' followed by 'myfile2.map' where all\nredefinitions of `myfile2.map` are ignored.\n+--fontmap==myfile1.map,-myfile2.map+ loads the default map file followed by 'myfile1.map' and 'myfile2.map'\nwhere all redefinitions of 'myfile1.map' replace previous entries. Afterwards, all definitions for the fonts\ngiven in 'myfile2.map' are removed from the font map tree.\n+\nFor further information about the map file formats and the mode specifiers, see the manuals of\nhttps://tug.org/texinfohtml/dvips.html[dvips] and https://ctan.org/tex-archive/dviware/dvipdfm[dvipdfm].\n+\ndvisvgm supports both the 'dvips' and the 'dvipdfm' map file formats. It extends both variants by two\ninclude statements that allow for loading other map files inside a map file. The syntax is as follows:\n+\n[listing]\n----------------------------------------------\n#include [] \n#includefirst [] \n----------------------------------------------\n+\nThey must be placed on a separate line and start at the first column of that line. Otherwise, they are ignored.\nWhile the first variant always tries to include the specified file, +#includefirst+ is only executed once, i.e.\nonce a file was successfully included by this statement, all subsequent +#includefirst+ lines are skipped.\nThis can be used to include one of several alternative files, whereby the first one found is loaded and all\nothers are ignored.\n+\nThe optional parameter '' (which can be +pass:[+]+, +-+, or +=+) determines how to integrate the data\nread from the included file into the already present mapping data. They work the same way as the mode\nspecifiers described above. If '' parameter is omitted, it defaults to +pass:[+]+.\n+\nThe following filename or file path specifies the file to include. In case of plain filenames (without path\nindicators), the files are looked up using the TeX file search functionality, i.e. files in the TeX directory\ntree can easily be added. Relative paths are relative to the location of the file containing the +#include+\nstatement. Path components must be separated by forward slashes (+/+), also on Windows systems.\n+\nExamples: +#include pdftex.map+ looks for _pdftex.map_ in the current working directory and in the\nTeX directory tree. +#include ./pdftex.map+, on the other hand, looks for _pdftex.map_ only in the\ndirectory where the including file is located.\n\n*--grad-overlap*::\nTells dvisvgm to create overlapping grid segments when approximating color gradient fills (also see\noption *--grad-segments* below). By default, adjacent segments don't overlap but only touch each other\nlike separate tiles. However, this alignment can lead to visible gaps between the segments\nbecause the background color usually influences the color at the boundary of the segments if the\nSVG renderer uses anti-aliasing to create smooth contours.\nOne way to avoid this and to create seamlessly touching color regions is to enlarge the segments so\nthat they extend into the area of their right and bottom neighbors. Since the latter are drawn on top\nof the overlapping parts, the visible size of all segments keeps unchanged. Just the former gaps\ndisappear as the background is now completely covered by the correct colors.\nCurrently, dvisvgm computes the overlapping segments separately for each patch of the mesh (a patch mesh\nmay consist of multiple patches of the same type). Therefore, there still might be visible gaps\nat the seam of two adjacent patches.\n\n*--grad-segments*='number'::\nDetermines the maximum number of segments per column and row used to approximate gradient color fills.\nSince SVG 1.1 only supports a small subset of the shading algorithms available in PostScript,\ndvisvgm approximates some of them by subdividing the area to be filled into smaller, monochromatic\nsegments. Each of these segments gets the average color of the region it covers. Thus, increasing the\nnumber of segments leads to smaller monochromatic areas and therefore a better approximation of the\nactual color gradient. As a drawback, more segments imply bigger SVG files because every segment is\nrepresented by a separate path element.\n+\nCurrently, dvisvgm supports free- and lattice-form triangular patch meshes as well as Coons and\ntensor-product patch meshes. They are approximated by subdividing the area of each patch into a\n__n__×__n__ grid of smaller segments. The maximum number of segments per column and row can be\nchanged with option *--grad-segments*.\n\n*--grad-simplify*='delta'::\nIf the size of the segments created to approximate gradient color fills falls below the given delta\nvalue, dvisvgm reduces their level of detail. For example, Bézier curves are replaced by straight\nlines, and triangular segments are combined to tetragons. For a small 'delta', these simplifications\nare usually not noticeable but reduce the size of the generated SVG files significantly.\n\n*-h, --help*[='mode']::\nPrints a short summary of all available command-line options. The optional 'mode' parameter is\nan integer value between 0 and 2. It selects the display variant of the help text. Mode 0\nlists all options divided into categories with section headers. This is also the default if\ndvisvgm is called without parameters. Mode 1 lists all options ordered by the short option names,\nwhile mode 2 sorts the lines by the long option names.\n+\nA values in brackets after the description text indicate the default parameter of the option. They\nare applied if an option with a mandatory parameter is not used or if an optional parameter is omitted.\nFor example, option *--bbox* requires a size parameter which defaults to +min+ if *--bbox* is not\nused. Option *--zip*, which isn't applied by default, accepts an optional compression level parameter.\nIf it's omitted, the stated default value 9 is used.\n\n*--keep*::\nDisables the removal of temporary files as created by Metafont (usually .gf, .tfm, and .log files) or\nthe TrueType/WOFF module.\n\n*--libgs*='path'::\nThis option is only available if the Ghostscript library is not directly linked to dvisvgm and if\nPostScript support was not completely disabled during compilation. In this case, dvisvgm tries\nto load the shared GS library dynamically during runtime. By default, it expects the library's name\nto be +libgs.so.X+ (on Unix-like systems, where +X+ is the ABI version of the library) or\n+gsdll32.dll+/+gsdll64.dll+ (Windows). If dvisvgm doesn't find the library, option *--libgs* can be\nused to specify the correct path and filename, e.g. +--libgs=/usr/local/lib/libgs.so.9+ or\n+--libgs=\\gs\\gs9.25\\bin\\gsdll64.dll+.\n+\nAlternatively, it's also possible to assign the path to environment variable *LIBGS*, e.g.\n+export LIBGS=/usr/local/lib/libgs.so.9+ or +set LIBGS=\\gs\\gs9.25\\bin\\gsdll63.dll+. *LIBGS* has\nless precedence than the command-line option, i.e. dvisvgm ignores variable *LIBGS* if *--libgs*\nis given.\n\n*-L, --linkmark*='style'::\nSelects the method how to mark hyperlinked areas. The 'style' argument can take one of the values\n'none', 'box', and 'line', where 'box' is the default, i.e. a rectangle is drawn around\nthe linked region if option *--linkmark* is omitted. Style argument 'line' just draws the lower edge of\nthe bounding rectangle, and 'none' tells dvisvgm not to add any visible objects to hyperlinks.\nThe lines and boxes get the current text color selected. In order to apply a different, constant color,\na colon followed by a color specifier can be appended to the style string. A 'color specifier' is either\na hexadecimal RGB value of the form '#RRGGBB', or a\nhttps://en.wikibooks.org/wiki/LaTeX/Colors#The_68_standard_colors_known_to_dvips[dvips color name].\n+\nMoreover, argument 'style' can take a single color specifier to highlight the linked region by\na frameless box filled with that color. An optional second color specifier separated by a colon\nselects the frame color.\n+\nExamples: +box:red+ or +box:#ff0000+ draws red boxes around the linked areas. +yellow:blue+ creates\nyellow filled rectangles with blue frames.\n\n*-l, --list-specials*::\nPrints a list of registered special handlers and exits. Each handler processes a set of special\nstatements belonging to the same category. In most cases, these categories are identified by the\nprefix of the special statements which is usually a leading string followed by a colon or a blank,\ne.g. 'color' or 'ps'. The listed handler names, however, don't need to match these prefixes, e.g.\nif there is no common prefix or if functionality is split into separate handlers in order to allow\nthem to be disabled separately using option *--no-specials*. All special statements not covered by\none of the special handlers are silently ignored.\n\n*-M, --mag*='factor'::\nSets the magnification factor applied in conjunction with Metafont calls prior tracing the glyphs.\nThe larger this value, the better the tracing results. Nevertheless, large magnification values\ncan cause Metafont arithmetic errors due to number overflows. So, use this option with care.\nThe default setting usually produces nice results.\n\n*--message*='text'::\nPrints a given message to the console after an SVG file has been written. Argument 'text' may consist\nof static text as well as the macros listed below in the description of special command +dvisvgm:raw+.\nFor example, +--message=\"page {?pageno} written to {?svgfile}\"+ prints the message with the macros\nexpanded after the conversion of each page of a DVI or PDF file or after processing an EPS file.\n+\nThe output of option *--message* is not affected by a specified verbosity level, i.e. dvisvgm prints\nthe text even with +--verbosity=0+.\n\n*--no-merge*::\nPuts every single character in a separate 'text' element with corresponding 'x' and 'y' attributes.\nBy default, new 'text' or 'tspan' elements are only created if a string starts at a location that\ndiffers from the regular position defined by the characters' advance values.\n\n*--no-mktexmf*::\nSuppresses the generation of missing font files. If dvisvgm can't find a font file\nthrough the kpathsea lookup mechanism, it calls the external tools 'mktextfm' or 'mktexmf'.\nThis option disables these calls.\n\n*-n, --no-fonts*[='variant']::\nIf this option is given, dvisvgm doesn't create SVG 'font' elements but uses 'paths' instead. The\nresulting SVG files tend to be larger but are concurrently more compatible with most applications that\ndon't support SVG fonts. The optional argument 'variant' selects the method how to substitute fonts\nby paths. Variant 0 creates 'path' and 'use' elements in order to avoid lengthy duplicates.\nVariant 1 creates 'path' elements only.\nOption *--no-fonts* implies *--no-styles*.\n\n*-c, --scale*='sx'[,'sy']::\nScales the page content horizontally by 'sx' and vertically by 'sy'. This option is equivalent\nto *-TS*'sx','sy'.\n\n*-S, --no-specials*[='names']::\nDisable processing of special commands embedded in the DVI file. If no further parameter is given,\nall specials are ignored. To disable a selected set of specials, an optional comma-separated list\nof names can be appended to this option. A 'name' is the unique identifier referencing the intended\nspecial handler as listed by option *--list-specials*.\n\n*--no-styles*::\nBy default, dvisvgm creates CSS styles and class attributes to reference fonts. This variant is\nmore compact than adding the complete font information to each text element over and over again.\nHowever, if you prefer direct font references, the default behavior can be disabled with\noption *--no-styles*.\n\n*-O, --optimize*[='modules']::\nApplies several optimizations on the generated SVG tree to reduce the file size. The optimizations\nare performed by running separate optimizer modules specified by optional argument 'modules'.\nIt may consist of a single module name or a comma-separated list of several module names.\nThe corresponding modules are executed one by one in the given order and thus transform the\nXML tree gradually.\nA leading hyphen (+-+) can be used to exclude a module from processing. For example\n+-Oall,-collapse-groups+ performs all optimizations except +collapse-groups+. If the first\nmodule name in the list starts with a hyphen, dvisvgm automatically inserts +all+ at the\nbeginning, i.e. +-O-collapse-groups+ is identical to +-Oall,-collapse-groups+.\n+\nThe following list describes the currently available optimizer modules.\n\n *list*;;\n Lists all available optimizer modules and exits.\n\n *none*;;\n If this argument is given, dvisvgm doesn't apply any optimization. *none* can't be combined\n with other module names.\n\n *all*;;\n Performs all optimizations listed below. This is also the default if option *--optimize* is\n used without any arguments. The modules are executed in a predefined order that usually leads\n to the best results. *all* must be the only or the first entry in the list of module names.\n\n *collapse-groups*;;\n Combines nested group elements (++...++) that contain only a single attribute each. If possible,\n the group attributes are moved to the outermost element of the processed subtree. This module also\n unwraps group elements that have no attributes at all.\n\n *group-attributes*;;\n Creates groups (++...++) for common attributes around adjacent elements. Each attribute is\n moved to a separate group so that multiple common attributes lead to nested groups. They can be\n combined by applying optimizer module 'collapse-groups' afterwards. The algorithm only takes\n inheritable properties, such as +fill+ or +stroke-width+, into account and only removes them from\n an element if none of the other attributes, like +id+, prevents this.\n\n *reassign-clippaths*;;\n Collects all +clipPath+ elements that differ only by their IDs. Afterwards, the duplicates are\n removed so that only one remains. All +clip-path+ attributes referencing one of the duplicates\n are updated accordingly.\n\n *remove-clippaths*;;\n Removes all redundant 'clipPath' elements. This optimization was already present in former versions\n of dvisvgm and was always applied by default. This behavior is retained, i.e. dvisvgm executes\n this module even if option *--optimize* is not given. You can use argument 'none' to prevent that.\n\n *simplify-text*;;\n If a +text+ element only contains whitespace nodes and +tspan+ elements, all common inheritable\n attributes of the latter are moved to the enclosing text element. All +tspan+ elements without\n further attributes are unwrapped, i.e. the +tspan+ tags are removed.\n\n *simplify-transform*;;\n Tries to shorten all 'transform' attributes. This module combines the transformation commands of\n each attribute and decomposes the resulting transformation matrix into a sequence of basic\n transformations, i.e. translation, scaling, rotation, and skewing. If this sequence is shorter\n than the equivalent 'matrix' expression, it's assigned to the attribute. Otherwise, the matrix\n expression is used.\n\n*-o, --output*='pattern'::\nSets the pattern that determines the names of the generated SVG files, optionally including the file\npath. The required parameter 'pattern' may consist of an arbitrary sequence of characters which make\nup the filenames or file paths relative to the current working directory. With the exception of the\nfollowing mentioned variables and expressions, all characters are treated as static parts of the\nfilenames/folders and are therefore identical for all pages processed during a run of dvisvgm.\nThe strings +%f+, +%p+, +%P+, +%n+, +%N+, +%hd+, +%ho+, and +%hc+ are variables that can be used as\npart of the pattern. +%f+ expands to the base name of the DVI file, i.e. the filename without suffix,\n+%p+ is the current page number, and +%P+ the total number of pages in the DVI file. The variables\n+%n+ and +%N+ expand to the number of the current file being converted (starting at 1) and the total\nnumber of files given, respectively.\n+\nAn optional number (0-9) specified directly after the percent sign of a variable holding a numeric\nvalue denotes the minimal number of digits to be created. If a particular value consists of less\ndigits, the number is padded with leading zeros.\nExample: +%3p+ enforces 3 digits for the current page number (001, 002, etc.). Without an explicit\nwidth specifier, +%p+ gets the same number of digits as +%P+.\n+\nIf you need more control over the numbering, you can use arithmetic expressions as part of the pattern.\nThe syntax is +%(+'expr'+)+ where 'expr' may contain additions, subtractions, multiplications, and\ninteger divisions with common precedence. The variables *p* and *P* contain the current page number\nand the total number of pages, respectively. For example, +--output=\"%f-%(p-1)\"+ creates filenames\nwhere the numbering starts with 0 rather than 1.\n+\nThe variables +%hX+ contain different hash values computed from the DVI page data and the options\ngiven on the command-line. +%hd+ and +%hc+ are only set if option *--page-hashes* is present.\nOtherwise, they are empty. For further information, see the description of option *--page-hashes*\nbelow.\n+\nThe default pattern is +%f-%p.svg+ if the DVI file consists of more than one page, and\n+%f.svg+ otherwise. That means, a DVI file 'foo.dvi' is converted to 'foo.svg' if 'foo.dvi'\nis a single-page document. Otherwise, multiple SVG files 'foo-01.svg', 'foo-02.svg', etc. are\nproduced. In Windows environments, the percent sign indicates dereferenced environment\nvariables, and must therefore be protected by a second percent sign, e.g. +--output=%%f-%%p+.\n\n*-p, --page*='ranges'::\nThis option selects the pages to be processed. Parameter 'ranges' consists of a comma-separated\nlist of single page numbers and/or page ranges. A page range is a pair of numbers separated by\na hyphen, e.g. 5-12. Thus, a page sequence might look like this: 2-4,6,9-12,15. It doesn't matter\nif a page is given more than once or if page ranges overlap. dvisvgm always extracts the page\nnumbers in ascending order and converts them only once.\n+\nIn order to stay compatible with previous versions, the default page sequence is +1+. dvisvgm\ntherefore converts only the first page and not the whole document if option *--page* is omitted.\nUsually, page ranges consist of two numbers denoting the first and last page to be converted.\nIf the conversion should start at page 1, or if it should continue up to the last DVI page, the\nfirst or second range number can be omitted, respectively. Example: +--page=-10+ converts all\npages up to page 10, +--page=10-+ converts all pages starting with page 10.\nPlease consider that the page values don't refer to the page numbers printed on the\ncorresponding page. Instead, the physical page count is expected, where the first page always\ngets number 1.\n+\nTo select the last page, expression +%P+ can be used instead of an explicit page number. It's\nreplaced by the number of the last page. For example, +--page=1,%P+ converts the first and the\nlast page of the document.\n+\nAdditionally, arithmetic expressions of the form +%(+'expr'+)+ in place of numbers are valid too.\nThe resulting values are always rounded down to the nearest integer. See option *--output* for\nmore information about the syntax and the supported arithmetic operators.\nExample: +--page=%(P-2)-+ converts the last three pages.\n+\nAt the end of the range sequence an optional filter specifier can be appended in order to remove\ncertain page numbers from the sequence. Currently, the two filters +:even+ and +:odd+ are supported\nwhich restrict the preceding values to even and odd numbers, respectively. For example,\n+--page=1-11,20:even+ is equivalent to +--page=2,4,6,8,10,20+.\n\n*-H, --page-hashes*[='params']::\nIf this option is given, dvisvgm computes hash values of all pages to be processed. As long as the\npage contents don't change, the hash value of that page stays the same. This property can be used\nto determine whether a DVI page must be converted again or can be skipped in consecutive runs of\ndvisvgm. This is done by propagating the hash value to variable +%hd+ which can be accessed in\nthe output pattern (see option *--output*). By default, dvisvgm changes the output pattern to\n+%f-%hd+ if option *--page-hashes* is given. As a result, all SVG file names contain the hash\nvalue instead of the page number. When calling dvisvgm again with option *--page-hashes* with the\nsame output pattern, it checks the existence of the SVG file to be created and skips the conversion\nif it's already present. This also applies for consecutive calls of dvisvgm with different\ncommand-line parameters. If you want to force another conversion of a DVI file that hasn't changed,\nyou must remove the corresponding SVG files beforehand or add the parameter +replace+ (see below).\nIf you manually set the output pattern to not contain a hash value, the conversion won't be skipped.\n+\nAlternatively, the output pattern may contain the variables +%ho+ and +%hc+. +%ho+ expands to a\n32-bit hash representing the given command-line options that affect the generated SVG output, like\n*--no-fonts* and *--precision*. Different combinations of options and parameters lead to different\nhashes. Thus pattern +%f-%hd-%ho+ creates filenames that change depending on the DVI data and\nthe given command-line options. Variable +%hc+ provides a combined hash computed from the DVI data\nand the command-line options. It has the same length as +%hd+.\n+\nSince the page number isn't part of the file name by default, different DVI pages with identical\ncontents get the same file name. Therefore, only the first one is converted while the others are\nskipped. To create separate files for each page, you can add the page number to the output pattern,\ne.g. +--output=\"%f-%p-%hc\"+.\n+\nBy default, dvisvgm uses the fast XXH64 hash algorithm to compute the values provided through +%hd+ and\n+%hc+. 64-bit hashes should be sufficient for most documents with an average size of pages. Alternatively,\nXXH32 and MD5 can be used as well. The desired algorithm is specified by argument 'params' of option\n*--page-hashes*. It takes one of the strings +MD5+, +XXH32+, and +XXH64+, where the names can be given\nin lower case too, like +--page-hashes=md5+. Since version 0.7.1, xxHash provides an experimental 128-bit\nhash function whose algorithm has been stabilized as of version 0.8. When using a version prior to 0.8,\nthe 128-bit hash values can vary depending on the used xxHash version. If the corresponding API is\navailable, dvisvgm supports the new hash function, and option *--page-hashes* additionally accepts the\nalgorithm specifier +XXH128+.\n+\nFinally, option *--page-hashes* can take a second argument that must be separated by a comma.\nCurrently, only the two parameters 'list' and 'replace' are evaluated, e.g. +--page-hashes=md5,list+\nor +--page-hashes=replace+. When 'list' is present, dvisvgm doesn't perform any conversion but just\nlists the hash values +%hd+ and +%hc+ of the pages specified by option *--page*. Parameter 'replace'\nforces dvisvgm to convert a DVI page even if a file with the target name already exists.\n\n*-P, --pdf*::\nIf this option is given, dvisvgm does not expect a DVI but a PDF input file, and tries to convert\nit to SVG. Similar to the conversion of DVI files, only the first page is processed by default.\nOption *--page* can be used to select different pages, page ranges, and/or page sequences.\n+\nIf a Ghostscript version < 10.01.0 is found, dvisvgm uses Ghostscript to process the PDF file. In\nthis case, the conversion is realized by creating a single 'pdffile' special command which is\nforwarded to dvisvgm's PostScript special handler. Therefore, this option is only available if\ndvisvgm was built with PostScript support enabled, and requires Ghostscript to be accessible.\nSee option *--libgs* for further information.\n+\nAs of Ghostscript 10.01.0, this will no longer work due to the introduction of a new PDF interpreter.\nTherefore, an alternative conversion module based on _mutool_, a utility which is part of the\nhttps://mupdf.com[MuPDF] package, has been introduced. It's automatically invoked if Ghostscript\ncan't be used and if a working +mutool+ executable is present in a directory which is part of the\nsystem's search path.\n+\nAlternatively, environment variable +DVISVGM_PDF_PROC+ can be used to select the PDF processor.\nThe currently supported values are +gs+ and +mutool+.\n\n*-d, --precision*='digits'::\nSpecifies the maximum number of decimal places applied to floating-point attribute values.\nAll attribute values written to the generated SVG file(s) are rounded accordingly. The\nparameter 'digits' accepts integer values from 0 to 6, where 0 enables the automatic selection\nof significant decimal places. This is also the default value if dvisvgm is called without\noption *--precision*.\n\n*--progress*[='delay']::\nEnables a simple progress indicator shown when time-consuming operations like PostScript specials\nare processed. The indicator doesn't appear before the given delay (in seconds) has elapsed.\nThe default delay value is 0.5 seconds.\n\n*-r, --rotate*='angle'::\nRotates the page content clockwise by 'angle' degrees around the page center.\nThis option is equivalent to *-TR*'angle'.\n\n*-R, --relative*::\nSVG allows you to define graphics paths by a sequence of absolute and/or relative path commands,\ni.e. each command expects either absolute coordinates or coordinates relative to the\ncurrent drawing position. By default, dvisvgm creates paths made up of absolute commands.\nIf option *--relative* is given, relative commands are created instead. This slightly reduces\nthe size of the SVG files in most cases.\n\n*--stdin*::\nTells dvisvgm to read the DVI or EPS input data from *stdin* instead from a file. Alternatively\nto option *--stdin*, a single dash (-) can be given. The default name of the generated SVG file\nis 'stdin.svg' which can be changed with option *--output*.\n\n*-s, --stdout*::\nDon't write the SVG output to a file but redirect it to *stdout*.\n\n*--tmpdir*[='path']::\nIn some cases, dvisvgm needs to create temporary files to work properly. These files go to the\nsystem's temporary folder by default, e.g. +/tmp+ on Linux systems. Option *--tmpdir* can be used\nto specify a different location. Please note that dvisvgm does not create this folder if it doesn't\nexist. Therefore, you must ensure that it's actually present before running dvisvgm.\n+\nIn order to prevent colliding files caused by parallel calls of dvisvgm, the program doesn't write\nthe files directly in the specified directory but furthermore creates a uniquely named subfolder in\nthere, where the temporary files will be placed. This can be prevented by appending +//+ or +\\\\+\n(on Windows) to the specified directory name. For example, +--tmpdir=.//+ creates the temporary files\ndirectly in the current working directory, while +--tmpdir=.+ places them in a dedicated subfolder of\nthe current working directory.\n+\nIf the optional parameter 'path' of option *--tmpdir* is omitted, dvisvgm prints the location of the\nsystem's temp folder and exits.\n\n*-a, --trace-all*=['retrace']::\nThis option forces dvisvgm to vectorize not only the glyphs actually required to render the\nSVG file correctly – which is the default –, but processes all glyphs of all fonts referenced in\nthe DVI file. Because dvisvgm stores the tracing results in a font cache, all following conversions\nof these fonts will speed up significantly.\nThe boolean option 'retrace' determines how to handle glyphs already stored in the cache.\nBy default, these glyphs are skipped. Setting argument 'retrace' to 'yes' or 'true' forces dvisvgm\nto retrace the corresponding bitmaps again.\n+\n[NOTE]\nThis option only takes effect if font caching is active. Therefore, *--trace-all* cannot be\ncombined with option *--cache=none*.\n+\n\n*-T, --transform*='commands'::\nApplies a sequence of transformations to the SVG content. Each transformation is described\nby a 'command' beginning with a capital letter followed by a list of comma-separated\nparameters. Following transformation commands are supported:\n \n *T* 'tx'[,'ty'];;\n Translates (moves/shifts) the page in direction of vector ('tx','ty'). If 'ty' is omitted,\n 'ty'=0 is assumed.\n The expected unit length of 'tx' and 'ty' are TeX points (1pt = 1/72.27in). However, there\n are several constants defined to simplify the unit conversion (see below).\n \n *S* 'sx'[,'sy'];;\n Scales the page horizontally by 'sx' and vertically by 'sy'. If 'sy' is omitted,\n 'sy'='sx' is assumed.\n \n *R* 'angle'[,'x','y'];;\n Rotates the page clockwise by 'angle' degrees around point ('x','y'). If the optional\n arguments 'x' and 'y' are omitted, the page will be rotated around its center depending on\n the chosen page format. When option *-bnone* is given, the rotation center is origin (0,0).\n \n *KX* 'angle';;\n Skews the page along the 'x'-axis by 'angle' degrees. Argument 'angle' can take any value\n except 90+180__k__, where 'k' is an integer.\n \n *KY* 'angle';;\n Skews the page along the 'y'-axis by 'angle' degrees. Argument 'angle' can take any value\n except 90+180__k__, where 'k' is an integer.\n \n *FH* ['y'];;\n Mirrors (flips) the page at the horizontal line through point (0,'y'). Omitting the optional argument\n leads to 'y'='h'/2, where 'h' denotes the page height (see <> below).\n \n *FV* ['x'];;\n Mirrors (flips) the page at the vertical line through point ('x',0). Omitting the optional argument\n leads to 'x'='w'/2, where 'w' denotes the page width (see <> below).\n \n *M* 'm1',...,'m6';;\n Applies a transformation described by the 3×3 matrix\n \\(('m1','m2','m3'),('m4','m5','m6'),(0,0,1)), where the inner triples denote\n the rows.\n+\n[NOTE]\n=================================================================================================\nAll transformation commands of option *-T, --transform* are applied in the order of their appearance.\nMultiple commands can optionally be separated by spaces. In this case the whole transformation string\nhas to be enclosed in double quotes to keep them together. All parameters are expressions of floating\npoint type. You can either give plain numbers or arithmetic terms combined by the operators *+* (addition),\n*-* (subtraction), *** (multiplication), */* (division) or *%* (modulo) with common associativity and\nprecedence rules. Parentheses may be used as well.\n\n[[constants]]\nAdditionally, some pre-defined constants are provided:\n\n[horizontal]\n*ux*:: horizontal position of upper left page corner in TeX point units\n*uy*:: vertical position of upper left page corner in TeX point units\n*h*:: page height in TeX point units (0 in case of *-bnone*)\n*w*:: page width in TeX point units (0 in case of *-bnone*)\n\nFurthermore, you can use the 9 length constants +pt+, +bp+, +cm+, +mm+, +in+, +pc+, +dd+, +cc+,\nand +sp+, e.g. +2cm+ or +1.6in+. Thus, option +-TT1in,0R45+ moves the page content 1 inch to\nthe right and rotates it by 45 degrees around the page center afterwards.\n\nFor single transformations, there are also the short-hand options *-c*, *-t* and *-r* available.\nIn contrast to the *--transform* commands, the order of these options is not significant, so\nthat it's not possible to describe transformation sequences with them.\n\n=================================================================================================\n+\n//\n\n//\n*-t, --translate*='tx'[,'ty']::\nTranslates (moves) the page content in direction of vector ('tx','ty'). This option is\nequivalent to *-TT*'tx','ty'.\n\n\n*-v, --verbosity*='level'::\nControls the type of messages printed during a dvisvgm run:\n[horizontal]\n *0*;; no message output at all\n *1*;; error messages only\n *2*;; warning messages only\n *4*;; informational messages only\n *8*;; user messages only (e.g. created by special +dvisvgm:message+)\n\n+\n[NOTE]\nBy adding these values you can combine the categories. The default level is 15, i.e. all\nmessages are printed.\n+\n\n*-V, --version*[='extended']::\nPrints the version of dvisvgm and exits. If the optional argument is set to 'yes', the\nversion numbers of the linked libraries are printed as well.\n\n*-z, --zip*[='level']::\nCreates a compressed SVG file with suffix .svgz. The optional argument specifies the compression\nlevel. Valid values are in the range of 1 to 9 (default value is 9). Larger values cause better\ncompression results but may take slightly more computation time.\n\n*-Z, --zoom*='factor'::\nMultiplies the values of the 'width' and 'height' attributes of the SVG root element by argument 'factor'\nwhile the coordinate system of the graphic content is retained. As a result, most SVG viewers zoom the\ngraphics accordingly. If a negative zoom factor is given, the 'width' and 'height' attributes are omitted.\n\n[[specials]]\nSupported Specials\n------------------\ndvisvgm supports several 'special commands' that enrich the DVI command set with additional instructions\nfor features, like color, graphics, and hyperlinks. The term 'special command', or just 'special', originates\nfrom the TeX command +\\special{...}+ which does almost nothing. TeX only forwards the argument of this command\nto the DVI file using the corresponding 'xxx' opcode, thus delegating its execution to the DVI driver. The\ndriver can then decide to either process or ignore it, depending on the supported statements. The parameter\nof TeX's +\\special+ command is given in curly braces and may consist of an arbitrary character sequence\nrepresenting the actual instruction, for example +color Red+.\n\nIt might be worth mentioning that specials are only evaluated when processing DVI files. PS/EPS and PDF\ndon't know anything about the concept of specials and therefore don't provide means to represent them.\n\nIn order to evaluate the special commands, dvisvgm implements several dedicated handlers. Each handler is\nresponsible for all special statements belonging to the same command set, i.e. commands usually –\nbut not necessarily – beginning with a common prefix. For example, all PDF specials start with the\nprefix +pdf:+, while the TPIC special set consists of 13 different commands without common identifier. The\nPDF specials are processed by dvisvgm's 'pdf' handler, the TPIC ones by the 'tpic' handler. To get a list of\nthe actually provided special handlers, use option *--list-specials* (see above). The following list gives an\noverview of the special sets currently supported. The names of the handlers can also be used to disable the\nprocessing of individual sets of specials. For further information on this, see option *--no-specials*.\n\n*bgcolor*::\nSpecial statements for changing the background/page color. Currently, dvisvgm only supports the +background+\nstatement as specified in the https://tug.org/texinfohtml/dvips.html#Color-specifications[dvips manual].\nSince SVG 1.1 doesn't support background colors, dvisvgm inserts a rectangle of the chosen color into the\ngenerated SVG document. This rectangle always gets the same size as the selected or computed bounding box.\nThis background color command is part of the color special set but is handled separately in order to let\nthe user turn it off.\n\n*color*::\nStatements of this command set provide instructions to change the text/paint color. For an overview of the\nexact syntax, see the documentation of dvips, for instance.\n+\ndvisvgm extends the dvips syntax of the color specials by two optional modifiers to enable the differentiation\nbetween fill and stroke colors, i.e. colors used to fill enclosed areas and to draw lines, respectively.\nIf one of the color specifiers, like a color name or a color model followed by a sequence of color components,\nis preceded by +fill+ or +stroke+, only the corresponding color is changed. Without these modifiers both colors\nare affected. Example: +color push fill rgb 1 0 1+ pushes a new color pair onto the color stack whereby the fill\ncolor is set to magenta and the stroke color retains its current value.\n+color push rgb 1 0 1+ pushes a color pair with both colors set to magenta.\n+\nAdditionally, the new special *color set* is introduced. Its syntax is the same as the one of *color push*\nincluding the optional +fill+ and +stroke+ modifiers. Instead of pushing a new color pair it modifies the\ntopmost one on the stack. If the color stack is empty, the default (black) fill/stroke color is changed.\n\n*dvisvgm*::\nThe following list gives a brief overview of dvisvgm's own set of currently supported specials.\n\n*dvisvgm:raw* 'text':::\nAdds an arbitrary sequence of XML nodes to the page section of the SVG document. dvisvgm checks syntax and\nproper nesting of the inserted elements but does not perform any validation, thus the user has to ensure\nthat the resulting SVG is still valid. Opening and closing tags may be distributed among different 'raw'\nspecials. The tags themselves can also be split but must be continued with the immediately following 'raw'\nspecial. Both syntactically incorrect and wrongly nested tags lead to error messages.\n+\nParameter 'text' may also contain the expressions *{?x}*, *{?y}*, *{?color}*, *{?fillcolor}*, *{?strokecolor}*,\n*{?matrix}*, *{?pageno}*, *{?svgfile}*, and *{?svgpath}* that respectively expand to the current 'x' and 'y'\ncoordinate, an RGB hex string of the current active fill and stroke color, the current transformation matrix,\nthe current page number, and the relative and absolute path of the SVG file being created. *{?color}* expands\nto the same string as *{?fillcolor}* and is still available for compatibility with older dvisvgm versions that\ndidn't distinguish between fill and stroke colors (see information about color specials below).\n+\nAs SVG doesn't support CMYK colors, for example in +fill+ and +stroke+ attributes, dvisvgm provides macro\n*{?cmyk(_c_,_m_,_y_,_k_)}* to create an RGB hex string from a CMYK color. It can be used instead of\na combination of color/PostScript specials and color macros to directly insert a CMYK color value.\n+\nCharacter sequence *{?nl}* expands to a newline character. Finally, constructions of the form *{?(_expr_)}*\nenable the evaluation of mathematical expressions which may consist of basic arithmetic operations including\nmodulo. As above, the variables 'x' and 'y' represent the current coordinates.\nInvalid operations, like divisions by zero, lead to an error message on the console.\nExample: +{?(-10*(x+2y)-5)}+ is a valid expression and expands to the corresponding numeric string.\n\n*dvisvgm:rawdef* 'text':::\nThis command is similar to *dvisvgm:raw*, but puts the XML nodes into the section of the SVG document\ncurrently being generated.\n\n*dvisvgm:rawset* 'name' ... *dvisvgm:endrawset*:::\nThis pair of specials marks the begin and end of a definition of a named raw SVG fragment. All *dvisvgm:raw*\nand *dvisvgm:rawdef* specials enclosed by *dvisvgm:rawset* and *dvisvgm:endrawset* are not evaluated\nimmediately but stored together under the given 'name' for later use. Once defined, the named fragment can be\nreferenced throughout the DVI file by *dvisvgm:rawput* (see below).\nThe two commands *dvisvgm:rawset* and *dvisvgm:endrawset* must not be nested, i.e. each call of *dvisvgm:rawset*\nhas to be followed by a corresponding call of *dvisvgm:endrawset* before another *dvisvgm:rawset* may occur.\nAlso, the identifier 'name' must be unique throughout the DVI file. Using *dvisvgm:rawset* multiple times\ntogether with the same 'name' leads to warning messages.\n\n*dvisvgm:rawput* 'name':::\nInserts raw SVG fragments previously stored under the given 'name'. dvisvgm distinguishes between fragments\nthat were specified with *dvisvgm:raw* or *dvisvgm:rawdef*, and handles them differently: It inserts all\n*dvisvgm:raw* parts every time *dvisvgm:rawput* is called, whereas the *dvisvgm:rawdef* portions go to the\n section of the current SVG document only once.\n\n*dvisvgm:img* 'width' 'height' 'file':::\nCreates an +image+ element using the current graphic position, transformation matrix, the specified extents,\nand the given filename. This special command also updates the bounding box of the resulting SVG to entirely\nenclose the transformed image. The image itself is positioned such that the lower left corner of the\nuntransformed image lies at the current graphic position. The length 'width' and 'height' specify the extents\nof the untransformed image. For a list of supported length units see option *--bbox*. Plain numbers without an\nappended unit specifier imply TeX points (1in = 72.27pt).\n+\nParameter 'file' can be a plain filename or a relative or absolute path of a file. By default, dvisvgm just\ncreates links referencing the image file so that the SVG renderer will evaluate the filename or path relative\nto the location of the generated SVG file. If option *--embed-bitmaps* is given, JPEG and PNG images are\nembedded into the SVG document. As this requires base64-encoding of the image data, the resulting SVG files\ncan become quite big.\n\n*dvisvgm:bbox* lock:::\nLocks the bounding box of the current page and prevents it from further updating, i.e. graphics elements added\nafter calling this special are not taken into account in determining the extent of the bounding box.\n\n*dvisvgm:bbox* unlock:::\nUnlocks the previously locked bounding box of the current page so that it gets updated again when adding\ngraphics elements to the page.\n\n*dvisvgm:bbox* n[ew] 'name':::\nDefines or resets a local bounding box called 'name'. The name may consist of letters and digits.\nWhile processing a DVI page, dvisvgm continuously updates the (global) bounding box of the current page in order to\ndetermine the minimal rectangle containing all visible page components (characters, images, drawing elements etc.)\nAdditionally to the global bounding box, the user can request an arbitrary number of named local bounding boxes.\nOnce defined, these boxes are updated together with the global bounding box starting with the first character that\nfollows the definition. Thus, the local boxes can be used to compute the extent of parts of the page. This is useful\nfor scenarios where the generated SVG file is post-processed.\n+\nIn conjunction with special *dvisvgm:raw*, the macro *{?bbox 'name'}* expands to the four values 'x', 'y', 'w', and 'h'\n(separated by spaces) specifying the coordinates of the upper left corner, width, and height of the local box 'name'.\nIf box 'name' wasn't previously defined, all four values equal to zero.\n\n*dvisvgm:bbox* 'width' 'height' ['depth'] [+transform+]:::\nUpdates the bounding box of the current page by embedding a virtual rectangle ('x', 'y', 'width', 'height')\nwhere the lower left corner is located at the current DVI drawing position ('x','y'). If the optional parameter 'depth'\nis specified, dvisvgm embeds a second rectangle ('x', 'y', 'width', -__depth__). The lengths 'width', 'height', and\n'depth' can be given together with a unit specifier (see option *--bbox*) or as plain floating point numbers.\nIn the latter case, TeX point units are assumed (1in = 72.27pt). Depending on size and position of the virtual rectangle,\nthis command either enlarges the overall bounding box or leaves it as is. So, it's not possible to reduce its extent.\n+\nThis special is supposed to be used together with *dvisvgm:raw* in order to update the viewport of the page properly.\nBy default, the box extents are assigned unchanged and, in particular, are not altered by transformation commands.\nIn order to apply the current transformation matrix, the optional modifier +transform+ can be added at the end of\nthe special statement.\n\n*dvisvgm:bbox* a[bs] 'x1' 'y1' 'x2' 'y2' [+transform+]:::\nThis variant of the bbox special updates the bounding box by embedding a virtual rectangle ('x1','y1','x2','y2').\nThe points ('x1','y1') and ('x2','y2') denote the absolute coordinates of two diagonal corners of the rectangle.\nAs with the relative special variant described above, the optional modifier +transform+ allows for applying the\ncurrent transformation matrix to the bounding box.\n\n*dvisvgm:bbox* f[ix] 'x1' 'y1' 'x2' 'y2' [+transform+]:::\nThis variant of the bbox special assigns an absolute (final) bounding box to the resulting SVG. After executing\nthis command, dvisvgm doesn't further alter the bounding box coordinates, except this special is called again later.\nThe points ('x1','y1') and ('x2','y2') denote the absolute coordinates of two diagonal corners of the rectangle.\nAs with the relative special variant described above, the optional modifier +transform+ allows for applying the\ncurrent transformation matrix to the bounding box.\n+\nThe following TeX fragment adds two raw SVG elements to the output and updates the bounding box accordingly:\n+\n[source,tex]\n-------------------------------------------------------------------------------------\n\\special{dvisvgm:raw }%\n\\special{dvisvgm:bbox 10bp 10bp 10bp transform}%\n\\special{dvisvgm:bbox -10bp 10bp 10bp transform}\n\n\\special{dvisvgm:raw }%\n\\special{dvisvgm:bbox abs 10bp 200bp 100bp 250bp transform}\n-------------------------------------------------------------------------------------\n\n*dvisvgm:currentcolor* [on|off]:::\nThis special works similar to option `--currentcolor` but doesn't require an explicit color argument. Instead,\nit takes the currently active color and replaces it with `currentColor`. Therefore, the result depends on both the\nplacement of the special and the preceding color changes. Argument `on` – which activates the 'currentColor'\nfunctionality – can be omitted. When called with argument `off`, the functionality is deactivated again.\n\n*dvisvgm:message* 'msg':::\nPrints the given text 'msg' to the console. Besides static text it may also contain the macros +{?...}+ mentioned\nin the description of *dvisvgm:raw*. The messages created by this special can be suppressed with option\n*--verbosity* (see above).\n\n*em*::\nThese specials were introduced with the 'emTeX' distribution by Eberhard Mattes. They provide line drawing\nstatements, instructions for embedding MSP, PCX, and BMP image files, as well as two PCL commands.\ndvisvgm supports only the line drawing statements and ignores all other em specials silently.\nA description of the command syntax can be found in the DVI driver documentation coming with\nhttps://ctan.org/pkg/emtex[emTeX].\n\n*html*::\nThe hyperref specification defines several variants on how to mark hyperlinked areas in a DVI file. dvisvgm\nsupports the plain HyperTeX special constructs as created with hyperref package option 'hypertex'.\nBy default, all linked areas of the document are marked by a rectangle. Option *--linkmark* allows you to change\nthis behavior. See above for further details. Information on syntax and semantics of the HyperTeX specials can be\nfound in the https://ctan.org/pkg/hyperref[hyperref manual].\n\n*papersize*::\nThe 'papersize' special, which is an extension introduced by dvips, can be used to specify the widths and\nheights of the pages in the DVI file. It affects the page it appears on as well as all following pages until\nanother papersize special is found. If there is more than one papersize special present on a page, dvisvgm\napplies the last one. However, in order to stay compatible with previous versions of dvisvgm that did not\nevaluate these specials, their processing must be explicitly enabled by adding option *--bbox=papersize* on\nthe command-line. Otherwise, dvisvgm ignores them and computes tight bounding boxes.\n\n*pdf*::\npdfTeX and dvipdfmx introduced several special commands related to the generation of PDF files. Currently,\nonly 'pdf:mapfile', 'pdf:mapline', 'pdf:pagesize', and PDF hyperlink specials are supported by dvisvgm.\nThe latter are the PDF pendants to the HTML HyperTeX specials. They are generated by the hyperref package in\nPDF mode, for example.\nIf a DVI page contains unsupported PDF specials, dvisvgm prints a warning message showing the number of\nignored special commands.\n+\n'pdf:pagesize' is similar to the 'papersize' special (see above) which specifies the size of the current\nand all following pages. In order to actually apply the extents to the generated SVG files,\noption *--bbox=papersize* must be given.\n+\n'pdf:mapfile' and 'pdf:mapline' allow for modifying the font map tree while processing the DVI file.\nThey are used by CTeX, for example. dvisvgm supports both, the dvips and dvipdfm font map format. For further\ninformation on the command syntax and semantics, see the documentation of +\\pdfmapfile+ in the\nhttps://ctan.org/pkg/pdftex[pdfTeX user manual].\n\n*ps*::\nThe famous DVI driver https://www.tug.org/texinfohtml/dvips.html['dvips'] introduced its own set of specials\nin order to embed PostScript code into DVI files, which greatly improves the capabilities of DVI documents.\nOne aim of dvisvgm is to completely evaluate all PostScript fragments and to convert as many of them as possible\nto SVG. In contrast to dvips, dvisvgm uses floating point arithmetic to compute the precise position of each\ngraphic element, i.e. it doesn't round the coordinates. Therefore, the relative locations of the graphic elements\nmay slightly differ from those computed by dvips.\n+\nSince PostScript is a rather complex language, dvisvgm does not implement its own PostScript interpreter\nbut relies on https://ghostscript.com[Ghostscript] instead. If the Ghostscript library was not linked to the\ndvisvgm binary, it is looked up and loaded dynamically during runtime. In this case, dvisvgm looks for\n'libgs.so.X' on Unix-like systems (supported ABI versions: 7,8,9), for 'libgs.X.dylib' on macOS, and for\n'gsdll32.dll' or 'gsdll64.dll' on Windows. You can override the default file names with environment variable\n*LIBGS* or the command-line option *--libgs*. The library must be reachable through the ld search path (\\*nix)\nor the PATH environment variable (Windows). Alternatively, the absolute file path can be specified. If the library\ncannot be found, dvisvgm disables the processing of PostScript specials and prints a warning message.\nUse option *--list-specials* to check whether PostScript support is available, i.e. entry 'ps' is present.\n+\nThe PostScript handler also recognizes and evaluates bounding box data generated by the\nhttps://ctan.org/pkg/preview[preview package] with option 'tightpage'. If such data is present in the DVI file\nand if dvisvgm is called with option *--bbox=preview*, dvisvgm sets the width and total height of the SVG file to\nthe values derived from the preview data. Additionally, it prints a message showing the width, height,\nand depth of the box in TeX point units to the console. Especially, the depth value can be read by a post-processor\nto vertically align the SVG graphics with the baseline of surrounding text in HTML or XSL-FO documents, for example.\nPlease note that SVG bounding boxes are defined by a width and (total) height. In contrast to TeX, SVG provides\nno means to differentiate between height and depth, i.e. the vertical extents above and below the baseline,\nrespectively. Therefore, it is generally not possible to retrieve the depth value from the SVG file itself.\n+\nIf you call dvisvgm with option *--bbox=min* (the default) and preview data is present in the DVI file, dvisvgm\ndoesn't apply the preview extents but computes a bounding box that tightly encloses the page contents. The height,\ndepth and width values written to console are adapted accordingly.\n\n*tpic*::\nThe TPIC special set defines instructions for drawing simple geometric objects. Some LaTeX packages, like\neepic and tplot, use these specials to describe graphics.\n\n\nExamples\n--------\n+dvisvgm file+::\n\tConverts the first page of 'file.dvi' to 'file.svg'.\n\n+dvisvgm -p1-5 file+::\n\tConverts the first five pages of 'file.dvi' to 'file-1.svg',...,'file-5.svg'.\n\n+dvisvgm -p1- file+::\n\tConverts all pages of 'file.dvi' to separate SVG files.\n\n+dvisvgm -p1,3 -O file+::\n\tConverts the first and third page of 'file.dvi' to optimized SVG files.\n\n+dvisvgm - < file.dvi+::\n\tConverts the first page of 'file.dvi' to 'stdin.svg' where the contents of 'file.dvi' is read from *stdin*.\n\n+dvisvgm -z file+::\n\tConverts the first page of 'file.dvi' to 'file.svgz' with default compression level 9.\n\n+dvisvgm -p5 -z3 -ba4-l -o newfile file+::\n\tConverts the fifth page of 'file.dvi' to 'newfile.svgz' with compression level 3. The bounding box is set to DIN/ISO A4 in landscape format.\n\n+dvisvgm --transform=\"R20,w/3,2h/5 T1cm,1cm S2,3\" file+::\n\tConverts the first page of 'file.dvi' to 'file.svg' where three transformations are applied.\n\n[[environment]]\nEnvironment\n-----------\ndvisvgm uses the *kpathsea* library for locating the files that it opens.\nHence, the environment variables described in the library's documentation influence the converter.\n\nIf dvisvgm was linked without the Ghostscript library, and if PostScript support has not been disabled,\nthe shared Ghostscript library is looked up during runtime via dlopen(). The environment variable *LIBGS*\ncan be used to specify path and file name of the library.\n\nThe pre-compiled Windows versions of dvisvgm require a working installation of MiKTeX 2.9 or above.\ndvisvgm does not work together with the portable edition of MiKTeX because it relies on MiKTeX's COM\ninterface that is only accessible in a local installation.\nTo enable the evaluation of PostScript specials, the original Ghostscript DLL 'gsdll32.dll' must be present\nand reachable through the search path. 64-bit Windows builds require the 64-bit Ghostscript DLL 'gsdll64.dll'.\nBoth DLLs come with the corresponding Ghostscript installers available from https://ghostscript.com.\n\nThe environment variable *DVISVGM_COLORS* specifies the colors used to highlight various parts of dvisvgm's\nmessage output. It is only evaluated if option *--color* is given. The value of *DVISVGM_COLORS* is a list of\ncolon-separated entries of the form 'gg'='BF', where 'gg' denotes one of the color group indicators listed\nbelow, and 'BF' are two hexadecimal digits specifying the background (first digit) and foreground/text color\n(second digit). The color values are defined as follows: 0=black, 1=red, 2=green, 3=yellow, 4=blue,\n5=magenta, 6=cyan, 7=gray, 8=bright red, 9=bright green, A=bright yellow, B=bright blue, C=bright magenta,\nD=bright cyan, E=bright gray, F=white. Depending on the terminal, the colors may differ. Rather than changing\nboth the text and background color, it's also possible to change only one of them: An asterisk (*) in\nplace of a hexadecimal digit indicates the default text or background color of the terminal.\n\nAll malformed entries in the list are silently ignored.\n\n[horizontal]\n*er*:: error messages\n*wn*:: warning messages\n*pn*:: messages about page numbers\n*ps*:: page size messages\n*fw*:: information about the files written\n*sm*:: state messages\n*tr*:: messages of the glyph tracer\n*pi*:: progress indicator\n\n*Example:* +er=01:pi=\\*5+ sets the colors of error messages (+er+) to red (+1+) on black (+0+), and those\nof progress indicators (+pi+) to cyan (+5+) on default background (+*+).\n\nVariable *DVISVGM_PDF_PROC* allows you to select the desired PDF processor. dvisvgm requires either\nGhostscript (version < 10.01.0) or mutool to process PDF files. IF *DVISVGM_PDF_PROC* is not set, dvisvgm\ntries to detect the available processors. See option *--pdf* for further information. To select a\nspecific PDF processor, you can set *DVISVGM_PDF_PROC* to +gs+ or +mutool+ which forces the use of\nGhostscript and mutool respectively.\n\nFiles\n-----\nThe location of the following files is determined by the kpathsea library.\nTo check the actual kpathsea configuration you can use the *kpsewhich* utility.\n\n[horizontal]\n**.enc*:: Font encoding files\n**.fgd*:: Font glyph data files (cache files created by dvisvgm)\n**.map*:: Font map files\n**.mf*:: Metafont input files\n**.pfb*:: PostScript Type 1 font files\n**.pro*:: PostScript header/prologue files\n**.tfm*:: TeX font metric files\n**.ttf*:: TrueType font files\n**.vf*:: Virtual font files\n\nSee also\n--------\n*tex(1), mf(1), mktexmf(1), grodvi(1), potrace(1)*, and the *kpathsea library* info documentation.\n\nResources\n---------\nProject home page::: https://dvisvgm.de\nCode repository::: https://github.com/mgieseki/dvisvgm\n\nBugs\n----\nPlease report bugs using the bug tracker at https://github.com/mgieseki/dvisvgm/issues[GitHub].\n\nAuthor\n------\nWritten by {author} <{email}>\n\nCopying\n-------\nCopyright (C) 2005-2025 Martin Gieseking. Free use of this software is\ngranted under the terms of the GNU General Public License (GPL) version 3\nor, (at your option) any later version.\n\n// vim: set syntax=asciidoc:\n" }, { "path": "doc/generate-dvisvgm-sty.xsl", "content": "\n\n \n\n % This is a generated file -- don't modify it manually.\n\\NeedsTeXFormat{LaTeX2e}\n\\ProvidesPackage{dvisvgm}[2015/02/04 dvisvgm DocBook style]\n\\RequirePackageWithOptions{docbook}\n\\RequirePackage[english]{babel}\n\\RequirePackage[shortcuts]{extdash}\n\\RequirePackage{underscore}\n\\renewcommand*{\\arraystretch}{-0.4}\n\\AtBeginDocument{%\n \\thispagestyle{empty}\n \\lhead[]{\\refmiscinfomanual}\n \\rhead[]{\\thepage}\n \\lfoot[]{\\refmiscinfosource{} \\refmiscinfoversion}\n \\rfoot[]{} % revision date given in dvisvgm.txt.in\n \\def\\tableofcontents{\\stdtoc} % keep TOC on current page\n}\n \n\n" }, { "path": "doc/tweak-db-article.xsl", "content": "\n\n\n\n\n \n \n\n \n \n \n dvisvgm {VERSION} Manual\n A fast DVI to SVG converter\n \n \n \n\n \n \n \n \n \n \n\n \n \n\n" }, { "path": "doc/tweak-db-refentry.xsl", "content": "\n\n\n\n\n \n\n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n\n" }, { "path": "doc/tweak-dblatex-pdf.xsl", "content": "\n\n\n\n \n\n \n \n \n \n \n \n\n \n \n \n \n Synopsis\n \n \n \n\n \n \n \n \n \n \n\n" }, { "path": "doc/tweak-dblatex-tex.py", "content": "import re\nimport os\n\ndef main (latex_file, stdout):\n latex_file_old = latex_file+\"-old\"\n os.rename(latex_file, latex_file_old)\n os.remove(os.path.splitext(latex_file)[0]+\".pdf\")\n with open(latex_file, \"w\") as outfile:\n with open(latex_file_old) as infile:\n lines = infile.readlines()\n for line in lines:\n if re.match(r'(.*\\\\def)|(.*\\\\href)', line) == None:\n line = re.sub(r'([a-zA-Z0-9]+)/', r'\\1\\\\slash{}', line)\n line = re.sub(r'-{}-{}', r'\\=/\\=/', line)\n line = re.sub(r'([^a-zA-Z0-9])-{}', r'\\1\\=/', line)\n print(line.rstrip(), file=outfile)\n os.remove(latex_file_old)\n return 0\n" }, { "path": "libs/Makefile.am", "content": "## This file is part of dvisvgm\n## Copyright (C) 2005-2025 Martin Gieseking \n##\n## Process this file with automake.\n\nSUBDIRS = boost clipper md5 variant xxHash\n\nif !TEXLIVE_BUILD\nSUBDIRS += potrace\nendif\n\nif ENABLE_WOFF\nSUBDIRS += brotli woff2\nendif\n" }, { "path": "libs/boost/LICENSE.txt", "content": "Boost Software License - Version 1.0 - August 17th, 2003\n\nPermission is hereby granted, free of charge, to any person or organization\nobtaining a copy of the software and accompanying documentation covered by\nthis license (the \"Software\") to use, reproduce, display, distribute,\nexecute, and transmit the Software, and to prepare derivative works of the\nSoftware, and to permit third-parties to whom the Software is furnished to\ndo so, all subject to the following:\n\nThe copyright notices in the Software and this entire statement, including\nthe above license grant, this restriction and the following disclaimer,\nmust be included in all copies of the Software, in whole or in part, and\nall derivative works of the Software, unless such copies or derivative\nworks are solely in the form of machine-executable object code generated by\na source language processor.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\nSHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\nFOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\nDEALINGS IN THE SOFTWARE.\n" }, { "path": "libs/boost/Makefile.am", "content": "noinst_HEADERS = \\\n\tboost-vectorstream.hpp \\\n\tvectorstream.hpp\n\nEXTRA_DIST = LICENSE.txt\n" }, { "path": "libs/boost/boost-vectorstream.hpp", "content": "//////////////////////////////////////////////////////////////////////////////\n//\n// (C) Copyright Ion Gaztanaga 2005-2012. Distributed under the Boost\n// Software License, Version 1.0. (See accompanying file\n// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n//\n// See http://www.boost.org/libs/interprocess for documentation.\n//\n//////////////////////////////////////////////////////////////////////////////\n//\n// This file comes from SGI's sstream file. Modified by Ion Gaztanaga 2005-2012.\n// Changed internal SGI string to a generic, templatized vector. Added efficient\n// internal buffer get/set/swap functions, so that we can obtain/establish the\n// internal buffer without any reallocation or copy. Kill those temporaries!\n///////////////////////////////////////////////////////////////////////////////\n/*\n * Copyright (c) 1998\n * Silicon Graphics Computer Systems, Inc.\n *\n * Permission to use, copy, modify, distribute and sell this software\n * and its documentation for any purpose is hereby granted without fee,\n * provided that the above copyright notice appear in all copies and\n * that both that copyright notice and this permission notice appear\n * in supporting documentation. Silicon Graphics makes no\n * representations about the suitability of this software for any\n * purpose. It is provided \"as is\" without express or implied warranty.\n */\n\n//!\\file\n//!This file defines basic_vectorbuf, basic_ivectorstream,\n//!basic_ovectorstream, and basic_vectorstreamclasses. These classes\n//!represent streamsbufs and streams whose sources or destinations are\n//!STL-like vectors that can be swapped with external vectors to avoid\n//!unnecessary allocations/copies.\n\n#ifndef BOOST_INTERPROCESS_VECTORSTREAM_HPP\n#define BOOST_INTERPROCESS_VECTORSTREAM_HPP\n\n#include \n#include \n#include \n#include \n#include // char traits\n#include // ptrdiff_t\n\n#ifdef __GNUC__\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wreorder\"\n#endif\n\nnamespace boost { namespace interprocess {\n\n//!A streambuf class that controls the transmission of elements to and from\n//!a basic_ivectorstream, basic_ovectorstream or basic_vectorstream.\n//!It holds a character vector specified by CharVector template parameter\n//!as its formatting buffer. The vector must have contiguous storage, like\n//!std::vector, boost::interprocess::vector or boost::interprocess::basic_string\ntemplate \nclass basic_vectorbuf\n : public std::basic_streambuf\n{\n public:\n typedef CharVector vector_type;\n typedef typename CharVector::value_type char_type;\n typedef typename CharTraits::int_type int_type;\n typedef typename CharTraits::pos_type pos_type;\n typedef typename CharTraits::off_type off_type;\n typedef CharTraits traits_type;\n\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n private:\n typedef std::basic_streambuf base_t;\n\n basic_vectorbuf(const basic_vectorbuf&);\n basic_vectorbuf & operator =(const basic_vectorbuf&);\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n\n public:\n //!Constructor. Throws if vector_type default\n //!constructor throws.\n explicit basic_vectorbuf(std::ios_base::openmode mode\n = std::ios_base::in | std::ios_base::out)\n : base_t(), m_mode(mode)\n { this->initialize_pointers(); }\n\n //!Constructor. Throws if\n //!vector_type(const VectorParameter ¶m) throws.\n template\n explicit basic_vectorbuf(const VectorParameter ¶m,\n std::ios_base::openmode mode\n = std::ios_base::in | std::ios_base::out)\n : base_t(), m_mode(mode), m_vect(param)\n { this->initialize_pointers(); }\n\n public:\n\n //!Swaps the underlying vector with the passed vector.\n //!This function resets the read/write position in the stream.\n //!Does not throw.\n void swap_vector(vector_type &vect)\n {\n if (this->m_mode & std::ios_base::out){\n //Update high water if necessary\n //And resize vector to remove extra size\n if (mp_high_water < base_t::pptr()){\n //Restore the vector's size if necessary\n mp_high_water = base_t::pptr();\n }\n //This does not reallocate\n m_vect.resize(std::size_t(mp_high_water - (m_vect.size() ? &m_vect[0] : 0)));\n }\n //Now swap vector\n m_vect.swap(vect);\n this->initialize_pointers();\n }\n\n //!Returns a const reference to the internal vector.\n //!Does not throw.\n const vector_type &vector() const\n {\n if (this->m_mode & std::ios_base::out){\n if (mp_high_water < base_t::pptr()){\n //Restore the vector's size if necessary\n mp_high_water = base_t::pptr();\n }\n //This shouldn't reallocate\n typedef typename vector_type::size_type size_type;\n char_type *old_ptr = base_t::pbase();\n size_type high_pos = size_type(mp_high_water-old_ptr);\n if(m_vect.size() > high_pos){\n m_vect.resize(high_pos);\n //But we must update end write pointer because vector size is now shorter\n int old_pos = (int)(base_t::pptr() - base_t::pbase());\n const_cast(this)->base_t::setp(old_ptr, old_ptr + high_pos);\n const_cast(this)->base_t::pbump(old_pos);\n }\n }\n return m_vect;\n }\n\n //!Preallocates memory from the internal vector.\n //!Resets the stream to the first position.\n //!Throws if the internals vector's memory allocation throws.\n void reserve(typename vector_type::size_type size)\n {\n if (this->m_mode & std::ios_base::out && size > m_vect.size()){\n typename vector_type::difference_type write_pos = base_t::pptr() - base_t::pbase();\n typename vector_type::difference_type read_pos = base_t::gptr() - base_t::eback();\n //Now update pointer data\n m_vect.reserve(size);\n this->initialize_pointers();\n base_t::pbump((int)write_pos);\n if(this->m_mode & std::ios_base::in){\n base_t::gbump((int)read_pos);\n }\n }\n }\n\n //!Calls clear() method of the internal vector.\n //!Resets the stream to the first position.\n void clear()\n { m_vect.clear(); this->initialize_pointers(); }\n\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n private:\n //Maximizes high watermark to the initial vector size,\n //initializes read and write iostream buffers to the capacity\n //and resets stream positions\n void initialize_pointers()\n {\n // The initial read position is the beginning of the vector.\n if(!(m_mode & std::ios_base::out)){\n if(m_vect.empty()){\n this->setg(0, 0, 0);\n }\n else{\n this->setg(&m_vect[0], &m_vect[0], &m_vect[0] + m_vect.size());\n }\n }\n\n // The initial write position is the beginning of the vector.\n if(m_mode & std::ios_base::out){\n //First get real size\n int real_size = (int)m_vect.size();\n //Then maximize size for high watermarking\n m_vect.resize(m_vect.capacity());\n BOOST_ASSERT(m_vect.size() == m_vect.capacity());\n //Set high watermarking with the expanded size\n mp_high_water = m_vect.size() ? (&m_vect[0] + real_size) : 0;\n //Now set formatting pointers\n if(m_vect.empty()){\n this->setp(0, 0);\n if(m_mode & std::ios_base::in)\n this->setg(0, 0, 0);\n }\n else{\n char_type *p = &m_vect[0];\n this->setp(p, p + m_vect.size());\n if(m_mode & std::ios_base::in)\n this->setg(p, p, p + real_size);\n }\n if (m_mode & (std::ios_base::app | std::ios_base::ate)){\n base_t::pbump((int)real_size);\n }\n }\n }\n\n protected:\n virtual int_type underflow() BOOST_OVERRIDE\n {\n if (base_t::gptr() == 0)\n return CharTraits::eof();\n if(m_mode & std::ios_base::out){\n if (mp_high_water < base_t::pptr())\n mp_high_water = base_t::pptr();\n if (base_t::egptr() < mp_high_water)\n base_t::setg(base_t::eback(), base_t::gptr(), mp_high_water);\n }\n if (base_t::gptr() < base_t::egptr())\n return CharTraits::to_int_type(*base_t::gptr());\n return CharTraits::eof();\n }\n\n virtual int_type pbackfail(int_type c = CharTraits::eof()) BOOST_OVERRIDE\n {\n if(this->gptr() != this->eback()) {\n if(!CharTraits::eq_int_type(c, CharTraits::eof())) {\n if(CharTraits::eq(CharTraits::to_char_type(c), this->gptr()[-1])) {\n this->gbump(-1);\n return c;\n }\n else if(m_mode & std::ios_base::out) {\n this->gbump(-1);\n *this->gptr() = CharTraits::to_char_type(c);\n return c;\n }\n else\n return CharTraits::eof();\n }\n else {\n this->gbump(-1);\n return CharTraits::not_eof(c);\n }\n }\n else\n return CharTraits::eof();\n }\n\n virtual int_type overflow(int_type c = CharTraits::eof()) BOOST_OVERRIDE\n {\n if(m_mode & std::ios_base::out) {\n if(!CharTraits::eq_int_type(c, CharTraits::eof())) {\n typedef typename vector_type::difference_type dif_t;\n //The new output position is the previous one plus one\n //because 'overflow' requires putting 'c' on the buffer\n dif_t new_outpos = base_t::pptr() - base_t::pbase() + 1;\n //Adjust high water if necessary\n dif_t hipos = mp_high_water - base_t::pbase();\n if (hipos < new_outpos)\n hipos = new_outpos;\n //Insert the new data\n m_vect.push_back(CharTraits::to_char_type(c));\n m_vect.resize(m_vect.capacity());\n BOOST_ASSERT(m_vect.size() == m_vect.capacity());\n char_type* p = const_cast(&m_vect[0]);\n //A reallocation might have happened, update pointers\n base_t::setp(p, p + (dif_t)m_vect.size());\n mp_high_water = p + hipos;\n if (m_mode & std::ios_base::in)\n base_t::setg(p, p + (base_t::gptr() - base_t::eback()), mp_high_water);\n //Update write position to the old position + 1\n base_t::pbump((int)new_outpos);\n return c;\n }\n else // c is EOF, so we don't have to do anything\n return CharTraits::not_eof(c);\n }\n else // Overflow always fails if it's read-only.\n return CharTraits::eof();\n }\n\n virtual pos_type seekoff(off_type off, std::ios_base::seekdir dir,\n std::ios_base::openmode mode\n = std::ios_base::in | std::ios_base::out) BOOST_OVERRIDE\n {\n //Get seek mode\n bool in(0 != (mode & std::ios_base::in)), out(0 != (mode & std::ios_base::out));\n //Test for logic errors\n if(!in & !out)\n return pos_type(off_type(-1));\n else if((in && out) && (dir == std::ios_base::cur))\n return pos_type(off_type(-1));\n else if((in && (!(m_mode & std::ios_base::in) || (off != 0 && this->gptr() == 0) )) ||\n (out && (!(m_mode & std::ios_base::out) || (off != 0 && this->pptr() == 0))))\n return pos_type(off_type(-1));\n\n off_type newoff;\n //Just calculate the end of the stream. If the stream is read-only\n //the limit is the size of the vector. Otherwise, the high water mark\n //will mark the real size.\n off_type limit;\n if(m_mode & std::ios_base::out){\n //Update high water marking because pptr() is going to change and it might\n //have been updated since last overflow()\n if(mp_high_water < base_t::pptr())\n mp_high_water = base_t::pptr();\n //Update read limits in case high water mark was changed\n if(m_mode & std::ios_base::in){\n if (base_t::egptr() < mp_high_water)\n base_t::setg(base_t::eback(), base_t::gptr(), mp_high_water);\n }\n limit = static_cast(mp_high_water - base_t::pbase());\n }\n else{\n limit = static_cast(m_vect.size());\n }\n\n switch(dir) {\n case std::ios_base::beg:\n newoff = 0;\n break;\n case std::ios_base::end:\n newoff = limit;\n break;\n case std::ios_base::cur:\n newoff = in ? static_cast(this->gptr() - this->eback())\n : static_cast(this->pptr() - this->pbase());\n break;\n default:\n return pos_type(off_type(-1));\n }\n\n newoff += off;\n\n if (newoff < 0 || newoff > limit)\n return pos_type(-1);\n if (m_mode & std::ios_base::app && mode & std::ios_base::out && newoff != limit)\n return pos_type(-1);\n //This can reassign pointers\n //if(m_vect.size() != m_vect.capacity())\n //this->initialize_pointers();\n if (in)\n base_t::setg(base_t::eback(), base_t::eback() + newoff, base_t::egptr());\n if (out){\n base_t::setp(base_t::pbase(), base_t::epptr());\n base_t::pbump(static_cast(newoff));\n }\n return pos_type(newoff);\n }\n\n virtual pos_type seekpos(pos_type pos, std::ios_base::openmode mode\n = std::ios_base::in | std::ios_base::out) BOOST_OVERRIDE\n { return seekoff(pos - pos_type(off_type(0)), std::ios_base::beg, mode); }\n\n private:\n std::ios_base::openmode m_mode;\n mutable vector_type m_vect;\n mutable char_type* mp_high_water;\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n};\n\n//!A basic_istream class that holds a character vector specified by CharVector\n//!template parameter as its formatting buffer. The vector must have\n//!contiguous storage, like std::vector, boost::interprocess::vector or\n//!boost::interprocess::basic_string\ntemplate \nclass basic_ivectorstream\n : public std::basic_istream\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n , private basic_vectorbuf\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n{\n public:\n typedef CharVector vector_type;\n typedef typename std::basic_ios\n ::char_type char_type;\n typedef typename std::basic_ios::int_type int_type;\n typedef typename std::basic_ios::pos_type pos_type;\n typedef typename std::basic_ios::off_type off_type;\n typedef typename std::basic_ios::traits_type traits_type;\n\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n private:\n typedef basic_vectorbuf vectorbuf_t;\n typedef std::basic_ios basic_ios_t;\n typedef std::basic_istream base_t;\n\n vectorbuf_t & get_buf() { return *this; }\n const vectorbuf_t & get_buf() const{ return *this; }\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n\n public:\n\n //!Constructor. Throws if vector_type default\n //!constructor throws.\n basic_ivectorstream(std::ios_base::openmode mode = std::ios_base::in)\n : base_t(0) //Initializes first the base class to safely init the virtual basic_ios base\n //(via basic_ios::init() call in base_t's constructor) without the risk of a\n //previous throwing vectorbuf constructor. Set the streambuf after risk has gone.\n , vectorbuf_t(mode | std::ios_base::in)\n { this->base_t::rdbuf(&get_buf()); }\n\n //!Constructor. Throws if vector_type(const VectorParameter ¶m)\n //!throws.\n template\n basic_ivectorstream(const VectorParameter ¶m,\n std::ios_base::openmode mode = std::ios_base::in)\n : vectorbuf_t(param, mode | std::ios_base::in)\n //basic_ios_t() is constructed uninitialized as virtual base\n //and initialized inside base_t calling basic_ios::init()\n , base_t(&get_buf())\n {}\n\n public:\n //!Returns the address of the stored\n //!stream buffer.\n basic_vectorbuf* rdbuf() const\n { return const_cast*>(&get_buf()); }\n\n //!Swaps the underlying vector with the passed vector.\n //!This function resets the read position in the stream.\n //!Does not throw.\n void swap_vector(vector_type &vect)\n { get_buf().swap_vector(vect); }\n\n //!Returns a const reference to the internal vector.\n //!Does not throw.\n const vector_type &vector() const\n { return get_buf().vector(); }\n\n //!Calls reserve() method of the internal vector.\n //!Resets the stream to the first position.\n //!Throws if the internals vector's reserve throws.\n void reserve(typename vector_type::size_type size)\n { get_buf().reserve(size); }\n\n //!Calls clear() method of the internal vector.\n //!Resets the stream to the first position.\n void clear()\n { get_buf().clear(); }\n};\n\n//!A basic_ostream class that holds a character vector specified by CharVector\n//!template parameter as its formatting buffer. The vector must have\n//!contiguous storage, like std::vector, boost::interprocess::vector or\n//!boost::interprocess::basic_string\ntemplate \nclass basic_ovectorstream\n : public std::basic_ostream\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n , private basic_vectorbuf\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n{\n public:\n typedef CharVector vector_type;\n typedef typename std::basic_ios\n ::char_type char_type;\n typedef typename std::basic_ios::int_type int_type;\n typedef typename std::basic_ios::pos_type pos_type;\n typedef typename std::basic_ios::off_type off_type;\n typedef typename std::basic_ios::traits_type traits_type;\n\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n private:\n typedef basic_vectorbuf vectorbuf_t;\n typedef std::basic_ios basic_ios_t;\n typedef std::basic_ostream base_t;\n\n vectorbuf_t & get_buf() { return *this; }\n const vectorbuf_t & get_buf()const { return *this; }\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n\n public:\n //!Constructor. Throws if vector_type default\n //!constructor throws.\n basic_ovectorstream(std::ios_base::openmode mode = std::ios_base::out)\n : base_t(0) //Initializes first the base class to safely init the virtual basic_ios base\n //(via basic_ios::init() call in base_t's constructor) without the risk of a\n //previous throwing vectorbuf constructor. Set the streambuf after risk has gone.\n , vectorbuf_t(mode | std::ios_base::out)\n { this->base_t::rdbuf(&get_buf()); }\n\n //!Constructor. Throws if vector_type(const VectorParameter ¶m)\n //!throws.\n template\n basic_ovectorstream(const VectorParameter ¶m,\n std::ios_base::openmode mode = std::ios_base::out)\n : base_t(0) //Initializes first the base class to safely init the virtual basic_ios base\n //(via basic_ios::init() call in base_t's constructor) without the risk of a\n //previous throwing vectorbuf constructor. Set the streambuf after risk has gone.\n , vectorbuf_t(param, mode | std::ios_base::out)\n { this->base_t::rdbuf(&get_buf()); }\n\n public:\n //!Returns the address of the stored\n //!stream buffer.\n basic_vectorbuf* rdbuf() const\n { return const_cast*>(&get_buf()); }\n\n //!Swaps the underlying vector with the passed vector.\n //!This function resets the write position in the stream.\n //!Does not throw.\n void swap_vector(vector_type &vect)\n { get_buf().swap_vector(vect); }\n\n //!Returns a const reference to the internal vector.\n //!Does not throw.\n const vector_type &vector() const\n { return get_buf().vector(); }\n\n //!Calls reserve() method of the internal vector.\n //!Resets the stream to the first position.\n //!Throws if the internals vector's reserve throws.\n void reserve(typename vector_type::size_type size)\n { get_buf().reserve(size); }\n};\n\n//!A basic_iostream class that holds a character vector specified by CharVector\n//!template parameter as its formatting buffer. The vector must have\n//!contiguous storage, like std::vector, boost::interprocess::vector or\n//!boost::interprocess::basic_string\ntemplate \nclass basic_vectorstream\n : public std::basic_iostream\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n , private basic_vectorbuf\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n{\n public:\n typedef CharVector vector_type;\n typedef typename std::basic_ios\n ::char_type char_type;\n typedef typename std::basic_ios::int_type int_type;\n typedef typename std::basic_ios::pos_type pos_type;\n typedef typename std::basic_ios::off_type off_type;\n typedef typename std::basic_ios::traits_type traits_type;\n\n #if !defined(BOOST_INTERPROCESS_DOXYGEN_INVOKED)\n private:\n typedef basic_vectorbuf vectorbuf_t;\n typedef std::basic_ios basic_ios_t;\n typedef std::basic_iostream base_t;\n\n vectorbuf_t & get_buf() { return *this; }\n const vectorbuf_t & get_buf() const{ return *this; }\n #endif //#ifndef BOOST_INTERPROCESS_DOXYGEN_INVOKED\n\n public:\n //!Constructor. Throws if vector_type default\n //!constructor throws.\n basic_vectorstream(std::ios_base::openmode mode\n = std::ios_base::in | std::ios_base::out)\n : base_t(0) //Initializes first the base class to safely init the virtual basic_ios base\n //(via basic_ios::init() call in base_t's constructor) without the risk of a\n //previous throwing vectorbuf constructor. Set the streambuf after risk has gone.\n , vectorbuf_t(mode)\n { this->base_t::rdbuf(&get_buf()); }\n\n //!Constructor. Throws if vector_type(const VectorParameter ¶m)\n //!throws.\n template\n basic_vectorstream(const VectorParameter ¶m, std::ios_base::openmode mode\n = std::ios_base::in | std::ios_base::out)\n : base_t(0) //Initializes first the base class to safely init the virtual basic_ios base\n //(via basic_ios::init() call in base_t's constructor) without the risk of a\n //previous throwing vectorbuf constructor. Set the streambuf after risk has gone.\n , vectorbuf_t(param, mode)\n { this->base_t::rdbuf(&get_buf()); }\n\n public:\n //Returns the address of the stored stream buffer.\n basic_vectorbuf* rdbuf() const\n { return const_cast*>(&get_buf()); }\n\n //!Swaps the underlying vector with the passed vector.\n //!This function resets the read/write position in the stream.\n //!Does not throw.\n void swap_vector(vector_type &vect)\n { get_buf().swap_vector(vect); }\n\n //!Returns a const reference to the internal vector.\n //!Does not throw.\n const vector_type &vector() const\n { return get_buf().vector(); }\n\n //!Calls reserve() method of the internal vector.\n //!Resets the stream to the first position.\n //!Throws if the internals vector's reserve throws.\n void reserve(typename vector_type::size_type size)\n { get_buf().reserve(size); }\n\n //!Calls clear() method of the internal vector.\n //!Resets the stream to the first position.\n void clear()\n { get_buf().clear(); }\n};\n\n//Some typedefs to simplify usage\n//!\n//!typedef basic_vectorbuf > vectorbuf;\n//!typedef basic_vectorstream > vectorstream;\n//!typedef basic_ivectorstream > ivectorstream;\n//!typedef basic_ovectorstream > ovectorstream;\n//!\n//!typedef basic_vectorbuf > wvectorbuf;\n//!typedef basic_vectorstream > wvectorstream;\n//!typedef basic_ivectorstream > wivectorstream;\n//!typedef basic_ovectorstream > wovectorstream;\n\n}} //namespace boost { namespace interprocess {\n\n#ifdef __GNUC__\n#pragma GCC diagnostic pop\n#endif\n\n#endif /* BOOST_INTERPROCESS_VECTORSTREAM_HPP */\n" }, { "path": "libs/boost/vectorstream.hpp", "content": "#pragma once\n\n#ifndef BOOST_OVERRIDE\n#define BOOST_OVERRIDE override\n#endif\n\n#ifndef BOOST_ASSERT\n#define BOOST_ASSERT(expr)\n#endif\n\n#include \"boost-vectorstream.hpp\"\n\ntemplate \nusing ovectorstream = boost::interprocess::basic_ovectorstream>;\n\ntemplate \nusing ivectorstream = boost::interprocess::basic_ivectorstream>;\n" }, { "path": "libs/brotli/LICENSE", "content": "Copyright (c) 2009, 2010, 2013-2016 by the Brotli Authors.\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n" }, { "path": "libs/brotli/Makefile.am", "content": "if !HAVE_BROTLI\nnoinst_LIBRARIES = libbrotli.a\nlibbrotli_a_SOURCES = \\\n\tcommon/constants.c \\\n\tcommon/constants.h \\\n\tcommon/context.c \\\n\tcommon/context.h \\\n\tcommon/dictionary.c \\\n\tcommon/dictionary.h \\\n\tcommon/dictionary_inc.h \\\n\tcommon/platform.c \\\n\tcommon/platform.h \\\n\tcommon/shared_dictionary_internal.h \\\n\tcommon/static_init.h \\\n\tcommon/transform.c \\\n\tcommon/transform.h \\\n\tcommon/version.h \\\n\tenc/backward_references.c \\\n\tenc/backward_references.h \\\n\tenc/backward_references_hq.c \\\n\tenc/backward_references_hq.h \\\n\tenc/backward_references_inc.h \\\n\tenc/bit_cost.c \\\n\tenc/bit_cost.h \\\n\tenc/bit_cost_inc.h \\\n\tenc/block_encoder_inc.h \\\n\tenc/block_splitter.c \\\n\tenc/block_splitter.h \\\n\tenc/block_splitter_inc.h \\\n\tenc/brotli_bit_stream.c \\\n\tenc/brotli_bit_stream.h \\\n\tenc/cluster.c \\\n\tenc/cluster.h \\\n\tenc/cluster_inc.h \\\n\tenc/command.c \\\n\tenc/command.h \\\n\tenc/compound_dictionary.c \\\n\tenc/compound_dictionary.h \\\n\tenc/compress_fragment.c \\\n\tenc/compress_fragment.h \\\n\tenc/compress_fragment_two_pass.c \\\n\tenc/compress_fragment_two_pass.h \\\n\tenc/dictionary_hash.c \\\n\tenc/dictionary_hash.h \\\n\tenc/dictionary_hash_inc.h \\\n\tenc/encode.c \\\n\tenc/encoder_dict.c \\\n\tenc/encoder_dict.h \\\n\tenc/entropy_encode.c \\\n\tenc/entropy_encode.h \\\n\tenc/entropy_encode_static.h \\\n\tenc/fast_log.c \\\n\tenc/fast_log.h \\\n\tenc/find_match_length.h \\\n\tenc/hash.h \\\n\tenc/hash_base.h \\\n\tenc/hash_composite_inc.h \\\n\tenc/hash_forgetful_chain_inc.h \\\n\tenc/hash_longest_match64_inc.h \\\n\tenc/hash_longest_match64_simd_inc.h \\\n\tenc/hash_longest_match_inc.h \\\n\tenc/hash_longest_match_quickly_inc.h \\\n\tenc/hash_longest_match_simd_inc.h \\\n\tenc/hash_rolling_inc.h \\\n\tenc/hash_to_binary_tree_inc.h \\\n\tenc/histogram.c \\\n\tenc/histogram.h \\\n\tenc/histogram_inc.h \\\n\tenc/literal_cost.c \\\n\tenc/literal_cost.h \\\n\tenc/matching_tag_mask.h \\\n\tenc/memory.c \\\n\tenc/memory.h \\\n\tenc/metablock.c \\\n\tenc/metablock.h \\\n\tenc/metablock_inc.h \\\n\tenc/params.h \\\n\tenc/prefix.h \\\n\tenc/quality.h \\\n\tenc/ringbuffer.h \\\n\tenc/state.h \\\n\tenc/static_dict.c \\\n\tenc/static_dict.h \\\n\tenc/static_dict_lut.c \\\n\tenc/static_dict_lut.h \\\n\tenc/static_dict_lut_inc.h \\\n\tenc/static_init.c \\\n\tenc/static_init.h \\\n\tenc/utf8_util.c \\\n\tenc/utf8_util.h \\\n\tenc/write_bits.h \\\n\tinclude/brotli/decode.h \\\n\tinclude/brotli/encode.h \\\n\tinclude/brotli/port.h \\\n\tinclude/brotli/shared_dictionary.h \\\n\tinclude/brotli/types.h\n\nAM_CFLAGS = -Wall -I$(srcdir)/include\n\nendif\n\nEXTRA_DIST = LICENSE\nCLEANFILES = *.gcda *.gcno\n" }, { "path": "libs/brotli/common/constants.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"constants.h\"\n\nconst BROTLI_MODEL(\"small\")\nBrotliPrefixCodeRange _kBrotliPrefixCodeRanges[BROTLI_NUM_BLOCK_LEN_SYMBOLS] = {\n {1, 2}, {5, 2}, {9, 2}, {13, 2}, {17, 3}, {25, 3},\n {33, 3}, {41, 3}, {49, 4}, {65, 4}, {81, 4}, {97, 4},\n {113, 5}, {145, 5}, {177, 5}, {209, 5}, {241, 6}, {305, 6},\n {369, 7}, {497, 8}, {753, 9}, {1265, 10}, {2289, 11}, {4337, 12},\n {8433, 13}, {16625, 24}};\n" }, { "path": "libs/brotli/common/constants.h", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/**\n * @file\n * Common constants used in decoder and encoder API.\n */\n\n#ifndef BROTLI_COMMON_CONSTANTS_H_\n#define BROTLI_COMMON_CONSTANTS_H_\n\n#include \"platform.h\"\n\n/* Specification: 7.3. Encoding of the context map */\n#define BROTLI_CONTEXT_MAP_MAX_RLE 16\n\n/* Specification: 2. Compressed representation overview */\n#define BROTLI_MAX_NUMBER_OF_BLOCK_TYPES 256\n\n/* Specification: 3.3. Alphabet sizes: insert-and-copy length */\n#define BROTLI_NUM_LITERAL_SYMBOLS 256\n#define BROTLI_NUM_COMMAND_SYMBOLS 704\n#define BROTLI_NUM_BLOCK_LEN_SYMBOLS 26\n#define BROTLI_MAX_CONTEXT_MAP_SYMBOLS (BROTLI_MAX_NUMBER_OF_BLOCK_TYPES + \\\n BROTLI_CONTEXT_MAP_MAX_RLE)\n#define BROTLI_MAX_BLOCK_TYPE_SYMBOLS (BROTLI_MAX_NUMBER_OF_BLOCK_TYPES + 2)\n\n/* Specification: 3.5. Complex prefix codes */\n#define BROTLI_REPEAT_PREVIOUS_CODE_LENGTH 16\n#define BROTLI_REPEAT_ZERO_CODE_LENGTH 17\n#define BROTLI_CODE_LENGTH_CODES (BROTLI_REPEAT_ZERO_CODE_LENGTH + 1)\n/* \"code length of 8 is repeated\" */\n#define BROTLI_INITIAL_REPEATED_CODE_LENGTH 8\n\n/* \"Large Window Brotli\" */\n\n/**\n * The theoretical maximum number of distance bits specified for large window\n * brotli, for 64-bit encoders and decoders. Even when in practice 32-bit\n * encoders and decoders only support up to 30 max distance bits, the value is\n * set to 62 because it affects the large window brotli file format.\n * Specifically, it affects the encoding of simple huffman tree for distances,\n * see Specification RFC 7932 chapter 3.4.\n */\n#define BROTLI_LARGE_MAX_DISTANCE_BITS 62U\n#define BROTLI_LARGE_MIN_WBITS 10\n/**\n * The maximum supported large brotli window bits by the encoder and decoder.\n * Large window brotli allows up to 62 bits, however the current encoder and\n * decoder, designed for 32-bit integers, only support up to 30 bits maximum.\n */\n#define BROTLI_LARGE_MAX_WBITS 30\n\n/* Specification: 4. Encoding of distances */\n#define BROTLI_NUM_DISTANCE_SHORT_CODES 16\n/**\n * Maximal number of \"postfix\" bits.\n *\n * Number of \"postfix\" bits is stored as 2 bits in meta-block header.\n */\n#define BROTLI_MAX_NPOSTFIX 3\n#define BROTLI_MAX_NDIRECT 120\n#define BROTLI_MAX_DISTANCE_BITS 24U\n#define BROTLI_DISTANCE_ALPHABET_SIZE(NPOSTFIX, NDIRECT, MAXNBITS) ( \\\n BROTLI_NUM_DISTANCE_SHORT_CODES + (NDIRECT) + \\\n ((MAXNBITS) << ((NPOSTFIX) + 1)))\n/* BROTLI_NUM_DISTANCE_SYMBOLS == 1128 */\n#define BROTLI_NUM_DISTANCE_SYMBOLS \\\n BROTLI_DISTANCE_ALPHABET_SIZE( \\\n BROTLI_MAX_NDIRECT, BROTLI_MAX_NPOSTFIX, BROTLI_LARGE_MAX_DISTANCE_BITS)\n\n/* ((1 << 26) - 4) is the maximal distance that can be expressed in RFC 7932\n brotli stream using NPOSTFIX = 0 and NDIRECT = 0. With other NPOSTFIX and\n NDIRECT values distances up to ((1 << 29) + 88) could be expressed. */\n#define BROTLI_MAX_DISTANCE 0x3FFFFFC\n\n/* ((1 << 31) - 4) is the safe distance limit. Using this number as a limit\n allows safe distance calculation without overflows, given the distance\n alphabet size is limited to corresponding size\n (see kLargeWindowDistanceCodeLimits). */\n#define BROTLI_MAX_ALLOWED_DISTANCE 0x7FFFFFFC\n\n\n/* Specification: 4. Encoding of Literal Insertion Lengths and Copy Lengths */\n#define BROTLI_NUM_INS_COPY_CODES 24\n\n/* 7.1. Context modes and context ID lookup for literals */\n/* \"context IDs for literals are in the range of 0..63\" */\n#define BROTLI_LITERAL_CONTEXT_BITS 6\n\n/* 7.2. Context ID for distances */\n#define BROTLI_DISTANCE_CONTEXT_BITS 2\n\n/* 9.1. Format of the Stream Header */\n/* Number of slack bytes for window size. Don't confuse\n with BROTLI_NUM_DISTANCE_SHORT_CODES. */\n#define BROTLI_WINDOW_GAP 16\n#define BROTLI_MAX_BACKWARD_LIMIT(W) (((size_t)1 << (W)) - BROTLI_WINDOW_GAP)\n\ntypedef struct BrotliDistanceCodeLimit {\n uint32_t max_alphabet_size;\n uint32_t max_distance;\n} BrotliDistanceCodeLimit;\n\n/* This function calculates maximal size of distance alphabet, such that the\n distances greater than the given values can not be represented.\n\n This limits are designed to support fast and safe 32-bit decoders.\n \"32-bit\" means that signed integer values up to ((1 << 31) - 1) could be\n safely expressed.\n\n Brotli distance alphabet symbols do not represent consecutive distance\n ranges. Each distance alphabet symbol (excluding direct distances and short\n codes), represent interleaved (for NPOSTFIX > 0) range of distances.\n A \"group\" of consecutive (1 << NPOSTFIX) symbols represent non-interleaved\n range. Two consecutive groups require the same amount of \"extra bits\".\n\n It is important that distance alphabet represents complete \"groups\".\n To avoid complex logic on encoder side about interleaved ranges\n it was decided to restrict both sides to complete distance code \"groups\".\n */\nBROTLI_UNUSED_FUNCTION BrotliDistanceCodeLimit BrotliCalculateDistanceCodeLimit(\n uint32_t max_distance, uint32_t npostfix, uint32_t ndirect) {\n BrotliDistanceCodeLimit result;\n /* Marking this function as unused, because not all files\n including \"constants.h\" use it -> compiler warns about that. */\n BROTLI_UNUSED(&BrotliCalculateDistanceCodeLimit);\n if (max_distance <= ndirect) {\n /* This case never happens / exists only for the sake of completeness. */\n result.max_alphabet_size = max_distance + BROTLI_NUM_DISTANCE_SHORT_CODES;\n result.max_distance = max_distance;\n return result;\n } else {\n /* The first prohibited value. */\n uint32_t forbidden_distance = max_distance + 1;\n /* Subtract \"directly\" encoded region. */\n uint32_t offset = forbidden_distance - ndirect - 1;\n uint32_t ndistbits = 0;\n uint32_t tmp;\n uint32_t half;\n uint32_t group;\n /* Postfix for the last dcode in the group. */\n uint32_t postfix = (1u << npostfix) - 1;\n uint32_t extra;\n uint32_t start;\n /* Remove postfix and \"head-start\". */\n offset = (offset >> npostfix) + 4;\n /* Calculate the number of distance bits. */\n tmp = offset / 2;\n /* Poor-man's log2floor, to avoid extra dependencies. */\n while (tmp != 0) {ndistbits++; tmp = tmp >> 1;}\n /* One bit is covered with subrange addressing (\"half\"). */\n ndistbits--;\n /* Find subrange. */\n half = (offset >> ndistbits) & 1;\n /* Calculate the \"group\" part of dcode. */\n group = ((ndistbits - 1) << 1) | half;\n /* Calculated \"group\" covers the prohibited distance value. */\n if (group == 0) {\n /* This case is added for correctness; does not occur for limit > 128. */\n result.max_alphabet_size = ndirect + BROTLI_NUM_DISTANCE_SHORT_CODES;\n result.max_distance = ndirect;\n return result;\n }\n /* Decrement \"group\", so it is the last permitted \"group\". */\n group--;\n /* After group was decremented, ndistbits and half must be recalculated. */\n ndistbits = (group >> 1) + 1;\n /* The last available distance in the subrange has all extra bits set. */\n extra = (1u << ndistbits) - 1;\n /* Calculate region start. NB: ndistbits >= 1. */\n start = (1u << (ndistbits + 1)) - 4;\n /* Move to subregion. */\n start += (group & 1) << ndistbits;\n /* Calculate the alphabet size. */\n result.max_alphabet_size = ((group << npostfix) | postfix) + ndirect +\n BROTLI_NUM_DISTANCE_SHORT_CODES + 1;\n /* Calculate the maximal distance representable by alphabet. */\n result.max_distance = ((start + extra) << npostfix) + postfix + ndirect + 1;\n return result;\n }\n}\n\n/* Represents the range of values belonging to a prefix code:\n [offset, offset + 2^nbits) */\ntypedef struct {\n uint16_t offset;\n uint8_t nbits;\n} BrotliPrefixCodeRange;\n\n/* \"Soft-private\", it is exported, but not \"advertised\" as API. */\nBROTLI_COMMON_API extern const BROTLI_MODEL(\"small\")\nBrotliPrefixCodeRange _kBrotliPrefixCodeRanges[BROTLI_NUM_BLOCK_LEN_SYMBOLS];\n\n#endif /* BROTLI_COMMON_CONSTANTS_H_ */\n" }, { "path": "libs/brotli/common/context.c", "content": "#include \"context.h\"\n\n#include \"platform.h\"\n\n/* Common context lookup table for all context modes. */\nconst BROTLI_MODEL(\"small\") uint8_t _kBrotliContextLookupTable[2048] = {\n /* CONTEXT_LSB6, last byte. */\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,\n 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,\n 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,\n 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31,\n 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47,\n 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63,\n\n /* CONTEXT_LSB6, second last byte, */\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\n /* CONTEXT_MSB6, last byte. */\n 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3,\n 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7,\n 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11,\n 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15,\n 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19,\n 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 23,\n 24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27,\n 28, 28, 28, 28, 29, 29, 29, 29, 30, 30, 30, 30, 31, 31, 31, 31,\n 32, 32, 32, 32, 33, 33, 33, 33, 34, 34, 34, 34, 35, 35, 35, 35,\n 36, 36, 36, 36, 37, 37, 37, 37, 38, 38, 38, 38, 39, 39, 39, 39,\n 40, 40, 40, 40, 41, 41, 41, 41, 42, 42, 42, 42, 43, 43, 43, 43,\n 44, 44, 44, 44, 45, 45, 45, 45, 46, 46, 46, 46, 47, 47, 47, 47,\n 48, 48, 48, 48, 49, 49, 49, 49, 50, 50, 50, 50, 51, 51, 51, 51,\n 52, 52, 52, 52, 53, 53, 53, 53, 54, 54, 54, 54, 55, 55, 55, 55,\n 56, 56, 56, 56, 57, 57, 57, 57, 58, 58, 58, 58, 59, 59, 59, 59,\n 60, 60, 60, 60, 61, 61, 61, 61, 62, 62, 62, 62, 63, 63, 63, 63,\n\n /* CONTEXT_MSB6, second last byte, */\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n\n /* CONTEXT_UTF8, last byte. */\n /* ASCII range. */\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 0, 4, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 8, 12, 16, 12, 12, 20, 12, 16, 24, 28, 12, 12, 32, 12, 36, 12,\n 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 32, 32, 24, 40, 28, 12,\n 12, 48, 52, 52, 52, 48, 52, 52, 52, 48, 52, 52, 52, 52, 52, 48,\n 52, 52, 52, 52, 52, 48, 52, 52, 52, 52, 52, 24, 12, 28, 12, 12,\n 12, 56, 60, 60, 60, 56, 60, 60, 60, 56, 60, 60, 60, 60, 60, 56,\n 60, 60, 60, 60, 60, 56, 60, 60, 60, 60, 60, 24, 12, 28, 12, 0,\n /* UTF8 continuation byte range. */\n 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,\n 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,\n 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,\n 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1,\n /* UTF8 lead byte range. */\n 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,\n 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,\n 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,\n 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3,\n\n /* CONTEXT_UTF8 second last byte. */\n /* ASCII range. */\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\n 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1,\n 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\n 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1,\n 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,\n 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 0,\n /* UTF8 continuation byte range. */\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n /* UTF8 lead byte range. */\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\n 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\n\n /* CONTEXT_SIGNED, last byte, same as the above values shifted by 3 bits. */\n 0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,\n 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,\n 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,\n 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,\n 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32,\n 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,\n 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,\n 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40,\n 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 56,\n\n /* CONTEXT_SIGNED, second last byte. */\n 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\n 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\n 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\n 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,\n 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,\n 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,\n 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,\n 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,\n 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,\n 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,\n 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,\n 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,\n 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7,\n};\n" }, { "path": "libs/brotli/common/context.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Lookup table to map the previous two bytes to a context id.\n\n There are four different context modeling modes defined here:\n CONTEXT_LSB6: context id is the least significant 6 bits of the last byte,\n CONTEXT_MSB6: context id is the most significant 6 bits of the last byte,\n CONTEXT_UTF8: second-order context model tuned for UTF8-encoded text,\n CONTEXT_SIGNED: second-order context model tuned for signed integers.\n\n If |p1| and |p2| are the previous two bytes, and |mode| is current context\n mode, we calculate the context as:\n\n context = ContextLut(mode)[p1] | ContextLut(mode)[p2 + 256].\n\n For CONTEXT_UTF8 mode, if the previous two bytes are ASCII characters\n (i.e. < 128), this will be equivalent to\n\n context = 4 * context1(p1) + context2(p2),\n\n where context1 is based on the previous byte in the following way:\n\n 0 : non-ASCII control\n 1 : \\t, \\n, \\r\n 2 : space\n 3 : other punctuation\n 4 : \" '\n 5 : %\n 6 : ( < [ {\n 7 : ) > ] }\n 8 : , ; :\n 9 : .\n 10 : =\n 11 : number\n 12 : upper-case vowel\n 13 : upper-case consonant\n 14 : lower-case vowel\n 15 : lower-case consonant\n\n and context2 is based on the second last byte:\n\n 0 : control, space\n 1 : punctuation\n 2 : upper-case letter, number\n 3 : lower-case letter\n\n If the last byte is ASCII, and the second last byte is not (in a valid UTF8\n stream it will be a continuation byte, value between 128 and 191), the\n context is the same as if the second last byte was an ASCII control or space.\n\n If the last byte is a UTF8 lead byte (value >= 192), then the next byte will\n be a continuation byte and the context id is 2 or 3 depending on the LSB of\n the last byte and to a lesser extent on the second last byte if it is ASCII.\n\n If the last byte is a UTF8 continuation byte, the second last byte can be:\n - continuation byte: the next byte is probably ASCII or lead byte (assuming\n 4-byte UTF8 characters are rare) and the context id is 0 or 1.\n - lead byte (192 - 207): next byte is ASCII or lead byte, context is 0 or 1\n - lead byte (208 - 255): next byte is continuation byte, context is 2 or 3\n\n The possible value combinations of the previous two bytes, the range of\n context ids and the type of the next byte is summarized in the table below:\n\n |--------\\-----------------------------------------------------------------|\n | \\ Last byte |\n | Second \\---------------------------------------------------------------|\n | last byte \\ ASCII | cont. byte | lead byte |\n | \\ (0-127) | (128-191) | (192-) |\n |=============|===================|=====================|==================|\n | ASCII | next: ASCII/lead | not valid | next: cont. |\n | (0-127) | context: 4 - 63 | | context: 2 - 3 |\n |-------------|-------------------|---------------------|------------------|\n | cont. byte | next: ASCII/lead | next: ASCII/lead | next: cont. |\n | (128-191) | context: 4 - 63 | context: 0 - 1 | context: 2 - 3 |\n |-------------|-------------------|---------------------|------------------|\n | lead byte | not valid | next: ASCII/lead | not valid |\n | (192-207) | | context: 0 - 1 | |\n |-------------|-------------------|---------------------|------------------|\n | lead byte | not valid | next: cont. | not valid |\n | (208-) | | context: 2 - 3 | |\n |-------------|-------------------|---------------------|------------------|\n*/\n\n#ifndef BROTLI_COMMON_CONTEXT_H_\n#define BROTLI_COMMON_CONTEXT_H_\n\n#include \"platform.h\"\n\ntypedef enum ContextType {\n CONTEXT_LSB6 = 0,\n CONTEXT_MSB6 = 1,\n CONTEXT_UTF8 = 2,\n CONTEXT_SIGNED = 3\n} ContextType;\n\n/* \"Soft-private\", it is exported, but not \"advertised\" as API. */\n/* Common context lookup table for all context modes. */\nBROTLI_COMMON_API extern const uint8_t _kBrotliContextLookupTable[2048];\n\ntypedef const uint8_t* ContextLut;\n\n/* typeof(MODE) == ContextType; returns ContextLut */\n#define BROTLI_CONTEXT_LUT(MODE) (&_kBrotliContextLookupTable[(MODE) << 9])\n\n/* typeof(LUT) == ContextLut */\n#define BROTLI_CONTEXT(P1, P2, LUT) ((LUT)[P1] | ((LUT) + 256)[P2])\n\n#endif /* BROTLI_COMMON_CONTEXT_H_ */\n" }, { "path": "libs/brotli/common/dictionary.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"dictionary.h\"\n#include \"platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#if !defined(BROTLI_EXTERNAL_DICTIONARY_DATA)\n/* Embed kBrotliDictionaryData */\n#include \"dictionary_inc.h\"\nstatic const BROTLI_MODEL(\"small\") BrotliDictionary kBrotliDictionary = {\n#else\nstatic BROTLI_MODEL(\"small\") BrotliDictionary kBrotliDictionary = {\n#endif\n /* size_bits_by_length */\n {\n 0, 0, 0, 0, 10, 10, 11, 11,\n 10, 10, 10, 10, 10, 9, 9, 8,\n 7, 7, 8, 7, 7, 6, 6, 5,\n 5, 0, 0, 0, 0, 0, 0, 0\n },\n\n /* offsets_by_length */\n {\n 0, 0, 0, 0, 0, 4096, 9216, 21504,\n 35840, 44032, 53248, 63488, 74752, 87040, 93696, 100864,\n 104704, 106752, 108928, 113536, 115968, 118528, 119872, 121280,\n 122016, 122784, 122784, 122784, 122784, 122784, 122784, 122784\n },\n\n /* data_size == sizeof(kBrotliDictionaryData) */\n 122784,\n\n /* data */\n#if defined(BROTLI_EXTERNAL_DICTIONARY_DATA)\n NULL\n#else\n kBrotliDictionaryData\n#endif\n};\n\nconst BrotliDictionary* BrotliGetDictionary(void) {\n return &kBrotliDictionary;\n}\n\nvoid BrotliSetDictionaryData(const uint8_t* data) {\n#if defined(BROTLI_EXTERNAL_DICTIONARY_DATA)\n if (!!data && !kBrotliDictionary.data) {\n kBrotliDictionary.data = data;\n }\n#else\n BROTLI_UNUSED(data); // Appease -Werror=unused-parameter\n#endif\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/common/dictionary.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Collection of static dictionary words. */\n\n#ifndef BROTLI_COMMON_DICTIONARY_H_\n#define BROTLI_COMMON_DICTIONARY_H_\n\n#include \"platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ntypedef struct BrotliDictionary {\n /**\n * Number of bits to encode index of dictionary word in a bucket.\n *\n * Specification: Appendix A. Static Dictionary Data\n *\n * Words in a dictionary are bucketed by length.\n * @c 0 means that there are no words of a given length.\n * Dictionary consists of words with length of [4..24] bytes.\n * Values at [0..3] and [25..31] indices should not be addressed.\n */\n uint8_t size_bits_by_length[32];\n\n /* assert(offset[i + 1] == offset[i] + (bits[i] ? (i << bits[i]) : 0)) */\n uint32_t offsets_by_length[32];\n\n /* assert(data_size == offsets_by_length[31]) */\n size_t data_size;\n\n /* Data array is not bound, and should obey to size_bits_by_length values.\n Specified size matches default (RFC 7932) dictionary. Its size is\n defined by data_size */\n const uint8_t* data;\n} BrotliDictionary;\n\nBROTLI_COMMON_API const BrotliDictionary* BrotliGetDictionary(void);\n\n/**\n * Sets dictionary data.\n *\n * When dictionary data is already set / present, this method is no-op.\n *\n * Dictionary data MUST be provided before BrotliGetDictionary is invoked.\n * This method is used ONLY in multi-client environment (e.g. C + Java),\n * to reduce storage by sharing single dictionary between implementations.\n */\nBROTLI_COMMON_API void BrotliSetDictionaryData(const uint8_t* data);\n\n#define BROTLI_MIN_DICTIONARY_WORD_LENGTH 4\n#define BROTLI_MAX_DICTIONARY_WORD_LENGTH 24\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_COMMON_DICTIONARY_H_ */\n" }, { "path": "libs/brotli/common/dictionary_inc.h", "content": "static const BROTLI_MODEL(\"small\") uint8_t kBrotliDictionaryData[] = {\n116,105,109,101,100,111,119,110,108,105,102,101,108,101,102,116,98,97,99,107,99,\n111,100,101,100,97,116,97,115,104,111,119,111,110,108,121,115,105,116,101,99,105\n,116,121,111,112,101,110,106,117,115,116,108,105,107,101,102,114,101,101,119,111\n,114,107,116,101,120,116,121,101,97,114,111,118,101,114,98,111,100,121,108,111,\n118,101,102,111,114,109,98,111,111,107,112,108,97,121,108,105,118,101,108,105,\n110,101,104,101,108,112,104,111,109,101,115,105,100,101,109,111,114,101,119,111,\n114,100,108,111,110,103,116,104,101,109,118,105,101,119,102,105,110,100,112,97,\n103,101,100,97,121,115,102,117,108,108,104,101,97,100,116,101,114,109,101,97,99,\n104,97,114,101,97,102,114,111,109,116,114,117,101,109,97,114,107,97,98,108,101,\n117,112,111,110,104,105,103,104,100,97,116,101,108,97,110,100,110,101,119,115,\n101,118,101,110,110,101,120,116,99,97,115,101,98,111,116,104,112,111,115,116,117\n,115,101,100,109,97,100,101,104,97,110,100,104,101,114,101,119,104,97,116,110,97\n,109,101,76,105,110,107,98,108,111,103,115,105,122,101,98,97,115,101,104,101,108\n,100,109,97,107,101,109,97,105,110,117,115,101,114,39,41,32,43,104,111,108,100,\n101,110,100,115,119,105,116,104,78,101,119,115,114,101,97,100,119,101,114,101,\n115,105,103,110,116,97,107,101,104,97,118,101,103,97,109,101,115,101,101,110,99,\n97,108,108,112,97,116,104,119,101,108,108,112,108,117,115,109,101,110,117,102,\n105,108,109,112,97,114,116,106,111,105,110,116,104,105,115,108,105,115,116,103,\n111,111,100,110,101,101,100,119,97,121,115,119,101,115,116,106,111,98,115,109,\n105,110,100,97,108,115,111,108,111,103,111,114,105,99,104,117,115,101,115,108,97\n,115,116,116,101,97,109,97,114,109,121,102,111,111,100,107,105,110,103,119,105,\n108,108,101,97,115,116,119,97,114,100,98,101,115,116,102,105,114,101,80,97,103,\n101,107,110,111,119,97,119,97,121,46,112,110,103,109,111,118,101,116,104,97,110,\n108,111,97,100,103,105,118,101,115,101,108,102,110,111,116,101,109,117,99,104,\n102,101,101,100,109,97,110,121,114,111,99,107,105,99,111,110,111,110,99,101,108,\n111,111,107,104,105,100,101,100,105,101,100,72,111,109,101,114,117,108,101,104,\n111,115,116,97,106,97,120,105,110,102,111,99,108,117,98,108,97,119,115,108,101,\n115,115,104,97,108,102,115,111,109,101,115,117,99,104,122,111,110,101,49,48,48,\n37,111,110,101,115,99,97,114,101,84,105,109,101,114,97,99,101,98,108,117,101,102\n,111,117,114,119,101,101,107,102,97,99,101,104,111,112,101,103,97,118,101,104,97\n,114,100,108,111,115,116,119,104,101,110,112,97,114,107,107,101,112,116,112,97,\n115,115,115,104,105,112,114,111,111,109,72,84,77,76,112,108,97,110,84,121,112,\n101,100,111,110,101,115,97,118,101,107,101,101,112,102,108,97,103,108,105,110,\n107,115,111,108,100,102,105,118,101,116,111,111,107,114,97,116,101,116,111,119,\n110,106,117,109,112,116,104,117,115,100,97,114,107,99,97,114,100,102,105,108,101\n,102,101,97,114,115,116,97,121,107,105,108,108,116,104,97,116,102,97,108,108,97,\n117,116,111,101,118,101,114,46,99,111,109,116,97,108,107,115,104,111,112,118,111\n,116,101,100,101,101,112,109,111,100,101,114,101,115,116,116,117,114,110,98,111,\n114,110,98,97,110,100,102,101,108,108,114,111,115,101,117,114,108,40,115,107,105\n,110,114,111,108,101,99,111,109,101,97,99,116,115,97,103,101,115,109,101,101,116\n,103,111,108,100,46,106,112,103,105,116,101,109,118,97,114,121,102,101,108,116,\n116,104,101,110,115,101,110,100,100,114,111,112,86,105,101,119,99,111,112,121,49\n,46,48,34,60,47,97,62,115,116,111,112,101,108,115,101,108,105,101,115,116,111,\n117,114,112,97,99,107,46,103,105,102,112,97,115,116,99,115,115,63,103,114,97,121\n,109,101,97,110,38,103,116,59,114,105,100,101,115,104,111,116,108,97,116,101,115\n,97,105,100,114,111,97,100,118,97,114,32,102,101,101,108,106,111,104,110,114,105\n,99,107,112,111,114,116,102,97,115,116,39,85,65,45,100,101,97,100,60,47,98,62,\n112,111,111,114,98,105,108,108,116,121,112,101,85,46,83,46,119,111,111,100,109,\n117,115,116,50,112,120,59,73,110,102,111,114,97,110,107,119,105,100,101,119,97,\n110,116,119,97,108,108,108,101,97,100,91,48,93,59,112,97,117,108,119,97,118,101,\n115,117,114,101,36,40,39,35,119,97,105,116,109,97,115,115,97,114,109,115,103,111\n,101,115,103,97,105,110,108,97,110,103,112,97,105,100,33,45,45,32,108,111,99,107\n,117,110,105,116,114,111,111,116,119,97,108,107,102,105,114,109,119,105,102,101,\n120,109,108,34,115,111,110,103,116,101,115,116,50,48,112,120,107,105,110,100,114\n,111,119,115,116,111,111,108,102,111,110,116,109,97,105,108,115,97,102,101,115,\n116,97,114,109,97,112,115,99,111,114,101,114,97,105,110,102,108,111,119,98,97,98\n,121,115,112,97,110,115,97,121,115,52,112,120,59,54,112,120,59,97,114,116,115,\n102,111,111,116,114,101,97,108,119,105,107,105,104,101,97,116,115,116,101,112,\n116,114,105,112,111,114,103,47,108,97,107,101,119,101,97,107,116,111,108,100,70,\n111,114,109,99,97,115,116,102,97,110,115,98,97,110,107,118,101,114,121,114,117,\n110,115,106,117,108,121,116,97,115,107,49,112,120,59,103,111,97,108,103,114,101,\n119,115,108,111,119,101,100,103,101,105,100,61,34,115,101,116,115,53,112,120,59,\n46,106,115,63,52,48,112,120,105,102,32,40,115,111,111,110,115,101,97,116,110,111\n,110,101,116,117,98,101,122,101,114,111,115,101,110,116,114,101,101,100,102,97,\n99,116,105,110,116,111,103,105,102,116,104,97,114,109,49,56,112,120,99,97,109,\n101,104,105,108,108,98,111,108,100,122,111,111,109,118,111,105,100,101,97,115,\n121,114,105,110,103,102,105,108,108,112,101,97,107,105,110,105,116,99,111,115,\n116,51,112,120,59,106,97,99,107,116,97,103,115,98,105,116,115,114,111,108,108,\n101,100,105,116,107,110,101,119,110,101,97,114,60,33,45,45,103,114,111,119,74,83\n,79,78,100,117,116,121,78,97,109,101,115,97,108,101,121,111,117,32,108,111,116,\n115,112,97,105,110,106,97,122,122,99,111,108,100,101,121,101,115,102,105,115,104\n,119,119,119,46,114,105,115,107,116,97,98,115,112,114,101,118,49,48,112,120,114,\n105,115,101,50,53,112,120,66,108,117,101,100,105,110,103,51,48,48,44,98,97,108,\n108,102,111,114,100,101,97,114,110,119,105,108,100,98,111,120,46,102,97,105,114,\n108,97,99,107,118,101,114,115,112,97,105,114,106,117,110,101,116,101,99,104,105,\n102,40,33,112,105,99,107,101,118,105,108,36,40,34,35,119,97,114,109,108,111,114,\n100,100,111,101,115,112,117,108,108,44,48,48,48,105,100,101,97,100,114,97,119,\n104,117,103,101,115,112,111,116,102,117,110,100,98,117,114,110,104,114,101,102,\n99,101,108,108,107,101,121,115,116,105,99,107,104,111,117,114,108,111,115,115,\n102,117,101,108,49,50,112,120,115,117,105,116,100,101,97,108,82,83,83,34,97,103,\n101,100,103,114,101,121,71,69,84,34,101,97,115,101,97,105,109,115,103,105,114,\n108,97,105,100,115,56,112,120,59,110,97,118,121,103,114,105,100,116,105,112,115,\n35,57,57,57,119,97,114,115,108,97,100,121,99,97,114,115,41,59,32,125,112,104,112\n,63,104,101,108,108,116,97,108,108,119,104,111,109,122,104,58,229,42,47,13,10,32\n,49,48,48,104,97,108,108,46,10,10,65,55,112,120,59,112,117,115,104,99,104,97,116\n,48,112,120,59,99,114,101,119,42,47,60,47,104,97,115,104,55,53,112,120,102,108,\n97,116,114,97,114,101,32,38,38,32,116,101,108,108,99,97,109,112,111,110,116,111,\n108,97,105,100,109,105,115,115,115,107,105,112,116,101,110,116,102,105,110,101,\n109,97,108,101,103,101,116,115,112,108,111,116,52,48,48,44,13,10,13,10,99,111,\n111,108,102,101,101,116,46,112,104,112,60,98,114,62,101,114,105,99,109,111,115,\n116,103,117,105,100,98,101,108,108,100,101,115,99,104,97,105,114,109,97,116,104,\n97,116,111,109,47,105,109,103,38,35,56,50,108,117,99,107,99,101,110,116,48,48,48\n,59,116,105,110,121,103,111,110,101,104,116,109,108,115,101,108,108,100,114,117,\n103,70,82,69,69,110,111,100,101,110,105,99,107,63,105,100,61,108,111,115,101,110\n,117,108,108,118,97,115,116,119,105,110,100,82,83,83,32,119,101,97,114,114,101,\n108,121,98,101,101,110,115,97,109,101,100,117,107,101,110,97,115,97,99,97,112,\n101,119,105,115,104,103,117,108,102,84,50,51,58,104,105,116,115,115,108,111,116,\n103,97,116,101,107,105,99,107,98,108,117,114,116,104,101,121,49,53,112,120,39,39\n,41,59,41,59,34,62,109,115,105,101,119,105,110,115,98,105,114,100,115,111,114,\n116,98,101,116,97,115,101,101,107,84,49,56,58,111,114,100,115,116,114,101,101,\n109,97,108,108,54,48,112,120,102,97,114,109,226,128,153,115,98,111,121,115,91,48\n,93,46,39,41,59,34,80,79,83,84,98,101,97,114,107,105,100,115,41,59,125,125,109,\n97,114,121,116,101,110,100,40,85,75,41,113,117,97,100,122,104,58,230,45,115,105,\n122,45,45,45,45,112,114,111,112,39,41,59,13,108,105,102,116,84,49,57,58,118,105,\n99,101,97,110,100,121,100,101,98,116,62,82,83,83,112,111,111,108,110,101,99,107,\n98,108,111,119,84,49,54,58,100,111,111,114,101,118,97,108,84,49,55,58,108,101,\n116,115,102,97,105,108,111,114,97,108,112,111,108,108,110,111,118,97,99,111,108,\n115,103,101,110,101,32,226,128,148,115,111,102,116,114,111,109,101,116,105,108,\n108,114,111,115,115,60,104,51,62,112,111,117,114,102,97,100,101,112,105,110,107,\n60,116,114,62,109,105,110,105,41,124,33,40,109,105,110,101,122,104,58,232,98,97,\n114,115,104,101,97,114,48,48,41,59,109,105,108,107,32,45,45,62,105,114,111,110,\n102,114,101,100,100,105,115,107,119,101,110,116,115,111,105,108,112,117,116,115,\n47,106,115,47,104,111,108,121,84,50,50,58,73,83,66,78,84,50,48,58,97,100,97,109,\n115,101,101,115,60,104,50,62,106,115,111,110,39,44,32,39,99,111,110,116,84,50,49\n,58,32,82,83,83,108,111,111,112,97,115,105,97,109,111,111,110,60,47,112,62,115,\n111,117,108,76,73,78,69,102,111,114,116,99,97,114,116,84,49,52,58,60,104,49,62,\n56,48,112,120,33,45,45,60,57,112,120,59,84,48,52,58,109,105,107,101,58,52,54,90,\n110,105,99,101,105,110,99,104,89,111,114,107,114,105,99,101,122,104,58,228,39,41\n,41,59,112,117,114,101,109,97,103,101,112,97,114,97,116,111,110,101,98,111,110,\n100,58,51,55,90,95,111,102,95,39,93,41,59,48,48,48,44,122,104,58,231,116,97,110,\n107,121,97,114,100,98,111,119,108,98,117,115,104,58,53,54,90,74,97,118,97,51,48,\n112,120,10,124,125,10,37,67,51,37,58,51,52,90,106,101,102,102,69,88,80,73,99,97,\n115,104,118,105,115,97,103,111,108,102,115,110,111,119,122,104,58,233,113,117,\n101,114,46,99,115,115,115,105,99,107,109,101,97,116,109,105,110,46,98,105,110,\n100,100,101,108,108,104,105,114,101,112,105,99,115,114,101,110,116,58,51,54,90,\n72,84,84,80,45,50,48,49,102,111,116,111,119,111,108,102,69,78,68,32,120,98,111,\n120,58,53,52,90,66,79,68,89,100,105,99,107,59,10,125,10,101,120,105,116,58,51,53\n,90,118,97,114,115,98,101,97,116,39,125,41,59,100,105,101,116,57,57,57,59,97,110\n,110,101,125,125,60,47,91,105,93,46,76,97,110,103,107,109,194,178,119,105,114,\n101,116,111,121,115,97,100,100,115,115,101,97,108,97,108,101,120,59,10,9,125,101\n,99,104,111,110,105,110,101,46,111,114,103,48,48,53,41,116,111,110,121,106,101,\n119,115,115,97,110,100,108,101,103,115,114,111,111,102,48,48,48,41,32,50,48,48,\n119,105,110,101,103,101,97,114,100,111,103,115,98,111,111,116,103,97,114,121,99,\n117,116,115,116,121,108,101,116,101,109,112,116,105,111,110,46,120,109,108,99,\n111,99,107,103,97,110,103,36,40,39,46,53,48,112,120,80,104,46,68,109,105,115,99,\n97,108,97,110,108,111,97,110,100,101,115,107,109,105,108,101,114,121,97,110,117,\n110,105,120,100,105,115,99,41,59,125,10,100,117,115,116,99,108,105,112,41,46,10,\n10,55,48,112,120,45,50,48,48,68,86,68,115,55,93,62,60,116,97,112,101,100,101,109\n,111,105,43,43,41,119,97,103,101,101,117,114,111,112,104,105,108,111,112,116,115\n,104,111,108,101,70,65,81,115,97,115,105,110,45,50,54,84,108,97,98,115,112,101,\n116,115,85,82,76,32,98,117,108,107,99,111,111,107,59,125,13,10,72,69,65,68,91,48\n,93,41,97,98,98,114,106,117,97,110,40,49,57,56,108,101,115,104,116,119,105,110,\n60,47,105,62,115,111,110,121,103,117,121,115,102,117,99,107,112,105,112,101,124,\n45,10,33,48,48,50,41,110,100,111,119,91,49,93,59,91,93,59,10,76,111,103,32,115,\n97,108,116,13,10,9,9,98,97,110,103,116,114,105,109,98,97,116,104,41,123,13,10,48\n,48,112,120,10,125,41,59,107,111,58,236,102,101,101,115,97,100,62,13,115,58,47,\n47,32,91,93,59,116,111,108,108,112,108,117,103,40,41,123,10,123,13,10,32,46,106,\n115,39,50,48,48,112,100,117,97,108,98,111,97,116,46,74,80,71,41,59,10,125,113,\n117,111,116,41,59,10,10,39,41,59,10,13,10,125,13,50,48,49,52,50,48,49,53,50,48,\n49,54,50,48,49,55,50,48,49,56,50,48,49,57,50,48,50,48,50,48,50,49,50,48,50,50,50\n,48,50,51,50,48,50,52,50,48,50,53,50,48,50,54,50,48,50,55,50,48,50,56,50,48,50,\n57,50,48,51,48,50,48,51,49,50,48,51,50,50,48,51,51,50,48,51,52,50,48,51,53,50,48\n,51,54,50,48,51,55,50,48,49,51,50,48,49,50,50,48,49,49,50,48,49,48,50,48,48,57,\n50,48,48,56,50,48,48,55,50,48,48,54,50,48,48,53,50,48,48,52,50,48,48,51,50,48,48\n,50,50,48,48,49,50,48,48,48,49,57,57,57,49,57,57,56,49,57,57,55,49,57,57,54,49,\n57,57,53,49,57,57,52,49,57,57,51,49,57,57,50,49,57,57,49,49,57,57,48,49,57,56,57\n,49,57,56,56,49,57,56,55,49,57,56,54,49,57,56,53,49,57,56,52,49,57,56,51,49,57,\n56,50,49,57,56,49,49,57,56,48,49,57,55,57,49,57,55,56,49,57,55,55,49,57,55,54,49\n,57,55,53,49,57,55,52,49,57,55,51,49,57,55,50,49,57,55,49,49,57,55,48,49,57,54,\n57,49,57,54,56,49,57,54,55,49,57,54,54,49,57,54,53,49,57,54,52,49,57,54,51,49,57\n,54,50,49,57,54,49,49,57,54,48,49,57,53,57,49,57,53,56,49,57,53,55,49,57,53,54,\n49,57,53,53,49,57,53,52,49,57,53,51,49,57,53,50,49,57,53,49,49,57,53,48,49,48,48\n,48,49,48,50,52,49,51,57,52,48,48,48,48,57,57,57,57,99,111,109,111,109,195,161,\n115,101,115,116,101,101,115,116,97,112,101,114,111,116,111,100,111,104,97,99,101\n,99,97,100,97,97,195,177,111,98,105,101,110,100,195,173,97,97,115,195,173,118,\n105,100,97,99,97,115,111,111,116,114,111,102,111,114,111,115,111,108,111,111,116\n,114,97,99,117,97,108,100,105,106,111,115,105,100,111,103,114,97,110,116,105,112\n,111,116,101,109,97,100,101,98,101,97,108,103,111,113,117,195,169,101,115,116,\n111,110,97,100,97,116,114,101,115,112,111,99,111,99,97,115,97,98,97,106,111,116,\n111,100,97,115,105,110,111,97,103,117,97,112,117,101,115,117,110,111,115,97,110,\n116,101,100,105,99,101,108,117,105,115,101,108,108,97,109,97,121,111,122,111,110\n,97,97,109,111,114,112,105,115,111,111,98,114,97,99,108,105,99,101,108,108,111,\n100,105,111,115,104,111,114,97,99,97,115,105,208,183,208,176,208,189,208,176,208\n,190,208,188,209,128,208,176,209,128,209,131,209,130,208,176,208,189,208,181,208\n,191,208,190,208,190,209,130,208,184,208,183,208,189,208,190,208,180,208,190,209\n,130,208,190,208,182,208,181,208,190,208,189,208,184,209,133,208,157,208,176,208\n,181,208,181,208,177,209,139,208,188,209,139,208,146,209,139,209,129,208,190,208\n,178,209,139,208,178,208,190,208,157,208,190,208,190,208,177,208,159,208,190,208\n,187,208,184,208,189,208,184,208,160,208,164,208,157,208,181,208,156,209,139,209\n,130,209,139,208,158,208,189,208,184,208,188,208,180,208,176,208,151,208,176,208\n,148,208,176,208,157,209,131,208,158,208,177,209,130,208,181,208,152,208,183,208\n,181,208,185,208,189,209,131,208,188,208,188,208,162,209,139,209,131,208,182,217\n,129,217,138,216,163,217,134,217,133,216,167,217,133,216,185,217,131,217,132,216\n,163,217,136,216,177,216,175,217,138,216,167,217,129,217,137,217,135,217,136,217\n,132,217,133,217,132,217,131,216,167,217,136,217,132,217,135,216,168,216,179,216\n,167,217,132,216,165,217,134,217,135,217,138,216,163,217,138,217,130,216,175,217\n,135,217,132,216,171,217,133,216,168,217,135,217,132,217,136,217,132,217,138,216\n,168,217,132,216,167,217,138,216,168,217,131,216,180,217,138,216,167,217,133,216\n,163,217,133,217,134,216,170,216,168,217,138,217,132,217,134,216,173,216,168,217\n,135,217,133,217,133,216,180,217,136,216,180,102,105,114,115,116,118,105,100,101\n,111,108,105,103,104,116,119,111,114,108,100,109,101,100,105,97,119,104,105,116,\n101,99,108,111,115,101,98,108,97,99,107,114,105,103,104,116,115,109,97,108,108,\n98,111,111,107,115,112,108,97,99,101,109,117,115,105,99,102,105,101,108,100,111,\n114,100,101,114,112,111,105,110,116,118,97,108,117,101,108,101,118,101,108,116,\n97,98,108,101,98,111,97,114,100,104,111,117,115,101,103,114,111,117,112,119,111,\n114,107,115,121,101,97,114,115,115,116,97,116,101,116,111,100,97,121,119,97,116,\n101,114,115,116,97,114,116,115,116,121,108,101,100,101,97,116,104,112,111,119,\n101,114,112,104,111,110,101,110,105,103,104,116,101,114,114,111,114,105,110,112,\n117,116,97,98,111,117,116,116,101,114,109,115,116,105,116,108,101,116,111,111,\n108,115,101,118,101,110,116,108,111,99,97,108,116,105,109,101,115,108,97,114,103\n,101,119,111,114,100,115,103,97,109,101,115,115,104,111,114,116,115,112,97,99,\n101,102,111,99,117,115,99,108,101,97,114,109,111,100,101,108,98,108,111,99,107,\n103,117,105,100,101,114,97,100,105,111,115,104,97,114,101,119,111,109,101,110,97\n,103,97,105,110,109,111,110,101,121,105,109,97,103,101,110,97,109,101,115,121,\n111,117,110,103,108,105,110,101,115,108,97,116,101,114,99,111,108,111,114,103,\n114,101,101,110,102,114,111,110,116,38,97,109,112,59,119,97,116,99,104,102,111,\n114,99,101,112,114,105,99,101,114,117,108,101,115,98,101,103,105,110,97,102,116,\n101,114,118,105,115,105,116,105,115,115,117,101,97,114,101,97,115,98,101,108,111\n,119,105,110,100,101,120,116,111,116,97,108,104,111,117,114,115,108,97,98,101,\n108,112,114,105,110,116,112,114,101,115,115,98,117,105,108,116,108,105,110,107,\n115,115,112,101,101,100,115,116,117,100,121,116,114,97,100,101,102,111,117,110,\n100,115,101,110,115,101,117,110,100,101,114,115,104,111,119,110,102,111,114,109,\n115,114,97,110,103,101,97,100,100,101,100,115,116,105,108,108,109,111,118,101,\n100,116,97,107,101,110,97,98,111,118,101,102,108,97,115,104,102,105,120,101,100,\n111,102,116,101,110,111,116,104,101,114,118,105,101,119,115,99,104,101,99,107,\n108,101,103,97,108,114,105,118,101,114,105,116,101,109,115,113,117,105,99,107,\n115,104,97,112,101,104,117,109,97,110,101,120,105,115,116,103,111,105,110,103,\n109,111,118,105,101,116,104,105,114,100,98,97,115,105,99,112,101,97,99,101,115,\n116,97,103,101,119,105,100,116,104,108,111,103,105,110,105,100,101,97,115,119,\n114,111,116,101,112,97,103,101,115,117,115,101,114,115,100,114,105,118,101,115,\n116,111,114,101,98,114,101,97,107,115,111,117,116,104,118,111,105,99,101,115,105\n,116,101,115,109,111,110,116,104,119,104,101,114,101,98,117,105,108,100,119,104,\n105,99,104,101,97,114,116,104,102,111,114,117,109,116,104,114,101,101,115,112,\n111,114,116,112,97,114,116,121,67,108,105,99,107,108,111,119,101,114,108,105,118\n,101,115,99,108,97,115,115,108,97,121,101,114,101,110,116,114,121,115,116,111,\n114,121,117,115,97,103,101,115,111,117,110,100,99,111,117,114,116,121,111,117,\n114,32,98,105,114,116,104,112,111,112,117,112,116,121,112,101,115,97,112,112,108\n,121,73,109,97,103,101,98,101,105,110,103,117,112,112,101,114,110,111,116,101,\n115,101,118,101,114,121,115,104,111,119,115,109,101,97,110,115,101,120,116,114,\n97,109,97,116,99,104,116,114,97,99,107,107,110,111,119,110,101,97,114,108,121,98\n,101,103,97,110,115,117,112,101,114,112,97,112,101,114,110,111,114,116,104,108,\n101,97,114,110,103,105,118,101,110,110,97,109,101,100,101,110,100,101,100,84,101\n,114,109,115,112,97,114,116,115,71,114,111,117,112,98,114,97,110,100,117,115,105\n,110,103,119,111,109,97,110,102,97,108,115,101,114,101,97,100,121,97,117,100,105\n,111,116,97,107,101,115,119,104,105,108,101,46,99,111,109,47,108,105,118,101,100\n,99,97,115,101,115,100,97,105,108,121,99,104,105,108,100,103,114,101,97,116,106,\n117,100,103,101,116,104,111,115,101,117,110,105,116,115,110,101,118,101,114,98,\n114,111,97,100,99,111,97,115,116,99,111,118,101,114,97,112,112,108,101,102,105,\n108,101,115,99,121,99,108,101,115,99,101,110,101,112,108,97,110,115,99,108,105,\n99,107,119,114,105,116,101,113,117,101,101,110,112,105,101,99,101,101,109,97,105\n,108,102,114,97,109,101,111,108,100,101,114,112,104,111,116,111,108,105,109,105,\n116,99,97,99,104,101,99,105,118,105,108,115,99,97,108,101,101,110,116,101,114,\n116,104,101,109,101,116,104,101,114,101,116,111,117,99,104,98,111,117,110,100,\n114,111,121,97,108,97,115,107,101,100,119,104,111,108,101,115,105,110,99,101,115\n,116,111,99,107,32,110,97,109,101,102,97,105,116,104,104,101,97,114,116,101,109,\n112,116,121,111,102,102,101,114,115,99,111,112,101,111,119,110,101,100,109,105,\n103,104,116,97,108,98,117,109,116,104,105,110,107,98,108,111,111,100,97,114,114,\n97,121,109,97,106,111,114,116,114,117,115,116,99,97,110,111,110,117,110,105,111,\n110,99,111,117,110,116,118,97,108,105,100,115,116,111,110,101,83,116,121,108,101\n,76,111,103,105,110,104,97,112,112,121,111,99,99,117,114,108,101,102,116,58,102,\n114,101,115,104,113,117,105,116,101,102,105,108,109,115,103,114,97,100,101,110,\n101,101,100,115,117,114,98,97,110,102,105,103,104,116,98,97,115,105,115,104,111,\n118,101,114,97,117,116,111,59,114,111,117,116,101,46,104,116,109,108,109,105,120\n,101,100,102,105,110,97,108,89,111,117,114,32,115,108,105,100,101,116,111,112,\n105,99,98,114,111,119,110,97,108,111,110,101,100,114,97,119,110,115,112,108,105,\n116,114,101,97,99,104,82,105,103,104,116,100,97,116,101,115,109,97,114,99,104,\n113,117,111,116,101,103,111,111,100,115,76,105,110,107,115,100,111,117,98,116,97\n,115,121,110,99,116,104,117,109,98,97,108,108,111,119,99,104,105,101,102,121,111\n,117,116,104,110,111,118,101,108,49,48,112,120,59,115,101,114,118,101,117,110,\n116,105,108,104,97,110,100,115,67,104,101,99,107,83,112,97,99,101,113,117,101,\n114,121,106,97,109,101,115,101,113,117,97,108,116,119,105,99,101,48,44,48,48,48,\n83,116,97,114,116,112,97,110,101,108,115,111,110,103,115,114,111,117,110,100,101\n,105,103,104,116,115,104,105,102,116,119,111,114,116,104,112,111,115,116,115,108\n,101,97,100,115,119,101,101,107,115,97,118,111,105,100,116,104,101,115,101,109,\n105,108,101,115,112,108,97,110,101,115,109,97,114,116,97,108,112,104,97,112,108,\n97,110,116,109,97,114,107,115,114,97,116,101,115,112,108,97,121,115,99,108,97,\n105,109,115,97,108,101,115,116,101,120,116,115,115,116,97,114,115,119,114,111,\n110,103,60,47,104,51,62,116,104,105,110,103,46,111,114,103,47,109,117,108,116,\n105,104,101,97,114,100,80,111,119,101,114,115,116,97,110,100,116,111,107,101,110\n,115,111,108,105,100,40,116,104,105,115,98,114,105,110,103,115,104,105,112,115,\n115,116,97,102,102,116,114,105,101,100,99,97,108,108,115,102,117,108,108,121,102\n,97,99,116,115,97,103,101,110,116,84,104,105,115,32,47,47,45,45,62,97,100,109,\n105,110,101,103,121,112,116,69,118,101,110,116,49,53,112,120,59,69,109,97,105,\n108,116,114,117,101,34,99,114,111,115,115,115,112,101,110,116,98,108,111,103,115\n,98,111,120,34,62,110,111,116,101,100,108,101,97,118,101,99,104,105,110,97,115,\n105,122,101,115,103,117,101,115,116,60,47,104,52,62,114,111,98,111,116,104,101,\n97,118,121,116,114,117,101,44,115,101,118,101,110,103,114,97,110,100,99,114,105,\n109,101,115,105,103,110,115,97,119,97,114,101,100,97,110,99,101,112,104,97,115,\n101,62,60,33,45,45,101,110,95,85,83,38,35,51,57,59,50,48,48,112,120,95,110,97,\n109,101,108,97,116,105,110,101,110,106,111,121,97,106,97,120,46,97,116,105,111,\n110,115,109,105,116,104,85,46,83,46,32,104,111,108,100,115,112,101,116,101,114,\n105,110,100,105,97,110,97,118,34,62,99,104,97,105,110,115,99,111,114,101,99,111,\n109,101,115,100,111,105,110,103,112,114,105,111,114,83,104,97,114,101,49,57,57,\n48,115,114,111,109,97,110,108,105,115,116,115,106,97,112,97,110,102,97,108,108,\n115,116,114,105,97,108,111,119,110,101,114,97,103,114,101,101,60,47,104,50,62,97\n,98,117,115,101,97,108,101,114,116,111,112,101,114,97,34,45,47,47,87,99,97,114,\n100,115,104,105,108,108,115,116,101,97,109,115,80,104,111,116,111,116,114,117,\n116,104,99,108,101,97,110,46,112,104,112,63,115,97,105,110,116,109,101,116,97,\n108,108,111,117,105,115,109,101,97,110,116,112,114,111,111,102,98,114,105,101,\n102,114,111,119,34,62,103,101,110,114,101,116,114,117,99,107,108,111,111,107,115\n,86,97,108,117,101,70,114,97,109,101,46,110,101,116,47,45,45,62,10,60,116,114,\n121,32,123,10,118,97,114,32,109,97,107,101,115,99,111,115,116,115,112,108,97,105\n,110,97,100,117,108,116,113,117,101,115,116,116,114,97,105,110,108,97,98,111,114\n,104,101,108,112,115,99,97,117,115,101,109,97,103,105,99,109,111,116,111,114,116\n,104,101,105,114,50,53,48,112,120,108,101,97,115,116,115,116,101,112,115,67,111,\n117,110,116,99,111,117,108,100,103,108,97,115,115,115,105,100,101,115,102,117,\n110,100,115,104,111,116,101,108,97,119,97,114,100,109,111,117,116,104,109,111,\n118,101,115,112,97,114,105,115,103,105,118,101,115,100,117,116,99,104,116,101,\n120,97,115,102,114,117,105,116,110,117,108,108,44,124,124,91,93,59,116,111,112,\n34,62,10,60,33,45,45,80,79,83,84,34,111,99,101,97,110,60,98,114,47,62,102,108,\n111,111,114,115,112,101,97,107,100,101,112,116,104,32,115,105,122,101,98,97,110,\n107,115,99,97,116,99,104,99,104,97,114,116,50,48,112,120,59,97,108,105,103,110,\n100,101,97,108,115,119,111,117,108,100,53,48,112,120,59,117,114,108,61,34,112,97\n,114,107,115,109,111,117,115,101,77,111,115,116,32,46,46,46,60,47,97,109,111,110\n,103,98,114,97,105,110,98,111,100,121,32,110,111,110,101,59,98,97,115,101,100,99\n,97,114,114,121,100,114,97,102,116,114,101,102,101,114,112,97,103,101,95,104,111\n,109,101,46,109,101,116,101,114,100,101,108,97,121,100,114,101,97,109,112,114,\n111,118,101,106,111,105,110,116,60,47,116,114,62,100,114,117,103,115,60,33,45,45\n,32,97,112,114,105,108,105,100,101,97,108,97,108,108,101,110,101,120,97,99,116,\n102,111,114,116,104,99,111,100,101,115,108,111,103,105,99,86,105,101,119,32,115,\n101,101,109,115,98,108,97,110,107,112,111,114,116,115,32,40,50,48,48,115,97,118,\n101,100,95,108,105,110,107,103,111,97,108,115,103,114,97,110,116,103,114,101,101\n,107,104,111,109,101,115,114,105,110,103,115,114,97,116,101,100,51,48,112,120,59\n,119,104,111,115,101,112,97,114,115,101,40,41,59,34,32,66,108,111,99,107,108,105\n,110,117,120,106,111,110,101,115,112,105,120,101,108,39,41,59,34,62,41,59,105,\n102,40,45,108,101,102,116,100,97,118,105,100,104,111,114,115,101,70,111,99,117,\n115,114,97,105,115,101,98,111,120,101,115,84,114,97,99,107,101,109,101,110,116,\n60,47,101,109,62,98,97,114,34,62,46,115,114,99,61,116,111,119,101,114,97,108,116\n,61,34,99,97,98,108,101,104,101,110,114,121,50,52,112,120,59,115,101,116,117,112\n,105,116,97,108,121,115,104,97,114,112,109,105,110,111,114,116,97,115,116,101,\n119,97,110,116,115,116,104,105,115,46,114,101,115,101,116,119,104,101,101,108,\n103,105,114,108,115,47,99,115,115,47,49,48,48,37,59,99,108,117,98,115,115,116,\n117,102,102,98,105,98,108,101,118,111,116,101,115,32,49,48,48,48,107,111,114,101\n,97,125,41,59,13,10,98,97,110,100,115,113,117,101,117,101,61,32,123,125,59,56,48\n,112,120,59,99,107,105,110,103,123,13,10,9,9,97,104,101,97,100,99,108,111,99,107\n,105,114,105,115,104,108,105,107,101,32,114,97,116,105,111,115,116,97,116,115,70\n,111,114,109,34,121,97,104,111,111,41,91,48,93,59,65,98,111,117,116,102,105,110,\n100,115,60,47,104,49,62,100,101,98,117,103,116,97,115,107,115,85,82,76,32,61,99,\n101,108,108,115,125,41,40,41,59,49,50,112,120,59,112,114,105,109,101,116,101,108\n,108,115,116,117,114,110,115,48,120,54,48,48,46,106,112,103,34,115,112,97,105,\n110,98,101,97,99,104,116,97,120,101,115,109,105,99,114,111,97,110,103,101,108,45\n,45,62,60,47,103,105,102,116,115,115,116,101,118,101,45,108,105,110,107,98,111,\n100,121,46,125,41,59,10,9,109,111,117,110,116,32,40,49,57,57,70,65,81,60,47,114,\n111,103,101,114,102,114,97,110,107,67,108,97,115,115,50,56,112,120,59,102,101,\n101,100,115,60,104,49,62,60,115,99,111,116,116,116,101,115,116,115,50,50,112,120\n,59,100,114,105,110,107,41,32,124,124,32,108,101,119,105,115,115,104,97,108,108,\n35,48,51,57,59,32,102,111,114,32,108,111,118,101,100,119,97,115,116,101,48,48,\n112,120,59,106,97,58,227,130,115,105,109,111,110,60,102,111,110,116,114,101,112,\n108,121,109,101,101,116,115,117,110,116,101,114,99,104,101,97,112,116,105,103,\n104,116,66,114,97,110,100,41,32,33,61,32,100,114,101,115,115,99,108,105,112,115,\n114,111,111,109,115,111,110,107,101,121,109,111,98,105,108,109,97,105,110,46,78,\n97,109,101,32,112,108,97,116,101,102,117,110,110,121,116,114,101,101,115,99,111,\n109,47,34,49,46,106,112,103,119,109,111,100,101,112,97,114,97,109,83,84,65,82,84\n,108,101,102,116,32,105,100,100,101,110,44,32,50,48,49,41,59,10,125,10,102,111,\n114,109,46,118,105,114,117,115,99,104,97,105,114,116,114,97,110,115,119,111,114,\n115,116,80,97,103,101,115,105,116,105,111,110,112,97,116,99,104,60,33,45,45,10,\n111,45,99,97,99,102,105,114,109,115,116,111,117,114,115,44,48,48,48,32,97,115,\n105,97,110,105,43,43,41,123,97,100,111,98,101,39,41,91,48,93,105,100,61,49,48,98\n,111,116,104,59,109,101,110,117,32,46,50,46,109,105,46,112,110,103,34,107,101,\n118,105,110,99,111,97,99,104,67,104,105,108,100,98,114,117,99,101,50,46,106,112,\n103,85,82,76,41,43,46,106,112,103,124,115,117,105,116,101,115,108,105,99,101,104\n,97,114,114,121,49,50,48,34,32,115,119,101,101,116,116,114,62,13,10,110,97,109,\n101,61,100,105,101,103,111,112,97,103,101,32,115,119,105,115,115,45,45,62,10,10,\n35,102,102,102,59,34,62,76,111,103,46,99,111,109,34,116,114,101,97,116,115,104,\n101,101,116,41,32,38,38,32,49,52,112,120,59,115,108,101,101,112,110,116,101,110,\n116,102,105,108,101,100,106,97,58,227,131,105,100,61,34,99,78,97,109,101,34,119,\n111,114,115,101,115,104,111,116,115,45,98,111,120,45,100,101,108,116,97,10,38,\n108,116,59,98,101,97,114,115,58,52,56,90,60,100,97,116,97,45,114,117,114,97,108,\n60,47,97,62,32,115,112,101,110,100,98,97,107,101,114,115,104,111,112,115,61,32,\n34,34,59,112,104,112,34,62,99,116,105,111,110,49,51,112,120,59,98,114,105,97,110\n,104,101,108,108,111,115,105,122,101,61,111,61,37,50,70,32,106,111,105,110,109,\n97,121,98,101,60,105,109,103,32,105,109,103,34,62,44,32,102,106,115,105,109,103,\n34,32,34,41,91,48,93,77,84,111,112,66,84,121,112,101,34,110,101,119,108,121,68,\n97,110,115,107,99,122,101,99,104,116,114,97,105,108,107,110,111,119,115,60,47,\n104,53,62,102,97,113,34,62,122,104,45,99,110,49,48,41,59,10,45,49,34,41,59,116,\n121,112,101,61,98,108,117,101,115,116,114,117,108,121,100,97,118,105,115,46,106,\n115,39,59,62,13,10,60,33,115,116,101,101,108,32,121,111,117,32,104,50,62,13,10,\n102,111,114,109,32,106,101,115,117,115,49,48,48,37,32,109,101,110,117,46,13,10,9\n,13,10,119,97,108,101,115,114,105,115,107,115,117,109,101,110,116,100,100,105,\n110,103,98,45,108,105,107,116,101,97,99,104,103,105,102,34,32,118,101,103,97,115\n,100,97,110,115,107,101,101,115,116,105,115,104,113,105,112,115,117,111,109,105,\n115,111,98,114,101,100,101,115,100,101,101,110,116,114,101,116,111,100,111,115,\n112,117,101,100,101,97,195,177,111,115,101,115,116,195,161,116,105,101,110,101,\n104,97,115,116,97,111,116,114,111,115,112,97,114,116,101,100,111,110,100,101,110\n,117,101,118,111,104,97,99,101,114,102,111,114,109,97,109,105,115,109,111,109,\n101,106,111,114,109,117,110,100,111,97,113,117,195,173,100,195,173,97,115,115,\n195,179,108,111,97,121,117,100,97,102,101,99,104,97,116,111,100,97,115,116,97,\n110,116,111,109,101,110,111,115,100,97,116,111,115,111,116,114,97,115,115,105,\n116,105,111,109,117,99,104,111,97,104,111,114,97,108,117,103,97,114,109,97,121,\n111,114,101,115,116,111,115,104,111,114,97,115,116,101,110,101,114,97,110,116,\n101,115,102,111,116,111,115,101,115,116,97,115,112,97,195,173,115,110,117,101,\n118,97,115,97,108,117,100,102,111,114,111,115,109,101,100,105,111,113,117,105,\n101,110,109,101,115,101,115,112,111,100,101,114,99,104,105,108,101,115,101,114,\n195,161,118,101,99,101,115,100,101,99,105,114,106,111,115,195,169,101,115,116,97\n,114,118,101,110,116,97,103,114,117,112,111,104,101,99,104,111,101,108,108,111,\n115,116,101,110,103,111,97,109,105,103,111,99,111,115,97,115,110,105,118,101,108\n,103,101,110,116,101,109,105,115,109,97,97,105,114,101,115,106,117,108,105,111,\n116,101,109,97,115,104,97,99,105,97,102,97,118,111,114,106,117,110,105,111,108,\n105,98,114,101,112,117,110,116,111,98,117,101,110,111,97,117,116,111,114,97,98,\n114,105,108,98,117,101,110,97,116,101,120,116,111,109,97,114,122,111,115,97,98,\n101,114,108,105,115,116,97,108,117,101,103,111,99,195,179,109,111,101,110,101,\n114,111,106,117,101,103,111,112,101,114,195,186,104,97,98,101,114,101,115,116,\n111,121,110,117,110,99,97,109,117,106,101,114,118,97,108,111,114,102,117,101,114\n,97,108,105,98,114,111,103,117,115,116,97,105,103,117,97,108,118,111,116,111,115\n,99,97,115,111,115,103,117,195,173,97,112,117,101,100,111,115,111,109,111,115,97\n,118,105,115,111,117,115,116,101,100,100,101,98,101,110,110,111,99,104,101,98,\n117,115,99,97,102,97,108,116,97,101,117,114,111,115,115,101,114,105,101,100,105,\n99,104,111,99,117,114,115,111,99,108,97,118,101,99,97,115,97,115,108,101,195,179\n,110,112,108,97,122,111,108,97,114,103,111,111,98,114,97,115,118,105,115,116,97,\n97,112,111,121,111,106,117,110,116,111,116,114,97,116,97,118,105,115,116,111,99,\n114,101,97,114,99,97,109,112,111,104,101,109,111,115,99,105,110,99,111,99,97,114\n,103,111,112,105,115,111,115,111,114,100,101,110,104,97,99,101,110,195,161,114,\n101,97,100,105,115,99,111,112,101,100,114,111,99,101,114,99,97,112,117,101,100,\n97,112,97,112,101,108,109,101,110,111,114,195,186,116,105,108,99,108,97,114,111,\n106,111,114,103,101,99,97,108,108,101,112,111,110,101,114,116,97,114,100,101,110\n,97,100,105,101,109,97,114,99,97,115,105,103,117,101,101,108,108,97,115,115,105,\n103,108,111,99,111,99,104,101,109,111,116,111,115,109,97,100,114,101,99,108,97,\n115,101,114,101,115,116,111,110,105,195,177,111,113,117,101,100,97,112,97,115,97\n,114,98,97,110,99,111,104,105,106,111,115,118,105,97,106,101,112,97,98,108,111,\n195,169,115,116,101,118,105,101,110,101,114,101,105,110,111,100,101,106,97,114,\n102,111,110,100,111,99,97,110,97,108,110,111,114,116,101,108,101,116,114,97,99,\n97,117,115,97,116,111,109,97,114,109,97,110,111,115,108,117,110,101,115,97,117,\n116,111,115,118,105,108,108,97,118,101,110,100,111,112,101,115,97,114,116,105,\n112,111,115,116,101,110,103,97,109,97,114,99,111,108,108,101,118,97,112,97,100,\n114,101,117,110,105,100,111,118,97,109,111,115,122,111,110,97,115,97,109,98,111,\n115,98,97,110,100,97,109,97,114,105,97,97,98,117,115,111,109,117,99,104,97,115,\n117,98,105,114,114,105,111,106,97,118,105,118,105,114,103,114,97,100,111,99,104,\n105,99,97,97,108,108,195,173,106,111,118,101,110,100,105,99,104,97,101,115,116,\n97,110,116,97,108,101,115,115,97,108,105,114,115,117,101,108,111,112,101,115,111\n,115,102,105,110,101,115,108,108,97,109,97,98,117,115,99,111,195,169,115,116,97,\n108,108,101,103,97,110,101,103,114,111,112,108,97,122,97,104,117,109,111,114,112\n,97,103,97,114,106,117,110,116,97,100,111,98,108,101,105,115,108,97,115,98,111,\n108,115,97,98,97,195,177,111,104,97,98,108,97,108,117,99,104,97,195,129,114,101,\n97,100,105,99,101,110,106,117,103,97,114,110,111,116,97,115,118,97,108,108,101,\n97,108,108,195,161,99,97,114,103,97,100,111,108,111,114,97,98,97,106,111,101,115\n,116,195,169,103,117,115,116,111,109,101,110,116,101,109,97,114,105,111,102,105,\n114,109,97,99,111,115,116,111,102,105,99,104,97,112,108,97,116,97,104,111,103,97\n,114,97,114,116,101,115,108,101,121,101,115,97,113,117,101,108,109,117,115,101,\n111,98,97,115,101,115,112,111,99,111,115,109,105,116,97,100,99,105,101,108,111,\n99,104,105,99,111,109,105,101,100,111,103,97,110,97,114,115,97,110,116,111,101,\n116,97,112,97,100,101,98,101,115,112,108,97,121,97,114,101,100,101,115,115,105,\n101,116,101,99,111,114,116,101,99,111,114,101,97,100,117,100,97,115,100,101,115,\n101,111,118,105,101,106,111,100,101,115,101,97,97,103,117,97,115,38,113,117,111,\n116,59,100,111,109,97,105,110,99,111,109,109,111,110,115,116,97,116,117,115,101,\n118,101,110,116,115,109,97,115,116,101,114,115,121,115,116,101,109,97,99,116,105\n,111,110,98,97,110,110,101,114,114,101,109,111,118,101,115,99,114,111,108,108,\n117,112,100,97,116,101,103,108,111,98,97,108,109,101,100,105,117,109,102,105,108\n,116,101,114,110,117,109,98,101,114,99,104,97,110,103,101,114,101,115,117,108,\n116,112,117,98,108,105,99,115,99,114,101,101,110,99,104,111,111,115,101,110,111,\n114,109,97,108,116,114,97,118,101,108,105,115,115,117,101,115,115,111,117,114,99\n,101,116,97,114,103,101,116,115,112,114,105,110,103,109,111,100,117,108,101,109,\n111,98,105,108,101,115,119,105,116,99,104,112,104,111,116,111,115,98,111,114,100\n,101,114,114,101,103,105,111,110,105,116,115,101,108,102,115,111,99,105,97,108,\n97,99,116,105,118,101,99,111,108,117,109,110,114,101,99,111,114,100,102,111,108,\n108,111,119,116,105,116,108,101,62,101,105,116,104,101,114,108,101,110,103,116,\n104,102,97,109,105,108,121,102,114,105,101,110,100,108,97,121,111,117,116,97,117\n,116,104,111,114,99,114,101,97,116,101,114,101,118,105,101,119,115,117,109,109,\n101,114,115,101,114,118,101,114,112,108,97,121,101,100,112,108,97,121,101,114,\n101,120,112,97,110,100,112,111,108,105,99,121,102,111,114,109,97,116,100,111,117\n,98,108,101,112,111,105,110,116,115,115,101,114,105,101,115,112,101,114,115,111,\n110,108,105,118,105,110,103,100,101,115,105,103,110,109,111,110,116,104,115,102,\n111,114,99,101,115,117,110,105,113,117,101,119,101,105,103,104,116,112,101,111,\n112,108,101,101,110,101,114,103,121,110,97,116,117,114,101,115,101,97,114,99,104\n,102,105,103,117,114,101,104,97,118,105,110,103,99,117,115,116,111,109,111,102,\n102,115,101,116,108,101,116,116,101,114,119,105,110,100,111,119,115,117,98,109,\n105,116,114,101,110,100,101,114,103,114,111,117,112,115,117,112,108,111,97,100,\n104,101,97,108,116,104,109,101,116,104,111,100,118,105,100,101,111,115,115,99,\n104,111,111,108,102,117,116,117,114,101,115,104,97,100,111,119,100,101,98,97,116\n,101,118,97,108,117,101,115,79,98,106,101,99,116,111,116,104,101,114,115,114,105\n,103,104,116,115,108,101,97,103,117,101,99,104,114,111,109,101,115,105,109,112,\n108,101,110,111,116,105,99,101,115,104,97,114,101,100,101,110,100,105,110,103,\n115,101,97,115,111,110,114,101,112,111,114,116,111,110,108,105,110,101,115,113,\n117,97,114,101,98,117,116,116,111,110,105,109,97,103,101,115,101,110,97,98,108,\n101,109,111,118,105,110,103,108,97,116,101,115,116,119,105,110,116,101,114,70,\n114,97,110,99,101,112,101,114,105,111,100,115,116,114,111,110,103,114,101,112,\n101,97,116,76,111,110,100,111,110,100,101,116,97,105,108,102,111,114,109,101,100\n,100,101,109,97,110,100,115,101,99,117,114,101,112,97,115,115,101,100,116,111,\n103,103,108,101,112,108,97,99,101,115,100,101,118,105,99,101,115,116,97,116,105,\n99,99,105,116,105,101,115,115,116,114,101,97,109,121,101,108,108,111,119,97,116,\n116,97,99,107,115,116,114,101,101,116,102,108,105,103,104,116,104,105,100,100,\n101,110,105,110,102,111,34,62,111,112,101,110,101,100,117,115,101,102,117,108,\n118,97,108,108,101,121,99,97,117,115,101,115,108,101,97,100,101,114,115,101,99,\n114,101,116,115,101,99,111,110,100,100,97,109,97,103,101,115,112,111,114,116,115\n,101,120,99,101,112,116,114,97,116,105,110,103,115,105,103,110,101,100,116,104,\n105,110,103,115,101,102,102,101,99,116,102,105,101,108,100,115,115,116,97,116,\n101,115,111,102,102,105,99,101,118,105,115,117,97,108,101,100,105,116,111,114,\n118,111,108,117,109,101,82,101,112,111,114,116,109,117,115,101,117,109,109,111,\n118,105,101,115,112,97,114,101,110,116,97,99,99,101,115,115,109,111,115,116,108,\n121,109,111,116,104,101,114,34,32,105,100,61,34,109,97,114,107,101,116,103,114,\n111,117,110,100,99,104,97,110,99,101,115,117,114,118,101,121,98,101,102,111,114,\n101,115,121,109,98,111,108,109,111,109,101,110,116,115,112,101,101,99,104,109,\n111,116,105,111,110,105,110,115,105,100,101,109,97,116,116,101,114,67,101,110,\n116,101,114,111,98,106,101,99,116,101,120,105,115,116,115,109,105,100,100,108,\n101,69,117,114,111,112,101,103,114,111,119,116,104,108,101,103,97,99,121,109,97,\n110,110,101,114,101,110,111,117,103,104,99,97,114,101,101,114,97,110,115,119,101\n,114,111,114,105,103,105,110,112,111,114,116,97,108,99,108,105,101,110,116,115,\n101,108,101,99,116,114,97,110,100,111,109,99,108,111,115,101,100,116,111,112,105\n,99,115,99,111,109,105,110,103,102,97,116,104,101,114,111,112,116,105,111,110,\n115,105,109,112,108,121,114,97,105,115,101,100,101,115,99,97,112,101,99,104,111,\n115,101,110,99,104,117,114,99,104,100,101,102,105,110,101,114,101,97,115,111,110\n,99,111,114,110,101,114,111,117,116,112,117,116,109,101,109,111,114,121,105,102,\n114,97,109,101,112,111,108,105,99,101,109,111,100,101,108,115,78,117,109,98,101,\n114,100,117,114,105,110,103,111,102,102,101,114,115,115,116,121,108,101,115,107,\n105,108,108,101,100,108,105,115,116,101,100,99,97,108,108,101,100,115,105,108,\n118,101,114,109,97,114,103,105,110,100,101,108,101,116,101,98,101,116,116,101,\n114,98,114,111,119,115,101,108,105,109,105,116,115,71,108,111,98,97,108,115,105,\n110,103,108,101,119,105,100,103,101,116,99,101,110,116,101,114,98,117,100,103,\n101,116,110,111,119,114,97,112,99,114,101,100,105,116,99,108,97,105,109,115,101,\n110,103,105,110,101,115,97,102,101,116,121,99,104,111,105,99,101,115,112,105,114\n,105,116,45,115,116,121,108,101,115,112,114,101,97,100,109,97,107,105,110,103,\n110,101,101,100,101,100,114,117,115,115,105,97,112,108,101,97,115,101,101,120,\n116,101,110,116,83,99,114,105,112,116,98,114,111,107,101,110,97,108,108,111,119,\n115,99,104,97,114,103,101,100,105,118,105,100,101,102,97,99,116,111,114,109,101,\n109,98,101,114,45,98,97,115,101,100,116,104,101,111,114,121,99,111,110,102,105,\n103,97,114,111,117,110,100,119,111,114,107,101,100,104,101,108,112,101,100,67,\n104,117,114,99,104,105,109,112,97,99,116,115,104,111,117,108,100,97,108,119,97,\n121,115,108,111,103,111,34,32,98,111,116,116,111,109,108,105,115,116,34,62,41,\n123,118,97,114,32,112,114,101,102,105,120,111,114,97,110,103,101,72,101,97,100,\n101,114,46,112,117,115,104,40,99,111,117,112,108,101,103,97,114,100,101,110,98,\n114,105,100,103,101,108,97,117,110,99,104,82,101,118,105,101,119,116,97,107,105,\n110,103,118,105,115,105,111,110,108,105,116,116,108,101,100,97,116,105,110,103,\n66,117,116,116,111,110,98,101,97,117,116,121,116,104,101,109,101,115,102,111,114\n,103,111,116,83,101,97,114,99,104,97,110,99,104,111,114,97,108,109,111,115,116,\n108,111,97,100,101,100,67,104,97,110,103,101,114,101,116,117,114,110,115,116,114\n,105,110,103,114,101,108,111,97,100,77,111,98,105,108,101,105,110,99,111,109,101\n,115,117,112,112,108,121,83,111,117,114,99,101,111,114,100,101,114,115,118,105,\n101,119,101,100,38,110,98,115,112,59,99,111,117,114,115,101,65,98,111,117,116,32\n,105,115,108,97,110,100,60,104,116,109,108,32,99,111,111,107,105,101,110,97,109,\n101,61,34,97,109,97,122,111,110,109,111,100,101,114,110,97,100,118,105,99,101,\n105,110,60,47,97,62,58,32,84,104,101,32,100,105,97,108,111,103,104,111,117,115,\n101,115,66,69,71,73,78,32,77,101,120,105,99,111,115,116,97,114,116,115,99,101,\n110,116,114,101,104,101,105,103,104,116,97,100,100,105,110,103,73,115,108,97,110\n,100,97,115,115,101,116,115,69,109,112,105,114,101,83,99,104,111,111,108,101,102\n,102,111,114,116,100,105,114,101,99,116,110,101,97,114,108,121,109,97,110,117,97\n,108,83,101,108,101,99,116,46,10,10,79,110,101,106,111,105,110,101,100,109,101,\n110,117,34,62,80,104,105,108,105,112,97,119,97,114,100,115,104,97,110,100,108,\n101,105,109,112,111,114,116,79,102,102,105,99,101,114,101,103,97,114,100,115,107\n,105,108,108,115,110,97,116,105,111,110,83,112,111,114,116,115,100,101,103,114,\n101,101,119,101,101,107,108,121,32,40,101,46,103,46,98,101,104,105,110,100,100,\n111,99,116,111,114,108,111,103,103,101,100,117,110,105,116,101,100,60,47,98,62,\n60,47,98,101,103,105,110,115,112,108,97,110,116,115,97,115,115,105,115,116,97,\n114,116,105,115,116,105,115,115,117,101,100,51,48,48,112,120,124,99,97,110,97,\n100,97,97,103,101,110,99,121,115,99,104,101,109,101,114,101,109,97,105,110,66,\n114,97,122,105,108,115,97,109,112,108,101,108,111,103,111,34,62,98,101,121,111,\n110,100,45,115,99,97,108,101,97,99,99,101,112,116,115,101,114,118,101,100,109,97\n,114,105,110,101,70,111,111,116,101,114,99,97,109,101,114,97,60,47,104,49,62,10,\n95,102,111,114,109,34,108,101,97,118,101,115,115,116,114,101,115,115,34,32,47,62\n,13,10,46,103,105,102,34,32,111,110,108,111,97,100,108,111,97,100,101,114,79,120\n,102,111,114,100,115,105,115,116,101,114,115,117,114,118,105,118,108,105,115,116\n,101,110,102,101,109,97,108,101,68,101,115,105,103,110,115,105,122,101,61,34,97,\n112,112,101,97,108,116,101,120,116,34,62,108,101,118,101,108,115,116,104,97,110,\n107,115,104,105,103,104,101,114,102,111,114,99,101,100,97,110,105,109,97,108,97,\n110,121,111,110,101,65,102,114,105,99,97,97,103,114,101,101,100,114,101,99,101,\n110,116,80,101,111,112,108,101,60,98,114,32,47,62,119,111,110,100,101,114,112,\n114,105,99,101,115,116,117,114,110,101,100,124,124,32,123,125,59,109,97,105,110,\n34,62,105,110,108,105,110,101,115,117,110,100,97,121,119,114,97,112,34,62,102,97\n,105,108,101,100,99,101,110,115,117,115,109,105,110,117,116,101,98,101,97,99,111\n,110,113,117,111,116,101,115,49,53,48,112,120,124,101,115,116,97,116,101,114,101\n,109,111,116,101,101,109,97,105,108,34,108,105,110,107,101,100,114,105,103,104,\n116,59,115,105,103,110,97,108,102,111,114,109,97,108,49,46,104,116,109,108,115,\n105,103,110,117,112,112,114,105,110,99,101,102,108,111,97,116,58,46,112,110,103,\n34,32,102,111,114,117,109,46,65,99,99,101,115,115,112,97,112,101,114,115,115,111\n,117,110,100,115,101,120,116,101,110,100,72,101,105,103,104,116,115,108,105,100,\n101,114,85,84,70,45,56,34,38,97,109,112,59,32,66,101,102,111,114,101,46,32,87,\n105,116,104,115,116,117,100,105,111,111,119,110,101,114,115,109,97,110,97,103,\n101,112,114,111,102,105,116,106,81,117,101,114,121,97,110,110,117,97,108,112,97,\n114,97,109,115,98,111,117,103,104,116,102,97,109,111,117,115,103,111,111,103,108\n,101,108,111,110,103,101,114,105,43,43,41,32,123,105,115,114,97,101,108,115,97,\n121,105,110,103,100,101,99,105,100,101,104,111,109,101,34,62,104,101,97,100,101,\n114,101,110,115,117,114,101,98,114,97,110,99,104,112,105,101,99,101,115,98,108,\n111,99,107,59,115,116,97,116,101,100,116,111,112,34,62,60,114,97,99,105,110,103,\n114,101,115,105,122,101,45,45,38,103,116,59,112,97,99,105,116,121,115,101,120,\n117,97,108,98,117,114,101,97,117,46,106,112,103,34,32,49,48,44,48,48,48,111,98,\n116,97,105,110,116,105,116,108,101,115,97,109,111,117,110,116,44,32,73,110,99,46\n,99,111,109,101,100,121,109,101,110,117,34,32,108,121,114,105,99,115,116,111,100\n,97,121,46,105,110,100,101,101,100,99,111,117,110,116,121,95,108,111,103,111,46,\n70,97,109,105,108,121,108,111,111,107,101,100,77,97,114,107,101,116,108,115,101,\n32,105,102,80,108,97,121,101,114,116,117,114,107,101,121,41,59,118,97,114,32,102\n,111,114,101,115,116,103,105,118,105,110,103,101,114,114,111,114,115,68,111,109,\n97,105,110,125,101,108,115,101,123,105,110,115,101,114,116,66,108,111,103,60,47,\n102,111,111,116,101,114,108,111,103,105,110,46,102,97,115,116,101,114,97,103,101\n,110,116,115,60,98,111,100,121,32,49,48,112,120,32,48,112,114,97,103,109,97,102,\n114,105,100,97,121,106,117,110,105,111,114,100,111,108,108,97,114,112,108,97,99,\n101,100,99,111,118,101,114,115,112,108,117,103,105,110,53,44,48,48,48,32,112,97,\n103,101,34,62,98,111,115,116,111,110,46,116,101,115,116,40,97,118,97,116,97,114,\n116,101,115,116,101,100,95,99,111,117,110,116,102,111,114,117,109,115,115,99,104\n,101,109,97,105,110,100,101,120,44,102,105,108,108,101,100,115,104,97,114,101,\n115,114,101,97,100,101,114,97,108,101,114,116,40,97,112,112,101,97,114,83,117,98\n,109,105,116,108,105,110,101,34,62,98,111,100,121,34,62,10,42,32,84,104,101,84,\n104,111,117,103,104,115,101,101,105,110,103,106,101,114,115,101,121,78,101,119,\n115,60,47,118,101,114,105,102,121,101,120,112,101,114,116,105,110,106,117,114,\n121,119,105,100,116,104,61,67,111,111,107,105,101,83,84,65,82,84,32,97,99,114,\n111,115,115,95,105,109,97,103,101,116,104,114,101,97,100,110,97,116,105,118,101,\n112,111,99,107,101,116,98,111,120,34,62,10,83,121,115,116,101,109,32,68,97,118,\n105,100,99,97,110,99,101,114,116,97,98,108,101,115,112,114,111,118,101,100,65,\n112,114,105,108,32,114,101,97,108,108,121,100,114,105,118,101,114,105,116,101,\n109,34,62,109,111,114,101,34,62,98,111,97,114,100,115,99,111,108,111,114,115,99,\n97,109,112,117,115,102,105,114,115,116,32,124,124,32,91,93,59,109,101,100,105,97\n,46,103,117,105,116,97,114,102,105,110,105,115,104,119,105,100,116,104,58,115,\n104,111,119,101,100,79,116,104,101,114,32,46,112,104,112,34,32,97,115,115,117,\n109,101,108,97,121,101,114,115,119,105,108,115,111,110,115,116,111,114,101,115,\n114,101,108,105,101,102,115,119,101,100,101,110,67,117,115,116,111,109,101,97,\n115,105,108,121,32,121,111,117,114,32,83,116,114,105,110,103,10,10,87,104,105,\n108,116,97,121,108,111,114,99,108,101,97,114,58,114,101,115,111,114,116,102,114,\n101,110,99,104,116,104,111,117,103,104,34,41,32,43,32,34,60,98,111,100,121,62,98\n,117,121,105,110,103,98,114,97,110,100,115,77,101,109,98,101,114,110,97,109,101,\n34,62,111,112,112,105,110,103,115,101,99,116,111,114,53,112,120,59,34,62,118,115\n,112,97,99,101,112,111,115,116,101,114,109,97,106,111,114,32,99,111,102,102,101,\n101,109,97,114,116,105,110,109,97,116,117,114,101,104,97,112,112,101,110,60,47,\n110,97,118,62,107,97,110,115,97,115,108,105,110,107,34,62,73,109,97,103,101,115,\n61,102,97,108,115,101,119,104,105,108,101,32,104,115,112,97,99,101,48,38,97,109,\n112,59,32,10,10,73,110,32,32,112,111,119,101,114,80,111,108,115,107,105,45,99,\n111,108,111,114,106,111,114,100,97,110,66,111,116,116,111,109,83,116,97,114,116,\n32,45,99,111,117,110,116,50,46,104,116,109,108,110,101,119,115,34,62,48,49,46,\n106,112,103,79,110,108,105,110,101,45,114,105,103,104,116,109,105,108,108,101,\n114,115,101,110,105,111,114,73,83,66,78,32,48,48,44,48,48,48,32,103,117,105,100,\n101,115,118,97,108,117,101,41,101,99,116,105,111,110,114,101,112,97,105,114,46,\n120,109,108,34,32,32,114,105,103,104,116,115,46,104,116,109,108,45,98,108,111,99\n,107,114,101,103,69,120,112,58,104,111,118,101,114,119,105,116,104,105,110,118,\n105,114,103,105,110,112,104,111,110,101,115,60,47,116,114,62,13,117,115,105,110,\n103,32,10,9,118,97,114,32,62,39,41,59,10,9,60,47,116,100,62,10,60,47,116,114,62,\n10,98,97,104,97,115,97,98,114,97,115,105,108,103,97,108,101,103,111,109,97,103,\n121,97,114,112,111,108,115,107,105,115,114,112,115,107,105,216,177,216,175,217,\n136,228,184,173,230,150,135,231,174,128,228,189,147,231,185,129,233,171,148,228,\n191,161,230,129,175,228,184,173,229,155,189,230,136,145,228,187,172,228,184,128,\n228,184,170,229,133,172,229,143,184,231,174,161,231,144,134,232,174,186,229,157,\n155,229,143,175,228,187,165,230,156,141,229,138,161,230,151,182,233,151,180,228,\n184,170,228,186,186,228,186,167,229,147,129,232,135,170,229,183,177,228,188,129,\n228,184,154,230,159,165,231,156,139,229,183,165,228,189,156,232,129,148,231,179,\n187,230,178,161,230,156,137,231,189,145,231,171,153,230,137,128,230,156,137,232,\n175,132,232,174,186,228,184,173,229,191,131,230,150,135,231,171,160,231,148,168,\n230,136,183,233,166,150,233,161,181,228,189,156,232,128,133,230,138,128,230,156,\n175,233,151,174,233,162,152,231,155,184,229,133,179,228,184,139,232,189,189,230,\n144,156,231,180,162,228,189,191,231,148,168,232,189,175,228,187,182,229,156,168,\n231,186,191,228,184,187,233,162,152,232,181,132,230,150,153,232,167,134,233,162,\n145,229,155,158,229,164,141,230,179,168,229,134,140,231,189,145,231,187,156,230,\n148,182,232,151,143,229,134,133,229,174,185,230,142,168,232,141,144,229,184,130,\n229,156,186,230,182,136,230,129,175,231,169,186,233,151,180,229,143,145,229,184,\n131,228,187,128,228,185,136,229,165,189,229,143,139,231,148,159,230,180,187,229,\n155,190,231,137,135,229,143,145,229,177,149,229,166,130,230,158,156,230,137,139,\n230,156,186,230,150,176,233,151,187,230,156,128,230,150,176,230,150,185,229,188,\n143,229,140,151,228,186,172,230,143,144,228,190,155,229,133,179,228,186,142,230,\n155,180,229,164,154,232,191,153,228,184,170,231,179,187,231,187,159,231,159,165,\n233,129,147,230,184,184,230,136,143,229,185,191,229,145,138,229,133,182,228,187,\n150,229,143,145,232,161,168,229,174,137,229,133,168,231,172,172,228,184,128,228,\n188,154,229,145,152,232,191,155,232,161,140,231,130,185,229,135,187,231,137,136,\n230,157,131,231,148,181,229,173,144,228,184,150,231,149,140,232,174,190,232,174,\n161,229,133,141,232,180,185,230,149,153,232,130,178,229,138,160,229,133,165,230,\n180,187,229,138,168,228,187,150,228,187,172,229,149,134,229,147,129,229,141,154,\n229,174,162,231,142,176,229,156,168,228,184,138,230,181,183,229,166,130,228,189,\n149,229,183,178,231,187,143,231,149,153,232,168,128,232,175,166,231,187,134,231,\n164,190,229,140,186,231,153,187,229,189,149,230,156,172,231,171,153,233,156,128,\n232,166,129,228,187,183,230,160,188,230,148,175,230,140,129,229,155,189,233,153,\n133,233,147,190,230,142,165,229,155,189,229,174,182,229,187,186,232,174,190,230,\n156,139,229,143,139,233,152,133,232,175,187,230,179,149,229,190,139,228,189,141,\n231,189,174,231,187,143,230,181,142,233,128,137,230,139,169,232,191,153,230,160,\n183,229,189,147,229,137,141,229,136,134,231,177,187,230,142,146,232,161,140,229,\n155,160,228,184,186,228,186,164,230,152,147,230,156,128,229,144,142,233,159,179,\n228,185,144,228,184,141,232,131,189,233,128,154,232,191,135,232,161,140,228,184,\n154,231,167,145,230,138,128,229,143,175,232,131,189,232,174,190,229,164,135,229,\n144,136,228,189,156,229,164,167,229,174,182,231,164,190,228,188,154,231,160,148,\n231,169,182,228,184,147,228,184,154,229,133,168,233,131,168,233,161,185,231,155,\n174,232,191,153,233,135,140,232,191,152,230,152,175,229,188,128,229,167,139,230,\n131,133,229,134,181,231,148,181,232,132,145,230,150,135,228,187,182,229,147,129,\n231,137,140,229,184,174,229,138,169,230,150,135,229,140,150,232,181,132,230,186,\n144,229,164,167,229,173,166,229,173,166,228,185,160,229,156,176,229,157,128,230,\n181,143,232,167,136,230,138,149,232,181,132,229,183,165,231,168,139,232,166,129,\n230,177,130,230,128,142,228,185,136,230,151,182,229,128,153,229,138,159,232,131,\n189,228,184,187,232,166,129,231,155,174,229,137,141,232,181,132,232,174,175,229,\n159,142,229,184,130,230,150,185,230,179,149,231,148,181,229,189,177,230,139,155,\n232,129,152,229,163,176,230,152,142,228,187,187,228,189,149,229,129,165,229,186,\n183,230,149,176,230,141,174,231,190,142,229,155,189,230,177,189,232,189,166,228,\n187,139,231,187,141,228,189,134,230,152,175,228,186,164,230,181,129,231,148,159,\n228,186,167,230,137,128,228,187,165,231,148,181,232,175,157,230,152,190,231,164,\n186,228,184,128,228,186,155,229,141,149,228,189,141,228,186,186,229,145,152,229,\n136,134,230,158,144,229,156,176,229,155,190,230,151,133,230,184,184,229,183,165,\n229,133,183,229,173,166,231,148,159,231,179,187,229,136,151,231,189,145,229,143,\n139,229,184,150,229,173,144,229,175,134,231,160,129,233,162,145,233,129,147,230,\n142,167,229,136,182,229,156,176,229,140,186,229,159,186,230,156,172,229,133,168,\n229,155,189,231,189,145,228,184,138,233,135,141,232,166,129,231,172,172,228,186,\n140,229,150,156,230,172,162,232,191,155,229,133,165,229,143,139,230,131,133,232,\n191,153,228,186,155,232,128,131,232,175,149,229,143,145,231,142,176,229,159,185,\n232,174,173,228,187,165,228,184,138,230,148,191,229,186,156,230,136,144,228,184,\n186,231,142,175,229,162,131,233,166,153,230,184,175,229,144,140,230,151,182,229,\n168,177,228,185,144,229,143,145,233,128,129,228,184,128,229,174,154,229,188,128,\n229,143,145,228,189,156,229,147,129,230,160,135,229,135,134,230,172,162,232,191,\n142,232,167,163,229,134,179,229,156,176,230,150,185,228,184,128,228,184,139,228,\n187,165,229,143,138,232,180,163,228,187,187,230,136,150,232,128,133,229,174,162,\n230,136,183,228,187,163,232,161,168,231,167,175,229,136,134,229,165,179,228,186,\n186,230,149,176,231,160,129,233,148,128,229,148,174,229,135,186,231,142,176,231,\n166,187,231,186,191,229,186,148,231,148,168,229,136,151,232,161,168,228,184,141,\n229,144,140,231,188,150,232,190,145,231,187,159,232,174,161,230,159,165,232,175,\n162,228,184,141,232,166,129,230,156,137,229,133,179,230,156,186,230,158,132,229,\n190,136,229,164,154,230,146,173,230,148,190,231,187,132,231,187,135,230,148,191,\n231,173,150,231,155,180,230,142,165,232,131,189,229,138,155,230,157,165,230,186,\n144,230,153,130,233,150,147,231,156,139,229,136,176,231,131,173,233,151,168,229,\n133,179,233,148,174,228,184,147,229,140,186,233,157,158,229,184,184,232,139,177,\n232,175,173,231,153,190,229,186,166,229,184,140,230,156,155,231,190,142,229,165,\n179,230,175,148,232,190,131,231,159,165,232,175,134,232,167,132,229,174,154,229,\n187,186,232,174,174,233,131,168,233,151,168,230,132,143,232,167,129,231,178,190,\n229,189,169,230,151,165,230,156,172,230,143,144,233,171,152,229,143,145,232,168,\n128,230,150,185,233,157,162,229,159,186,233,135,145,229,164,132,231,144,134,230,\n157,131,233,153,144,229,189,177,231,137,135,233,147,182,232,161,140,232,191,152,\n230,156,137,229,136,134,228,186,171,231,137,169,229,147,129,231,187,143,232,144,\n165,230,183,187,229,138,160,228,184,147,229,174,182,232,191,153,231,167,141,232,\n175,157,233,162,152,232,181,183,230,157,165,228,184,154,229,138,161,229,133,172,\n229,145,138,232,174,176,229,189,149,231,174,128,228,187,139,232,180,168,233,135,\n143,231,148,183,228,186,186,229,189,177,229,147,141,229,188,149,231,148,168,230,\n138,165,229,145,138,233,131,168,229,136,134,229,191,171,233,128,159,229,146,168,\n232,175,162,230,151,182,229,176,154,230,179,168,230,132,143,231,148,179,232,175,\n183,229,173,166,230,160,161,229,186,148,232,175,165,229,142,134,229,143,178,229,\n143,170,230,152,175,232,191,148,229,155,158,232,180,173,228,185,176,229,144,141,\n231,167,176,228,184,186,228,186,134,230,136,144,229,138,159,232,175,180,230,152,\n142,228,190,155,229,186,148,229,173,169,229,173,144,228,184,147,233,162,152,231,\n168,139,229,186,143,228,184,128,232,136,172,230,156,131,229,147,161,229,143,170,\n230,156,137,229,133,182,229,174,131,228,191,157,230,138,164,232,128,140,228,184,\n148,228,187,138,229,164,169,231,170,151,229,143,163,229,138,168,230,128,129,231,\n138,182,230,128,129,231,137,185,229,136,171,232,174,164,228,184,186,229,191,133,\n233,161,187,230,155,180,230,150,176,229,176,143,232,175,180,230,136,145,229,128,\n145,228,189,156,228,184,186,229,170,146,228,189,147,229,140,133,230,139,172,233,\n130,163,228,185,136,228,184,128,230,160,183,229,155,189,229,134,133,230,152,175,\n229,144,166,230,160,185,230,141,174,231,148,181,232,167,134,229,173,166,233,153,\n162,229,133,183,230,156,137,232,191,135,231,168,139,231,148,177,228,186,142,228,\n186,186,230,137,141,229,135,186,230,157,165,228,184,141,232,191,135,230,173,163,\n229,156,168,230,152,142,230,152,159,230,149,133,228,186,139,229,133,179,231,179,\n187,230,160,135,233,162,152,229,149,134,229,138,161,232,190,147,229,133,165,228,\n184,128,231,155,180,229,159,186,231,161,128,230,149,153,229,173,166,228,186,134,\n232,167,163,229,187,186,231,173,145,231,187,147,230,158,156,229,133,168,231,144,\n131,233,128,154,231,159,165,232,174,161,229,136,146,229,175,185,228,186,142,232,\n137,186,230,156,175,231,155,184,229,134,140,229,143,145,231,148,159,231,156,159,\n231,154,132,229,187,186,231,171,139,231,173,137,231,186,167,231,177,187,229,158,\n139,231,187,143,233,170,140,229,174,158,231,142,176,229,136,182,228,189,156,230,\n157,165,232,135,170,230,160,135,231,173,190,228,187,165,228,184,139,229,142,159,\n229,136,155,230,151,160,230,179,149,229,133,182,228,184,173,229,128,139,228,186,\n186,228,184,128,229,136,135,230,140,135,229,141,151,229,133,179,233,151,173,233,\n155,134,229,155,162,231,172,172,228,184,137,229,133,179,230,179,168,229,155,160,\n230,173,164,231,133,167,231,137,135,230,183,177,229,156,179,229,149,134,228,184,\n154,229,185,191,229,183,158,230,151,165,230,156,159,233,171,152,231,186,167,230,\n156,128,232,191,145,231,187,188,229,144,136,232,161,168,231,164,186,228,184,147,\n232,190,145,232,161,140,228,184,186,228,186,164,233,128,154,232,175,132,228,187,\n183,232,167,137,229,190,151,231,178,190,229,141,142,229,174,182,229,186,173,229,\n174,140,230,136,144,230,132,159,232,167,137,229,174,137,232,163,133,229,190,151,\n229,136,176,233,130,174,228,187,182,229,136,182,229,186,166,233,163,159,229,147,\n129,232,153,189,231,132,182,232,189,172,232,189,189,230,138,165,228,187,183,232,\n174,176,232,128,133,230,150,185,230,161,136,232,161,140,230,148,191,228,186,186,\n230,176,145,231,148,168,229,147,129,228,184,156,232,165,191,230,143,144,229,135,\n186,233,133,146,229,186,151,231,132,182,229,144,142,228,187,152,230,172,190,231,\n131,173,231,130,185,228,187,165,229,137,141,229,174,140,229,133,168,229,143,145,\n229,184,150,232,174,190,231,189,174,233,162,134,229,175,188,229,183,165,228,184,\n154,229,140,187,233,153,162,231,156,139,231,156,139,231,187,143,229,133,184,229,\n142,159,229,155,160,229,185,179,229,143,176,229,144,132,231,167,141,229,162,158,\n229,138,160,230,157,144,230,150,153,230,150,176,229,162,158,228,185,139,229,144,\n142,232,129,140,228,184,154,230,149,136,230,158,156,228,187,138,229,185,180,232,\n174,186,230,150,135,230,136,145,229,155,189,229,145,138,232,175,137,231,137,136,\n228,184,187,228,191,174,230,148,185,229,143,130,228,184,142,230,137,147,229,141,\n176,229,191,171,228,185,144,230,156,186,230,162,176,232,167,130,231,130,185,229,\n173,152,229,156,168,231,178,190,231,165,158,232,142,183,229,190,151,229,136,169,\n231,148,168,231,187,167,231,187,173,228,189,160,228,187,172,232,191,153,228,185,\n136,230,168,161,229,188,143,232,175,173,232,168,128,232,131,189,229,164,159,233,\n155,133,232,153,142,230,147,141,228,189,156,233,163,142,230,160,188,228,184,128,\n232,181,183,231,167,145,229,173,166,228,189,147,232,130,178,231,159,173,228,191,\n161,230,157,161,228,187,182,230,178,187,231,150,151,232,191,144,229,138,168,228,\n186,167,228,184,154,228,188,154,232,174,174,229,175,188,232,136,170,229,133,136,\n231,148,159,232,129,148,231,155,159,229,143,175,230,152,175,229,149,143,233,161,\n140,231,187,147,230,158,132,228,189,156,231,148,168,232,176,131,230,159,165,232,\n179,135,230,150,153,232,135,170,229,138,168,232,180,159,232,180,163,229,134,156,\n228,184,154,232,174,191,233,151,174,229,174,158,230,150,189,230,142,165,229,143,\n151,232,174,168,232,174,186,233,130,163,228,184,170,229,143,141,233,166,136,229,\n138,160,229,188,186,229,165,179,230,128,167,232,140,131,229,155,180,230,156,141,\n229,139,153,228,188,145,233,151,178,228,187,138,230,151,165,229,174,162,230,156,\n141,232,167,128,231,156,139,229,143,130,229,138,160,231,154,132,232,175,157,228,\n184,128,231,130,185,228,191,157,232,175,129,229,155,190,228,185,166,230,156,137,\n230,149,136,230,181,139,232,175,149,231,167,187,229,138,168,230,137,141,232,131,\n189,229,134,179,229,174,154,232,130,161,231,165,168,228,184,141,230,150,173,233,\n156,128,230,177,130,228,184,141,229,190,151,229,138,158,230,179,149,228,185,139,\n233,151,180,233,135,135,231,148,168,232,144,165,233,148,128,230,138,149,232,175,\n137,231,155,174,230,160,135,231,136,177,230,131,133,230,145,132,229,189,177,230,\n156,137,228,186,155,232,164,135,232,163,189,230,150,135,229,173,166,230,156,186,\n228,188,154,230,149,176,229,173,151,232,163,133,228,191,174,232,180,173,231,137,\n169,229,134,156,230,157,145,229,133,168,233,157,162,231,178,190,229,147,129,229,\n133,182,229,174,158,228,186,139,230,131,133,230,176,180,229,185,179,230,143,144,\n231,164,186,228,184,138,229,184,130,232,176,162,232,176,162,230,153,174,233,128,\n154,230,149,153,229,184,136,228,184,138,228,188,160,231,177,187,229,136,171,230,\n173,140,230,155,178,230,139,165,230,156,137,229,136,155,230,150,176,233,133,141,\n228,187,182,229,143,170,232,166,129,230,151,182,228,187,163,232,179,135,232,168,\n138,232,190,190,229,136,176,228,186,186,231,148,159,232,174,162,233,152,133,232,\n128,129,229,184,136,229,177,149,231,164,186,229,191,131,231,144,134,232,180,180,\n229,173,144,231,182,178,231,171,153,228,184,187,233,161,140,232,135,170,231,132,\n182,231,186,167,229,136,171,231,174,128,229,141,149,230,148,185,233,157,169,233,\n130,163,228,186,155,230,157,165,232,175,180,230,137,147,229,188,128,228,187,163,\n231,160,129,229,136,160,233,153,164,232,175,129,229,136,184,232,138,130,231,155,\n174,233,135,141,231,130,185,230,172,161,230,149,184,229,164,154,229,176,145,232,\n167,132,229,136,146,232,181,132,233,135,145,230,137,190,229,136,176,228,187,165,\n229,144,142,229,164,167,229,133,168,228,184,187,233,161,181,230,156,128,228,189,\n179,229,155,158,231,173,148,229,164,169,228,184,139,228,191,157,233,154,156,231,\n142,176,228,187,163,230,163,128,230,159,165,230,138,149,231,165,168,229,176,143,\n230,151,182,230,178,146,230,156,137,230,173,163,229,184,184,231,148,154,232,135,\n179,228,187,163,231,144,134,231,155,174,229,189,149,229,133,172,229,188,128,229,\n164,141,229,136,182,233,135,145,232,158,141,229,185,184,231,166,143,231,137,136,\n230,156,172,229,189,162,230,136,144,229,135,134,229,164,135,232,161,140,230,131,\n133,229,155,158,229,136,176,230,128,157,230,131,179,230,128,142,230,160,183,229,\n141,143,232,174,174,232,174,164,232,175,129,230,156,128,229,165,189,228,186,167,\n231,148,159,230,140,137,231,133,167,230,156,141,232,163,133,229,185,191,228,184,\n156,229,138,168,230,188,171,233,135,135,232,180,173,230,150,176,230,137,139,231,\n187,132,229,155,190,233,157,162,230,157,191,229,143,130,232,128,131,230,148,191,\n230,178,187,229,174,185,230,152,147,229,164,169,229,156,176,229,138,170,229,138,\n155,228,186,186,228,187,172,229,141,135,231,186,167,233,128,159,229,186,166,228,\n186,186,231,137,169,232,176,131,230,149,180,230,181,129,232,161,140,233,128,160,\n230,136,144,230,150,135,229,173,151,233,159,169,229,155,189,232,180,184,230,152,\n147,229,188,128,229,177,149,231,155,184,233,151,156,232,161,168,231,142,176,229,\n189,177,232,167,134,229,166,130,230,173,164,231,190,142,229,174,185,229,164,167,\n229,176,143,230,138,165,233,129,147,230,157,161,230,172,190,229,191,131,230,131,\n133,232,174,184,229,164,154,230,179,149,232,167,132,229,174,182,229,177,133,228,\n185,166,229,186,151,232,191,158,230,142,165,231,171,139,229,141,179,228,184,190,\n230,138,165,230,138,128,229,183,167,229,165,165,232,191,144,231,153,187,229,133,\n165,228,187,165,230,157,165,231,144,134,232,174,186,228,186,139,228,187,182,232,\n135,170,231,148,177,228,184,173,229,141,142,229,138,158,229,133,172,229,166,136,\n229,166,136,231,156,159,230,173,163,228,184,141,233,148,153,229,133,168,230,150,\n135,229,144,136,229,144,140,228,187,183,229,128,188,229,136,171,228,186,186,231,\n155,145,231,157,163,229,133,183,228,189,147,228,184,150,231,186,170,229,155,162,\n233,152,159,229,136,155,228,184,154,230,137,191,230,139,133,229,162,158,233,149,\n191,230,156,137,228,186,186,228,191,157,230,140,129,229,149,134,229,174,182,231,\n187,180,228,191,174,229,143,176,230,185,190,229,183,166,229,143,179,232,130,161,\n228,187,189,231,173,148,230,161,136,229,174,158,233,153,133,231,148,181,228,191,\n161,231,187,143,231,144,134,231,148,159,229,145,189,229,174,163,228,188,160,228,\n187,187,229,138,161,230,173,163,229,188,143,231,137,185,232,137,178,228,184,139,\n230,157,165,229,141,143,228,188,154,229,143,170,232,131,189,229,189,147,231,132,\n182,233,135,141,230,150,176,229,133,167,229,174,185,230,140,135,229,175,188,232,\n191,144,232,161,140,230,151,165,229,191,151,232,179,163,229,174,182,232,182,133,\n232,191,135,229,156,159,229,156,176,230,181,153,230,177,159,230,148,175,228,187,\n152,230,142,168,229,135,186,231,171,153,233,149,191,230,157,173,229,183,158,230,\n137,167,232,161,140,229,136,182,233,128,160,228,185,139,228,184,128,230,142,168,\n229,185,191,231,142,176,229,156,186,230,143,143,232,191,176,229,143,152,229,140,\n150,228,188,160,231,187,159,230,173,140,230,137,139,228,191,157,233,153,169,232,\n175,190,231,168,139,229,140,187,231,150,151,231,187,143,232,191,135,232,191,135,\n229,142,187,228,185,139,229,137,141,230,148,182,229,133,165,229,185,180,229,186,\n166,230,157,130,229,191,151,231,190,142,228,184,189,230,156,128,233,171,152,231,\n153,187,233,153,134,230,156,170,230,157,165,229,138,160,229,183,165,229,133,141,\n232,180,163,230,149,153,231,168,139,231,137,136,229,157,151,232,186,171,228,189,\n147,233,135,141,229,186,134,229,135,186,229,148,174,230,136,144,230,156,172,229,\n189,162,229,188,143,229,156,159,232,177,134,229,135,186,229,131,185,228,184,156,\n230,150,185,233,130,174,231,174,177,229,141,151,228,186,172,230,177,130,232,129,\n140,229,143,150,229,190,151,232,129,140,228,189,141,231,155,184,228,191,161,233,\n161,181,233,157,162,229,136,134,233,146,159,231,189,145,233,161,181,231,161,174,\n229,174,154,229,155,190,228,190,139,231,189,145,229,157,128,231,167,175,230,158,\n129,233,148,153,232,175,175,231,155,174,231,154,132,229,174,157,232,180,157,230,\n156,186,229,133,179,233,163,142,233,153,169,230,142,136,230,157,131,231,151,133,\n230,175,146,229,174,160,231,137,169,233,153,164,228,186,134,232,169,149,232,171,\n150,231,150,190,231,151,133,229,143,138,230,151,182,230,177,130,232,180,173,231,\n171,153,231,130,185,229,132,191,231,171,165,230,175,143,229,164,169,228,184,173,\n229,164,174,232,174,164,232,175,134,230,175,143,228,184,170,229,164,169,230,180,\n165,229,173,151,228,189,147,229,143,176,231,129,163,231,187,180,230,138,164,230,\n156,172,233,161,181,228,184,170,230,128,167,229,174,152,230,150,185,229,184,184,\n232,167,129,231,155,184,230,156,186,230,136,152,231,149,165,229,186,148,229,189,\n147,229,190,139,229,184,136,230,150,185,228,190,191,230,160,161,229,155,173,232,\n130,161,229,184,130,230,136,191,229,177,139,230,160,143,231,155,174,229,145,152,\n229,183,165,229,175,188,232,135,180,231,170,129,231,132,182,233,129,147,229,133,\n183,230,156,172,231,189,145,231,187,147,229,144,136,230,161,163,230,161,136,229,\n138,179,229,138,168,229,143,166,229,164,150,231,190,142,229,133,131,229,188,149,\n232,181,183,230,148,185,229,143,152,231,172,172,229,155,155,228,188,154,232,174,\n161,232,170,170,230,152,142,233,154,144,231,167,129,229,174,157,229,174,157,232,\n167,132,232,140,131,230,182,136,232,180,185,229,133,177,229,144,140,229,191,152,\n232,174,176,228,189,147,231,179,187,229,184,166,230,157,165,229,144,141,229,173,\n151,231,153,188,232,161,168,229,188,128,230,148,190,229,138,160,231,155,159,229,\n143,151,229,136,176,228,186,140,230,137,139,229,164,167,233,135,143,230,136,144,\n228,186,186,230,149,176,233,135,143,229,133,177,228,186,171,229,140,186,229,159,\n159,229,165,179,229,173,169,229,142,159,229,136,153,230,137,128,229,156,168,231,\n187,147,230,157,159,233,128,154,228,191,161,232,182,133,231,186,167,233,133,141,\n231,189,174,229,189,147,230,151,182,228,188,152,231,167,128,230,128,167,230,132,\n159,230,136,191,228,186,167,233,129,138,230,136,178,229,135,186,229,143,163,230,\n143,144,228,186,164,229,176,177,228,184,154,228,191,157,229,129,165,231,168,139,\n229,186,166,229,143,130,230,149,176,228,186,139,228,184,154,230,149,180,228,184,\n170,229,177,177,228,184,156,230,131,133,230,132,159,231,137,185,230,174,138,229,\n136,134,233,161,158,230,144,156,229,176,139,229,177,158,228,186,142,233,151,168,\n230,136,183,232,180,162,229,138,161,229,163,176,233,159,179,229,143,138,229,133,\n182,232,180,162,231,187,143,229,157,154,230,140,129,229,185,178,233,131,168,230,\n136,144,231,171,139,229,136,169,231,155,138,232,128,131,232,153,145,230,136,144,\n233,131,189,229,140,133,232,163,133,231,148,168,230,136,182,230,175,148,232,181,\n155,230,150,135,230,152,142,230,139,155,229,149,134,229,174,140,230,149,180,231,\n156,159,230,152,175,231,156,188,231,157,155,228,188,153,228,188,180,229,168,129,\n230,156,155,233,162,134,229,159,159,229,141,171,231,148,159,228,188,152,230,131,\n160,232,171,150,229,163,135,229,133,172,229,133,177,232,137,175,229,165,189,229,\n133,133,229,136,134,231,172,166,229,144,136,233,153,132,228,187,182,231,137,185,\n231,130,185,228,184,141,229,143,175,232,139,177,230,150,135,232,181,132,228,186,\n167,230,160,185,230,156,172,230,152,142,230,152,190,229,175,134,231,162,188,229,\n133,172,228,188,151,230,176,145,230,151,143,230,155,180,229,138,160,228,186,171,\n229,143,151,229,144,140,229,173,166,229,144,175,229,138,168,233,128,130,229,144,\n136,229,142,159,230,157,165,233,151,174,231,173,148,230,156,172,230,150,135,231,\n190,142,233,163,159,231,187,191,232,137,178,231,168,179,229,174,154,231,187,136,\n228,186,142,231,148,159,231,137,169,228,190,155,230,177,130,230,144,156,231,139,\n144,229,138,155,233,135,143,228,184,165,233,135,141,230,176,184,232,191,156,229,\n134,153,231,156,159,230,156,137,233,153,144,231,171,158,228,186,137,229,175,185,\n232,177,161,232,180,185,231,148,168,228,184,141,229,165,189,231,187,157,229,175,\n185,229,141,129,229,136,134,228,191,131,232,191,155,231,130,185,232,175,132,229,\n189,177,233,159,179,228,188,152,229,138,191,228,184,141,229,176,145,230,172,163,\n232,181,143,229,185,182,228,184,148,230,156,137,231,130,185,230,150,185,229,144,\n145,229,133,168,230,150,176,228,191,161,231,148,168,232,174,190,230,150,189,229,\n189,162,232,177,161,232,181,132,230,160,188,231,170,129,231,160,180,233,154,143,\n231,157,128,233,135,141,229,164,167,228,186,142,230,152,175,230,175,149,228,184,\n154,230,153,186,232,131,189,229,140,150,229,183,165,229,174,140,231,190,142,229,\n149,134,229,159,142,231,187,159,228,184,128,229,135,186,231,137,136,230,137,147,\n233,128,160,231,148,162,229,147,129,230,166,130,229,134,181,231,148,168,228,186,\n142,228,191,157,231,149,153,229,155,160,231,180,160,228,184,173,229,156,139,229,\n173,152,229,130,168,232,180,180,229,155,190,230,156,128,230,132,155,233,149,191,\n230,156,159,229,143,163,228,187,183,231,144,134,232,180,162,229,159,186,229,156,\n176,229,174,137,230,142,146,230,173,166,230,177,137,233,135,140,233,157,162,229,\n136,155,229,187,186,229,164,169,231,169,186,233,166,150,229,133,136,229,174,140,\n229,150,132,233,169,177,229,138,168,228,184,139,233,157,162,228,184,141,229,134,\n141,232,175,154,228,191,161,230,132,143,228,185,137,233,152,179,229,133,137,232,\n139,177,229,155,189,230,188,130,228,186,174,229,134,155,228,186,139,231,142,169,\n229,174,182,231,190,164,228,188,151,229,134,156,230,176,145,229,141,179,229,143,\n175,229,144,141,231,168,177,229,174,182,229,133,183,229,138,168,231,148,187,230,\n131,179,229,136,176,230,179,168,230,152,142,229,176,143,229,173,166,230,128,167,\n232,131,189,232,128,131,231,160,148,231,161,172,228,187,182,232,167,130,231,156,\n139,230,184,133,230,165,154,230,144,158,231,172,145,233,166,150,233,160,129,233,\n187,132,233,135,145,233,128,130,231,148,168,230,177,159,232,139,143,231,156,159,\n229,174,158,228,184,187,231,174,161,233,152,182,230,174,181,232,168,187,229,134,\n138,231,191,187,232,175,145,230,157,131,229,136,169,229,129,154,229,165,189,228,\n188,188,228,185,142,233,128,154,232,174,175,230,150,189,229,183,165,231,139,128,\n230,133,139,228,185,159,232,174,184,231,142,175,228,191,157,229,159,185,229,133,\n187,230,166,130,229,191,181,229,164,167,229,158,139,230,156,186,231,165,168,231,\n144,134,232,167,163,229,140,191,229,144,141,99,117,97,110,100,111,101,110,118,\n105,97,114,109,97,100,114,105,100,98,117,115,99,97,114,105,110,105,99,105,111,\n116,105,101,109,112,111,112,111,114,113,117,101,99,117,101,110,116,97,101,115,\n116,97,100,111,112,117,101,100,101,110,106,117,101,103,111,115,99,111,110,116,\n114,97,101,115,116,195,161,110,110,111,109,98,114,101,116,105,101,110,101,110,\n112,101,114,102,105,108,109,97,110,101,114,97,97,109,105,103,111,115,99,105,117,\n100,97,100,99,101,110,116,114,111,97,117,110,113,117,101,112,117,101,100,101,115\n,100,101,110,116,114,111,112,114,105,109,101,114,112,114,101,99,105,111,115,101,\n103,195,186,110,98,117,101,110,111,115,118,111,108,118,101,114,112,117,110,116,\n111,115,115,101,109,97,110,97,104,97,98,195,173,97,97,103,111,115,116,111,110,\n117,101,118,111,115,117,110,105,100,111,115,99,97,114,108,111,115,101,113,117,\n105,112,111,110,105,195,177,111,115,109,117,99,104,111,115,97,108,103,117,110,97\n,99,111,114,114,101,111,105,109,97,103,101,110,112,97,114,116,105,114,97,114,114\n,105,98,97,109,97,114,195,173,97,104,111,109,98,114,101,101,109,112,108,101,111,\n118,101,114,100,97,100,99,97,109,98,105,111,109,117,99,104,97,115,102,117,101,\n114,111,110,112,97,115,97,100,111,108,195,173,110,101,97,112,97,114,101,99,101,\n110,117,101,118,97,115,99,117,114,115,111,115,101,115,116,97,98,97,113,117,105,\n101,114,111,108,105,98,114,111,115,99,117,97,110,116,111,97,99,99,101,115,111,\n109,105,103,117,101,108,118,97,114,105,111,115,99,117,97,116,114,111,116,105,101\n,110,101,115,103,114,117,112,111,115,115,101,114,195,161,110,101,117,114,111,112\n,97,109,101,100,105,111,115,102,114,101,110,116,101,97,99,101,114,99,97,100,101,\n109,195,161,115,111,102,101,114,116,97,99,111,99,104,101,115,109,111,100,101,108\n,111,105,116,97,108,105,97,108,101,116,114,97,115,97,108,103,195,186,110,99,111,\n109,112,114,97,99,117,97,108,101,115,101,120,105,115,116,101,99,117,101,114,112,\n111,115,105,101,110,100,111,112,114,101,110,115,97,108,108,101,103,97,114,118,\n105,97,106,101,115,100,105,110,101,114,111,109,117,114,99,105,97,112,111,100,114\n,195,161,112,117,101,115,116,111,100,105,97,114,105,111,112,117,101,98,108,111,\n113,117,105,101,114,101,109,97,110,117,101,108,112,114,111,112,105,111,99,114,\n105,115,105,115,99,105,101,114,116,111,115,101,103,117,114,111,109,117,101,114,\n116,101,102,117,101,110,116,101,99,101,114,114,97,114,103,114,97,110,100,101,101\n,102,101,99,116,111,112,97,114,116,101,115,109,101,100,105,100,97,112,114,111,\n112,105,97,111,102,114,101,99,101,116,105,101,114,114,97,101,45,109,97,105,108,\n118,97,114,105,97,115,102,111,114,109,97,115,102,117,116,117,114,111,111,98,106,\n101,116,111,115,101,103,117,105,114,114,105,101,115,103,111,110,111,114,109,97,\n115,109,105,115,109,111,115,195,186,110,105,99,111,99,97,109,105,110,111,115,105\n,116,105,111,115,114,97,122,195,179,110,100,101,98,105,100,111,112,114,117,101,\n98,97,116,111,108,101,100,111,116,101,110,195,173,97,106,101,115,195,186,115,101\n,115,112,101,114,111,99,111,99,105,110,97,111,114,105,103,101,110,116,105,101,\n110,100,97,99,105,101,110,116,111,99,195,161,100,105,122,104,97,98,108,97,114,\n115,101,114,195,173,97,108,97,116,105,110,97,102,117,101,114,122,97,101,115,116,\n105,108,111,103,117,101,114,114,97,101,110,116,114,97,114,195,169,120,105,116,\n111,108,195,179,112,101,122,97,103,101,110,100,97,118,195,173,100,101,111,101,\n118,105,116,97,114,112,97,103,105,110,97,109,101,116,114,111,115,106,97,118,105,\n101,114,112,97,100,114,101,115,102,195,161,99,105,108,99,97,98,101,122,97,195,\n161,114,101,97,115,115,97,108,105,100,97,101,110,118,195,173,111,106,97,112,195,\n179,110,97,98,117,115,111,115,98,105,101,110,101,115,116,101,120,116,111,115,108\n,108,101,118,97,114,112,117,101,100,97,110,102,117,101,114,116,101,99,111,109,\n195,186,110,99,108,97,115,101,115,104,117,109,97,110,111,116,101,110,105,100,111\n,98,105,108,98,97,111,117,110,105,100,97,100,101,115,116,195,161,115,101,100,105\n,116,97,114,99,114,101,97,100,111,208,180,208,187,209,143,209,135,209,130,208,\n190,208,186,208,176,208,186,208,184,208,187,208,184,209,141,209,130,208,190,208,\n178,209,129,208,181,208,181,208,179,208,190,208,191,209,128,208,184,209,130,208,\n176,208,186,208,181,209,137,208,181,209,131,208,182,208,181,208,154,208,176,208,\n186,208,177,208,181,208,183,208,177,209,139,208,187,208,190,208,189,208,184,208,\n146,209,129,208,181,208,191,208,190,208,180,208,173,209,130,208,190,209,130,208,\n190,208,188,209,135,208,181,208,188,208,189,208,181,209,130,208,187,208,181,209,\n130,209,128,208,176,208,183,208,190,208,189,208,176,208,179,208,180,208,181,208,\n188,208,189,208,181,208,148,208,187,209,143,208,159,209,128,208,184,208,189,208,\n176,209,129,208,189,208,184,209,133,209,130,208,181,208,188,208,186,209,130,208,\n190,208,179,208,190,208,180,208,178,208,190,209,130,209,130,208,176,208,188,208,\n161,208,168,208,144,208,188,208,176,209,143,208,167,209,130,208,190,208,178,208,\n176,209,129,208,178,208,176,208,188,208,181,208,188,209,131,208,162,208,176,208,\n186,208,180,208,178,208,176,208,189,208,176,208,188,209,141,209,130,208,184,209,\n141,209,130,209,131,208,146,208,176,208,188,209,130,208,181,209,133,208,191,209,\n128,208,190,209,130,209,131,209,130,208,189,208,176,208,180,208,180,208,189,209,\n143,208,146,208,190,209,130,209,130,209,128,208,184,208,189,208,181,208,185,208,\n146,208,176,209,129,208,189,208,184,208,188,209,129,208,176,208,188,209,130,208,\n190,209,130,209,128,209,131,208,177,208,158,208,189,208,184,208,188,208,184,209,\n128,208,189,208,181,208,181,208,158,208,158,208,158,208,187,208,184,209,134,209,\n141,209,130,208,176,208,158,208,189,208,176,208,189,208,181,208,188,208,180,208,\n190,208,188,208,188,208,190,208,185,208,180,208,178,208,181,208,190,208,189,208,\n190,209,129,209,131,208,180,224,164,149,224,165,135,224,164,185,224,165,136,224,\n164,149,224,165,128,224,164,184,224,165,135,224,164,149,224,164,190,224,164,149,\n224,165,139,224,164,148,224,164,176,224,164,170,224,164,176,224,164,168,224,165,\n135,224,164,143,224,164,149,224,164,149,224,164,191,224,164,173,224,165,128,224,\n164,135,224,164,184,224,164,149,224,164,176,224,164,164,224,165,139,224,164,185,\n224,165,139,224,164,134,224,164,170,224,164,185,224,165,128,224,164,175,224,164,\n185,224,164,175,224,164,190,224,164,164,224,164,149,224,164,165,224,164,190,106,\n97,103,114,97,110,224,164,134,224,164,156,224,164,156,224,165,139,224,164,133,\n224,164,172,224,164,166,224,165,139,224,164,151,224,164,136,224,164,156,224,164,\n190,224,164,151,224,164,143,224,164,185,224,164,174,224,164,135,224,164,168,224,\n164,181,224,164,185,224,164,175,224,165,135,224,164,165,224,165,135,224,164,165,\n224,165,128,224,164,152,224,164,176,224,164,156,224,164,172,224,164,166,224,165,\n128,224,164,149,224,164,136,224,164,156,224,165,128,224,164,181,224,165,135,224,\n164,168,224,164,136,224,164,168,224,164,143,224,164,185,224,164,176,224,164,137,\n224,164,184,224,164,174,224,165,135,224,164,149,224,164,174,224,164,181,224,165,\n139,224,164,178,224,165,135,224,164,184,224,164,172,224,164,174,224,164,136,224,\n164,166,224,165,135,224,164,147,224,164,176,224,164,134,224,164,174,224,164,172,\n224,164,184,224,164,173,224,164,176,224,164,172,224,164,168,224,164,154,224,164,\n178,224,164,174,224,164,168,224,164,134,224,164,151,224,164,184,224,165,128,224,\n164,178,224,165,128,216,185,217,132,217,137,216,165,217,132,217,137,217,135,216,\n176,216,167,216,162,216,174,216,177,216,185,216,175,216,175,216,167,217,132,217,\n137,217,135,216,176,217,135,216,181,217,136,216,177,216,186,217,138,216,177,217,\n131,216,167,217,134,217,136,217,132,216,167,216,168,217,138,217,134,216,185,216,\n177,216,182,216,176,217,132,217,131,217,135,217,134,216,167,217,138,217,136,217,\n133,217,130,216,167,217,132,216,185,217,132,217,138,216,167,217,134,216,167,217,\n132,217,131,217,134,216,173,216,170,217,137,217,130,216,168,217,132,217,136,216,\n173,216,169,216,167,216,174,216,177,217,129,217,130,216,183,216,185,216,168,216,\n175,216,177,217,131,217,134,216,165,216,176,216,167,217,131,217,133,216,167,216,\n167,216,173,216,175,216,165,217,132,216,167,217,129,217,138,217,135,216,168,216,\n185,216,182,217,131,217,138,217,129,216,168,216,173,216,171,217,136,217,133,217,\n134,217,136,217,135,217,136,216,163,217,134,216,167,216,172,216,175,216,167,217,\n132,217,135,216,167,216,179,217,132,217,133,216,185,217,134,216,175,217,132,217,\n138,216,179,216,185,216,168,216,177,216,181,217,132,217,137,217,133,217,134,216,\n176,216,168,217,135,216,167,216,163,217,134,217,135,217,133,216,171,217,132,217,\n131,217,134,216,170,216,167,217,132,216,167,216,173,217,138,216,171,217,133,216,\n181,216,177,216,180,216,177,216,173,216,173,217,136,217,132,217,136,217,129,217,\n138,216,167,216,176,216,167,217,132,217,131,217,132,217,133,216,177,216,169,216,\n167,217,134,216,170,216,167,217,132,217,129,216,163,216,168,217,136,216,174,216,\n167,216,181,216,163,217,134,216,170,216,167,217,134,217,135,216,167,217,132,217,\n138,216,185,216,182,217,136,217,136,217,130,216,175,216,167,216,168,217,134,216,\n174,217,138,216,177,216,168,217,134,216,170,217,132,217,131,217,133,216,180,216,\n167,216,161,217,136,217,135,217,138,216,167,216,168,217,136,217,130,216,181,216,\n181,217,136,217,133,216,167,216,177,217,130,217,133,216,163,216,173,216,175,217,\n134,216,173,217,134,216,185,216,175,217,133,216,177,216,163,217,138,216,167,216,\n173,216,169,217,131,216,170,216,168,216,175,217,136,217,134,217,138,216,172,216,\n168,217,133,217,134,217,135,216,170,216,173,216,170,216,172,217,135,216,169,216,\n179,217,134,216,169,217,138,216,170,217,133,217,131,216,177,216,169,216,186,216,\n178,216,169,217,134,217,129,216,179,216,168,217,138,216,170,217,132,217,132,217,\n135,217,132,217,134,216,167,216,170,217,132,217,131,217,130,217,132,216,168,217,\n132,217,133,216,167,216,185,217,134,217,135,216,163,217,136,217,132,216,180,217,\n138,216,161,217,134,217,136,216,177,216,163,217,133,216,167,217,129,217,138,217,\n131,216,168,217,131,217,132,216,176,216,167,216,170,216,177,216,170,216,168,216,\n168,216,163,217,134,217,135,217,133,216,179,216,167,217,134,217,131,216,168,217,\n138,216,185,217,129,217,130,216,175,216,173,216,179,217,134,217,132,217,135,217,\n133,216,180,216,185,216,177,216,163,217,135,217,132,216,180,217,135,216,177,217,\n130,216,183,216,177,216,183,217,132,216,168,112,114,111,102,105,108,101,115,101,\n114,118,105,99,101,100,101,102,97,117,108,116,104,105,109,115,101,108,102,100,\n101,116,97,105,108,115,99,111,110,116,101,110,116,115,117,112,112,111,114,116,\n115,116,97,114,116,101,100,109,101,115,115,97,103,101,115,117,99,99,101,115,115,\n102,97,115,104,105,111,110,60,116,105,116,108,101,62,99,111,117,110,116,114,121,\n97,99,99,111,117,110,116,99,114,101,97,116,101,100,115,116,111,114,105,101,115,\n114,101,115,117,108,116,115,114,117,110,110,105,110,103,112,114,111,99,101,115,\n115,119,114,105,116,105,110,103,111,98,106,101,99,116,115,118,105,115,105,98,108\n,101,119,101,108,99,111,109,101,97,114,116,105,99,108,101,117,110,107,110,111,\n119,110,110,101,116,119,111,114,107,99,111,109,112,97,110,121,100,121,110,97,109\n,105,99,98,114,111,119,115,101,114,112,114,105,118,97,99,121,112,114,111,98,108,\n101,109,83,101,114,118,105,99,101,114,101,115,112,101,99,116,100,105,115,112,108\n,97,121,114,101,113,117,101,115,116,114,101,115,101,114,118,101,119,101,98,115,\n105,116,101,104,105,115,116,111,114,121,102,114,105,101,110,100,115,111,112,116,\n105,111,110,115,119,111,114,107,105,110,103,118,101,114,115,105,111,110,109,105,\n108,108,105,111,110,99,104,97,110,110,101,108,119,105,110,100,111,119,46,97,100,\n100,114,101,115,115,118,105,115,105,116,101,100,119,101,97,116,104,101,114,99,\n111,114,114,101,99,116,112,114,111,100,117,99,116,101,100,105,114,101,99,116,102\n,111,114,119,97,114,100,121,111,117,32,99,97,110,114,101,109,111,118,101,100,115\n,117,98,106,101,99,116,99,111,110,116,114,111,108,97,114,99,104,105,118,101,99,\n117,114,114,101,110,116,114,101,97,100,105,110,103,108,105,98,114,97,114,121,108\n,105,109,105,116,101,100,109,97,110,97,103,101,114,102,117,114,116,104,101,114,\n115,117,109,109,97,114,121,109,97,99,104,105,110,101,109,105,110,117,116,101,115\n,112,114,105,118,97,116,101,99,111,110,116,101,120,116,112,114,111,103,114,97,\n109,115,111,99,105,101,116,121,110,117,109,98,101,114,115,119,114,105,116,116,\n101,110,101,110,97,98,108,101,100,116,114,105,103,103,101,114,115,111,117,114,99\n,101,115,108,111,97,100,105,110,103,101,108,101,109,101,110,116,112,97,114,116,\n110,101,114,102,105,110,97,108,108,121,112,101,114,102,101,99,116,109,101,97,110\n,105,110,103,115,121,115,116,101,109,115,107,101,101,112,105,110,103,99,117,108,\n116,117,114,101,38,113,117,111,116,59,44,106,111,117,114,110,97,108,112,114,111,\n106,101,99,116,115,117,114,102,97,99,101,115,38,113,117,111,116,59,101,120,112,\n105,114,101,115,114,101,118,105,101,119,115,98,97,108,97,110,99,101,69,110,103,\n108,105,115,104,67,111,110,116,101,110,116,116,104,114,111,117,103,104,80,108,\n101,97,115,101,32,111,112,105,110,105,111,110,99,111,110,116,97,99,116,97,118,\n101,114,97,103,101,112,114,105,109,97,114,121,118,105,108,108,97,103,101,83,112,\n97,110,105,115,104,103,97,108,108,101,114,121,100,101,99,108,105,110,101,109,101\n,101,116,105,110,103,109,105,115,115,105,111,110,112,111,112,117,108,97,114,113,\n117,97,108,105,116,121,109,101,97,115,117,114,101,103,101,110,101,114,97,108,115\n,112,101,99,105,101,115,115,101,115,115,105,111,110,115,101,99,116,105,111,110,\n119,114,105,116,101,114,115,99,111,117,110,116,101,114,105,110,105,116,105,97,\n108,114,101,112,111,114,116,115,102,105,103,117,114,101,115,109,101,109,98,101,\n114,115,104,111,108,100,105,110,103,100,105,115,112,117,116,101,101,97,114,108,\n105,101,114,101,120,112,114,101,115,115,100,105,103,105,116,97,108,112,105,99,\n116,117,114,101,65,110,111,116,104,101,114,109,97,114,114,105,101,100,116,114,97\n,102,102,105,99,108,101,97,100,105,110,103,99,104,97,110,103,101,100,99,101,110,\n116,114,97,108,118,105,99,116,111,114,121,105,109,97,103,101,115,47,114,101,97,\n115,111,110,115,115,116,117,100,105,101,115,102,101,97,116,117,114,101,108,105,\n115,116,105,110,103,109,117,115,116,32,98,101,115,99,104,111,111,108,115,86,101,\n114,115,105,111,110,117,115,117,97,108,108,121,101,112,105,115,111,100,101,112,\n108,97,121,105,110,103,103,114,111,119,105,110,103,111,98,118,105,111,117,115,\n111,118,101,114,108,97,121,112,114,101,115,101,110,116,97,99,116,105,111,110,115\n,60,47,117,108,62,13,10,119,114,97,112,112,101,114,97,108,114,101,97,100,121,99,\n101,114,116,97,105,110,114,101,97,108,105,116,121,115,116,111,114,97,103,101,97,\n110,111,116,104,101,114,100,101,115,107,116,111,112,111,102,102,101,114,101,100,\n112,97,116,116,101,114,110,117,110,117,115,117,97,108,68,105,103,105,116,97,108,\n99,97,112,105,116,97,108,87,101,98,115,105,116,101,102,97,105,108,117,114,101,99\n,111,110,110,101,99,116,114,101,100,117,99,101,100,65,110,100,114,111,105,100,\n100,101,99,97,100,101,115,114,101,103,117,108,97,114,32,38,97,109,112,59,32,97,\n110,105,109,97,108,115,114,101,108,101,97,115,101,65,117,116,111,109,97,116,103,\n101,116,116,105,110,103,109,101,116,104,111,100,115,110,111,116,104,105,110,103,\n80,111,112,117,108,97,114,99,97,112,116,105,111,110,108,101,116,116,101,114,115,\n99,97,112,116,117,114,101,115,99,105,101,110,99,101,108,105,99,101,110,115,101,\n99,104,97,110,103,101,115,69,110,103,108,97,110,100,61,49,38,97,109,112,59,72,\n105,115,116,111,114,121,32,61,32,110,101,119,32,67,101,110,116,114,97,108,117,\n112,100,97,116,101,100,83,112,101,99,105,97,108,78,101,116,119,111,114,107,114,\n101,113,117,105,114,101,99,111,109,109,101,110,116,119,97,114,110,105,110,103,67\n,111,108,108,101,103,101,116,111,111,108,98,97,114,114,101,109,97,105,110,115,98\n,101,99,97,117,115,101,101,108,101,99,116,101,100,68,101,117,116,115,99,104,102,\n105,110,97,110,99,101,119,111,114,107,101,114,115,113,117,105,99,107,108,121,98,\n101,116,119,101,101,110,101,120,97,99,116,108,121,115,101,116,116,105,110,103,\n100,105,115,101,97,115,101,83,111,99,105,101,116,121,119,101,97,112,111,110,115,\n101,120,104,105,98,105,116,38,108,116,59,33,45,45,67,111,110,116,114,111,108,99,\n108,97,115,115,101,115,99,111,118,101,114,101,100,111,117,116,108,105,110,101,97\n,116,116,97,99,107,115,100,101,118,105,99,101,115,40,119,105,110,100,111,119,112\n,117,114,112,111,115,101,116,105,116,108,101,61,34,77,111,98,105,108,101,32,107,\n105,108,108,105,110,103,115,104,111,119,105,110,103,73,116,97,108,105,97,110,100\n,114,111,112,112,101,100,104,101,97,118,105,108,121,101,102,102,101,99,116,115,\n45,49,39,93,41,59,10,99,111,110,102,105,114,109,67,117,114,114,101,110,116,97,\n100,118,97,110,99,101,115,104,97,114,105,110,103,111,112,101,110,105,110,103,100\n,114,97,119,105,110,103,98,105,108,108,105,111,110,111,114,100,101,114,101,100,\n71,101,114,109,97,110,121,114,101,108,97,116,101,100,60,47,102,111,114,109,62,\n105,110,99,108,117,100,101,119,104,101,116,104,101,114,100,101,102,105,110,101,\n100,83,99,105,101,110,99,101,99,97,116,97,108,111,103,65,114,116,105,99,108,101,\n98,117,116,116,111,110,115,108,97,114,103,101,115,116,117,110,105,102,111,114,\n109,106,111,117,114,110,101,121,115,105,100,101,98,97,114,67,104,105,99,97,103,\n111,104,111,108,105,100,97,121,71,101,110,101,114,97,108,112,97,115,115,97,103,\n101,44,38,113,117,111,116,59,97,110,105,109,97,116,101,102,101,101,108,105,110,\n103,97,114,114,105,118,101,100,112,97,115,115,105,110,103,110,97,116,117,114,97,\n108,114,111,117,103,104,108,121,46,10,10,84,104,101,32,98,117,116,32,110,111,116\n,100,101,110,115,105,116,121,66,114,105,116,97,105,110,67,104,105,110,101,115,\n101,108,97,99,107,32,111,102,116,114,105,98,117,116,101,73,114,101,108,97,110,\n100,34,32,100,97,116,97,45,102,97,99,116,111,114,115,114,101,99,101,105,118,101,\n116,104,97,116,32,105,115,76,105,98,114,97,114,121,104,117,115,98,97,110,100,105\n,110,32,102,97,99,116,97,102,102,97,105,114,115,67,104,97,114,108,101,115,114,97\n,100,105,99,97,108,98,114,111,117,103,104,116,102,105,110,100,105,110,103,108,97\n,110,100,105,110,103,58,108,97,110,103,61,34,114,101,116,117,114,110,32,108,101,\n97,100,101,114,115,112,108,97,110,110,101,100,112,114,101,109,105,117,109,112,97\n,99,107,97,103,101,65,109,101,114,105,99,97,69,100,105,116,105,111,110,93,38,113\n,117,111,116,59,77,101,115,115,97,103,101,110,101,101,100,32,116,111,118,97,108,\n117,101,61,34,99,111,109,112,108,101,120,108,111,111,107,105,110,103,115,116,97,\n116,105,111,110,98,101,108,105,101,118,101,115,109,97,108,108,101,114,45,109,111\n,98,105,108,101,114,101,99,111,114,100,115,119,97,110,116,32,116,111,107,105,110\n,100,32,111,102,70,105,114,101,102,111,120,121,111,117,32,97,114,101,115,105,109\n,105,108,97,114,115,116,117,100,105,101,100,109,97,120,105,109,117,109,104,101,\n97,100,105,110,103,114,97,112,105,100,108,121,99,108,105,109,97,116,101,107,105,\n110,103,100,111,109,101,109,101,114,103,101,100,97,109,111,117,110,116,115,102,\n111,117,110,100,101,100,112,105,111,110,101,101,114,102,111,114,109,117,108,97,\n100,121,110,97,115,116,121,104,111,119,32,116,111,32,83,117,112,112,111,114,116,\n114,101,118,101,110,117,101,101,99,111,110,111,109,121,82,101,115,117,108,116,\n115,98,114,111,116,104,101,114,115,111,108,100,105,101,114,108,97,114,103,101,\n108,121,99,97,108,108,105,110,103,46,38,113,117,111,116,59,65,99,99,111,117,110,\n116,69,100,119,97,114,100,32,115,101,103,109,101,110,116,82,111,98,101,114,116,\n32,101,102,102,111,114,116,115,80,97,99,105,102,105,99,108,101,97,114,110,101,\n100,117,112,32,119,105,116,104,104,101,105,103,104,116,58,119,101,32,104,97,118,\n101,65,110,103,101,108,101,115,110,97,116,105,111,110,115,95,115,101,97,114,99,\n104,97,112,112,108,105,101,100,97,99,113,117,105,114,101,109,97,115,115,105,118,\n101,103,114,97,110,116,101,100,58,32,102,97,108,115,101,116,114,101,97,116,101,\n100,98,105,103,103,101,115,116,98,101,110,101,102,105,116,100,114,105,118,105,\n110,103,83,116,117,100,105,101,115,109,105,110,105,109,117,109,112,101,114,104,\n97,112,115,109,111,114,110,105,110,103,115,101,108,108,105,110,103,105,115,32,\n117,115,101,100,114,101,118,101,114,115,101,118,97,114,105,97,110,116,32,114,111\n,108,101,61,34,109,105,115,115,105,110,103,97,99,104,105,101,118,101,112,114,111\n,109,111,116,101,115,116,117,100,101,110,116,115,111,109,101,111,110,101,101,120\n,116,114,101,109,101,114,101,115,116,111,114,101,98,111,116,116,111,109,58,101,\n118,111,108,118,101,100,97,108,108,32,116,104,101,115,105,116,101,109,97,112,101\n,110,103,108,105,115,104,119,97,121,32,116,111,32,32,65,117,103,117,115,116,115,\n121,109,98,111,108,115,67,111,109,112,97,110,121,109,97,116,116,101,114,115,109,\n117,115,105,99,97,108,97,103,97,105,110,115,116,115,101,114,118,105,110,103,125,\n41,40,41,59,13,10,112,97,121,109,101,110,116,116,114,111,117,98,108,101,99,111,\n110,99,101,112,116,99,111,109,112,97,114,101,112,97,114,101,110,116,115,112,108,\n97,121,101,114,115,114,101,103,105,111,110,115,109,111,110,105,116,111,114,32,39\n,39,84,104,101,32,119,105,110,110,105,110,103,101,120,112,108,111,114,101,97,100\n,97,112,116,101,100,71,97,108,108,101,114,121,112,114,111,100,117,99,101,97,98,\n105,108,105,116,121,101,110,104,97,110,99,101,99,97,114,101,101,114,115,41,46,32\n,84,104,101,32,99,111,108,108,101,99,116,83,101,97,114,99,104,32,97,110,99,105,\n101,110,116,101,120,105,115,116,101,100,102,111,111,116,101,114,32,104,97,110,\n100,108,101,114,112,114,105,110,116,101,100,99,111,110,115,111,108,101,69,97,115\n,116,101,114,110,101,120,112,111,114,116,115,119,105,110,100,111,119,115,67,104,\n97,110,110,101,108,105,108,108,101,103,97,108,110,101,117,116,114,97,108,115,117\n,103,103,101,115,116,95,104,101,97,100,101,114,115,105,103,110,105,110,103,46,\n104,116,109,108,34,62,115,101,116,116,108,101,100,119,101,115,116,101,114,110,99\n,97,117,115,105,110,103,45,119,101,98,107,105,116,99,108,97,105,109,101,100,74,\n117,115,116,105,99,101,99,104,97,112,116,101,114,118,105,99,116,105,109,115,84,\n104,111,109,97,115,32,109,111,122,105,108,108,97,112,114,111,109,105,115,101,112\n,97,114,116,105,101,115,101,100,105,116,105,111,110,111,117,116,115,105,100,101,\n58,102,97,108,115,101,44,104,117,110,100,114,101,100,79,108,121,109,112,105,99,\n95,98,117,116,116,111,110,97,117,116,104,111,114,115,114,101,97,99,104,101,100,\n99,104,114,111,110,105,99,100,101,109,97,110,100,115,115,101,99,111,110,100,115,\n112,114,111,116,101,99,116,97,100,111,112,116,101,100,112,114,101,112,97,114,101\n,110,101,105,116,104,101,114,103,114,101,97,116,108,121,103,114,101,97,116,101,\n114,111,118,101,114,97,108,108,105,109,112,114,111,118,101,99,111,109,109,97,110\n,100,115,112,101,99,105,97,108,115,101,97,114,99,104,46,119,111,114,115,104,105,\n112,102,117,110,100,105,110,103,116,104,111,117,103,104,116,104,105,103,104,101,\n115,116,105,110,115,116,101,97,100,117,116,105,108,105,116,121,113,117,97,114,\n116,101,114,67,117,108,116,117,114,101,116,101,115,116,105,110,103,99,108,101,97\n,114,108,121,101,120,112,111,115,101,100,66,114,111,119,115,101,114,108,105,98,\n101,114,97,108,125,32,99,97,116,99,104,80,114,111,106,101,99,116,101,120,97,109,\n112,108,101,104,105,100,101,40,41,59,70,108,111,114,105,100,97,97,110,115,119,\n101,114,115,97,108,108,111,119,101,100,69,109,112,101,114,111,114,100,101,102,\n101,110,115,101,115,101,114,105,111,117,115,102,114,101,101,100,111,109,83,101,\n118,101,114,97,108,45,98,117,116,116,111,110,70,117,114,116,104,101,114,111,117,\n116,32,111,102,32,33,61,32,110,117,108,108,116,114,97,105,110,101,100,68,101,110\n,109,97,114,107,118,111,105,100,40,48,41,47,97,108,108,46,106,115,112,114,101,\n118,101,110,116,82,101,113,117,101,115,116,83,116,101,112,104,101,110,10,10,87,\n104,101,110,32,111,98,115,101,114,118,101,60,47,104,50,62,13,10,77,111,100,101,\n114,110,32,112,114,111,118,105,100,101,34,32,97,108,116,61,34,98,111,114,100,101\n,114,115,46,10,10,70,111,114,32,10,10,77,97,110,121,32,97,114,116,105,115,116,\n115,112,111,119,101,114,101,100,112,101,114,102,111,114,109,102,105,99,116,105,\n111,110,116,121,112,101,32,111,102,109,101,100,105,99,97,108,116,105,99,107,101,\n116,115,111,112,112,111,115,101,100,67,111,117,110,99,105,108,119,105,116,110,\n101,115,115,106,117,115,116,105,99,101,71,101,111,114,103,101,32,66,101,108,103,\n105,117,109,46,46,46,60,47,97,62,116,119,105,116,116,101,114,110,111,116,97,98,\n108,121,119,97,105,116,105,110,103,119,97,114,102,97,114,101,32,79,116,104,101,\n114,32,114,97,110,107,105,110,103,112,104,114,97,115,101,115,109,101,110,116,105\n,111,110,115,117,114,118,105,118,101,115,99,104,111,108,97,114,60,47,112,62,13,\n10,32,67,111,117,110,116,114,121,105,103,110,111,114,101,100,108,111,115,115,32,\n111,102,106,117,115,116,32,97,115,71,101,111,114,103,105,97,115,116,114,97,110,\n103,101,60,104,101,97,100,62,60,115,116,111,112,112,101,100,49,39,93,41,59,13,10\n,105,115,108,97,110,100,115,110,111,116,97,98,108,101,98,111,114,100,101,114,58,\n108,105,115,116,32,111,102,99,97,114,114,105,101,100,49,48,48,44,48,48,48,60,47,\n104,51,62,10,32,115,101,118,101,114,97,108,98,101,99,111,109,101,115,115,101,108\n,101,99,116,32,119,101,100,100,105,110,103,48,48,46,104,116,109,108,109,111,110,\n97,114,99,104,111,102,102,32,116,104,101,116,101,97,99,104,101,114,104,105,103,\n104,108,121,32,98,105,111,108,111,103,121,108,105,102,101,32,111,102,111,114,32,\n101,118,101,110,114,105,115,101,32,111,102,38,114,97,113,117,111,59,112,108,117,\n115,111,110,101,104,117,110,116,105,110,103,40,116,104,111,117,103,104,68,111,\n117,103,108,97,115,106,111,105,110,105,110,103,99,105,114,99,108,101,115,70,111,\n114,32,116,104,101,65,110,99,105,101,110,116,86,105,101,116,110,97,109,118,101,\n104,105,99,108,101,115,117,99,104,32,97,115,99,114,121,115,116,97,108,118,97,108\n,117,101,32,61,87,105,110,100,111,119,115,101,110,106,111,121,101,100,97,32,115,\n109,97,108,108,97,115,115,117,109,101,100,60,97,32,105,100,61,34,102,111,114,101\n,105,103,110,32,65,108,108,32,114,105,104,111,119,32,116,104,101,68,105,115,112,\n108,97,121,114,101,116,105,114,101,100,104,111,119,101,118,101,114,104,105,100,\n100,101,110,59,98,97,116,116,108,101,115,115,101,101,107,105,110,103,99,97,98,\n105,110,101,116,119,97,115,32,110,111,116,108,111,111,107,32,97,116,99,111,110,\n100,117,99,116,103,101,116,32,116,104,101,74,97,110,117,97,114,121,104,97,112,\n112,101,110,115,116,117,114,110,105,110,103,97,58,104,111,118,101,114,79,110,108\n,105,110,101,32,70,114,101,110,99,104,32,108,97,99,107,105,110,103,116,121,112,\n105,99,97,108,101,120,116,114,97,99,116,101,110,101,109,105,101,115,101,118,101,\n110,32,105,102,103,101,110,101,114,97,116,100,101,99,105,100,101,100,97,114,101,\n32,110,111,116,47,115,101,97,114,99,104,98,101,108,105,101,102,115,45,105,109,97\n,103,101,58,108,111,99,97,116,101,100,115,116,97,116,105,99,46,108,111,103,105,\n110,34,62,99,111,110,118,101,114,116,118,105,111,108,101,110,116,101,110,116,101\n,114,101,100,102,105,114,115,116,34,62,99,105,114,99,117,105,116,70,105,110,108,\n97,110,100,99,104,101,109,105,115,116,115,104,101,32,119,97,115,49,48,112,120,59\n,34,62,97,115,32,115,117,99,104,100,105,118,105,100,101,100,60,47,115,112,97,110\n,62,119,105,108,108,32,98,101,108,105,110,101,32,111,102,97,32,103,114,101,97,\n116,109,121,115,116,101,114,121,47,105,110,100,101,120,46,102,97,108,108,105,110\n,103,100,117,101,32,116,111,32,114,97,105,108,119,97,121,99,111,108,108,101,103,\n101,109,111,110,115,116,101,114,100,101,115,99,101,110,116,105,116,32,119,105,\n116,104,110,117,99,108,101,97,114,74,101,119,105,115,104,32,112,114,111,116,101,\n115,116,66,114,105,116,105,115,104,102,108,111,119,101,114,115,112,114,101,100,\n105,99,116,114,101,102,111,114,109,115,98,117,116,116,111,110,32,119,104,111,32,\n119,97,115,108,101,99,116,117,114,101,105,110,115,116,97,110,116,115,117,105,99,\n105,100,101,103,101,110,101,114,105,99,112,101,114,105,111,100,115,109,97,114,\n107,101,116,115,83,111,99,105,97,108,32,102,105,115,104,105,110,103,99,111,109,\n98,105,110,101,103,114,97,112,104,105,99,119,105,110,110,101,114,115,60,98,114,\n32,47,62,60,98,121,32,116,104,101,32,78,97,116,117,114,97,108,80,114,105,118,97,\n99,121,99,111,111,107,105,101,115,111,117,116,99,111,109,101,114,101,115,111,108\n,118,101,83,119,101,100,105,115,104,98,114,105,101,102,108,121,80,101,114,115,\n105,97,110,115,111,32,109,117,99,104,67,101,110,116,117,114,121,100,101,112,105,\n99,116,115,99,111,108,117,109,110,115,104,111,117,115,105,110,103,115,99,114,105\n,112,116,115,110,101,120,116,32,116,111,98,101,97,114,105,110,103,109,97,112,112\n,105,110,103,114,101,118,105,115,101,100,106,81,117,101,114,121,40,45,119,105,\n100,116,104,58,116,105,116,108,101,34,62,116,111,111,108,116,105,112,83,101,99,\n116,105,111,110,100,101,115,105,103,110,115,84,117,114,107,105,115,104,121,111,\n117,110,103,101,114,46,109,97,116,99,104,40,125,41,40,41,59,10,10,98,117,114,110\n,105,110,103,111,112,101,114,97,116,101,100,101,103,114,101,101,115,115,111,117,\n114,99,101,61,82,105,99,104,97,114,100,99,108,111,115,101,108,121,112,108,97,115\n,116,105,99,101,110,116,114,105,101,115,60,47,116,114,62,13,10,99,111,108,111,\n114,58,35,117,108,32,105,100,61,34,112,111,115,115,101,115,115,114,111,108,108,\n105,110,103,112,104,121,115,105,99,115,102,97,105,108,105,110,103,101,120,101,99\n,117,116,101,99,111,110,116,101,115,116,108,105,110,107,32,116,111,68,101,102,97\n,117,108,116,60,98,114,32,47,62,10,58,32,116,114,117,101,44,99,104,97,114,116,\n101,114,116,111,117,114,105,115,109,99,108,97,115,115,105,99,112,114,111,99,101,\n101,100,101,120,112,108,97,105,110,60,47,104,49,62,13,10,111,110,108,105,110,101\n,46,63,120,109,108,32,118,101,104,101,108,112,105,110,103,100,105,97,109,111,110\n,100,117,115,101,32,116,104,101,97,105,114,108,105,110,101,101,110,100,32,45,45,\n62,41,46,97,116,116,114,40,114,101,97,100,101,114,115,104,111,115,116,105,110,\n103,35,102,102,102,102,102,102,114,101,97,108,105,122,101,86,105,110,99,101,110,\n116,115,105,103,110,97,108,115,32,115,114,99,61,34,47,80,114,111,100,117,99,116,\n100,101,115,112,105,116,101,100,105,118,101,114,115,101,116,101,108,108,105,110,\n103,80,117,98,108,105,99,32,104,101,108,100,32,105,110,74,111,115,101,112,104,32\n,116,104,101,97,116,114,101,97,102,102,101,99,116,115,60,115,116,121,108,101,62,\n97,32,108,97,114,103,101,100,111,101,115,110,39,116,108,97,116,101,114,44,32,69,\n108,101,109,101,110,116,102,97,118,105,99,111,110,99,114,101,97,116,111,114,72,\n117,110,103,97,114,121,65,105,114,112,111,114,116,115,101,101,32,116,104,101,115\n,111,32,116,104,97,116,77,105,99,104,97,101,108,83,121,115,116,101,109,115,80,\n114,111,103,114,97,109,115,44,32,97,110,100,32,32,119,105,100,116,104,61,101,38,\n113,117,111,116,59,116,114,97,100,105,110,103,108,101,102,116,34,62,10,112,101,\n114,115,111,110,115,71,111,108,100,101,110,32,65,102,102,97,105,114,115,103,114,\n97,109,109,97,114,102,111,114,109,105,110,103,100,101,115,116,114,111,121,105,\n100,101,97,32,111,102,99,97,115,101,32,111,102,111,108,100,101,115,116,32,116,\n104,105,115,32,105,115,46,115,114,99,32,61,32,99,97,114,116,111,111,110,114,101,\n103,105,115,116,114,67,111,109,109,111,110,115,77,117,115,108,105,109,115,87,104\n,97,116,32,105,115,105,110,32,109,97,110,121,109,97,114,107,105,110,103,114,101,\n118,101,97,108,115,73,110,100,101,101,100,44,101,113,117,97,108,108,121,47,115,\n104,111,119,95,97,111,117,116,100,111,111,114,101,115,99,97,112,101,40,65,117,\n115,116,114,105,97,103,101,110,101,116,105,99,115,121,115,116,101,109,44,73,110,\n32,116,104,101,32,115,105,116,116,105,110,103,72,101,32,97,108,115,111,73,115,\n108,97,110,100,115,65,99,97,100,101,109,121,10,9,9,60,33,45,45,68,97,110,105,101\n,108,32,98,105,110,100,105,110,103,98,108,111,99,107,34,62,105,109,112,111,115,\n101,100,117,116,105,108,105,122,101,65,98,114,97,104,97,109,40,101,120,99,101,\n112,116,123,119,105,100,116,104,58,112,117,116,116,105,110,103,41,46,104,116,109\n,108,40,124,124,32,91,93,59,10,68,65,84,65,91,32,42,107,105,116,99,104,101,110,\n109,111,117,110,116,101,100,97,99,116,117,97,108,32,100,105,97,108,101,99,116,\n109,97,105,110,108,121,32,95,98,108,97,110,107,39,105,110,115,116,97,108,108,101\n,120,112,101,114,116,115,105,102,40,116,121,112,101,73,116,32,97,108,115,111,38,\n99,111,112,121,59,32,34,62,84,101,114,109,115,98,111,114,110,32,105,110,79,112,\n116,105,111,110,115,101,97,115,116,101,114,110,116,97,108,107,105,110,103,99,111\n,110,99,101,114,110,103,97,105,110,101,100,32,111,110,103,111,105,110,103,106,\n117,115,116,105,102,121,99,114,105,116,105,99,115,102,97,99,116,111,114,121,105,\n116,115,32,111,119,110,97,115,115,97,117,108,116,105,110,118,105,116,101,100,108\n,97,115,116,105,110,103,104,105,115,32,111,119,110,104,114,101,102,61,34,47,34,\n32,114,101,108,61,34,100,101,118,101,108,111,112,99,111,110,99,101,114,116,100,\n105,97,103,114,97,109,100,111,108,108,97,114,115,99,108,117,115,116,101,114,112,\n104,112,63,105,100,61,97,108,99,111,104,111,108,41,59,125,41,40,41,59,117,115,\n105,110,103,32,97,62,60,115,112,97,110,62,118,101,115,115,101,108,115,114,101,\n118,105,118,97,108,65,100,100,114,101,115,115,97,109,97,116,101,117,114,97,110,\n100,114,111,105,100,97,108,108,101,103,101,100,105,108,108,110,101,115,115,119,\n97,108,107,105,110,103,99,101,110,116,101,114,115,113,117,97,108,105,102,121,109\n,97,116,99,104,101,115,117,110,105,102,105,101,100,101,120,116,105,110,99,116,68\n,101,102,101,110,115,101,100,105,101,100,32,105,110,10,9,60,33,45,45,32,99,117,\n115,116,111,109,115,108,105,110,107,105,110,103,76,105,116,116,108,101,32,66,111\n,111,107,32,111,102,101,118,101,110,105,110,103,109,105,110,46,106,115,63,97,114\n,101,32,116,104,101,107,111,110,116,97,107,116,116,111,100,97,121,39,115,46,104,\n116,109,108,34,32,116,97,114,103,101,116,61,119,101,97,114,105,110,103,65,108,\n108,32,82,105,103,59,10,125,41,40,41,59,114,97,105,115,105,110,103,32,65,108,115\n,111,44,32,99,114,117,99,105,97,108,97,98,111,117,116,34,62,100,101,99,108,97,\n114,101,45,45,62,10,60,115,99,102,105,114,101,102,111,120,97,115,32,109,117,99,\n104,97,112,112,108,105,101,115,105,110,100,101,120,44,32,115,44,32,98,117,116,32\n,116,121,112,101,32,61,32,10,13,10,60,33,45,45,116,111,119,97,114,100,115,82,101\n,99,111,114,100,115,80,114,105,118,97,116,101,70,111,114,101,105,103,110,80,114,\n101,109,105,101,114,99,104,111,105,99,101,115,86,105,114,116,117,97,108,114,101,\n116,117,114,110,115,67,111,109,109,101,110,116,80,111,119,101,114,101,100,105,\n110,108,105,110,101,59,112,111,118,101,114,116,121,99,104,97,109,98,101,114,76,\n105,118,105,110,103,32,118,111,108,117,109,101,115,65,110,116,104,111,110,121,\n108,111,103,105,110,34,32,82,101,108,97,116,101,100,69,99,111,110,111,109,121,\n114,101,97,99,104,101,115,99,117,116,116,105,110,103,103,114,97,118,105,116,121,\n108,105,102,101,32,105,110,67,104,97,112,116,101,114,45,115,104,97,100,111,119,\n78,111,116,97,98,108,101,60,47,116,100,62,13,10,32,114,101,116,117,114,110,115,\n116,97,100,105,117,109,119,105,100,103,101,116,115,118,97,114,121,105,110,103,\n116,114,97,118,101,108,115,104,101,108,100,32,98,121,119,104,111,32,97,114,101,\n119,111,114,107,32,105,110,102,97,99,117,108,116,121,97,110,103,117,108,97,114,\n119,104,111,32,104,97,100,97,105,114,112,111,114,116,116,111,119,110,32,111,102,\n10,10,83,111,109,101,32,39,99,108,105,99,107,39,99,104,97,114,103,101,115,107,\n101,121,119,111,114,100,105,116,32,119,105,108,108,99,105,116,121,32,111,102,40,\n116,104,105,115,41,59,65,110,100,114,101,119,32,117,110,105,113,117,101,32,99,\n104,101,99,107,101,100,111,114,32,109,111,114,101,51,48,48,112,120,59,32,114,101\n,116,117,114,110,59,114,115,105,111,110,61,34,112,108,117,103,105,110,115,119,\n105,116,104,105,110,32,104,101,114,115,101,108,102,83,116,97,116,105,111,110,70,\n101,100,101,114,97,108,118,101,110,116,117,114,101,112,117,98,108,105,115,104,\n115,101,110,116,32,116,111,116,101,110,115,105,111,110,97,99,116,114,101,115,115\n,99,111,109,101,32,116,111,102,105,110,103,101,114,115,68,117,107,101,32,111,102\n,112,101,111,112,108,101,44,101,120,112,108,111,105,116,119,104,97,116,32,105,\n115,104,97,114,109,111,110,121,97,32,109,97,106,111,114,34,58,34,104,116,116,112\n,105,110,32,104,105,115,32,109,101,110,117,34,62,10,109,111,110,116,104,108,121,\n111,102,102,105,99,101,114,99,111,117,110,99,105,108,103,97,105,110,105,110,103,\n101,118,101,110,32,105,110,83,117,109,109,97,114,121,100,97,116,101,32,111,102,\n108,111,121,97,108,116,121,102,105,116,110,101,115,115,97,110,100,32,119,97,115,\n101,109,112,101,114,111,114,115,117,112,114,101,109,101,83,101,99,111,110,100,32\n,104,101,97,114,105,110,103,82,117,115,115,105,97,110,108,111,110,103,101,115,\n116,65,108,98,101,114,116,97,108,97,116,101,114,97,108,115,101,116,32,111,102,32\n,115,109,97,108,108,34,62,46,97,112,112,101,110,100,100,111,32,119,105,116,104,\n102,101,100,101,114,97,108,98,97,110,107,32,111,102,98,101,110,101,97,116,104,68\n,101,115,112,105,116,101,67,97,112,105,116,97,108,103,114,111,117,110,100,115,41\n,44,32,97,110,100,32,112,101,114,99,101,110,116,105,116,32,102,114,111,109,99,\n108,111,115,105,110,103,99,111,110,116,97,105,110,73,110,115,116,101,97,100,102,\n105,102,116,101,101,110,97,115,32,119,101,108,108,46,121,97,104,111,111,46,114,\n101,115,112,111,110,100,102,105,103,104,116,101,114,111,98,115,99,117,114,101,\n114,101,102,108,101,99,116,111,114,103,97,110,105,99,61,32,77,97,116,104,46,101,\n100,105,116,105,110,103,111,110,108,105,110,101,32,112,97,100,100,105,110,103,97\n,32,119,104,111,108,101,111,110,101,114,114,111,114,121,101,97,114,32,111,102,\n101,110,100,32,111,102,32,98,97,114,114,105,101,114,119,104,101,110,32,105,116,\n104,101,97,100,101,114,32,104,111,109,101,32,111,102,114,101,115,117,109,101,100\n,114,101,110,97,109,101,100,115,116,114,111,110,103,62,104,101,97,116,105,110,\n103,114,101,116,97,105,110,115,99,108,111,117,100,102,114,119,97,121,32,111,102,\n32,77,97,114,99,104,32,49,107,110,111,119,105,110,103,105,110,32,112,97,114,116,\n66,101,116,119,101,101,110,108,101,115,115,111,110,115,99,108,111,115,101,115,\n116,118,105,114,116,117,97,108,108,105,110,107,115,34,62,99,114,111,115,115,101,\n100,69,78,68,32,45,45,62,102,97,109,111,117,115,32,97,119,97,114,100,101,100,76,\n105,99,101,110,115,101,72,101,97,108,116,104,32,102,97,105,114,108,121,32,119,\n101,97,108,116,104,121,109,105,110,105,109,97,108,65,102,114,105,99,97,110,99,\n111,109,112,101,116,101,108,97,98,101,108,34,62,115,105,110,103,105,110,103,102,\n97,114,109,101,114,115,66,114,97,115,105,108,41,100,105,115,99,117,115,115,114,\n101,112,108,97,99,101,71,114,101,103,111,114,121,102,111,110,116,32,99,111,112,\n117,114,115,117,101,100,97,112,112,101,97,114,115,109,97,107,101,32,117,112,114,\n111,117,110,100,101,100,98,111,116,104,32,111,102,98,108,111,99,107,101,100,115,\n97,119,32,116,104,101,111,102,102,105,99,101,115,99,111,108,111,117,114,115,105,\n102,40,100,111,99,117,119,104,101,110,32,104,101,101,110,102,111,114,99,101,112,\n117,115,104,40,102,117,65,117,103,117,115,116,32,85,84,70,45,56,34,62,70,97,110,\n116,97,115,121,105,110,32,109,111,115,116,105,110,106,117,114,101,100,85,115,117\n,97,108,108,121,102,97,114,109,105,110,103,99,108,111,115,117,114,101,111,98,106\n,101,99,116,32,100,101,102,101,110,99,101,117,115,101,32,111,102,32,77,101,100,\n105,99,97,108,60,98,111,100,121,62,10,101,118,105,100,101,110,116,98,101,32,117,\n115,101,100,107,101,121,67,111,100,101,115,105,120,116,101,101,110,73,115,108,97\n,109,105,99,35,48,48,48,48,48,48,101,110,116,105,114,101,32,119,105,100,101,108,\n121,32,97,99,116,105,118,101,32,40,116,121,112,101,111,102,111,110,101,32,99,97,\n110,99,111,108,111,114,32,61,115,112,101,97,107,101,114,101,120,116,101,110,100,\n115,80,104,121,115,105,99,115,116,101,114,114,97,105,110,60,116,98,111,100,121,\n62,102,117,110,101,114,97,108,118,105,101,119,105,110,103,109,105,100,100,108,\n101,32,99,114,105,99,107,101,116,112,114,111,112,104,101,116,115,104,105,102,116\n,101,100,100,111,99,116,111,114,115,82,117,115,115,101,108,108,32,116,97,114,103\n,101,116,99,111,109,112,97,99,116,97,108,103,101,98,114,97,115,111,99,105,97,108\n,45,98,117,108,107,32,111,102,109,97,110,32,97,110,100,60,47,116,100,62,10,32,\n104,101,32,108,101,102,116,41,46,118,97,108,40,41,102,97,108,115,101,41,59,108,\n111,103,105,99,97,108,98,97,110,107,105,110,103,104,111,109,101,32,116,111,110,\n97,109,105,110,103,32,65,114,105,122,111,110,97,99,114,101,100,105,116,115,41,59\n,10,125,41,59,10,102,111,117,110,100,101,114,105,110,32,116,117,114,110,67,111,\n108,108,105,110,115,98,101,102,111,114,101,32,66,117,116,32,116,104,101,99,104,\n97,114,103,101,100,84,105,116,108,101,34,62,67,97,112,116,97,105,110,115,112,101\n,108,108,101,100,103,111,100,100,101,115,115,84,97,103,32,45,45,62,65,100,100,\n105,110,103,58,98,117,116,32,119,97,115,82,101,99,101,110,116,32,112,97,116,105,\n101,110,116,98,97,99,107,32,105,110,61,102,97,108,115,101,38,76,105,110,99,111,\n108,110,119,101,32,107,110,111,119,67,111,117,110,116,101,114,74,117,100,97,105,\n115,109,115,99,114,105,112,116,32,97,108,116,101,114,101,100,39,93,41,59,10,32,\n32,104,97,115,32,116,104,101,117,110,99,108,101,97,114,69,118,101,110,116,39,44,\n98,111,116,104,32,105,110,110,111,116,32,97,108,108,10,10,60,33,45,45,32,112,108\n,97,99,105,110,103,104,97,114,100,32,116,111,32,99,101,110,116,101,114,115,111,\n114,116,32,111,102,99,108,105,101,110,116,115,115,116,114,101,101,116,115,66,101\n,114,110,97,114,100,97,115,115,101,114,116,115,116,101,110,100,32,116,111,102,97\n,110,116,97,115,121,100,111,119,110,32,105,110,104,97,114,98,111,117,114,70,114,\n101,101,100,111,109,106,101,119,101,108,114,121,47,97,98,111,117,116,46,46,115,\n101,97,114,99,104,108,101,103,101,110,100,115,105,115,32,109,97,100,101,109,111,\n100,101,114,110,32,111,110,108,121,32,111,110,111,110,108,121,32,116,111,105,109\n,97,103,101,34,32,108,105,110,101,97,114,32,112,97,105,110,116,101,114,97,110,\n100,32,110,111,116,114,97,114,101,108,121,32,97,99,114,111,110,121,109,100,101,\n108,105,118,101,114,115,104,111,114,116,101,114,48,48,38,97,109,112,59,97,115,32\n,109,97,110,121,119,105,100,116,104,61,34,47,42,32,60,33,91,67,116,105,116,108,\n101,32,61,111,102,32,116,104,101,32,108,111,119,101,115,116,32,112,105,99,107,\n101,100,32,101,115,99,97,112,101,100,117,115,101,115,32,111,102,112,101,111,112,\n108,101,115,32,80,117,98,108,105,99,77,97,116,116,104,101,119,116,97,99,116,105,\n99,115,100,97,109,97,103,101,100,119,97,121,32,102,111,114,108,97,119,115,32,111\n,102,101,97,115,121,32,116,111,32,119,105,110,100,111,119,115,116,114,111,110,\n103,32,32,115,105,109,112,108,101,125,99,97,116,99,104,40,115,101,118,101,110,\n116,104,105,110,102,111,98,111,120,119,101,110,116,32,116,111,112,97,105,110,116\n,101,100,99,105,116,105,122,101,110,73,32,100,111,110,39,116,114,101,116,114,101\n,97,116,46,32,83,111,109,101,32,119,119,46,34,41,59,10,98,111,109,98,105,110,103\n,109,97,105,108,116,111,58,109,97,100,101,32,105,110,46,32,77,97,110,121,32,99,\n97,114,114,105,101,115,124,124,123,125,59,119,105,119,111,114,107,32,111,102,115\n,121,110,111,110,121,109,100,101,102,101,97,116,115,102,97,118,111,114,101,100,\n111,112,116,105,99,97,108,112,97,103,101,84,114,97,117,110,108,101,115,115,32,\n115,101,110,100,105,110,103,108,101,102,116,34,62,60,99,111,109,83,99,111,114,65\n,108,108,32,116,104,101,106,81,117,101,114,121,46,116,111,117,114,105,115,116,67\n,108,97,115,115,105,99,102,97,108,115,101,34,32,87,105,108,104,101,108,109,115,\n117,98,117,114,98,115,103,101,110,117,105,110,101,98,105,115,104,111,112,115,46,\n115,112,108,105,116,40,103,108,111,98,97,108,32,102,111,108,108,111,119,115,98,\n111,100,121,32,111,102,110,111,109,105,110,97,108,67,111,110,116,97,99,116,115,\n101,99,117,108,97,114,108,101,102,116,32,116,111,99,104,105,101,102,108,121,45,\n104,105,100,100,101,110,45,98,97,110,110,101,114,60,47,108,105,62,10,10,46,32,87\n,104,101,110,32,105,110,32,98,111,116,104,100,105,115,109,105,115,115,69,120,112\n,108,111,114,101,97,108,119,97,121,115,32,118,105,97,32,116,104,101,115,112,97,\n195,177,111,108,119,101,108,102,97,114,101,114,117,108,105,110,103,32,97,114,114\n,97,110,103,101,99,97,112,116,97,105,110,104,105,115,32,115,111,110,114,117,108,\n101,32,111,102,104,101,32,116,111,111,107,105,116,115,101,108,102,44,61,48,38,97\n,109,112,59,40,99,97,108,108,101,100,115,97,109,112,108,101,115,116,111,32,109,\n97,107,101,99,111,109,47,112,97,103,77,97,114,116,105,110,32,75,101,110,110,101,\n100,121,97,99,99,101,112,116,115,102,117,108,108,32,111,102,104,97,110,100,108,\n101,100,66,101,115,105,100,101,115,47,47,45,45,62,60,47,97,98,108,101,32,116,111\n,116,97,114,103,101,116,115,101,115,115,101,110,99,101,104,105,109,32,116,111,32\n,105,116,115,32,98,121,32,99,111,109,109,111,110,46,109,105,110,101,114,97,108,\n116,111,32,116,97,107,101,119,97,121,115,32,116,111,115,46,111,114,103,47,108,97\n,100,118,105,115,101,100,112,101,110,97,108,116,121,115,105,109,112,108,101,58,\n105,102,32,116,104,101,121,76,101,116,116,101,114,115,97,32,115,104,111,114,116,\n72,101,114,98,101,114,116,115,116,114,105,107,101,115,32,103,114,111,117,112,115\n,46,108,101,110,103,116,104,102,108,105,103,104,116,115,111,118,101,114,108,97,\n112,115,108,111,119,108,121,32,108,101,115,115,101,114,32,115,111,99,105,97,108,\n32,60,47,112,62,10,9,9,105,116,32,105,110,116,111,114,97,110,107,101,100,32,114,\n97,116,101,32,111,102,117,108,62,13,10,32,32,97,116,116,101,109,112,116,112,97,\n105,114,32,111,102,109,97,107,101,32,105,116,75,111,110,116,97,107,116,65,110,\n116,111,110,105,111,104,97,118,105,110,103,32,114,97,116,105,110,103,115,32,97,\n99,116,105,118,101,115,116,114,101,97,109,115,116,114,97,112,112,101,100,34,41,\n46,99,115,115,40,104,111,115,116,105,108,101,108,101,97,100,32,116,111,108,105,\n116,116,108,101,32,103,114,111,117,112,115,44,80,105,99,116,117,114,101,45,45,62\n,13,10,13,10,32,114,111,119,115,61,34,32,111,98,106,101,99,116,105,110,118,101,\n114,115,101,60,102,111,111,116,101,114,67,117,115,116,111,109,86,62,60,92,47,115\n,99,114,115,111,108,118,105,110,103,67,104,97,109,98,101,114,115,108,97,118,101,\n114,121,119,111,117,110,100,101,100,119,104,101,114,101,97,115,33,61,32,39,117,\n110,100,102,111,114,32,97,108,108,112,97,114,116,108,121,32,45,114,105,103,104,\n116,58,65,114,97,98,105,97,110,98,97,99,107,101,100,32,99,101,110,116,117,114,\n121,117,110,105,116,32,111,102,109,111,98,105,108,101,45,69,117,114,111,112,101,\n44,105,115,32,104,111,109,101,114,105,115,107,32,111,102,100,101,115,105,114,101\n,100,67,108,105,110,116,111,110,99,111,115,116,32,111,102,97,103,101,32,111,102,\n32,98,101,99,111,109,101,32,110,111,110,101,32,111,102,112,38,113,117,111,116,59\n,77,105,100,100,108,101,32,101,97,100,39,41,91,48,67,114,105,116,105,99,115,115,\n116,117,100,105,111,115,62,38,99,111,112,121,59,103,114,111,117,112,34,62,97,115\n,115,101,109,98,108,109,97,107,105,110,103,32,112,114,101,115,115,101,100,119,\n105,100,103,101,116,46,112,115,58,34,32,63,32,114,101,98,117,105,108,116,98,121,\n32,115,111,109,101,70,111,114,109,101,114,32,101,100,105,116,111,114,115,100,101\n,108,97,121,101,100,67,97,110,111,110,105,99,104,97,100,32,116,104,101,112,117,\n115,104,105,110,103,99,108,97,115,115,61,34,98,117,116,32,97,114,101,112,97,114,\n116,105,97,108,66,97,98,121,108,111,110,98,111,116,116,111,109,32,99,97,114,114,\n105,101,114,67,111,109,109,97,110,100,105,116,115,32,117,115,101,65,115,32,119,\n105,116,104,99,111,117,114,115,101,115,97,32,116,104,105,114,100,100,101,110,111\n,116,101,115,97,108,115,111,32,105,110,72,111,117,115,116,111,110,50,48,112,120,\n59,34,62,97,99,99,117,115,101,100,100,111,117,98,108,101,32,103,111,97,108,32,\n111,102,70,97,109,111,117,115,32,41,46,98,105,110,100,40,112,114,105,101,115,116\n,115,32,79,110,108,105,110,101,105,110,32,74,117,108,121,115,116,32,43,32,34,103\n,99,111,110,115,117,108,116,100,101,99,105,109,97,108,104,101,108,112,102,117,\n108,114,101,118,105,118,101,100,105,115,32,118,101,114,121,114,39,43,39,105,112,\n116,108,111,115,105,110,103,32,102,101,109,97,108,101,115,105,115,32,97,108,115,\n111,115,116,114,105,110,103,115,100,97,121,115,32,111,102,97,114,114,105,118,97,\n108,102,117,116,117,114,101,32,60,111,98,106,101,99,116,102,111,114,99,105,110,\n103,83,116,114,105,110,103,40,34,32,47,62,10,9,9,104,101,114,101,32,105,115,101,\n110,99,111,100,101,100,46,32,32,84,104,101,32,98,97,108,108,111,111,110,100,111,\n110,101,32,98,121,47,99,111,109,109,111,110,98,103,99,111,108,111,114,108,97,119\n,32,111,102,32,73,110,100,105,97,110,97,97,118,111,105,100,101,100,98,117,116,32\n,116,104,101,50,112,120,32,51,112,120,106,113,117,101,114,121,46,97,102,116,101,\n114,32,97,112,111,108,105,99,121,46,109,101,110,32,97,110,100,102,111,111,116,\n101,114,45,61,32,116,114,117,101,59,102,111,114,32,117,115,101,115,99,114,101,\n101,110,46,73,110,100,105,97,110,32,105,109,97,103,101,32,61,102,97,109,105,108,\n121,44,104,116,116,112,58,47,47,32,38,110,98,115,112,59,100,114,105,118,101,114,\n115,101,116,101,114,110,97,108,115,97,109,101,32,97,115,110,111,116,105,99,101,\n100,118,105,101,119,101,114,115,125,41,40,41,59,10,32,105,115,32,109,111,114,101\n,115,101,97,115,111,110,115,102,111,114,109,101,114,32,116,104,101,32,110,101,\n119,105,115,32,106,117,115,116,99,111,110,115,101,110,116,32,83,101,97,114,99,\n104,119,97,115,32,116,104,101,119,104,121,32,116,104,101,115,104,105,112,112,101\n,100,98,114,62,60,98,114,62,119,105,100,116,104,58,32,104,101,105,103,104,116,61\n,109,97,100,101,32,111,102,99,117,105,115,105,110,101,105,115,32,116,104,97,116,\n97,32,118,101,114,121,32,65,100,109,105,114,97,108,32,102,105,120,101,100,59,110\n,111,114,109,97,108,32,77,105,115,115,105,111,110,80,114,101,115,115,44,32,111,\n110,116,97,114,105,111,99,104,97,114,115,101,116,116,114,121,32,116,111,32,105,\n110,118,97,100,101,100,61,34,116,114,117,101,34,115,112,97,99,105,110,103,105,\n115,32,109,111,115,116,97,32,109,111,114,101,32,116,111,116,97,108,108,121,102,\n97,108,108,32,111,102,125,41,59,13,10,32,32,105,109,109,101,110,115,101,116,105,\n109,101,32,105,110,115,101,116,32,111,117,116,115,97,116,105,115,102,121,116,111\n,32,102,105,110,100,100,111,119,110,32,116,111,108,111,116,32,111,102,32,80,108,\n97,121,101,114,115,105,110,32,74,117,110,101,113,117,97,110,116,117,109,110,111,\n116,32,116,104,101,116,105,109,101,32,116,111,100,105,115,116,97,110,116,70,105,\n110,110,105,115,104,115,114,99,32,61,32,40,115,105,110,103,108,101,32,104,101,\n108,112,32,111,102,71,101,114,109,97,110,32,108,97,119,32,97,110,100,108,97,98,\n101,108,101,100,102,111,114,101,115,116,115,99,111,111,107,105,110,103,115,112,\n97,99,101,34,62,104,101,97,100,101,114,45,119,101,108,108,32,97,115,83,116,97,\n110,108,101,121,98,114,105,100,103,101,115,47,103,108,111,98,97,108,67,114,111,\n97,116,105,97,32,65,98,111,117,116,32,91,48,93,59,10,32,32,105,116,44,32,97,110,\n100,103,114,111,117,112,101,100,98,101,105,110,103,32,97,41,123,116,104,114,111,\n119,104,101,32,109,97,100,101,108,105,103,104,116,101,114,101,116,104,105,99,97,\n108,70,70,70,70,70,70,34,98,111,116,116,111,109,34,108,105,107,101,32,97,32,101,\n109,112,108,111,121,115,108,105,118,101,32,105,110,97,115,32,115,101,101,110,112\n,114,105,110,116,101,114,109,111,115,116,32,111,102,117,98,45,108,105,110,107,\n114,101,106,101,99,116,115,97,110,100,32,117,115,101,105,109,97,103,101,34,62,\n115,117,99,99,101,101,100,102,101,101,100,105,110,103,78,117,99,108,101,97,114,\n105,110,102,111,114,109,97,116,111,32,104,101,108,112,87,111,109,101,110,39,115,\n78,101,105,116,104,101,114,77,101,120,105,99,97,110,112,114,111,116,101,105,110,\n60,116,97,98,108,101,32,98,121,32,109,97,110,121,104,101,97,108,116,104,121,108,\n97,119,115,117,105,116,100,101,118,105,115,101,100,46,112,117,115,104,40,123,115\n,101,108,108,101,114,115,115,105,109,112,108,121,32,84,104,114,111,117,103,104,\n46,99,111,111,107,105,101,32,73,109,97,103,101,40,111,108,100,101,114,34,62,117,\n115,46,106,115,34,62,32,83,105,110,99,101,32,117,110,105,118,101,114,115,108,97,\n114,103,101,114,32,111,112,101,110,32,116,111,33,45,45,32,101,110,100,108,105,\n101,115,32,105,110,39,93,41,59,13,10,32,32,109,97,114,107,101,116,119,104,111,32\n,105,115,32,40,34,68,79,77,67,111,109,97,110,97,103,101,100,111,110,101,32,102,\n111,114,116,121,112,101,111,102,32,75,105,110,103,100,111,109,112,114,111,102,\n105,116,115,112,114,111,112,111,115,101,116,111,32,115,104,111,119,99,101,110,\n116,101,114,59,109,97,100,101,32,105,116,100,114,101,115,115,101,100,119,101,114\n,101,32,105,110,109,105,120,116,117,114,101,112,114,101,99,105,115,101,97,114,\n105,115,105,110,103,115,114,99,32,61,32,39,109,97,107,101,32,97,32,115,101,99,\n117,114,101,100,66,97,112,116,105,115,116,118,111,116,105,110,103,32,10,9,9,118,\n97,114,32,77,97,114,99,104,32,50,103,114,101,119,32,117,112,67,108,105,109,97,\n116,101,46,114,101,109,111,118,101,115,107,105,108,108,101,100,119,97,121,32,116\n,104,101,60,47,104,101,97,100,62,102,97,99,101,32,111,102,97,99,116,105,110,103,\n32,114,105,103,104,116,34,62,116,111,32,119,111,114,107,114,101,100,117,99,101,\n115,104,97,115,32,104,97,100,101,114,101,99,116,101,100,115,104,111,119,40,41,59\n,97,99,116,105,111,110,61,98,111,111,107,32,111,102,97,110,32,97,114,101,97,61,\n61,32,34,104,116,116,60,104,101,97,100,101,114,10,60,104,116,109,108,62,99,111,\n110,102,111,114,109,102,97,99,105,110,103,32,99,111,111,107,105,101,46,114,101,\n108,121,32,111,110,104,111,115,116,101,100,32,46,99,117,115,116,111,109,104,101,\n32,119,101,110,116,98,117,116,32,102,111,114,115,112,114,101,97,100,32,70,97,109\n,105,108,121,32,97,32,109,101,97,110,115,111,117,116,32,116,104,101,102,111,114,\n117,109,115,46,102,111,111,116,97,103,101,34,62,77,111,98,105,108,67,108,101,109\n,101,110,116,115,34,32,105,100,61,34,97,115,32,104,105,103,104,105,110,116,101,\n110,115,101,45,45,62,60,33,45,45,102,101,109,97,108,101,32,105,115,32,115,101,\n101,110,105,109,112,108,105,101,100,115,101,116,32,116,104,101,97,32,115,116,97,\n116,101,97,110,100,32,104,105,115,102,97,115,116,101,115,116,98,101,115,105,100,\n101,115,98,117,116,116,111,110,95,98,111,117,110,100,101,100,34,62,60,105,109,\n103,32,73,110,102,111,98,111,120,101,118,101,110,116,115,44,97,32,121,111,117,\n110,103,97,110,100,32,97,114,101,78,97,116,105,118,101,32,99,104,101,97,112,101,\n114,84,105,109,101,111,117,116,97,110,100,32,104,97,115,101,110,103,105,110,101,\n115,119,111,110,32,116,104,101,40,109,111,115,116,108,121,114,105,103,104,116,58\n,32,102,105,110,100,32,97,32,45,98,111,116,116,111,109,80,114,105,110,99,101,32,\n97,114,101,97,32,111,102,109,111,114,101,32,111,102,115,101,97,114,99,104,95,110\n,97,116,117,114,101,44,108,101,103,97,108,108,121,112,101,114,105,111,100,44,108\n,97,110,100,32,111,102,111,114,32,119,105,116,104,105,110,100,117,99,101,100,112\n,114,111,118,105,110,103,109,105,115,115,105,108,101,108,111,99,97,108,108,121,\n65,103,97,105,110,115,116,116,104,101,32,119,97,121,107,38,113,117,111,116,59,\n112,120,59,34,62,13,10,112,117,115,104,101,100,32,97,98,97,110,100,111,110,110,\n117,109,101,114,97,108,67,101,114,116,97,105,110,73,110,32,116,104,105,115,109,\n111,114,101,32,105,110,111,114,32,115,111,109,101,110,97,109,101,32,105,115,97,\n110,100,44,32,105,110,99,114,111,119,110,101,100,73,83,66,78,32,48,45,99,114,101\n,97,116,101,115,79,99,116,111,98,101,114,109,97,121,32,110,111,116,99,101,110,\n116,101,114,32,108,97,116,101,32,105,110,68,101,102,101,110,99,101,101,110,97,99\n,116,101,100,119,105,115,104,32,116,111,98,114,111,97,100,108,121,99,111,111,108\n,105,110,103,111,110,108,111,97,100,61,105,116,46,32,84,104,101,114,101,99,111,\n118,101,114,77,101,109,98,101,114,115,104,101,105,103,104,116,32,97,115,115,117,\n109,101,115,60,104,116,109,108,62,10,112,101,111,112,108,101,46,105,110,32,111,\n110,101,32,61,119,105,110,100,111,119,102,111,111,116,101,114,95,97,32,103,111,\n111,100,32,114,101,107,108,97,109,97,111,116,104,101,114,115,44,116,111,32,116,\n104,105,115,95,99,111,111,107,105,101,112,97,110,101,108,34,62,76,111,110,100,\n111,110,44,100,101,102,105,110,101,115,99,114,117,115,104,101,100,98,97,112,116,\n105,115,109,99,111,97,115,116,97,108,115,116,97,116,117,115,32,116,105,116,108,\n101,34,32,109,111,118,101,32,116,111,108,111,115,116,32,105,110,98,101,116,116,\n101,114,32,105,109,112,108,105,101,115,114,105,118,97,108,114,121,115,101,114,\n118,101,114,115,32,83,121,115,116,101,109,80,101,114,104,97,112,115,101,115,32,\n97,110,100,32,99,111,110,116,101,110,100,102,108,111,119,105,110,103,108,97,115,\n116,101,100,32,114,105,115,101,32,105,110,71,101,110,101,115,105,115,118,105,101\n,119,32,111,102,114,105,115,105,110,103,32,115,101,101,109,32,116,111,98,117,116\n,32,105,110,32,98,97,99,107,105,110,103,104,101,32,119,105,108,108,103,105,118,\n101,110,32,97,103,105,118,105,110,103,32,99,105,116,105,101,115,46,102,108,111,\n119,32,111,102,32,76,97,116,101,114,32,97,108,108,32,98,117,116,72,105,103,104,\n119,97,121,111,110,108,121,32,98,121,115,105,103,110,32,111,102,104,101,32,100,\n111,101,115,100,105,102,102,101,114,115,98,97,116,116,101,114,121,38,97,109,112,\n59,108,97,115,105,110,103,108,101,115,116,104,114,101,97,116,115,105,110,116,101\n,103,101,114,116,97,107,101,32,111,110,114,101,102,117,115,101,100,99,97,108,108\n,101,100,32,61,85,83,38,97,109,112,83,101,101,32,116,104,101,110,97,116,105,118,\n101,115,98,121,32,116,104,105,115,115,121,115,116,101,109,46,104,101,97,100,32,\n111,102,58,104,111,118,101,114,44,108,101,115,98,105,97,110,115,117,114,110,97,\n109,101,97,110,100,32,97,108,108,99,111,109,109,111,110,47,104,101,97,100,101,\n114,95,95,112,97,114,97,109,115,72,97,114,118,97,114,100,47,112,105,120,101,108,\n46,114,101,109,111,118,97,108,115,111,32,108,111,110,103,114,111,108,101,32,111,\n102,106,111,105,110,116,108,121,115,107,121,115,99,114,97,85,110,105,99,111,100,\n101,98,114,32,47,62,13,10,65,116,108,97,110,116,97,110,117,99,108,101,117,115,67\n,111,117,110,116,121,44,112,117,114,101,108,121,32,99,111,117,110,116,34,62,101,\n97,115,105,108,121,32,98,117,105,108,100,32,97,111,110,99,108,105,99,107,97,32,\n103,105,118,101,110,112,111,105,110,116,101,114,104,38,113,117,111,116,59,101,\n118,101,110,116,115,32,101,108,115,101,32,123,10,100,105,116,105,111,110,115,110\n,111,119,32,116,104,101,44,32,119,105,116,104,32,109,97,110,32,119,104,111,111,\n114,103,47,87,101,98,111,110,101,32,97,110,100,99,97,118,97,108,114,121,72,101,\n32,100,105,101,100,115,101,97,116,116,108,101,48,48,44,48,48,48,32,123,119,105,\n110,100,111,119,104,97,118,101,32,116,111,105,102,40,119,105,110,100,97,110,100,\n32,105,116,115,115,111,108,101,108,121,32,109,38,113,117,111,116,59,114,101,110,\n101,119,101,100,68,101,116,114,111,105,116,97,109,111,110,103,115,116,101,105,\n116,104,101,114,32,116,104,101,109,32,105,110,83,101,110,97,116,111,114,85,115,\n60,47,97,62,60,75,105,110,103,32,111,102,70,114,97,110,99,105,115,45,112,114,111\n,100,117,99,104,101,32,117,115,101,100,97,114,116,32,97,110,100,104,105,109,32,\n97,110,100,117,115,101,100,32,98,121,115,99,111,114,105,110,103,97,116,32,104,\n111,109,101,116,111,32,104,97,118,101,114,101,108,97,116,101,115,105,98,105,108,\n105,116,121,102,97,99,116,105,111,110,66,117,102,102,97,108,111,108,105,110,107,\n34,62,60,119,104,97,116,32,104,101,102,114,101,101,32,116,111,67,105,116,121,32,\n111,102,99,111,109,101,32,105,110,115,101,99,116,111,114,115,99,111,117,110,116,\n101,100,111,110,101,32,100,97,121,110,101,114,118,111,117,115,115,113,117,97,114\n,101,32,125,59,105,102,40,103,111,105,110,32,119,104,97,116,105,109,103,34,32,97\n,108,105,115,32,111,110,108,121,115,101,97,114,99,104,47,116,117,101,115,100,97,\n121,108,111,111,115,101,108,121,83,111,108,111,109,111,110,115,101,120,117,97,\n108,32,45,32,60,97,32,104,114,109,101,100,105,117,109,34,68,79,32,78,79,84,32,70\n,114,97,110,99,101,44,119,105,116,104,32,97,32,119,97,114,32,97,110,100,115,101,\n99,111,110,100,32,116,97,107,101,32,97,32,62,13,10,13,10,13,10,109,97,114,107,\n101,116,46,104,105,103,104,119,97,121,100,111,110,101,32,105,110,99,116,105,118,\n105,116,121,34,108,97,115,116,34,62,111,98,108,105,103,101,100,114,105,115,101,\n32,116,111,34,117,110,100,101,102,105,109,97,100,101,32,116,111,32,69,97,114,108\n,121,32,112,114,97,105,115,101,100,105,110,32,105,116,115,32,102,111,114,32,104,\n105,115,97,116,104,108,101,116,101,74,117,112,105,116,101,114,89,97,104,111,111,\n33,32,116,101,114,109,101,100,32,115,111,32,109,97,110,121,114,101,97,108,108,\n121,32,115,46,32,84,104,101,32,97,32,119,111,109,97,110,63,118,97,108,117,101,61\n,100,105,114,101,99,116,32,114,105,103,104,116,34,32,98,105,99,121,99,108,101,97\n,99,105,110,103,61,34,100,97,121,32,97,110,100,115,116,97,116,105,110,103,82,97,\n116,104,101,114,44,104,105,103,104,101,114,32,79,102,102,105,99,101,32,97,114,\n101,32,110,111,119,116,105,109,101,115,44,32,119,104,101,110,32,97,32,112,97,121\n,32,102,111,114,111,110,32,116,104,105,115,45,108,105,110,107,34,62,59,98,111,\n114,100,101,114,97,114,111,117,110,100,32,97,110,110,117,97,108,32,116,104,101,\n32,78,101,119,112,117,116,32,116,104,101,46,99,111,109,34,32,116,97,107,105,110,\n32,116,111,97,32,98,114,105,101,102,40,105,110,32,116,104,101,103,114,111,117,\n112,115,46,59,32,119,105,100,116,104,101,110,122,121,109,101,115,115,105,109,112\n,108,101,32,105,110,32,108,97,116,101,123,114,101,116,117,114,110,116,104,101,\n114,97,112,121,97,32,112,111,105,110,116,98,97,110,110,105,110,103,105,110,107,\n115,34,62,10,40,41,59,34,32,114,101,97,32,112,108,97,99,101,92,117,48,48,51,67,\n97,97,98,111,117,116,32,97,116,114,62,13,10,9,9,99,99,111,117,110,116,32,103,105\n,118,101,115,32,97,60,83,67,82,73,80,84,82,97,105,108,119,97,121,116,104,101,109\n,101,115,47,116,111,111,108,98,111,120,66,121,73,100,40,34,120,104,117,109,97,\n110,115,44,119,97,116,99,104,101,115,105,110,32,115,111,109,101,32,105,102,32,40\n,119,105,99,111,109,105,110,103,32,102,111,114,109,97,116,115,32,85,110,100,101,\n114,32,98,117,116,32,104,97,115,104,97,110,100,101,100,32,109,97,100,101,32,98,\n121,116,104,97,110,32,105,110,102,101,97,114,32,111,102,100,101,110,111,116,101,\n100,47,105,102,114,97,109,101,108,101,102,116,32,105,110,118,111,108,116,97,103,\n101,105,110,32,101,97,99,104,97,38,113,117,111,116,59,98,97,115,101,32,111,102,\n73,110,32,109,97,110,121,117,110,100,101,114,103,111,114,101,103,105,109,101,115\n,97,99,116,105,111,110,32,60,47,112,62,13,10,60,117,115,116,111,109,86,97,59,38,\n103,116,59,60,47,105,109,112,111,114,116,115,111,114,32,116,104,97,116,109,111,\n115,116,108,121,32,38,97,109,112,59,114,101,32,115,105,122,101,61,34,60,47,97,62\n,60,47,104,97,32,99,108,97,115,115,112,97,115,115,105,118,101,72,111,115,116,32,\n61,32,87,104,101,116,104,101,114,102,101,114,116,105,108,101,86,97,114,105,111,\n117,115,61,91,93,59,40,102,117,99,97,109,101,114,97,115,47,62,60,47,116,100,62,\n97,99,116,115,32,97,115,73,110,32,115,111,109,101,62,13,10,13,10,60,33,111,114,\n103,97,110,105,115,32,60,98,114,32,47,62,66,101,105,106,105,110,103,99,97,116,97\n,108,195,160,100,101,117,116,115,99,104,101,117,114,111,112,101,117,101,117,115,\n107,97,114,97,103,97,101,105,108,103,101,115,118,101,110,115,107,97,101,115,112,\n97,195,177,97,109,101,110,115,97,106,101,117,115,117,97,114,105,111,116,114,97,\n98,97,106,111,109,195,169,120,105,99,111,112,195,161,103,105,110,97,115,105,101,\n109,112,114,101,115,105,115,116,101,109,97,111,99,116,117,98,114,101,100,117,114\n,97,110,116,101,97,195,177,97,100,105,114,101,109,112,114,101,115,97,109,111,109\n,101,110,116,111,110,117,101,115,116,114,111,112,114,105,109,101,114,97,116,114,\n97,118,195,169,115,103,114,97,99,105,97,115,110,117,101,115,116,114,97,112,114,\n111,99,101,115,111,101,115,116,97,100,111,115,99,97,108,105,100,97,100,112,101,\n114,115,111,110,97,110,195,186,109,101,114,111,97,99,117,101,114,100,111,109,195\n,186,115,105,99,97,109,105,101,109,98,114,111,111,102,101,114,116,97,115,97,108,\n103,117,110,111,115,112,97,195,173,115,101,115,101,106,101,109,112,108,111,100,\n101,114,101,99,104,111,97,100,101,109,195,161,115,112,114,105,118,97,100,111,97,\n103,114,101,103,97,114,101,110,108,97,99,101,115,112,111,115,105,98,108,101,104,\n111,116,101,108,101,115,115,101,118,105,108,108,97,112,114,105,109,101,114,111,\n195,186,108,116,105,109,111,101,118,101,110,116,111,115,97,114,99,104,105,118,\n111,99,117,108,116,117,114,97,109,117,106,101,114,101,115,101,110,116,114,97,100\n,97,97,110,117,110,99,105,111,101,109,98,97,114,103,111,109,101,114,99,97,100,\n111,103,114,97,110,100,101,115,101,115,116,117,100,105,111,109,101,106,111,114,\n101,115,102,101,98,114,101,114,111,100,105,115,101,195,177,111,116,117,114,105,\n115,109,111,99,195,179,100,105,103,111,112,111,114,116,97,100,97,101,115,112,97,\n99,105,111,102,97,109,105,108,105,97,97,110,116,111,110,105,111,112,101,114,109,\n105,116,101,103,117,97,114,100,97,114,97,108,103,117,110,97,115,112,114,101,99,\n105,111,115,97,108,103,117,105,101,110,115,101,110,116,105,100,111,118,105,115,\n105,116,97,115,116,195,173,116,117,108,111,99,111,110,111,99,101,114,115,101,103\n,117,110,100,111,99,111,110,115,101,106,111,102,114,97,110,99,105,97,109,105,110\n,117,116,111,115,115,101,103,117,110,100,97,116,101,110,101,109,111,115,101,102,\n101,99,116,111,115,109,195,161,108,97,103,97,115,101,115,105,195,179,110,114,101\n,118,105,115,116,97,103,114,97,110,97,100,97,99,111,109,112,114,97,114,105,110,\n103,114,101,115,111,103,97,114,99,195,173,97,97,99,99,105,195,179,110,101,99,117\n,97,100,111,114,113,117,105,101,110,101,115,105,110,99,108,117,115,111,100,101,\n98,101,114,195,161,109,97,116,101,114,105,97,104,111,109,98,114,101,115,109,117,\n101,115,116,114,97,112,111,100,114,195,173,97,109,97,195,177,97,110,97,195,186,\n108,116,105,109,97,101,115,116,97,109,111,115,111,102,105,99,105,97,108,116,97,\n109,98,105,101,110,110,105,110,103,195,186,110,115,97,108,117,100,111,115,112,\n111,100,101,109,111,115,109,101,106,111,114,97,114,112,111,115,105,116,105,111,\n110,98,117,115,105,110,101,115,115,104,111,109,101,112,97,103,101,115,101,99,117\n,114,105,116,121,108,97,110,103,117,97,103,101,115,116,97,110,100,97,114,100,99,\n97,109,112,97,105,103,110,102,101,97,116,117,114,101,115,99,97,116,101,103,111,\n114,121,101,120,116,101,114,110,97,108,99,104,105,108,100,114,101,110,114,101,\n115,101,114,118,101,100,114,101,115,101,97,114,99,104,101,120,99,104,97,110,103,\n101,102,97,118,111,114,105,116,101,116,101,109,112,108,97,116,101,109,105,108,\n105,116,97,114,121,105,110,100,117,115,116,114,121,115,101,114,118,105,99,101,\n115,109,97,116,101,114,105,97,108,112,114,111,100,117,99,116,115,122,45,105,110,\n100,101,120,58,99,111,109,109,101,110,116,115,115,111,102,116,119,97,114,101,99,\n111,109,112,108,101,116,101,99,97,108,101,110,100,97,114,112,108,97,116,102,111,\n114,109,97,114,116,105,99,108,101,115,114,101,113,117,105,114,101,100,109,111,\n118,101,109,101,110,116,113,117,101,115,116,105,111,110,98,117,105,108,100,105,\n110,103,112,111,108,105,116,105,99,115,112,111,115,115,105,98,108,101,114,101,\n108,105,103,105,111,110,112,104,121,115,105,99,97,108,102,101,101,100,98,97,99,\n107,114,101,103,105,115,116,101,114,112,105,99,116,117,114,101,115,100,105,115,\n97,98,108,101,100,112,114,111,116,111,99,111,108,97,117,100,105,101,110,99,101,\n115,101,116,116,105,110,103,115,97,99,116,105,118,105,116,121,101,108,101,109,\n101,110,116,115,108,101,97,114,110,105,110,103,97,110,121,116,104,105,110,103,97\n,98,115,116,114,97,99,116,112,114,111,103,114,101,115,115,111,118,101,114,118,\n105,101,119,109,97,103,97,122,105,110,101,101,99,111,110,111,109,105,99,116,114,\n97,105,110,105,110,103,112,114,101,115,115,117,114,101,118,97,114,105,111,117,\n115,32,60,115,116,114,111,110,103,62,112,114,111,112,101,114,116,121,115,104,111\n,112,112,105,110,103,116,111,103,101,116,104,101,114,97,100,118,97,110,99,101,\n100,98,101,104,97,118,105,111,114,100,111,119,110,108,111,97,100,102,101,97,116,\n117,114,101,100,102,111,111,116,98,97,108,108,115,101,108,101,99,116,101,100,76,\n97,110,103,117,97,103,101,100,105,115,116,97,110,99,101,114,101,109,101,109,98,\n101,114,116,114,97,99,107,105,110,103,112,97,115,115,119,111,114,100,109,111,100\n,105,102,105,101,100,115,116,117,100,101,110,116,115,100,105,114,101,99,116,108,\n121,102,105,103,104,116,105,110,103,110,111,114,116,104,101,114,110,100,97,116,\n97,98,97,115,101,102,101,115,116,105,118,97,108,98,114,101,97,107,105,110,103,\n108,111,99,97,116,105,111,110,105,110,116,101,114,110,101,116,100,114,111,112,\n100,111,119,110,112,114,97,99,116,105,99,101,101,118,105,100,101,110,99,101,102,\n117,110,99,116,105,111,110,109,97,114,114,105,97,103,101,114,101,115,112,111,110\n,115,101,112,114,111,98,108,101,109,115,110,101,103,97,116,105,118,101,112,114,\n111,103,114,97,109,115,97,110,97,108,121,115,105,115,114,101,108,101,97,115,101,\n100,98,97,110,110,101,114,34,62,112,117,114,99,104,97,115,101,112,111,108,105,99\n,105,101,115,114,101,103,105,111,110,97,108,99,114,101,97,116,105,118,101,97,114\n,103,117,109,101,110,116,98,111,111,107,109,97,114,107,114,101,102,101,114,114,\n101,114,99,104,101,109,105,99,97,108,100,105,118,105,115,105,111,110,99,97,108,\n108,98,97,99,107,115,101,112,97,114,97,116,101,112,114,111,106,101,99,116,115,99\n,111,110,102,108,105,99,116,104,97,114,100,119,97,114,101,105,110,116,101,114,\n101,115,116,100,101,108,105,118,101,114,121,109,111,117,110,116,97,105,110,111,\n98,116,97,105,110,101,100,61,32,102,97,108,115,101,59,102,111,114,40,118,97,114,\n32,97,99,99,101,112,116,101,100,99,97,112,97,99,105,116,121,99,111,109,112,117,\n116,101,114,105,100,101,110,116,105,116,121,97,105,114,99,114,97,102,116,101,109\n,112,108,111,121,101,100,112,114,111,112,111,115,101,100,100,111,109,101,115,116\n,105,99,105,110,99,108,117,100,101,115,112,114,111,118,105,100,101,100,104,111,\n115,112,105,116,97,108,118,101,114,116,105,99,97,108,99,111,108,108,97,112,115,\n101,97,112,112,114,111,97,99,104,112,97,114,116,110,101,114,115,108,111,103,111,\n34,62,60,97,100,97,117,103,104,116,101,114,97,117,116,104,111,114,34,32,99,117,\n108,116,117,114,97,108,102,97,109,105,108,105,101,115,47,105,109,97,103,101,115,\n47,97,115,115,101,109,98,108,121,112,111,119,101,114,102,117,108,116,101,97,99,\n104,105,110,103,102,105,110,105,115,104,101,100,100,105,115,116,114,105,99,116,\n99,114,105,116,105,99,97,108,99,103,105,45,98,105,110,47,112,117,114,112,111,115\n,101,115,114,101,113,117,105,114,101,115,101,108,101,99,116,105,111,110,98,101,\n99,111,109,105,110,103,112,114,111,118,105,100,101,115,97,99,97,100,101,109,105,\n99,101,120,101,114,99,105,115,101,97,99,116,117,97,108,108,121,109,101,100,105,\n99,105,110,101,99,111,110,115,116,97,110,116,97,99,99,105,100,101,110,116,77,97,\n103,97,122,105,110,101,100,111,99,117,109,101,110,116,115,116,97,114,116,105,110\n,103,98,111,116,116,111,109,34,62,111,98,115,101,114,118,101,100,58,32,38,113,\n117,111,116,59,101,120,116,101,110,100,101,100,112,114,101,118,105,111,117,115,\n83,111,102,116,119,97,114,101,99,117,115,116,111,109,101,114,100,101,99,105,115,\n105,111,110,115,116,114,101,110,103,116,104,100,101,116,97,105,108,101,100,115,\n108,105,103,104,116,108,121,112,108,97,110,110,105,110,103,116,101,120,116,97,\n114,101,97,99,117,114,114,101,110,99,121,101,118,101,114,121,111,110,101,115,116\n,114,97,105,103,104,116,116,114,97,110,115,102,101,114,112,111,115,105,116,105,\n118,101,112,114,111,100,117,99,101,100,104,101,114,105,116,97,103,101,115,104,\n105,112,112,105,110,103,97,98,115,111,108,117,116,101,114,101,99,101,105,118,101\n,100,114,101,108,101,118,97,110,116,98,117,116,116,111,110,34,32,118,105,111,108\n,101,110,99,101,97,110,121,119,104,101,114,101,98,101,110,101,102,105,116,115,\n108,97,117,110,99,104,101,100,114,101,99,101,110,116,108,121,97,108,108,105,97,\n110,99,101,102,111,108,108,111,119,101,100,109,117,108,116,105,112,108,101,98,\n117,108,108,101,116,105,110,105,110,99,108,117,100,101,100,111,99,99,117,114,114\n,101,100,105,110,116,101,114,110,97,108,36,40,116,104,105,115,41,46,114,101,112,\n117,98,108,105,99,62,60,116,114,62,60,116,100,99,111,110,103,114,101,115,115,114\n,101,99,111,114,100,101,100,117,108,116,105,109,97,116,101,115,111,108,117,116,\n105,111,110,60,117,108,32,105,100,61,34,100,105,115,99,111,118,101,114,72,111,\n109,101,60,47,97,62,119,101,98,115,105,116,101,115,110,101,116,119,111,114,107,\n115,97,108,116,104,111,117,103,104,101,110,116,105,114,101,108,121,109,101,109,\n111,114,105,97,108,109,101,115,115,97,103,101,115,99,111,110,116,105,110,117,101\n,97,99,116,105,118,101,34,62,115,111,109,101,119,104,97,116,118,105,99,116,111,\n114,105,97,87,101,115,116,101,114,110,32,32,116,105,116,108,101,61,34,76,111,99,\n97,116,105,111,110,99,111,110,116,114,97,99,116,118,105,115,105,116,111,114,115,\n68,111,119,110,108,111,97,100,119,105,116,104,111,117,116,32,114,105,103,104,116\n,34,62,10,109,101,97,115,117,114,101,115,119,105,100,116,104,32,61,32,118,97,114\n,105,97,98,108,101,105,110,118,111,108,118,101,100,118,105,114,103,105,110,105,\n97,110,111,114,109,97,108,108,121,104,97,112,112,101,110,101,100,97,99,99,111,\n117,110,116,115,115,116,97,110,100,105,110,103,110,97,116,105,111,110,97,108,82,\n101,103,105,115,116,101,114,112,114,101,112,97,114,101,100,99,111,110,116,114,\n111,108,115,97,99,99,117,114,97,116,101,98,105,114,116,104,100,97,121,115,116,\n114,97,116,101,103,121,111,102,102,105,99,105,97,108,103,114,97,112,104,105,99,\n115,99,114,105,109,105,110,97,108,112,111,115,115,105,98,108,121,99,111,110,115,\n117,109,101,114,80,101,114,115,111,110,97,108,115,112,101,97,107,105,110,103,118\n,97,108,105,100,97,116,101,97,99,104,105,101,118,101,100,46,106,112,103,34,32,47\n,62,109,97,99,104,105,110,101,115,60,47,104,50,62,10,32,32,107,101,121,119,111,\n114,100,115,102,114,105,101,110,100,108,121,98,114,111,116,104,101,114,115,99,\n111,109,98,105,110,101,100,111,114,105,103,105,110,97,108,99,111,109,112,111,115\n,101,100,101,120,112,101,99,116,101,100,97,100,101,113,117,97,116,101,112,97,107\n,105,115,116,97,110,102,111,108,108,111,119,34,32,118,97,108,117,97,98,108,101,\n60,47,108,97,98,101,108,62,114,101,108,97,116,105,118,101,98,114,105,110,103,105\n,110,103,105,110,99,114,101,97,115,101,103,111,118,101,114,110,111,114,112,108,\n117,103,105,110,115,47,76,105,115,116,32,111,102,32,72,101,97,100,101,114,34,62,\n34,32,110,97,109,101,61,34,32,40,38,113,117,111,116,59,103,114,97,100,117,97,116\n,101,60,47,104,101,97,100,62,10,99,111,109,109,101,114,99,101,109,97,108,97,121,\n115,105,97,100,105,114,101,99,116,111,114,109,97,105,110,116,97,105,110,59,104,\n101,105,103,104,116,58,115,99,104,101,100,117,108,101,99,104,97,110,103,105,110,\n103,98,97,99,107,32,116,111,32,99,97,116,104,111,108,105,99,112,97,116,116,101,\n114,110,115,99,111,108,111,114,58,32,35,103,114,101,97,116,101,115,116,115,117,\n112,112,108,105,101,115,114,101,108,105,97,98,108,101,60,47,117,108,62,10,9,9,60\n,115,101,108,101,99,116,32,99,105,116,105,122,101,110,115,99,108,111,116,104,105\n,110,103,119,97,116,99,104,105,110,103,60,108,105,32,105,100,61,34,115,112,101,\n99,105,102,105,99,99,97,114,114,121,105,110,103,115,101,110,116,101,110,99,101,\n60,99,101,110,116,101,114,62,99,111,110,116,114,97,115,116,116,104,105,110,107,\n105,110,103,99,97,116,99,104,40,101,41,115,111,117,116,104,101,114,110,77,105,99\n,104,97,101,108,32,109,101,114,99,104,97,110,116,99,97,114,111,117,115,101,108,\n112,97,100,100,105,110,103,58,105,110,116,101,114,105,111,114,46,115,112,108,105\n,116,40,34,108,105,122,97,116,105,111,110,79,99,116,111,98,101,114,32,41,123,114\n,101,116,117,114,110,105,109,112,114,111,118,101,100,45,45,38,103,116,59,10,10,\n99,111,118,101,114,97,103,101,99,104,97,105,114,109,97,110,46,112,110,103,34,32,\n47,62,115,117,98,106,101,99,116,115,82,105,99,104,97,114,100,32,119,104,97,116,\n101,118,101,114,112,114,111,98,97,98,108,121,114,101,99,111,118,101,114,121,98,\n97,115,101,98,97,108,108,106,117,100,103,109,101,110,116,99,111,110,110,101,99,\n116,46,46,99,115,115,34,32,47,62,32,119,101,98,115,105,116,101,114,101,112,111,\n114,116,101,100,100,101,102,97,117,108,116,34,47,62,60,47,97,62,13,10,101,108,\n101,99,116,114,105,99,115,99,111,116,108,97,110,100,99,114,101,97,116,105,111,\n110,113,117,97,110,116,105,116,121,46,32,73,83,66,78,32,48,100,105,100,32,110,\n111,116,32,105,110,115,116,97,110,99,101,45,115,101,97,114,99,104,45,34,32,108,\n97,110,103,61,34,115,112,101,97,107,101,114,115,67,111,109,112,117,116,101,114,\n99,111,110,116,97,105,110,115,97,114,99,104,105,118,101,115,109,105,110,105,115,\n116,101,114,114,101,97,99,116,105,111,110,100,105,115,99,111,117,110,116,73,116,\n97,108,105,97,110,111,99,114,105,116,101,114,105,97,115,116,114,111,110,103,108,\n121,58,32,39,104,116,116,112,58,39,115,99,114,105,112,116,39,99,111,118,101,114,\n105,110,103,111,102,102,101,114,105,110,103,97,112,112,101,97,114,101,100,66,114\n,105,116,105,115,104,32,105,100,101,110,116,105,102,121,70,97,99,101,98,111,111,\n107,110,117,109,101,114,111,117,115,118,101,104,105,99,108,101,115,99,111,110,99\n,101,114,110,115,65,109,101,114,105,99,97,110,104,97,110,100,108,105,110,103,100\n,105,118,32,105,100,61,34,87,105,108,108,105,97,109,32,112,114,111,118,105,100,\n101,114,95,99,111,110,116,101,110,116,97,99,99,117,114,97,99,121,115,101,99,116,\n105,111,110,32,97,110,100,101,114,115,111,110,102,108,101,120,105,98,108,101,67,\n97,116,101,103,111,114,121,108,97,119,114,101,110,99,101,60,115,99,114,105,112,\n116,62,108,97,121,111,117,116,61,34,97,112,112,114,111,118,101,100,32,109,97,120\n,105,109,117,109,104,101,97,100,101,114,34,62,60,47,116,97,98,108,101,62,83,101,\n114,118,105,99,101,115,104,97,109,105,108,116,111,110,99,117,114,114,101,110,116\n,32,99,97,110,97,100,105,97,110,99,104,97,110,110,101,108,115,47,116,104,101,109\n,101,115,47,47,97,114,116,105,99,108,101,111,112,116,105,111,110,97,108,112,111,\n114,116,117,103,97,108,118,97,108,117,101,61,34,34,105,110,116,101,114,118,97,\n108,119,105,114,101,108,101,115,115,101,110,116,105,116,108,101,100,97,103,101,\n110,99,105,101,115,83,101,97,114,99,104,34,32,109,101,97,115,117,114,101,100,116\n,104,111,117,115,97,110,100,115,112,101,110,100,105,110,103,38,104,101,108,108,\n105,112,59,110,101,119,32,68,97,116,101,34,32,115,105,122,101,61,34,112,97,103,\n101,78,97,109,101,109,105,100,100,108,101,34,32,34,32,47,62,60,47,97,62,104,105,\n100,100,101,110,34,62,115,101,113,117,101,110,99,101,112,101,114,115,111,110,97,\n108,111,118,101,114,102,108,111,119,111,112,105,110,105,111,110,115,105,108,108,\n105,110,111,105,115,108,105,110,107,115,34,62,10,9,60,116,105,116,108,101,62,118\n,101,114,115,105,111,110,115,115,97,116,117,114,100,97,121,116,101,114,109,105,\n110,97,108,105,116,101,109,112,114,111,112,101,110,103,105,110,101,101,114,115,\n101,99,116,105,111,110,115,100,101,115,105,103,110,101,114,112,114,111,112,111,\n115,97,108,61,34,102,97,108,115,101,34,69,115,112,97,195,177,111,108,114,101,108\n,101,97,115,101,115,115,117,98,109,105,116,34,32,101,114,38,113,117,111,116,59,\n97,100,100,105,116,105,111,110,115,121,109,112,116,111,109,115,111,114,105,101,\n110,116,101,100,114,101,115,111,117,114,99,101,114,105,103,104,116,34,62,60,112,\n108,101,97,115,117,114,101,115,116,97,116,105,111,110,115,104,105,115,116,111,\n114,121,46,108,101,97,118,105,110,103,32,32,98,111,114,100,101,114,61,99,111,110\n,116,101,110,116,115,99,101,110,116,101,114,34,62,46,10,10,83,111,109,101,32,100\n,105,114,101,99,116,101,100,115,117,105,116,97,98,108,101,98,117,108,103,97,114,\n105,97,46,115,104,111,119,40,41,59,100,101,115,105,103,110,101,100,71,101,110,\n101,114,97,108,32,99,111,110,99,101,112,116,115,69,120,97,109,112,108,101,115,\n119,105,108,108,105,97,109,115,79,114,105,103,105,110,97,108,34,62,60,115,112,97\n,110,62,115,101,97,114,99,104,34,62,111,112,101,114,97,116,111,114,114,101,113,\n117,101,115,116,115,97,32,38,113,117,111,116,59,97,108,108,111,119,105,110,103,\n68,111,99,117,109,101,110,116,114,101,118,105,115,105,111,110,46,32,10,10,84,104\n,101,32,121,111,117,114,115,101,108,102,67,111,110,116,97,99,116,32,109,105,99,\n104,105,103,97,110,69,110,103,108,105,115,104,32,99,111,108,117,109,98,105,97,\n112,114,105,111,114,105,116,121,112,114,105,110,116,105,110,103,100,114,105,110,\n107,105,110,103,102,97,99,105,108,105,116,121,114,101,116,117,114,110,101,100,67\n,111,110,116,101,110,116,32,111,102,102,105,99,101,114,115,82,117,115,115,105,97\n,110,32,103,101,110,101,114,97,116,101,45,56,56,53,57,45,49,34,105,110,100,105,\n99,97,116,101,102,97,109,105,108,105,97,114,32,113,117,97,108,105,116,121,109,97\n,114,103,105,110,58,48,32,99,111,110,116,101,110,116,118,105,101,119,112,111,114\n,116,99,111,110,116,97,99,116,115,45,116,105,116,108,101,34,62,112,111,114,116,\n97,98,108,101,46,108,101,110,103,116,104,32,101,108,105,103,105,98,108,101,105,\n110,118,111,108,118,101,115,97,116,108,97,110,116,105,99,111,110,108,111,97,100,\n61,34,100,101,102,97,117,108,116,46,115,117,112,112,108,105,101,100,112,97,121,\n109,101,110,116,115,103,108,111,115,115,97,114,121,10,10,65,102,116,101,114,32,\n103,117,105,100,97,110,99,101,60,47,116,100,62,60,116,100,101,110,99,111,100,105\n,110,103,109,105,100,100,108,101,34,62,99,97,109,101,32,116,111,32,100,105,115,\n112,108,97,121,115,115,99,111,116,116,105,115,104,106,111,110,97,116,104,97,110,\n109,97,106,111,114,105,116,121,119,105,100,103,101,116,115,46,99,108,105,110,105\n,99,97,108,116,104,97,105,108,97,110,100,116,101,97,99,104,101,114,115,60,104,\n101,97,100,62,10,9,97,102,102,101,99,116,101,100,115,117,112,112,111,114,116,115\n,112,111,105,110,116,101,114,59,116,111,83,116,114,105,110,103,60,47,115,109,97,\n108,108,62,111,107,108,97,104,111,109,97,119,105,108,108,32,98,101,32,105,110,\n118,101,115,116,111,114,48,34,32,97,108,116,61,34,104,111,108,105,100,97,121,115\n,82,101,115,111,117,114,99,101,108,105,99,101,110,115,101,100,32,40,119,104,105,\n99,104,32,46,32,65,102,116,101,114,32,99,111,110,115,105,100,101,114,118,105,115\n,105,116,105,110,103,101,120,112,108,111,114,101,114,112,114,105,109,97,114,121,\n32,115,101,97,114,99,104,34,32,97,110,100,114,111,105,100,34,113,117,105,99,107,\n108,121,32,109,101,101,116,105,110,103,115,101,115,116,105,109,97,116,101,59,114\n,101,116,117,114,110,32,59,99,111,108,111,114,58,35,32,104,101,105,103,104,116,\n61,97,112,112,114,111,118,97,108,44,32,38,113,117,111,116,59,32,99,104,101,99,\n107,101,100,46,109,105,110,46,106,115,34,109,97,103,110,101,116,105,99,62,60,47,\n97,62,60,47,104,102,111,114,101,99,97,115,116,46,32,87,104,105,108,101,32,116,\n104,117,114,115,100,97,121,100,118,101,114,116,105,115,101,38,101,97,99,117,116,\n101,59,104,97,115,67,108,97,115,115,101,118,97,108,117,97,116,101,111,114,100,\n101,114,105,110,103,101,120,105,115,116,105,110,103,112,97,116,105,101,110,116,\n115,32,79,110,108,105,110,101,32,99,111,108,111,114,97,100,111,79,112,116,105,\n111,110,115,34,99,97,109,112,98,101,108,108,60,33,45,45,32,101,110,100,60,47,115\n,112,97,110,62,60,60,98,114,32,47,62,13,10,95,112,111,112,117,112,115,124,115,99\n,105,101,110,99,101,115,44,38,113,117,111,116,59,32,113,117,97,108,105,116,121,\n32,87,105,110,100,111,119,115,32,97,115,115,105,103,110,101,100,104,101,105,103,\n104,116,58,32,60,98,32,99,108,97,115,115,108,101,38,113,117,111,116,59,32,118,97\n,108,117,101,61,34,32,67,111,109,112,97,110,121,101,120,97,109,112,108,101,115,\n60,105,102,114,97,109,101,32,98,101,108,105,101,118,101,115,112,114,101,115,101,\n110,116,115,109,97,114,115,104,97,108,108,112,97,114,116,32,111,102,32,112,114,\n111,112,101,114,108,121,41,46,10,10,84,104,101,32,116,97,120,111,110,111,109,121\n,109,117,99,104,32,111,102,32,60,47,115,112,97,110,62,10,34,32,100,97,116,97,45,\n115,114,116,117,103,117,195,170,115,115,99,114,111,108,108,84,111,32,112,114,111\n,106,101,99,116,60,104,101,97,100,62,13,10,97,116,116,111,114,110,101,121,101,\n109,112,104,97,115,105,115,115,112,111,110,115,111,114,115,102,97,110,99,121,98,\n111,120,119,111,114,108,100,39,115,32,119,105,108,100,108,105,102,101,99,104,101\n,99,107,101,100,61,115,101,115,115,105,111,110,115,112,114,111,103,114,97,109,\n109,112,120,59,102,111,110,116,45,32,80,114,111,106,101,99,116,106,111,117,114,\n110,97,108,115,98,101,108,105,101,118,101,100,118,97,99,97,116,105,111,110,116,\n104,111,109,112,115,111,110,108,105,103,104,116,105,110,103,97,110,100,32,116,\n104,101,32,115,112,101,99,105,97,108,32,98,111,114,100,101,114,61,48,99,104,101,\n99,107,105,110,103,60,47,116,98,111,100,121,62,60,98,117,116,116,111,110,32,67,\n111,109,112,108,101,116,101,99,108,101,97,114,102,105,120,10,60,104,101,97,100,\n62,10,97,114,116,105,99,108,101,32,60,115,101,99,116,105,111,110,102,105,110,100\n,105,110,103,115,114,111,108,101,32,105,110,32,112,111,112,117,108,97,114,32,32,\n79,99,116,111,98,101,114,119,101,98,115,105,116,101,32,101,120,112,111,115,117,\n114,101,117,115,101,100,32,116,111,32,32,99,104,97,110,103,101,115,111,112,101,\n114,97,116,101,100,99,108,105,99,107,105,110,103,101,110,116,101,114,105,110,103\n,99,111,109,109,97,110,100,115,105,110,102,111,114,109,101,100,32,110,117,109,98\n,101,114,115,32,32,60,47,100,105,118,62,99,114,101,97,116,105,110,103,111,110,83\n,117,98,109,105,116,109,97,114,121,108,97,110,100,99,111,108,108,101,103,101,115\n,97,110,97,108,121,116,105,99,108,105,115,116,105,110,103,115,99,111,110,116,97,\n99,116,46,108,111,103,103,101,100,73,110,97,100,118,105,115,111,114,121,115,105,\n98,108,105,110,103,115,99,111,110,116,101,110,116,34,115,38,113,117,111,116,59,\n41,115,46,32,84,104,105,115,32,112,97,99,107,97,103,101,115,99,104,101,99,107,98\n,111,120,115,117,103,103,101,115,116,115,112,114,101,103,110,97,110,116,116,111,\n109,111,114,114,111,119,115,112,97,99,105,110,103,61,105,99,111,110,46,112,110,\n103,106,97,112,97,110,101,115,101,99,111,100,101,98,97,115,101,98,117,116,116,\n111,110,34,62,103,97,109,98,108,105,110,103,115,117,99,104,32,97,115,32,44,32,\n119,104,105,108,101,32,60,47,115,112,97,110,62,32,109,105,115,115,111,117,114,\n105,115,112,111,114,116,105,110,103,116,111,112,58,49,112,120,32,46,60,47,115,\n112,97,110,62,116,101,110,115,105,111,110,115,119,105,100,116,104,61,34,50,108,\n97,122,121,108,111,97,100,110,111,118,101,109,98,101,114,117,115,101,100,32,105,\n110,32,104,101,105,103,104,116,61,34,99,114,105,112,116,34,62,10,38,110,98,115,\n112,59,60,47,60,116,114,62,60,116,100,32,104,101,105,103,104,116,58,50,47,112,\n114,111,100,117,99,116,99,111,117,110,116,114,121,32,105,110,99,108,117,100,101,\n32,102,111,111,116,101,114,34,32,38,108,116,59,33,45,45,32,116,105,116,108,101,\n34,62,60,47,106,113,117,101,114,121,46,60,47,102,111,114,109,62,10,40,231,174,\n128,228,189,147,41,40,231,185,129,233,171,148,41,104,114,118,97,116,115,107,105,\n105,116,97,108,105,97,110,111,114,111,109,195,162,110,196,131,116,195,188,114,\n107,195,167,101,216,167,216,177,216,175,217,136,116,97,109,98,105,195,169,110,\n110,111,116,105,99,105,97,115,109,101,110,115,97,106,101,115,112,101,114,115,111\n,110,97,115,100,101,114,101,99,104,111,115,110,97,99,105,111,110,97,108,115,101,\n114,118,105,99,105,111,99,111,110,116,97,99,116,111,117,115,117,97,114,105,111,\n115,112,114,111,103,114,97,109,97,103,111,98,105,101,114,110,111,101,109,112,114\n,101,115,97,115,97,110,117,110,99,105,111,115,118,97,108,101,110,99,105,97,99,\n111,108,111,109,98,105,97,100,101,115,112,117,195,169,115,100,101,112,111,114,\n116,101,115,112,114,111,121,101,99,116,111,112,114,111,100,117,99,116,111,112,\n195,186,98,108,105,99,111,110,111,115,111,116,114,111,115,104,105,115,116,111,\n114,105,97,112,114,101,115,101,110,116,101,109,105,108,108,111,110,101,115,109,\n101,100,105,97,110,116,101,112,114,101,103,117,110,116,97,97,110,116,101,114,105\n,111,114,114,101,99,117,114,115,111,115,112,114,111,98,108,101,109,97,115,97,110\n,116,105,97,103,111,110,117,101,115,116,114,111,115,111,112,105,110,105,195,179,\n110,105,109,112,114,105,109,105,114,109,105,101,110,116,114,97,115,97,109,195,\n169,114,105,99,97,118,101,110,100,101,100,111,114,115,111,99,105,101,100,97,100,\n114,101,115,112,101,99,116,111,114,101,97,108,105,122,97,114,114,101,103,105,115\n,116,114,111,112,97,108,97,98,114,97,115,105,110,116,101,114,195,169,115,101,110\n,116,111,110,99,101,115,101,115,112,101,99,105,97,108,109,105,101,109,98,114,111\n,115,114,101,97,108,105,100,97,100,99,195,179,114,100,111,98,97,122,97,114,97,\n103,111,122,97,112,195,161,103,105,110,97,115,115,111,99,105,97,108,101,115,98,\n108,111,113,117,101,97,114,103,101,115,116,105,195,179,110,97,108,113,117,105,\n108,101,114,115,105,115,116,101,109,97,115,99,105,101,110,99,105,97,115,99,111,\n109,112,108,101,116,111,118,101,114,115,105,195,179,110,99,111,109,112,108,101,\n116,97,101,115,116,117,100,105,111,115,112,195,186,98,108,105,99,97,111,98,106,\n101,116,105,118,111,97,108,105,99,97,110,116,101,98,117,115,99,97,100,111,114,99\n,97,110,116,105,100,97,100,101,110,116,114,97,100,97,115,97,99,99,105,111,110,\n101,115,97,114,99,104,105,118,111,115,115,117,112,101,114,105,111,114,109,97,121\n,111,114,195,173,97,97,108,101,109,97,110,105,97,102,117,110,99,105,195,179,110,\n195,186,108,116,105,109,111,115,104,97,99,105,101,110,100,111,97,113,117,101,108\n,108,111,115,101,100,105,99,105,195,179,110,102,101,114,110,97,110,100,111,97,\n109,98,105,101,110,116,101,102,97,99,101,98,111,111,107,110,117,101,115,116,114,\n97,115,99,108,105,101,110,116,101,115,112,114,111,99,101,115,111,115,98,97,115,\n116,97,110,116,101,112,114,101,115,101,110,116,97,114,101,112,111,114,116,97,114\n,99,111,110,103,114,101,115,111,112,117,98,108,105,99,97,114,99,111,109,101,114,\n99,105,111,99,111,110,116,114,97,116,111,106,195,179,118,101,110,101,115,100,105\n,115,116,114,105,116,111,116,195,169,99,110,105,99,97,99,111,110,106,117,110,116\n,111,101,110,101,114,103,195,173,97,116,114,97,98,97,106,97,114,97,115,116,117,\n114,105,97,115,114,101,99,105,101,110,116,101,117,116,105,108,105,122,97,114,98,\n111,108,101,116,195,173,110,115,97,108,118,97,100,111,114,99,111,114,114,101,99,\n116,97,116,114,97,98,97,106,111,115,112,114,105,109,101,114,111,115,110,101,103,\n111,99,105,111,115,108,105,98,101,114,116,97,100,100,101,116,97,108,108,101,115,\n112,97,110,116,97,108,108,97,112,114,195,179,120,105,109,111,97,108,109,101,114,\n195,173,97,97,110,105,109,97,108,101,115,113,117,105,195,169,110,101,115,99,111,\n114,97,122,195,179,110,115,101,99,99,105,195,179,110,98,117,115,99,97,110,100,\n111,111,112,99,105,111,110,101,115,101,120,116,101,114,105,111,114,99,111,110,99\n,101,112,116,111,116,111,100,97,118,195,173,97,103,97,108,101,114,195,173,97,101\n,115,99,114,105,98,105,114,109,101,100,105,99,105,110,97,108,105,99,101,110,99,\n105,97,99,111,110,115,117,108,116,97,97,115,112,101,99,116,111,115,99,114,195,\n173,116,105,99,97,100,195,179,108,97,114,101,115,106,117,115,116,105,99,105,97,\n100,101,98,101,114,195,161,110,112,101,114,195,173,111,100,111,110,101,99,101,\n115,105,116,97,109,97,110,116,101,110,101,114,112,101,113,117,101,195,177,111,\n114,101,99,105,98,105,100,97,116,114,105,98,117,110,97,108,116,101,110,101,114,\n105,102,101,99,97,110,99,105,195,179,110,99,97,110,97,114,105,97,115,100,101,115\n,99,97,114,103,97,100,105,118,101,114,115,111,115,109,97,108,108,111,114,99,97,\n114,101,113,117,105,101,114,101,116,195,169,99,110,105,99,111,100,101,98,101,114\n,195,173,97,118,105,118,105,101,110,100,97,102,105,110,97,110,122,97,115,97,100,\n101,108,97,110,116,101,102,117,110,99,105,111,110,97,99,111,110,115,101,106,111,\n115,100,105,102,195,173,99,105,108,99,105,117,100,97,100,101,115,97,110,116,105,\n103,117,97,115,97,118,97,110,122,97,100,97,116,195,169,114,109,105,110,111,117,\n110,105,100,97,100,101,115,115,195,161,110,99,104,101,122,99,97,109,112,97,195,\n177,97,115,111,102,116,111,110,105,99,114,101,118,105,115,116,97,115,99,111,110,\n116,105,101,110,101,115,101,99,116,111,114,101,115,109,111,109,101,110,116,111,\n115,102,97,99,117,108,116,97,100,99,114,195,169,100,105,116,111,100,105,118,101,\n114,115,97,115,115,117,112,117,101,115,116,111,102,97,99,116,111,114,101,115,115\n,101,103,117,110,100,111,115,112,101,113,117,101,195,177,97,208,179,208,190,208,\n180,208,176,208,181,209,129,208,187,208,184,208,181,209,129,209,130,209,140,208,\n177,209,139,208,187,208,190,208,177,209,139,209,130,209,140,209,141,209,130,208,\n190,208,188,208,149,209,129,208,187,208,184,209,130,208,190,208,179,208,190,208,\n188,208,181,208,189,209,143,208,178,209,129,208,181,209,133,209,141,209,130,208,\n190,208,185,208,180,208,176,208,182,208,181,208,177,209,139,208,187,208,184,208,\n179,208,190,208,180,209,131,208,180,208,181,208,189,209,140,209,141,209,130,208,\n190,209,130,208,177,209,139,208,187,208,176,209,129,208,181,208,177,209,143,208,\n190,208,180,208,184,208,189,209,129,208,181,208,177,208,181,208,189,208,176,208,\n180,208,190,209,129,208,176,208,185,209,130,209,132,208,190,209,130,208,190,208,\n189,208,181,208,179,208,190,209,129,208,178,208,190,208,184,209,129,208,178,208,\n190,208,185,208,184,208,179,209,128,209,139,209,130,208,190,208,182,208,181,208,\n178,209,129,208,181,208,188,209,129,208,178,208,190,209,142,208,187,208,184,209,\n136,209,140,209,141,209,130,208,184,209,133,208,191,208,190,208,186,208,176,208,\n180,208,189,208,181,208,185,208,180,208,190,208,188,208,176,208,188,208,184,209,\n128,208,176,208,187,208,184,208,177,208,190,209,130,208,181,208,188,209,131,209,\n133,208,190,209,130,209,143,208,180,208,178,209,131,209,133,209,129,208,181,209,\n130,208,184,208,187,209,142,208,180,208,184,208,180,208,181,208,187,208,190,208,\n188,208,184,209,128,208,181,209,130,208,181,208,177,209,143,209,129,208,178,208,\n190,208,181,208,178,208,184,208,180,208,181,209,135,208,181,208,179,208,190,209,\n141,209,130,208,184,208,188,209,129,209,135,208,181,209,130,209,130,208,181,208,\n188,209,139,209,134,208,181,208,189,209,139,209,129,209,130,208,176,208,187,208,\n178,208,181,208,180,209,140,209,130,208,181,208,188,208,181,208,178,208,190,208,\n180,209,139,209,130,208,181,208,177,208,181,208,178,209,139,209,136,208,181,208,\n189,208,176,208,188,208,184,209,130,208,184,208,191,208,176,209,130,208,190,208,\n188,209,131,208,191,209,128,208,176,208,178,208,187,208,184,209,134,208,176,208,\n190,208,180,208,189,208,176,208,179,208,190,208,180,209,139,208,183,208,189,208,\n176,209,142,208,188,208,190,208,179,209,131,208,180,209,128,209,131,208,179,208,\n178,209,129,208,181,208,185,208,184,208,180,208,181,209,130,208,186,208,184,208,\n189,208,190,208,190,208,180,208,189,208,190,208,180,208,181,208,187,208,176,208,\n180,208,181,208,187,208,181,209,129,209,128,208,190,208,186,208,184,209,142,208,\n189,209,143,208,178,208,181,209,129,209,140,208,149,209,129,209,130,209,140,209,\n128,208,176,208,183,208,176,208,189,208,176,209,136,208,184,216,167,217,132,217,\n132,217,135,216,167,217,132,216,170,217,138,216,172,217,133,217,138,216,185,216,\n174,216,167,216,181,216,169,216,167,217,132,216,176,217,138,216,185,217,132,217,\n138,217,135,216,172,216,175,217,138,216,175,216,167,217,132,216,162,217,134,216,\n167,217,132,216,177,216,175,216,170,216,173,217,131,217,133,216,181,217,129,216,\n173,216,169,217,131,216,167,217,134,216,170,216,167,217,132,217,132,217,138,217,\n138,217,131,217,136,217,134,216,180,216,168,217,131,216,169,217,129,217,138,217,\n135,216,167,216,168,217,134,216,167,216,170,216,173,217,136,216,167,216,161,216,\n163,217,131,216,171,216,177,216,174,217,132,216,167,217,132,216,167,217,132,216,\n173,216,168,216,175,217,132,217,138,217,132,216,175,216,177,217,136,216,179,216,\n167,216,182,216,186,216,183,216,170,217,131,217,136,217,134,217,135,217,134,216,\n167,217,131,216,179,216,167,216,173,216,169,217,134,216,167,216,175,217,138,216,\n167,217,132,216,183,216,168,216,185,217,132,217,138,217,131,216,180,217,131,216,\n177,216,167,217,138,217,133,217,131,217,134,217,133,217,134,217,135,216,167,216,\n180,216,177,217,131,216,169,216,177,216,166,217,138,216,179,217,134,216,180,217,\n138,216,183,217,133,216,167,216,176,216,167,216,167,217,132,217,129,217,134,216,\n180,216,168,216,167,216,168,216,170,216,185,216,168,216,177,216,177,216,173,217,\n133,216,169,217,131,216,167,217,129,216,169,217,138,217,130,217,136,217,132,217,\n133,216,177,217,131,216,178,217,131,217,132,217,133,216,169,216,163,216,173,217,\n133,216,175,217,130,217,132,216,168,217,138,217,138,216,185,217,134,217,138,216,\n181,217,136,216,177,216,169,216,183,216,177,217,138,217,130,216,180,216,167,216,\n177,217,131,216,172,217,136,216,167,217,132,216,163,216,174,216,177,217,137,217,\n133,216,185,217,134,216,167,216,167,216,168,216,173,216,171,216,185,216,177,217,\n136,216,182,216,168,216,180,217,131,217,132,217,133,216,179,216,172,217,132,216,\n168,217,134,216,167,217,134,216,174,216,167,217,132,216,175,217,131,216,170,216,\n167,216,168,217,131,217,132,217,138,216,169,216,168,216,175,217,136,217,134,216,\n163,217,138,216,182,216,167,217,138,217,136,216,172,216,175,217,129,216,177,217,\n138,217,130,217,131,216,170,216,168,216,170,216,163,217,129,216,182,217,132,217,\n133,216,183,216,168,216,174,216,167,217,131,216,171,216,177,216,168,216,167,216,\n177,217,131,216,167,217,129,216,182,217,132,216,167,216,173,217,132,217,137,217,\n134,217,129,216,179,217,135,216,163,217,138,216,167,217,133,216,177,216,175,217,\n136,216,175,216,163,217,134,217,135,216,167,216,175,217,138,217,134,216,167,216,\n167,217,132,216,167,217,134,217,133,216,185,216,177,216,182,216,170,216,185,217,\n132,217,133,216,175,216,167,216,174,217,132,217,133,217,133,217,131,217,134,0,0,\n0,0,0,0,0,0,1,0,1,0,1,0,1,0,2,0,2,0,2,0,2,0,4,0,4,0,4,0,4,0,0,1,2,3,4,5,6,7,7,6,\n5,4,3,2,1,0,8,9,10,11,12,13,14,15,15,14,13,12,11,10,9,8,16,17,18,19,20,21,22,23,\n23,22,21,20,19,18,17,16,24,25,26,27,28,29,30,31,31,30,29,28,27,26,25,24,255,255,\n255,255,0,0,0,0,0,0,0,0,255,255,255,255,1,0,0,0,2,0,0,0,2,0,0,0,1,0,0,0,1,0,0,0,\n3,0,0,0,255,255,0,1,0,0,0,1,0,0,255,255,0,1,0,0,0,8,0,8,0,8,0,8,0,0,0,1,0,2,0,3,\n0,4,0,5,0,6,0,7,114,101,115,111,117,114,99,101,115,99,111,117,110,116,114,105,\n101,115,113,117,101,115,116,105,111,110,115,101,113,117,105,112,109,101,110,116,\n99,111,109,109,117,110,105,116,121,97,118,97,105,108,97,98,108,101,104,105,103,\n104,108,105,103,104,116,68,84,68,47,120,104,116,109,108,109,97,114,107,101,116,\n105,110,103,107,110,111,119,108,101,100,103,101,115,111,109,101,116,104,105,110,\n103,99,111,110,116,97,105,110,101,114,100,105,114,101,99,116,105,111,110,115,117\n,98,115,99,114,105,98,101,97,100,118,101,114,116,105,115,101,99,104,97,114,97,99\n,116,101,114,34,32,118,97,108,117,101,61,34,60,47,115,101,108,101,99,116,62,65,\n117,115,116,114,97,108,105,97,34,32,99,108,97,115,115,61,34,115,105,116,117,97,\n116,105,111,110,97,117,116,104,111,114,105,116,121,102,111,108,108,111,119,105,\n110,103,112,114,105,109,97,114,105,108,121,111,112,101,114,97,116,105,111,110,99\n,104,97,108,108,101,110,103,101,100,101,118,101,108,111,112,101,100,97,110,111,\n110,121,109,111,117,115,102,117,110,99,116,105,111,110,32,102,117,110,99,116,105\n,111,110,115,99,111,109,112,97,110,105,101,115,115,116,114,117,99,116,117,114,\n101,97,103,114,101,101,109,101,110,116,34,32,116,105,116,108,101,61,34,112,111,\n116,101,110,116,105,97,108,101,100,117,99,97,116,105,111,110,97,114,103,117,109,\n101,110,116,115,115,101,99,111,110,100,97,114,121,99,111,112,121,114,105,103,104\n,116,108,97,110,103,117,97,103,101,115,101,120,99,108,117,115,105,118,101,99,111\n,110,100,105,116,105,111,110,60,47,102,111,114,109,62,13,10,115,116,97,116,101,\n109,101,110,116,97,116,116,101,110,116,105,111,110,66,105,111,103,114,97,112,104\n,121,125,32,101,108,115,101,32,123,10,115,111,108,117,116,105,111,110,115,119,\n104,101,110,32,116,104,101,32,65,110,97,108,121,116,105,99,115,116,101,109,112,\n108,97,116,101,115,100,97,110,103,101,114,111,117,115,115,97,116,101,108,108,105\n,116,101,100,111,99,117,109,101,110,116,115,112,117,98,108,105,115,104,101,114,\n105,109,112,111,114,116,97,110,116,112,114,111,116,111,116,121,112,101,105,110,\n102,108,117,101,110,99,101,38,114,97,113,117,111,59,60,47,101,102,102,101,99,116\n,105,118,101,103,101,110,101,114,97,108,108,121,116,114,97,110,115,102,111,114,\n109,98,101,97,117,116,105,102,117,108,116,114,97,110,115,112,111,114,116,111,114\n,103,97,110,105,122,101,100,112,117,98,108,105,115,104,101,100,112,114,111,109,\n105,110,101,110,116,117,110,116,105,108,32,116,104,101,116,104,117,109,98,110,97\n,105,108,78,97,116,105,111,110,97,108,32,46,102,111,99,117,115,40,41,59,111,118,\n101,114,32,116,104,101,32,109,105,103,114,97,116,105,111,110,97,110,110,111,117,\n110,99,101,100,102,111,111,116,101,114,34,62,10,101,120,99,101,112,116,105,111,\n110,108,101,115,115,32,116,104,97,110,101,120,112,101,110,115,105,118,101,102,\n111,114,109,97,116,105,111,110,102,114,97,109,101,119,111,114,107,116,101,114,\n114,105,116,111,114,121,110,100,105,99,97,116,105,111,110,99,117,114,114,101,110\n,116,108,121,99,108,97,115,115,78,97,109,101,99,114,105,116,105,99,105,115,109,\n116,114,97,100,105,116,105,111,110,101,108,115,101,119,104,101,114,101,65,108,\n101,120,97,110,100,101,114,97,112,112,111,105,110,116,101,100,109,97,116,101,114\n,105,97,108,115,98,114,111,97,100,99,97,115,116,109,101,110,116,105,111,110,101,\n100,97,102,102,105,108,105,97,116,101,60,47,111,112,116,105,111,110,62,116,114,\n101,97,116,109,101,110,116,100,105,102,102,101,114,101,110,116,47,100,101,102,97\n,117,108,116,46,80,114,101,115,105,100,101,110,116,111,110,99,108,105,99,107,61,\n34,98,105,111,103,114,97,112,104,121,111,116,104,101,114,119,105,115,101,112,101\n,114,109,97,110,101,110,116,70,114,97,110,195,167,97,105,115,72,111,108,108,121,\n119,111,111,100,101,120,112,97,110,115,105,111,110,115,116,97,110,100,97,114,100\n,115,60,47,115,116,121,108,101,62,10,114,101,100,117,99,116,105,111,110,68,101,\n99,101,109,98,101,114,32,112,114,101,102,101,114,114,101,100,67,97,109,98,114,\n105,100,103,101,111,112,112,111,110,101,110,116,115,66,117,115,105,110,101,115,\n115,32,99,111,110,102,117,115,105,111,110,62,10,60,116,105,116,108,101,62,112,\n114,101,115,101,110,116,101,100,101,120,112,108,97,105,110,101,100,100,111,101,\n115,32,110,111,116,32,119,111,114,108,100,119,105,100,101,105,110,116,101,114,\n102,97,99,101,112,111,115,105,116,105,111,110,115,110,101,119,115,112,97,112,101\n,114,60,47,116,97,98,108,101,62,10,109,111,117,110,116,97,105,110,115,108,105,\n107,101,32,116,104,101,32,101,115,115,101,110,116,105,97,108,102,105,110,97,110,\n99,105,97,108,115,101,108,101,99,116,105,111,110,97,99,116,105,111,110,61,34,47,\n97,98,97,110,100,111,110,101,100,69,100,117,99,97,116,105,111,110,112,97,114,115\n,101,73,110,116,40,115,116,97,98,105,108,105,116,121,117,110,97,98,108,101,32,\n116,111,60,47,116,105,116,108,101,62,10,114,101,108,97,116,105,111,110,115,78,\n111,116,101,32,116,104,97,116,101,102,102,105,99,105,101,110,116,112,101,114,102\n,111,114,109,101,100,116,119,111,32,121,101,97,114,115,83,105,110,99,101,32,116,\n104,101,116,104,101,114,101,102,111,114,101,119,114,97,112,112,101,114,34,62,97,\n108,116,101,114,110,97,116,101,105,110,99,114,101,97,115,101,100,66,97,116,116,\n108,101,32,111,102,112,101,114,99,101,105,118,101,100,116,114,121,105,110,103,32\n,116,111,110,101,99,101,115,115,97,114,121,112,111,114,116,114,97,121,101,100,\n101,108,101,99,116,105,111,110,115,69,108,105,122,97,98,101,116,104,60,47,105,\n102,114,97,109,101,62,100,105,115,99,111,118,101,114,121,105,110,115,117,114,97,\n110,99,101,115,46,108,101,110,103,116,104,59,108,101,103,101,110,100,97,114,121,\n71,101,111,103,114,97,112,104,121,99,97,110,100,105,100,97,116,101,99,111,114,\n112,111,114,97,116,101,115,111,109,101,116,105,109,101,115,115,101,114,118,105,\n99,101,115,46,105,110,104,101,114,105,116,101,100,60,47,115,116,114,111,110,103,\n62,67,111,109,109,117,110,105,116,121,114,101,108,105,103,105,111,117,115,108,\n111,99,97,116,105,111,110,115,67,111,109,109,105,116,116,101,101,98,117,105,108,\n100,105,110,103,115,116,104,101,32,119,111,114,108,100,110,111,32,108,111,110,\n103,101,114,98,101,103,105,110,110,105,110,103,114,101,102,101,114,101,110,99,\n101,99,97,110,110,111,116,32,98,101,102,114,101,113,117,101,110,99,121,116,121,\n112,105,99,97,108,108,121,105,110,116,111,32,116,104,101,32,114,101,108,97,116,\n105,118,101,59,114,101,99,111,114,100,105,110,103,112,114,101,115,105,100,101,\n110,116,105,110,105,116,105,97,108,108,121,116,101,99,104,110,105,113,117,101,\n116,104,101,32,111,116,104,101,114,105,116,32,99,97,110,32,98,101,101,120,105,\n115,116,101,110,99,101,117,110,100,101,114,108,105,110,101,116,104,105,115,32,\n116,105,109,101,116,101,108,101,112,104,111,110,101,105,116,101,109,115,99,111,\n112,101,112,114,97,99,116,105,99,101,115,97,100,118,97,110,116,97,103,101,41,59,\n114,101,116,117,114,110,32,70,111,114,32,111,116,104,101,114,112,114,111,118,105\n,100,105,110,103,100,101,109,111,99,114,97,99,121,98,111,116,104,32,116,104,101,\n32,101,120,116,101,110,115,105,118,101,115,117,102,102,101,114,105,110,103,115,\n117,112,112,111,114,116,101,100,99,111,109,112,117,116,101,114,115,32,102,117,\n110,99,116,105,111,110,112,114,97,99,116,105,99,97,108,115,97,105,100,32,116,104\n,97,116,105,116,32,109,97,121,32,98,101,69,110,103,108,105,115,104,60,47,102,114\n,111,109,32,116,104,101,32,115,99,104,101,100,117,108,101,100,100,111,119,110,\n108,111,97,100,115,60,47,108,97,98,101,108,62,10,115,117,115,112,101,99,116,101,\n100,109,97,114,103,105,110,58,32,48,115,112,105,114,105,116,117,97,108,60,47,104\n,101,97,100,62,10,10,109,105,99,114,111,115,111,102,116,103,114,97,100,117,97,\n108,108,121,100,105,115,99,117,115,115,101,100,104,101,32,98,101,99,97,109,101,\n101,120,101,99,117,116,105,118,101,106,113,117,101,114,121,46,106,115,104,111,\n117,115,101,104,111,108,100,99,111,110,102,105,114,109,101,100,112,117,114,99,\n104,97,115,101,100,108,105,116,101,114,97,108,108,121,100,101,115,116,114,111,\n121,101,100,117,112,32,116,111,32,116,104,101,118,97,114,105,97,116,105,111,110,\n114,101,109,97,105,110,105,110,103,105,116,32,105,115,32,110,111,116,99,101,110,\n116,117,114,105,101,115,74,97,112,97,110,101,115,101,32,97,109,111,110,103,32,\n116,104,101,99,111,109,112,108,101,116,101,100,97,108,103,111,114,105,116,104,\n109,105,110,116,101,114,101,115,116,115,114,101,98,101,108,108,105,111,110,117,\n110,100,101,102,105,110,101,100,101,110,99,111,117,114,97,103,101,114,101,115,\n105,122,97,98,108,101,105,110,118,111,108,118,105,110,103,115,101,110,115,105,\n116,105,118,101,117,110,105,118,101,114,115,97,108,112,114,111,118,105,115,105,\n111,110,40,97,108,116,104,111,117,103,104,102,101,97,116,117,114,105,110,103,99,\n111,110,100,117,99,116,101,100,41,44,32,119,104,105,99,104,32,99,111,110,116,105\n,110,117,101,100,45,104,101,97,100,101,114,34,62,70,101,98,114,117,97,114,121,32\n,110,117,109,101,114,111,117,115,32,111,118,101,114,102,108,111,119,58,99,111,\n109,112,111,110,101,110,116,102,114,97,103,109,101,110,116,115,101,120,99,101,\n108,108,101,110,116,99,111,108,115,112,97,110,61,34,116,101,99,104,110,105,99,97\n,108,110,101,97,114,32,116,104,101,32,65,100,118,97,110,99,101,100,32,115,111,\n117,114,99,101,32,111,102,101,120,112,114,101,115,115,101,100,72,111,110,103,32,\n75,111,110,103,32,70,97,99,101,98,111,111,107,109,117,108,116,105,112,108,101,32\n,109,101,99,104,97,110,105,115,109,101,108,101,118,97,116,105,111,110,111,102,\n102,101,110,115,105,118,101,60,47,102,111,114,109,62,10,9,115,112,111,110,115,\n111,114,101,100,100,111,99,117,109,101,110,116,46,111,114,32,38,113,117,111,116,\n59,116,104,101,114,101,32,97,114,101,116,104,111,115,101,32,119,104,111,109,111,\n118,101,109,101,110,116,115,112,114,111,99,101,115,115,101,115,100,105,102,102,\n105,99,117,108,116,115,117,98,109,105,116,116,101,100,114,101,99,111,109,109,101\n,110,100,99,111,110,118,105,110,99,101,100,112,114,111,109,111,116,105,110,103,\n34,32,119,105,100,116,104,61,34,46,114,101,112,108,97,99,101,40,99,108,97,115,\n115,105,99,97,108,99,111,97,108,105,116,105,111,110,104,105,115,32,102,105,114,\n115,116,100,101,99,105,115,105,111,110,115,97,115,115,105,115,116,97,110,116,105\n,110,100,105,99,97,116,101,100,101,118,111,108,117,116,105,111,110,45,119,114,97\n,112,112,101,114,34,101,110,111,117,103,104,32,116,111,97,108,111,110,103,32,116\n,104,101,100,101,108,105,118,101,114,101,100,45,45,62,13,10,60,33,45,45,65,109,\n101,114,105,99,97,110,32,112,114,111,116,101,99,116,101,100,78,111,118,101,109,\n98,101,114,32,60,47,115,116,121,108,101,62,60,102,117,114,110,105,116,117,114,\n101,73,110,116,101,114,110,101,116,32,32,111,110,98,108,117,114,61,34,115,117,\n115,112,101,110,100,101,100,114,101,99,105,112,105,101,110,116,98,97,115,101,100\n,32,111,110,32,77,111,114,101,111,118,101,114,44,97,98,111,108,105,115,104,101,\n100,99,111,108,108,101,99,116,101,100,119,101,114,101,32,109,97,100,101,101,109,\n111,116,105,111,110,97,108,101,109,101,114,103,101,110,99,121,110,97,114,114,97,\n116,105,118,101,97,100,118,111,99,97,116,101,115,112,120,59,98,111,114,100,101,\n114,99,111,109,109,105,116,116,101,100,100,105,114,61,34,108,116,114,34,101,109,\n112,108,111,121,101,101,115,114,101,115,101,97,114,99,104,46,32,115,101,108,101,\n99,116,101,100,115,117,99,99,101,115,115,111,114,99,117,115,116,111,109,101,114,\n115,100,105,115,112,108,97,121,101,100,83,101,112,116,101,109,98,101,114,97,100,\n100,67,108,97,115,115,40,70,97,99,101,98,111,111,107,32,115,117,103,103,101,115,\n116,101,100,97,110,100,32,108,97,116,101,114,111,112,101,114,97,116,105,110,103,\n101,108,97,98,111,114,97,116,101,83,111,109,101,116,105,109,101,115,73,110,115,\n116,105,116,117,116,101,99,101,114,116,97,105,110,108,121,105,110,115,116,97,108\n,108,101,100,102,111,108,108,111,119,101,114,115,74,101,114,117,115,97,108,101,\n109,116,104,101,121,32,104,97,118,101,99,111,109,112,117,116,105,110,103,103,101\n,110,101,114,97,116,101,100,112,114,111,118,105,110,99,101,115,103,117,97,114,97\n,110,116,101,101,97,114,98,105,116,114,97,114,121,114,101,99,111,103,110,105,122\n,101,119,97,110,116,101,100,32,116,111,112,120,59,119,105,100,116,104,58,116,104\n,101,111,114,121,32,111,102,98,101,104,97,118,105,111,117,114,87,104,105,108,101\n,32,116,104,101,101,115,116,105,109,97,116,101,100,98,101,103,97,110,32,116,111,\n32,105,116,32,98,101,99,97,109,101,109,97,103,110,105,116,117,100,101,109,117,\n115,116,32,104,97,118,101,109,111,114,101,32,116,104,97,110,68,105,114,101,99,\n116,111,114,121,101,120,116,101,110,115,105,111,110,115,101,99,114,101,116,97,\n114,121,110,97,116,117,114,97,108,108,121,111,99,99,117,114,114,105,110,103,118,\n97,114,105,97,98,108,101,115,103,105,118,101,110,32,116,104,101,112,108,97,116,\n102,111,114,109,46,60,47,108,97,98,101,108,62,60,102,97,105,108,101,100,32,116,\n111,99,111,109,112,111,117,110,100,115,107,105,110,100,115,32,111,102,32,115,111\n,99,105,101,116,105,101,115,97,108,111,110,103,115,105,100,101,32,45,45,38,103,\n116,59,10,10,115,111,117,116,104,119,101,115,116,116,104,101,32,114,105,103,104,\n116,114,97,100,105,97,116,105,111,110,109,97,121,32,104,97,118,101,32,117,110,\n101,115,99,97,112,101,40,115,112,111,107,101,110,32,105,110,34,32,104,114,101,\n102,61,34,47,112,114,111,103,114,97,109,109,101,111,110,108,121,32,116,104,101,\n32,99,111,109,101,32,102,114,111,109,100,105,114,101,99,116,111,114,121,98,117,\n114,105,101,100,32,105,110,97,32,115,105,109,105,108,97,114,116,104,101,121,32,\n119,101,114,101,60,47,102,111,110,116,62,60,47,78,111,114,119,101,103,105,97,110\n,115,112,101,99,105,102,105,101,100,112,114,111,100,117,99,105,110,103,112,97,\n115,115,101,110,103,101,114,40,110,101,119,32,68,97,116,101,116,101,109,112,111,\n114,97,114,121,102,105,99,116,105,111,110,97,108,65,102,116,101,114,32,116,104,\n101,101,113,117,97,116,105,111,110,115,100,111,119,110,108,111,97,100,46,114,101\n,103,117,108,97,114,108,121,100,101,118,101,108,111,112,101,114,97,98,111,118,\n101,32,116,104,101,108,105,110,107,101,100,32,116,111,112,104,101,110,111,109,\n101,110,97,112,101,114,105,111,100,32,111,102,116,111,111,108,116,105,112,34,62,\n115,117,98,115,116,97,110,99,101,97,117,116,111,109,97,116,105,99,97,115,112,101\n,99,116,32,111,102,65,109,111,110,103,32,116,104,101,99,111,110,110,101,99,116,\n101,100,101,115,116,105,109,97,116,101,115,65,105,114,32,70,111,114,99,101,115,\n121,115,116,101,109,32,111,102,111,98,106,101,99,116,105,118,101,105,109,109,101\n,100,105,97,116,101,109,97,107,105,110,103,32,105,116,112,97,105,110,116,105,110\n,103,115,99,111,110,113,117,101,114,101,100,97,114,101,32,115,116,105,108,108,\n112,114,111,99,101,100,117,114,101,103,114,111,119,116,104,32,111,102,104,101,97\n,100,101,100,32,98,121,69,117,114,111,112,101,97,110,32,100,105,118,105,115,105,\n111,110,115,109,111,108,101,99,117,108,101,115,102,114,97,110,99,104,105,115,101\n,105,110,116,101,110,116,105,111,110,97,116,116,114,97,99,116,101,100,99,104,105\n,108,100,104,111,111,100,97,108,115,111,32,117,115,101,100,100,101,100,105,99,97\n,116,101,100,115,105,110,103,97,112,111,114,101,100,101,103,114,101,101,32,111,\n102,102,97,116,104,101,114,32,111,102,99,111,110,102,108,105,99,116,115,60,47,97\n,62,60,47,112,62,10,99,97,109,101,32,102,114,111,109,119,101,114,101,32,117,115,\n101,100,110,111,116,101,32,116,104,97,116,114,101,99,101,105,118,105,110,103,69,\n120,101,99,117,116,105,118,101,101,118,101,110,32,109,111,114,101,97,99,99,101,\n115,115,32,116,111,99,111,109,109,97,110,100,101,114,80,111,108,105,116,105,99,\n97,108,109,117,115,105,99,105,97,110,115,100,101,108,105,99,105,111,117,115,112,\n114,105,115,111,110,101,114,115,97,100,118,101,110,116,32,111,102,85,84,70,45,56\n,34,32,47,62,60,33,91,67,68,65,84,65,91,34,62,67,111,110,116,97,99,116,83,111,\n117,116,104,101,114,110,32,98,103,99,111,108,111,114,61,34,115,101,114,105,101,\n115,32,111,102,46,32,73,116,32,119,97,115,32,105,110,32,69,117,114,111,112,101,\n112,101,114,109,105,116,116,101,100,118,97,108,105,100,97,116,101,46,97,112,112,\n101,97,114,105,110,103,111,102,102,105,99,105,97,108,115,115,101,114,105,111,117\n,115,108,121,45,108,97,110,103,117,97,103,101,105,110,105,116,105,97,116,101,100\n,101,120,116,101,110,100,105,110,103,108,111,110,103,45,116,101,114,109,105,110,\n102,108,97,116,105,111,110,115,117,99,104,32,116,104,97,116,103,101,116,67,111,\n111,107,105,101,109,97,114,107,101,100,32,98,121,60,47,98,117,116,116,111,110,62\n,105,109,112,108,101,109,101,110,116,98,117,116,32,105,116,32,105,115,105,110,99\n,114,101,97,115,101,115,100,111,119,110,32,116,104,101,32,114,101,113,117,105,\n114,105,110,103,100,101,112,101,110,100,101,110,116,45,45,62,10,60,33,45,45,32,\n105,110,116,101,114,118,105,101,119,87,105,116,104,32,116,104,101,32,99,111,112,\n105,101,115,32,111,102,99,111,110,115,101,110,115,117,115,119,97,115,32,98,117,\n105,108,116,86,101,110,101,122,117,101,108,97,40,102,111,114,109,101,114,108,121\n,116,104,101,32,115,116,97,116,101,112,101,114,115,111,110,110,101,108,115,116,\n114,97,116,101,103,105,99,102,97,118,111,117,114,32,111,102,105,110,118,101,110,\n116,105,111,110,87,105,107,105,112,101,100,105,97,99,111,110,116,105,110,101,110\n,116,118,105,114,116,117,97,108,108,121,119,104,105,99,104,32,119,97,115,112,114\n,105,110,99,105,112,108,101,67,111,109,112,108,101,116,101,32,105,100,101,110,\n116,105,99,97,108,115,104,111,119,32,116,104,97,116,112,114,105,109,105,116,105,\n118,101,97,119,97,121,32,102,114,111,109,109,111,108,101,99,117,108,97,114,112,\n114,101,99,105,115,101,108,121,100,105,115,115,111,108,118,101,100,85,110,100,\n101,114,32,116,104,101,118,101,114,115,105,111,110,61,34,62,38,110,98,115,112,59\n,60,47,73,116,32,105,115,32,116,104,101,32,84,104,105,115,32,105,115,32,119,105,\n108,108,32,104,97,118,101,111,114,103,97,110,105,115,109,115,115,111,109,101,32,\n116,105,109,101,70,114,105,101,100,114,105,99,104,119,97,115,32,102,105,114,115,\n116,116,104,101,32,111,110,108,121,32,102,97,99,116,32,116,104,97,116,102,111,\n114,109,32,105,100,61,34,112,114,101,99,101,100,105,110,103,84,101,99,104,110,\n105,99,97,108,112,104,121,115,105,99,105,115,116,111,99,99,117,114,115,32,105,\n110,110,97,118,105,103,97,116,111,114,115,101,99,116,105,111,110,34,62,115,112,\n97,110,32,105,100,61,34,115,111,117,103,104,116,32,116,111,98,101,108,111,119,32\n,116,104,101,115,117,114,118,105,118,105,110,103,125,60,47,115,116,121,108,101,\n62,104,105,115,32,100,101,97,116,104,97,115,32,105,110,32,116,104,101,99,97,117,\n115,101,100,32,98,121,112,97,114,116,105,97,108,108,121,101,120,105,115,116,105,\n110,103,32,117,115,105,110,103,32,116,104,101,119,97,115,32,103,105,118,101,110,\n97,32,108,105,115,116,32,111,102,108,101,118,101,108,115,32,111,102,110,111,116,\n105,111,110,32,111,102,79,102,102,105,99,105,97,108,32,100,105,115,109,105,115,\n115,101,100,115,99,105,101,110,116,105,115,116,114,101,115,101,109,98,108,101,\n115,100,117,112,108,105,99,97,116,101,101,120,112,108,111,115,105,118,101,114,\n101,99,111,118,101,114,101,100,97,108,108,32,111,116,104,101,114,103,97,108,108,\n101,114,105,101,115,123,112,97,100,100,105,110,103,58,112,101,111,112,108,101,32\n,111,102,114,101,103,105,111,110,32,111,102,97,100,100,114,101,115,115,101,115,\n97,115,115,111,99,105,97,116,101,105,109,103,32,97,108,116,61,34,105,110,32,109,\n111,100,101,114,110,115,104,111,117,108,100,32,98,101,109,101,116,104,111,100,32\n,111,102,114,101,112,111,114,116,105,110,103,116,105,109,101,115,116,97,109,112,\n110,101,101,100,101,100,32,116,111,116,104,101,32,71,114,101,97,116,114,101,103,\n97,114,100,105,110,103,115,101,101,109,101,100,32,116,111,118,105,101,119,101,\n100,32,97,115,105,109,112,97,99,116,32,111,110,105,100,101,97,32,116,104,97,116,\n116,104,101,32,87,111,114,108,100,104,101,105,103,104,116,32,111,102,101,120,112\n,97,110,100,105,110,103,84,104,101,115,101,32,97,114,101,99,117,114,114,101,110,\n116,34,62,99,97,114,101,102,117,108,108,121,109,97,105,110,116,97,105,110,115,99\n,104,97,114,103,101,32,111,102,67,108,97,115,115,105,99,97,108,97,100,100,114,\n101,115,115,101,100,112,114,101,100,105,99,116,101,100,111,119,110,101,114,115,\n104,105,112,60,100,105,118,32,105,100,61,34,114,105,103,104,116,34,62,13,10,114,\n101,115,105,100,101,110,99,101,108,101,97,118,101,32,116,104,101,99,111,110,116,\n101,110,116,34,62,97,114,101,32,111,102,116,101,110,32,32,125,41,40,41,59,13,10,\n112,114,111,98,97,98,108,121,32,80,114,111,102,101,115,115,111,114,45,98,117,116\n,116,111,110,34,32,114,101,115,112,111,110,100,101,100,115,97,121,115,32,116,104\n,97,116,104,97,100,32,116,111,32,98,101,112,108,97,99,101,100,32,105,110,72,117,\n110,103,97,114,105,97,110,115,116,97,116,117,115,32,111,102,115,101,114,118,101,\n115,32,97,115,85,110,105,118,101,114,115,97,108,101,120,101,99,117,116,105,111,\n110,97,103,103,114,101,103,97,116,101,102,111,114,32,119,104,105,99,104,105,110,\n102,101,99,116,105,111,110,97,103,114,101,101,100,32,116,111,104,111,119,101,118\n,101,114,44,32,112,111,112,117,108,97,114,34,62,112,108,97,99,101,100,32,111,110\n,99,111,110,115,116,114,117,99,116,101,108,101,99,116,111,114,97,108,115,121,109\n,98,111,108,32,111,102,105,110,99,108,117,100,105,110,103,114,101,116,117,114,\n110,32,116,111,97,114,99,104,105,116,101,99,116,67,104,114,105,115,116,105,97,\n110,112,114,101,118,105,111,117,115,32,108,105,118,105,110,103,32,105,110,101,97\n,115,105,101,114,32,116,111,112,114,111,102,101,115,115,111,114,10,38,108,116,59\n,33,45,45,32,101,102,102,101,99,116,32,111,102,97,110,97,108,121,116,105,99,115,\n119,97,115,32,116,97,107,101,110,119,104,101,114,101,32,116,104,101,116,111,111,\n107,32,111,118,101,114,98,101,108,105,101,102,32,105,110,65,102,114,105,107,97,\n97,110,115,97,115,32,102,97,114,32,97,115,112,114,101,118,101,110,116,101,100,\n119,111,114,107,32,119,105,116,104,97,32,115,112,101,99,105,97,108,60,102,105,\n101,108,100,115,101,116,67,104,114,105,115,116,109,97,115,82,101,116,114,105,101\n,118,101,100,10,10,73,110,32,116,104,101,32,98,97,99,107,32,105,110,116,111,110,\n111,114,116,104,101,97,115,116,109,97,103,97,122,105,110,101,115,62,60,115,116,\n114,111,110,103,62,99,111,109,109,105,116,116,101,101,103,111,118,101,114,110,\n105,110,103,103,114,111,117,112,115,32,111,102,115,116,111,114,101,100,32,105,\n110,101,115,116,97,98,108,105,115,104,97,32,103,101,110,101,114,97,108,105,116,\n115,32,102,105,114,115,116,116,104,101,105,114,32,111,119,110,112,111,112,117,\n108,97,116,101,100,97,110,32,111,98,106,101,99,116,67,97,114,105,98,98,101,97,\n110,97,108,108,111,119,32,116,104,101,100,105,115,116,114,105,99,116,115,119,105\n,115,99,111,110,115,105,110,108,111,99,97,116,105,111,110,46,59,32,119,105,100,\n116,104,58,32,105,110,104,97,98,105,116,101,100,83,111,99,105,97,108,105,115,116\n,74,97,110,117,97,114,121,32,49,60,47,102,111,111,116,101,114,62,115,105,109,105\n,108,97,114,108,121,99,104,111,105,99,101,32,111,102,116,104,101,32,115,97,109,\n101,32,115,112,101,99,105,102,105,99,32,98,117,115,105,110,101,115,115,32,84,104\n,101,32,102,105,114,115,116,46,108,101,110,103,116,104,59,32,100,101,115,105,114\n,101,32,116,111,100,101,97,108,32,119,105,116,104,115,105,110,99,101,32,116,104,\n101,117,115,101,114,65,103,101,110,116,99,111,110,99,101,105,118,101,100,105,110\n,100,101,120,46,112,104,112,97,115,32,38,113,117,111,116,59,101,110,103,97,103,\n101,32,105,110,114,101,99,101,110,116,108,121,44,102,101,119,32,121,101,97,114,\n115,119,101,114,101,32,97,108,115,111,10,60,104,101,97,100,62,10,60,101,100,105,\n116,101,100,32,98,121,97,114,101,32,107,110,111,119,110,99,105,116,105,101,115,\n32,105,110,97,99,99,101,115,115,107,101,121,99,111,110,100,101,109,110,101,100,\n97,108,115,111,32,104,97,118,101,115,101,114,118,105,99,101,115,44,102,97,109,\n105,108,121,32,111,102,83,99,104,111,111,108,32,111,102,99,111,110,118,101,114,\n116,101,100,110,97,116,117,114,101,32,111,102,32,108,97,110,103,117,97,103,101,\n109,105,110,105,115,116,101,114,115,60,47,111,98,106,101,99,116,62,116,104,101,\n114,101,32,105,115,32,97,32,112,111,112,117,108,97,114,115,101,113,117,101,110,\n99,101,115,97,100,118,111,99,97,116,101,100,84,104,101,121,32,119,101,114,101,97\n,110,121,32,111,116,104,101,114,108,111,99,97,116,105,111,110,61,101,110,116,101\n,114,32,116,104,101,109,117,99,104,32,109,111,114,101,114,101,102,108,101,99,116\n,101,100,119,97,115,32,110,97,109,101,100,111,114,105,103,105,110,97,108,32,97,\n32,116,121,112,105,99,97,108,119,104,101,110,32,116,104,101,121,101,110,103,105,\n110,101,101,114,115,99,111,117,108,100,32,110,111,116,114,101,115,105,100,101,\n110,116,115,119,101,100,110,101,115,100,97,121,116,104,101,32,116,104,105,114,\n100,32,112,114,111,100,117,99,116,115,74,97,110,117,97,114,121,32,50,119,104,97,\n116,32,116,104,101,121,97,32,99,101,114,116,97,105,110,114,101,97,99,116,105,111\n,110,115,112,114,111,99,101,115,115,111,114,97,102,116,101,114,32,104,105,115,\n116,104,101,32,108,97,115,116,32,99,111,110,116,97,105,110,101,100,34,62,60,47,\n100,105,118,62,10,60,47,97,62,60,47,116,100,62,100,101,112,101,110,100,32,111,\n110,115,101,97,114,99,104,34,62,10,112,105,101,99,101,115,32,111,102,99,111,109,\n112,101,116,105,110,103,82,101,102,101,114,101,110,99,101,116,101,110,110,101,\n115,115,101,101,119,104,105,99,104,32,104,97,115,32,118,101,114,115,105,111,110,\n61,60,47,115,112,97,110,62,32,60,60,47,104,101,97,100,101,114,62,103,105,118,101\n,115,32,116,104,101,104,105,115,116,111,114,105,97,110,118,97,108,117,101,61,34,\n34,62,112,97,100,100,105,110,103,58,48,118,105,101,119,32,116,104,97,116,116,111\n,103,101,116,104,101,114,44,116,104,101,32,109,111,115,116,32,119,97,115,32,102,\n111,117,110,100,115,117,98,115,101,116,32,111,102,97,116,116,97,99,107,32,111,\n110,99,104,105,108,100,114,101,110,44,112,111,105,110,116,115,32,111,102,112,101\n,114,115,111,110,97,108,32,112,111,115,105,116,105,111,110,58,97,108,108,101,103\n,101,100,108,121,67,108,101,118,101,108,97,110,100,119,97,115,32,108,97,116,101,\n114,97,110,100,32,97,102,116,101,114,97,114,101,32,103,105,118,101,110,119,97,\n115,32,115,116,105,108,108,115,99,114,111,108,108,105,110,103,100,101,115,105,\n103,110,32,111,102,109,97,107,101,115,32,116,104,101,109,117,99,104,32,108,101,\n115,115,65,109,101,114,105,99,97,110,115,46,10,10,65,102,116,101,114,32,44,32,98\n,117,116,32,116,104,101,77,117,115,101,117,109,32,111,102,108,111,117,105,115,\n105,97,110,97,40,102,114,111,109,32,116,104,101,109,105,110,110,101,115,111,116,\n97,112,97,114,116,105,99,108,101,115,97,32,112,114,111,99,101,115,115,68,111,109\n,105,110,105,99,97,110,118,111,108,117,109,101,32,111,102,114,101,116,117,114,\n110,105,110,103,100,101,102,101,110,115,105,118,101,48,48,112,120,124,114,105,\n103,104,109,97,100,101,32,102,114,111,109,109,111,117,115,101,111,118,101,114,34\n,32,115,116,121,108,101,61,34,115,116,97,116,101,115,32,111,102,40,119,104,105,\n99,104,32,105,115,99,111,110,116,105,110,117,101,115,70,114,97,110,99,105,115,99\n,111,98,117,105,108,100,105,110,103,32,119,105,116,104,111,117,116,32,97,119,105\n,116,104,32,115,111,109,101,119,104,111,32,119,111,117,108,100,97,32,102,111,114\n,109,32,111,102,97,32,112,97,114,116,32,111,102,98,101,102,111,114,101,32,105,\n116,107,110,111,119,110,32,97,115,32,32,83,101,114,118,105,99,101,115,108,111,99\n,97,116,105,111,110,32,97,110,100,32,111,102,116,101,110,109,101,97,115,117,114,\n105,110,103,97,110,100,32,105,116,32,105,115,112,97,112,101,114,98,97,99,107,118\n,97,108,117,101,115,32,111,102,13,10,60,116,105,116,108,101,62,61,32,119,105,110\n,100,111,119,46,100,101,116,101,114,109,105,110,101,101,114,38,113,117,111,116,\n59,32,112,108,97,121,101,100,32,98,121,97,110,100,32,101,97,114,108,121,60,47,99\n,101,110,116,101,114,62,102,114,111,109,32,116,104,105,115,116,104,101,32,116,\n104,114,101,101,112,111,119,101,114,32,97,110,100,111,102,32,38,113,117,111,116,\n59,105,110,110,101,114,72,84,77,76,60,97,32,104,114,101,102,61,34,121,58,105,110\n,108,105,110,101,59,67,104,117,114,99,104,32,111,102,116,104,101,32,101,118,101,\n110,116,118,101,114,121,32,104,105,103,104,111,102,102,105,99,105,97,108,32,45,\n104,101,105,103,104,116,58,32,99,111,110,116,101,110,116,61,34,47,99,103,105,45,\n98,105,110,47,116,111,32,99,114,101,97,116,101,97,102,114,105,107,97,97,110,115,\n101,115,112,101,114,97,110,116,111,102,114,97,110,195,167,97,105,115,108,97,116,\n118,105,101,197,161,117,108,105,101,116,117,118,105,197,179,196,140,101,197,161,\n116,105,110,97,196,141,101,197,161,116,105,110,97,224,185,132,224,184,151,224,\n184,162,230,151,165,230,156,172,232,170,158,231,174,128,228,189,147,229,173,151,\n231,185,129,233,171,148,229,173,151,237,149,156,234,181,173,236,150,180,228,184,\n186,228,187,128,228,185,136,232,174,161,231,174,151,230,156,186,231,172,148,232,\n174,176,230,156,172,232,168,142,232,171,150,229,141,128,230,156,141,229,138,161,\n229,153,168,228,186,146,232,129,148,231,189,145,230,136,191,229,156,176,228,186,\n167,228,191,177,228,185,144,233,131,168,229,135,186,231,137,136,231,164,190,230,\n142,146,232,161,140,230,166,156,233,131,168,232,144,189,230,160,188,232,191,155,\n228,184,128,230,173,165,230,148,175,228,187,152,229,174,157,233,170,140,232,175,\n129,231,160,129,229,167,148,229,145,152,228,188,154,230,149,176,230,141,174,229,\n186,147,230,182,136,232,180,185,232,128,133,229,138,158,229,133,172,229,174,164,\n232,174,168,232,174,186,229,140,186,230,183,177,229,156,179,229,184,130,230,146,\n173,230,148,190,229,153,168,229,140,151,228,186,172,229,184,130,229,164,167,229,\n173,166,231,148,159,232,182,138,230,157,165,232,182,138,231,174,161,231,144,134,\n229,145,152,228,191,161,230,129,175,231,189,145,115,101,114,118,105,99,105,111,\n115,97,114,116,195,173,99,117,108,111,97,114,103,101,110,116,105,110,97,98,97,\n114,99,101,108,111,110,97,99,117,97,108,113,117,105,101,114,112,117,98,108,105,\n99,97,100,111,112,114,111,100,117,99,116,111,115,112,111,108,195,173,116,105,99,\n97,114,101,115,112,117,101,115,116,97,119,105,107,105,112,101,100,105,97,115,105\n,103,117,105,101,110,116,101,98,195,186,115,113,117,101,100,97,99,111,109,117,\n110,105,100,97,100,115,101,103,117,114,105,100,97,100,112,114,105,110,99,105,112\n,97,108,112,114,101,103,117,110,116,97,115,99,111,110,116,101,110,105,100,111,\n114,101,115,112,111,110,100,101,114,118,101,110,101,122,117,101,108,97,112,114,\n111,98,108,101,109,97,115,100,105,99,105,101,109,98,114,101,114,101,108,97,99,\n105,195,179,110,110,111,118,105,101,109,98,114,101,115,105,109,105,108,97,114,\n101,115,112,114,111,121,101,99,116,111,115,112,114,111,103,114,97,109,97,115,105\n,110,115,116,105,116,117,116,111,97,99,116,105,118,105,100,97,100,101,110,99,117\n,101,110,116,114,97,101,99,111,110,111,109,195,173,97,105,109,195,161,103,101,\n110,101,115,99,111,110,116,97,99,116,97,114,100,101,115,99,97,114,103,97,114,110\n,101,99,101,115,97,114,105,111,97,116,101,110,99,105,195,179,110,116,101,108,195\n,169,102,111,110,111,99,111,109,105,115,105,195,179,110,99,97,110,99,105,111,110\n,101,115,99,97,112,97,99,105,100,97,100,101,110,99,111,110,116,114,97,114,97,110\n,195,161,108,105,115,105,115,102,97,118,111,114,105,116,111,115,116,195,169,114,\n109,105,110,111,115,112,114,111,118,105,110,99,105,97,101,116,105,113,117,101,\n116,97,115,101,108,101,109,101,110,116,111,115,102,117,110,99,105,111,110,101,\n115,114,101,115,117,108,116,97,100,111,99,97,114,195,161,99,116,101,114,112,114,\n111,112,105,101,100,97,100,112,114,105,110,99,105,112,105,111,110,101,99,101,115\n,105,100,97,100,109,117,110,105,99,105,112,97,108,99,114,101,97,99,105,195,179,\n110,100,101,115,99,97,114,103,97,115,112,114,101,115,101,110,99,105,97,99,111,\n109,101,114,99,105,97,108,111,112,105,110,105,111,110,101,115,101,106,101,114,99\n,105,99,105,111,101,100,105,116,111,114,105,97,108,115,97,108,97,109,97,110,99,\n97,103,111,110,122,195,161,108,101,122,100,111,99,117,109,101,110,116,111,112,\n101,108,195,173,99,117,108,97,114,101,99,105,101,110,116,101,115,103,101,110,101\n,114,97,108,101,115,116,97,114,114,97,103,111,110,97,112,114,195,161,99,116,105,\n99,97,110,111,118,101,100,97,100,101,115,112,114,111,112,117,101,115,116,97,112,\n97,99,105,101,110,116,101,115,116,195,169,99,110,105,99,97,115,111,98,106,101,\n116,105,118,111,115,99,111,110,116,97,99,116,111,115,224,164,174,224,165,135,224\n,164,130,224,164,178,224,164,191,224,164,143,224,164,185,224,165,136,224,164,130\n,224,164,151,224,164,175,224,164,190,224,164,184,224,164,190,224,164,165,224,164\n,143,224,164,181,224,164,130,224,164,176,224,164,185,224,165,135,224,164,149,224\n,165,139,224,164,136,224,164,149,224,165,129,224,164,155,224,164,176,224,164,185\n,224,164,190,224,164,172,224,164,190,224,164,166,224,164,149,224,164,185,224,164\n,190,224,164,184,224,164,173,224,165,128,224,164,185,224,165,129,224,164,143,224\n,164,176,224,164,185,224,165,128,224,164,174,224,165,136,224,164,130,224,164,166\n,224,164,191,224,164,168,224,164,172,224,164,190,224,164,164,100,105,112,108,111\n,100,111,99,115,224,164,184,224,164,174,224,164,175,224,164,176,224,165,130,224,\n164,170,224,164,168,224,164,190,224,164,174,224,164,170,224,164,164,224,164,190,\n224,164,171,224,164,191,224,164,176,224,164,148,224,164,184,224,164,164,224,164,\n164,224,164,176,224,164,185,224,164,178,224,165,139,224,164,151,224,164,185,224,\n165,129,224,164,134,224,164,172,224,164,190,224,164,176,224,164,166,224,165,135,\n224,164,182,224,164,185,224,165,129,224,164,136,224,164,150,224,165,135,224,164,\n178,224,164,175,224,164,166,224,164,191,224,164,149,224,164,190,224,164,174,224,\n164,181,224,165,135,224,164,172,224,164,164,224,165,128,224,164,168,224,164,172,\n224,165,128,224,164,154,224,164,174,224,165,140,224,164,164,224,164,184,224,164,\n190,224,164,178,224,164,178,224,165,135,224,164,150,224,164,156,224,165,137,224,\n164,172,224,164,174,224,164,166,224,164,166,224,164,164,224,164,165,224,164,190,\n224,164,168,224,164,185,224,165,128,224,164,182,224,164,185,224,164,176,224,164,\n133,224,164,178,224,164,151,224,164,149,224,164,173,224,165,128,224,164,168,224,\n164,151,224,164,176,224,164,170,224,164,190,224,164,184,224,164,176,224,164,190,\n224,164,164,224,164,149,224,164,191,224,164,143,224,164,137,224,164,184,224,165,\n135,224,164,151,224,164,175,224,165,128,224,164,185,224,165,130,224,164,129,224,\n164,134,224,164,151,224,165,135,224,164,159,224,165,128,224,164,174,224,164,150,\n224,165,139,224,164,156,224,164,149,224,164,190,224,164,176,224,164,133,224,164,\n173,224,165,128,224,164,151,224,164,175,224,165,135,224,164,164,224,165,129,224,\n164,174,224,164,181,224,165,139,224,164,159,224,164,166,224,165,135,224,164,130,\n224,164,133,224,164,151,224,164,176,224,164,144,224,164,184,224,165,135,224,164,\n174,224,165,135,224,164,178,224,164,178,224,164,151,224,164,190,224,164,185,224,\n164,190,224,164,178,224,164,138,224,164,170,224,164,176,224,164,154,224,164,190,\n224,164,176,224,164,144,224,164,184,224,164,190,224,164,166,224,165,135,224,164,\n176,224,164,156,224,164,191,224,164,184,224,164,166,224,164,191,224,164,178,224,\n164,172,224,164,130,224,164,166,224,164,172,224,164,168,224,164,190,224,164,185,\n224,165,130,224,164,130,224,164,178,224,164,190,224,164,150,224,164,156,224,165,\n128,224,164,164,224,164,172,224,164,159,224,164,168,224,164,174,224,164,191,224,\n164,178,224,164,135,224,164,184,224,165,135,224,164,134,224,164,168,224,165,135,\n224,164,168,224,164,175,224,164,190,224,164,149,224,165,129,224,164,178,224,164,\n178,224,165,137,224,164,151,224,164,173,224,164,190,224,164,151,224,164,176,224,\n165,135,224,164,178,224,164,156,224,164,151,224,164,185,224,164,176,224,164,190,\n224,164,174,224,164,178,224,164,151,224,165,135,224,164,170,224,165,135,224,164,\n156,224,164,185,224,164,190,224,164,165,224,164,135,224,164,184,224,165,128,224,\n164,184,224,164,185,224,165,128,224,164,149,224,164,178,224,164,190,224,164,160,\n224,165,128,224,164,149,224,164,185,224,164,190,224,164,129,224,164,166,224,165,\n130,224,164,176,224,164,164,224,164,185,224,164,164,224,164,184,224,164,190,224,\n164,164,224,164,175,224,164,190,224,164,166,224,164,134,224,164,175,224,164,190,\n224,164,170,224,164,190,224,164,149,224,164,149,224,165,140,224,164,168,224,164,\n182,224,164,190,224,164,174,224,164,166,224,165,135,224,164,150,224,164,175,224,\n164,185,224,165,128,224,164,176,224,164,190,224,164,175,224,164,150,224,165,129,\n224,164,166,224,164,178,224,164,151,224,165,128,99,97,116,101,103,111,114,105,\n101,115,101,120,112,101,114,105,101,110,99,101,60,47,116,105,116,108,101,62,13,\n10,67,111,112,121,114,105,103,104,116,32,106,97,118,97,115,99,114,105,112,116,99\n,111,110,100,105,116,105,111,110,115,101,118,101,114,121,116,104,105,110,103,60,\n112,32,99,108,97,115,115,61,34,116,101,99,104,110,111,108,111,103,121,98,97,99,\n107,103,114,111,117,110,100,60,97,32,99,108,97,115,115,61,34,109,97,110,97,103,\n101,109,101,110,116,38,99,111,112,121,59,32,50,48,49,106,97,118,97,83,99,114,105\n,112,116,99,104,97,114,97,99,116,101,114,115,98,114,101,97,100,99,114,117,109,98\n,116,104,101,109,115,101,108,118,101,115,104,111,114,105,122,111,110,116,97,108,\n103,111,118,101,114,110,109,101,110,116,67,97,108,105,102,111,114,110,105,97,97,\n99,116,105,118,105,116,105,101,115,100,105,115,99,111,118,101,114,101,100,78,97,\n118,105,103,97,116,105,111,110,116,114,97,110,115,105,116,105,111,110,99,111,110\n,110,101,99,116,105,111,110,110,97,118,105,103,97,116,105,111,110,97,112,112,101\n,97,114,97,110,99,101,60,47,116,105,116,108,101,62,60,109,99,104,101,99,107,98,\n111,120,34,32,116,101,99,104,110,105,113,117,101,115,112,114,111,116,101,99,116,\n105,111,110,97,112,112,97,114,101,110,116,108,121,97,115,32,119,101,108,108,32,\n97,115,117,110,116,39,44,32,39,85,65,45,114,101,115,111,108,117,116,105,111,110,\n111,112,101,114,97,116,105,111,110,115,116,101,108,101,118,105,115,105,111,110,\n116,114,97,110,115,108,97,116,101,100,87,97,115,104,105,110,103,116,111,110,110,\n97,118,105,103,97,116,111,114,46,32,61,32,119,105,110,100,111,119,46,105,109,112\n,114,101,115,115,105,111,110,38,108,116,59,98,114,38,103,116,59,108,105,116,101,\n114,97,116,117,114,101,112,111,112,117,108,97,116,105,111,110,98,103,99,111,108,\n111,114,61,34,35,101,115,112,101,99,105,97,108,108,121,32,99,111,110,116,101,110\n,116,61,34,112,114,111,100,117,99,116,105,111,110,110,101,119,115,108,101,116,\n116,101,114,112,114,111,112,101,114,116,105,101,115,100,101,102,105,110,105,116,\n105,111,110,108,101,97,100,101,114,115,104,105,112,84,101,99,104,110,111,108,111\n,103,121,80,97,114,108,105,97,109,101,110,116,99,111,109,112,97,114,105,115,111,\n110,117,108,32,99,108,97,115,115,61,34,46,105,110,100,101,120,79,102,40,34,99,\n111,110,99,108,117,115,105,111,110,100,105,115,99,117,115,115,105,111,110,99,111\n,109,112,111,110,101,110,116,115,98,105,111,108,111,103,105,99,97,108,82,101,118\n,111,108,117,116,105,111,110,95,99,111,110,116,97,105,110,101,114,117,110,100,\n101,114,115,116,111,111,100,110,111,115,99,114,105,112,116,62,60,112,101,114,109\n,105,115,115,105,111,110,101,97,99,104,32,111,116,104,101,114,97,116,109,111,115\n,112,104,101,114,101,32,111,110,102,111,99,117,115,61,34,60,102,111,114,109,32,\n105,100,61,34,112,114,111,99,101,115,115,105,110,103,116,104,105,115,46,118,97,\n108,117,101,103,101,110,101,114,97,116,105,111,110,67,111,110,102,101,114,101,\n110,99,101,115,117,98,115,101,113,117,101,110,116,119,101,108,108,45,107,110,111\n,119,110,118,97,114,105,97,116,105,111,110,115,114,101,112,117,116,97,116,105,\n111,110,112,104,101,110,111,109,101,110,111,110,100,105,115,99,105,112,108,105,\n110,101,108,111,103,111,46,112,110,103,34,32,40,100,111,99,117,109,101,110,116,\n44,98,111,117,110,100,97,114,105,101,115,101,120,112,114,101,115,115,105,111,110\n,115,101,116,116,108,101,109,101,110,116,66,97,99,107,103,114,111,117,110,100,\n111,117,116,32,111,102,32,116,104,101,101,110,116,101,114,112,114,105,115,101,40\n,34,104,116,116,112,115,58,34,32,117,110,101,115,99,97,112,101,40,34,112,97,115,\n115,119,111,114,100,34,32,100,101,109,111,99,114,97,116,105,99,60,97,32,104,114,\n101,102,61,34,47,119,114,97,112,112,101,114,34,62,10,109,101,109,98,101,114,115,\n104,105,112,108,105,110,103,117,105,115,116,105,99,112,120,59,112,97,100,100,105\n,110,103,112,104,105,108,111,115,111,112,104,121,97,115,115,105,115,116,97,110,\n99,101,117,110,105,118,101,114,115,105,116,121,102,97,99,105,108,105,116,105,101\n,115,114,101,99,111,103,110,105,122,101,100,112,114,101,102,101,114,101,110,99,\n101,105,102,32,40,116,121,112,101,111,102,109,97,105,110,116,97,105,110,101,100,\n118,111,99,97,98,117,108,97,114,121,104,121,112,111,116,104,101,115,105,115,46,\n115,117,98,109,105,116,40,41,59,38,97,109,112,59,110,98,115,112,59,97,110,110,\n111,116,97,116,105,111,110,98,101,104,105,110,100,32,116,104,101,70,111,117,110,\n100,97,116,105,111,110,112,117,98,108,105,115,104,101,114,34,97,115,115,117,109,\n112,116,105,111,110,105,110,116,114,111,100,117,99,101,100,99,111,114,114,117,\n112,116,105,111,110,115,99,105,101,110,116,105,115,116,115,101,120,112,108,105,\n99,105,116,108,121,105,110,115,116,101,97,100,32,111,102,100,105,109,101,110,115\n,105,111,110,115,32,111,110,67,108,105,99,107,61,34,99,111,110,115,105,100,101,\n114,101,100,100,101,112,97,114,116,109,101,110,116,111,99,99,117,112,97,116,105,\n111,110,115,111,111,110,32,97,102,116,101,114,105,110,118,101,115,116,109,101,\n110,116,112,114,111,110,111,117,110,99,101,100,105,100,101,110,116,105,102,105,\n101,100,101,120,112,101,114,105,109,101,110,116,77,97,110,97,103,101,109,101,110\n,116,103,101,111,103,114,97,112,104,105,99,34,32,104,101,105,103,104,116,61,34,\n108,105,110,107,32,114,101,108,61,34,46,114,101,112,108,97,99,101,40,47,100,101,\n112,114,101,115,115,105,111,110,99,111,110,102,101,114,101,110,99,101,112,117,\n110,105,115,104,109,101,110,116,101,108,105,109,105,110,97,116,101,100,114,101,\n115,105,115,116,97,110,99,101,97,100,97,112,116,97,116,105,111,110,111,112,112,\n111,115,105,116,105,111,110,119,101,108,108,32,107,110,111,119,110,115,117,112,\n112,108,101,109,101,110,116,100,101,116,101,114,109,105,110,101,100,104,49,32,99\n,108,97,115,115,61,34,48,112,120,59,109,97,114,103,105,110,109,101,99,104,97,110\n,105,99,97,108,115,116,97,116,105,115,116,105,99,115,99,101,108,101,98,114,97,\n116,101,100,71,111,118,101,114,110,109,101,110,116,10,10,68,117,114,105,110,103,\n32,116,100,101,118,101,108,111,112,101,114,115,97,114,116,105,102,105,99,105,97,\n108,101,113,117,105,118,97,108,101,110,116,111,114,105,103,105,110,97,116,101,\n100,67,111,109,109,105,115,115,105,111,110,97,116,116,97,99,104,109,101,110,116,\n60,115,112,97,110,32,105,100,61,34,116,104,101,114,101,32,119,101,114,101,78,101\n,100,101,114,108,97,110,100,115,98,101,121,111,110,100,32,116,104,101,114,101,\n103,105,115,116,101,114,101,100,106,111,117,114,110,97,108,105,115,116,102,114,\n101,113,117,101,110,116,108,121,97,108,108,32,111,102,32,116,104,101,108,97,110,\n103,61,34,101,110,34,32,60,47,115,116,121,108,101,62,13,10,97,98,115,111,108,117\n,116,101,59,32,115,117,112,112,111,114,116,105,110,103,101,120,116,114,101,109,\n101,108,121,32,109,97,105,110,115,116,114,101,97,109,60,47,115,116,114,111,110,\n103,62,32,112,111,112,117,108,97,114,105,116,121,101,109,112,108,111,121,109,101\n,110,116,60,47,116,97,98,108,101,62,13,10,32,99,111,108,115,112,97,110,61,34,60,\n47,102,111,114,109,62,10,32,32,99,111,110,118,101,114,115,105,111,110,97,98,111,\n117,116,32,116,104,101,32,60,47,112,62,60,47,100,105,118,62,105,110,116,101,103,\n114,97,116,101,100,34,32,108,97,110,103,61,34,101,110,80,111,114,116,117,103,117\n,101,115,101,115,117,98,115,116,105,116,117,116,101,105,110,100,105,118,105,100,\n117,97,108,105,109,112,111,115,115,105,98,108,101,109,117,108,116,105,109,101,\n100,105,97,97,108,109,111,115,116,32,97,108,108,112,120,32,115,111,108,105,100,\n32,35,97,112,97,114,116,32,102,114,111,109,115,117,98,106,101,99,116,32,116,111,\n105,110,32,69,110,103,108,105,115,104,99,114,105,116,105,99,105,122,101,100,101,\n120,99,101,112,116,32,102,111,114,103,117,105,100,101,108,105,110,101,115,111,\n114,105,103,105,110,97,108,108,121,114,101,109,97,114,107,97,98,108,101,116,104,\n101,32,115,101,99,111,110,100,104,50,32,99,108,97,115,115,61,34,60,97,32,116,105\n,116,108,101,61,34,40,105,110,99,108,117,100,105,110,103,112,97,114,97,109,101,\n116,101,114,115,112,114,111,104,105,98,105,116,101,100,61,32,34,104,116,116,112,\n58,47,47,100,105,99,116,105,111,110,97,114,121,112,101,114,99,101,112,116,105,\n111,110,114,101,118,111,108,117,116,105,111,110,102,111,117,110,100,97,116,105,\n111,110,112,120,59,104,101,105,103,104,116,58,115,117,99,99,101,115,115,102,117,\n108,115,117,112,112,111,114,116,101,114,115,109,105,108,108,101,110,110,105,117,\n109,104,105,115,32,102,97,116,104,101,114,116,104,101,32,38,113,117,111,116,59,\n110,111,45,114,101,112,101,97,116,59,99,111,109,109,101,114,99,105,97,108,105,\n110,100,117,115,116,114,105,97,108,101,110,99,111,117,114,97,103,101,100,97,109,\n111,117,110,116,32,111,102,32,117,110,111,102,102,105,99,105,97,108,101,102,102,\n105,99,105,101,110,99,121,82,101,102,101,114,101,110,99,101,115,99,111,111,114,\n100,105,110,97,116,101,100,105,115,99,108,97,105,109,101,114,101,120,112,101,100\n,105,116,105,111,110,100,101,118,101,108,111,112,105,110,103,99,97,108,99,117,\n108,97,116,101,100,115,105,109,112,108,105,102,105,101,100,108,101,103,105,116,\n105,109,97,116,101,115,117,98,115,116,114,105,110,103,40,48,34,32,99,108,97,115,\n115,61,34,99,111,109,112,108,101,116,101,108,121,105,108,108,117,115,116,114,97,\n116,101,102,105,118,101,32,121,101,97,114,115,105,110,115,116,114,117,109,101,\n110,116,80,117,98,108,105,115,104,105,110,103,49,34,32,99,108,97,115,115,61,34,\n112,115,121,99,104,111,108,111,103,121,99,111,110,102,105,100,101,110,99,101,110\n,117,109,98,101,114,32,111,102,32,97,98,115,101,110,99,101,32,111,102,102,111,99\n,117,115,101,100,32,111,110,106,111,105,110,101,100,32,116,104,101,115,116,114,\n117,99,116,117,114,101,115,112,114,101,118,105,111,117,115,108,121,62,60,47,105,\n102,114,97,109,101,62,111,110,99,101,32,97,103,97,105,110,98,117,116,32,114,97,\n116,104,101,114,105,109,109,105,103,114,97,110,116,115,111,102,32,99,111,117,114\n,115,101,44,97,32,103,114,111,117,112,32,111,102,76,105,116,101,114,97,116,117,\n114,101,85,110,108,105,107,101,32,116,104,101,60,47,97,62,38,110,98,115,112,59,\n10,102,117,110,99,116,105,111,110,32,105,116,32,119,97,115,32,116,104,101,67,111\n,110,118,101,110,116,105,111,110,97,117,116,111,109,111,98,105,108,101,80,114,\n111,116,101,115,116,97,110,116,97,103,103,114,101,115,115,105,118,101,97,102,116\n,101,114,32,116,104,101,32,83,105,109,105,108,97,114,108,121,44,34,32,47,62,60,\n47,100,105,118,62,99,111,108,108,101,99,116,105,111,110,13,10,102,117,110,99,116\n,105,111,110,118,105,115,105,98,105,108,105,116,121,116,104,101,32,117,115,101,\n32,111,102,118,111,108,117,110,116,101,101,114,115,97,116,116,114,97,99,116,105,\n111,110,117,110,100,101,114,32,116,104,101,32,116,104,114,101,97,116,101,110,101\n,100,42,60,33,91,67,68,65,84,65,91,105,109,112,111,114,116,97,110,99,101,105,110\n,32,103,101,110,101,114,97,108,116,104,101,32,108,97,116,116,101,114,60,47,102,\n111,114,109,62,10,60,47,46,105,110,100,101,120,79,102,40,39,105,32,61,32,48,59,\n32,105,32,60,100,105,102,102,101,114,101,110,99,101,100,101,118,111,116,101,100,\n32,116,111,116,114,97,100,105,116,105,111,110,115,115,101,97,114,99,104,32,102,\n111,114,117,108,116,105,109,97,116,101,108,121,116,111,117,114,110,97,109,101,\n110,116,97,116,116,114,105,98,117,116,101,115,115,111,45,99,97,108,108,101,100,\n32,125,10,60,47,115,116,121,108,101,62,101,118,97,108,117,97,116,105,111,110,101\n,109,112,104,97,115,105,122,101,100,97,99,99,101,115,115,105,98,108,101,60,47,\n115,101,99,116,105,111,110,62,115,117,99,99,101,115,115,105,111,110,97,108,111,\n110,103,32,119,105,116,104,77,101,97,110,119,104,105,108,101,44,105,110,100,117,\n115,116,114,105,101,115,60,47,97,62,60,98,114,32,47,62,104,97,115,32,98,101,99,\n111,109,101,97,115,112,101,99,116,115,32,111,102,84,101,108,101,118,105,115,105,\n111,110,115,117,102,102,105,99,105,101,110,116,98,97,115,107,101,116,98,97,108,\n108,98,111,116,104,32,115,105,100,101,115,99,111,110,116,105,110,117,105,110,103\n,97,110,32,97,114,116,105,99,108,101,60,105,109,103,32,97,108,116,61,34,97,100,\n118,101,110,116,117,114,101,115,104,105,115,32,109,111,116,104,101,114,109,97,\n110,99,104,101,115,116,101,114,112,114,105,110,99,105,112,108,101,115,112,97,114\n,116,105,99,117,108,97,114,99,111,109,109,101,110,116,97,114,121,101,102,102,101\n,99,116,115,32,111,102,100,101,99,105,100,101,100,32,116,111,34,62,60,115,116,\n114,111,110,103,62,112,117,98,108,105,115,104,101,114,115,74,111,117,114,110,97,\n108,32,111,102,100,105,102,102,105,99,117,108,116,121,102,97,99,105,108,105,116,\n97,116,101,97,99,99,101,112,116,97,98,108,101,115,116,121,108,101,46,99,115,115,\n34,9,102,117,110,99,116,105,111,110,32,105,110,110,111,118,97,116,105,111,110,62\n,67,111,112,121,114,105,103,104,116,115,105,116,117,97,116,105,111,110,115,119,\n111,117,108,100,32,104,97,118,101,98,117,115,105,110,101,115,115,101,115,68,105,\n99,116,105,111,110,97,114,121,115,116,97,116,101,109,101,110,116,115,111,102,116\n,101,110,32,117,115,101,100,112,101,114,115,105,115,116,101,110,116,105,110,32,\n74,97,110,117,97,114,121,99,111,109,112,114,105,115,105,110,103,60,47,116,105,\n116,108,101,62,10,9,100,105,112,108,111,109,97,116,105,99,99,111,110,116,97,105,\n110,105,110,103,112,101,114,102,111,114,109,105,110,103,101,120,116,101,110,115,\n105,111,110,115,109,97,121,32,110,111,116,32,98,101,99,111,110,99,101,112,116,32\n,111,102,32,111,110,99,108,105,99,107,61,34,73,116,32,105,115,32,97,108,115,111,\n102,105,110,97,110,99,105,97,108,32,109,97,107,105,110,103,32,116,104,101,76,117\n,120,101,109,98,111,117,114,103,97,100,100,105,116,105,111,110,97,108,97,114,101\n,32,99,97,108,108,101,100,101,110,103,97,103,101,100,32,105,110,34,115,99,114,\n105,112,116,34,41,59,98,117,116,32,105,116,32,119,97,115,101,108,101,99,116,114,\n111,110,105,99,111,110,115,117,98,109,105,116,61,34,10,60,33,45,45,32,69,110,100\n,32,101,108,101,99,116,114,105,99,97,108,111,102,102,105,99,105,97,108,108,121,\n115,117,103,103,101,115,116,105,111,110,116,111,112,32,111,102,32,116,104,101,\n117,110,108,105,107,101,32,116,104,101,65,117,115,116,114,97,108,105,97,110,79,\n114,105,103,105,110,97,108,108,121,114,101,102,101,114,101,110,99,101,115,10,60,\n47,104,101,97,100,62,13,10,114,101,99,111,103,110,105,115,101,100,105,110,105,\n116,105,97,108,105,122,101,108,105,109,105,116,101,100,32,116,111,65,108,101,120\n,97,110,100,114,105,97,114,101,116,105,114,101,109,101,110,116,65,100,118,101,\n110,116,117,114,101,115,102,111,117,114,32,121,101,97,114,115,10,10,38,108,116,\n59,33,45,45,32,105,110,99,114,101,97,115,105,110,103,100,101,99,111,114,97,116,\n105,111,110,104,51,32,99,108,97,115,115,61,34,111,114,105,103,105,110,115,32,111\n,102,111,98,108,105,103,97,116,105,111,110,114,101,103,117,108,97,116,105,111,\n110,99,108,97,115,115,105,102,105,101,100,40,102,117,110,99,116,105,111,110,40,\n97,100,118,97,110,116,97,103,101,115,98,101,105,110,103,32,116,104,101,32,104,\n105,115,116,111,114,105,97,110,115,60,98,97,115,101,32,104,114,101,102,114,101,\n112,101,97,116,101,100,108,121,119,105,108,108,105,110,103,32,116,111,99,111,109\n,112,97,114,97,98,108,101,100,101,115,105,103,110,97,116,101,100,110,111,109,105\n,110,97,116,105,111,110,102,117,110,99,116,105,111,110,97,108,105,110,115,105,\n100,101,32,116,104,101,114,101,118,101,108,97,116,105,111,110,101,110,100,32,111\n,102,32,116,104,101,115,32,102,111,114,32,116,104,101,32,97,117,116,104,111,114,\n105,122,101,100,114,101,102,117,115,101,100,32,116,111,116,97,107,101,32,112,108\n,97,99,101,97,117,116,111,110,111,109,111,117,115,99,111,109,112,114,111,109,105\n,115,101,112,111,108,105,116,105,99,97,108,32,114,101,115,116,97,117,114,97,110,\n116,116,119,111,32,111,102,32,116,104,101,70,101,98,114,117,97,114,121,32,50,113\n,117,97,108,105,116,121,32,111,102,115,119,102,111,98,106,101,99,116,46,117,110,\n100,101,114,115,116,97,110,100,110,101,97,114,108,121,32,97,108,108,119,114,105,\n116,116,101,110,32,98,121,105,110,116,101,114,118,105,101,119,115,34,32,119,105,\n100,116,104,61,34,49,119,105,116,104,100,114,97,119,97,108,102,108,111,97,116,58\n,108,101,102,116,105,115,32,117,115,117,97,108,108,121,99,97,110,100,105,100,97,\n116,101,115,110,101,119,115,112,97,112,101,114,115,109,121,115,116,101,114,105,\n111,117,115,68,101,112,97,114,116,109,101,110,116,98,101,115,116,32,107,110,111,\n119,110,112,97,114,108,105,97,109,101,110,116,115,117,112,112,114,101,115,115,\n101,100,99,111,110,118,101,110,105,101,110,116,114,101,109,101,109,98,101,114,\n101,100,100,105,102,102,101,114,101,110,116,32,115,121,115,116,101,109,97,116,\n105,99,104,97,115,32,108,101,100,32,116,111,112,114,111,112,97,103,97,110,100,97\n,99,111,110,116,114,111,108,108,101,100,105,110,102,108,117,101,110,99,101,115,\n99,101,114,101,109,111,110,105,97,108,112,114,111,99,108,97,105,109,101,100,80,\n114,111,116,101,99,116,105,111,110,108,105,32,99,108,97,115,115,61,34,83,99,105,\n101,110,116,105,102,105,99,99,108,97,115,115,61,34,110,111,45,116,114,97,100,101\n,109,97,114,107,115,109,111,114,101,32,116,104,97,110,32,119,105,100,101,115,112\n,114,101,97,100,76,105,98,101,114,97,116,105,111,110,116,111,111,107,32,112,108,\n97,99,101,100,97,121,32,111,102,32,116,104,101,97,115,32,108,111,110,103,32,97,\n115,105,109,112,114,105,115,111,110,101,100,65,100,100,105,116,105,111,110,97,\n108,10,60,104,101,97,100,62,10,60,109,76,97,98,111,114,97,116,111,114,121,78,111\n,118,101,109,98,101,114,32,50,101,120,99,101,112,116,105,111,110,115,73,110,100,\n117,115,116,114,105,97,108,118,97,114,105,101,116,121,32,111,102,102,108,111,97,\n116,58,32,108,101,102,68,117,114,105,110,103,32,116,104,101,97,115,115,101,115,\n115,109,101,110,116,104,97,118,101,32,98,101,101,110,32,100,101,97,108,115,32,\n119,105,116,104,83,116,97,116,105,115,116,105,99,115,111,99,99,117,114,114,101,\n110,99,101,47,117,108,62,60,47,100,105,118,62,99,108,101,97,114,102,105,120,34,\n62,116,104,101,32,112,117,98,108,105,99,109,97,110,121,32,121,101,97,114,115,119\n,104,105,99,104,32,119,101,114,101,111,118,101,114,32,116,105,109,101,44,115,121\n,110,111,110,121,109,111,117,115,99,111,110,116,101,110,116,34,62,10,112,114,101\n,115,117,109,97,98,108,121,104,105,115,32,102,97,109,105,108,121,117,115,101,114\n,65,103,101,110,116,46,117,110,101,120,112,101,99,116,101,100,105,110,99,108,117\n,100,105,110,103,32,99,104,97,108,108,101,110,103,101,100,97,32,109,105,110,111,\n114,105,116,121,117,110,100,101,102,105,110,101,100,34,98,101,108,111,110,103,\n115,32,116,111,116,97,107,101,110,32,102,114,111,109,105,110,32,79,99,116,111,98\n,101,114,112,111,115,105,116,105,111,110,58,32,115,97,105,100,32,116,111,32,98,\n101,114,101,108,105,103,105,111,117,115,32,70,101,100,101,114,97,116,105,111,110\n,32,114,111,119,115,112,97,110,61,34,111,110,108,121,32,97,32,102,101,119,109,\n101,97,110,116,32,116,104,97,116,108,101,100,32,116,111,32,116,104,101,45,45,62,\n13,10,60,100,105,118,32,60,102,105,101,108,100,115,101,116,62,65,114,99,104,98,\n105,115,104,111,112,32,99,108,97,115,115,61,34,110,111,98,101,105,110,103,32,117\n,115,101,100,97,112,112,114,111,97,99,104,101,115,112,114,105,118,105,108,101,\n103,101,115,110,111,115,99,114,105,112,116,62,10,114,101,115,117,108,116,115,32,\n105,110,109,97,121,32,98,101,32,116,104,101,69,97,115,116,101,114,32,101,103,103\n,109,101,99,104,97,110,105,115,109,115,114,101,97,115,111,110,97,98,108,101,80,\n111,112,117,108,97,116,105,111,110,67,111,108,108,101,99,116,105,111,110,115,101\n,108,101,99,116,101,100,34,62,110,111,115,99,114,105,112,116,62,13,47,105,110,\n100,101,120,46,112,104,112,97,114,114,105,118,97,108,32,111,102,45,106,115,115,\n100,107,39,41,41,59,109,97,110,97,103,101,100,32,116,111,105,110,99,111,109,112,\n108,101,116,101,99,97,115,117,97,108,116,105,101,115,99,111,109,112,108,101,116,\n105,111,110,67,104,114,105,115,116,105,97,110,115,83,101,112,116,101,109,98,101,\n114,32,97,114,105,116,104,109,101,116,105,99,112,114,111,99,101,100,117,114,101,\n115,109,105,103,104,116,32,104,97,118,101,80,114,111,100,117,99,116,105,111,110,\n105,116,32,97,112,112,101,97,114,115,80,104,105,108,111,115,111,112,104,121,102,\n114,105,101,110,100,115,104,105,112,108,101,97,100,105,110,103,32,116,111,103,\n105,118,105,110,103,32,116,104,101,116,111,119,97,114,100,32,116,104,101,103,117\n,97,114,97,110,116,101,101,100,100,111,99,117,109,101,110,116,101,100,99,111,108\n,111,114,58,35,48,48,48,118,105,100,101,111,32,103,97,109,101,99,111,109,109,105\n,115,115,105,111,110,114,101,102,108,101,99,116,105,110,103,99,104,97,110,103,\n101,32,116,104,101,97,115,115,111,99,105,97,116,101,100,115,97,110,115,45,115,\n101,114,105,102,111,110,107,101,121,112,114,101,115,115,59,32,112,97,100,100,105\n,110,103,58,72,101,32,119,97,115,32,116,104,101,117,110,100,101,114,108,121,105,\n110,103,116,121,112,105,99,97,108,108,121,32,44,32,97,110,100,32,116,104,101,32,\n115,114,99,69,108,101,109,101,110,116,115,117,99,99,101,115,115,105,118,101,115,\n105,110,99,101,32,116,104,101,32,115,104,111,117,108,100,32,98,101,32,110,101,\n116,119,111,114,107,105,110,103,97,99,99,111,117,110,116,105,110,103,117,115,101\n,32,111,102,32,116,104,101,108,111,119,101,114,32,116,104,97,110,115,104,111,119\n,115,32,116,104,97,116,60,47,115,112,97,110,62,10,9,9,99,111,109,112,108,97,105,\n110,116,115,99,111,110,116,105,110,117,111,117,115,113,117,97,110,116,105,116,\n105,101,115,97,115,116,114,111,110,111,109,101,114,104,101,32,100,105,100,32,110\n,111,116,100,117,101,32,116,111,32,105,116,115,97,112,112,108,105,101,100,32,116\n,111,97,110,32,97,118,101,114,97,103,101,101,102,102,111,114,116,115,32,116,111,\n116,104,101,32,102,117,116,117,114,101,97,116,116,101,109,112,116,32,116,111,84,\n104,101,114,101,102,111,114,101,44,99,97,112,97,98,105,108,105,116,121,82,101,\n112,117,98,108,105,99,97,110,119,97,115,32,102,111,114,109,101,100,69,108,101,99\n,116,114,111,110,105,99,107,105,108,111,109,101,116,101,114,115,99,104,97,108,\n108,101,110,103,101,115,112,117,98,108,105,115,104,105,110,103,116,104,101,32,\n102,111,114,109,101,114,105,110,100,105,103,101,110,111,117,115,100,105,114,101,\n99,116,105,111,110,115,115,117,98,115,105,100,105,97,114,121,99,111,110,115,112,\n105,114,97,99,121,100,101,116,97,105,108,115,32,111,102,97,110,100,32,105,110,32\n,116,104,101,97,102,102,111,114,100,97,98,108,101,115,117,98,115,116,97,110,99,\n101,115,114,101,97,115,111,110,32,102,111,114,99,111,110,118,101,110,116,105,111\n,110,105,116,101,109,116,121,112,101,61,34,97,98,115,111,108,117,116,101,108,121\n,115,117,112,112,111,115,101,100,108,121,114,101,109,97,105,110,101,100,32,97,97\n,116,116,114,97,99,116,105,118,101,116,114,97,118,101,108,108,105,110,103,115,\n101,112,97,114,97,116,101,108,121,102,111,99,117,115,101,115,32,111,110,101,108,\n101,109,101,110,116,97,114,121,97,112,112,108,105,99,97,98,108,101,102,111,117,\n110,100,32,116,104,97,116,115,116,121,108,101,115,104,101,101,116,109,97,110,117\n,115,99,114,105,112,116,115,116,97,110,100,115,32,102,111,114,32,110,111,45,114,\n101,112,101,97,116,40,115,111,109,101,116,105,109,101,115,67,111,109,109,101,114\n,99,105,97,108,105,110,32,65,109,101,114,105,99,97,117,110,100,101,114,116,97,\n107,101,110,113,117,97,114,116,101,114,32,111,102,97,110,32,101,120,97,109,112,\n108,101,112,101,114,115,111,110,97,108,108,121,105,110,100,101,120,46,112,104,\n112,63,60,47,98,117,116,116,111,110,62,10,112,101,114,99,101,110,116,97,103,101,\n98,101,115,116,45,107,110,111,119,110,99,114,101,97,116,105,110,103,32,97,34,32,\n100,105,114,61,34,108,116,114,76,105,101,117,116,101,110,97,110,116,10,60,100,\n105,118,32,105,100,61,34,116,104,101,121,32,119,111,117,108,100,97,98,105,108,\n105,116,121,32,111,102,109,97,100,101,32,117,112,32,111,102,110,111,116,101,100,\n32,116,104,97,116,99,108,101,97,114,32,116,104,97,116,97,114,103,117,101,32,116,\n104,97,116,116,111,32,97,110,111,116,104,101,114,99,104,105,108,100,114,101,110,\n39,115,112,117,114,112,111,115,101,32,111,102,102,111,114,109,117,108,97,116,101\n,100,98,97,115,101,100,32,117,112,111,110,116,104,101,32,114,101,103,105,111,110\n,115,117,98,106,101,99,116,32,111,102,112,97,115,115,101,110,103,101,114,115,112\n,111,115,115,101,115,115,105,111,110,46,10,10,73,110,32,116,104,101,32,66,101,\n102,111,114,101,32,116,104,101,97,102,116,101,114,119,97,114,100,115,99,117,114,\n114,101,110,116,108,121,32,97,99,114,111,115,115,32,116,104,101,115,99,105,101,\n110,116,105,102,105,99,99,111,109,109,117,110,105,116,121,46,99,97,112,105,116,\n97,108,105,115,109,105,110,32,71,101,114,109,97,110,121,114,105,103,104,116,45,\n119,105,110,103,116,104,101,32,115,121,115,116,101,109,83,111,99,105,101,116,121\n,32,111,102,112,111,108,105,116,105,99,105,97,110,100,105,114,101,99,116,105,111\n,110,58,119,101,110,116,32,111,110,32,116,111,114,101,109,111,118,97,108,32,111,\n102,32,78,101,119,32,89,111,114,107,32,97,112,97,114,116,109,101,110,116,115,105\n,110,100,105,99,97,116,105,111,110,100,117,114,105,110,103,32,116,104,101,117,\n110,108,101,115,115,32,116,104,101,104,105,115,116,111,114,105,99,97,108,104,97,\n100,32,98,101,101,110,32,97,100,101,102,105,110,105,116,105,118,101,105,110,103,\n114,101,100,105,101,110,116,97,116,116,101,110,100,97,110,99,101,67,101,110,116,\n101,114,32,102,111,114,112,114,111,109,105,110,101,110,99,101,114,101,97,100,121\n,83,116,97,116,101,115,116,114,97,116,101,103,105,101,115,98,117,116,32,105,110,\n32,116,104,101,97,115,32,112,97,114,116,32,111,102,99,111,110,115,116,105,116,\n117,116,101,99,108,97,105,109,32,116,104,97,116,108,97,98,111,114,97,116,111,114\n,121,99,111,109,112,97,116,105,98,108,101,102,97,105,108,117,114,101,32,111,102,\n44,32,115,117,99,104,32,97,115,32,98,101,103,97,110,32,119,105,116,104,117,115,\n105,110,103,32,116,104,101,32,116,111,32,112,114,111,118,105,100,101,102,101,97,\n116,117,114,101,32,111,102,102,114,111,109,32,119,104,105,99,104,47,34,32,99,108\n,97,115,115,61,34,103,101,111,108,111,103,105,99,97,108,115,101,118,101,114,97,\n108,32,111,102,100,101,108,105,98,101,114,97,116,101,105,109,112,111,114,116,97,\n110,116,32,104,111,108,100,115,32,116,104,97,116,105,110,103,38,113,117,111,116,\n59,32,118,97,108,105,103,110,61,116,111,112,116,104,101,32,71,101,114,109,97,110\n,111,117,116,115,105,100,101,32,111,102,110,101,103,111,116,105,97,116,101,100,\n104,105,115,32,99,97,114,101,101,114,115,101,112,97,114,97,116,105,111,110,105,\n100,61,34,115,101,97,114,99,104,119,97,115,32,99,97,108,108,101,100,116,104,101,\n32,102,111,117,114,116,104,114,101,99,114,101,97,116,105,111,110,111,116,104,101\n,114,32,116,104,97,110,112,114,101,118,101,110,116,105,111,110,119,104,105,108,\n101,32,116,104,101,32,101,100,117,99,97,116,105,111,110,44,99,111,110,110,101,99\n,116,105,110,103,97,99,99,117,114,97,116,101,108,121,119,101,114,101,32,98,117,\n105,108,116,119,97,115,32,107,105,108,108,101,100,97,103,114,101,101,109,101,110\n,116,115,109,117,99,104,32,109,111,114,101,32,68,117,101,32,116,111,32,116,104,\n101,119,105,100,116,104,58,32,49,48,48,115,111,109,101,32,111,116,104,101,114,75\n,105,110,103,100,111,109,32,111,102,116,104,101,32,101,110,116,105,114,101,102,\n97,109,111,117,115,32,102,111,114,116,111,32,99,111,110,110,101,99,116,111,98,\n106,101,99,116,105,118,101,115,116,104,101,32,70,114,101,110,99,104,112,101,111,\n112,108,101,32,97,110,100,102,101,97,116,117,114,101,100,34,62,105,115,32,115,97\n,105,100,32,116,111,115,116,114,117,99,116,117,114,97,108,114,101,102,101,114,\n101,110,100,117,109,109,111,115,116,32,111,102,116,101,110,97,32,115,101,112,97,\n114,97,116,101,45,62,10,60,100,105,118,32,105,100,32,79,102,102,105,99,105,97,\n108,32,119,111,114,108,100,119,105,100,101,46,97,114,105,97,45,108,97,98,101,108\n,116,104,101,32,112,108,97,110,101,116,97,110,100,32,105,116,32,119,97,115,100,\n34,32,118,97,108,117,101,61,34,108,111,111,107,105,110,103,32,97,116,98,101,110,\n101,102,105,99,105,97,108,97,114,101,32,105,110,32,116,104,101,109,111,110,105,\n116,111,114,105,110,103,114,101,112,111,114,116,101,100,108,121,116,104,101,32,\n109,111,100,101,114,110,119,111,114,107,105,110,103,32,111,110,97,108,108,111,\n119,101,100,32,116,111,119,104,101,114,101,32,116,104,101,32,105,110,110,111,118\n,97,116,105,118,101,60,47,97,62,60,47,100,105,118,62,115,111,117,110,100,116,114\n,97,99,107,115,101,97,114,99,104,70,111,114,109,116,101,110,100,32,116,111,32,98\n,101,105,110,112,117,116,32,105,100,61,34,111,112,101,110,105,110,103,32,111,102\n,114,101,115,116,114,105,99,116,101,100,97,100,111,112,116,101,100,32,98,121,97,\n100,100,114,101,115,115,105,110,103,116,104,101,111,108,111,103,105,97,110,109,\n101,116,104,111,100,115,32,111,102,118,97,114,105,97,110,116,32,111,102,67,104,\n114,105,115,116,105,97,110,32,118,101,114,121,32,108,97,114,103,101,97,117,116,\n111,109,111,116,105,118,101,98,121,32,102,97,114,32,116,104,101,114,97,110,103,\n101,32,102,114,111,109,112,117,114,115,117,105,116,32,111,102,102,111,108,108,\n111,119,32,116,104,101,98,114,111,117,103,104,116,32,116,111,105,110,32,69,110,\n103,108,97,110,100,97,103,114,101,101,32,116,104,97,116,97,99,99,117,115,101,100\n,32,111,102,99,111,109,101,115,32,102,114,111,109,112,114,101,118,101,110,116,\n105,110,103,100,105,118,32,115,116,121,108,101,61,104,105,115,32,111,114,32,104,\n101,114,116,114,101,109,101,110,100,111,117,115,102,114,101,101,100,111,109,32,\n111,102,99,111,110,99,101,114,110,105,110,103,48,32,49,101,109,32,49,101,109,59,\n66,97,115,107,101,116,98,97,108,108,47,115,116,121,108,101,46,99,115,115,97,110,\n32,101,97,114,108,105,101,114,101,118,101,110,32,97,102,116,101,114,47,34,32,116\n,105,116,108,101,61,34,46,99,111,109,47,105,110,100,101,120,116,97,107,105,110,\n103,32,116,104,101,112,105,116,116,115,98,117,114,103,104,99,111,110,116,101,110\n,116,34,62,13,60,115,99,114,105,112,116,62,40,102,116,117,114,110,101,100,32,111\n,117,116,104,97,118,105,110,103,32,116,104,101,60,47,115,112,97,110,62,13,10,32,\n111,99,99,97,115,105,111,110,97,108,98,101,99,97,117,115,101,32,105,116,115,116,\n97,114,116,101,100,32,116,111,112,104,121,115,105,99,97,108,108,121,62,60,47,100\n,105,118,62,10,32,32,99,114,101,97,116,101,100,32,98,121,67,117,114,114,101,110,\n116,108,121,44,32,98,103,99,111,108,111,114,61,34,116,97,98,105,110,100,101,120,\n61,34,100,105,115,97,115,116,114,111,117,115,65,110,97,108,121,116,105,99,115,32\n,97,108,115,111,32,104,97,115,32,97,62,60,100,105,118,32,105,100,61,34,60,47,115\n,116,121,108,101,62,10,60,99,97,108,108,101,100,32,102,111,114,115,105,110,103,\n101,114,32,97,110,100,46,115,114,99,32,61,32,34,47,47,118,105,111,108,97,116,105\n,111,110,115,116,104,105,115,32,112,111,105,110,116,99,111,110,115,116,97,110,\n116,108,121,105,115,32,108,111,99,97,116,101,100,114,101,99,111,114,100,105,110,\n103,115,100,32,102,114,111,109,32,116,104,101,110,101,100,101,114,108,97,110,100\n,115,112,111,114,116,117,103,117,195,170,115,215,162,215,145,215,168,215,153,215\n,170,217,129,216,167,216,177,216,179,219,140,100,101,115,97,114,114,111,108,108,\n111,99,111,109,101,110,116,97,114,105,111,101,100,117,99,97,99,105,195,179,110,\n115,101,112,116,105,101,109,98,114,101,114,101,103,105,115,116,114,97,100,111,\n100,105,114,101,99,99,105,195,179,110,117,98,105,99,97,99,105,195,179,110,112,\n117,98,108,105,99,105,100,97,100,114,101,115,112,117,101,115,116,97,115,114,101,\n115,117,108,116,97,100,111,115,105,109,112,111,114,116,97,110,116,101,114,101,\n115,101,114,118,97,100,111,115,97,114,116,195,173,99,117,108,111,115,100,105,102\n,101,114,101,110,116,101,115,115,105,103,117,105,101,110,116,101,115,114,101,112\n,195,186,98,108,105,99,97,115,105,116,117,97,99,105,195,179,110,109,105,110,105,\n115,116,101,114,105,111,112,114,105,118,97,99,105,100,97,100,100,105,114,101,99,\n116,111,114,105,111,102,111,114,109,97,99,105,195,179,110,112,111,98,108,97,99,\n105,195,179,110,112,114,101,115,105,100,101,110,116,101,99,111,110,116,101,110,\n105,100,111,115,97,99,99,101,115,111,114,105,111,115,116,101,99,104,110,111,114,\n97,116,105,112,101,114,115,111,110,97,108,101,115,99,97,116,101,103,111,114,195,\n173,97,101,115,112,101,99,105,97,108,101,115,100,105,115,112,111,110,105,98,108,\n101,97,99,116,117,97,108,105,100,97,100,114,101,102,101,114,101,110,99,105,97,\n118,97,108,108,97,100,111,108,105,100,98,105,98,108,105,111,116,101,99,97,114,\n101,108,97,99,105,111,110,101,115,99,97,108,101,110,100,97,114,105,111,112,111,\n108,195,173,116,105,99,97,115,97,110,116,101,114,105,111,114,101,115,100,111,99,\n117,109,101,110,116,111,115,110,97,116,117,114,97,108,101,122,97,109,97,116,101,\n114,105,97,108,101,115,100,105,102,101,114,101,110,99,105,97,101,99,111,110,195,\n179,109,105,99,97,116,114,97,110,115,112,111,114,116,101,114,111,100,114,195,173\n,103,117,101,122,112,97,114,116,105,99,105,112,97,114,101,110,99,117,101,110,116\n,114,97,110,100,105,115,99,117,115,105,195,179,110,101,115,116,114,117,99,116,\n117,114,97,102,117,110,100,97,99,105,195,179,110,102,114,101,99,117,101,110,116,\n101,115,112,101,114,109,97,110,101,110,116,101,116,111,116,97,108,109,101,110,\n116,101,208,188,208,190,208,182,208,189,208,190,208,177,209,131,208,180,208,181,\n209,130,208,188,208,190,208,182,208,181,209,130,208,178,209,128,208,181,208,188,\n209,143,209,130,208,176,208,186,208,182,208,181,209,135,209,130,208,190,208,177,\n209,139,208,177,208,190,208,187,208,181,208,181,208,190,209,135,208,181,208,189,\n209,140,209,141,209,130,208,190,208,179,208,190,208,186,208,190,208,179,208,180,\n208,176,208,191,208,190,209,129,208,187,208,181,208,178,209,129,208,181,208,179,\n208,190,209,129,208,176,208,185,209,130,208,181,209,135,208,181,209,128,208,181,\n208,183,208,188,208,190,208,179,209,131,209,130,209,129,208,176,208,185,209,130,\n208,176,208,182,208,184,208,183,208,189,208,184,208,188,208,181,208,182,208,180,\n209,131,208,177,209,131,208,180,209,131,209,130,208,159,208,190,208,184,209,129,\n208,186,208,183,208,180,208,181,209,129,209,140,208,178,208,184,208,180,208,181,\n208,190,209,129,208,178,209,143,208,183,208,184,208,189,209,131,208,182,208,189,\n208,190,209,129,208,178,208,190,208,181,208,185,208,187,209,142,208,180,208,181,\n208,185,208,191,208,190,209,128,208,189,208,190,208,188,208,189,208,190,208,179,\n208,190,208,180,208,181,209,130,208,181,208,185,209,129,208,178,208,190,208,184,\n209,133,208,191,209,128,208,176,208,178,208,176,209,130,208,176,208,186,208,190,\n208,185,208,188,208,181,209,129,209,130,208,190,208,184,208,188,208,181,208,181,\n209,130,208,182,208,184,208,183,208,189,209,140,208,190,208,180,208,189,208,190,\n208,185,208,187,209,131,209,135,209,136,208,181,208,191,208,181,209,128,208,181,\n208,180,209,135,208,176,209,129,209,130,208,184,209,135,208,176,209,129,209,130,\n209,140,209,128,208,176,208,177,208,190,209,130,208,189,208,190,208,178,209,139,\n209,133,208,191,209,128,208,176,208,178,208,190,209,129,208,190,208,177,208,190,\n208,185,208,191,208,190,209,130,208,190,208,188,208,188,208,181,208,189,208,181,\n208,181,209,135,208,184,209,129,208,187,208,181,208,189,208,190,208,178,209,139,\n208,181,209,131,209,129,208,187,209,131,208,179,208,190,208,186,208,190,208,187,\n208,190,208,189,208,176,208,183,208,176,208,180,209,130,208,176,208,186,208,190,\n208,181,209,130,208,190,208,179,208,180,208,176,208,191,208,190,209,135,209,130,\n208,184,208,159,208,190,209,129,208,187,208,181,209,130,208,176,208,186,208,184,\n208,181,208,189,208,190,208,178,209,139,208,185,209,129,209,130,208,190,208,184,\n209,130,209,130,208,176,208,186,208,184,209,133,209,129,209,128,208,176,208,183,\n209,131,208,161,208,176,208,189,208,186,209,130,209,132,208,190,209,128,209,131,\n208,188,208,154,208,190,208,179,208,180,208,176,208,186,208,189,208,184,208,179,\n208,184,209,129,208,187,208,190,208,178,208,176,208,189,208,176,209,136,208,181,\n208,185,208,189,208,176,208,185,209,130,208,184,209,129,208,178,208,190,208,184,\n208,188,209,129,208,178,209,143,208,183,209,140,208,187,209,142,208,177,208,190,\n208,185,209,135,208,176,209,129,209,130,208,190,209,129,209,128,208,181,208,180,\n208,184,208,154,209,128,208,190,208,188,208,181,208,164,208,190,209,128,209,131,\n208,188,209,128,209,139,208,189,208,186,208,181,209,129,209,130,208,176,208,187,\n208,184,208,191,208,190,208,184,209,129,208,186,209,130,209,139,209,129,209,143,\n209,135,208,188,208,181,209,129,209,143,209,134,209,134,208,181,208,189,209,130,\n209,128,209,130,209,128,209,131,208,180,208,176,209,129,208,176,208,188,209,139,\n209,133,209,128,209,139,208,189,208,186,208,176,208,157,208,190,208,178,209,139,\n208,185,209,135,208,176,209,129,208,190,208,178,208,188,208,181,209,129,209,130,\n208,176,209,132,208,184,208,187,209,140,208,188,208,188,208,176,209,128,209,130,\n208,176,209,129,209,130,209,128,208,176,208,189,208,188,208,181,209,129,209,130,\n208,181,209,130,208,181,208,186,209,129,209,130,208,189,208,176,209,136,208,184,\n209,133,208,188,208,184,208,189,209,131,209,130,208,184,208,188,208,181,208,189,\n208,184,208,184,208,188,208,181,209,142,209,130,208,189,208,190,208,188,208,181,\n209,128,208,179,208,190,209,128,208,190,208,180,209,129,208,176,208,188,208,190,\n208,188,209,141,209,130,208,190,208,188,209,131,208,186,208,190,208,189,209,134,\n208,181,209,129,208,178,208,190,208,181,208,188,208,186,208,176,208,186,208,190,\n208,185,208,144,209,128,209,133,208,184,208,178,217,133,217,134,216,170,216,175,\n217,137,216,165,216,177,216,179,216,167,217,132,216,177,216,179,216,167,217,132,\n216,169,216,167,217,132,216,185,216,167,217,133,217,131,216,170,216,168,217,135,\n216,167,216,168,216,177,216,167,217,133,216,172,216,167,217,132,217,138,217,136,\n217,133,216,167,217,132,216,181,217,136,216,177,216,172,216,175,217,138,216,175,\n216,169,216,167,217,132,216,185,216,182,217,136,216,165,216,182,216,167,217,129,\n216,169,216,167,217,132,217,130,216,179,217,133,216,167,217,132,216,185,216,167,\n216,168,216,170,216,173,217,133,217,138,217,132,217,133,217,132,217,129,216,167,\n216,170,217,133,217,132,216,170,217,130,217,137,216,170,216,185,216,175,217,138,\n217,132,216,167,217,132,216,180,216,185,216,177,216,163,216,174,216,168,216,167,\n216,177,216,170,216,183,217,136,217,138,216,177,216,185,217,132,217,138,217,131,\n217,133,216,165,216,177,217,129,216,167,217,130,216,183,217,132,216,168,216,167,\n216,170,216,167,217,132,217,132,216,186,216,169,216,170,216,177,216,170,217,138,\n216,168,216,167,217,132,217,134,216,167,216,179,216,167,217,132,216,180,217,138,\n216,174,217,133,217,134,216,170,216,175,217,138,216,167,217,132,216,185,216,177,\n216,168,216,167,217,132,217,130,216,181,216,181,216,167,217,129,217,132,216,167,\n217,133,216,185,217,132,217,138,217,135,216,167,216,170,216,173,216,175,217,138,\n216,171,216,167,217,132,217,132,217,135,217,133,216,167,217,132,216,185,217,133,\n217,132,217,133,217,131,216,170,216,168,216,169,217,138,217,133,217,131,217,134,\n217,131,216,167,217,132,216,183,217,129,217,132,217,129,217,138,216,175,217,138,\n217,136,216,165,216,175,216,167,216,177,216,169,216,170,216,167,216,177,217,138,\n216,174,216,167,217,132,216,181,216,173,216,169,216,170,216,179,216,172,217,138,\n217,132,216,167,217,132,217,136,217,130,216,170,216,185,217,134,216,175,217,133,\n216,167,217,133,216,175,217,138,217,134,216,169,216,170,216,181,217,133,217,138,\n217,133,216,163,216,177,216,180,217,138,217,129,216,167,217,132,216,176,217,138,\n217,134,216,185,216,177,216,168,217,138,216,169,216,168,217,136,216,167,216,168,\n216,169,216,163,217,132,216,185,216,167,216,168,216,167,217,132,216,179,217,129,\n216,177,217,133,216,180,216,167,217,131,217,132,216,170,216,185,216,167,217,132,\n217,137,216,167,217,132,216,163,217,136,217,132,216,167,217,132,216,179,217,134,\n216,169,216,172,216,167,217,133,216,185,216,169,216,167,217,132,216,181,216,173,\n217,129,216,167,217,132,216,175,217,138,217,134,217,131,217,132,217,133,216,167,\n216,170,216,167,217,132,216,174,216,167,216,181,216,167,217,132,217,133,217,132,\n217,129,216,163,216,185,216,182,216,167,216,161,217,131,216,170,216,167,216,168,\n216,169,216,167,217,132,216,174,217,138,216,177,216,177,216,179,216,167,216,166,\n217,132,216,167,217,132,217,130,217,132,216,168,216,167,217,132,216,163,216,175,\n216,168,217,133,217,130,216,167,216,183,216,185,217,133,216,177,216,167,216,179,\n217,132,217,133,217,134,216,183,217,130,216,169,216,167,217,132,217,131,216,170,\n216,168,216,167,217,132,216,177,216,172,217,132,216,167,216,180,216,170,216,177,\n217,131,216,167,217,132,217,130,216,175,217,133,217,138,216,185,216,183,217,138,\n217,131,115,66,121,84,97,103,78,97,109,101,40,46,106,112,103,34,32,97,108,116,61\n,34,49,112,120,32,115,111,108,105,100,32,35,46,103,105,102,34,32,97,108,116,61,\n34,116,114,97,110,115,112,97,114,101,110,116,105,110,102,111,114,109,97,116,105,\n111,110,97,112,112,108,105,99,97,116,105,111,110,34,32,111,110,99,108,105,99,107\n,61,34,101,115,116,97,98,108,105,115,104,101,100,97,100,118,101,114,116,105,115,\n105,110,103,46,112,110,103,34,32,97,108,116,61,34,101,110,118,105,114,111,110,\n109,101,110,116,112,101,114,102,111,114,109,97,110,99,101,97,112,112,114,111,112\n,114,105,97,116,101,38,97,109,112,59,109,100,97,115,104,59,105,109,109,101,100,\n105,97,116,101,108,121,60,47,115,116,114,111,110,103,62,60,47,114,97,116,104,101\n,114,32,116,104,97,110,116,101,109,112,101,114,97,116,117,114,101,100,101,118,\n101,108,111,112,109,101,110,116,99,111,109,112,101,116,105,116,105,111,110,112,\n108,97,99,101,104,111,108,100,101,114,118,105,115,105,98,105,108,105,116,121,58,\n99,111,112,121,114,105,103,104,116,34,62,48,34,32,104,101,105,103,104,116,61,34,\n101,118,101,110,32,116,104,111,117,103,104,114,101,112,108,97,99,101,109,101,110\n,116,100,101,115,116,105,110,97,116,105,111,110,67,111,114,112,111,114,97,116,\n105,111,110,60,117,108,32,99,108,97,115,115,61,34,65,115,115,111,99,105,97,116,\n105,111,110,105,110,100,105,118,105,100,117,97,108,115,112,101,114,115,112,101,\n99,116,105,118,101,115,101,116,84,105,109,101,111,117,116,40,117,114,108,40,104,\n116,116,112,58,47,47,109,97,116,104,101,109,97,116,105,99,115,109,97,114,103,105\n,110,45,116,111,112,58,101,118,101,110,116,117,97,108,108,121,32,100,101,115,99,\n114,105,112,116,105,111,110,41,32,110,111,45,114,101,112,101,97,116,99,111,108,\n108,101,99,116,105,111,110,115,46,74,80,71,124,116,104,117,109,98,124,112,97,114\n,116,105,99,105,112,97,116,101,47,104,101,97,100,62,60,98,111,100,121,102,108,\n111,97,116,58,108,101,102,116,59,60,108,105,32,99,108,97,115,115,61,34,104,117,\n110,100,114,101,100,115,32,111,102,10,10,72,111,119,101,118,101,114,44,32,99,111\n,109,112,111,115,105,116,105,111,110,99,108,101,97,114,58,98,111,116,104,59,99,\n111,111,112,101,114,97,116,105,111,110,119,105,116,104,105,110,32,116,104,101,32\n,108,97,98,101,108,32,102,111,114,61,34,98,111,114,100,101,114,45,116,111,112,58\n,78,101,119,32,90,101,97,108,97,110,100,114,101,99,111,109,109,101,110,100,101,\n100,112,104,111,116,111,103,114,97,112,104,121,105,110,116,101,114,101,115,116,\n105,110,103,38,108,116,59,115,117,112,38,103,116,59,99,111,110,116,114,111,118,\n101,114,115,121,78,101,116,104,101,114,108,97,110,100,115,97,108,116,101,114,110\n,97,116,105,118,101,109,97,120,108,101,110,103,116,104,61,34,115,119,105,116,122\n,101,114,108,97,110,100,68,101,118,101,108,111,112,109,101,110,116,101,115,115,\n101,110,116,105,97,108,108,121,10,10,65,108,116,104,111,117,103,104,32,60,47,116\n,101,120,116,97,114,101,97,62,116,104,117,110,100,101,114,98,105,114,100,114,101\n,112,114,101,115,101,110,116,101,100,38,97,109,112,59,110,100,97,115,104,59,115,\n112,101,99,117,108,97,116,105,111,110,99,111,109,109,117,110,105,116,105,101,115\n,108,101,103,105,115,108,97,116,105,111,110,101,108,101,99,116,114,111,110,105,\n99,115,10,9,60,100,105,118,32,105,100,61,34,105,108,108,117,115,116,114,97,116,\n101,100,101,110,103,105,110,101,101,114,105,110,103,116,101,114,114,105,116,111,\n114,105,101,115,97,117,116,104,111,114,105,116,105,101,115,100,105,115,116,114,\n105,98,117,116,101,100,54,34,32,104,101,105,103,104,116,61,34,115,97,110,115,45,\n115,101,114,105,102,59,99,97,112,97,98,108,101,32,111,102,32,100,105,115,97,112,\n112,101,97,114,101,100,105,110,116,101,114,97,99,116,105,118,101,108,111,111,107\n,105,110,103,32,102,111,114,105,116,32,119,111,117,108,100,32,98,101,65,102,103,\n104,97,110,105,115,116,97,110,119,97,115,32,99,114,101,97,116,101,100,77,97,116,\n104,46,102,108,111,111,114,40,115,117,114,114,111,117,110,100,105,110,103,99,97,\n110,32,97,108,115,111,32,98,101,111,98,115,101,114,118,97,116,105,111,110,109,97\n,105,110,116,101,110,97,110,99,101,101,110,99,111,117,110,116,101,114,101,100,60\n,104,50,32,99,108,97,115,115,61,34,109,111,114,101,32,114,101,99,101,110,116,105\n,116,32,104,97,115,32,98,101,101,110,105,110,118,97,115,105,111,110,32,111,102,\n41,46,103,101,116,84,105,109,101,40,41,102,117,110,100,97,109,101,110,116,97,108\n,68,101,115,112,105,116,101,32,116,104,101,34,62,60,100,105,118,32,105,100,61,34\n,105,110,115,112,105,114,97,116,105,111,110,101,120,97,109,105,110,97,116,105,\n111,110,112,114,101,112,97,114,97,116,105,111,110,101,120,112,108,97,110,97,116,\n105,111,110,60,105,110,112,117,116,32,105,100,61,34,60,47,97,62,60,47,115,112,97\n,110,62,118,101,114,115,105,111,110,115,32,111,102,105,110,115,116,114,117,109,\n101,110,116,115,98,101,102,111,114,101,32,116,104,101,32,32,61,32,39,104,116,116\n,112,58,47,47,68,101,115,99,114,105,112,116,105,111,110,114,101,108,97,116,105,\n118,101,108,121,32,46,115,117,98,115,116,114,105,110,103,40,101,97,99,104,32,111\n,102,32,116,104,101,101,120,112,101,114,105,109,101,110,116,115,105,110,102,108,\n117,101,110,116,105,97,108,105,110,116,101,103,114,97,116,105,111,110,109,97,110\n,121,32,112,101,111,112,108,101,100,117,101,32,116,111,32,116,104,101,32,99,111,\n109,98,105,110,97,116,105,111,110,100,111,32,110,111,116,32,104,97,118,101,77,\n105,100,100,108,101,32,69,97,115,116,60,110,111,115,99,114,105,112,116,62,60,99,\n111,112,121,114,105,103,104,116,34,32,112,101,114,104,97,112,115,32,116,104,101,\n105,110,115,116,105,116,117,116,105,111,110,105,110,32,68,101,99,101,109,98,101,\n114,97,114,114,97,110,103,101,109,101,110,116,109,111,115,116,32,102,97,109,111,\n117,115,112,101,114,115,111,110,97,108,105,116,121,99,114,101,97,116,105,111,110\n,32,111,102,108,105,109,105,116,97,116,105,111,110,115,101,120,99,108,117,115,\n105,118,101,108,121,115,111,118,101,114,101,105,103,110,116,121,45,99,111,110,\n116,101,110,116,34,62,10,60,116,100,32,99,108,97,115,115,61,34,117,110,100,101,\n114,103,114,111,117,110,100,112,97,114,97,108,108,101,108,32,116,111,100,111,99,\n116,114,105,110,101,32,111,102,111,99,99,117,112,105,101,100,32,98,121,116,101,\n114,109,105,110,111,108,111,103,121,82,101,110,97,105,115,115,97,110,99,101,97,\n32,110,117,109,98,101,114,32,111,102,115,117,112,112,111,114,116,32,102,111,114,\n101,120,112,108,111,114,97,116,105,111,110,114,101,99,111,103,110,105,116,105,\n111,110,112,114,101,100,101,99,101,115,115,111,114,60,105,109,103,32,115,114,99,\n61,34,47,60,104,49,32,99,108,97,115,115,61,34,112,117,98,108,105,99,97,116,105,\n111,110,109,97,121,32,97,108,115,111,32,98,101,115,112,101,99,105,97,108,105,122\n,101,100,60,47,102,105,101,108,100,115,101,116,62,112,114,111,103,114,101,115,\n115,105,118,101,109,105,108,108,105,111,110,115,32,111,102,115,116,97,116,101,\n115,32,116,104,97,116,101,110,102,111,114,99,101,109,101,110,116,97,114,111,117,\n110,100,32,116,104,101,32,111,110,101,32,97,110,111,116,104,101,114,46,112,97,\n114,101,110,116,78,111,100,101,97,103,114,105,99,117,108,116,117,114,101,65,108,\n116,101,114,110,97,116,105,118,101,114,101,115,101,97,114,99,104,101,114,115,116\n,111,119,97,114,100,115,32,116,104,101,77,111,115,116,32,111,102,32,116,104,101,\n109,97,110,121,32,111,116,104,101,114,32,40,101,115,112,101,99,105,97,108,108,\n121,60,116,100,32,119,105,100,116,104,61,34,59,119,105,100,116,104,58,49,48,48,\n37,105,110,100,101,112,101,110,100,101,110,116,60,104,51,32,99,108,97,115,115,61\n,34,32,111,110,99,104,97,110,103,101,61,34,41,46,97,100,100,67,108,97,115,115,40\n,105,110,116,101,114,97,99,116,105,111,110,79,110,101,32,111,102,32,116,104,101,\n32,100,97,117,103,104,116,101,114,32,111,102,97,99,99,101,115,115,111,114,105,\n101,115,98,114,97,110,99,104,101,115,32,111,102,13,10,60,100,105,118,32,105,100,\n61,34,116,104,101,32,108,97,114,103,101,115,116,100,101,99,108,97,114,97,116,105\n,111,110,114,101,103,117,108,97,116,105,111,110,115,73,110,102,111,114,109,97,\n116,105,111,110,116,114,97,110,115,108,97,116,105,111,110,100,111,99,117,109,101\n,110,116,97,114,121,105,110,32,111,114,100,101,114,32,116,111,34,62,10,60,104,\n101,97,100,62,10,60,34,32,104,101,105,103,104,116,61,34,49,97,99,114,111,115,115\n,32,116,104,101,32,111,114,105,101,110,116,97,116,105,111,110,41,59,60,47,115,99\n,114,105,112,116,62,105,109,112,108,101,109,101,110,116,101,100,99,97,110,32,98,\n101,32,115,101,101,110,116,104,101,114,101,32,119,97,115,32,97,100,101,109,111,\n110,115,116,114,97,116,101,99,111,110,116,97,105,110,101,114,34,62,99,111,110,\n110,101,99,116,105,111,110,115,116,104,101,32,66,114,105,116,105,115,104,119,97,\n115,32,119,114,105,116,116,101,110,33,105,109,112,111,114,116,97,110,116,59,112,\n120,59,32,109,97,114,103,105,110,45,102,111,108,108,111,119,101,100,32,98,121,97\n,98,105,108,105,116,121,32,116,111,32,99,111,109,112,108,105,99,97,116,101,100,\n100,117,114,105,110,103,32,116,104,101,32,105,109,109,105,103,114,97,116,105,111\n,110,97,108,115,111,32,99,97,108,108,101,100,60,104,52,32,99,108,97,115,115,61,\n34,100,105,115,116,105,110,99,116,105,111,110,114,101,112,108,97,99,101,100,32,\n98,121,103,111,118,101,114,110,109,101,110,116,115,108,111,99,97,116,105,111,110\n,32,111,102,105,110,32,78,111,118,101,109,98,101,114,119,104,101,116,104,101,114\n,32,116,104,101,60,47,112,62,10,60,47,100,105,118,62,97,99,113,117,105,115,105,\n116,105,111,110,99,97,108,108,101,100,32,116,104,101,32,112,101,114,115,101,99,\n117,116,105,111,110,100,101,115,105,103,110,97,116,105,111,110,123,102,111,110,\n116,45,115,105,122,101,58,97,112,112,101,97,114,101,100,32,105,110,105,110,118,\n101,115,116,105,103,97,116,101,101,120,112,101,114,105,101,110,99,101,100,109,\n111,115,116,32,108,105,107,101,108,121,119,105,100,101,108,121,32,117,115,101,\n100,100,105,115,99,117,115,115,105,111,110,115,112,114,101,115,101,110,99,101,32\n,111,102,32,40,100,111,99,117,109,101,110,116,46,101,120,116,101,110,115,105,118\n,101,108,121,73,116,32,104,97,115,32,98,101,101,110,105,116,32,100,111,101,115,\n32,110,111,116,99,111,110,116,114,97,114,121,32,116,111,105,110,104,97,98,105,\n116,97,110,116,115,105,109,112,114,111,118,101,109,101,110,116,115,99,104,111,\n108,97,114,115,104,105,112,99,111,110,115,117,109,112,116,105,111,110,105,110,\n115,116,114,117,99,116,105,111,110,102,111,114,32,101,120,97,109,112,108,101,111\n,110,101,32,111,114,32,109,111,114,101,112,120,59,32,112,97,100,100,105,110,103,\n116,104,101,32,99,117,114,114,101,110,116,97,32,115,101,114,105,101,115,32,111,\n102,97,114,101,32,117,115,117,97,108,108,121,114,111,108,101,32,105,110,32,116,\n104,101,112,114,101,118,105,111,117,115,108,121,32,100,101,114,105,118,97,116,\n105,118,101,115,101,118,105,100,101,110,99,101,32,111,102,101,120,112,101,114,\n105,101,110,99,101,115,99,111,108,111,114,115,99,104,101,109,101,115,116,97,116,\n101,100,32,116,104,97,116,99,101,114,116,105,102,105,99,97,116,101,60,47,97,62,\n60,47,100,105,118,62,10,32,115,101,108,101,99,116,101,100,61,34,104,105,103,104,\n32,115,99,104,111,111,108,114,101,115,112,111,110,115,101,32,116,111,99,111,109,\n102,111,114,116,97,98,108,101,97,100,111,112,116,105,111,110,32,111,102,116,104,\n114,101,101,32,121,101,97,114,115,116,104,101,32,99,111,117,110,116,114,121,105,\n110,32,70,101,98,114,117,97,114,121,115,111,32,116,104,97,116,32,116,104,101,112\n,101,111,112,108,101,32,119,104,111,32,112,114,111,118,105,100,101,100,32,98,121\n,60,112,97,114,97,109,32,110,97,109,101,97,102,102,101,99,116,101,100,32,98,121,\n105,110,32,116,101,114,109,115,32,111,102,97,112,112,111,105,110,116,109,101,110\n,116,73,83,79,45,56,56,53,57,45,49,34,119,97,115,32,98,111,114,110,32,105,110,\n104,105,115,116,111,114,105,99,97,108,32,114,101,103,97,114,100,101,100,32,97,\n115,109,101,97,115,117,114,101,109,101,110,116,105,115,32,98,97,115,101,100,32,\n111,110,32,97,110,100,32,111,116,104,101,114,32,58,32,102,117,110,99,116,105,111\n,110,40,115,105,103,110,105,102,105,99,97,110,116,99,101,108,101,98,114,97,116,\n105,111,110,116,114,97,110,115,109,105,116,116,101,100,47,106,115,47,106,113,117\n,101,114,121,46,105,115,32,107,110,111,119,110,32,97,115,116,104,101,111,114,101\n,116,105,99,97,108,32,116,97,98,105,110,100,101,120,61,34,105,116,32,99,111,117,\n108,100,32,98,101,60,110,111,115,99,114,105,112,116,62,10,104,97,118,105,110,103\n,32,98,101,101,110,13,10,60,104,101,97,100,62,13,10,60,32,38,113,117,111,116,59,\n84,104,101,32,99,111,109,112,105,108,97,116,105,111,110,104,101,32,104,97,100,32\n,98,101,101,110,112,114,111,100,117,99,101,100,32,98,121,112,104,105,108,111,115\n,111,112,104,101,114,99,111,110,115,116,114,117,99,116,101,100,105,110,116,101,\n110,100,101,100,32,116,111,97,109,111,110,103,32,111,116,104,101,114,99,111,109,\n112,97,114,101,100,32,116,111,116,111,32,115,97,121,32,116,104,97,116,69,110,103\n,105,110,101,101,114,105,110,103,97,32,100,105,102,102,101,114,101,110,116,114,\n101,102,101,114,114,101,100,32,116,111,100,105,102,102,101,114,101,110,99,101,\n115,98,101,108,105,101,102,32,116,104,97,116,112,104,111,116,111,103,114,97,112,\n104,115,105,100,101,110,116,105,102,121,105,110,103,72,105,115,116,111,114,121,\n32,111,102,32,82,101,112,117,98,108,105,99,32,111,102,110,101,99,101,115,115,97,\n114,105,108,121,112,114,111,98,97,98,105,108,105,116,121,116,101,99,104,110,105,\n99,97,108,108,121,108,101,97,118,105,110,103,32,116,104,101,115,112,101,99,116,\n97,99,117,108,97,114,102,114,97,99,116,105,111,110,32,111,102,101,108,101,99,116\n,114,105,99,105,116,121,104,101,97,100,32,111,102,32,116,104,101,114,101,115,116\n,97,117,114,97,110,116,115,112,97,114,116,110,101,114,115,104,105,112,101,109,\n112,104,97,115,105,115,32,111,110,109,111,115,116,32,114,101,99,101,110,116,115,\n104,97,114,101,32,119,105,116,104,32,115,97,121,105,110,103,32,116,104,97,116,\n102,105,108,108,101,100,32,119,105,116,104,100,101,115,105,103,110,101,100,32,\n116,111,105,116,32,105,115,32,111,102,116,101,110,34,62,60,47,105,102,114,97,109\n,101,62,97,115,32,102,111,108,108,111,119,115,58,109,101,114,103,101,100,32,119,\n105,116,104,116,104,114,111,117,103,104,32,116,104,101,99,111,109,109,101,114,99\n,105,97,108,32,112,111,105,110,116,101,100,32,111,117,116,111,112,112,111,114,\n116,117,110,105,116,121,118,105,101,119,32,111,102,32,116,104,101,114,101,113,\n117,105,114,101,109,101,110,116,100,105,118,105,115,105,111,110,32,111,102,112,\n114,111,103,114,97,109,109,105,110,103,104,101,32,114,101,99,101,105,118,101,100\n,115,101,116,73,110,116,101,114,118,97,108,34,62,60,47,115,112,97,110,62,60,47,\n105,110,32,78,101,119,32,89,111,114,107,97,100,100,105,116,105,111,110,97,108,32\n,99,111,109,112,114,101,115,115,105,111,110,10,10,60,100,105,118,32,105,100,61,\n34,105,110,99,111,114,112,111,114,97,116,101,59,60,47,115,99,114,105,112,116,62,\n60,97,116,116,97,99,104,69,118,101,110,116,98,101,99,97,109,101,32,116,104,101,\n32,34,32,116,97,114,103,101,116,61,34,95,99,97,114,114,105,101,100,32,111,117,\n116,83,111,109,101,32,111,102,32,116,104,101,115,99,105,101,110,99,101,32,97,110\n,100,116,104,101,32,116,105,109,101,32,111,102,67,111,110,116,97,105,110,101,114\n,34,62,109,97,105,110,116,97,105,110,105,110,103,67,104,114,105,115,116,111,112,\n104,101,114,77,117,99,104,32,111,102,32,116,104,101,119,114,105,116,105,110,103,\n115,32,111,102,34,32,104,101,105,103,104,116,61,34,50,115,105,122,101,32,111,102\n,32,116,104,101,118,101,114,115,105,111,110,32,111,102,32,109,105,120,116,117,\n114,101,32,111,102,32,98,101,116,119,101,101,110,32,116,104,101,69,120,97,109,\n112,108,101,115,32,111,102,101,100,117,99,97,116,105,111,110,97,108,99,111,109,\n112,101,116,105,116,105,118,101,32,111,110,115,117,98,109,105,116,61,34,100,105,\n114,101,99,116,111,114,32,111,102,100,105,115,116,105,110,99,116,105,118,101,47,\n68,84,68,32,88,72,84,77,76,32,114,101,108,97,116,105,110,103,32,116,111,116,101,\n110,100,101,110,99,121,32,116,111,112,114,111,118,105,110,99,101,32,111,102,119,\n104,105,99,104,32,119,111,117,108,100,100,101,115,112,105,116,101,32,116,104,101\n,115,99,105,101,110,116,105,102,105,99,32,108,101,103,105,115,108,97,116,117,114\n,101,46,105,110,110,101,114,72,84,77,76,32,97,108,108,101,103,97,116,105,111,110\n,115,65,103,114,105,99,117,108,116,117,114,101,119,97,115,32,117,115,101,100,32,\n105,110,97,112,112,114,111,97,99,104,32,116,111,105,110,116,101,108,108,105,103,\n101,110,116,121,101,97,114,115,32,108,97,116,101,114,44,115,97,110,115,45,115,\n101,114,105,102,100,101,116,101,114,109,105,110,105,110,103,80,101,114,102,111,\n114,109,97,110,99,101,97,112,112,101,97,114,97,110,99,101,115,44,32,119,104,105,\n99,104,32,105,115,32,102,111,117,110,100,97,116,105,111,110,115,97,98,98,114,101\n,118,105,97,116,101,100,104,105,103,104,101,114,32,116,104,97,110,115,32,102,114\n,111,109,32,116,104,101,32,105,110,100,105,118,105,100,117,97,108,32,99,111,109,\n112,111,115,101,100,32,111,102,115,117,112,112,111,115,101,100,32,116,111,99,108\n,97,105,109,115,32,116,104,97,116,97,116,116,114,105,98,117,116,105,111,110,102,\n111,110,116,45,115,105,122,101,58,49,101,108,101,109,101,110,116,115,32,111,102,\n72,105,115,116,111,114,105,99,97,108,32,104,105,115,32,98,114,111,116,104,101,\n114,97,116,32,116,104,101,32,116,105,109,101,97,110,110,105,118,101,114,115,97,\n114,121,103,111,118,101,114,110,101,100,32,98,121,114,101,108,97,116,101,100,32,\n116,111,32,117,108,116,105,109,97,116,101,108,121,32,105,110,110,111,118,97,116,\n105,111,110,115,105,116,32,105,115,32,115,116,105,108,108,99,97,110,32,111,110,\n108,121,32,98,101,100,101,102,105,110,105,116,105,111,110,115,116,111,71,77,84,\n83,116,114,105,110,103,65,32,110,117,109,98,101,114,32,111,102,105,109,103,32,99\n,108,97,115,115,61,34,69,118,101,110,116,117,97,108,108,121,44,119,97,115,32,99,\n104,97,110,103,101,100,111,99,99,117,114,114,101,100,32,105,110,110,101,105,103,\n104,98,111,114,105,110,103,100,105,115,116,105,110,103,117,105,115,104,119,104,\n101,110,32,104,101,32,119,97,115,105,110,116,114,111,100,117,99,105,110,103,116,\n101,114,114,101,115,116,114,105,97,108,77,97,110,121,32,111,102,32,116,104,101,\n97,114,103,117,101,115,32,116,104,97,116,97,110,32,65,109,101,114,105,99,97,110,\n99,111,110,113,117,101,115,116,32,111,102,119,105,100,101,115,112,114,101,97,100\n,32,119,101,114,101,32,107,105,108,108,101,100,115,99,114,101,101,110,32,97,110,\n100,32,73,110,32,111,114,100,101,114,32,116,111,101,120,112,101,99,116,101,100,\n32,116,111,100,101,115,99,101,110,100,97,110,116,115,97,114,101,32,108,111,99,97\n,116,101,100,108,101,103,105,115,108,97,116,105,118,101,103,101,110,101,114,97,\n116,105,111,110,115,32,98,97,99,107,103,114,111,117,110,100,109,111,115,116,32,\n112,101,111,112,108,101,121,101,97,114,115,32,97,102,116,101,114,116,104,101,114\n,101,32,105,115,32,110,111,116,104,101,32,104,105,103,104,101,115,116,102,114,\n101,113,117,101,110,116,108,121,32,116,104,101,121,32,100,111,32,110,111,116,97,\n114,103,117,101,100,32,116,104,97,116,115,104,111,119,101,100,32,116,104,97,116,\n112,114,101,100,111,109,105,110,97,110,116,116,104,101,111,108,111,103,105,99,97\n,108,98,121,32,116,104,101,32,116,105,109,101,99,111,110,115,105,100,101,114,105\n,110,103,115,104,111,114,116,45,108,105,118,101,100,60,47,115,112,97,110,62,60,\n47,97,62,99,97,110,32,98,101,32,117,115,101,100,118,101,114,121,32,108,105,116,\n116,108,101,111,110,101,32,111,102,32,116,104,101,32,104,97,100,32,97,108,114,\n101,97,100,121,105,110,116,101,114,112,114,101,116,101,100,99,111,109,109,117,\n110,105,99,97,116,101,102,101,97,116,117,114,101,115,32,111,102,103,111,118,101,\n114,110,109,101,110,116,44,60,47,110,111,115,99,114,105,112,116,62,101,110,116,\n101,114,101,100,32,116,104,101,34,32,104,101,105,103,104,116,61,34,51,73,110,100\n,101,112,101,110,100,101,110,116,112,111,112,117,108,97,116,105,111,110,115,108,\n97,114,103,101,45,115,99,97,108,101,46,32,65,108,116,104,111,117,103,104,32,117,\n115,101,100,32,105,110,32,116,104,101,100,101,115,116,114,117,99,116,105,111,110\n,112,111,115,115,105,98,105,108,105,116,121,115,116,97,114,116,105,110,103,32,\n105,110,116,119,111,32,111,114,32,109,111,114,101,101,120,112,114,101,115,115,\n105,111,110,115,115,117,98,111,114,100,105,110,97,116,101,108,97,114,103,101,114\n,32,116,104,97,110,104,105,115,116,111,114,121,32,97,110,100,60,47,111,112,116,\n105,111,110,62,13,10,67,111,110,116,105,110,101,110,116,97,108,101,108,105,109,\n105,110,97,116,105,110,103,119,105,108,108,32,110,111,116,32,98,101,112,114,97,\n99,116,105,99,101,32,111,102,105,110,32,102,114,111,110,116,32,111,102,115,105,\n116,101,32,111,102,32,116,104,101,101,110,115,117,114,101,32,116,104,97,116,116,\n111,32,99,114,101,97,116,101,32,97,109,105,115,115,105,115,115,105,112,112,105,\n112,111,116,101,110,116,105,97,108,108,121,111,117,116,115,116,97,110,100,105,\n110,103,98,101,116,116,101,114,32,116,104,97,110,119,104,97,116,32,105,115,32,\n110,111,119,115,105,116,117,97,116,101,100,32,105,110,109,101,116,97,32,110,97,\n109,101,61,34,84,114,97,100,105,116,105,111,110,97,108,115,117,103,103,101,115,\n116,105,111,110,115,84,114,97,110,115,108,97,116,105,111,110,116,104,101,32,102,\n111,114,109,32,111,102,97,116,109,111,115,112,104,101,114,105,99,105,100,101,111\n,108,111,103,105,99,97,108,101,110,116,101,114,112,114,105,115,101,115,99,97,108\n,99,117,108,97,116,105,110,103,101,97,115,116,32,111,102,32,116,104,101,114,101,\n109,110,97,110,116,115,32,111,102,112,108,117,103,105,110,115,112,97,103,101,47,\n105,110,100,101,120,46,112,104,112,63,114,101,109,97,105,110,101,100,32,105,110,\n116,114,97,110,115,102,111,114,109,101,100,72,101,32,119,97,115,32,97,108,115,\n111,119,97,115,32,97,108,114,101,97,100,121,115,116,97,116,105,115,116,105,99,97\n,108,105,110,32,102,97,118,111,114,32,111,102,77,105,110,105,115,116,114,121,32,\n111,102,109,111,118,101,109,101,110,116,32,111,102,102,111,114,109,117,108,97,\n116,105,111,110,105,115,32,114,101,113,117,105,114,101,100,60,108,105,110,107,32\n,114,101,108,61,34,84,104,105,115,32,105,115,32,116,104,101,32,60,97,32,104,114,\n101,102,61,34,47,112,111,112,117,108,97,114,105,122,101,100,105,110,118,111,108,\n118,101,100,32,105,110,97,114,101,32,117,115,101,100,32,116,111,97,110,100,32,\n115,101,118,101,114,97,108,109,97,100,101,32,98,121,32,116,104,101,115,101,101,\n109,115,32,116,111,32,98,101,108,105,107,101,108,121,32,116,104,97,116,80,97,108\n,101,115,116,105,110,105,97,110,110,97,109,101,100,32,97,102,116,101,114,105,116\n,32,104,97,100,32,98,101,101,110,109,111,115,116,32,99,111,109,109,111,110,116,\n111,32,114,101,102,101,114,32,116,111,98,117,116,32,116,104,105,115,32,105,115,\n99,111,110,115,101,99,117,116,105,118,101,116,101,109,112,111,114,97,114,105,108\n,121,73,110,32,103,101,110,101,114,97,108,44,99,111,110,118,101,110,116,105,111,\n110,115,116,97,107,101,115,32,112,108,97,99,101,115,117,98,100,105,118,105,115,\n105,111,110,116,101,114,114,105,116,111,114,105,97,108,111,112,101,114,97,116,\n105,111,110,97,108,112,101,114,109,97,110,101,110,116,108,121,119,97,115,32,108,\n97,114,103,101,108,121,111,117,116,98,114,101,97,107,32,111,102,105,110,32,116,\n104,101,32,112,97,115,116,102,111,108,108,111,119,105,110,103,32,97,32,120,109,\n108,110,115,58,111,103,61,34,62,60,97,32,99,108,97,115,115,61,34,99,108,97,115,\n115,61,34,116,101,120,116,67,111,110,118,101,114,115,105,111,110,32,109,97,121,\n32,98,101,32,117,115,101,100,109,97,110,117,102,97,99,116,117,114,101,97,102,116\n,101,114,32,98,101,105,110,103,99,108,101,97,114,102,105,120,34,62,10,113,117,\n101,115,116,105,111,110,32,111,102,119,97,115,32,101,108,101,99,116,101,100,116,\n111,32,98,101,99,111,109,101,32,97,98,101,99,97,117,115,101,32,111,102,32,115,\n111,109,101,32,112,101,111,112,108,101,105,110,115,112,105,114,101,100,32,98,121\n,115,117,99,99,101,115,115,102,117,108,32,97,32,116,105,109,101,32,119,104,101,\n110,109,111,114,101,32,99,111,109,109,111,110,97,109,111,110,103,115,116,32,116,\n104,101,97,110,32,111,102,102,105,99,105,97,108,119,105,100,116,104,58,49,48,48,\n37,59,116,101,99,104,110,111,108,111,103,121,44,119,97,115,32,97,100,111,112,116\n,101,100,116,111,32,107,101,101,112,32,116,104,101,115,101,116,116,108,101,109,\n101,110,116,115,108,105,118,101,32,98,105,114,116,104,115,105,110,100,101,120,46\n,104,116,109,108,34,67,111,110,110,101,99,116,105,99,117,116,97,115,115,105,103,\n110,101,100,32,116,111,38,97,109,112,59,116,105,109,101,115,59,97,99,99,111,117,\n110,116,32,102,111,114,97,108,105,103,110,61,114,105,103,104,116,116,104,101,32,\n99,111,109,112,97,110,121,97,108,119,97,121,115,32,98,101,101,110,114,101,116,\n117,114,110,101,100,32,116,111,105,110,118,111,108,118,101,109,101,110,116,66,\n101,99,97,117,115,101,32,116,104,101,116,104,105,115,32,112,101,114,105,111,100,\n34,32,110,97,109,101,61,34,113,34,32,99,111,110,102,105,110,101,100,32,116,111,\n97,32,114,101,115,117,108,116,32,111,102,118,97,108,117,101,61,34,34,32,47,62,\n105,115,32,97,99,116,117,97,108,108,121,69,110,118,105,114,111,110,109,101,110,\n116,13,10,60,47,104,101,97,100,62,13,10,67,111,110,118,101,114,115,101,108,121,\n44,62,10,60,100,105,118,32,105,100,61,34,48,34,32,119,105,100,116,104,61,34,49,\n105,115,32,112,114,111,98,97,98,108,121,104,97,118,101,32,98,101,99,111,109,101,\n99,111,110,116,114,111,108,108,105,110,103,116,104,101,32,112,114,111,98,108,101\n,109,99,105,116,105,122,101,110,115,32,111,102,112,111,108,105,116,105,99,105,97\n,110,115,114,101,97,99,104,101,100,32,116,104,101,97,115,32,101,97,114,108,121,\n32,97,115,58,110,111,110,101,59,32,111,118,101,114,60,116,97,98,108,101,32,99,\n101,108,108,118,97,108,105,100,105,116,121,32,111,102,100,105,114,101,99,116,108\n,121,32,116,111,111,110,109,111,117,115,101,100,111,119,110,119,104,101,114,101,\n32,105,116,32,105,115,119,104,101,110,32,105,116,32,119,97,115,109,101,109,98,\n101,114,115,32,111,102,32,114,101,108,97,116,105,111,110,32,116,111,97,99,99,111\n,109,109,111,100,97,116,101,97,108,111,110,103,32,119,105,116,104,32,73,110,32,\n116,104,101,32,108,97,116,101,116,104,101,32,69,110,103,108,105,115,104,100,101,\n108,105,99,105,111,117,115,34,62,116,104,105,115,32,105,115,32,110,111,116,116,\n104,101,32,112,114,101,115,101,110,116,105,102,32,116,104,101,121,32,97,114,101,\n97,110,100,32,102,105,110,97,108,108,121,97,32,109,97,116,116,101,114,32,111,102\n,13,10,9,60,47,100,105,118,62,13,10,13,10,60,47,115,99,114,105,112,116,62,102,97\n,115,116,101,114,32,116,104,97,110,109,97,106,111,114,105,116,121,32,111,102,97,\n102,116,101,114,32,119,104,105,99,104,99,111,109,112,97,114,97,116,105,118,101,\n116,111,32,109,97,105,110,116,97,105,110,105,109,112,114,111,118,101,32,116,104,\n101,97,119,97,114,100,101,100,32,116,104,101,101,114,34,32,99,108,97,115,115,61,\n34,102,114,97,109,101,98,111,114,100,101,114,114,101,115,116,111,114,97,116,105,\n111,110,105,110,32,116,104,101,32,115,97,109,101,97,110,97,108,121,115,105,115,\n32,111,102,116,104,101,105,114,32,102,105,114,115,116,68,117,114,105,110,103,32,\n116,104,101,32,99,111,110,116,105,110,101,110,116,97,108,115,101,113,117,101,110\n,99,101,32,111,102,102,117,110,99,116,105,111,110,40,41,123,102,111,110,116,45,\n115,105,122,101,58,32,119,111,114,107,32,111,110,32,116,104,101,60,47,115,99,114\n,105,112,116,62,10,60,98,101,103,105,110,115,32,119,105,116,104,106,97,118,97,\n115,99,114,105,112,116,58,99,111,110,115,116,105,116,117,101,110,116,119,97,115,\n32,102,111,117,110,100,101,100,101,113,117,105,108,105,98,114,105,117,109,97,115\n,115,117,109,101,32,116,104,97,116,105,115,32,103,105,118,101,110,32,98,121,110,\n101,101,100,115,32,116,111,32,98,101,99,111,111,114,100,105,110,97,116,101,115,\n116,104,101,32,118,97,114,105,111,117,115,97,114,101,32,112,97,114,116,32,111,\n102,111,110,108,121,32,105,110,32,116,104,101,115,101,99,116,105,111,110,115,32,\n111,102,105,115,32,97,32,99,111,109,109,111,110,116,104,101,111,114,105,101,115,\n32,111,102,100,105,115,99,111,118,101,114,105,101,115,97,115,115,111,99,105,97,\n116,105,111,110,101,100,103,101,32,111,102,32,116,104,101,115,116,114,101,110,\n103,116,104,32,111,102,112,111,115,105,116,105,111,110,32,105,110,112,114,101,\n115,101,110,116,45,100,97,121,117,110,105,118,101,114,115,97,108,108,121,116,111\n,32,102,111,114,109,32,116,104,101,98,117,116,32,105,110,115,116,101,97,100,99,\n111,114,112,111,114,97,116,105,111,110,97,116,116,97,99,104,101,100,32,116,111,\n105,115,32,99,111,109,109,111,110,108,121,114,101,97,115,111,110,115,32,102,111,\n114,32,38,113,117,111,116,59,116,104,101,32,99,97,110,32,98,101,32,109,97,100,\n101,119,97,115,32,97,98,108,101,32,116,111,119,104,105,99,104,32,109,101,97,110,\n115,98,117,116,32,100,105,100,32,110,111,116,111,110,77,111,117,115,101,79,118,\n101,114,97,115,32,112,111,115,115,105,98,108,101,111,112,101,114,97,116,101,100,\n32,98,121,99,111,109,105,110,103,32,102,114,111,109,116,104,101,32,112,114,105,\n109,97,114,121,97,100,100,105,116,105,111,110,32,111,102,102,111,114,32,115,101,\n118,101,114,97,108,116,114,97,110,115,102,101,114,114,101,100,97,32,112,101,114,\n105,111,100,32,111,102,97,114,101,32,97,98,108,101,32,116,111,104,111,119,101,\n118,101,114,44,32,105,116,115,104,111,117,108,100,32,104,97,118,101,109,117,99,\n104,32,108,97,114,103,101,114,10,9,60,47,115,99,114,105,112,116,62,97,100,111,\n112,116,101,100,32,116,104,101,112,114,111,112,101,114,116,121,32,111,102,100,\n105,114,101,99,116,101,100,32,98,121,101,102,102,101,99,116,105,118,101,108,121,\n119,97,115,32,98,114,111,117,103,104,116,99,104,105,108,100,114,101,110,32,111,\n102,80,114,111,103,114,97,109,109,105,110,103,108,111,110,103,101,114,32,116,104\n,97,110,109,97,110,117,115,99,114,105,112,116,115,119,97,114,32,97,103,97,105,\n110,115,116,98,121,32,109,101,97,110,115,32,111,102,97,110,100,32,109,111,115,\n116,32,111,102,115,105,109,105,108,97,114,32,116,111,32,112,114,111,112,114,105,\n101,116,97,114,121,111,114,105,103,105,110,97,116,105,110,103,112,114,101,115,\n116,105,103,105,111,117,115,103,114,97,109,109,97,116,105,99,97,108,101,120,112,\n101,114,105,101,110,99,101,46,116,111,32,109,97,107,101,32,116,104,101,73,116,32\n,119,97,115,32,97,108,115,111,105,115,32,102,111,117,110,100,32,105,110,99,111,\n109,112,101,116,105,116,111,114,115,105,110,32,116,104,101,32,85,46,83,46,114,\n101,112,108,97,99,101,32,116,104,101,98,114,111,117,103,104,116,32,116,104,101,\n99,97,108,99,117,108,97,116,105,111,110,102,97,108,108,32,111,102,32,116,104,101\n,116,104,101,32,103,101,110,101,114,97,108,112,114,97,99,116,105,99,97,108,108,\n121,105,110,32,104,111,110,111,114,32,111,102,114,101,108,101,97,115,101,100,32,\n105,110,114,101,115,105,100,101,110,116,105,97,108,97,110,100,32,115,111,109,101\n,32,111,102,107,105,110,103,32,111,102,32,116,104,101,114,101,97,99,116,105,111,\n110,32,116,111,49,115,116,32,69,97,114,108,32,111,102,99,117,108,116,117,114,101\n,32,97,110,100,112,114,105,110,99,105,112,97,108,108,121,60,47,116,105,116,108,\n101,62,10,32,32,116,104,101,121,32,99,97,110,32,98,101,98,97,99,107,32,116,111,\n32,116,104,101,115,111,109,101,32,111,102,32,104,105,115,101,120,112,111,115,117\n,114,101,32,116,111,97,114,101,32,115,105,109,105,108,97,114,102,111,114,109,32,\n111,102,32,116,104,101,97,100,100,70,97,118,111,114,105,116,101,99,105,116,105,\n122,101,110,115,104,105,112,112,97,114,116,32,105,110,32,116,104,101,112,101,111\n,112,108,101,32,119,105,116,104,105,110,32,112,114,97,99,116,105,99,101,116,111,\n32,99,111,110,116,105,110,117,101,38,97,109,112,59,109,105,110,117,115,59,97,112\n,112,114,111,118,101,100,32,98,121,32,116,104,101,32,102,105,114,115,116,32,97,\n108,108,111,119,101,100,32,116,104,101,97,110,100,32,102,111,114,32,116,104,101,\n102,117,110,99,116,105,111,110,105,110,103,112,108,97,121,105,110,103,32,116,104\n,101,115,111,108,117,116,105,111,110,32,116,111,104,101,105,103,104,116,61,34,48\n,34,32,105,110,32,104,105,115,32,98,111,111,107,109,111,114,101,32,116,104,97,\n110,32,97,102,111,108,108,111,119,115,32,116,104,101,99,114,101,97,116,101,100,\n32,116,104,101,112,114,101,115,101,110,99,101,32,105,110,38,110,98,115,112,59,60\n,47,116,100,62,110,97,116,105,111,110,97,108,105,115,116,116,104,101,32,105,100,\n101,97,32,111,102,97,32,99,104,97,114,97,99,116,101,114,119,101,114,101,32,102,\n111,114,99,101,100,32,99,108,97,115,115,61,34,98,116,110,100,97,121,115,32,111,\n102,32,116,104,101,102,101,97,116,117,114,101,100,32,105,110,115,104,111,119,105\n,110,103,32,116,104,101,105,110,116,101,114,101,115,116,32,105,110,105,110,32,\n112,108,97,99,101,32,111,102,116,117,114,110,32,111,102,32,116,104,101,116,104,\n101,32,104,101,97,100,32,111,102,76,111,114,100,32,111,102,32,116,104,101,112,\n111,108,105,116,105,99,97,108,108,121,104,97,115,32,105,116,115,32,111,119,110,\n69,100,117,99,97,116,105,111,110,97,108,97,112,112,114,111,118,97,108,32,111,102\n,115,111,109,101,32,111,102,32,116,104,101,101,97,99,104,32,111,116,104,101,114,\n44,98,101,104,97,118,105,111,114,32,111,102,97,110,100,32,98,101,99,97,117,115,\n101,97,110,100,32,97,110,111,116,104,101,114,97,112,112,101,97,114,101,100,32,\n111,110,114,101,99,111,114,100,101,100,32,105,110,98,108,97,99,107,38,113,117,\n111,116,59,109,97,121,32,105,110,99,108,117,100,101,116,104,101,32,119,111,114,\n108,100,39,115,99,97,110,32,108,101,97,100,32,116,111,114,101,102,101,114,115,32\n,116,111,32,97,98,111,114,100,101,114,61,34,48,34,32,103,111,118,101,114,110,109\n,101,110,116,32,119,105,110,110,105,110,103,32,116,104,101,114,101,115,117,108,\n116,101,100,32,105,110,32,119,104,105,108,101,32,116,104,101,32,87,97,115,104,\n105,110,103,116,111,110,44,116,104,101,32,115,117,98,106,101,99,116,99,105,116,\n121,32,105,110,32,116,104,101,62,60,47,100,105,118,62,13,10,9,9,114,101,102,108,\n101,99,116,32,116,104,101,116,111,32,99,111,109,112,108,101,116,101,98,101,99,97\n,109,101,32,109,111,114,101,114,97,100,105,111,97,99,116,105,118,101,114,101,106\n,101,99,116,101,100,32,98,121,119,105,116,104,111,117,116,32,97,110,121,104,105,\n115,32,102,97,116,104,101,114,44,119,104,105,99,104,32,99,111,117,108,100,99,111\n,112,121,32,111,102,32,116,104,101,116,111,32,105,110,100,105,99,97,116,101,97,\n32,112,111,108,105,116,105,99,97,108,97,99,99,111,117,110,116,115,32,111,102,99,\n111,110,115,116,105,116,117,116,101,115,119,111,114,107,101,100,32,119,105,116,\n104,101,114,60,47,97,62,60,47,108,105,62,111,102,32,104,105,115,32,108,105,102,\n101,97,99,99,111,109,112,97,110,105,101,100,99,108,105,101,110,116,87,105,100,\n116,104,112,114,101,118,101,110,116,32,116,104,101,76,101,103,105,115,108,97,116\n,105,118,101,100,105,102,102,101,114,101,110,116,108,121,116,111,103,101,116,104\n,101,114,32,105,110,104,97,115,32,115,101,118,101,114,97,108,102,111,114,32,97,\n110,111,116,104,101,114,116,101,120,116,32,111,102,32,116,104,101,102,111,117,\n110,100,101,100,32,116,104,101,101,32,119,105,116,104,32,116,104,101,32,105,115,\n32,117,115,101,100,32,102,111,114,99,104,97,110,103,101,100,32,116,104,101,117,\n115,117,97,108,108,121,32,116,104,101,112,108,97,99,101,32,119,104,101,114,101,\n119,104,101,114,101,97,115,32,116,104,101,62,32,60,97,32,104,114,101,102,61,34,\n34,62,60,97,32,104,114,101,102,61,34,116,104,101,109,115,101,108,118,101,115,44,\n97,108,116,104,111,117,103,104,32,104,101,116,104,97,116,32,99,97,110,32,98,101,\n116,114,97,100,105,116,105,111,110,97,108,114,111,108,101,32,111,102,32,116,104,\n101,97,115,32,97,32,114,101,115,117,108,116,114,101,109,111,118,101,67,104,105,\n108,100,100,101,115,105,103,110,101,100,32,98,121,119,101,115,116,32,111,102,32,\n116,104,101,83,111,109,101,32,112,101,111,112,108,101,112,114,111,100,117,99,116\n,105,111,110,44,115,105,100,101,32,111,102,32,116,104,101,110,101,119,115,108,\n101,116,116,101,114,115,117,115,101,100,32,98,121,32,116,104,101,100,111,119,110\n,32,116,111,32,116,104,101,97,99,99,101,112,116,101,100,32,98,121,108,105,118,\n101,32,105,110,32,116,104,101,97,116,116,101,109,112,116,115,32,116,111,111,117,\n116,115,105,100,101,32,116,104,101,102,114,101,113,117,101,110,99,105,101,115,72\n,111,119,101,118,101,114,44,32,105,110,112,114,111,103,114,97,109,109,101,114,\n115,97,116,32,108,101,97,115,116,32,105,110,97,112,112,114,111,120,105,109,97,\n116,101,97,108,116,104,111,117,103,104,32,105,116,119,97,115,32,112,97,114,116,\n32,111,102,97,110,100,32,118,97,114,105,111,117,115,71,111,118,101,114,110,111,\n114,32,111,102,116,104,101,32,97,114,116,105,99,108,101,116,117,114,110,101,100,\n32,105,110,116,111,62,60,97,32,104,114,101,102,61,34,47,116,104,101,32,101,99,\n111,110,111,109,121,105,115,32,116,104,101,32,109,111,115,116,109,111,115,116,32\n,119,105,100,101,108,121,119,111,117,108,100,32,108,97,116,101,114,97,110,100,32\n,112,101,114,104,97,112,115,114,105,115,101,32,116,111,32,116,104,101,111,99,99,\n117,114,115,32,119,104,101,110,117,110,100,101,114,32,119,104,105,99,104,99,111,\n110,100,105,116,105,111,110,115,46,116,104,101,32,119,101,115,116,101,114,110,\n116,104,101,111,114,121,32,116,104,97,116,105,115,32,112,114,111,100,117,99,101,\n100,116,104,101,32,99,105,116,121,32,111,102,105,110,32,119,104,105,99,104,32,\n104,101,115,101,101,110,32,105,110,32,116,104,101,116,104,101,32,99,101,110,116,\n114,97,108,98,117,105,108,100,105,110,103,32,111,102,109,97,110,121,32,111,102,\n32,104,105,115,97,114,101,97,32,111,102,32,116,104,101,105,115,32,116,104,101,32\n,111,110,108,121,109,111,115,116,32,111,102,32,116,104,101,109,97,110,121,32,111\n,102,32,116,104,101,116,104,101,32,87,101,115,116,101,114,110,84,104,101,114,101\n,32,105,115,32,110,111,101,120,116,101,110,100,101,100,32,116,111,83,116,97,116,\n105,115,116,105,99,97,108,99,111,108,115,112,97,110,61,50,32,124,115,104,111,114\n,116,32,115,116,111,114,121,112,111,115,115,105,98,108,101,32,116,111,116,111,\n112,111,108,111,103,105,99,97,108,99,114,105,116,105,99,97,108,32,111,102,114,\n101,112,111,114,116,101,100,32,116,111,97,32,67,104,114,105,115,116,105,97,110,\n100,101,99,105,115,105,111,110,32,116,111,105,115,32,101,113,117,97,108,32,116,\n111,112,114,111,98,108,101,109,115,32,111,102,84,104,105,115,32,99,97,110,32,98,\n101,109,101,114,99,104,97,110,100,105,115,101,102,111,114,32,109,111,115,116,32,\n111,102,110,111,32,101,118,105,100,101,110,99,101,101,100,105,116,105,111,110,\n115,32,111,102,101,108,101,109,101,110,116,115,32,105,110,38,113,117,111,116,59,\n46,32,84,104,101,99,111,109,47,105,109,97,103,101,115,47,119,104,105,99,104,32,\n109,97,107,101,115,116,104,101,32,112,114,111,99,101,115,115,114,101,109,97,105,\n110,115,32,116,104,101,108,105,116,101,114,97,116,117,114,101,44,105,115,32,97,\n32,109,101,109,98,101,114,116,104,101,32,112,111,112,117,108,97,114,116,104,101,\n32,97,110,99,105,101,110,116,112,114,111,98,108,101,109,115,32,105,110,116,105,\n109,101,32,111,102,32,116,104,101,100,101,102,101,97,116,101,100,32,98,121,98,\n111,100,121,32,111,102,32,116,104,101,97,32,102,101,119,32,121,101,97,114,115,\n109,117,99,104,32,111,102,32,116,104,101,116,104,101,32,119,111,114,107,32,111,\n102,67,97,108,105,102,111,114,110,105,97,44,115,101,114,118,101,100,32,97,115,32\n,97,103,111,118,101,114,110,109,101,110,116,46,99,111,110,99,101,112,116,115,32,\n111,102,109,111,118,101,109,101,110,116,32,105,110,9,9,60,100,105,118,32,105,100\n,61,34,105,116,34,32,118,97,108,117,101,61,34,108,97,110,103,117,97,103,101,32,\n111,102,97,115,32,116,104,101,121,32,97,114,101,112,114,111,100,117,99,101,100,\n32,105,110,105,115,32,116,104,97,116,32,116,104,101,101,120,112,108,97,105,110,\n32,116,104,101,100,105,118,62,60,47,100,105,118,62,10,72,111,119,101,118,101,114\n,32,116,104,101,108,101,97,100,32,116,111,32,116,104,101,9,60,97,32,104,114,101,\n102,61,34,47,119,97,115,32,103,114,97,110,116,101,100,112,101,111,112,108,101,32\n,104,97,118,101,99,111,110,116,105,110,117,97,108,108,121,119,97,115,32,115,101,\n101,110,32,97,115,97,110,100,32,114,101,108,97,116,101,100,116,104,101,32,114,\n111,108,101,32,111,102,112,114,111,112,111,115,101,100,32,98,121,111,102,32,116,\n104,101,32,98,101,115,116,101,97,99,104,32,111,116,104,101,114,46,67,111,110,115\n,116,97,110,116,105,110,101,112,101,111,112,108,101,32,102,114,111,109,100,105,\n97,108,101,99,116,115,32,111,102,116,111,32,114,101,118,105,115,105,111,110,119,\n97,115,32,114,101,110,97,109,101,100,97,32,115,111,117,114,99,101,32,111,102,116\n,104,101,32,105,110,105,116,105,97,108,108,97,117,110,99,104,101,100,32,105,110,\n112,114,111,118,105,100,101,32,116,104,101,116,111,32,116,104,101,32,119,101,115\n,116,119,104,101,114,101,32,116,104,101,114,101,97,110,100,32,115,105,109,105,\n108,97,114,98,101,116,119,101,101,110,32,116,119,111,105,115,32,97,108,115,111,\n32,116,104,101,69,110,103,108,105,115,104,32,97,110,100,99,111,110,100,105,116,\n105,111,110,115,44,116,104,97,116,32,105,116,32,119,97,115,101,110,116,105,116,\n108,101,100,32,116,111,116,104,101,109,115,101,108,118,101,115,46,113,117,97,110\n,116,105,116,121,32,111,102,114,97,110,115,112,97,114,101,110,99,121,116,104,101\n,32,115,97,109,101,32,97,115,116,111,32,106,111,105,110,32,116,104,101,99,111,\n117,110,116,114,121,32,97,110,100,116,104,105,115,32,105,115,32,116,104,101,84,\n104,105,115,32,108,101,100,32,116,111,97,32,115,116,97,116,101,109,101,110,116,\n99,111,110,116,114,97,115,116,32,116,111,108,97,115,116,73,110,100,101,120,79,\n102,116,104,114,111,117,103,104,32,104,105,115,105,115,32,100,101,115,105,103,\n110,101,100,116,104,101,32,116,101,114,109,32,105,115,105,115,32,112,114,111,118\n,105,100,101,100,112,114,111,116,101,99,116,32,116,104,101,110,103,60,47,97,62,\n60,47,108,105,62,84,104,101,32,99,117,114,114,101,110,116,116,104,101,32,115,105\n,116,101,32,111,102,115,117,98,115,116,97,110,116,105,97,108,101,120,112,101,114\n,105,101,110,99,101,44,105,110,32,116,104,101,32,87,101,115,116,116,104,101,121,\n32,115,104,111,117,108,100,115,108,111,118,101,110,196,141,105,110,97,99,111,109\n,101,110,116,97,114,105,111,115,117,110,105,118,101,114,115,105,100,97,100,99,\n111,110,100,105,99,105,111,110,101,115,97,99,116,105,118,105,100,97,100,101,115,\n101,120,112,101,114,105,101,110,99,105,97,116,101,99,110,111,108,111,103,195,173\n,97,112,114,111,100,117,99,99,105,195,179,110,112,117,110,116,117,97,99,105,195,\n179,110,97,112,108,105,99,97,99,105,195,179,110,99,111,110,116,114,97,115,101,\n195,177,97,99,97,116,101,103,111,114,195,173,97,115,114,101,103,105,115,116,114,\n97,114,115,101,112,114,111,102,101,115,105,111,110,97,108,116,114,97,116,97,109,\n105,101,110,116,111,114,101,103,195,173,115,116,114,97,116,101,115,101,99,114,\n101,116,97,114,195,173,97,112,114,105,110,99,105,112,97,108,101,115,112,114,111,\n116,101,99,99,105,195,179,110,105,109,112,111,114,116,97,110,116,101,115,105,109\n,112,111,114,116,97,110,99,105,97,112,111,115,105,98,105,108,105,100,97,100,105,\n110,116,101,114,101,115,97,110,116,101,99,114,101,99,105,109,105,101,110,116,111\n,110,101,99,101,115,105,100,97,100,101,115,115,117,115,99,114,105,98,105,114,115\n,101,97,115,111,99,105,97,99,105,195,179,110,100,105,115,112,111,110,105,98,108,\n101,115,101,118,97,108,117,97,99,105,195,179,110,101,115,116,117,100,105,97,110,\n116,101,115,114,101,115,112,111,110,115,97,98,108,101,114,101,115,111,108,117,99\n,105,195,179,110,103,117,97,100,97,108,97,106,97,114,97,114,101,103,105,115,116,\n114,97,100,111,115,111,112,111,114,116,117,110,105,100,97,100,99,111,109,101,114\n,99,105,97,108,101,115,102,111,116,111,103,114,97,102,195,173,97,97,117,116,111,\n114,105,100,97,100,101,115,105,110,103,101,110,105,101,114,195,173,97,116,101,\n108,101,118,105,115,105,195,179,110,99,111,109,112,101,116,101,110,99,105,97,111\n,112,101,114,97,99,105,111,110,101,115,101,115,116,97,98,108,101,99,105,100,111,\n115,105,109,112,108,101,109,101,110,116,101,97,99,116,117,97,108,109,101,110,116\n,101,110,97,118,101,103,97,99,105,195,179,110,99,111,110,102,111,114,109,105,100\n,97,100,108,105,110,101,45,104,101,105,103,104,116,58,102,111,110,116,45,102,97,\n109,105,108,121,58,34,32,58,32,34,104,116,116,112,58,47,47,97,112,112,108,105,99\n,97,116,105,111,110,115,108,105,110,107,34,32,104,114,101,102,61,34,115,112,101,\n99,105,102,105,99,97,108,108,121,47,47,60,33,91,67,68,65,84,65,91,10,79,114,103,\n97,110,105,122,97,116,105,111,110,100,105,115,116,114,105,98,117,116,105,111,110\n,48,112,120,59,32,104,101,105,103,104,116,58,114,101,108,97,116,105,111,110,115,\n104,105,112,100,101,118,105,99,101,45,119,105,100,116,104,60,100,105,118,32,99,\n108,97,115,115,61,34,60,108,97,98,101,108,32,102,111,114,61,34,114,101,103,105,\n115,116,114,97,116,105,111,110,60,47,110,111,115,99,114,105,112,116,62,10,47,105\n,110,100,101,120,46,104,116,109,108,34,119,105,110,100,111,119,46,111,112,101,\n110,40,32,33,105,109,112,111,114,116,97,110,116,59,97,112,112,108,105,99,97,116,\n105,111,110,47,105,110,100,101,112,101,110,100,101,110,99,101,47,47,119,119,119,\n46,103,111,111,103,108,101,111,114,103,97,110,105,122,97,116,105,111,110,97,117,\n116,111,99,111,109,112,108,101,116,101,114,101,113,117,105,114,101,109,101,110,\n116,115,99,111,110,115,101,114,118,97,116,105,118,101,60,102,111,114,109,32,110,\n97,109,101,61,34,105,110,116,101,108,108,101,99,116,117,97,108,109,97,114,103,\n105,110,45,108,101,102,116,58,49,56,116,104,32,99,101,110,116,117,114,121,97,110\n,32,105,109,112,111,114,116,97,110,116,105,110,115,116,105,116,117,116,105,111,\n110,115,97,98,98,114,101,118,105,97,116,105,111,110,60,105,109,103,32,99,108,97,\n115,115,61,34,111,114,103,97,110,105,115,97,116,105,111,110,99,105,118,105,108,\n105,122,97,116,105,111,110,49,57,116,104,32,99,101,110,116,117,114,121,97,114,99\n,104,105,116,101,99,116,117,114,101,105,110,99,111,114,112,111,114,97,116,101,\n100,50,48,116,104,32,99,101,110,116,117,114,121,45,99,111,110,116,97,105,110,101\n,114,34,62,109,111,115,116,32,110,111,116,97,98,108,121,47,62,60,47,97,62,60,47,\n100,105,118,62,110,111,116,105,102,105,99,97,116,105,111,110,39,117,110,100,101,\n102,105,110,101,100,39,41,70,117,114,116,104,101,114,109,111,114,101,44,98,101,\n108,105,101,118,101,32,116,104,97,116,105,110,110,101,114,72,84,77,76,32,61,32,\n112,114,105,111,114,32,116,111,32,116,104,101,100,114,97,109,97,116,105,99,97,\n108,108,121,114,101,102,101,114,114,105,110,103,32,116,111,110,101,103,111,116,\n105,97,116,105,111,110,115,104,101,97,100,113,117,97,114,116,101,114,115,83,111,\n117,116,104,32,65,102,114,105,99,97,117,110,115,117,99,99,101,115,115,102,117,\n108,80,101,110,110,115,121,108,118,97,110,105,97,65,115,32,97,32,114,101,115,117\n,108,116,44,60,104,116,109,108,32,108,97,110,103,61,34,38,108,116,59,47,115,117,\n112,38,103,116,59,100,101,97,108,105,110,103,32,119,105,116,104,112,104,105,108,\n97,100,101,108,112,104,105,97,104,105,115,116,111,114,105,99,97,108,108,121,41,\n59,60,47,115,99,114,105,112,116,62,10,112,97,100,100,105,110,103,45,116,111,112,\n58,101,120,112,101,114,105,109,101,110,116,97,108,103,101,116,65,116,116,114,105\n,98,117,116,101,105,110,115,116,114,117,99,116,105,111,110,115,116,101,99,104,\n110,111,108,111,103,105,101,115,112,97,114,116,32,111,102,32,116,104,101,32,61,\n102,117,110,99,116,105,111,110,40,41,123,115,117,98,115,99,114,105,112,116,105,\n111,110,108,46,100,116,100,34,62,13,10,60,104,116,103,101,111,103,114,97,112,104\n,105,99,97,108,67,111,110,115,116,105,116,117,116,105,111,110,39,44,32,102,117,\n110,99,116,105,111,110,40,115,117,112,112,111,114,116,101,100,32,98,121,97,103,\n114,105,99,117,108,116,117,114,97,108,99,111,110,115,116,114,117,99,116,105,111,\n110,112,117,98,108,105,99,97,116,105,111,110,115,102,111,110,116,45,115,105,122,\n101,58,32,49,97,32,118,97,114,105,101,116,121,32,111,102,60,100,105,118,32,115,\n116,121,108,101,61,34,69,110,99,121,99,108,111,112,101,100,105,97,105,102,114,97\n,109,101,32,115,114,99,61,34,100,101,109,111,110,115,116,114,97,116,101,100,97,\n99,99,111,109,112,108,105,115,104,101,100,117,110,105,118,101,114,115,105,116,\n105,101,115,68,101,109,111,103,114,97,112,104,105,99,115,41,59,60,47,115,99,114,\n105,112,116,62,60,100,101,100,105,99,97,116,101,100,32,116,111,107,110,111,119,\n108,101,100,103,101,32,111,102,115,97,116,105,115,102,97,99,116,105,111,110,112,\n97,114,116,105,99,117,108,97,114,108,121,60,47,100,105,118,62,60,47,100,105,118,\n62,69,110,103,108,105,115,104,32,40,85,83,41,97,112,112,101,110,100,67,104,105,\n108,100,40,116,114,97,110,115,109,105,115,115,105,111,110,115,46,32,72,111,119,\n101,118,101,114,44,32,105,110,116,101,108,108,105,103,101,110,99,101,34,32,116,\n97,98,105,110,100,101,120,61,34,102,108,111,97,116,58,114,105,103,104,116,59,67,\n111,109,109,111,110,119,101,97,108,116,104,114,97,110,103,105,110,103,32,102,114\n,111,109,105,110,32,119,104,105,99,104,32,116,104,101,97,116,32,108,101,97,115,\n116,32,111,110,101,114,101,112,114,111,100,117,99,116,105,111,110,101,110,99,121\n,99,108,111,112,101,100,105,97,59,102,111,110,116,45,115,105,122,101,58,49,106,\n117,114,105,115,100,105,99,116,105,111,110,97,116,32,116,104,97,116,32,116,105,\n109,101,34,62,60,97,32,99,108,97,115,115,61,34,73,110,32,97,100,100,105,116,105,\n111,110,44,100,101,115,99,114,105,112,116,105,111,110,43,99,111,110,118,101,114,\n115,97,116,105,111,110,99,111,110,116,97,99,116,32,119,105,116,104,105,115,32,\n103,101,110,101,114,97,108,108,121,114,34,32,99,111,110,116,101,110,116,61,34,\n114,101,112,114,101,115,101,110,116,105,110,103,38,108,116,59,109,97,116,104,38,\n103,116,59,112,114,101,115,101,110,116,97,116,105,111,110,111,99,99,97,115,105,\n111,110,97,108,108,121,60,105,109,103,32,119,105,100,116,104,61,34,110,97,118,\n105,103,97,116,105,111,110,34,62,99,111,109,112,101,110,115,97,116,105,111,110,\n99,104,97,109,112,105,111,110,115,104,105,112,109,101,100,105,97,61,34,97,108,\n108,34,32,118,105,111,108,97,116,105,111,110,32,111,102,114,101,102,101,114,101,\n110,99,101,32,116,111,114,101,116,117,114,110,32,116,114,117,101,59,83,116,114,\n105,99,116,47,47,69,78,34,32,116,114,97,110,115,97,99,116,105,111,110,115,105,\n110,116,101,114,118,101,110,116,105,111,110,118,101,114,105,102,105,99,97,116,\n105,111,110,73,110,102,111,114,109,97,116,105,111,110,32,100,105,102,102,105,99,\n117,108,116,105,101,115,67,104,97,109,112,105,111,110,115,104,105,112,99,97,112,\n97,98,105,108,105,116,105,101,115,60,33,91,101,110,100,105,102,93,45,45,62,125,\n10,60,47,115,99,114,105,112,116,62,10,67,104,114,105,115,116,105,97,110,105,116,\n121,102,111,114,32,101,120,97,109,112,108,101,44,80,114,111,102,101,115,115,105,\n111,110,97,108,114,101,115,116,114,105,99,116,105,111,110,115,115,117,103,103,\n101,115,116,32,116,104,97,116,119,97,115,32,114,101,108,101,97,115,101,100,40,\n115,117,99,104,32,97,115,32,116,104,101,114,101,109,111,118,101,67,108,97,115,\n115,40,117,110,101,109,112,108,111,121,109,101,110,116,116,104,101,32,65,109,101\n,114,105,99,97,110,115,116,114,117,99,116,117,114,101,32,111,102,47,105,110,100,\n101,120,46,104,116,109,108,32,112,117,98,108,105,115,104,101,100,32,105,110,115,\n112,97,110,32,99,108,97,115,115,61,34,34,62,60,97,32,104,114,101,102,61,34,47,\n105,110,116,114,111,100,117,99,116,105,111,110,98,101,108,111,110,103,105,110,\n103,32,116,111,99,108,97,105,109,101,100,32,116,104,97,116,99,111,110,115,101,\n113,117,101,110,99,101,115,60,109,101,116,97,32,110,97,109,101,61,34,71,117,105,\n100,101,32,116,111,32,116,104,101,111,118,101,114,119,104,101,108,109,105,110,\n103,97,103,97,105,110,115,116,32,116,104,101,32,99,111,110,99,101,110,116,114,97\n,116,101,100,44,10,46,110,111,110,116,111,117,99,104,32,111,98,115,101,114,118,\n97,116,105,111,110,115,60,47,97,62,10,60,47,100,105,118,62,10,102,32,40,100,111,\n99,117,109,101,110,116,46,98,111,114,100,101,114,58,32,49,112,120,32,123,102,111\n,110,116,45,115,105,122,101,58,49,116,114,101,97,116,109,101,110,116,32,111,102,\n48,34,32,104,101,105,103,104,116,61,34,49,109,111,100,105,102,105,99,97,116,105,\n111,110,73,110,100,101,112,101,110,100,101,110,99,101,100,105,118,105,100,101,\n100,32,105,110,116,111,103,114,101,97,116,101,114,32,116,104,97,110,97,99,104,\n105,101,118,101,109,101,110,116,115,101,115,116,97,98,108,105,115,104,105,110,\n103,74,97,118,97,83,99,114,105,112,116,34,32,110,101,118,101,114,116,104,101,108\n,101,115,115,115,105,103,110,105,102,105,99,97,110,99,101,66,114,111,97,100,99,\n97,115,116,105,110,103,62,38,110,98,115,112,59,60,47,116,100,62,99,111,110,116,\n97,105,110,101,114,34,62,10,115,117,99,104,32,97,115,32,116,104,101,32,105,110,\n102,108,117,101,110,99,101,32,111,102,97,32,112,97,114,116,105,99,117,108,97,114\n,115,114,99,61,39,104,116,116,112,58,47,47,110,97,118,105,103,97,116,105,111,110\n,34,32,104,97,108,102,32,111,102,32,116,104,101,32,115,117,98,115,116,97,110,116\n,105,97,108,32,38,110,98,115,112,59,60,47,100,105,118,62,97,100,118,97,110,116,\n97,103,101,32,111,102,100,105,115,99,111,118,101,114,121,32,111,102,102,117,110,\n100,97,109,101,110,116,97,108,32,109,101,116,114,111,112,111,108,105,116,97,110,\n116,104,101,32,111,112,112,111,115,105,116,101,34,32,120,109,108,58,108,97,110,\n103,61,34,100,101,108,105,98,101,114,97,116,101,108,121,97,108,105,103,110,61,99\n,101,110,116,101,114,101,118,111,108,117,116,105,111,110,32,111,102,112,114,101,\n115,101,114,118,97,116,105,111,110,105,109,112,114,111,118,101,109,101,110,116,\n115,98,101,103,105,110,110,105,110,103,32,105,110,74,101,115,117,115,32,67,104,\n114,105,115,116,80,117,98,108,105,99,97,116,105,111,110,115,100,105,115,97,103,\n114,101,101,109,101,110,116,116,101,120,116,45,97,108,105,103,110,58,114,44,32,\n102,117,110,99,116,105,111,110,40,41,115,105,109,105,108,97,114,105,116,105,101,\n115,98,111,100,121,62,60,47,104,116,109,108,62,105,115,32,99,117,114,114,101,110\n,116,108,121,97,108,112,104,97,98,101,116,105,99,97,108,105,115,32,115,111,109,\n101,116,105,109,101,115,116,121,112,101,61,34,105,109,97,103,101,47,109,97,110,\n121,32,111,102,32,116,104,101,32,102,108,111,119,58,104,105,100,100,101,110,59,\n97,118,97,105,108,97,98,108,101,32,105,110,100,101,115,99,114,105,98,101,32,116,\n104,101,101,120,105,115,116,101,110,99,101,32,111,102,97,108,108,32,111,118,101,\n114,32,116,104,101,116,104,101,32,73,110,116,101,114,110,101,116,9,60,117,108,32\n,99,108,97,115,115,61,34,105,110,115,116,97,108,108,97,116,105,111,110,110,101,\n105,103,104,98,111,114,104,111,111,100,97,114,109,101,100,32,102,111,114,99,101,\n115,114,101,100,117,99,105,110,103,32,116,104,101,99,111,110,116,105,110,117,101\n,115,32,116,111,78,111,110,101,116,104,101,108,101,115,115,44,116,101,109,112,\n101,114,97,116,117,114,101,115,10,9,9,60,97,32,104,114,101,102,61,34,99,108,111,\n115,101,32,116,111,32,116,104,101,101,120,97,109,112,108,101,115,32,111,102,32,\n105,115,32,97,98,111,117,116,32,116,104,101,40,115,101,101,32,98,101,108,111,119\n,41,46,34,32,105,100,61,34,115,101,97,114,99,104,112,114,111,102,101,115,115,105\n,111,110,97,108,105,115,32,97,118,97,105,108,97,98,108,101,116,104,101,32,111,\n102,102,105,99,105,97,108,9,9,60,47,115,99,114,105,112,116,62,10,10,9,9,60,100,\n105,118,32,105,100,61,34,97,99,99,101,108,101,114,97,116,105,111,110,116,104,114\n,111,117,103,104,32,116,104,101,32,72,97,108,108,32,111,102,32,70,97,109,101,100\n,101,115,99,114,105,112,116,105,111,110,115,116,114,97,110,115,108,97,116,105,\n111,110,115,105,110,116,101,114,102,101,114,101,110,99,101,32,116,121,112,101,61\n,39,116,101,120,116,47,114,101,99,101,110,116,32,121,101,97,114,115,105,110,32,\n116,104,101,32,119,111,114,108,100,118,101,114,121,32,112,111,112,117,108,97,114\n,123,98,97,99,107,103,114,111,117,110,100,58,116,114,97,100,105,116,105,111,110,\n97,108,32,115,111,109,101,32,111,102,32,116,104,101,32,99,111,110,110,101,99,116\n,101,100,32,116,111,101,120,112,108,111,105,116,97,116,105,111,110,101,109,101,\n114,103,101,110,99,101,32,111,102,99,111,110,115,116,105,116,117,116,105,111,110\n,65,32,72,105,115,116,111,114,121,32,111,102,115,105,103,110,105,102,105,99,97,\n110,116,32,109,97,110,117,102,97,99,116,117,114,101,100,101,120,112,101,99,116,\n97,116,105,111,110,115,62,60,110,111,115,99,114,105,112,116,62,60,99,97,110,32,\n98,101,32,102,111,117,110,100,98,101,99,97,117,115,101,32,116,104,101,32,104,97,\n115,32,110,111,116,32,98,101,101,110,110,101,105,103,104,98,111,117,114,105,110,\n103,119,105,116,104,111,117,116,32,116,104,101,32,97,100,100,101,100,32,116,111,\n32,116,104,101,9,60,108,105,32,99,108,97,115,115,61,34,105,110,115,116,114,117,\n109,101,110,116,97,108,83,111,118,105,101,116,32,85,110,105,111,110,97,99,107,\n110,111,119,108,101,100,103,101,100,119,104,105,99,104,32,99,97,110,32,98,101,\n110,97,109,101,32,102,111,114,32,116,104,101,97,116,116,101,110,116,105,111,110,\n32,116,111,97,116,116,101,109,112,116,115,32,116,111,32,100,101,118,101,108,111,\n112,109,101,110,116,115,73,110,32,102,97,99,116,44,32,116,104,101,60,108,105,32,\n99,108,97,115,115,61,34,97,105,109,112,108,105,99,97,116,105,111,110,115,115,117\n,105,116,97,98,108,101,32,102,111,114,109,117,99,104,32,111,102,32,116,104,101,\n32,99,111,108,111,110,105,122,97,116,105,111,110,112,114,101,115,105,100,101,110\n,116,105,97,108,99,97,110,99,101,108,66,117,98,98,108,101,32,73,110,102,111,114,\n109,97,116,105,111,110,109,111,115,116,32,111,102,32,116,104,101,32,105,115,32,\n100,101,115,99,114,105,98,101,100,114,101,115,116,32,111,102,32,116,104,101,32,\n109,111,114,101,32,111,114,32,108,101,115,115,105,110,32,83,101,112,116,101,109,\n98,101,114,73,110,116,101,108,108,105,103,101,110,99,101,115,114,99,61,34,104,\n116,116,112,58,47,47,112,120,59,32,104,101,105,103,104,116,58,32,97,118,97,105,\n108,97,98,108,101,32,116,111,109,97,110,117,102,97,99,116,117,114,101,114,104,\n117,109,97,110,32,114,105,103,104,116,115,108,105,110,107,32,104,114,101,102,61,\n34,47,97,118,97,105,108,97,98,105,108,105,116,121,112,114,111,112,111,114,116,\n105,111,110,97,108,111,117,116,115,105,100,101,32,116,104,101,32,97,115,116,114,\n111,110,111,109,105,99,97,108,104,117,109,97,110,32,98,101,105,110,103,115,110,\n97,109,101,32,111,102,32,116,104,101,32,97,114,101,32,102,111,117,110,100,32,105\n,110,97,114,101,32,98,97,115,101,100,32,111,110,115,109,97,108,108,101,114,32,\n116,104,97,110,97,32,112,101,114,115,111,110,32,119,104,111,101,120,112,97,110,\n115,105,111,110,32,111,102,97,114,103,117,105,110,103,32,116,104,97,116,110,111,\n119,32,107,110,111,119,110,32,97,115,73,110,32,116,104,101,32,101,97,114,108,121\n,105,110,116,101,114,109,101,100,105,97,116,101,100,101,114,105,118,101,100,32,\n102,114,111,109,83,99,97,110,100,105,110,97,118,105,97,110,60,47,97,62,60,47,100\n,105,118,62,13,10,99,111,110,115,105,100,101,114,32,116,104,101,97,110,32,101,\n115,116,105,109,97,116,101,100,116,104,101,32,78,97,116,105,111,110,97,108,60,\n100,105,118,32,105,100,61,34,112,97,103,114,101,115,117,108,116,105,110,103,32,\n105,110,99,111,109,109,105,115,115,105,111,110,101,100,97,110,97,108,111,103,111\n,117,115,32,116,111,97,114,101,32,114,101,113,117,105,114,101,100,47,117,108,62,\n10,60,47,100,105,118,62,10,119,97,115,32,98,97,115,101,100,32,111,110,97,110,100\n,32,98,101,99,97,109,101,32,97,38,110,98,115,112,59,38,110,98,115,112,59,116,34,\n32,118,97,108,117,101,61,34,34,32,119,97,115,32,99,97,112,116,117,114,101,100,\n110,111,32,109,111,114,101,32,116,104,97,110,114,101,115,112,101,99,116,105,118,\n101,108,121,99,111,110,116,105,110,117,101,32,116,111,32,62,13,10,60,104,101,97,\n100,62,13,10,60,119,101,114,101,32,99,114,101,97,116,101,100,109,111,114,101,32,\n103,101,110,101,114,97,108,105,110,102,111,114,109,97,116,105,111,110,32,117,115\n,101,100,32,102,111,114,32,116,104,101,105,110,100,101,112,101,110,100,101,110,\n116,32,116,104,101,32,73,109,112,101,114,105,97,108,99,111,109,112,111,110,101,\n110,116,32,111,102,116,111,32,116,104,101,32,110,111,114,116,104,105,110,99,108,\n117,100,101,32,116,104,101,32,67,111,110,115,116,114,117,99,116,105,111,110,115,\n105,100,101,32,111,102,32,116,104,101,32,119,111,117,108,100,32,110,111,116,32,\n98,101,102,111,114,32,105,110,115,116,97,110,99,101,105,110,118,101,110,116,105,\n111,110,32,111,102,109,111,114,101,32,99,111,109,112,108,101,120,99,111,108,108,\n101,99,116,105,118,101,108,121,98,97,99,107,103,114,111,117,110,100,58,32,116,\n101,120,116,45,97,108,105,103,110,58,32,105,116,115,32,111,114,105,103,105,110,\n97,108,105,110,116,111,32,97,99,99,111,117,110,116,116,104,105,115,32,112,114,\n111,99,101,115,115,97,110,32,101,120,116,101,110,115,105,118,101,104,111,119,101\n,118,101,114,44,32,116,104,101,116,104,101,121,32,97,114,101,32,110,111,116,114,\n101,106,101,99,116,101,100,32,116,104,101,99,114,105,116,105,99,105,115,109,32,\n111,102,100,117,114,105,110,103,32,119,104,105,99,104,112,114,111,98,97,98,108,\n121,32,116,104,101,116,104,105,115,32,97,114,116,105,99,108,101,40,102,117,110,\n99,116,105,111,110,40,41,123,73,116,32,115,104,111,117,108,100,32,98,101,97,110,\n32,97,103,114,101,101,109,101,110,116,97,99,99,105,100,101,110,116,97,108,108,\n121,100,105,102,102,101,114,115,32,102,114,111,109,65,114,99,104,105,116,101,99,\n116,117,114,101,98,101,116,116,101,114,32,107,110,111,119,110,97,114,114,97,110,\n103,101,109,101,110,116,115,105,110,102,108,117,101,110,99,101,32,111,110,97,116\n,116,101,110,100,101,100,32,116,104,101,105,100,101,110,116,105,99,97,108,32,116\n,111,115,111,117,116,104,32,111,102,32,116,104,101,112,97,115,115,32,116,104,114\n,111,117,103,104,120,109,108,34,32,116,105,116,108,101,61,34,119,101,105,103,104\n,116,58,98,111,108,100,59,99,114,101,97,116,105,110,103,32,116,104,101,100,105,\n115,112,108,97,121,58,110,111,110,101,114,101,112,108,97,99,101,100,32,116,104,\n101,60,105,109,103,32,115,114,99,61,34,47,105,104,116,116,112,115,58,47,47,119,\n119,119,46,87,111,114,108,100,32,87,97,114,32,73,73,116,101,115,116,105,109,111,\n110,105,97,108,115,102,111,117,110,100,32,105,110,32,116,104,101,114,101,113,117\n,105,114,101,100,32,116,111,32,97,110,100,32,116,104,97,116,32,116,104,101,98,\n101,116,119,101,101,110,32,116,104,101,32,119,97,115,32,100,101,115,105,103,110,\n101,100,99,111,110,115,105,115,116,115,32,111,102,32,99,111,110,115,105,100,101,\n114,97,98,108,121,112,117,98,108,105,115,104,101,100,32,98,121,116,104,101,32,\n108,97,110,103,117,97,103,101,67,111,110,115,101,114,118,97,116,105,111,110,99,\n111,110,115,105,115,116,101,100,32,111,102,114,101,102,101,114,32,116,111,32,116\n,104,101,98,97,99,107,32,116,111,32,116,104,101,32,99,115,115,34,32,109,101,100,\n105,97,61,34,80,101,111,112,108,101,32,102,114,111,109,32,97,118,97,105,108,97,\n98,108,101,32,111,110,112,114,111,118,101,100,32,116,111,32,98,101,115,117,103,\n103,101,115,116,105,111,110,115,34,119,97,115,32,107,110,111,119,110,32,97,115,\n118,97,114,105,101,116,105,101,115,32,111,102,108,105,107,101,108,121,32,116,111\n,32,98,101,99,111,109,112,114,105,115,101,100,32,111,102,115,117,112,112,111,114\n,116,32,116,104,101,32,104,97,110,100,115,32,111,102,32,116,104,101,99,111,117,\n112,108,101,100,32,119,105,116,104,99,111,110,110,101,99,116,32,97,110,100,32,98\n,111,114,100,101,114,58,110,111,110,101,59,112,101,114,102,111,114,109,97,110,99\n,101,115,98,101,102,111,114,101,32,98,101,105,110,103,108,97,116,101,114,32,98,\n101,99,97,109,101,99,97,108,99,117,108,97,116,105,111,110,115,111,102,116,101,\n110,32,99,97,108,108,101,100,114,101,115,105,100,101,110,116,115,32,111,102,109,\n101,97,110,105,110,103,32,116,104,97,116,62,60,108,105,32,99,108,97,115,115,61,\n34,101,118,105,100,101,110,99,101,32,102,111,114,101,120,112,108,97,110,97,116,\n105,111,110,115,101,110,118,105,114,111,110,109,101,110,116,115,34,62,60,47,97,\n62,60,47,100,105,118,62,119,104,105,99,104,32,97,108,108,111,119,115,73,110,116,\n114,111,100,117,99,116,105,111,110,100,101,118,101,108,111,112,101,100,32,98,121\n,97,32,119,105,100,101,32,114,97,110,103,101,111,110,32,98,101,104,97,108,102,32\n,111,102,118,97,108,105,103,110,61,34,116,111,112,34,112,114,105,110,99,105,112,\n108,101,32,111,102,97,116,32,116,104,101,32,116,105,109,101,44,60,47,110,111,115\n,99,114,105,112,116,62,13,115,97,105,100,32,116,111,32,104,97,118,101,105,110,32\n,116,104,101,32,102,105,114,115,116,119,104,105,108,101,32,111,116,104,101,114,\n115,104,121,112,111,116,104,101,116,105,99,97,108,112,104,105,108,111,115,111,\n112,104,101,114,115,112,111,119,101,114,32,111,102,32,116,104,101,99,111,110,116\n,97,105,110,101,100,32,105,110,112,101,114,102,111,114,109,101,100,32,98,121,105\n,110,97,98,105,108,105,116,121,32,116,111,119,101,114,101,32,119,114,105,116,116\n,101,110,115,112,97,110,32,115,116,121,108,101,61,34,105,110,112,117,116,32,110,\n97,109,101,61,34,116,104,101,32,113,117,101,115,116,105,111,110,105,110,116,101,\n110,100,101,100,32,102,111,114,114,101,106,101,99,116,105,111,110,32,111,102,105\n,109,112,108,105,101,115,32,116,104,97,116,105,110,118,101,110,116,101,100,32,\n116,104,101,116,104,101,32,115,116,97,110,100,97,114,100,119,97,115,32,112,114,\n111,98,97,98,108,121,108,105,110,107,32,98,101,116,119,101,101,110,112,114,111,\n102,101,115,115,111,114,32,111,102,105,110,116,101,114,97,99,116,105,111,110,115\n,99,104,97,110,103,105,110,103,32,116,104,101,73,110,100,105,97,110,32,79,99,101\n,97,110,32,99,108,97,115,115,61,34,108,97,115,116,119,111,114,107,105,110,103,32\n,119,105,116,104,39,104,116,116,112,58,47,47,119,119,119,46,121,101,97,114,115,\n32,98,101,102,111,114,101,84,104,105,115,32,119,97,115,32,116,104,101,114,101,99\n,114,101,97,116,105,111,110,97,108,101,110,116,101,114,105,110,103,32,116,104,\n101,109,101,97,115,117,114,101,109,101,110,116,115,97,110,32,101,120,116,114,101\n,109,101,108,121,118,97,108,117,101,32,111,102,32,116,104,101,115,116,97,114,116\n,32,111,102,32,116,104,101,10,60,47,115,99,114,105,112,116,62,10,10,97,110,32,\n101,102,102,111,114,116,32,116,111,105,110,99,114,101,97,115,101,32,116,104,101,\n116,111,32,116,104,101,32,115,111,117,116,104,115,112,97,99,105,110,103,61,34,48\n,34,62,115,117,102,102,105,99,105,101,110,116,108,121,116,104,101,32,69,117,114,\n111,112,101,97,110,99,111,110,118,101,114,116,101,100,32,116,111,99,108,101,97,\n114,84,105,109,101,111,117,116,100,105,100,32,110,111,116,32,104,97,118,101,99,\n111,110,115,101,113,117,101,110,116,108,121,102,111,114,32,116,104,101,32,110,\n101,120,116,101,120,116,101,110,115,105,111,110,32,111,102,101,99,111,110,111,\n109,105,99,32,97,110,100,97,108,116,104,111,117,103,104,32,116,104,101,97,114,\n101,32,112,114,111,100,117,99,101,100,97,110,100,32,119,105,116,104,32,116,104,\n101,105,110,115,117,102,102,105,99,105,101,110,116,103,105,118,101,110,32,98,121\n,32,116,104,101,115,116,97,116,105,110,103,32,116,104,97,116,101,120,112,101,110\n,100,105,116,117,114,101,115,60,47,115,112,97,110,62,60,47,97,62,10,116,104,111,\n117,103,104,116,32,116,104,97,116,111,110,32,116,104,101,32,98,97,115,105,115,99\n,101,108,108,112,97,100,100,105,110,103,61,105,109,97,103,101,32,111,102,32,116,\n104,101,114,101,116,117,114,110,105,110,103,32,116,111,105,110,102,111,114,109,\n97,116,105,111,110,44,115,101,112,97,114,97,116,101,100,32,98,121,97,115,115,97,\n115,115,105,110,97,116,101,100,115,34,32,99,111,110,116,101,110,116,61,34,97,117\n,116,104,111,114,105,116,121,32,111,102,110,111,114,116,104,119,101,115,116,101,\n114,110,60,47,100,105,118,62,10,60,100,105,118,32,34,62,60,47,100,105,118,62,13,\n10,32,32,99,111,110,115,117,108,116,97,116,105,111,110,99,111,109,109,117,110,\n105,116,121,32,111,102,116,104,101,32,110,97,116,105,111,110,97,108,105,116,32,\n115,104,111,117,108,100,32,98,101,112,97,114,116,105,99,105,112,97,110,116,115,\n32,97,108,105,103,110,61,34,108,101,102,116,116,104,101,32,103,114,101,97,116,\n101,115,116,115,101,108,101,99,116,105,111,110,32,111,102,115,117,112,101,114,\n110,97,116,117,114,97,108,100,101,112,101,110,100,101,110,116,32,111,110,105,115\n,32,109,101,110,116,105,111,110,101,100,97,108,108,111,119,105,110,103,32,116,\n104,101,119,97,115,32,105,110,118,101,110,116,101,100,97,99,99,111,109,112,97,\n110,121,105,110,103,104,105,115,32,112,101,114,115,111,110,97,108,97,118,97,105,\n108,97,98,108,101,32,97,116,115,116,117,100,121,32,111,102,32,116,104,101,111,\n110,32,116,104,101,32,111,116,104,101,114,101,120,101,99,117,116,105,111,110,32,\n111,102,72,117,109,97,110,32,82,105,103,104,116,115,116,101,114,109,115,32,111,\n102,32,116,104,101,97,115,115,111,99,105,97,116,105,111,110,115,114,101,115,101,\n97,114,99,104,32,97,110,100,115,117,99,99,101,101,100,101,100,32,98,121,100,101,\n102,101,97,116,101,100,32,116,104,101,97,110,100,32,102,114,111,109,32,116,104,\n101,98,117,116,32,116,104,101,121,32,97,114,101,99,111,109,109,97,110,100,101,\n114,32,111,102,115,116,97,116,101,32,111,102,32,116,104,101,121,101,97,114,115,\n32,111,102,32,97,103,101,116,104,101,32,115,116,117,100,121,32,111,102,60,117,\n108,32,99,108,97,115,115,61,34,115,112,108,97,99,101,32,105,110,32,116,104,101,\n119,104,101,114,101,32,104,101,32,119,97,115,60,108,105,32,99,108,97,115,115,61,\n34,102,116,104,101,114,101,32,97,114,101,32,110,111,119,104,105,99,104,32,98,101\n,99,97,109,101,104,101,32,112,117,98,108,105,115,104,101,100,101,120,112,114,101\n,115,115,101,100,32,105,110,116,111,32,119,104,105,99,104,32,116,104,101,99,111,\n109,109,105,115,115,105,111,110,101,114,102,111,110,116,45,119,101,105,103,104,\n116,58,116,101,114,114,105,116,111,114,121,32,111,102,101,120,116,101,110,115,\n105,111,110,115,34,62,82,111,109,97,110,32,69,109,112,105,114,101,101,113,117,97\n,108,32,116,111,32,116,104,101,73,110,32,99,111,110,116,114,97,115,116,44,104,\n111,119,101,118,101,114,44,32,97,110,100,105,115,32,116,121,112,105,99,97,108,\n108,121,97,110,100,32,104,105,115,32,119,105,102,101,40,97,108,115,111,32,99,97,\n108,108,101,100,62,60,117,108,32,99,108,97,115,115,61,34,101,102,102,101,99,116,\n105,118,101,108,121,32,101,118,111,108,118,101,100,32,105,110,116,111,115,101,\n101,109,32,116,111,32,104,97,118,101,119,104,105,99,104,32,105,115,32,116,104,\n101,116,104,101,114,101,32,119,97,115,32,110,111,97,110,32,101,120,99,101,108,\n108,101,110,116,97,108,108,32,111,102,32,116,104,101,115,101,100,101,115,99,114,\n105,98,101,100,32,98,121,73,110,32,112,114,97,99,116,105,99,101,44,98,114,111,97\n,100,99,97,115,116,105,110,103,99,104,97,114,103,101,100,32,119,105,116,104,114,\n101,102,108,101,99,116,101,100,32,105,110,115,117,98,106,101,99,116,101,100,32,\n116,111,109,105,108,105,116,97,114,121,32,97,110,100,116,111,32,116,104,101,32,\n112,111,105,110,116,101,99,111,110,111,109,105,99,97,108,108,121,115,101,116,84,\n97,114,103,101,116,105,110,103,97,114,101,32,97,99,116,117,97,108,108,121,118,\n105,99,116,111,114,121,32,111,118,101,114,40,41,59,60,47,115,99,114,105,112,116,\n62,99,111,110,116,105,110,117,111,117,115,108,121,114,101,113,117,105,114,101,\n100,32,102,111,114,101,118,111,108,117,116,105,111,110,97,114,121,97,110,32,101,\n102,102,101,99,116,105,118,101,110,111,114,116,104,32,111,102,32,116,104,101,44,\n32,119,104,105,99,104,32,119,97,115,32,102,114,111,110,116,32,111,102,32,116,104\n,101,111,114,32,111,116,104,101,114,119,105,115,101,115,111,109,101,32,102,111,\n114,109,32,111,102,104,97,100,32,110,111,116,32,98,101,101,110,103,101,110,101,\n114,97,116,101,100,32,98,121,105,110,102,111,114,109,97,116,105,111,110,46,112,\n101,114,109,105,116,116,101,100,32,116,111,105,110,99,108,117,100,101,115,32,116\n,104,101,100,101,118,101,108,111,112,109,101,110,116,44,101,110,116,101,114,101,\n100,32,105,110,116,111,116,104,101,32,112,114,101,118,105,111,117,115,99,111,110\n,115,105,115,116,101,110,116,108,121,97,114,101,32,107,110,111,119,110,32,97,115\n,116,104,101,32,102,105,101,108,100,32,111,102,116,104,105,115,32,116,121,112,\n101,32,111,102,103,105,118,101,110,32,116,111,32,116,104,101,116,104,101,32,116,\n105,116,108,101,32,111,102,99,111,110,116,97,105,110,115,32,116,104,101,105,110,\n115,116,97,110,99,101,115,32,111,102,105,110,32,116,104,101,32,110,111,114,116,\n104,100,117,101,32,116,111,32,116,104,101,105,114,97,114,101,32,100,101,115,105,\n103,110,101,100,99,111,114,112,111,114,97,116,105,111,110,115,119,97,115,32,116,\n104,97,116,32,116,104,101,111,110,101,32,111,102,32,116,104,101,115,101,109,111,\n114,101,32,112,111,112,117,108,97,114,115,117,99,99,101,101,100,101,100,32,105,\n110,115,117,112,112,111,114,116,32,102,114,111,109,105,110,32,100,105,102,102,\n101,114,101,110,116,100,111,109,105,110,97,116,101,100,32,98,121,100,101,115,105\n,103,110,101,100,32,102,111,114,111,119,110,101,114,115,104,105,112,32,111,102,\n97,110,100,32,112,111,115,115,105,98,108,121,115,116,97,110,100,97,114,100,105,\n122,101,100,114,101,115,112,111,110,115,101,84,101,120,116,119,97,115,32,105,110\n,116,101,110,100,101,100,114,101,99,101,105,118,101,100,32,116,104,101,97,115,\n115,117,109,101,100,32,116,104,97,116,97,114,101,97,115,32,111,102,32,116,104,\n101,112,114,105,109,97,114,105,108,121,32,105,110,116,104,101,32,98,97,115,105,\n115,32,111,102,105,110,32,116,104,101,32,115,101,110,115,101,97,99,99,111,117,\n110,116,115,32,102,111,114,100,101,115,116,114,111,121,101,100,32,98,121,97,116,\n32,108,101,97,115,116,32,116,119,111,119,97,115,32,100,101,99,108,97,114,101,100\n,99,111,117,108,100,32,110,111,116,32,98,101,83,101,99,114,101,116,97,114,121,32\n,111,102,97,112,112,101,97,114,32,116,111,32,98,101,109,97,114,103,105,110,45,\n116,111,112,58,49,47,94,92,115,43,124,92,115,43,36,47,103,101,41,123,116,104,114\n,111,119,32,101,125,59,116,104,101,32,115,116,97,114,116,32,111,102,116,119,111,\n32,115,101,112,97,114,97,116,101,108,97,110,103,117,97,103,101,32,97,110,100,119\n,104,111,32,104,97,100,32,98,101,101,110,111,112,101,114,97,116,105,111,110,32,\n111,102,100,101,97,116,104,32,111,102,32,116,104,101,114,101,97,108,32,110,117,\n109,98,101,114,115,9,60,108,105,110,107,32,114,101,108,61,34,112,114,111,118,105\n,100,101,100,32,116,104,101,116,104,101,32,115,116,111,114,121,32,111,102,99,111\n,109,112,101,116,105,116,105,111,110,115,101,110,103,108,105,115,104,32,40,85,75\n,41,101,110,103,108,105,115,104,32,40,85,83,41,208,156,208,190,208,189,208,179,\n208,190,208,187,208,161,209,128,208,191,209,129,208,186,208,184,209,129,209,128,\n208,191,209,129,208,186,208,184,209,129,209,128,208,191,209,129,208,186,208,190,\n217,132,216,185,216,177,216,168,217,138,216,169,230,173,163,233,171,148,228,184,\n173,230,150,135,231,174,128,228,189,147,228,184,173,230,150,135,231,185,129,228,\n189,147,228,184,173,230,150,135,230,156,137,233,153,144,229,133,172,229,143,184,\n228,186,186,230,176,145,230,148,191,229,186,156,233,152,191,233,135,140,229,183,\n180,229,183,180,231,164,190,228,188,154,228,184,187,228,185,137,230,147,141,228,\n189,156,231,179,187,231,187,159,230,148,191,231,173,150,230,179,149,232,167,132,\n105,110,102,111,114,109,97,99,105,195,179,110,104,101,114,114,97,109,105,101,110\n,116,97,115,101,108,101,99,116,114,195,179,110,105,99,111,100,101,115,99,114,105\n,112,99,105,195,179,110,99,108,97,115,105,102,105,99,97,100,111,115,99,111,110,\n111,99,105,109,105,101,110,116,111,112,117,98,108,105,99,97,99,105,195,179,110,\n114,101,108,97,99,105,111,110,97,100,97,115,105,110,102,111,114,109,195,161,116,\n105,99,97,114,101,108,97,99,105,111,110,97,100,111,115,100,101,112,97,114,116,97\n,109,101,110,116,111,116,114,97,98,97,106,97,100,111,114,101,115,100,105,114,101\n,99,116,97,109,101,110,116,101,97,121,117,110,116,97,109,105,101,110,116,111,109\n,101,114,99,97,100,111,76,105,98,114,101,99,111,110,116,195,161,99,116,101,110,\n111,115,104,97,98,105,116,97,99,105,111,110,101,115,99,117,109,112,108,105,109,\n105,101,110,116,111,114,101,115,116,97,117,114,97,110,116,101,115,100,105,115,\n112,111,115,105,99,105,195,179,110,99,111,110,115,101,99,117,101,110,99,105,97,\n101,108,101,99,116,114,195,179,110,105,99,97,97,112,108,105,99,97,99,105,111,110\n,101,115,100,101,115,99,111,110,101,99,116,97,100,111,105,110,115,116,97,108,97,\n99,105,195,179,110,114,101,97,108,105,122,97,99,105,195,179,110,117,116,105,108,\n105,122,97,99,105,195,179,110,101,110,99,105,99,108,111,112,101,100,105,97,101,\n110,102,101,114,109,101,100,97,100,101,115,105,110,115,116,114,117,109,101,110,\n116,111,115,101,120,112,101,114,105,101,110,99,105,97,115,105,110,115,116,105,\n116,117,99,105,195,179,110,112,97,114,116,105,99,117,108,97,114,101,115,115,117,\n98,99,97,116,101,103,111,114,105,97,209,130,208,190,208,187,209,140,208,186,208,\n190,208,160,208,190,209,129,209,129,208,184,208,184,209,128,208,176,208,177,208,\n190,209,130,209,139,208,177,208,190,208,187,209,140,209,136,208,181,208,191,209,\n128,208,190,209,129,209,130,208,190,208,188,208,190,208,182,208,181,209,130,208,\n181,208,180,209,128,209,131,208,179,208,184,209,133,209,129,208,187,209,131,209,\n135,208,176,208,181,209,129,208,181,208,185,209,135,208,176,209,129,208,178,209,\n129,208,181,208,179,208,180,208,176,208,160,208,190,209,129,209,129,208,184,209,\n143,208,156,208,190,209,129,208,186,208,178,208,181,208,180,209,128,209,131,208,\n179,208,184,208,181,208,179,208,190,209,128,208,190,208,180,208,176,208,178,208,\n190,208,191,209,128,208,190,209,129,208,180,208,176,208,189,208,189,209,139,209,\n133,208,180,208,190,208,187,208,182,208,189,209,139,208,184,208,188,208,181,208,\n189,208,189,208,190,208,156,208,190,209,129,208,186,208,178,209,139,209,128,209,\n131,208,177,208,187,208,181,208,185,208,156,208,190,209,129,208,186,208,178,208,\n176,209,129,209,130,209,128,208,176,208,189,209,139,208,189,208,184,209,135,208,\n181,208,179,208,190,209,128,208,176,208,177,208,190,209,130,208,181,208,180,208,\n190,208,187,208,182,208,181,208,189,209,131,209,129,208,187,209,131,208,179,208,\n184,209,130,208,181,208,191,208,181,209,128,209,140,208,158,208,180,208,189,208,\n176,208,186,208,190,208,191,208,190,209,130,208,190,208,188,209,131,209,128,208,\n176,208,177,208,190,209,130,209,131,208,176,208,191,209,128,208,181,208,187,209,\n143,208,178,208,190,208,190,208,177,209,137,208,181,208,190,208,180,208,189,208,\n190,208,179,208,190,209,129,208,178,208,190,208,181,208,179,208,190,209,129,209,\n130,208,176,209,130,209,140,208,184,208,180,209,128,209,131,208,179,208,190,208,\n185,209,132,208,190,209,128,209,131,208,188,208,181,209,133,208,190,209,128,208,\n190,209,136,208,190,208,191,209,128,208,190,209,130,208,184,208,178,209,129,209,\n129,209,139,208,187,208,186,208,176,208,186,208,176,208,182,208,180,209,139,208,\n185,208,178,208,187,208,176,209,129,209,130,208,184,208,179,209,128,209,131,208,\n191,208,191,209,139,208,178,208,188,208,181,209,129,209,130,208,181,209,128,208,\n176,208,177,208,190,209,130,208,176,209,129,208,186,208,176,208,183,208,176,208,\n187,208,191,208,181,209,128,208,178,209,139,208,185,208,180,208,181,208,187,208,\n176,209,130,209,140,208,180,208,181,208,189,209,140,208,179,208,184,208,191,208,\n181,209,128,208,184,208,190,208,180,208,177,208,184,208,183,208,189,208,181,209,\n129,208,190,209,129,208,189,208,190,208,178,208,181,208,188,208,190,208,188,208,\n181,208,189,209,130,208,186,209,131,208,191,208,184,209,130,209,140,208,180,208,\n190,208,187,208,182,208,189,208,176,209,128,208,176,208,188,208,186,208,176,209,\n133,208,189,208,176,209,135,208,176,208,187,208,190,208,160,208,176,208,177,208,\n190,209,130,208,176,208,162,208,190,208,187,209,140,208,186,208,190,209,129,208,\n190,208,178,209,129,208,181,208,188,208,178,209,130,208,190,209,128,208,190,208,\n185,208,189,208,176,209,135,208,176,208,187,208,176,209,129,208,191,208,184,209,\n129,208,190,208,186,209,129,208,187,209,131,208,182,208,177,209,139,209,129,208,\n184,209,129,209,130,208,181,208,188,208,191,208,181,209,135,208,176,209,130,208,\n184,208,189,208,190,208,178,208,190,208,179,208,190,208,191,208,190,208,188,208,\n190,209,137,208,184,209,129,208,176,208,185,209,130,208,190,208,178,208,191,208,\n190,209,135,208,181,208,188,209,131,208,191,208,190,208,188,208,190,209,137,209,\n140,208,180,208,190,208,187,208,182,208,189,208,190,209,129,209,129,209,139,208,\n187,208,186,208,184,208,177,209,139,209,129,209,130,209,128,208,190,208,180,208,\n176,208,189,208,189,209,139,208,181,208,188,208,189,208,190,208,179,208,184,208,\n181,208,191,209,128,208,190,208,181,208,186,209,130,208,161,208,181,208,185,209,\n135,208,176,209,129,208,188,208,190,208,180,208,181,208,187,208,184,209,130,208,\n176,208,186,208,190,208,179,208,190,208,190,208,189,208,187,208,176,208,185,208,\n189,208,179,208,190,209,128,208,190,208,180,208,181,208,178,208,181,209,128,209,\n129,208,184,209,143,209,129,209,130,209,128,208,176,208,189,208,181,209,132,208,\n184,208,187,209,140,208,188,209,139,209,131,209,128,208,190,208,178,208,189,209,\n143,209,128,208,176,208,183,208,189,209,139,209,133,208,184,209,129,208,186,208,\n176,209,130,209,140,208,189,208,181,208,180,208,181,208,187,209,142,209,143,208,\n189,208,178,208,176,209,128,209,143,208,188,208,181,208,189,209,140,209,136,208,\n181,208,188,208,189,208,190,208,179,208,184,209,133,208,180,208,176,208,189,208,\n189,208,190,208,185,208,183,208,189,208,176,209,135,208,184,209,130,208,189,208,\n181,208,187,209,140,208,183,209,143,209,132,208,190,209,128,209,131,208,188,208,\n176,208,162,208,181,208,191,208,181,209,128,209,140,208,188,208,181,209,129,209,\n143,209,134,208,176,208,183,208,176,209,137,208,184,209,130,209,139,208,155,209,\n131,209,135,209,136,208,184,208,181,224,164,168,224,164,185,224,165,128,224,164,\n130,224,164,149,224,164,176,224,164,168,224,165,135,224,164,133,224,164,170,224,\n164,168,224,165,135,224,164,149,224,164,191,224,164,175,224,164,190,224,164,149,\n224,164,176,224,165,135,224,164,130,224,164,133,224,164,168,224,165,141,224,164,\n175,224,164,149,224,165,141,224,164,175,224,164,190,224,164,151,224,164,190,224,\n164,135,224,164,161,224,164,172,224,164,190,224,164,176,224,165,135,224,164,149,\n224,164,191,224,164,184,224,165,128,224,164,166,224,164,191,224,164,175,224,164,\n190,224,164,170,224,164,185,224,164,178,224,165,135,224,164,184,224,164,191,224,\n164,130,224,164,185,224,164,173,224,164,190,224,164,176,224,164,164,224,164,133,\n224,164,170,224,164,168,224,165,128,224,164,181,224,164,190,224,164,178,224,165,\n135,224,164,184,224,165,135,224,164,181,224,164,190,224,164,149,224,164,176,224,\n164,164,224,165,135,224,164,174,224,165,135,224,164,176,224,165,135,224,164,185,\n224,165,139,224,164,168,224,165,135,224,164,184,224,164,149,224,164,164,224,165,\n135,224,164,172,224,164,185,224,165,129,224,164,164,224,164,184,224,164,190,224,\n164,135,224,164,159,224,164,185,224,165,139,224,164,151,224,164,190,224,164,156,\n224,164,190,224,164,168,224,165,135,224,164,174,224,164,191,224,164,168,224,164,\n159,224,164,149,224,164,176,224,164,164,224,164,190,224,164,149,224,164,176,224,\n164,168,224,164,190,224,164,137,224,164,168,224,164,149,224,165,135,224,164,175,\n224,164,185,224,164,190,224,164,129,224,164,184,224,164,172,224,164,184,224,165,\n135,224,164,173,224,164,190,224,164,183,224,164,190,224,164,134,224,164,170,224,\n164,149,224,165,135,224,164,178,224,164,191,224,164,175,224,165,135,224,164,182,\n224,165,129,224,164,176,224,165,130,224,164,135,224,164,184,224,164,149,224,165,\n135,224,164,152,224,164,130,224,164,159,224,165,135,224,164,174,224,165,135,224,\n164,176,224,165,128,224,164,184,224,164,149,224,164,164,224,164,190,224,164,174,\n224,165,135,224,164,176,224,164,190,224,164,178,224,165,135,224,164,149,224,164,\n176,224,164,133,224,164,167,224,164,191,224,164,149,224,164,133,224,164,170,224,\n164,168,224,164,190,224,164,184,224,164,174,224,164,190,224,164,156,224,164,174,\n224,165,129,224,164,157,224,165,135,224,164,149,224,164,190,224,164,176,224,164,\n163,224,164,185,224,165,139,224,164,164,224,164,190,224,164,149,224,164,161,224,\n164,188,224,165,128,224,164,175,224,164,185,224,164,190,224,164,130,224,164,185,\n224,165,139,224,164,159,224,164,178,224,164,182,224,164,172,224,165,141,224,164,\n166,224,164,178,224,164,191,224,164,175,224,164,190,224,164,156,224,165,128,224,\n164,181,224,164,168,224,164,156,224,164,190,224,164,164,224,164,190,224,164,149,\n224,165,136,224,164,184,224,165,135,224,164,134,224,164,170,224,164,149,224,164,\n190,224,164,181,224,164,190,224,164,178,224,165,128,224,164,166,224,165,135,224,\n164,168,224,165,135,224,164,170,224,165,130,224,164,176,224,165,128,224,164,170,\n224,164,190,224,164,168,224,165,128,224,164,137,224,164,184,224,164,149,224,165,\n135,224,164,185,224,165,139,224,164,151,224,165,128,224,164,172,224,165,136,224,\n164,160,224,164,149,224,164,134,224,164,170,224,164,149,224,165,128,224,164,181,\n224,164,176,224,165,141,224,164,183,224,164,151,224,164,190,224,164,130,224,164,\n181,224,164,134,224,164,170,224,164,149,224,165,139,224,164,156,224,164,191,224,\n164,178,224,164,190,224,164,156,224,164,190,224,164,168,224,164,190,224,164,184,\n224,164,185,224,164,174,224,164,164,224,164,185,224,164,174,224,165,135,224,164,\n130,224,164,137,224,164,168,224,164,149,224,165,128,224,164,175,224,164,190,224,\n164,185,224,165,130,224,164,166,224,164,176,224,165,141,224,164,156,224,164,184,\n224,165,130,224,164,154,224,165,128,224,164,170,224,164,184,224,164,130,224,164,\n166,224,164,184,224,164,181,224,164,190,224,164,178,224,164,185,224,165,139,224,\n164,168,224,164,190,224,164,185,224,165,139,224,164,164,224,165,128,224,164,156,\n224,165,136,224,164,184,224,165,135,224,164,181,224,164,190,224,164,170,224,164,\n184,224,164,156,224,164,168,224,164,164,224,164,190,224,164,168,224,165,135,224,\n164,164,224,164,190,224,164,156,224,164,190,224,164,176,224,165,128,224,164,152,\n224,164,190,224,164,175,224,164,178,224,164,156,224,164,191,224,164,178,224,165,\n135,224,164,168,224,165,128,224,164,154,224,165,135,224,164,156,224,164,190,224,\n164,130,224,164,154,224,164,170,224,164,164,224,165,141,224,164,176,224,164,151,\n224,165,130,224,164,151,224,164,178,224,164,156,224,164,190,224,164,164,224,165,\n135,224,164,172,224,164,190,224,164,185,224,164,176,224,164,134,224,164,170,224,\n164,168,224,165,135,224,164,181,224,164,190,224,164,185,224,164,168,224,164,135,\n224,164,184,224,164,149,224,164,190,224,164,184,224,165,129,224,164,172,224,164,\n185,224,164,176,224,164,185,224,164,168,224,165,135,224,164,135,224,164,184,224,\n164,184,224,165,135,224,164,184,224,164,185,224,164,191,224,164,164,224,164,172,\n224,164,161,224,164,188,224,165,135,224,164,152,224,164,159,224,164,168,224,164,\n190,224,164,164,224,164,178,224,164,190,224,164,182,224,164,170,224,164,190,224,\n164,130,224,164,154,224,164,182,224,165,141,224,164,176,224,165,128,224,164,172,\n224,164,161,224,164,188,224,165,128,224,164,185,224,165,139,224,164,164,224,165,\n135,224,164,184,224,164,190,224,164,136,224,164,159,224,164,182,224,164,190,224,\n164,175,224,164,166,224,164,184,224,164,149,224,164,164,224,165,128,224,164,156,\n224,164,190,224,164,164,224,165,128,224,164,181,224,164,190,224,164,178,224,164,\n190,224,164,185,224,164,156,224,164,190,224,164,176,224,164,170,224,164,159,224,\n164,168,224,164,190,224,164,176,224,164,150,224,164,168,224,165,135,224,164,184,\n224,164,161,224,164,188,224,164,149,224,164,174,224,164,191,224,164,178,224,164,\n190,224,164,137,224,164,184,224,164,149,224,165,128,224,164,149,224,165,135,224,\n164,181,224,164,178,224,164,178,224,164,151,224,164,164,224,164,190,224,164,150,\n224,164,190,224,164,168,224,164,190,224,164,133,224,164,176,224,165,141,224,164,\n165,224,164,156,224,164,185,224,164,190,224,164,130,224,164,166,224,165,135,224,\n164,150,224,164,190,224,164,170,224,164,185,224,164,178,224,165,128,224,164,168,\n224,164,191,224,164,175,224,164,174,224,164,172,224,164,191,224,164,168,224,164,\n190,224,164,172,224,165,136,224,164,130,224,164,149,224,164,149,224,164,185,224,\n165,128,224,164,130,224,164,149,224,164,185,224,164,168,224,164,190,224,164,166,\n224,165,135,224,164,164,224,164,190,224,164,185,224,164,174,224,164,178,224,165,\n135,224,164,149,224,164,190,224,164,171,224,165,128,224,164,156,224,164,172,224,\n164,149,224,164,191,224,164,164,224,165,129,224,164,176,224,164,164,224,164,174,\n224,164,190,224,164,130,224,164,151,224,164,181,224,164,185,224,165,128,224,164,\n130,224,164,176,224,165,139,224,164,156,224,164,188,224,164,174,224,164,191,224,\n164,178,224,165,128,224,164,134,224,164,176,224,165,139,224,164,170,224,164,184,\n224,165,135,224,164,168,224,164,190,224,164,175,224,164,190,224,164,166,224,164,\n181,224,164,178,224,165,135,224,164,168,224,165,135,224,164,150,224,164,190,224,\n164,164,224,164,190,224,164,149,224,164,176,224,165,128,224,164,172,224,164,137,\n224,164,168,224,164,149,224,164,190,224,164,156,224,164,181,224,164,190,224,164,\n172,224,164,170,224,165,130,224,164,176,224,164,190,224,164,172,224,164,161,224,\n164,188,224,164,190,224,164,184,224,165,140,224,164,166,224,164,190,224,164,182,\n224,165,135,224,164,175,224,164,176,224,164,149,224,164,191,224,164,175,224,165,\n135,224,164,149,224,164,185,224,164,190,224,164,130,224,164,133,224,164,149,224,\n164,184,224,164,176,224,164,172,224,164,168,224,164,190,224,164,143,224,164,181,\n224,164,185,224,164,190,224,164,130,224,164,184,224,165,141,224,164,165,224,164,\n178,224,164,174,224,164,191,224,164,178,224,165,135,224,164,178,224,165,135,224,\n164,150,224,164,149,224,164,181,224,164,191,224,164,183,224,164,175,224,164,149,\n224,165,141,224,164,176,224,164,130,224,164,184,224,164,174,224,165,130,224,164,\n185,224,164,165,224,164,190,224,164,168,224,164,190,216,170,216,179,216,170,216,\n183,217,138,216,185,217,133,216,180,216,167,216,177,217,131,216,169,216,168,217,\n136,216,167,216,179,216,183,216,169,216,167,217,132,216,181,217,129,216,173,216,\n169,217,133,217,136,216,167,216,182,217,138,216,185,216,167,217,132,216,174,216,\n167,216,181,216,169,216,167,217,132,217,133,216,178,217,138,216,175,216,167,217,\n132,216,185,216,167,217,133,216,169,216,167,217,132,217,131,216,167,216,170,216,\n168,216,167,217,132,216,177,216,175,217,136,216,175,216,168,216,177,217,134,216,\n167,217,133,216,172,216,167,217,132,216,175,217,136,217,132,216,169,216,167,217,\n132,216,185,216,167,217,132,217,133,216,167,217,132,217,133,217,136,217,130,216,\n185,216,167,217,132,216,185,216,177,216,168,217,138,216,167,217,132,216,179,216,\n177,217,138,216,185,216,167,217,132,216,172,217,136,216,167,217,132,216,167,217,\n132,216,176,217,135,216,167,216,168,216,167,217,132,216,173,217,138,216,167,216,\n169,216,167,217,132,216,173,217,130,217,136,217,130,216,167,217,132,217,131,216,\n177,217,138,217,133,216,167,217,132,216,185,216,177,216,167,217,130,217,133,216,\n173,217,129,217,136,216,184,216,169,216,167,217,132,216,171,216,167,217,134,217,\n138,217,133,216,180,216,167,217,135,216,175,216,169,216,167,217,132,217,133,216,\n177,216,163,216,169,216,167,217,132,217,130,216,177,216,162,217,134,216,167,217,\n132,216,180,216,168,216,167,216,168,216,167,217,132,216,173,217,136,216,167,216,\n177,216,167,217,132,216,172,216,175,217,138,216,175,216,167,217,132,216,163,216,\n179,216,177,216,169,216,167,217,132,216,185,217,132,217,136,217,133,217,133,216,\n172,217,133,217,136,216,185,216,169,216,167,217,132,216,177,216,173,217,133,217,\n134,216,167,217,132,217,134,217,130,216,167,216,183,217,129,217,132,216,179,216,\n183,217,138,217,134,216,167,217,132,217,131,217,136,217,138,216,170,216,167,217,\n132,216,175,217,134,217,138,216,167,216,168,216,177,217,131,216,167,216,170,217,\n135,216,167,217,132,216,177,217,138,216,167,216,182,216,170,216,173,217,138,216,\n167,216,170,217,138,216,168,216,170,217,136,217,130,217,138,216,170,216,167,217,\n132,216,163,217,136,217,132,217,137,216,167,217,132,216,168,216,177,217,138,216,\n175,216,167,217,132,217,131,217,132,216,167,217,133,216,167,217,132,216,177,216,\n167,216,168,216,183,216,167,217,132,216,180,216,174,216,181,217,138,216,179,217,\n138,216,167,216,177,216,167,216,170,216,167,217,132,216,171,216,167,217,132,216,\n171,216,167,217,132,216,181,217,132,216,167,216,169,216,167,217,132,216,173,216,\n175,217,138,216,171,216,167,217,132,216,178,217,136,216,167,216,177,216,167,217,\n132,216,174,217,132,217,138,216,172,216,167,217,132,216,172,217,133,217,138,216,\n185,216,167,217,132,216,185,216,167,217,133,217,135,216,167,217,132,216,172,217,\n133,216,167,217,132,216,167,217,132,216,179,216,167,216,185,216,169,217,133,216,\n180,216,167,217,135,216,175,217,135,216,167,217,132,216,177,216,166,217,138,216,\n179,216,167,217,132,216,175,216,174,217,136,217,132,216,167,217,132,217,129,217,\n134,217,138,216,169,216,167,217,132,217,131,216,170,216,167,216,168,216,167,217,\n132,216,175,217,136,216,177,217,138,216,167,217,132,216,175,216,177,217,136,216,\n179,216,167,216,179,216,170,216,186,216,177,217,130,216,170,216,181,216,167,217,\n133,217,138,217,133,216,167,217,132,216,168,217,134,216,167,216,170,216,167,217,\n132,216,185,216,184,217,138,217,133,101,110,116,101,114,116,97,105,110,109,101,\n110,116,117,110,100,101,114,115,116,97,110,100,105,110,103,32,61,32,102,117,110,\n99,116,105,111,110,40,41,46,106,112,103,34,32,119,105,100,116,104,61,34,99,111,\n110,102,105,103,117,114,97,116,105,111,110,46,112,110,103,34,32,119,105,100,116,\n104,61,34,60,98,111,100,121,32,99,108,97,115,115,61,34,77,97,116,104,46,114,97,\n110,100,111,109,40,41,99,111,110,116,101,109,112,111,114,97,114,121,32,85,110,\n105,116,101,100,32,83,116,97,116,101,115,99,105,114,99,117,109,115,116,97,110,99\n,101,115,46,97,112,112,101,110,100,67,104,105,108,100,40,111,114,103,97,110,105,\n122,97,116,105,111,110,115,60,115,112,97,110,32,99,108,97,115,115,61,34,34,62,60\n,105,109,103,32,115,114,99,61,34,47,100,105,115,116,105,110,103,117,105,115,104,\n101,100,116,104,111,117,115,97,110,100,115,32,111,102,32,99,111,109,109,117,110,\n105,99,97,116,105,111,110,99,108,101,97,114,34,62,60,47,100,105,118,62,105,110,\n118,101,115,116,105,103,97,116,105,111,110,102,97,118,105,99,111,110,46,105,99,\n111,34,32,109,97,114,103,105,110,45,114,105,103,104,116,58,98,97,115,101,100,32,\n111,110,32,116,104,101,32,77,97,115,115,97,99,104,117,115,101,116,116,115,116,97\n,98,108,101,32,98,111,114,100,101,114,61,105,110,116,101,114,110,97,116,105,111,\n110,97,108,97,108,115,111,32,107,110,111,119,110,32,97,115,112,114,111,110,117,\n110,99,105,97,116,105,111,110,98,97,99,107,103,114,111,117,110,100,58,35,102,112\n,97,100,100,105,110,103,45,108,101,102,116,58,70,111,114,32,101,120,97,109,112,\n108,101,44,32,109,105,115,99,101,108,108,97,110,101,111,117,115,38,108,116,59,47\n,109,97,116,104,38,103,116,59,112,115,121,99,104,111,108,111,103,105,99,97,108,\n105,110,32,112,97,114,116,105,99,117,108,97,114,101,97,114,99,104,34,32,116,121,\n112,101,61,34,102,111,114,109,32,109,101,116,104,111,100,61,34,97,115,32,111,112\n,112,111,115,101,100,32,116,111,83,117,112,114,101,109,101,32,67,111,117,114,116\n,111,99,99,97,115,105,111,110,97,108,108,121,32,65,100,100,105,116,105,111,110,\n97,108,108,121,44,78,111,114,116,104,32,65,109,101,114,105,99,97,112,120,59,98,\n97,99,107,103,114,111,117,110,100,111,112,112,111,114,116,117,110,105,116,105,\n101,115,69,110,116,101,114,116,97,105,110,109,101,110,116,46,116,111,76,111,119,\n101,114,67,97,115,101,40,109,97,110,117,102,97,99,116,117,114,105,110,103,112,\n114,111,102,101,115,115,105,111,110,97,108,32,99,111,109,98,105,110,101,100,32,\n119,105,116,104,70,111,114,32,105,110,115,116,97,110,99,101,44,99,111,110,115,\n105,115,116,105,110,103,32,111,102,34,32,109,97,120,108,101,110,103,116,104,61,\n34,114,101,116,117,114,110,32,102,97,108,115,101,59,99,111,110,115,99,105,111,\n117,115,110,101,115,115,77,101,100,105,116,101,114,114,97,110,101,97,110,101,120\n,116,114,97,111,114,100,105,110,97,114,121,97,115,115,97,115,115,105,110,97,116,\n105,111,110,115,117,98,115,101,113,117,101,110,116,108,121,32,98,117,116,116,111\n,110,32,116,121,112,101,61,34,116,104,101,32,110,117,109,98,101,114,32,111,102,\n116,104,101,32,111,114,105,103,105,110,97,108,32,99,111,109,112,114,101,104,101,\n110,115,105,118,101,114,101,102,101,114,115,32,116,111,32,116,104,101,60,47,117,\n108,62,10,60,47,100,105,118,62,10,112,104,105,108,111,115,111,112,104,105,99,97,\n108,108,111,99,97,116,105,111,110,46,104,114,101,102,119,97,115,32,112,117,98,\n108,105,115,104,101,100,83,97,110,32,70,114,97,110,99,105,115,99,111,40,102,117,\n110,99,116,105,111,110,40,41,123,10,60,100,105,118,32,105,100,61,34,109,97,105,\n110,115,111,112,104,105,115,116,105,99,97,116,101,100,109,97,116,104,101,109,97,\n116,105,99,97,108,32,47,104,101,97,100,62,13,10,60,98,111,100,121,115,117,103,\n103,101,115,116,115,32,116,104,97,116,100,111,99,117,109,101,110,116,97,116,105,\n111,110,99,111,110,99,101,110,116,114,97,116,105,111,110,114,101,108,97,116,105,\n111,110,115,104,105,112,115,109,97,121,32,104,97,118,101,32,98,101,101,110,40,\n102,111,114,32,101,120,97,109,112,108,101,44,84,104,105,115,32,97,114,116,105,99\n,108,101,32,105,110,32,115,111,109,101,32,99,97,115,101,115,112,97,114,116,115,\n32,111,102,32,116,104,101,32,100,101,102,105,110,105,116,105,111,110,32,111,102,\n71,114,101,97,116,32,66,114,105,116,97,105,110,32,99,101,108,108,112,97,100,100,\n105,110,103,61,101,113,117,105,118,97,108,101,110,116,32,116,111,112,108,97,99,\n101,104,111,108,100,101,114,61,34,59,32,102,111,110,116,45,115,105,122,101,58,32\n,106,117,115,116,105,102,105,99,97,116,105,111,110,98,101,108,105,101,118,101,\n100,32,116,104,97,116,115,117,102,102,101,114,101,100,32,102,114,111,109,97,116,\n116,101,109,112,116,101,100,32,116,111,32,108,101,97,100,101,114,32,111,102,32,\n116,104,101,99,114,105,112,116,34,32,115,114,99,61,34,47,40,102,117,110,99,116,\n105,111,110,40,41,32,123,97,114,101,32,97,118,97,105,108,97,98,108,101,10,9,60,\n108,105,110,107,32,114,101,108,61,34,32,115,114,99,61,39,104,116,116,112,58,47,\n47,105,110,116,101,114,101,115,116,101,100,32,105,110,99,111,110,118,101,110,116\n,105,111,110,97,108,32,34,32,97,108,116,61,34,34,32,47,62,60,47,97,114,101,32,\n103,101,110,101,114,97,108,108,121,104,97,115,32,97,108,115,111,32,98,101,101,\n110,109,111,115,116,32,112,111,112,117,108,97,114,32,99,111,114,114,101,115,112,\n111,110,100,105,110,103,99,114,101,100,105,116,101,100,32,119,105,116,104,116,\n121,108,101,61,34,98,111,114,100,101,114,58,60,47,97,62,60,47,115,112,97,110,62,\n60,47,46,103,105,102,34,32,119,105,100,116,104,61,34,60,105,102,114,97,109,101,\n32,115,114,99,61,34,116,97,98,108,101,32,99,108,97,115,115,61,34,105,110,108,105\n,110,101,45,98,108,111,99,107,59,97,99,99,111,114,100,105,110,103,32,116,111,32,\n116,111,103,101,116,104,101,114,32,119,105,116,104,97,112,112,114,111,120,105,\n109,97,116,101,108,121,112,97,114,108,105,97,109,101,110,116,97,114,121,109,111,\n114,101,32,97,110,100,32,109,111,114,101,100,105,115,112,108,97,121,58,110,111,\n110,101,59,116,114,97,100,105,116,105,111,110,97,108,108,121,112,114,101,100,111\n,109,105,110,97,110,116,108,121,38,110,98,115,112,59,124,38,110,98,115,112,59,38\n,110,98,115,112,59,60,47,115,112,97,110,62,32,99,101,108,108,115,112,97,99,105,\n110,103,61,60,105,110,112,117,116,32,110,97,109,101,61,34,111,114,34,32,99,111,\n110,116,101,110,116,61,34,99,111,110,116,114,111,118,101,114,115,105,97,108,112,\n114,111,112,101,114,116,121,61,34,111,103,58,47,120,45,115,104,111,99,107,119,97\n,118,101,45,100,101,109,111,110,115,116,114,97,116,105,111,110,115,117,114,114,\n111,117,110,100,101,100,32,98,121,78,101,118,101,114,116,104,101,108,101,115,115\n,44,119,97,115,32,116,104,101,32,102,105,114,115,116,99,111,110,115,105,100,101,\n114,97,98,108,101,32,65,108,116,104,111,117,103,104,32,116,104,101,32,99,111,108\n,108,97,98,111,114,97,116,105,111,110,115,104,111,117,108,100,32,110,111,116,32,\n98,101,112,114,111,112,111,114,116,105,111,110,32,111,102,60,115,112,97,110,32,\n115,116,121,108,101,61,34,107,110,111,119,110,32,97,115,32,116,104,101,32,115,\n104,111,114,116,108,121,32,97,102,116,101,114,102,111,114,32,105,110,115,116,97,\n110,99,101,44,100,101,115,99,114,105,98,101,100,32,97,115,32,47,104,101,97,100,\n62,10,60,98,111,100,121,32,115,116,97,114,116,105,110,103,32,119,105,116,104,105\n,110,99,114,101,97,115,105,110,103,108,121,32,116,104,101,32,102,97,99,116,32,\n116,104,97,116,100,105,115,99,117,115,115,105,111,110,32,111,102,109,105,100,100\n,108,101,32,111,102,32,116,104,101,97,110,32,105,110,100,105,118,105,100,117,97,\n108,100,105,102,102,105,99,117,108,116,32,116,111,32,112,111,105,110,116,32,111,\n102,32,118,105,101,119,104,111,109,111,115,101,120,117,97,108,105,116,121,97,99,\n99,101,112,116,97,110,99,101,32,111,102,60,47,115,112,97,110,62,60,47,100,105,\n118,62,109,97,110,117,102,97,99,116,117,114,101,114,115,111,114,105,103,105,110,\n32,111,102,32,116,104,101,99,111,109,109,111,110,108,121,32,117,115,101,100,105,\n109,112,111,114,116,97,110,99,101,32,111,102,100,101,110,111,109,105,110,97,116,\n105,111,110,115,98,97,99,107,103,114,111,117,110,100,58,32,35,108,101,110,103,\n116,104,32,111,102,32,116,104,101,100,101,116,101,114,109,105,110,97,116,105,111\n,110,97,32,115,105,103,110,105,102,105,99,97,110,116,34,32,98,111,114,100,101,\n114,61,34,48,34,62,114,101,118,111,108,117,116,105,111,110,97,114,121,112,114,\n105,110,99,105,112,108,101,115,32,111,102,105,115,32,99,111,110,115,105,100,101,\n114,101,100,119,97,115,32,100,101,118,101,108,111,112,101,100,73,110,100,111,45,\n69,117,114,111,112,101,97,110,118,117,108,110,101,114,97,98,108,101,32,116,111,\n112,114,111,112,111,110,101,110,116,115,32,111,102,97,114,101,32,115,111,109,101\n,116,105,109,101,115,99,108,111,115,101,114,32,116,111,32,116,104,101,78,101,119\n,32,89,111,114,107,32,67,105,116,121,32,110,97,109,101,61,34,115,101,97,114,99,\n104,97,116,116,114,105,98,117,116,101,100,32,116,111,99,111,117,114,115,101,32,\n111,102,32,116,104,101,109,97,116,104,101,109,97,116,105,99,105,97,110,98,121,32\n,116,104,101,32,101,110,100,32,111,102,97,116,32,116,104,101,32,101,110,100,32,\n111,102,34,32,98,111,114,100,101,114,61,34,48,34,32,116,101,99,104,110,111,108,\n111,103,105,99,97,108,46,114,101,109,111,118,101,67,108,97,115,115,40,98,114,97,\n110,99,104,32,111,102,32,116,104,101,101,118,105,100,101,110,99,101,32,116,104,\n97,116,33,91,101,110,100,105,102,93,45,45,62,13,10,73,110,115,116,105,116,117,\n116,101,32,111,102,32,105,110,116,111,32,97,32,115,105,110,103,108,101,114,101,\n115,112,101,99,116,105,118,101,108,121,46,97,110,100,32,116,104,101,114,101,102,\n111,114,101,112,114,111,112,101,114,116,105,101,115,32,111,102,105,115,32,108,\n111,99,97,116,101,100,32,105,110,115,111,109,101,32,111,102,32,119,104,105,99,\n104,84,104,101,114,101,32,105,115,32,97,108,115,111,99,111,110,116,105,110,117,\n101,100,32,116,111,32,97,112,112,101,97,114,97,110,99,101,32,111,102,32,38,97,\n109,112,59,110,100,97,115,104,59,32,100,101,115,99,114,105,98,101,115,32,116,104\n,101,99,111,110,115,105,100,101,114,97,116,105,111,110,97,117,116,104,111,114,32\n,111,102,32,116,104,101,105,110,100,101,112,101,110,100,101,110,116,108,121,101,\n113,117,105,112,112,101,100,32,119,105,116,104,100,111,101,115,32,110,111,116,32\n,104,97,118,101,60,47,97,62,60,97,32,104,114,101,102,61,34,99,111,110,102,117,\n115,101,100,32,119,105,116,104,60,108,105,110,107,32,104,114,101,102,61,34,47,97\n,116,32,116,104,101,32,97,103,101,32,111,102,97,112,112,101,97,114,32,105,110,32\n,116,104,101,84,104,101,115,101,32,105,110,99,108,117,100,101,114,101,103,97,114\n,100,108,101,115,115,32,111,102,99,111,117,108,100,32,98,101,32,117,115,101,100,\n32,115,116,121,108,101,61,38,113,117,111,116,59,115,101,118,101,114,97,108,32,\n116,105,109,101,115,114,101,112,114,101,115,101,110,116,32,116,104,101,98,111,\n100,121,62,10,60,47,104,116,109,108,62,116,104,111,117,103,104,116,32,116,111,32\n,98,101,112,111,112,117,108,97,116,105,111,110,32,111,102,112,111,115,115,105,98\n,105,108,105,116,105,101,115,112,101,114,99,101,110,116,97,103,101,32,111,102,97\n,99,99,101,115,115,32,116,111,32,116,104,101,97,110,32,97,116,116,101,109,112,\n116,32,116,111,112,114,111,100,117,99,116,105,111,110,32,111,102,106,113,117,101\n,114,121,47,106,113,117,101,114,121,116,119,111,32,100,105,102,102,101,114,101,\n110,116,98,101,108,111,110,103,32,116,111,32,116,104,101,101,115,116,97,98,108,\n105,115,104,109,101,110,116,114,101,112,108,97,99,105,110,103,32,116,104,101,100\n,101,115,99,114,105,112,116,105,111,110,34,32,100,101,116,101,114,109,105,110,\n101,32,116,104,101,97,118,97,105,108,97,98,108,101,32,102,111,114,65,99,99,111,\n114,100,105,110,103,32,116,111,32,119,105,100,101,32,114,97,110,103,101,32,111,\n102,9,60,100,105,118,32,99,108,97,115,115,61,34,109,111,114,101,32,99,111,109,\n109,111,110,108,121,111,114,103,97,110,105,115,97,116,105,111,110,115,102,117,\n110,99,116,105,111,110,97,108,105,116,121,119,97,115,32,99,111,109,112,108,101,\n116,101,100,32,38,97,109,112,59,109,100,97,115,104,59,32,112,97,114,116,105,99,\n105,112,97,116,105,111,110,116,104,101,32,99,104,97,114,97,99,116,101,114,97,110\n,32,97,100,100,105,116,105,111,110,97,108,97,112,112,101,97,114,115,32,116,111,\n32,98,101,102,97,99,116,32,116,104,97,116,32,116,104,101,97,110,32,101,120,97,\n109,112,108,101,32,111,102,115,105,103,110,105,102,105,99,97,110,116,108,121,111\n,110,109,111,117,115,101,111,118,101,114,61,34,98,101,99,97,117,115,101,32,116,\n104,101,121,32,97,115,121,110,99,32,61,32,116,114,117,101,59,112,114,111,98,108,\n101,109,115,32,119,105,116,104,115,101,101,109,115,32,116,111,32,104,97,118,101,\n116,104,101,32,114,101,115,117,108,116,32,111,102,32,115,114,99,61,34,104,116,\n116,112,58,47,47,102,97,109,105,108,105,97,114,32,119,105,116,104,112,111,115,\n115,101,115,115,105,111,110,32,111,102,102,117,110,99,116,105,111,110,32,40,41,\n32,123,116,111,111,107,32,112,108,97,99,101,32,105,110,97,110,100,32,115,111,109\n,101,116,105,109,101,115,115,117,98,115,116,97,110,116,105,97,108,108,121,60,115\n,112,97,110,62,60,47,115,112,97,110,62,105,115,32,111,102,116,101,110,32,117,115\n,101,100,105,110,32,97,110,32,97,116,116,101,109,112,116,103,114,101,97,116,32,\n100,101,97,108,32,111,102,69,110,118,105,114,111,110,109,101,110,116,97,108,115,\n117,99,99,101,115,115,102,117,108,108,121,32,118,105,114,116,117,97,108,108,121,\n32,97,108,108,50,48,116,104,32,99,101,110,116,117,114,121,44,112,114,111,102,101\n,115,115,105,111,110,97,108,115,110,101,99,101,115,115,97,114,121,32,116,111,32,\n100,101,116,101,114,109,105,110,101,100,32,98,121,99,111,109,112,97,116,105,98,\n105,108,105,116,121,98,101,99,97,117,115,101,32,105,116,32,105,115,68,105,99,116\n,105,111,110,97,114,121,32,111,102,109,111,100,105,102,105,99,97,116,105,111,110\n,115,84,104,101,32,102,111,108,108,111,119,105,110,103,109,97,121,32,114,101,102\n,101,114,32,116,111,58,67,111,110,115,101,113,117,101,110,116,108,121,44,73,110,\n116,101,114,110,97,116,105,111,110,97,108,97,108,116,104,111,117,103,104,32,115,\n111,109,101,116,104,97,116,32,119,111,117,108,100,32,98,101,119,111,114,108,100,\n39,115,32,102,105,114,115,116,99,108,97,115,115,105,102,105,101,100,32,97,115,98\n,111,116,116,111,109,32,111,102,32,116,104,101,40,112,97,114,116,105,99,117,108,\n97,114,108,121,97,108,105,103,110,61,34,108,101,102,116,34,32,109,111,115,116,32\n,99,111,109,109,111,110,108,121,98,97,115,105,115,32,102,111,114,32,116,104,101,\n102,111,117,110,100,97,116,105,111,110,32,111,102,99,111,110,116,114,105,98,117,\n116,105,111,110,115,112,111,112,117,108,97,114,105,116,121,32,111,102,99,101,110\n,116,101,114,32,111,102,32,116,104,101,116,111,32,114,101,100,117,99,101,32,116,\n104,101,106,117,114,105,115,100,105,99,116,105,111,110,115,97,112,112,114,111,\n120,105,109,97,116,105,111,110,32,111,110,109,111,117,115,101,111,117,116,61,34,\n78,101,119,32,84,101,115,116,97,109,101,110,116,99,111,108,108,101,99,116,105,\n111,110,32,111,102,60,47,115,112,97,110,62,60,47,97,62,60,47,105,110,32,116,104,\n101,32,85,110,105,116,101,100,102,105,108,109,32,100,105,114,101,99,116,111,114,\n45,115,116,114,105,99,116,46,100,116,100,34,62,104,97,115,32,98,101,101,110,32,\n117,115,101,100,114,101,116,117,114,110,32,116,111,32,116,104,101,97,108,116,104\n,111,117,103,104,32,116,104,105,115,99,104,97,110,103,101,32,105,110,32,116,104,\n101,115,101,118,101,114,97,108,32,111,116,104,101,114,98,117,116,32,116,104,101,\n114,101,32,97,114,101,117,110,112,114,101,99,101,100,101,110,116,101,100,105,115\n,32,115,105,109,105,108,97,114,32,116,111,101,115,112,101,99,105,97,108,108,121,\n32,105,110,119,101,105,103,104,116,58,32,98,111,108,100,59,105,115,32,99,97,108,\n108,101,100,32,116,104,101,99,111,109,112,117,116,97,116,105,111,110,97,108,105,\n110,100,105,99,97,116,101,32,116,104,97,116,114,101,115,116,114,105,99,116,101,\n100,32,116,111,9,60,109,101,116,97,32,110,97,109,101,61,34,97,114,101,32,116,121\n,112,105,99,97,108,108,121,99,111,110,102,108,105,99,116,32,119,105,116,104,72,\n111,119,101,118,101,114,44,32,116,104,101,32,65,110,32,101,120,97,109,112,108,\n101,32,111,102,99,111,109,112,97,114,101,100,32,119,105,116,104,113,117,97,110,\n116,105,116,105,101,115,32,111,102,114,97,116,104,101,114,32,116,104,97,110,32,\n97,99,111,110,115,116,101,108,108,97,116,105,111,110,110,101,99,101,115,115,97,\n114,121,32,102,111,114,114,101,112,111,114,116,101,100,32,116,104,97,116,115,112\n,101,99,105,102,105,99,97,116,105,111,110,112,111,108,105,116,105,99,97,108,32,\n97,110,100,38,110,98,115,112,59,38,110,98,115,112,59,60,114,101,102,101,114,101,\n110,99,101,115,32,116,111,116,104,101,32,115,97,109,101,32,121,101,97,114,71,111\n,118,101,114,110,109,101,110,116,32,111,102,103,101,110,101,114,97,116,105,111,\n110,32,111,102,104,97,118,101,32,110,111,116,32,98,101,101,110,115,101,118,101,\n114,97,108,32,121,101,97,114,115,99,111,109,109,105,116,109,101,110,116,32,116,\n111,9,9,60,117,108,32,99,108,97,115,115,61,34,118,105,115,117,97,108,105,122,97,\n116,105,111,110,49,57,116,104,32,99,101,110,116,117,114,121,44,112,114,97,99,116\n,105,116,105,111,110,101,114,115,116,104,97,116,32,104,101,32,119,111,117,108,\n100,97,110,100,32,99,111,110,116,105,110,117,101,100,111,99,99,117,112,97,116,\n105,111,110,32,111,102,105,115,32,100,101,102,105,110,101,100,32,97,115,99,101,\n110,116,114,101,32,111,102,32,116,104,101,116,104,101,32,97,109,111,117,110,116,\n32,111,102,62,60,100,105,118,32,115,116,121,108,101,61,34,101,113,117,105,118,97\n,108,101,110,116,32,111,102,100,105,102,102,101,114,101,110,116,105,97,116,101,\n98,114,111,117,103,104,116,32,97,98,111,117,116,109,97,114,103,105,110,45,108,\n101,102,116,58,32,97,117,116,111,109,97,116,105,99,97,108,108,121,116,104,111,\n117,103,104,116,32,111,102,32,97,115,83,111,109,101,32,111,102,32,116,104,101,\n115,101,10,60,100,105,118,32,99,108,97,115,115,61,34,105,110,112,117,116,32,99,\n108,97,115,115,61,34,114,101,112,108,97,99,101,100,32,119,105,116,104,105,115,32\n,111,110,101,32,111,102,32,116,104,101,101,100,117,99,97,116,105,111,110,32,97,\n110,100,105,110,102,108,117,101,110,99,101,100,32,98,121,114,101,112,117,116,97,\n116,105,111,110,32,97,115,10,60,109,101,116,97,32,110,97,109,101,61,34,97,99,99,\n111,109,109,111,100,97,116,105,111,110,60,47,100,105,118,62,10,60,47,100,105,118\n,62,108,97,114,103,101,32,112,97,114,116,32,111,102,73,110,115,116,105,116,117,\n116,101,32,102,111,114,116,104,101,32,115,111,45,99,97,108,108,101,100,32,97,103\n,97,105,110,115,116,32,116,104,101,32,73,110,32,116,104,105,115,32,99,97,115,101\n,44,119,97,115,32,97,112,112,111,105,110,116,101,100,99,108,97,105,109,101,100,\n32,116,111,32,98,101,72,111,119,101,118,101,114,44,32,116,104,105,115,68,101,112\n,97,114,116,109,101,110,116,32,111,102,116,104,101,32,114,101,109,97,105,110,105\n,110,103,101,102,102,101,99,116,32,111,110,32,116,104,101,112,97,114,116,105,99,\n117,108,97,114,108,121,32,100,101,97,108,32,119,105,116,104,32,116,104,101,10,60\n,100,105,118,32,115,116,121,108,101,61,34,97,108,109,111,115,116,32,97,108,119,\n97,121,115,97,114,101,32,99,117,114,114,101,110,116,108,121,101,120,112,114,101,\n115,115,105,111,110,32,111,102,112,104,105,108,111,115,111,112,104,121,32,111,\n102,102,111,114,32,109,111,114,101,32,116,104,97,110,99,105,118,105,108,105,122,\n97,116,105,111,110,115,111,110,32,116,104,101,32,105,115,108,97,110,100,115,101,\n108,101,99,116,101,100,73,110,100,101,120,99,97,110,32,114,101,115,117,108,116,\n32,105,110,34,32,118,97,108,117,101,61,34,34,32,47,62,116,104,101,32,115,116,114\n,117,99,116,117,114,101,32,47,62,60,47,97,62,60,47,100,105,118,62,77,97,110,121,\n32,111,102,32,116,104,101,115,101,99,97,117,115,101,100,32,98,121,32,116,104,101\n,111,102,32,116,104,101,32,85,110,105,116,101,100,115,112,97,110,32,99,108,97,\n115,115,61,34,109,99,97,110,32,98,101,32,116,114,97,99,101,100,105,115,32,114,\n101,108,97,116,101,100,32,116,111,98,101,99,97,109,101,32,111,110,101,32,111,102\n,105,115,32,102,114,101,113,117,101,110,116,108,121,108,105,118,105,110,103,32,\n105,110,32,116,104,101,116,104,101,111,114,101,116,105,99,97,108,108,121,70,111,\n108,108,111,119,105,110,103,32,116,104,101,82,101,118,111,108,117,116,105,111,\n110,97,114,121,103,111,118,101,114,110,109,101,110,116,32,105,110,105,115,32,100\n,101,116,101,114,109,105,110,101,100,116,104,101,32,112,111,108,105,116,105,99,\n97,108,105,110,116,114,111,100,117,99,101,100,32,105,110,115,117,102,102,105,99,\n105,101,110,116,32,116,111,100,101,115,99,114,105,112,116,105,111,110,34,62,115,\n104,111,114,116,32,115,116,111,114,105,101,115,115,101,112,97,114,97,116,105,111\n,110,32,111,102,97,115,32,116,111,32,119,104,101,116,104,101,114,107,110,111,119\n,110,32,102,111,114,32,105,116,115,119,97,115,32,105,110,105,116,105,97,108,108,\n121,100,105,115,112,108,97,121,58,98,108,111,99,107,105,115,32,97,110,32,101,120\n,97,109,112,108,101,116,104,101,32,112,114,105,110,99,105,112,97,108,99,111,110,\n115,105,115,116,115,32,111,102,32,97,114,101,99,111,103,110,105,122,101,100,32,\n97,115,47,98,111,100,121,62,60,47,104,116,109,108,62,97,32,115,117,98,115,116,97\n,110,116,105,97,108,114,101,99,111,110,115,116,114,117,99,116,101,100,104,101,97\n,100,32,111,102,32,115,116,97,116,101,114,101,115,105,115,116,97,110,99,101,32,\n116,111,117,110,100,101,114,103,114,97,100,117,97,116,101,84,104,101,114,101,32,\n97,114,101,32,116,119,111,103,114,97,118,105,116,97,116,105,111,110,97,108,97,\n114,101,32,100,101,115,99,114,105,98,101,100,105,110,116,101,110,116,105,111,110\n,97,108,108,121,115,101,114,118,101,100,32,97,115,32,116,104,101,99,108,97,115,\n115,61,34,104,101,97,100,101,114,111,112,112,111,115,105,116,105,111,110,32,116,\n111,102,117,110,100,97,109,101,110,116,97,108,108,121,100,111,109,105,110,97,116\n,101,100,32,116,104,101,97,110,100,32,116,104,101,32,111,116,104,101,114,97,108,\n108,105,97,110,99,101,32,119,105,116,104,119,97,115,32,102,111,114,99,101,100,32\n,116,111,114,101,115,112,101,99,116,105,118,101,108,121,44,97,110,100,32,112,111\n,108,105,116,105,99,97,108,105,110,32,115,117,112,112,111,114,116,32,111,102,112\n,101,111,112,108,101,32,105,110,32,116,104,101,50,48,116,104,32,99,101,110,116,\n117,114,121,46,97,110,100,32,112,117,98,108,105,115,104,101,100,108,111,97,100,\n67,104,97,114,116,98,101,97,116,116,111,32,117,110,100,101,114,115,116,97,110,\n100,109,101,109,98,101,114,32,115,116,97,116,101,115,101,110,118,105,114,111,110\n,109,101,110,116,97,108,102,105,114,115,116,32,104,97,108,102,32,111,102,99,111,\n117,110,116,114,105,101,115,32,97,110,100,97,114,99,104,105,116,101,99,116,117,\n114,97,108,98,101,32,99,111,110,115,105,100,101,114,101,100,99,104,97,114,97,99,\n116,101,114,105,122,101,100,99,108,101,97,114,73,110,116,101,114,118,97,108,97,\n117,116,104,111,114,105,116,97,116,105,118,101,70,101,100,101,114,97,116,105,111\n,110,32,111,102,119,97,115,32,115,117,99,99,101,101,100,101,100,97,110,100,32,\n116,104,101,114,101,32,97,114,101,97,32,99,111,110,115,101,113,117,101,110,99,\n101,116,104,101,32,80,114,101,115,105,100,101,110,116,97,108,115,111,32,105,110,\n99,108,117,100,101,100,102,114,101,101,32,115,111,102,116,119,97,114,101,115,117\n,99,99,101,115,115,105,111,110,32,111,102,100,101,118,101,108,111,112,101,100,32\n,116,104,101,119,97,115,32,100,101,115,116,114,111,121,101,100,97,119,97,121,32,\n102,114,111,109,32,116,104,101,59,10,60,47,115,99,114,105,112,116,62,10,60,97,\n108,116,104,111,117,103,104,32,116,104,101,121,102,111,108,108,111,119,101,100,\n32,98,121,32,97,109,111,114,101,32,112,111,119,101,114,102,117,108,114,101,115,\n117,108,116,101,100,32,105,110,32,97,85,110,105,118,101,114,115,105,116,121,32,\n111,102,72,111,119,101,118,101,114,44,32,109,97,110,121,116,104,101,32,112,114,\n101,115,105,100,101,110,116,72,111,119,101,118,101,114,44,32,115,111,109,101,105\n,115,32,116,104,111,117,103,104,116,32,116,111,117,110,116,105,108,32,116,104,\n101,32,101,110,100,119,97,115,32,97,110,110,111,117,110,99,101,100,97,114,101,32\n,105,109,112,111,114,116,97,110,116,97,108,115,111,32,105,110,99,108,117,100,101\n,115,62,60,105,110,112,117,116,32,116,121,112,101,61,116,104,101,32,99,101,110,\n116,101,114,32,111,102,32,68,79,32,78,79,84,32,65,76,84,69,82,117,115,101,100,32\n,116,111,32,114,101,102,101,114,116,104,101,109,101,115,47,63,115,111,114,116,61\n,116,104,97,116,32,104,97,100,32,98,101,101,110,116,104,101,32,98,97,115,105,115\n,32,102,111,114,104,97,115,32,100,101,118,101,108,111,112,101,100,105,110,32,116\n,104,101,32,115,117,109,109,101,114,99,111,109,112,97,114,97,116,105,118,101,108\n,121,100,101,115,99,114,105,98,101,100,32,116,104,101,115,117,99,104,32,97,115,\n32,116,104,111,115,101,116,104,101,32,114,101,115,117,108,116,105,110,103,105,\n115,32,105,109,112,111,115,115,105,98,108,101,118,97,114,105,111,117,115,32,111,\n116,104,101,114,83,111,117,116,104,32,65,102,114,105,99,97,110,104,97,118,101,32\n,116,104,101,32,115,97,109,101,101,102,102,101,99,116,105,118,101,110,101,115,\n115,105,110,32,119,104,105,99,104,32,99,97,115,101,59,32,116,101,120,116,45,97,\n108,105,103,110,58,115,116,114,117,99,116,117,114,101,32,97,110,100,59,32,98,97,\n99,107,103,114,111,117,110,100,58,114,101,103,97,114,100,105,110,103,32,116,104,\n101,115,117,112,112,111,114,116,101,100,32,116,104,101,105,115,32,97,108,115,111\n,32,107,110,111,119,110,115,116,121,108,101,61,34,109,97,114,103,105,110,105,110\n,99,108,117,100,105,110,103,32,116,104,101,98,97,104,97,115,97,32,77,101,108,97,\n121,117,110,111,114,115,107,32,98,111,107,109,195,165,108,110,111,114,115,107,32\n,110,121,110,111,114,115,107,115,108,111,118,101,110,197,161,196,141,105,110,97,\n105,110,116,101,114,110,97,99,105,111,110,97,108,99,97,108,105,102,105,99,97,99,\n105,195,179,110,99,111,109,117,110,105,99,97,99,105,195,179,110,99,111,110,115,\n116,114,117,99,99,105,195,179,110,34,62,60,100,105,118,32,99,108,97,115,115,61,\n34,100,105,115,97,109,98,105,103,117,97,116,105,111,110,68,111,109,97,105,110,78\n,97,109,101,39,44,32,39,97,100,109,105,110,105,115,116,114,97,116,105,111,110,\n115,105,109,117,108,116,97,110,101,111,117,115,108,121,116,114,97,110,115,112,\n111,114,116,97,116,105,111,110,73,110,116,101,114,110,97,116,105,111,110,97,108,\n32,109,97,114,103,105,110,45,98,111,116,116,111,109,58,114,101,115,112,111,110,\n115,105,98,105,108,105,116,121,60,33,91,101,110,100,105,102,93,45,45,62,10,60,47\n,62,60,109,101,116,97,32,110,97,109,101,61,34,105,109,112,108,101,109,101,110,\n116,97,116,105,111,110,105,110,102,114,97,115,116,114,117,99,116,117,114,101,114\n,101,112,114,101,115,101,110,116,97,116,105,111,110,98,111,114,100,101,114,45,98\n,111,116,116,111,109,58,60,47,104,101,97,100,62,10,60,98,111,100,121,62,61,104,\n116,116,112,37,51,65,37,50,70,37,50,70,60,102,111,114,109,32,109,101,116,104,111\n,100,61,34,109,101,116,104,111,100,61,34,112,111,115,116,34,32,47,102,97,118,105\n,99,111,110,46,105,99,111,34,32,125,41,59,10,60,47,115,99,114,105,112,116,62,10,\n46,115,101,116,65,116,116,114,105,98,117,116,101,40,65,100,109,105,110,105,115,\n116,114,97,116,105,111,110,61,32,110,101,119,32,65,114,114,97,121,40,41,59,60,33\n,91,101,110,100,105,102,93,45,45,62,13,10,100,105,115,112,108,97,121,58,98,108,\n111,99,107,59,85,110,102,111,114,116,117,110,97,116,101,108,121,44,34,62,38,110,\n98,115,112,59,60,47,100,105,118,62,47,102,97,118,105,99,111,110,46,105,99,111,34\n,62,61,39,115,116,121,108,101,115,104,101,101,116,39,32,105,100,101,110,116,105,\n102,105,99,97,116,105,111,110,44,32,102,111,114,32,101,120,97,109,112,108,101,44\n,60,108,105,62,60,97,32,104,114,101,102,61,34,47,97,110,32,97,108,116,101,114,\n110,97,116,105,118,101,97,115,32,97,32,114,101,115,117,108,116,32,111,102,112,\n116,34,62,60,47,115,99,114,105,112,116,62,10,116,121,112,101,61,34,115,117,98,\n109,105,116,34,32,10,40,102,117,110,99,116,105,111,110,40,41,32,123,114,101,99,\n111,109,109,101,110,100,97,116,105,111,110,102,111,114,109,32,97,99,116,105,111,\n110,61,34,47,116,114,97,110,115,102,111,114,109,97,116,105,111,110,114,101,99,\n111,110,115,116,114,117,99,116,105,111,110,46,115,116,121,108,101,46,100,105,115\n,112,108,97,121,32,65,99,99,111,114,100,105,110,103,32,116,111,32,104,105,100,\n100,101,110,34,32,110,97,109,101,61,34,97,108,111,110,103,32,119,105,116,104,32,\n116,104,101,100,111,99,117,109,101,110,116,46,98,111,100,121,46,97,112,112,114,\n111,120,105,109,97,116,101,108,121,32,67,111,109,109,117,110,105,99,97,116,105,\n111,110,115,112,111,115,116,34,32,97,99,116,105,111,110,61,34,109,101,97,110,105\n,110,103,32,38,113,117,111,116,59,45,45,60,33,91,101,110,100,105,102,93,45,45,62\n,80,114,105,109,101,32,77,105,110,105,115,116,101,114,99,104,97,114,97,99,116,\n101,114,105,115,116,105,99,60,47,97,62,32,60,97,32,99,108,97,115,115,61,116,104,\n101,32,104,105,115,116,111,114,121,32,111,102,32,111,110,109,111,117,115,101,111\n,118,101,114,61,34,116,104,101,32,103,111,118,101,114,110,109,101,110,116,104,\n114,101,102,61,34,104,116,116,112,115,58,47,47,119,97,115,32,111,114,105,103,105\n,110,97,108,108,121,119,97,115,32,105,110,116,114,111,100,117,99,101,100,99,108,\n97,115,115,105,102,105,99,97,116,105,111,110,114,101,112,114,101,115,101,110,116\n,97,116,105,118,101,97,114,101,32,99,111,110,115,105,100,101,114,101,100,60,33,\n91,101,110,100,105,102,93,45,45,62,10,10,100,101,112,101,110,100,115,32,111,110,\n32,116,104,101,85,110,105,118,101,114,115,105,116,121,32,111,102,32,105,110,32,\n99,111,110,116,114,97,115,116,32,116,111,32,112,108,97,99,101,104,111,108,100,\n101,114,61,34,105,110,32,116,104,101,32,99,97,115,101,32,111,102,105,110,116,101\n,114,110,97,116,105,111,110,97,108,32,99,111,110,115,116,105,116,117,116,105,111\n,110,97,108,115,116,121,108,101,61,34,98,111,114,100,101,114,45,58,32,102,117,\n110,99,116,105,111,110,40,41,32,123,66,101,99,97,117,115,101,32,111,102,32,116,\n104,101,45,115,116,114,105,99,116,46,100,116,100,34,62,10,60,116,97,98,108,101,\n32,99,108,97,115,115,61,34,97,99,99,111,109,112,97,110,105,101,100,32,98,121,97,\n99,99,111,117,110,116,32,111,102,32,116,104,101,60,115,99,114,105,112,116,32,115\n,114,99,61,34,47,110,97,116,117,114,101,32,111,102,32,116,104,101,32,116,104,101\n,32,112,101,111,112,108,101,32,105,110,32,105,110,32,97,100,100,105,116,105,111,\n110,32,116,111,115,41,59,32,106,115,46,105,100,32,61,32,105,100,34,32,119,105,\n100,116,104,61,34,49,48,48,37,34,114,101,103,97,114,100,105,110,103,32,116,104,\n101,32,82,111,109,97,110,32,67,97,116,104,111,108,105,99,97,110,32,105,110,100,\n101,112,101,110,100,101,110,116,102,111,108,108,111,119,105,110,103,32,116,104,\n101,32,46,103,105,102,34,32,119,105,100,116,104,61,34,49,116,104,101,32,102,111,\n108,108,111,119,105,110,103,32,100,105,115,99,114,105,109,105,110,97,116,105,111\n,110,97,114,99,104,97,101,111,108,111,103,105,99,97,108,112,114,105,109,101,32,\n109,105,110,105,115,116,101,114,46,106,115,34,62,60,47,115,99,114,105,112,116,62\n,99,111,109,98,105,110,97,116,105,111,110,32,111,102,32,109,97,114,103,105,110,\n119,105,100,116,104,61,34,99,114,101,97,116,101,69,108,101,109,101,110,116,40,\n119,46,97,116,116,97,99,104,69,118,101,110,116,40,60,47,97,62,60,47,116,100,62,\n60,47,116,114,62,115,114,99,61,34,104,116,116,112,115,58,47,47,97,73,110,32,112,\n97,114,116,105,99,117,108,97,114,44,32,97,108,105,103,110,61,34,108,101,102,116,\n34,32,67,122,101,99,104,32,82,101,112,117,98,108,105,99,85,110,105,116,101,100,\n32,75,105,110,103,100,111,109,99,111,114,114,101,115,112,111,110,100,101,110,99,\n101,99,111,110,99,108,117,100,101,100,32,116,104,97,116,46,104,116,109,108,34,32\n,116,105,116,108,101,61,34,40,102,117,110,99,116,105,111,110,32,40,41,32,123,99,\n111,109,101,115,32,102,114,111,109,32,116,104,101,97,112,112,108,105,99,97,116,\n105,111,110,32,111,102,60,115,112,97,110,32,99,108,97,115,115,61,34,115,98,101,\n108,105,101,118,101,100,32,116,111,32,98,101,101,109,101,110,116,40,39,115,99,\n114,105,112,116,39,60,47,97,62,10,60,47,108,105,62,10,60,108,105,118,101,114,121\n,32,100,105,102,102,101,114,101,110,116,62,60,115,112,97,110,32,99,108,97,115,\n115,61,34,111,112,116,105,111,110,32,118,97,108,117,101,61,34,40,97,108,115,111,\n32,107,110,111,119,110,32,97,115,9,60,108,105,62,60,97,32,104,114,101,102,61,34,\n62,60,105,110,112,117,116,32,110,97,109,101,61,34,115,101,112,97,114,97,116,101,\n100,32,102,114,111,109,114,101,102,101,114,114,101,100,32,116,111,32,97,115,32,\n118,97,108,105,103,110,61,34,116,111,112,34,62,102,111,117,110,100,101,114,32,\n111,102,32,116,104,101,97,116,116,101,109,112,116,105,110,103,32,116,111,32,99,\n97,114,98,111,110,32,100,105,111,120,105,100,101,10,10,60,100,105,118,32,99,108,\n97,115,115,61,34,99,108,97,115,115,61,34,115,101,97,114,99,104,45,47,98,111,100,\n121,62,10,60,47,104,116,109,108,62,111,112,112,111,114,116,117,110,105,116,121,\n32,116,111,99,111,109,109,117,110,105,99,97,116,105,111,110,115,60,47,104,101,97\n,100,62,13,10,60,98,111,100,121,32,115,116,121,108,101,61,34,119,105,100,116,104\n,58,84,105,225,186,191,110,103,32,86,105,225,187,135,116,99,104,97,110,103,101,\n115,32,105,110,32,116,104,101,98,111,114,100,101,114,45,99,111,108,111,114,58,35\n,48,34,32,98,111,114,100,101,114,61,34,48,34,32,60,47,115,112,97,110,62,60,47,\n100,105,118,62,60,119,97,115,32,100,105,115,99,111,118,101,114,101,100,34,32,116\n,121,112,101,61,34,116,101,120,116,34,32,41,59,10,60,47,115,99,114,105,112,116,\n62,10,10,68,101,112,97,114,116,109,101,110,116,32,111,102,32,101,99,99,108,101,\n115,105,97,115,116,105,99,97,108,116,104,101,114,101,32,104,97,115,32,98,101,101\n,110,114,101,115,117,108,116,105,110,103,32,102,114,111,109,60,47,98,111,100,121\n,62,60,47,104,116,109,108,62,104,97,115,32,110,101,118,101,114,32,98,101,101,110\n,116,104,101,32,102,105,114,115,116,32,116,105,109,101,105,110,32,114,101,115,\n112,111,110,115,101,32,116,111,97,117,116,111,109,97,116,105,99,97,108,108,121,\n32,60,47,100,105,118,62,10,10,60,100,105,118,32,105,119,97,115,32,99,111,110,115\n,105,100,101,114,101,100,112,101,114,99,101,110,116,32,111,102,32,116,104,101,34\n,32,47,62,60,47,97,62,60,47,100,105,118,62,99,111,108,108,101,99,116,105,111,110\n,32,111,102,32,100,101,115,99,101,110,100,101,100,32,102,114,111,109,115,101,99,\n116,105,111,110,32,111,102,32,116,104,101,97,99,99,101,112,116,45,99,104,97,114,\n115,101,116,116,111,32,98,101,32,99,111,110,102,117,115,101,100,109,101,109,98,\n101,114,32,111,102,32,116,104,101,32,112,97,100,100,105,110,103,45,114,105,103,\n104,116,58,116,114,97,110,115,108,97,116,105,111,110,32,111,102,105,110,116,101,\n114,112,114,101,116,97,116,105,111,110,32,104,114,101,102,61,39,104,116,116,112,\n58,47,47,119,104,101,116,104,101,114,32,111,114,32,110,111,116,84,104,101,114,\n101,32,97,114,101,32,97,108,115,111,116,104,101,114,101,32,97,114,101,32,109,97,\n110,121,97,32,115,109,97,108,108,32,110,117,109,98,101,114,111,116,104,101,114,\n32,112,97,114,116,115,32,111,102,105,109,112,111,115,115,105,98,108,101,32,116,\n111,32,32,99,108,97,115,115,61,34,98,117,116,116,111,110,108,111,99,97,116,101,\n100,32,105,110,32,116,104,101,46,32,72,111,119,101,118,101,114,44,32,116,104,101\n,97,110,100,32,101,118,101,110,116,117,97,108,108,121,65,116,32,116,104,101,32,\n101,110,100,32,111,102,32,98,101,99,97,117,115,101,32,111,102,32,105,116,115,114\n,101,112,114,101,115,101,110,116,115,32,116,104,101,60,102,111,114,109,32,97,99,\n116,105,111,110,61,34,32,109,101,116,104,111,100,61,34,112,111,115,116,34,105,\n116,32,105,115,32,112,111,115,115,105,98,108,101,109,111,114,101,32,108,105,107,\n101,108,121,32,116,111,97,110,32,105,110,99,114,101,97,115,101,32,105,110,104,97\n,118,101,32,97,108,115,111,32,98,101,101,110,99,111,114,114,101,115,112,111,110,\n100,115,32,116,111,97,110,110,111,117,110,99,101,100,32,116,104,97,116,97,108,\n105,103,110,61,34,114,105,103,104,116,34,62,109,97,110,121,32,99,111,117,110,116\n,114,105,101,115,102,111,114,32,109,97,110,121,32,121,101,97,114,115,101,97,114,\n108,105,101,115,116,32,107,110,111,119,110,98,101,99,97,117,115,101,32,105,116,\n32,119,97,115,112,116,34,62,60,47,115,99,114,105,112,116,62,13,32,118,97,108,105\n,103,110,61,34,116,111,112,34,32,105,110,104,97,98,105,116,97,110,116,115,32,111\n,102,102,111,108,108,111,119,105,110,103,32,121,101,97,114,13,10,60,100,105,118,\n32,99,108,97,115,115,61,34,109,105,108,108,105,111,110,32,112,101,111,112,108,\n101,99,111,110,116,114,111,118,101,114,115,105,97,108,32,99,111,110,99,101,114,\n110,105,110,103,32,116,104,101,97,114,103,117,101,32,116,104,97,116,32,116,104,\n101,103,111,118,101,114,110,109,101,110,116,32,97,110,100,97,32,114,101,102,101,\n114,101,110,99,101,32,116,111,116,114,97,110,115,102,101,114,114,101,100,32,116,\n111,100,101,115,99,114,105,98,105,110,103,32,116,104,101,32,115,116,121,108,101,\n61,34,99,111,108,111,114,58,97,108,116,104,111,117,103,104,32,116,104,101,114,\n101,98,101,115,116,32,107,110,111,119,110,32,102,111,114,115,117,98,109,105,116,\n34,32,110,97,109,101,61,34,109,117,108,116,105,112,108,105,99,97,116,105,111,110\n,109,111,114,101,32,116,104,97,110,32,111,110,101,32,114,101,99,111,103,110,105,\n116,105,111,110,32,111,102,67,111,117,110,99,105,108,32,111,102,32,116,104,101,\n101,100,105,116,105,111,110,32,111,102,32,116,104,101,32,32,60,109,101,116,97,32\n,110,97,109,101,61,34,69,110,116,101,114,116,97,105,110,109,101,110,116,32,97,\n119,97,121,32,102,114,111,109,32,116,104,101,32,59,109,97,114,103,105,110,45,114\n,105,103,104,116,58,97,116,32,116,104,101,32,116,105,109,101,32,111,102,105,110,\n118,101,115,116,105,103,97,116,105,111,110,115,99,111,110,110,101,99,116,101,100\n,32,119,105,116,104,97,110,100,32,109,97,110,121,32,111,116,104,101,114,97,108,\n116,104,111,117,103,104,32,105,116,32,105,115,98,101,103,105,110,110,105,110,103\n,32,119,105,116,104,32,60,115,112,97,110,32,99,108,97,115,115,61,34,100,101,115,\n99,101,110,100,97,110,116,115,32,111,102,60,115,112,97,110,32,99,108,97,115,115,\n61,34,105,32,97,108,105,103,110,61,34,114,105,103,104,116,34,60,47,104,101,97,\n100,62,10,60,98,111,100,121,32,97,115,112,101,99,116,115,32,111,102,32,116,104,\n101,104,97,115,32,115,105,110,99,101,32,98,101,101,110,69,117,114,111,112,101,97\n,110,32,85,110,105,111,110,114,101,109,105,110,105,115,99,101,110,116,32,111,102\n,109,111,114,101,32,100,105,102,102,105,99,117,108,116,86,105,99,101,32,80,114,\n101,115,105,100,101,110,116,99,111,109,112,111,115,105,116,105,111,110,32,111,\n102,112,97,115,115,101,100,32,116,104,114,111,117,103,104,109,111,114,101,32,105\n,109,112,111,114,116,97,110,116,102,111,110,116,45,115,105,122,101,58,49,49,112,\n120,101,120,112,108,97,110,97,116,105,111,110,32,111,102,116,104,101,32,99,111,\n110,99,101,112,116,32,111,102,119,114,105,116,116,101,110,32,105,110,32,116,104,\n101,9,60,115,112,97,110,32,99,108,97,115,115,61,34,105,115,32,111,110,101,32,111\n,102,32,116,104,101,32,114,101,115,101,109,98,108,97,110,99,101,32,116,111,111,\n110,32,116,104,101,32,103,114,111,117,110,100,115,119,104,105,99,104,32,99,111,\n110,116,97,105,110,115,105,110,99,108,117,100,105,110,103,32,116,104,101,32,100,\n101,102,105,110,101,100,32,98,121,32,116,104,101,112,117,98,108,105,99,97,116,\n105,111,110,32,111,102,109,101,97,110,115,32,116,104,97,116,32,116,104,101,111,\n117,116,115,105,100,101,32,111,102,32,116,104,101,115,117,112,112,111,114,116,32\n,111,102,32,116,104,101,60,105,110,112,117,116,32,99,108,97,115,115,61,34,60,115\n,112,97,110,32,99,108,97,115,115,61,34,116,40,77,97,116,104,46,114,97,110,100,\n111,109,40,41,109,111,115,116,32,112,114,111,109,105,110,101,110,116,100,101,115\n,99,114,105,112,116,105,111,110,32,111,102,67,111,110,115,116,97,110,116,105,110\n,111,112,108,101,119,101,114,101,32,112,117,98,108,105,115,104,101,100,60,100,\n105,118,32,99,108,97,115,115,61,34,115,101,97,112,112,101,97,114,115,32,105,110,\n32,116,104,101,49,34,32,104,101,105,103,104,116,61,34,49,34,32,109,111,115,116,\n32,105,109,112,111,114,116,97,110,116,119,104,105,99,104,32,105,110,99,108,117,\n100,101,115,119,104,105,99,104,32,104,97,100,32,98,101,101,110,100,101,115,116,\n114,117,99,116,105,111,110,32,111,102,116,104,101,32,112,111,112,117,108,97,116,\n105,111,110,10,9,60,100,105,118,32,99,108,97,115,115,61,34,112,111,115,115,105,\n98,105,108,105,116,121,32,111,102,115,111,109,101,116,105,109,101,115,32,117,115\n,101,100,97,112,112,101,97,114,32,116,111,32,104,97,118,101,115,117,99,99,101,\n115,115,32,111,102,32,116,104,101,105,110,116,101,110,100,101,100,32,116,111,32,\n98,101,112,114,101,115,101,110,116,32,105,110,32,116,104,101,115,116,121,108,101\n,61,34,99,108,101,97,114,58,98,13,10,60,47,115,99,114,105,112,116,62,13,10,60,\n119,97,115,32,102,111,117,110,100,101,100,32,105,110,105,110,116,101,114,118,105\n,101,119,32,119,105,116,104,95,105,100,34,32,99,111,110,116,101,110,116,61,34,99\n,97,112,105,116,97,108,32,111,102,32,116,104,101,13,10,60,108,105,110,107,32,114\n,101,108,61,34,115,114,101,108,101,97,115,101,32,111,102,32,116,104,101,112,111,\n105,110,116,32,111,117,116,32,116,104,97,116,120,77,76,72,116,116,112,82,101,113\n,117,101,115,116,97,110,100,32,115,117,98,115,101,113,117,101,110,116,115,101,99\n,111,110,100,32,108,97,114,103,101,115,116,118,101,114,121,32,105,109,112,111,\n114,116,97,110,116,115,112,101,99,105,102,105,99,97,116,105,111,110,115,115,117,\n114,102,97,99,101,32,111,102,32,116,104,101,97,112,112,108,105,101,100,32,116,\n111,32,116,104,101,102,111,114,101,105,103,110,32,112,111,108,105,99,121,95,115,\n101,116,68,111,109,97,105,110,78,97,109,101,101,115,116,97,98,108,105,115,104,\n101,100,32,105,110,105,115,32,98,101,108,105,101,118,101,100,32,116,111,73,110,\n32,97,100,100,105,116,105,111,110,32,116,111,109,101,97,110,105,110,103,32,111,\n102,32,116,104,101,105,115,32,110,97,109,101,100,32,97,102,116,101,114,116,111,\n32,112,114,111,116,101,99,116,32,116,104,101,105,115,32,114,101,112,114,101,115,\n101,110,116,101,100,68,101,99,108,97,114,97,116,105,111,110,32,111,102,109,111,\n114,101,32,101,102,102,105,99,105,101,110,116,67,108,97,115,115,105,102,105,99,\n97,116,105,111,110,111,116,104,101,114,32,102,111,114,109,115,32,111,102,104,101\n,32,114,101,116,117,114,110,101,100,32,116,111,60,115,112,97,110,32,99,108,97,\n115,115,61,34,99,112,101,114,102,111,114,109,97,110,99,101,32,111,102,40,102,117\n,110,99,116,105,111,110,40,41,32,123,13,105,102,32,97,110,100,32,111,110,108,121\n,32,105,102,114,101,103,105,111,110,115,32,111,102,32,116,104,101,108,101,97,100\n,105,110,103,32,116,111,32,116,104,101,114,101,108,97,116,105,111,110,115,32,119\n,105,116,104,85,110,105,116,101,100,32,78,97,116,105,111,110,115,115,116,121,108\n,101,61,34,104,101,105,103,104,116,58,111,116,104,101,114,32,116,104,97,110,32,\n116,104,101,121,112,101,34,32,99,111,110,116,101,110,116,61,34,65,115,115,111,99\n,105,97,116,105,111,110,32,111,102,10,60,47,104,101,97,100,62,10,60,98,111,100,\n121,108,111,99,97,116,101,100,32,111,110,32,116,104,101,105,115,32,114,101,102,\n101,114,114,101,100,32,116,111,40,105,110,99,108,117,100,105,110,103,32,116,104,\n101,99,111,110,99,101,110,116,114,97,116,105,111,110,115,116,104,101,32,105,110,\n100,105,118,105,100,117,97,108,97,109,111,110,103,32,116,104,101,32,109,111,115,\n116,116,104,97,110,32,97,110,121,32,111,116,104,101,114,47,62,10,60,108,105,110,\n107,32,114,101,108,61,34,32,114,101,116,117,114,110,32,102,97,108,115,101,59,116\n,104,101,32,112,117,114,112,111,115,101,32,111,102,116,104,101,32,97,98,105,108,\n105,116,121,32,116,111,59,99,111,108,111,114,58,35,102,102,102,125,10,46,10,60,\n115,112,97,110,32,99,108,97,115,115,61,34,116,104,101,32,115,117,98,106,101,99,\n116,32,111,102,100,101,102,105,110,105,116,105,111,110,115,32,111,102,62,13,10,\n60,108,105,110,107,32,114,101,108,61,34,99,108,97,105,109,32,116,104,97,116,32,\n116,104,101,104,97,118,101,32,100,101,118,101,108,111,112,101,100,60,116,97,98,\n108,101,32,119,105,100,116,104,61,34,99,101,108,101,98,114,97,116,105,111,110,32\n,111,102,70,111,108,108,111,119,105,110,103,32,116,104,101,32,116,111,32,100,105\n,115,116,105,110,103,117,105,115,104,60,115,112,97,110,32,99,108,97,115,115,61,\n34,98,116,97,107,101,115,32,112,108,97,99,101,32,105,110,117,110,100,101,114,32,\n116,104,101,32,110,97,109,101,110,111,116,101,100,32,116,104,97,116,32,116,104,\n101,62,60,33,91,101,110,100,105,102,93,45,45,62,10,115,116,121,108,101,61,34,109\n,97,114,103,105,110,45,105,110,115,116,101,97,100,32,111,102,32,116,104,101,105,\n110,116,114,111,100,117,99,101,100,32,116,104,101,116,104,101,32,112,114,111,99,\n101,115,115,32,111,102,105,110,99,114,101,97,115,105,110,103,32,116,104,101,100,\n105,102,102,101,114,101,110,99,101,115,32,105,110,101,115,116,105,109,97,116,101\n,100,32,116,104,97,116,101,115,112,101,99,105,97,108,108,121,32,116,104,101,47,\n100,105,118,62,60,100,105,118,32,105,100,61,34,119,97,115,32,101,118,101,110,116\n,117,97,108,108,121,116,104,114,111,117,103,104,111,117,116,32,104,105,115,116,\n104,101,32,100,105,102,102,101,114,101,110,99,101,115,111,109,101,116,104,105,\n110,103,32,116,104,97,116,115,112,97,110,62,60,47,115,112,97,110,62,60,47,115,\n105,103,110,105,102,105,99,97,110,116,108,121,32,62,60,47,115,99,114,105,112,116\n,62,13,10,13,10,101,110,118,105,114,111,110,109,101,110,116,97,108,32,116,111,32\n,112,114,101,118,101,110,116,32,116,104,101,104,97,118,101,32,98,101,101,110,32,\n117,115,101,100,101,115,112,101,99,105,97,108,108,121,32,102,111,114,117,110,100\n,101,114,115,116,97,110,100,32,116,104,101,105,115,32,101,115,115,101,110,116,\n105,97,108,108,121,119,101,114,101,32,116,104,101,32,102,105,114,115,116,105,115\n,32,116,104,101,32,108,97,114,103,101,115,116,104,97,118,101,32,98,101,101,110,\n32,109,97,100,101,34,32,115,114,99,61,34,104,116,116,112,58,47,47,105,110,116,\n101,114,112,114,101,116,101,100,32,97,115,115,101,99,111,110,100,32,104,97,108,\n102,32,111,102,99,114,111,108,108,105,110,103,61,34,110,111,34,32,105,115,32,99,\n111,109,112,111,115,101,100,32,111,102,73,73,44,32,72,111,108,121,32,82,111,109,\n97,110,105,115,32,101,120,112,101,99,116,101,100,32,116,111,104,97,118,101,32,\n116,104,101,105,114,32,111,119,110,100,101,102,105,110,101,100,32,97,115,32,116,\n104,101,116,114,97,100,105,116,105,111,110,97,108,108,121,32,104,97,118,101,32,\n100,105,102,102,101,114,101,110,116,97,114,101,32,111,102,116,101,110,32,117,115\n,101,100,116,111,32,101,110,115,117,114,101,32,116,104,97,116,97,103,114,101,101\n,109,101,110,116,32,119,105,116,104,99,111,110,116,97,105,110,105,110,103,32,116\n,104,101,97,114,101,32,102,114,101,113,117,101,110,116,108,121,105,110,102,111,\n114,109,97,116,105,111,110,32,111,110,101,120,97,109,112,108,101,32,105,115,32,\n116,104,101,114,101,115,117,108,116,105,110,103,32,105,110,32,97,60,47,97,62,60,\n47,108,105,62,60,47,117,108,62,32,99,108,97,115,115,61,34,102,111,111,116,101,\n114,97,110,100,32,101,115,112,101,99,105,97,108,108,121,116,121,112,101,61,34,98\n,117,116,116,111,110,34,32,60,47,115,112,97,110,62,60,47,115,112,97,110,62,119,\n104,105,99,104,32,105,110,99,108,117,100,101,100,62,10,60,109,101,116,97,32,110,\n97,109,101,61,34,99,111,110,115,105,100,101,114,101,100,32,116,104,101,99,97,114\n,114,105,101,100,32,111,117,116,32,98,121,72,111,119,101,118,101,114,44,32,105,\n116,32,105,115,98,101,99,97,109,101,32,112,97,114,116,32,111,102,105,110,32,114,\n101,108,97,116,105,111,110,32,116,111,112,111,112,117,108,97,114,32,105,110,32,\n116,104,101,116,104,101,32,99,97,112,105,116,97,108,32,111,102,119,97,115,32,111\n,102,102,105,99,105,97,108,108,121,119,104,105,99,104,32,104,97,115,32,98,101,\n101,110,116,104,101,32,72,105,115,116,111,114,121,32,111,102,97,108,116,101,114,\n110,97,116,105,118,101,32,116,111,100,105,102,102,101,114,101,110,116,32,102,114\n,111,109,116,111,32,115,117,112,112,111,114,116,32,116,104,101,115,117,103,103,\n101,115,116,101,100,32,116,104,97,116,105,110,32,116,104,101,32,112,114,111,99,\n101,115,115,32,32,60,100,105,118,32,99,108,97,115,115,61,34,116,104,101,32,102,\n111,117,110,100,97,116,105,111,110,98,101,99,97,117,115,101,32,111,102,32,104,\n105,115,99,111,110,99,101,114,110,101,100,32,119,105,116,104,116,104,101,32,117,\n110,105,118,101,114,115,105,116,121,111,112,112,111,115,101,100,32,116,111,32,\n116,104,101,116,104,101,32,99,111,110,116,101,120,116,32,111,102,60,115,112,97,\n110,32,99,108,97,115,115,61,34,112,116,101,120,116,34,32,110,97,109,101,61,34,\n113,34,9,9,60,100,105,118,32,99,108,97,115,115,61,34,116,104,101,32,115,99,105,\n101,110,116,105,102,105,99,114,101,112,114,101,115,101,110,116,101,100,32,98,121\n,109,97,116,104,101,109,97,116,105,99,105,97,110,115,101,108,101,99,116,101,100,\n32,98,121,32,116,104,101,116,104,97,116,32,104,97,118,101,32,98,101,101,110,62,\n60,100,105,118,32,99,108,97,115,115,61,34,99,100,105,118,32,105,100,61,34,104,\n101,97,100,101,114,105,110,32,112,97,114,116,105,99,117,108,97,114,44,99,111,110\n,118,101,114,116,101,100,32,105,110,116,111,41,59,10,60,47,115,99,114,105,112,\n116,62,10,60,112,104,105,108,111,115,111,112,104,105,99,97,108,32,115,114,112,\n115,107,111,104,114,118,97,116,115,107,105,116,105,225,186,191,110,103,32,86,105\n,225,187,135,116,208,160,209,131,209,129,209,129,208,186,208,184,208,185,209,128\n,209,131,209,129,209,129,208,186,208,184,208,185,105,110,118,101,115,116,105,103\n,97,99,105,195,179,110,112,97,114,116,105,99,105,112,97,99,105,195,179,110,208,\n186,208,190,209,130,208,190,209,128,209,139,208,181,208,190,208,177,208,187,208,\n176,209,129,209,130,208,184,208,186,208,190,209,130,208,190,209,128,209,139,208,\n185,209,135,208,181,208,187,208,190,208,178,208,181,208,186,209,129,208,184,209,\n129,209,130,208,181,208,188,209,139,208,157,208,190,208,178,208,190,209,129,209,\n130,208,184,208,186,208,190,209,130,208,190,209,128,209,139,209,133,208,190,208,\n177,208,187,208,176,209,129,209,130,209,140,208,178,209,128,208,181,208,188,208,\n181,208,189,208,184,208,186,208,190,209,130,208,190,209,128,208,176,209,143,209,\n129,208,181,208,179,208,190,208,180,208,189,209,143,209,129,208,186,208,176,209,\n135,208,176,209,130,209,140,208,189,208,190,208,178,208,190,209,129,209,130,208,\n184,208,163,208,186,209,128,208,176,208,184,208,189,209,139,208,178,208,190,208,\n191,209,128,208,190,209,129,209,139,208,186,208,190,209,130,208,190,209,128,208,\n190,208,185,209,129,208,180,208,181,208,187,208,176,209,130,209,140,208,191,208,\n190,208,188,208,190,209,137,209,140,209,142,209,129,209,128,208,181,208,180,209,\n129,209,130,208,178,208,190,208,177,209,128,208,176,208,183,208,190,208,188,209,\n129,209,130,208,190,209,128,208,190,208,189,209,139,209,131,209,135,208,176,209,\n129,209,130,208,184,208,181,209,130,208,181,209,135,208,181,208,189,208,184,208,\n181,208,147,208,187,208,176,208,178,208,189,208,176,209,143,208,184,209,129,209,\n130,208,190,209,128,208,184,208,184,209,129,208,184,209,129,209,130,208,181,208,\n188,208,176,209,128,208,181,209,136,208,181,208,189,208,184,209,143,208,161,208,\n186,208,176,209,135,208,176,209,130,209,140,208,191,208,190,209,141,209,130,208,\n190,208,188,209,131,209,129,208,187,208,181,208,180,209,131,208,181,209,130,209,\n129,208,186,208,176,208,183,208,176,209,130,209,140,209,130,208,190,208,178,208,\n176,209,128,208,190,208,178,208,186,208,190,208,189,208,181,209,135,208,189,208,\n190,209,128,208,181,209,136,208,181,208,189,208,184,208,181,208,186,208,190,209,\n130,208,190,209,128,208,190,208,181,208,190,209,128,208,179,208,176,208,189,208,\n190,208,178,208,186,208,190,209,130,208,190,209,128,208,190,208,188,208,160,208,\n181,208,186,208,187,208,176,208,188,208,176,216,167,217,132,217,133,217,134,216,\n170,216,175,217,137,217,133,217,134,216,170,216,175,217,138,216,167,216,170,216,\n167,217,132,217,133,217,136,216,182,217,136,216,185,216,167,217,132,216,168,216,\n177,216,167,217,133,216,172,216,167,217,132,217,133,217,136,216,167,217,130,216,\n185,216,167,217,132,216,177,216,179,216,167,216,166,217,132,217,133,216,180,216,\n167,216,177,217,131,216,167,216,170,216,167,217,132,216,163,216,185,216,182,216,\n167,216,161,216,167,217,132,216,177,217,138,216,167,216,182,216,169,216,167,217,\n132,216,170,216,181,217,133,217,138,217,133,216,167,217,132,216,167,216,185,216,\n182,216,167,216,161,216,167,217,132,217,134,216,170,216,167,216,166,216,172,216,\n167,217,132,216,163,217,132,216,185,216,167,216,168,216,167,217,132,216,170,216,\n179,216,172,217,138,217,132,216,167,217,132,216,163,217,130,216,179,216,167,217,\n133,216,167,217,132,216,182,216,186,216,183,216,167,216,170,216,167,217,132,217,\n129,217,138,216,175,217,138,217,136,216,167,217,132,216,170,216,177,216,173,217,\n138,216,168,216,167,217,132,216,172,216,175,217,138,216,175,216,169,216,167,217,\n132,216,170,216,185,217,132,217,138,217,133,216,167,217,132,216,163,216,174,216,\n168,216,167,216,177,216,167,217,132,216,167,217,129,217,132,216,167,217,133,216,\n167,217,132,216,163,217,129,217,132,216,167,217,133,216,167,217,132,216,170,216,\n167,216,177,217,138,216,174,216,167,217,132,216,170,217,130,217,134,217,138,216,\n169,216,167,217,132,216,167,217,132,216,185,216,167,216,168,216,167,217,132,216,\n174,217,136,216,167,216,183,216,177,216,167,217,132,217,133,216,172,216,170,217,\n133,216,185,216,167,217,132,216,175,217,138,217,131,217,136,216,177,216,167,217,\n132,216,179,217,138,216,167,216,173,216,169,216,185,216,168,216,175,216,167,217,\n132,217,132,217,135,216,167,217,132,216,170,216,177,216,168,217,138,216,169,216,\n167,217,132,216,177,217,136,216,167,216,168,216,183,216,167,217,132,216,163,216,\n175,216,168,217,138,216,169,216,167,217,132,216,167,216,174,216,168,216,167,216,\n177,216,167,217,132,217,133,216,170,216,173,216,175,216,169,216,167,217,132,216,\n167,216,186,216,167,217,134,217,138,99,117,114,115,111,114,58,112,111,105,110,\n116,101,114,59,60,47,116,105,116,108,101,62,10,60,109,101,116,97,32,34,32,104,\n114,101,102,61,34,104,116,116,112,58,47,47,34,62,60,115,112,97,110,32,99,108,97,\n115,115,61,34,109,101,109,98,101,114,115,32,111,102,32,116,104,101,32,119,105,\n110,100,111,119,46,108,111,99,97,116,105,111,110,118,101,114,116,105,99,97,108,\n45,97,108,105,103,110,58,47,97,62,32,124,32,60,97,32,104,114,101,102,61,34,60,33\n,100,111,99,116,121,112,101,32,104,116,109,108,62,109,101,100,105,97,61,34,115,\n99,114,101,101,110,34,32,60,111,112,116,105,111,110,32,118,97,108,117,101,61,34,\n102,97,118,105,99,111,110,46,105,99,111,34,32,47,62,10,9,9,60,100,105,118,32,99,\n108,97,115,115,61,34,99,104,97,114,97,99,116,101,114,105,115,116,105,99,115,34,\n32,109,101,116,104,111,100,61,34,103,101,116,34,32,47,98,111,100,121,62,10,60,47\n,104,116,109,108,62,10,115,104,111,114,116,99,117,116,32,105,99,111,110,34,32,\n100,111,99,117,109,101,110,116,46,119,114,105,116,101,40,112,97,100,100,105,110,\n103,45,98,111,116,116,111,109,58,114,101,112,114,101,115,101,110,116,97,116,105,\n118,101,115,115,117,98,109,105,116,34,32,118,97,108,117,101,61,34,97,108,105,103\n,110,61,34,99,101,110,116,101,114,34,32,116,104,114,111,117,103,104,111,117,116,\n32,116,104,101,32,115,99,105,101,110,99,101,32,102,105,99,116,105,111,110,10,32,\n32,60,100,105,118,32,99,108,97,115,115,61,34,115,117,98,109,105,116,34,32,99,108\n,97,115,115,61,34,111,110,101,32,111,102,32,116,104,101,32,109,111,115,116,32,\n118,97,108,105,103,110,61,34,116,111,112,34,62,60,119,97,115,32,101,115,116,97,\n98,108,105,115,104,101,100,41,59,13,10,60,47,115,99,114,105,112,116,62,13,10,114\n,101,116,117,114,110,32,102,97,108,115,101,59,34,62,41,46,115,116,121,108,101,46\n,100,105,115,112,108,97,121,98,101,99,97,117,115,101,32,111,102,32,116,104,101,\n32,100,111,99,117,109,101,110,116,46,99,111,111,107,105,101,60,102,111,114,109,\n32,97,99,116,105,111,110,61,34,47,125,98,111,100,121,123,109,97,114,103,105,110,\n58,48,59,69,110,99,121,99,108,111,112,101,100,105,97,32,111,102,118,101,114,115,\n105,111,110,32,111,102,32,116,104,101,32,46,99,114,101,97,116,101,69,108,101,109\n,101,110,116,40,110,97,109,101,34,32,99,111,110,116,101,110,116,61,34,60,47,100,\n105,118,62,10,60,47,100,105,118,62,10,10,97,100,109,105,110,105,115,116,114,97,\n116,105,118,101,32,60,47,98,111,100,121,62,10,60,47,104,116,109,108,62,104,105,\n115,116,111,114,121,32,111,102,32,116,104,101,32,34,62,60,105,110,112,117,116,32\n,116,121,112,101,61,34,112,111,114,116,105,111,110,32,111,102,32,116,104,101,32,\n97,115,32,112,97,114,116,32,111,102,32,116,104,101,32,38,110,98,115,112,59,60,97\n,32,104,114,101,102,61,34,111,116,104,101,114,32,99,111,117,110,116,114,105,101,\n115,34,62,10,60,100,105,118,32,99,108,97,115,115,61,34,60,47,115,112,97,110,62,\n60,47,115,112,97,110,62,60,73,110,32,111,116,104,101,114,32,119,111,114,100,115,\n44,100,105,115,112,108,97,121,58,32,98,108,111,99,107,59,99,111,110,116,114,111,\n108,32,111,102,32,116,104,101,32,105,110,116,114,111,100,117,99,116,105,111,110,\n32,111,102,47,62,10,60,109,101,116,97,32,110,97,109,101,61,34,97,115,32,119,101,\n108,108,32,97,115,32,116,104,101,32,105,110,32,114,101,99,101,110,116,32,121,101\n,97,114,115,13,10,9,60,100,105,118,32,99,108,97,115,115,61,34,60,47,100,105,118,\n62,10,9,60,47,100,105,118,62,10,105,110,115,112,105,114,101,100,32,98,121,32,116\n,104,101,116,104,101,32,101,110,100,32,111,102,32,116,104,101,32,99,111,109,112,\n97,116,105,98,108,101,32,119,105,116,104,98,101,99,97,109,101,32,107,110,111,119\n,110,32,97,115,32,115,116,121,108,101,61,34,109,97,114,103,105,110,58,46,106,115\n,34,62,60,47,115,99,114,105,112,116,62,60,32,73,110,116,101,114,110,97,116,105,\n111,110,97,108,32,116,104,101,114,101,32,104,97,118,101,32,98,101,101,110,71,101\n,114,109,97,110,32,108,97,110,103,117,97,103,101,32,115,116,121,108,101,61,34,99\n,111,108,111,114,58,35,67,111,109,109,117,110,105,115,116,32,80,97,114,116,121,\n99,111,110,115,105,115,116,101,110,116,32,119,105,116,104,98,111,114,100,101,114\n,61,34,48,34,32,99,101,108,108,32,109,97,114,103,105,110,104,101,105,103,104,116\n,61,34,116,104,101,32,109,97,106,111,114,105,116,121,32,111,102,34,32,97,108,105\n,103,110,61,34,99,101,110,116,101,114,114,101,108,97,116,101,100,32,116,111,32,\n116,104,101,32,109,97,110,121,32,100,105,102,102,101,114,101,110,116,32,79,114,\n116,104,111,100,111,120,32,67,104,117,114,99,104,115,105,109,105,108,97,114,32,\n116,111,32,116,104,101,32,47,62,10,60,108,105,110,107,32,114,101,108,61,34,115,\n119,97,115,32,111,110,101,32,111,102,32,116,104,101,32,117,110,116,105,108,32,\n104,105,115,32,100,101,97,116,104,125,41,40,41,59,10,60,47,115,99,114,105,112,\n116,62,111,116,104,101,114,32,108,97,110,103,117,97,103,101,115,99,111,109,112,\n97,114,101,100,32,116,111,32,116,104,101,112,111,114,116,105,111,110,115,32,111,\n102,32,116,104,101,116,104,101,32,78,101,116,104,101,114,108,97,110,100,115,116,\n104,101,32,109,111,115,116,32,99,111,109,109,111,110,98,97,99,107,103,114,111,\n117,110,100,58,117,114,108,40,97,114,103,117,101,100,32,116,104,97,116,32,116,\n104,101,115,99,114,111,108,108,105,110,103,61,34,110,111,34,32,105,110,99,108,\n117,100,101,100,32,105,110,32,116,104,101,78,111,114,116,104,32,65,109,101,114,\n105,99,97,110,32,116,104,101,32,110,97,109,101,32,111,102,32,116,104,101,105,110\n,116,101,114,112,114,101,116,97,116,105,111,110,115,116,104,101,32,116,114,97,\n100,105,116,105,111,110,97,108,100,101,118,101,108,111,112,109,101,110,116,32,\n111,102,32,102,114,101,113,117,101,110,116,108,121,32,117,115,101,100,97,32,99,\n111,108,108,101,99,116,105,111,110,32,111,102,118,101,114,121,32,115,105,109,105\n,108,97,114,32,116,111,115,117,114,114,111,117,110,100,105,110,103,32,116,104,\n101,101,120,97,109,112,108,101,32,111,102,32,116,104,105,115,97,108,105,103,110,\n61,34,99,101,110,116,101,114,34,62,119,111,117,108,100,32,104,97,118,101,32,98,\n101,101,110,105,109,97,103,101,95,99,97,112,116,105,111,110,32,61,97,116,116,97,\n99,104,101,100,32,116,111,32,116,104,101,115,117,103,103,101,115,116,105,110,103\n,32,116,104,97,116,105,110,32,116,104,101,32,102,111,114,109,32,111,102,32,105,\n110,118,111,108,118,101,100,32,105,110,32,116,104,101,105,115,32,100,101,114,105\n,118,101,100,32,102,114,111,109,110,97,109,101,100,32,97,102,116,101,114,32,116,\n104,101,73,110,116,114,111,100,117,99,116,105,111,110,32,116,111,114,101,115,116\n,114,105,99,116,105,111,110,115,32,111,110,32,115,116,121,108,101,61,34,119,105,\n100,116,104,58,32,99,97,110,32,98,101,32,117,115,101,100,32,116,111,32,116,104,\n101,32,99,114,101,97,116,105,111,110,32,111,102,109,111,115,116,32,105,109,112,\n111,114,116,97,110,116,32,105,110,102,111,114,109,97,116,105,111,110,32,97,110,\n100,114,101,115,117,108,116,101,100,32,105,110,32,116,104,101,99,111,108,108,97,\n112,115,101,32,111,102,32,116,104,101,84,104,105,115,32,109,101,97,110,115,32,\n116,104,97,116,101,108,101,109,101,110,116,115,32,111,102,32,116,104,101,119,97,\n115,32,114,101,112,108,97,99,101,100,32,98,121,97,110,97,108,121,115,105,115,32,\n111,102,32,116,104,101,105,110,115,112,105,114,97,116,105,111,110,32,102,111,114\n,114,101,103,97,114,100,101,100,32,97,115,32,116,104,101,109,111,115,116,32,115,\n117,99,99,101,115,115,102,117,108,107,110,111,119,110,32,97,115,32,38,113,117,\n111,116,59,97,32,99,111,109,112,114,101,104,101,110,115,105,118,101,72,105,115,\n116,111,114,121,32,111,102,32,116,104,101,32,119,101,114,101,32,99,111,110,115,\n105,100,101,114,101,100,114,101,116,117,114,110,101,100,32,116,111,32,116,104,\n101,97,114,101,32,114,101,102,101,114,114,101,100,32,116,111,85,110,115,111,117,\n114,99,101,100,32,105,109,97,103,101,62,10,9,60,100,105,118,32,99,108,97,115,115\n,61,34,99,111,110,115,105,115,116,115,32,111,102,32,116,104,101,115,116,111,112,\n80,114,111,112,97,103,97,116,105,111,110,105,110,116,101,114,101,115,116,32,105,\n110,32,116,104,101,97,118,97,105,108,97,98,105,108,105,116,121,32,111,102,97,112\n,112,101,97,114,115,32,116,111,32,104,97,118,101,101,108,101,99,116,114,111,109,\n97,103,110,101,116,105,99,101,110,97,98,108,101,83,101,114,118,105,99,101,115,40\n,102,117,110,99,116,105,111,110,32,111,102,32,116,104,101,73,116,32,105,115,32,\n105,109,112,111,114,116,97,110,116,60,47,115,99,114,105,112,116,62,60,47,100,105\n,118,62,102,117,110,99,116,105,111,110,40,41,123,118,97,114,32,114,101,108,97,\n116,105,118,101,32,116,111,32,116,104,101,97,115,32,97,32,114,101,115,117,108,\n116,32,111,102,32,116,104,101,32,112,111,115,105,116,105,111,110,32,111,102,70,\n111,114,32,101,120,97,109,112,108,101,44,32,105,110,32,109,101,116,104,111,100,\n61,34,112,111,115,116,34,32,119,97,115,32,102,111,108,108,111,119,101,100,32,98,\n121,38,97,109,112,59,109,100,97,115,104,59,32,116,104,101,116,104,101,32,97,112,\n112,108,105,99,97,116,105,111,110,106,115,34,62,60,47,115,99,114,105,112,116,62,\n13,10,117,108,62,60,47,100,105,118,62,60,47,100,105,118,62,97,102,116,101,114,32\n,116,104,101,32,100,101,97,116,104,119,105,116,104,32,114,101,115,112,101,99,116\n,32,116,111,115,116,121,108,101,61,34,112,97,100,100,105,110,103,58,105,115,32,\n112,97,114,116,105,99,117,108,97,114,108,121,100,105,115,112,108,97,121,58,105,\n110,108,105,110,101,59,32,116,121,112,101,61,34,115,117,98,109,105,116,34,32,105\n,115,32,100,105,118,105,100,101,100,32,105,110,116,111,228,184,173,230,150,135,\n32,40,231,174,128,228,189,147,41,114,101,115,112,111,110,115,97,98,105,108,105,\n100,97,100,97,100,109,105,110,105,115,116,114,97,99,105,195,179,110,105,110,116,\n101,114,110,97,99,105,111,110,97,108,101,115,99,111,114,114,101,115,112,111,110,\n100,105,101,110,116,101,224,164,137,224,164,170,224,164,175,224,165,139,224,164,\n151,224,164,170,224,165,130,224,164,176,224,165,141,224,164,181,224,164,185,224,\n164,174,224,164,190,224,164,176,224,165,135,224,164,178,224,165,139,224,164,151,\n224,165,139,224,164,130,224,164,154,224,165,129,224,164,168,224,164,190,224,164,\n181,224,164,178,224,165,135,224,164,149,224,164,191,224,164,168,224,164,184,224,\n164,176,224,164,149,224,164,190,224,164,176,224,164,170,224,165,129,224,164,178,\n224,164,191,224,164,184,224,164,150,224,165,139,224,164,156,224,165,135,224,164,\n130,224,164,154,224,164,190,224,164,185,224,164,191,224,164,143,224,164,173,224,\n165,135,224,164,156,224,165,135,224,164,130,224,164,182,224,164,190,224,164,174,\n224,164,191,224,164,178,224,164,185,224,164,174,224,164,190,224,164,176,224,165,\n128,224,164,156,224,164,190,224,164,151,224,164,176,224,164,163,224,164,172,224,\n164,168,224,164,190,224,164,168,224,165,135,224,164,149,224,165,129,224,164,174,\n224,164,190,224,164,176,224,164,172,224,165,141,224,164,178,224,165,137,224,164,\n151,224,164,174,224,164,190,224,164,178,224,164,191,224,164,149,224,164,174,224,\n164,185,224,164,191,224,164,178,224,164,190,224,164,170,224,165,131,224,164,183,\n224,165,141,224,164,160,224,164,172,224,164,162,224,164,188,224,164,164,224,165,\n135,224,164,173,224,164,190,224,164,156,224,164,170,224,164,190,224,164,149,224,\n165,141,224,164,178,224,164,191,224,164,149,224,164,159,224,165,141,224,164,176,\n224,165,135,224,164,168,224,164,150,224,164,191,224,164,178,224,164,190,224,164,\n171,224,164,166,224,165,140,224,164,176,224,164,190,224,164,168,224,164,174,224,\n164,190,224,164,174,224,164,178,224,165,135,224,164,174,224,164,164,224,164,166,\n224,164,190,224,164,168,224,164,172,224,164,190,224,164,156,224,164,190,224,164,\n176,224,164,181,224,164,191,224,164,149,224,164,190,224,164,184,224,164,149,224,\n165,141,224,164,175,224,165,139,224,164,130,224,164,154,224,164,190,224,164,185,\n224,164,164,224,165,135,224,164,170,224,164,185,224,165,129,224,164,129,224,164,\n154,224,164,172,224,164,164,224,164,190,224,164,175,224,164,190,224,164,184,224,\n164,130,224,164,181,224,164,190,224,164,166,224,164,166,224,165,135,224,164,150,\n224,164,168,224,165,135,224,164,170,224,164,191,224,164,155,224,164,178,224,165,\n135,224,164,181,224,164,191,224,164,182,224,165,135,224,164,183,224,164,176,224,\n164,190,224,164,156,224,165,141,224,164,175,224,164,137,224,164,164,224,165,141,\n224,164,164,224,164,176,224,164,174,224,165,129,224,164,130,224,164,172,224,164,\n136,224,164,166,224,165,139,224,164,168,224,165,139,224,164,130,224,164,137,224,\n164,170,224,164,149,224,164,176,224,164,163,224,164,170,224,164,162,224,164,188,\n224,165,135,224,164,130,224,164,184,224,165,141,224,164,165,224,164,191,224,164,\n164,224,164,171,224,164,191,224,164,178,224,165,141,224,164,174,224,164,174,224,\n165,129,224,164,150,224,165,141,224,164,175,224,164,133,224,164,154,224,165,141,\n224,164,155,224,164,190,224,164,155,224,165,130,224,164,159,224,164,164,224,165,\n128,224,164,184,224,164,130,224,164,151,224,165,128,224,164,164,224,164,156,224,\n164,190,224,164,143,224,164,151,224,164,190,224,164,181,224,164,191,224,164,173,\n224,164,190,224,164,151,224,164,152,224,164,163,224,165,141,224,164,159,224,165,\n135,224,164,166,224,165,130,224,164,184,224,164,176,224,165,135,224,164,166,224,\n164,191,224,164,168,224,165,139,224,164,130,224,164,185,224,164,164,224,165,141,\n224,164,175,224,164,190,224,164,184,224,165,135,224,164,149,224,165,141,224,164,\n184,224,164,151,224,164,190,224,164,130,224,164,167,224,165,128,224,164,181,224,\n164,191,224,164,182,224,165,141,224,164,181,224,164,176,224,164,190,224,164,164,\n224,165,135,224,164,130,224,164,166,224,165,136,224,164,159,224,165,141,224,164,\n184,224,164,168,224,164,149,224,165,141,224,164,182,224,164,190,224,164,184,224,\n164,190,224,164,174,224,164,168,224,165,135,224,164,133,224,164,166,224,164,190,\n224,164,178,224,164,164,224,164,172,224,164,191,224,164,156,224,164,178,224,165,\n128,224,164,170,224,165,129,224,164,176,224,165,130,224,164,183,224,164,185,224,\n164,191,224,164,130,224,164,166,224,165,128,224,164,174,224,164,191,224,164,164,\n224,165,141,224,164,176,224,164,149,224,164,181,224,164,191,224,164,164,224,164,\n190,224,164,176,224,165,129,224,164,170,224,164,175,224,165,135,224,164,184,224,\n165,141,224,164,165,224,164,190,224,164,168,224,164,149,224,164,176,224,165,139,\n224,164,161,224,164,188,224,164,174,224,165,129,224,164,149,224,165,141,224,164,\n164,224,164,175,224,165,139,224,164,156,224,164,168,224,164,190,224,164,149,224,\n165,131,224,164,170,224,164,175,224,164,190,224,164,170,224,165,139,224,164,184,\n224,165,141,224,164,159,224,164,152,224,164,176,224,165,135,224,164,178,224,165,\n130,224,164,149,224,164,190,224,164,176,224,165,141,224,164,175,224,164,181,224,\n164,191,224,164,154,224,164,190,224,164,176,224,164,184,224,165,130,224,164,154,\n224,164,168,224,164,190,224,164,174,224,165,130,224,164,178,224,165,141,224,164,\n175,224,164,166,224,165,135,224,164,150,224,165,135,224,164,130,224,164,185,224,\n164,174,224,165,135,224,164,182,224,164,190,224,164,184,224,165,141,224,164,149,\n224,165,130,224,164,178,224,164,174,224,165,136,224,164,130,224,164,168,224,165,\n135,224,164,164,224,165,136,224,164,175,224,164,190,224,164,176,224,164,156,224,\n164,191,224,164,184,224,164,149,224,165,135,114,115,115,43,120,109,108,34,32,116\n,105,116,108,101,61,34,45,116,121,112,101,34,32,99,111,110,116,101,110,116,61,34\n,116,105,116,108,101,34,32,99,111,110,116,101,110,116,61,34,97,116,32,116,104,\n101,32,115,97,109,101,32,116,105,109,101,46,106,115,34,62,60,47,115,99,114,105,\n112,116,62,10,60,34,32,109,101,116,104,111,100,61,34,112,111,115,116,34,32,60,47\n,115,112,97,110,62,60,47,97,62,60,47,108,105,62,118,101,114,116,105,99,97,108,45\n,97,108,105,103,110,58,116,47,106,113,117,101,114,121,46,109,105,110,46,106,115,\n34,62,46,99,108,105,99,107,40,102,117,110,99,116,105,111,110,40,32,115,116,121,\n108,101,61,34,112,97,100,100,105,110,103,45,125,41,40,41,59,10,60,47,115,99,114,\n105,112,116,62,10,60,47,115,112,97,110,62,60,97,32,104,114,101,102,61,34,60,97,\n32,104,114,101,102,61,34,104,116,116,112,58,47,47,41,59,32,114,101,116,117,114,\n110,32,102,97,108,115,101,59,116,101,120,116,45,100,101,99,111,114,97,116,105,\n111,110,58,32,115,99,114,111,108,108,105,110,103,61,34,110,111,34,32,98,111,114,\n100,101,114,45,99,111,108,108,97,112,115,101,58,97,115,115,111,99,105,97,116,101\n,100,32,119,105,116,104,32,66,97,104,97,115,97,32,73,110,100,111,110,101,115,105\n,97,69,110,103,108,105,115,104,32,108,97,110,103,117,97,103,101,60,116,101,120,\n116,32,120,109,108,58,115,112,97,99,101,61,46,103,105,102,34,32,98,111,114,100,\n101,114,61,34,48,34,60,47,98,111,100,121,62,10,60,47,104,116,109,108,62,10,111,\n118,101,114,102,108,111,119,58,104,105,100,100,101,110,59,105,109,103,32,115,114\n,99,61,34,104,116,116,112,58,47,47,97,100,100,69,118,101,110,116,76,105,115,116,\n101,110,101,114,114,101,115,112,111,110,115,105,98,108,101,32,102,111,114,32,115\n,46,106,115,34,62,60,47,115,99,114,105,112,116,62,10,47,102,97,118,105,99,111,\n110,46,105,99,111,34,32,47,62,111,112,101,114,97,116,105,110,103,32,115,121,115,\n116,101,109,34,32,115,116,121,108,101,61,34,119,105,100,116,104,58,49,116,97,114\n,103,101,116,61,34,95,98,108,97,110,107,34,62,83,116,97,116,101,32,85,110,105,\n118,101,114,115,105,116,121,116,101,120,116,45,97,108,105,103,110,58,108,101,102\n,116,59,10,100,111,99,117,109,101,110,116,46,119,114,105,116,101,40,44,32,105,\n110,99,108,117,100,105,110,103,32,116,104,101,32,97,114,111,117,110,100,32,116,\n104,101,32,119,111,114,108,100,41,59,13,10,60,47,115,99,114,105,112,116,62,13,10\n,60,34,32,115,116,121,108,101,61,34,104,101,105,103,104,116,58,59,111,118,101,\n114,102,108,111,119,58,104,105,100,100,101,110,109,111,114,101,32,105,110,102,\n111,114,109,97,116,105,111,110,97,110,32,105,110,116,101,114,110,97,116,105,111,\n110,97,108,97,32,109,101,109,98,101,114,32,111,102,32,116,104,101,32,111,110,101\n,32,111,102,32,116,104,101,32,102,105,114,115,116,99,97,110,32,98,101,32,102,111\n,117,110,100,32,105,110,32,60,47,100,105,118,62,10,9,9,60,47,100,105,118,62,10,\n100,105,115,112,108,97,121,58,32,110,111,110,101,59,34,62,34,32,47,62,10,60,108,\n105,110,107,32,114,101,108,61,34,10,32,32,40,102,117,110,99,116,105,111,110,40,\n41,32,123,116,104,101,32,49,53,116,104,32,99,101,110,116,117,114,121,46,112,114,\n101,118,101,110,116,68,101,102,97,117,108,116,40,108,97,114,103,101,32,110,117,\n109,98,101,114,32,111,102,32,66,121,122,97,110,116,105,110,101,32,69,109,112,105\n,114,101,46,106,112,103,124,116,104,117,109,98,124,108,101,102,116,124,118,97,\n115,116,32,109,97,106,111,114,105,116,121,32,111,102,109,97,106,111,114,105,116,\n121,32,111,102,32,116,104,101,32,32,97,108,105,103,110,61,34,99,101,110,116,101,\n114,34,62,85,110,105,118,101,114,115,105,116,121,32,80,114,101,115,115,100,111,\n109,105,110,97,116,101,100,32,98,121,32,116,104,101,83,101,99,111,110,100,32,87,\n111,114,108,100,32,87,97,114,100,105,115,116,114,105,98,117,116,105,111,110,32,\n111,102,32,115,116,121,108,101,61,34,112,111,115,105,116,105,111,110,58,116,104,\n101,32,114,101,115,116,32,111,102,32,116,104,101,32,99,104,97,114,97,99,116,101,\n114,105,122,101,100,32,98,121,32,114,101,108,61,34,110,111,102,111,108,108,111,\n119,34,62,100,101,114,105,118,101,115,32,102,114,111,109,32,116,104,101,114,97,\n116,104,101,114,32,116,104,97,110,32,116,104,101,32,97,32,99,111,109,98,105,110,\n97,116,105,111,110,32,111,102,115,116,121,108,101,61,34,119,105,100,116,104,58,\n49,48,48,69,110,103,108,105,115,104,45,115,112,101,97,107,105,110,103,99,111,109\n,112,117,116,101,114,32,115,99,105,101,110,99,101,98,111,114,100,101,114,61,34,\n48,34,32,97,108,116,61,34,116,104,101,32,101,120,105,115,116,101,110,99,101,32,\n111,102,68,101,109,111,99,114,97,116,105,99,32,80,97,114,116,121,34,32,115,116,\n121,108,101,61,34,109,97,114,103,105,110,45,70,111,114,32,116,104,105,115,32,114\n,101,97,115,111,110,44,46,106,115,34,62,60,47,115,99,114,105,112,116,62,10,9,115\n,66,121,84,97,103,78,97,109,101,40,115,41,91,48,93,106,115,34,62,60,47,115,99,\n114,105,112,116,62,13,10,60,46,106,115,34,62,60,47,115,99,114,105,112,116,62,13,\n10,108,105,110,107,32,114,101,108,61,34,105,99,111,110,34,32,39,32,97,108,116,61\n,39,39,32,99,108,97,115,115,61,39,102,111,114,109,97,116,105,111,110,32,111,102,\n32,116,104,101,118,101,114,115,105,111,110,115,32,111,102,32,116,104,101,32,60,\n47,97,62,60,47,100,105,118,62,60,47,100,105,118,62,47,112,97,103,101,62,10,32,32\n,60,112,97,103,101,62,10,60,100,105,118,32,99,108,97,115,115,61,34,99,111,110,\n116,98,101,99,97,109,101,32,116,104,101,32,102,105,114,115,116,98,97,104,97,115,\n97,32,73,110,100,111,110,101,115,105,97,101,110,103,108,105,115,104,32,40,115,\n105,109,112,108,101,41,206,149,206,187,206,187,206,183,206,189,206,185,206,186,\n206,172,209,133,209,128,208,178,208,176,209,130,209,129,208,186,208,184,208,186,\n208,190,208,188,208,191,208,176,208,189,208,184,208,184,209,143,208,178,208,187,\n209,143,208,181,209,130,209,129,209,143,208,148,208,190,208,177,208,176,208,178,\n208,184,209,130,209,140,209,135,208,181,208,187,208,190,208,178,208,181,208,186,\n208,176,209,128,208,176,208,183,208,178,208,184,209,130,208,184,209,143,208,152,\n208,189,209,130,208,181,209,128,208,189,208,181,209,130,208,158,209,130,208,178,\n208,181,209,130,208,184,209,130,209,140,208,189,208,176,208,191,209,128,208,184,\n208,188,208,181,209,128,208,184,208,189,209,130,208,181,209,128,208,189,208,181,\n209,130,208,186,208,190,209,130,208,190,209,128,208,190,208,179,208,190,209,129,\n209,130,209,128,208,176,208,189,208,184,209,134,209,139,208,186,208,176,209,135,\n208,181,209,129,209,130,208,178,208,181,209,131,209,129,208,187,208,190,208,178,\n208,184,209,143,209,133,208,191,209,128,208,190,208,177,208,187,208,181,208,188,\n209,139,208,191,208,190,208,187,209,131,209,135,208,184,209,130,209,140,209,143,\n208,178,208,187,209,143,209,142,209,130,209,129,209,143,208,189,208,176,208,184,\n208,177,208,190,208,187,208,181,208,181,208,186,208,190,208,188,208,191,208,176,\n208,189,208,184,209,143,208,178,208,189,208,184,208,188,208,176,208,189,208,184,\n208,181,209,129,209,128,208,181,208,180,209,129,209,130,208,178,208,176,216,167,\n217,132,217,133,217,136,216,167,216,182,217,138,216,185,216,167,217,132,216,177,\n216,166,217,138,216,179,217,138,216,169,216,167,217,132,216,167,217,134,216,170,\n217,130,216,167,217,132,217,133,216,180,216,167,216,177,217,131,216,167,216,170,\n217,131,216,167,217,132,216,179,217,138,216,167,216,177,216,167,216,170,216,167,\n217,132,217,133,217,131,216,170,217,136,216,168,216,169,216,167,217,132,216,179,\n216,185,217,136,216,175,217,138,216,169,216,167,216,173,216,181,216,167,216,166,\n217,138,216,167,216,170,216,167,217,132,216,185,216,167,217,132,217,133,217,138,\n216,169,216,167,217,132,216,181,217,136,216,170,217,138,216,167,216,170,216,167,\n217,132,216,167,217,134,216,170,216,177,217,134,216,170,216,167,217,132,216,170,\n216,181,216,167,217,133,217,138,217,133,216,167,217,132,216,165,216,179,217,132,\n216,167,217,133,217,138,216,167,217,132,217,133,216,180,216,167,216,177,217,131,\n216,169,216,167,217,132,217,133,216,177,216,166,217,138,216,167,216,170,114,111,\n98,111,116,115,34,32,99,111,110,116,101,110,116,61,34,60,100,105,118,32,105,100,\n61,34,102,111,111,116,101,114,34,62,116,104,101,32,85,110,105,116,101,100,32,83,\n116,97,116,101,115,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,\n46,106,112,103,124,114,105,103,104,116,124,116,104,117,109,98,124,46,106,115,34,\n62,60,47,115,99,114,105,112,116,62,13,10,60,108,111,99,97,116,105,111,110,46,112\n,114,111,116,111,99,111,108,102,114,97,109,101,98,111,114,100,101,114,61,34,48,\n34,32,115,34,32,47,62,10,60,109,101,116,97,32,110,97,109,101,61,34,60,47,97,62,\n60,47,100,105,118,62,60,47,100,105,118,62,60,102,111,110,116,45,119,101,105,103,\n104,116,58,98,111,108,100,59,38,113,117,111,116,59,32,97,110,100,32,38,113,117,\n111,116,59,100,101,112,101,110,100,105,110,103,32,111,110,32,116,104,101,32,109,\n97,114,103,105,110,58,48,59,112,97,100,100,105,110,103,58,34,32,114,101,108,61,\n34,110,111,102,111,108,108,111,119,34,32,80,114,101,115,105,100,101,110,116,32,\n111,102,32,116,104,101,32,116,119,101,110,116,105,101,116,104,32,99,101,110,116,\n117,114,121,101,118,105,115,105,111,110,62,10,32,32,60,47,112,97,103,101,73,110,\n116,101,114,110,101,116,32,69,120,112,108,111,114,101,114,97,46,97,115,121,110,\n99,32,61,32,116,114,117,101,59,13,10,105,110,102,111,114,109,97,116,105,111,110,\n32,97,98,111,117,116,60,100,105,118,32,105,100,61,34,104,101,97,100,101,114,34,\n62,34,32,97,99,116,105,111,110,61,34,104,116,116,112,58,47,47,60,97,32,104,114,\n101,102,61,34,104,116,116,112,115,58,47,47,60,100,105,118,32,105,100,61,34,99,\n111,110,116,101,110,116,34,60,47,100,105,118,62,13,10,60,47,100,105,118,62,13,10\n,60,100,101,114,105,118,101,100,32,102,114,111,109,32,116,104,101,32,60,105,109,\n103,32,115,114,99,61,39,104,116,116,112,58,47,47,97,99,99,111,114,100,105,110,\n103,32,116,111,32,116,104,101,32,10,60,47,98,111,100,121,62,10,60,47,104,116,109\n,108,62,10,115,116,121,108,101,61,34,102,111,110,116,45,115,105,122,101,58,115,\n99,114,105,112,116,32,108,97,110,103,117,97,103,101,61,34,65,114,105,97,108,44,\n32,72,101,108,118,101,116,105,99,97,44,60,47,97,62,60,115,112,97,110,32,99,108,\n97,115,115,61,34,60,47,115,99,114,105,112,116,62,60,115,99,114,105,112,116,32,\n112,111,108,105,116,105,99,97,108,32,112,97,114,116,105,101,115,116,100,62,60,47\n,116,114,62,60,47,116,97,98,108,101,62,60,104,114,101,102,61,34,104,116,116,112,\n58,47,47,119,119,119,46,105,110,116,101,114,112,114,101,116,97,116,105,111,110,\n32,111,102,114,101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,32,100,\n111,99,117,109,101,110,116,46,119,114,105,116,101,40,39,60,99,104,97,114,115,101\n,116,61,34,117,116,102,45,56,34,62,10,98,101,103,105,110,110,105,110,103,32,111,\n102,32,116,104,101,32,114,101,118,101,97,108,101,100,32,116,104,97,116,32,116,\n104,101,116,101,108,101,118,105,115,105,111,110,32,115,101,114,105,101,115,34,32\n,114,101,108,61,34,110,111,102,111,108,108,111,119,34,62,32,116,97,114,103,101,\n116,61,34,95,98,108,97,110,107,34,62,99,108,97,105,109,105,110,103,32,116,104,97\n,116,32,116,104,101,104,116,116,112,37,51,65,37,50,70,37,50,70,119,119,119,46,\n109,97,110,105,102,101,115,116,97,116,105,111,110,115,32,111,102,80,114,105,109,\n101,32,77,105,110,105,115,116,101,114,32,111,102,105,110,102,108,117,101,110,99,\n101,100,32,98,121,32,116,104,101,99,108,97,115,115,61,34,99,108,101,97,114,102,\n105,120,34,62,47,100,105,118,62,13,10,60,47,100,105,118,62,13,10,13,10,116,104,\n114,101,101,45,100,105,109,101,110,115,105,111,110,97,108,67,104,117,114,99,104,\n32,111,102,32,69,110,103,108,97,110,100,111,102,32,78,111,114,116,104,32,67,97,\n114,111,108,105,110,97,115,113,117,97,114,101,32,107,105,108,111,109,101,116,114\n,101,115,46,97,100,100,69,118,101,110,116,76,105,115,116,101,110,101,114,100,105\n,115,116,105,110,99,116,32,102,114,111,109,32,116,104,101,99,111,109,109,111,110\n,108,121,32,107,110,111,119,110,32,97,115,80,104,111,110,101,116,105,99,32,65,\n108,112,104,97,98,101,116,100,101,99,108,97,114,101,100,32,116,104,97,116,32,116\n,104,101,99,111,110,116,114,111,108,108,101,100,32,98,121,32,116,104,101,66,101,\n110,106,97,109,105,110,32,70,114,97,110,107,108,105,110,114,111,108,101,45,112,\n108,97,121,105,110,103,32,103,97,109,101,116,104,101,32,85,110,105,118,101,114,\n115,105,116,121,32,111,102,105,110,32,87,101,115,116,101,114,110,32,69,117,114,\n111,112,101,112,101,114,115,111,110,97,108,32,99,111,109,112,117,116,101,114,80,\n114,111,106,101,99,116,32,71,117,116,101,110,98,101,114,103,114,101,103,97,114,\n100,108,101,115,115,32,111,102,32,116,104,101,104,97,115,32,98,101,101,110,32,\n112,114,111,112,111,115,101,100,116,111,103,101,116,104,101,114,32,119,105,116,\n104,32,116,104,101,62,60,47,108,105,62,60,108,105,32,99,108,97,115,115,61,34,105\n,110,32,115,111,109,101,32,99,111,117,110,116,114,105,101,115,109,105,110,46,106\n,115,34,62,60,47,115,99,114,105,112,116,62,111,102,32,116,104,101,32,112,111,112\n,117,108,97,116,105,111,110,111,102,102,105,99,105,97,108,32,108,97,110,103,117,\n97,103,101,60,105,109,103,32,115,114,99,61,34,105,109,97,103,101,115,47,105,100,\n101,110,116,105,102,105,101,100,32,98,121,32,116,104,101,110,97,116,117,114,97,\n108,32,114,101,115,111,117,114,99,101,115,99,108,97,115,115,105,102,105,99,97,\n116,105,111,110,32,111,102,99,97,110,32,98,101,32,99,111,110,115,105,100,101,114\n,101,100,113,117,97,110,116,117,109,32,109,101,99,104,97,110,105,99,115,78,101,\n118,101,114,116,104,101,108,101,115,115,44,32,116,104,101,109,105,108,108,105,\n111,110,32,121,101,97,114,115,32,97,103,111,60,47,98,111,100,121,62,13,10,60,47,\n104,116,109,108,62,13,206,149,206,187,206,187,206,183,206,189,206,185,206,186,\n206,172,10,116,97,107,101,32,97,100,118,97,110,116,97,103,101,32,111,102,97,110,\n100,44,32,97,99,99,111,114,100,105,110,103,32,116,111,97,116,116,114,105,98,117,\n116,101,100,32,116,111,32,116,104,101,77,105,99,114,111,115,111,102,116,32,87,\n105,110,100,111,119,115,116,104,101,32,102,105,114,115,116,32,99,101,110,116,117\n,114,121,117,110,100,101,114,32,116,104,101,32,99,111,110,116,114,111,108,100,\n105,118,32,99,108,97,115,115,61,34,104,101,97,100,101,114,115,104,111,114,116,\n108,121,32,97,102,116,101,114,32,116,104,101,110,111,116,97,98,108,101,32,101,\n120,99,101,112,116,105,111,110,116,101,110,115,32,111,102,32,116,104,111,117,115\n,97,110,100,115,115,101,118,101,114,97,108,32,100,105,102,102,101,114,101,110,\n116,97,114,111,117,110,100,32,116,104,101,32,119,111,114,108,100,46,114,101,97,\n99,104,105,110,103,32,109,105,108,105,116,97,114,121,105,115,111,108,97,116,101,\n100,32,102,114,111,109,32,116,104,101,111,112,112,111,115,105,116,105,111,110,32\n,116,111,32,116,104,101,116,104,101,32,79,108,100,32,84,101,115,116,97,109,101,\n110,116,65,102,114,105,99,97,110,32,65,109,101,114,105,99,97,110,115,105,110,115\n,101,114,116,101,100,32,105,110,116,111,32,116,104,101,115,101,112,97,114,97,116\n,101,32,102,114,111,109,32,116,104,101,109,101,116,114,111,112,111,108,105,116,\n97,110,32,97,114,101,97,109,97,107,101,115,32,105,116,32,112,111,115,115,105,98,\n108,101,97,99,107,110,111,119,108,101,100,103,101,100,32,116,104,97,116,97,114,\n103,117,97,98,108,121,32,116,104,101,32,109,111,115,116,116,121,112,101,61,34,\n116,101,120,116,47,99,115,115,34,62,10,116,104,101,32,73,110,116,101,114,110,97,\n116,105,111,110,97,108,65,99,99,111,114,100,105,110,103,32,116,111,32,116,104,\n101,32,112,101,61,34,116,101,120,116,47,99,115,115,34,32,47,62,10,99,111,105,110\n,99,105,100,101,32,119,105,116,104,32,116,104,101,116,119,111,45,116,104,105,114\n,100,115,32,111,102,32,116,104,101,68,117,114,105,110,103,32,116,104,105,115,32,\n116,105,109,101,44,100,117,114,105,110,103,32,116,104,101,32,112,101,114,105,111\n,100,97,110,110,111,117,110,99,101,100,32,116,104,97,116,32,104,101,116,104,101,\n32,105,110,116,101,114,110,97,116,105,111,110,97,108,97,110,100,32,109,111,114,\n101,32,114,101,99,101,110,116,108,121,98,101,108,105,101,118,101,100,32,116,104,\n97,116,32,116,104,101,99,111,110,115,99,105,111,117,115,110,101,115,115,32,97,\n110,100,102,111,114,109,101,114,108,121,32,107,110,111,119,110,32,97,115,115,117\n,114,114,111,117,110,100,101,100,32,98,121,32,116,104,101,102,105,114,115,116,32\n,97,112,112,101,97,114,101,100,32,105,110,111,99,99,97,115,105,111,110,97,108,\n108,121,32,117,115,101,100,112,111,115,105,116,105,111,110,58,97,98,115,111,108,\n117,116,101,59,34,32,116,97,114,103,101,116,61,34,95,98,108,97,110,107,34,32,112\n,111,115,105,116,105,111,110,58,114,101,108,97,116,105,118,101,59,116,101,120,\n116,45,97,108,105,103,110,58,99,101,110,116,101,114,59,106,97,120,47,108,105,98,\n115,47,106,113,117,101,114,121,47,49,46,98,97,99,107,103,114,111,117,110,100,45,\n99,111,108,111,114,58,35,116,121,112,101,61,34,97,112,112,108,105,99,97,116,105,\n111,110,47,97,110,103,117,97,103,101,34,32,99,111,110,116,101,110,116,61,34,60,\n109,101,116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,80,114,105,118,97\n,99,121,32,80,111,108,105,99,121,60,47,97,62,101,40,34,37,51,67,115,99,114,105,\n112,116,32,115,114,99,61,39,34,32,116,97,114,103,101,116,61,34,95,98,108,97,110,\n107,34,62,79,110,32,116,104,101,32,111,116,104,101,114,32,104,97,110,100,44,46,\n106,112,103,124,116,104,117,109,98,124,114,105,103,104,116,124,50,60,47,100,105,\n118,62,60,100,105,118,32,99,108,97,115,115,61,34,60,100,105,118,32,115,116,121,\n108,101,61,34,102,108,111,97,116,58,110,105,110,101,116,101,101,110,116,104,32,\n99,101,110,116,117,114,121,60,47,98,111,100,121,62,13,10,60,47,104,116,109,108,\n62,13,10,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,115,59,116,\n101,120,116,45,97,108,105,103,110,58,99,101,110,116,101,114,102,111,110,116,45,\n119,101,105,103,104,116,58,32,98,111,108,100,59,32,65,99,99,111,114,100,105,110,\n103,32,116,111,32,116,104,101,32,100,105,102,102,101,114,101,110,99,101,32,98,\n101,116,119,101,101,110,34,32,102,114,97,109,101,98,111,114,100,101,114,61,34,48\n,34,32,34,32,115,116,121,108,101,61,34,112,111,115,105,116,105,111,110,58,108,\n105,110,107,32,104,114,101,102,61,34,104,116,116,112,58,47,47,104,116,109,108,52\n,47,108,111,111,115,101,46,100,116,100,34,62,10,100,117,114,105,110,103,32,116,\n104,105,115,32,112,101,114,105,111,100,60,47,116,100,62,60,47,116,114,62,60,47,\n116,97,98,108,101,62,99,108,111,115,101,108,121,32,114,101,108,97,116,101,100,32\n,116,111,102,111,114,32,116,104,101,32,102,105,114,115,116,32,116,105,109,101,59\n,102,111,110,116,45,119,101,105,103,104,116,58,98,111,108,100,59,105,110,112,117\n,116,32,116,121,112,101,61,34,116,101,120,116,34,32,60,115,112,97,110,32,115,116\n,121,108,101,61,34,102,111,110,116,45,111,110,114,101,97,100,121,115,116,97,116,\n101,99,104,97,110,103,101,9,60,100,105,118,32,99,108,97,115,115,61,34,99,108,101\n,97,114,100,111,99,117,109,101,110,116,46,108,111,99,97,116,105,111,110,46,32,70\n,111,114,32,101,120,97,109,112,108,101,44,32,116,104,101,32,97,32,119,105,100,\n101,32,118,97,114,105,101,116,121,32,111,102,32,60,33,68,79,67,84,89,80,69,32,\n104,116,109,108,62,13,10,60,38,110,98,115,112,59,38,110,98,115,112,59,38,110,98,\n115,112,59,34,62,60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,47,115,116\n,121,108,101,61,34,102,108,111,97,116,58,108,101,102,116,59,99,111,110,99,101,\n114,110,101,100,32,119,105,116,104,32,116,104,101,61,104,116,116,112,37,51,65,37\n,50,70,37,50,70,119,119,119,46,105,110,32,112,111,112,117,108,97,114,32,99,117,\n108,116,117,114,101,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34,32,47\n,62,105,116,32,105,115,32,112,111,115,115,105,98,108,101,32,116,111,32,72,97,114\n,118,97,114,100,32,85,110,105,118,101,114,115,105,116,121,116,121,108,101,115,\n104,101,101,116,34,32,104,114,101,102,61,34,47,116,104,101,32,109,97,105,110,32,\n99,104,97,114,97,99,116,101,114,79,120,102,111,114,100,32,85,110,105,118,101,114\n,115,105,116,121,32,32,110,97,109,101,61,34,107,101,121,119,111,114,100,115,34,\n32,99,115,116,121,108,101,61,34,116,101,120,116,45,97,108,105,103,110,58,116,104\n,101,32,85,110,105,116,101,100,32,75,105,110,103,100,111,109,102,101,100,101,114\n,97,108,32,103,111,118,101,114,110,109,101,110,116,60,100,105,118,32,115,116,121\n,108,101,61,34,109,97,114,103,105,110,32,100,101,112,101,110,100,105,110,103,32,\n111,110,32,116,104,101,32,100,101,115,99,114,105,112,116,105,111,110,32,111,102,\n32,116,104,101,60,100,105,118,32,99,108,97,115,115,61,34,104,101,97,100,101,114,\n46,109,105,110,46,106,115,34,62,60,47,115,99,114,105,112,116,62,100,101,115,116,\n114,117,99,116,105,111,110,32,111,102,32,116,104,101,115,108,105,103,104,116,108\n,121,32,100,105,102,102,101,114,101,110,116,105,110,32,97,99,99,111,114,100,97,\n110,99,101,32,119,105,116,104,116,101,108,101,99,111,109,109,117,110,105,99,97,\n116,105,111,110,115,105,110,100,105,99,97,116,101,115,32,116,104,97,116,32,116,\n104,101,115,104,111,114,116,108,121,32,116,104,101,114,101,97,102,116,101,114,\n101,115,112,101,99,105,97,108,108,121,32,105,110,32,116,104,101,32,69,117,114,\n111,112,101,97,110,32,99,111,117,110,116,114,105,101,115,72,111,119,101,118,101,\n114,44,32,116,104,101,114,101,32,97,114,101,115,114,99,61,34,104,116,116,112,58,\n47,47,115,116,97,116,105,99,115,117,103,103,101,115,116,101,100,32,116,104,97,\n116,32,116,104,101,34,32,115,114,99,61,34,104,116,116,112,58,47,47,119,119,119,\n46,97,32,108,97,114,103,101,32,110,117,109,98,101,114,32,111,102,32,84,101,108,\n101,99,111,109,109,117,110,105,99,97,116,105,111,110,115,34,32,114,101,108,61,34\n,110,111,102,111,108,108,111,119,34,32,116,72,111,108,121,32,82,111,109,97,110,\n32,69,109,112,101,114,111,114,97,108,109,111,115,116,32,101,120,99,108,117,115,\n105,118,101,108,121,34,32,98,111,114,100,101,114,61,34,48,34,32,97,108,116,61,34\n,83,101,99,114,101,116,97,114,121,32,111,102,32,83,116,97,116,101,99,117,108,109\n,105,110,97,116,105,110,103,32,105,110,32,116,104,101,67,73,65,32,87,111,114,108\n,100,32,70,97,99,116,98,111,111,107,116,104,101,32,109,111,115,116,32,105,109,\n112,111,114,116,97,110,116,97,110,110,105,118,101,114,115,97,114,121,32,111,102,\n32,116,104,101,115,116,121,108,101,61,34,98,97,99,107,103,114,111,117,110,100,45\n,60,108,105,62,60,101,109,62,60,97,32,104,114,101,102,61,34,47,116,104,101,32,65\n,116,108,97,110,116,105,99,32,79,99,101,97,110,115,116,114,105,99,116,108,121,32\n,115,112,101,97,107,105,110,103,44,115,104,111,114,116,108,121,32,98,101,102,111\n,114,101,32,116,104,101,100,105,102,102,101,114,101,110,116,32,116,121,112,101,\n115,32,111,102,116,104,101,32,79,116,116,111,109,97,110,32,69,109,112,105,114,\n101,62,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,65,110,32,73,\n110,116,114,111,100,117,99,116,105,111,110,32,116,111,99,111,110,115,101,113,117\n,101,110,99,101,32,111,102,32,116,104,101,100,101,112,97,114,116,117,114,101,32,\n102,114,111,109,32,116,104,101,67,111,110,102,101,100,101,114,97,116,101,32,83,\n116,97,116,101,115,105,110,100,105,103,101,110,111,117,115,32,112,101,111,112,\n108,101,115,80,114,111,99,101,101,100,105,110,103,115,32,111,102,32,116,104,101,\n105,110,102,111,114,109,97,116,105,111,110,32,111,110,32,116,104,101,116,104,101\n,111,114,105,101,115,32,104,97,118,101,32,98,101,101,110,105,110,118,111,108,118\n,101,109,101,110,116,32,105,110,32,116,104,101,100,105,118,105,100,101,100,32,\n105,110,116,111,32,116,104,114,101,101,97,100,106,97,99,101,110,116,32,99,111,\n117,110,116,114,105,101,115,105,115,32,114,101,115,112,111,110,115,105,98,108,\n101,32,102,111,114,100,105,115,115,111,108,117,116,105,111,110,32,111,102,32,116\n,104,101,99,111,108,108,97,98,111,114,97,116,105,111,110,32,119,105,116,104,119,\n105,100,101,108,121,32,114,101,103,97,114,100,101,100,32,97,115,104,105,115,32,\n99,111,110,116,101,109,112,111,114,97,114,105,101,115,102,111,117,110,100,105,\n110,103,32,109,101,109,98,101,114,32,111,102,68,111,109,105,110,105,99,97,110,32\n,82,101,112,117,98,108,105,99,103,101,110,101,114,97,108,108,121,32,97,99,99,101\n,112,116,101,100,116,104,101,32,112,111,115,115,105,98,105,108,105,116,121,32,\n111,102,97,114,101,32,97,108,115,111,32,97,118,97,105,108,97,98,108,101,117,110,\n100,101,114,32,99,111,110,115,116,114,117,99,116,105,111,110,114,101,115,116,111\n,114,97,116,105,111,110,32,111,102,32,116,104,101,116,104,101,32,103,101,110,101\n,114,97,108,32,112,117,98,108,105,99,105,115,32,97,108,109,111,115,116,32,101,\n110,116,105,114,101,108,121,112,97,115,115,101,115,32,116,104,114,111,117,103,\n104,32,116,104,101,104,97,115,32,98,101,101,110,32,115,117,103,103,101,115,116,\n101,100,99,111,109,112,117,116,101,114,32,97,110,100,32,118,105,100,101,111,71,\n101,114,109,97,110,105,99,32,108,97,110,103,117,97,103,101,115,32,97,99,99,111,\n114,100,105,110,103,32,116,111,32,116,104,101,32,100,105,102,102,101,114,101,110\n,116,32,102,114,111,109,32,116,104,101,115,104,111,114,116,108,121,32,97,102,116\n,101,114,119,97,114,100,115,104,114,101,102,61,34,104,116,116,112,115,58,47,47,\n119,119,119,46,114,101,99,101,110,116,32,100,101,118,101,108,111,112,109,101,110\n,116,66,111,97,114,100,32,111,102,32,68,105,114,101,99,116,111,114,115,60,100,\n105,118,32,99,108,97,115,115,61,34,115,101,97,114,99,104,124,32,60,97,32,104,114\n,101,102,61,34,104,116,116,112,58,47,47,73,110,32,112,97,114,116,105,99,117,108,\n97,114,44,32,116,104,101,77,117,108,116,105,112,108,101,32,102,111,111,116,110,\n111,116,101,115,111,114,32,111,116,104,101,114,32,115,117,98,115,116,97,110,99,\n101,116,104,111,117,115,97,110,100,115,32,111,102,32,121,101,97,114,115,116,114,\n97,110,115,108,97,116,105,111,110,32,111,102,32,116,104,101,60,47,100,105,118,62\n,13,10,60,47,100,105,118,62,13,10,13,10,60,97,32,104,114,101,102,61,34,105,110,\n100,101,120,46,112,104,112,119,97,115,32,101,115,116,97,98,108,105,115,104,101,\n100,32,105,110,109,105,110,46,106,115,34,62,60,47,115,99,114,105,112,116,62,10,\n112,97,114,116,105,99,105,112,97,116,101,32,105,110,32,116,104,101,97,32,115,116\n,114,111,110,103,32,105,110,102,108,117,101,110,99,101,115,116,121,108,101,61,34\n,109,97,114,103,105,110,45,116,111,112,58,114,101,112,114,101,115,101,110,116,\n101,100,32,98,121,32,116,104,101,103,114,97,100,117,97,116,101,100,32,102,114,\n111,109,32,116,104,101,84,114,97,100,105,116,105,111,110,97,108,108,121,44,32,\n116,104,101,69,108,101,109,101,110,116,40,34,115,99,114,105,112,116,34,41,59,72,\n111,119,101,118,101,114,44,32,115,105,110,99,101,32,116,104,101,47,100,105,118,\n62,10,60,47,100,105,118,62,10,60,100,105,118,32,108,101,102,116,59,32,109,97,114\n,103,105,110,45,108,101,102,116,58,112,114,111,116,101,99,116,105,111,110,32,97,\n103,97,105,110,115,116,48,59,32,118,101,114,116,105,99,97,108,45,97,108,105,103,\n110,58,85,110,102,111,114,116,117,110,97,116,101,108,121,44,32,116,104,101,116,\n121,112,101,61,34,105,109,97,103,101,47,120,45,105,99,111,110,47,100,105,118,62,\n10,60,100,105,118,32,99,108,97,115,115,61,34,32,99,108,97,115,115,61,34,99,108,\n101,97,114,102,105,120,34,62,60,100,105,118,32,99,108,97,115,115,61,34,102,111,\n111,116,101,114,9,9,60,47,100,105,118,62,10,9,9,60,47,100,105,118,62,10,116,104,\n101,32,109,111,116,105,111,110,32,112,105,99,116,117,114,101,208,145,209,138,208\n,187,208,179,208,176,209,128,209,129,208,186,208,184,208,177,209,138,208,187,208\n,179,208,176,209,128,209,129,208,186,208,184,208,164,208,181,208,180,208,181,209\n,128,208,176,209,134,208,184,208,184,208,189,208,181,209,129,208,186,208,190,208\n,187,209,140,208,186,208,190,209,129,208,190,208,190,208,177,209,137,208,181,208\n,189,208,184,208,181,209,129,208,190,208,190,208,177,209,137,208,181,208,189,208\n,184,209,143,208,191,209,128,208,190,208,179,209,128,208,176,208,188,208,188,209\n,139,208,158,209,130,208,191,209,128,208,176,208,178,208,184,209,130,209,140,208\n,177,208,181,209,129,208,191,208,187,208,176,209,130,208,189,208,190,208,188,208\n,176,209,130,208,181,209,128,208,184,208,176,208,187,209,139,208,191,208,190,208\n,183,208,178,208,190,208,187,209,143,208,181,209,130,208,191,208,190,209,129,208\n,187,208,181,208,180,208,189,208,184,208,181,209,128,208,176,208,183,208,187,208\n,184,209,135,208,189,209,139,209,133,208,191,209,128,208,190,208,180,209,131,208\n,186,209,134,208,184,208,184,208,191,209,128,208,190,208,179,209,128,208,176,208\n,188,208,188,208,176,208,191,208,190,208,187,208,189,208,190,209,129,209,130,209\n,140,209,142,208,189,208,176,209,133,208,190,208,180,208,184,209,130,209,129,209\n,143,208,184,208,183,208,177,209,128,208,176,208,189,208,189,208,190,208,181,208\n,189,208,176,209,129,208,181,208,187,208,181,208,189,208,184,209,143,208,184,208\n,183,208,188,208,181,208,189,208,181,208,189,208,184,209,143,208,186,208,176,209\n,130,208,181,208,179,208,190,209,128,208,184,208,184,208,144,208,187,208,181,208\n,186,209,129,208,176,208,189,208,180,209,128,224,164,166,224,165,141,224,164,181\n,224,164,190,224,164,176,224,164,190,224,164,174,224,165,136,224,164,168,224,165\n,129,224,164,133,224,164,178,224,164,170,224,165,141,224,164,176,224,164,166,224\n,164,190,224,164,168,224,164,173,224,164,190,224,164,176,224,164,164,224,165,128\n,224,164,175,224,164,133,224,164,168,224,165,129,224,164,166,224,165,135,224,164\n,182,224,164,185,224,164,191,224,164,168,224,165,141,224,164,166,224,165,128,224\n,164,135,224,164,130,224,164,161,224,164,191,224,164,175,224,164,190,224,164,166\n,224,164,191,224,164,178,224,165,141,224,164,178,224,165,128,224,164,133,224,164\n,167,224,164,191,224,164,149,224,164,190,224,164,176,224,164,181,224,165,128,224\n,164,161,224,164,191,224,164,175,224,165,139,224,164,154,224,164,191,224,164,159\n,224,165,141,224,164,160,224,165,135,224,164,184,224,164,174,224,164,190,224,164\n,154,224,164,190,224,164,176,224,164,156,224,164,130,224,164,149,224,165,141,224\n,164,182,224,164,168,224,164,166,224,165,129,224,164,168,224,164,191,224,164,175\n,224,164,190,224,164,170,224,165,141,224,164,176,224,164,175,224,165,139,224,164\n,151,224,164,133,224,164,168,224,165,129,224,164,184,224,164,190,224,164,176,224\n,164,145,224,164,168,224,164,178,224,164,190,224,164,135,224,164,168,224,164,170\n,224,164,190,224,164,176,224,165,141,224,164,159,224,165,128,224,164,182,224,164\n,176,224,165,141,224,164,164,224,165,139,224,164,130,224,164,178,224,165,139,224\n,164,149,224,164,184,224,164,173,224,164,190,224,164,171,224,164,188,224,165,141\n,224,164,178,224,165,136,224,164,182,224,164,182,224,164,176,224,165,141,224,164\n,164,224,165,135,224,164,130,224,164,170,224,165,141,224,164,176,224,164,166,224\n,165,135,224,164,182,224,164,170,224,165,141,224,164,178,224,165,135,224,164,175\n,224,164,176,224,164,149,224,165,135,224,164,130,224,164,166,224,165,141,224,164\n,176,224,164,184,224,165,141,224,164,165,224,164,191,224,164,164,224,164,191,224\n,164,137,224,164,164,224,165,141,224,164,170,224,164,190,224,164,166,224,164,137\n,224,164,168,224,165,141,224,164,185,224,165,135,224,164,130,224,164,154,224,164\n,191,224,164,159,224,165,141,224,164,160,224,164,190,224,164,175,224,164,190,224\n,164,164,224,165,141,224,164,176,224,164,190,224,164,156,224,165,141,224,164,175\n,224,164,190,224,164,166,224,164,190,224,164,170,224,165,129,224,164,176,224,164\n,190,224,164,168,224,165,135,224,164,156,224,165,139,224,164,161,224,164,188,224\n,165,135,224,164,130,224,164,133,224,164,168,224,165,129,224,164,181,224,164,190\n,224,164,166,224,164,182,224,165,141,224,164,176,224,165,135,224,164,163,224,165\n,128,224,164,182,224,164,191,224,164,149,224,165,141,224,164,183,224,164,190,224\n,164,184,224,164,176,224,164,149,224,164,190,224,164,176,224,165,128,224,164,184\n,224,164,130,224,164,151,224,165,141,224,164,176,224,164,185,224,164,170,224,164\n,176,224,164,191,224,164,163,224,164,190,224,164,174,224,164,172,224,165,141,224\n,164,176,224,164,190,224,164,130,224,164,161,224,164,172,224,164,154,224,165,141\n,224,164,154,224,165,139,224,164,130,224,164,137,224,164,170,224,164,178,224,164\n,172,224,165,141,224,164,167,224,164,174,224,164,130,224,164,164,224,165,141,224\n,164,176,224,165,128,224,164,184,224,164,130,224,164,170,224,164,176,224,165,141\n,224,164,149,224,164,137,224,164,174,224,165,141,224,164,174,224,165,128,224,164\n,166,224,164,174,224,164,190,224,164,167,224,165,141,224,164,175,224,164,174,224\n,164,184,224,164,185,224,164,190,224,164,175,224,164,164,224,164,190,224,164,182\n,224,164,172,224,165,141,224,164,166,224,165,139,224,164,130,224,164,174,224,165\n,128,224,164,161,224,164,191,224,164,175,224,164,190,224,164,134,224,164,136,224\n,164,170,224,165,128,224,164,143,224,164,178,224,164,174,224,165,139,224,164,172\n,224,164,190,224,164,135,224,164,178,224,164,184,224,164,130,224,164,150,224,165\n,141,224,164,175,224,164,190,224,164,134,224,164,170,224,164,176,224,165,135,224\n,164,182,224,164,168,224,164,133,224,164,168,224,165,129,224,164,172,224,164,130\n,224,164,167,224,164,172,224,164,190,224,164,156,224,164,188,224,164,190,224,164\n,176,224,164,168,224,164,181,224,165,128,224,164,168,224,164,164,224,164,174,224\n,164,170,224,165,141,224,164,176,224,164,174,224,165,129,224,164,150,224,164,170\n,224,165,141,224,164,176,224,164,182,224,165,141,224,164,168,224,164,170,224,164\n,176,224,164,191,224,164,181,224,164,190,224,164,176,224,164,168,224,165,129,224\n,164,149,224,164,184,224,164,190,224,164,168,224,164,184,224,164,174,224,164,176\n,224,165,141,224,164,165,224,164,168,224,164,134,224,164,175,224,165,139,224,164\n,156,224,164,191,224,164,164,224,164,184,224,165,139,224,164,174,224,164,181,224\n,164,190,224,164,176,216,167,217,132,217,133,216,180,216,167,216,177,217,131,216\n,167,216,170,216,167,217,132,217,133,217,134,216,170,216,175,217,138,216,167,216\n,170,216,167,217,132,217,131,217,133,216,168,217,138,217,136,216,170,216,177,216\n,167,217,132,217,133,216,180,216,167,217,135,216,175,216,167,216,170,216,185,216\n,175,216,175,216,167,217,132,216,178,217,136,216,167,216,177,216,185,216,175,216\n,175,216,167,217,132,216,177,216,175,217,136,216,175,216,167,217,132,216,165,216\n,179,217,132,216,167,217,133,217,138,216,169,216,167,217,132,217,129,217,136,216\n,170,217,136,216,180,217,136,216,168,216,167,217,132,217,133,216,179,216,167,216\n,168,217,130,216,167,216,170,216,167,217,132,217,133,216,185,217,132,217,136,217\n,133,216,167,216,170,216,167,217,132,217,133,216,179,217,132,216,179,217,132,216\n,167,216,170,216,167,217,132,216,172,216,177,216,167,217,129,217,138,217,131,216\n,179,216,167,217,132,216,167,216,179,217,132,216,167,217,133,217,138,216,169,216\n,167,217,132,216,167,216,170,216,181,216,167,217,132,216,167,216,170,107,101,121\n,119,111,114,100,115,34,32,99,111,110,116,101,110,116,61,34,119,51,46,111,114,\n103,47,49,57,57,57,47,120,104,116,109,108,34,62,60,97,32,116,97,114,103,101,116,\n61,34,95,98,108,97,110,107,34,32,116,101,120,116,47,104,116,109,108,59,32,99,104\n,97,114,115,101,116,61,34,32,116,97,114,103,101,116,61,34,95,98,108,97,110,107,\n34,62,60,116,97,98,108,101,32,99,101,108,108,112,97,100,100,105,110,103,61,34,97\n,117,116,111,99,111,109,112,108,101,116,101,61,34,111,102,102,34,32,116,101,120,\n116,45,97,108,105,103,110,58,32,99,101,110,116,101,114,59,116,111,32,108,97,115,\n116,32,118,101,114,115,105,111,110,32,98,121,32,98,97,99,107,103,114,111,117,110\n,100,45,99,111,108,111,114,58,32,35,34,32,104,114,101,102,61,34,104,116,116,112,\n58,47,47,119,119,119,46,47,100,105,118,62,60,47,100,105,118,62,60,100,105,118,32\n,105,100,61,60,97,32,104,114,101,102,61,34,35,34,32,99,108,97,115,115,61,34,34,\n62,60,105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,99,114,105,112,\n116,34,32,115,114,99,61,34,104,116,116,112,58,47,47,10,60,115,99,114,105,112,116\n,32,108,97,110,103,117,97,103,101,61,34,47,47,69,78,34,32,34,104,116,116,112,58,\n47,47,119,119,119,46,119,101,110,99,111,100,101,85,82,73,67,111,109,112,111,110,\n101,110,116,40,34,32,104,114,101,102,61,34,106,97,118,97,115,99,114,105,112,116,\n58,60,100,105,118,32,99,108,97,115,115,61,34,99,111,110,116,101,110,116,100,111,\n99,117,109,101,110,116,46,119,114,105,116,101,40,39,60,115,99,112,111,115,105,\n116,105,111,110,58,32,97,98,115,111,108,117,116,101,59,115,99,114,105,112,116,32\n,115,114,99,61,34,104,116,116,112,58,47,47,32,115,116,121,108,101,61,34,109,97,\n114,103,105,110,45,116,111,112,58,46,109,105,110,46,106,115,34,62,60,47,115,99,\n114,105,112,116,62,10,60,47,100,105,118,62,10,60,100,105,118,32,99,108,97,115,\n115,61,34,119,51,46,111,114,103,47,49,57,57,57,47,120,104,116,109,108,34,32,10,\n13,10,60,47,98,111,100,121,62,13,10,60,47,104,116,109,108,62,100,105,115,116,105\n,110,99,116,105,111,110,32,98,101,116,119,101,101,110,47,34,32,116,97,114,103,\n101,116,61,34,95,98,108,97,110,107,34,62,60,108,105,110,107,32,104,114,101,102,\n61,34,104,116,116,112,58,47,47,101,110,99,111,100,105,110,103,61,34,117,116,102,\n45,56,34,63,62,10,119,46,97,100,100,69,118,101,110,116,76,105,115,116,101,110,\n101,114,63,97,99,116,105,111,110,61,34,104,116,116,112,58,47,47,119,119,119,46,\n105,99,111,110,34,32,104,114,101,102,61,34,104,116,116,112,58,47,47,32,115,116,\n121,108,101,61,34,98,97,99,107,103,114,111,117,110,100,58,116,121,112,101,61,34,\n116,101,120,116,47,99,115,115,34,32,47,62,10,109,101,116,97,32,112,114,111,112,\n101,114,116,121,61,34,111,103,58,116,60,105,110,112,117,116,32,116,121,112,101,\n61,34,116,101,120,116,34,32,32,115,116,121,108,101,61,34,116,101,120,116,45,97,\n108,105,103,110,58,116,104,101,32,100,101,118,101,108,111,112,109,101,110,116,32\n,111,102,32,116,121,108,101,115,104,101,101,116,34,32,116,121,112,101,61,34,116,\n101,104,116,109,108,59,32,99,104,97,114,115,101,116,61,117,116,102,45,56,105,115\n,32,99,111,110,115,105,100,101,114,101,100,32,116,111,32,98,101,116,97,98,108,\n101,32,119,105,100,116,104,61,34,49,48,48,37,34,32,73,110,32,97,100,100,105,116,\n105,111,110,32,116,111,32,116,104,101,32,99,111,110,116,114,105,98,117,116,101,\n100,32,116,111,32,116,104,101,32,100,105,102,102,101,114,101,110,99,101,115,32,\n98,101,116,119,101,101,110,100,101,118,101,108,111,112,109,101,110,116,32,111,\n102,32,116,104,101,32,73,116,32,105,115,32,105,109,112,111,114,116,97,110,116,32\n,116,111,32,60,47,115,99,114,105,112,116,62,10,10,60,115,99,114,105,112,116,32,\n32,115,116,121,108,101,61,34,102,111,110,116,45,115,105,122,101,58,49,62,60,47,\n115,112,97,110,62,60,115,112,97,110,32,105,100,61,103,98,76,105,98,114,97,114,\n121,32,111,102,32,67,111,110,103,114,101,115,115,60,105,109,103,32,115,114,99,61\n,34,104,116,116,112,58,47,47,105,109,69,110,103,108,105,115,104,32,116,114,97,\n110,115,108,97,116,105,111,110,65,99,97,100,101,109,121,32,111,102,32,83,99,105,\n101,110,99,101,115,100,105,118,32,115,116,121,108,101,61,34,100,105,115,112,108,\n97,121,58,99,111,110,115,116,114,117,99,116,105,111,110,32,111,102,32,116,104,\n101,46,103,101,116,69,108,101,109,101,110,116,66,121,73,100,40,105,100,41,105,\n110,32,99,111,110,106,117,110,99,116,105,111,110,32,119,105,116,104,69,108,101,\n109,101,110,116,40,39,115,99,114,105,112,116,39,41,59,32,60,109,101,116,97,32,\n112,114,111,112,101,114,116,121,61,34,111,103,58,208,145,209,138,208,187,208,179\n,208,176,209,128,209,129,208,186,208,184,10,32,116,121,112,101,61,34,116,101,120\n,116,34,32,110,97,109,101,61,34,62,80,114,105,118,97,99,121,32,80,111,108,105,99\n,121,60,47,97,62,97,100,109,105,110,105,115,116,101,114,101,100,32,98,121,32,116\n,104,101,101,110,97,98,108,101,83,105,110,103,108,101,82,101,113,117,101,115,116\n,115,116,121,108,101,61,38,113,117,111,116,59,109,97,114,103,105,110,58,60,47,\n100,105,118,62,60,47,100,105,118,62,60,47,100,105,118,62,60,62,60,105,109,103,32\n,115,114,99,61,34,104,116,116,112,58,47,47,105,32,115,116,121,108,101,61,38,113,\n117,111,116,59,102,108,111,97,116,58,114,101,102,101,114,114,101,100,32,116,111,\n32,97,115,32,116,104,101,32,116,111,116,97,108,32,112,111,112,117,108,97,116,105\n,111,110,32,111,102,105,110,32,87,97,115,104,105,110,103,116,111,110,44,32,68,46\n,67,46,32,115,116,121,108,101,61,34,98,97,99,107,103,114,111,117,110,100,45,97,\n109,111,110,103,32,111,116,104,101,114,32,116,104,105,110,103,115,44,111,114,103\n,97,110,105,122,97,116,105,111,110,32,111,102,32,116,104,101,112,97,114,116,105,\n99,105,112,97,116,101,100,32,105,110,32,116,104,101,116,104,101,32,105,110,116,\n114,111,100,117,99,116,105,111,110,32,111,102,105,100,101,110,116,105,102,105,\n101,100,32,119,105,116,104,32,116,104,101,102,105,99,116,105,111,110,97,108,32,\n99,104,97,114,97,99,116,101,114,32,79,120,102,111,114,100,32,85,110,105,118,101,\n114,115,105,116,121,32,109,105,115,117,110,100,101,114,115,116,97,110,100,105,\n110,103,32,111,102,84,104,101,114,101,32,97,114,101,44,32,104,111,119,101,118,\n101,114,44,115,116,121,108,101,115,104,101,101,116,34,32,104,114,101,102,61,34,\n47,67,111,108,117,109,98,105,97,32,85,110,105,118,101,114,115,105,116,121,101,\n120,112,97,110,100,101,100,32,116,111,32,105,110,99,108,117,100,101,117,115,117,\n97,108,108,121,32,114,101,102,101,114,114,101,100,32,116,111,105,110,100,105,99,\n97,116,105,110,103,32,116,104,97,116,32,116,104,101,104,97,118,101,32,115,117,\n103,103,101,115,116,101,100,32,116,104,97,116,97,102,102,105,108,105,97,116,101,\n100,32,119,105,116,104,32,116,104,101,99,111,114,114,101,108,97,116,105,111,110,\n32,98,101,116,119,101,101,110,110,117,109,98,101,114,32,111,102,32,100,105,102,\n102,101,114,101,110,116,62,60,47,116,100,62,60,47,116,114,62,60,47,116,97,98,108\n,101,62,82,101,112,117,98,108,105,99,32,111,102,32,73,114,101,108,97,110,100,10,\n60,47,115,99,114,105,112,116,62,10,60,115,99,114,105,112,116,32,117,110,100,101,\n114,32,116,104,101,32,105,110,102,108,117,101,110,99,101,99,111,110,116,114,105,\n98,117,116,105,111,110,32,116,111,32,116,104,101,79,102,102,105,99,105,97,108,32\n,119,101,98,115,105,116,101,32,111,102,104,101,97,100,113,117,97,114,116,101,114\n,115,32,111,102,32,116,104,101,99,101,110,116,101,114,101,100,32,97,114,111,117,\n110,100,32,116,104,101,105,109,112,108,105,99,97,116,105,111,110,115,32,111,102,\n32,116,104,101,104,97,118,101,32,98,101,101,110,32,100,101,118,101,108,111,112,\n101,100,70,101,100,101,114,97,108,32,82,101,112,117,98,108,105,99,32,111,102,98,\n101,99,97,109,101,32,105,110,99,114,101,97,115,105,110,103,108,121,99,111,110,\n116,105,110,117,97,116,105,111,110,32,111,102,32,116,104,101,78,111,116,101,44,\n32,104,111,119,101,118,101,114,44,32,116,104,97,116,115,105,109,105,108,97,114,\n32,116,111,32,116,104,97,116,32,111,102,32,99,97,112,97,98,105,108,105,116,105,\n101,115,32,111,102,32,116,104,101,97,99,99,111,114,100,97,110,99,101,32,119,105,\n116,104,32,116,104,101,112,97,114,116,105,99,105,112,97,110,116,115,32,105,110,\n32,116,104,101,102,117,114,116,104,101,114,32,100,101,118,101,108,111,112,109,\n101,110,116,117,110,100,101,114,32,116,104,101,32,100,105,114,101,99,116,105,111\n,110,105,115,32,111,102,116,101,110,32,99,111,110,115,105,100,101,114,101,100,\n104,105,115,32,121,111,117,110,103,101,114,32,98,114,111,116,104,101,114,60,47,\n116,100,62,60,47,116,114,62,60,47,116,97,98,108,101,62,60,97,32,104,116,116,112,\n45,101,113,117,105,118,61,34,88,45,85,65,45,112,104,121,115,105,99,97,108,32,112\n,114,111,112,101,114,116,105,101,115,111,102,32,66,114,105,116,105,115,104,32,67\n,111,108,117,109,98,105,97,104,97,115,32,98,101,101,110,32,99,114,105,116,105,99\n,105,122,101,100,40,119,105,116,104,32,116,104,101,32,101,120,99,101,112,116,105\n,111,110,113,117,101,115,116,105,111,110,115,32,97,98,111,117,116,32,116,104,101\n,112,97,115,115,105,110,103,32,116,104,114,111,117,103,104,32,116,104,101,48,34,\n32,99,101,108,108,112,97,100,100,105,110,103,61,34,48,34,32,116,104,111,117,115,\n97,110,100,115,32,111,102,32,112,101,111,112,108,101,114,101,100,105,114,101,99,\n116,115,32,104,101,114,101,46,32,70,111,114,104,97,118,101,32,99,104,105,108,100\n,114,101,110,32,117,110,100,101,114,37,51,69,37,51,67,47,115,99,114,105,112,116,\n37,51,69,34,41,41,59,60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,47,119\n,119,119,46,60,108,105,62,60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,\n47,115,105,116,101,95,110,97,109,101,34,32,99,111,110,116,101,110,116,61,34,116,\n101,120,116,45,100,101,99,111,114,97,116,105,111,110,58,110,111,110,101,115,116,\n121,108,101,61,34,100,105,115,112,108,97,121,58,32,110,111,110,101,60,109,101,\n116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,88,45,110,101,119,32,68,\n97,116,101,40,41,46,103,101,116,84,105,109,101,40,41,32,116,121,112,101,61,34,\n105,109,97,103,101,47,120,45,105,99,111,110,34,60,47,115,112,97,110,62,60,115,\n112,97,110,32,99,108,97,115,115,61,34,108,97,110,103,117,97,103,101,61,34,106,97\n,118,97,115,99,114,105,112,116,119,105,110,100,111,119,46,108,111,99,97,116,105,\n111,110,46,104,114,101,102,60,97,32,104,114,101,102,61,34,106,97,118,97,115,99,\n114,105,112,116,58,45,45,62,13,10,60,115,99,114,105,112,116,32,116,121,112,101,\n61,34,116,60,97,32,104,114,101,102,61,39,104,116,116,112,58,47,47,119,119,119,46\n,104,111,114,116,99,117,116,32,105,99,111,110,34,32,104,114,101,102,61,34,60,47,\n100,105,118,62,13,10,60,100,105,118,32,99,108,97,115,115,61,34,60,115,99,114,105\n,112,116,32,115,114,99,61,34,104,116,116,112,58,47,47,34,32,114,101,108,61,34,\n115,116,121,108,101,115,104,101,101,116,34,32,116,60,47,100,105,118,62,10,60,115\n,99,114,105,112,116,32,116,121,112,101,61,47,97,62,32,60,97,32,104,114,101,102,\n61,34,104,116,116,112,58,47,47,32,97,108,108,111,119,84,114,97,110,115,112,97,\n114,101,110,99,121,61,34,88,45,85,65,45,67,111,109,112,97,116,105,98,108,101,34,\n32,99,111,110,114,101,108,97,116,105,111,110,115,104,105,112,32,98,101,116,119,\n101,101,110,10,60,47,115,99,114,105,112,116,62,13,10,60,115,99,114,105,112,116,\n32,60,47,97,62,60,47,108,105,62,60,47,117,108,62,60,47,100,105,118,62,97,115,115\n,111,99,105,97,116,101,100,32,119,105,116,104,32,116,104,101,32,112,114,111,103,\n114,97,109,109,105,110,103,32,108,97,110,103,117,97,103,101,60,47,97,62,60,97,32\n,104,114,101,102,61,34,104,116,116,112,58,47,47,60,47,97,62,60,47,108,105,62,60,\n108,105,32,99,108,97,115,115,61,34,102,111,114,109,32,97,99,116,105,111,110,61,\n34,104,116,116,112,58,47,47,60,100,105,118,32,115,116,121,108,101,61,34,100,105,\n115,112,108,97,121,58,116,121,112,101,61,34,116,101,120,116,34,32,110,97,109,101\n,61,34,113,34,60,116,97,98,108,101,32,119,105,100,116,104,61,34,49,48,48,37,34,\n32,98,97,99,107,103,114,111,117,110,100,45,112,111,115,105,116,105,111,110,58,34\n,32,98,111,114,100,101,114,61,34,48,34,32,119,105,100,116,104,61,34,114,101,108,\n61,34,115,104,111,114,116,99,117,116,32,105,99,111,110,34,32,104,54,62,60,117,\n108,62,60,108,105,62,60,97,32,104,114,101,102,61,34,32,32,60,109,101,116,97,32,\n104,116,116,112,45,101,113,117,105,118,61,34,99,115,115,34,32,109,101,100,105,97\n,61,34,115,99,114,101,101,110,34,32,114,101,115,112,111,110,115,105,98,108,101,\n32,102,111,114,32,116,104,101,32,34,32,116,121,112,101,61,34,97,112,112,108,105,\n99,97,116,105,111,110,47,34,32,115,116,121,108,101,61,34,98,97,99,107,103,114,\n111,117,110,100,45,104,116,109,108,59,32,99,104,97,114,115,101,116,61,117,116,\n102,45,56,34,32,97,108,108,111,119,116,114,97,110,115,112,97,114,101,110,99,121,\n61,34,115,116,121,108,101,115,104,101,101,116,34,32,116,121,112,101,61,34,116,\n101,13,10,60,109,101,116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,62,\n60,47,115,112,97,110,62,60,115,112,97,110,32,99,108,97,115,115,61,34,48,34,32,99\n,101,108,108,115,112,97,99,105,110,103,61,34,48,34,62,59,10,60,47,115,99,114,105\n,112,116,62,10,60,115,99,114,105,112,116,32,115,111,109,101,116,105,109,101,115,\n32,99,97,108,108,101,100,32,116,104,101,100,111,101,115,32,110,111,116,32,110,\n101,99,101,115,115,97,114,105,108,121,70,111,114,32,109,111,114,101,32,105,110,\n102,111,114,109,97,116,105,111,110,97,116,32,116,104,101,32,98,101,103,105,110,\n110,105,110,103,32,111,102,32,60,33,68,79,67,84,89,80,69,32,104,116,109,108,62,\n60,104,116,109,108,112,97,114,116,105,99,117,108,97,114,108,121,32,105,110,32,\n116,104,101,32,116,121,112,101,61,34,104,105,100,100,101,110,34,32,110,97,109,\n101,61,34,106,97,118,97,115,99,114,105,112,116,58,118,111,105,100,40,48,41,59,34\n,101,102,102,101,99,116,105,118,101,110,101,115,115,32,111,102,32,116,104,101,32\n,97,117,116,111,99,111,109,112,108,101,116,101,61,34,111,102,102,34,32,103,101,\n110,101,114,97,108,108,121,32,99,111,110,115,105,100,101,114,101,100,62,60,105,\n110,112,117,116,32,116,121,112,101,61,34,116,101,120,116,34,32,34,62,60,47,115,\n99,114,105,112,116,62,13,10,60,115,99,114,105,112,116,116,104,114,111,117,103,\n104,111,117,116,32,116,104,101,32,119,111,114,108,100,99,111,109,109,111,110,32,\n109,105,115,99,111,110,99,101,112,116,105,111,110,97,115,115,111,99,105,97,116,\n105,111,110,32,119,105,116,104,32,116,104,101,60,47,100,105,118,62,10,60,47,100,\n105,118,62,10,60,100,105,118,32,99,100,117,114,105,110,103,32,104,105,115,32,108\n,105,102,101,116,105,109,101,44,99,111,114,114,101,115,112,111,110,100,105,110,\n103,32,116,111,32,116,104,101,116,121,112,101,61,34,105,109,97,103,101,47,120,45\n,105,99,111,110,34,32,97,110,32,105,110,99,114,101,97,115,105,110,103,32,110,117\n,109,98,101,114,100,105,112,108,111,109,97,116,105,99,32,114,101,108,97,116,105,\n111,110,115,97,114,101,32,111,102,116,101,110,32,99,111,110,115,105,100,101,114,\n101,100,109,101,116,97,32,99,104,97,114,115,101,116,61,34,117,116,102,45,56,34,\n32,60,105,110,112,117,116,32,116,121,112,101,61,34,116,101,120,116,34,32,101,120\n,97,109,112,108,101,115,32,105,110,99,108,117,100,101,32,116,104,101,34,62,60,\n105,109,103,32,115,114,99,61,34,104,116,116,112,58,47,47,105,112,97,114,116,105,\n99,105,112,97,116,105,111,110,32,105,110,32,116,104,101,116,104,101,32,101,115,\n116,97,98,108,105,115,104,109,101,110,116,32,111,102,10,60,47,100,105,118,62,10,\n60,100,105,118,32,99,108,97,115,115,61,34,38,97,109,112,59,110,98,115,112,59,38,\n97,109,112,59,110,98,115,112,59,116,111,32,100,101,116,101,114,109,105,110,101,\n32,119,104,101,116,104,101,114,113,117,105,116,101,32,100,105,102,102,101,114,\n101,110,116,32,102,114,111,109,109,97,114,107,101,100,32,116,104,101,32,98,101,\n103,105,110,110,105,110,103,100,105,115,116,97,110,99,101,32,98,101,116,119,101,\n101,110,32,116,104,101,99,111,110,116,114,105,98,117,116,105,111,110,115,32,116,\n111,32,116,104,101,99,111,110,102,108,105,99,116,32,98,101,116,119,101,101,110,\n32,116,104,101,119,105,100,101,108,121,32,99,111,110,115,105,100,101,114,101,100\n,32,116,111,119,97,115,32,111,110,101,32,111,102,32,116,104,101,32,102,105,114,\n115,116,119,105,116,104,32,118,97,114,121,105,110,103,32,100,101,103,114,101,101\n,115,104,97,118,101,32,115,112,101,99,117,108,97,116,101,100,32,116,104,97,116,\n40,100,111,99,117,109,101,110,116,46,103,101,116,69,108,101,109,101,110,116,112,\n97,114,116,105,99,105,112,97,116,105,110,103,32,105,110,32,116,104,101,111,114,\n105,103,105,110,97,108,108,121,32,100,101,118,101,108,111,112,101,100,101,116,97\n,32,99,104,97,114,115,101,116,61,34,117,116,102,45,56,34,62,32,116,121,112,101,\n61,34,116,101,120,116,47,99,115,115,34,32,47,62,10,105,110,116,101,114,99,104,97\n,110,103,101,97,98,108,121,32,119,105,116,104,109,111,114,101,32,99,108,111,115,\n101,108,121,32,114,101,108,97,116,101,100,115,111,99,105,97,108,32,97,110,100,32\n,112,111,108,105,116,105,99,97,108,116,104,97,116,32,119,111,117,108,100,32,111,\n116,104,101,114,119,105,115,101,112,101,114,112,101,110,100,105,99,117,108,97,\n114,32,116,111,32,116,104,101,115,116,121,108,101,32,116,121,112,101,61,34,116,\n101,120,116,47,99,115,115,116,121,112,101,61,34,115,117,98,109,105,116,34,32,110\n,97,109,101,61,34,102,97,109,105,108,105,101,115,32,114,101,115,105,100,105,110,\n103,32,105,110,100,101,118,101,108,111,112,105,110,103,32,99,111,117,110,116,114\n,105,101,115,99,111,109,112,117,116,101,114,32,112,114,111,103,114,97,109,109,\n105,110,103,101,99,111,110,111,109,105,99,32,100,101,118,101,108,111,112,109,101\n,110,116,100,101,116,101,114,109,105,110,97,116,105,111,110,32,111,102,32,116,\n104,101,102,111,114,32,109,111,114,101,32,105,110,102,111,114,109,97,116,105,111\n,110,111,110,32,115,101,118,101,114,97,108,32,111,99,99,97,115,105,111,110,115,\n112,111,114,116,117,103,117,195,170,115,32,40,69,117,114,111,112,101,117,41,208,\n163,208,186,209,128,208,176,209,151,208,189,209,129,209,140,208,186,208,176,209,\n131,208,186,209,128,208,176,209,151,208,189,209,129,209,140,208,186,208,176,208,\n160,208,190,209,129,209,129,208,184,208,185,209,129,208,186,208,190,208,185,208,\n188,208,176,209,130,208,181,209,128,208,184,208,176,208,187,208,190,208,178,208,\n184,208,189,209,132,208,190,209,128,208,188,208,176,209,134,208,184,208,184,209,\n131,208,191,209,128,208,176,208,178,208,187,208,181,208,189,208,184,209,143,208,\n189,208,181,208,190,208,177,209,133,208,190,208,180,208,184,208,188,208,190,208,\n184,208,189,209,132,208,190,209,128,208,188,208,176,209,134,208,184,209,143,208,\n152,208,189,209,132,208,190,209,128,208,188,208,176,209,134,208,184,209,143,208,\n160,208,181,209,129,208,191,209,131,208,177,208,187,208,184,208,186,208,184,208,\n186,208,190,208,187,208,184,209,135,208,181,209,129,209,130,208,178,208,190,208,\n184,208,189,209,132,208,190,209,128,208,188,208,176,209,134,208,184,209,142,209,\n130,208,181,209,128,209,128,208,184,209,130,208,190,209,128,208,184,208,184,208,\n180,208,190,209,129,209,130,208,176,209,130,208,190,209,135,208,189,208,190,216,\n167,217,132,217,133,216,170,217,136,216,167,216,172,216,175,217,136,217,134,216,\n167,217,132,216,167,216,180,216,170,216,177,216,167,217,131,216,167,216,170,216,\n167,217,132,216,167,217,130,216,170,216,177,216,167,216,173,216,167,216,170,104,\n116,109,108,59,32,99,104,97,114,115,101,116,61,85,84,70,45,56,34,32,115,101,116,\n84,105,109,101,111,117,116,40,102,117,110,99,116,105,111,110,40,41,100,105,115,\n112,108,97,121,58,105,110,108,105,110,101,45,98,108,111,99,107,59,60,105,110,112\n,117,116,32,116,121,112,101,61,34,115,117,98,109,105,116,34,32,116,121,112,101,\n32,61,32,39,116,101,120,116,47,106,97,118,97,115,99,114,105,60,105,109,103,32,\n115,114,99,61,34,104,116,116,112,58,47,47,119,119,119,46,34,32,34,104,116,116,\n112,58,47,47,119,119,119,46,119,51,46,111,114,103,47,115,104,111,114,116,99,117,\n116,32,105,99,111,110,34,32,104,114,101,102,61,34,34,32,97,117,116,111,99,111,\n109,112,108,101,116,101,61,34,111,102,102,34,32,60,47,97,62,60,47,100,105,118,62\n,60,100,105,118,32,99,108,97,115,115,61,60,47,97,62,60,47,108,105,62,10,60,108,\n105,32,99,108,97,115,115,61,34,99,115,115,34,32,116,121,112,101,61,34,116,101,\n120,116,47,99,115,115,34,32,60,102,111,114,109,32,97,99,116,105,111,110,61,34,\n104,116,116,112,58,47,47,120,116,47,99,115,115,34,32,104,114,101,102,61,34,104,\n116,116,112,58,47,47,108,105,110,107,32,114,101,108,61,34,97,108,116,101,114,110\n,97,116,101,34,32,13,10,60,115,99,114,105,112,116,32,116,121,112,101,61,34,116,\n101,120,116,47,32,111,110,99,108,105,99,107,61,34,106,97,118,97,115,99,114,105,\n112,116,58,40,110,101,119,32,68,97,116,101,41,46,103,101,116,84,105,109,101,40,\n41,125,104,101,105,103,104,116,61,34,49,34,32,119,105,100,116,104,61,34,49,34,32\n,80,101,111,112,108,101,39,115,32,82,101,112,117,98,108,105,99,32,111,102,32,32,\n60,97,32,104,114,101,102,61,34,104,116,116,112,58,47,47,119,119,119,46,116,101,\n120,116,45,100,101,99,111,114,97,116,105,111,110,58,117,110,100,101,114,116,104,\n101,32,98,101,103,105,110,110,105,110,103,32,111,102,32,116,104,101,32,60,47,100\n,105,118,62,10,60,47,100,105,118,62,10,60,47,100,105,118,62,10,101,115,116,97,98\n,108,105,115,104,109,101,110,116,32,111,102,32,116,104,101,32,60,47,100,105,118,\n62,60,47,100,105,118,62,60,47,100,105,118,62,60,47,100,35,118,105,101,119,112,\n111,114,116,123,109,105,110,45,104,101,105,103,104,116,58,10,60,115,99,114,105,\n112,116,32,115,114,99,61,34,104,116,116,112,58,47,47,111,112,116,105,111,110,62,\n60,111,112,116,105,111,110,32,118,97,108,117,101,61,111,102,116,101,110,32,114,\n101,102,101,114,114,101,100,32,116,111,32,97,115,32,47,111,112,116,105,111,110,\n62,10,60,111,112,116,105,111,110,32,118,97,108,117,60,33,68,79,67,84,89,80,69,32\n,104,116,109,108,62,10,60,33,45,45,91,73,110,116,101,114,110,97,116,105,111,110,\n97,108,32,65,105,114,112,111,114,116,62,10,60,97,32,104,114,101,102,61,34,104,\n116,116,112,58,47,47,119,119,119,60,47,97,62,60,97,32,104,114,101,102,61,34,104,\n116,116,112,58,47,47,119,224,184,160,224,184,178,224,184,169,224,184,178,224,185\n,132,224,184,151,224,184,162,225,131,165,225,131,144,225,131,160,225,131,151,225\n,131,163,225,131,154,225,131,152,230,173,163,233,171,148,228,184,173,230,150,135\n,32,40,231,185,129,233,171,148,41,224,164,168,224,164,191,224,164,176,224,165,\n141,224,164,166,224,165,135,224,164,182,224,164,161,224,164,190,224,164,137,224,\n164,168,224,164,178,224,165,139,224,164,161,224,164,149,224,165,141,224,164,183,\n224,165,135,224,164,164,224,165,141,224,164,176,224,164,156,224,164,190,224,164,\n168,224,164,149,224,164,190,224,164,176,224,165,128,224,164,184,224,164,130,224,\n164,172,224,164,130,224,164,167,224,164,191,224,164,164,224,164,184,224,165,141,\n224,164,165,224,164,190,224,164,170,224,164,168,224,164,190,224,164,184,224,165,\n141,224,164,181,224,165,128,224,164,149,224,164,190,224,164,176,224,164,184,224,\n164,130,224,164,184,224,165,141,224,164,149,224,164,176,224,164,163,224,164,184,\n224,164,190,224,164,174,224,164,151,224,165,141,224,164,176,224,165,128,224,164,\n154,224,164,191,224,164,159,224,165,141,224,164,160,224,165,139,224,164,130,224,\n164,181,224,164,191,224,164,156,224,165,141,224,164,158,224,164,190,224,164,168,\n224,164,133,224,164,174,224,165,135,224,164,176,224,164,191,224,164,149,224,164,\n190,224,164,181,224,164,191,224,164,173,224,164,191,224,164,168,224,165,141,224,\n164,168,224,164,151,224,164,190,224,164,161,224,164,191,224,164,175,224,164,190,\n224,164,129,224,164,149,224,165,141,224,164,175,224,165,139,224,164,130,224,164,\n149,224,164,191,224,164,184,224,165,129,224,164,176,224,164,149,224,165,141,224,\n164,183,224,164,190,224,164,170,224,164,185,224,165,129,224,164,129,224,164,154,\n224,164,164,224,165,128,224,164,170,224,165,141,224,164,176,224,164,172,224,164,\n130,224,164,167,224,164,168,224,164,159,224,164,191,224,164,170,224,165,141,224,\n164,170,224,164,163,224,165,128,224,164,149,224,165,141,224,164,176,224,164,191,\n224,164,149,224,165,135,224,164,159,224,164,170,224,165,141,224,164,176,224,164,\n190,224,164,176,224,164,130,224,164,173,224,164,170,224,165,141,224,164,176,224,\n164,190,224,164,170,224,165,141,224,164,164,224,164,174,224,164,190,224,164,178,\n224,164,191,224,164,149,224,165,139,224,164,130,224,164,176,224,164,171,224,164,\n188,224,165,141,224,164,164,224,164,190,224,164,176,224,164,168,224,164,191,224,\n164,176,224,165,141,224,164,174,224,164,190,224,164,163,224,164,178,224,164,191,\n224,164,174,224,164,191,224,164,159,224,165,135,224,164,161,100,101,115,99,114,\n105,112,116,105,111,110,34,32,99,111,110,116,101,110,116,61,34,100,111,99,117,\n109,101,110,116,46,108,111,99,97,116,105,111,110,46,112,114,111,116,46,103,101,\n116,69,108,101,109,101,110,116,115,66,121,84,97,103,78,97,109,101,40,60,33,68,79\n,67,84,89,80,69,32,104,116,109,108,62,10,60,104,116,109,108,32,60,109,101,116,97\n,32,99,104,97,114,115,101,116,61,34,117,116,102,45,56,34,62,58,117,114,108,34,32\n,99,111,110,116,101,110,116,61,34,104,116,116,112,58,47,47,46,99,115,115,34,32,\n114,101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,115,116,121,108,101\n,32,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34,62,116,121,112,101,61\n,34,116,101,120,116,47,99,115,115,34,32,104,114,101,102,61,34,119,51,46,111,114,\n103,47,49,57,57,57,47,120,104,116,109,108,34,32,120,109,108,116,121,112,101,61,\n34,116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,34,32,109,101,116,104\n,111,100,61,34,103,101,116,34,32,97,99,116,105,111,110,61,34,108,105,110,107,32,\n114,101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,32,32,61,32,100,111\n,99,117,109,101,110,116,46,103,101,116,69,108,101,109,101,110,116,116,121,112,\n101,61,34,105,109,97,103,101,47,120,45,105,99,111,110,34,32,47,62,99,101,108,108\n,112,97,100,100,105,110,103,61,34,48,34,32,99,101,108,108,115,112,46,99,115,115,\n34,32,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34,32,60,47,97,62,60,\n47,108,105,62,60,108,105,62,60,97,32,104,114,101,102,61,34,34,32,119,105,100,116\n,104,61,34,49,34,32,104,101,105,103,104,116,61,34,49,34,34,62,60,97,32,104,114,\n101,102,61,34,104,116,116,112,58,47,47,119,119,119,46,115,116,121,108,101,61,34,\n100,105,115,112,108,97,121,58,110,111,110,101,59,34,62,97,108,116,101,114,110,97\n,116,101,34,32,116,121,112,101,61,34,97,112,112,108,105,45,47,47,87,51,67,47,47,\n68,84,68,32,88,72,84,77,76,32,49,46,48,32,101,108,108,115,112,97,99,105,110,103,\n61,34,48,34,32,99,101,108,108,112,97,100,32,116,121,112,101,61,34,104,105,100,\n100,101,110,34,32,118,97,108,117,101,61,34,47,97,62,38,110,98,115,112,59,60,115,\n112,97,110,32,114,111,108,101,61,34,115,10,60,105,110,112,117,116,32,116,121,112\n,101,61,34,104,105,100,100,101,110,34,32,108,97,110,103,117,97,103,101,61,34,74,\n97,118,97,83,99,114,105,112,116,34,32,32,100,111,99,117,109,101,110,116,46,103,\n101,116,69,108,101,109,101,110,116,115,66,103,61,34,48,34,32,99,101,108,108,115,\n112,97,99,105,110,103,61,34,48,34,32,121,112,101,61,34,116,101,120,116,47,99,115\n,115,34,32,109,101,100,105,97,61,34,116,121,112,101,61,39,116,101,120,116,47,106\n,97,118,97,115,99,114,105,112,116,39,119,105,116,104,32,116,104,101,32,101,120,\n99,101,112,116,105,111,110,32,111,102,32,121,112,101,61,34,116,101,120,116,47,99\n,115,115,34,32,114,101,108,61,34,115,116,32,104,101,105,103,104,116,61,34,49,34,\n32,119,105,100,116,104,61,34,49,34,32,61,39,43,101,110,99,111,100,101,85,82,73,\n67,111,109,112,111,110,101,110,116,40,60,108,105,110,107,32,114,101,108,61,34,97\n,108,116,101,114,110,97,116,101,34,32,10,98,111,100,121,44,32,116,114,44,32,105,\n110,112,117,116,44,32,116,101,120,116,109,101,116,97,32,110,97,109,101,61,34,114\n,111,98,111,116,115,34,32,99,111,110,109,101,116,104,111,100,61,34,112,111,115,\n116,34,32,97,99,116,105,111,110,61,34,62,10,60,97,32,104,114,101,102,61,34,104,\n116,116,112,58,47,47,119,119,119,46,99,115,115,34,32,114,101,108,61,34,115,116,\n121,108,101,115,104,101,101,116,34,32,60,47,100,105,118,62,60,47,100,105,118,62,\n60,100,105,118,32,99,108,97,115,115,108,97,110,103,117,97,103,101,61,34,106,97,\n118,97,115,99,114,105,112,116,34,62,97,114,105,97,45,104,105,100,100,101,110,61,\n34,116,114,117,101,34,62,194,183,60,114,105,112,116,34,32,116,121,112,101,61,34,\n116,101,120,116,47,106,97,118,97,115,108,61,48,59,125,41,40,41,59,10,40,102,117,\n110,99,116,105,111,110,40,41,123,98,97,99,107,103,114,111,117,110,100,45,105,109\n,97,103,101,58,32,117,114,108,40,47,97,62,60,47,108,105,62,60,108,105,62,60,97,\n32,104,114,101,102,61,34,104,9,9,60,108,105,62,60,97,32,104,114,101,102,61,34,\n104,116,116,112,58,47,47,97,116,111,114,34,32,97,114,105,97,45,104,105,100,100,\n101,110,61,34,116,114,117,62,32,60,97,32,104,114,101,102,61,34,104,116,116,112,\n58,47,47,119,119,119,46,108,97,110,103,117,97,103,101,61,34,106,97,118,97,115,99\n,114,105,112,116,34,32,47,111,112,116,105,111,110,62,10,60,111,112,116,105,111,\n110,32,118,97,108,117,101,47,100,105,118,62,60,47,100,105,118,62,60,100,105,118,\n32,99,108,97,115,115,61,114,97,116,111,114,34,32,97,114,105,97,45,104,105,100,\n100,101,110,61,34,116,114,101,61,40,110,101,119,32,68,97,116,101,41,46,103,101,\n116,84,105,109,101,40,41,112,111,114,116,117,103,117,195,170,115,32,40,100,111,\n32,66,114,97,115,105,108,41,208,190,209,128,208,179,208,176,208,189,208,184,208,\n183,208,176,209,134,208,184,208,184,208,178,208,190,208,183,208,188,208,190,208,\n182,208,189,208,190,209,129,209,130,209,140,208,190,208,177,209,128,208,176,208,\n183,208,190,208,178,208,176,208,189,208,184,209,143,209,128,208,181,208,179,208,\n184,209,129,209,130,209,128,208,176,209,134,208,184,208,184,208,178,208,190,208,\n183,208,188,208,190,208,182,208,189,208,190,209,129,209,130,208,184,208,190,208,\n177,209,143,208,183,208,176,209,130,208,181,208,187,209,140,208,189,208,176,60,\n33,68,79,67,84,89,80,69,32,104,116,109,108,32,80,85,66,76,73,67,32,34,110,116,45\n,84,121,112,101,34,32,99,111,110,116,101,110,116,61,34,116,101,120,116,47,60,109\n,101,116,97,32,104,116,116,112,45,101,113,117,105,118,61,34,67,111,110,116,101,\n114,97,110,115,105,116,105,111,110,97,108,47,47,69,78,34,32,34,104,116,116,112,\n58,60,104,116,109,108,32,120,109,108,110,115,61,34,104,116,116,112,58,47,47,119,\n119,119,45,47,47,87,51,67,47,47,68,84,68,32,88,72,84,77,76,32,49,46,48,32,84,68,\n84,68,47,120,104,116,109,108,49,45,116,114,97,110,115,105,116,105,111,110,97,108\n,47,47,119,119,119,46,119,51,46,111,114,103,47,84,82,47,120,104,116,109,108,49,\n47,112,101,32,61,32,39,116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,\n39,59,60,109,101,116,97,32,110,97,109,101,61,34,100,101,115,99,114,105,112,116,\n105,111,110,112,97,114,101,110,116,78,111,100,101,46,105,110,115,101,114,116,66,\n101,102,111,114,101,60,105,110,112,117,116,32,116,121,112,101,61,34,104,105,100,\n100,101,110,34,32,110,97,106,115,34,32,116,121,112,101,61,34,116,101,120,116,47,\n106,97,118,97,115,99,114,105,40,100,111,99,117,109,101,110,116,41,46,114,101,97,\n100,121,40,102,117,110,99,116,105,115,99,114,105,112,116,32,116,121,112,101,61,\n34,116,101,120,116,47,106,97,118,97,115,105,109,97,103,101,34,32,99,111,110,116,\n101,110,116,61,34,104,116,116,112,58,47,47,85,65,45,67,111,109,112,97,116,105,98\n,108,101,34,32,99,111,110,116,101,110,116,61,116,109,108,59,32,99,104,97,114,115\n,101,116,61,117,116,102,45,56,34,32,47,62,10,108,105,110,107,32,114,101,108,61,\n34,115,104,111,114,116,99,117,116,32,105,99,111,110,60,108,105,110,107,32,114,\n101,108,61,34,115,116,121,108,101,115,104,101,101,116,34,32,60,47,115,99,114,105\n,112,116,62,10,60,115,99,114,105,112,116,32,116,121,112,101,61,61,32,100,111,99,\n117,109,101,110,116,46,99,114,101,97,116,101,69,108,101,109,101,110,60,97,32,116\n,97,114,103,101,116,61,34,95,98,108,97,110,107,34,32,104,114,101,102,61,32,100,\n111,99,117,109,101,110,116,46,103,101,116,69,108,101,109,101,110,116,115,66,105,\n110,112,117,116,32,116,121,112,101,61,34,116,101,120,116,34,32,110,97,109,101,61\n,97,46,116,121,112,101,32,61,32,39,116,101,120,116,47,106,97,118,97,115,99,114,\n105,110,112,117,116,32,116,121,112,101,61,34,104,105,100,100,101,110,34,32,110,\n97,109,101,104,116,109,108,59,32,99,104,97,114,115,101,116,61,117,116,102,45,56,\n34,32,47,62,100,116,100,34,62,10,60,104,116,109,108,32,120,109,108,110,115,61,34\n,104,116,116,112,45,47,47,87,51,67,47,47,68,84,68,32,72,84,77,76,32,52,46,48,49,\n32,84,101,110,116,115,66,121,84,97,103,78,97,109,101,40,39,115,99,114,105,112,\n116,39,41,105,110,112,117,116,32,116,121,112,101,61,34,104,105,100,100,101,110,\n34,32,110,97,109,60,115,99,114,105,112,116,32,116,121,112,101,61,34,116,101,120,\n116,47,106,97,118,97,115,34,32,115,116,121,108,101,61,34,100,105,115,112,108,97,\n121,58,110,111,110,101,59,34,62,100,111,99,117,109,101,110,116,46,103,101,116,69\n,108,101,109,101,110,116,66,121,73,100,40,61,100,111,99,117,109,101,110,116,46,\n99,114,101,97,116,101,69,108,101,109,101,110,116,40,39,32,116,121,112,101,61,39,\n116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,39,105,110,112,117,116,\n32,116,121,112,101,61,34,116,101,120,116,34,32,110,97,109,101,61,34,100,46,103,\n101,116,69,108,101,109,101,110,116,115,66,121,84,97,103,78,97,109,101,40,115,110\n,105,99,97,108,34,32,104,114,101,102,61,34,104,116,116,112,58,47,47,119,119,119,\n46,67,47,47,68,84,68,32,72,84,77,76,32,52,46,48,49,32,84,114,97,110,115,105,116,\n60,115,116,121,108,101,32,116,121,112,101,61,34,116,101,120,116,47,99,115,115,34\n,62,10,10,60,115,116,121,108,101,32,116,121,112,101,61,34,116,101,120,116,47,99,\n115,115,34,62,105,111,110,97,108,46,100,116,100,34,62,10,60,104,116,109,108,32,\n120,109,108,110,115,61,104,116,116,112,45,101,113,117,105,118,61,34,67,111,110,\n116,101,110,116,45,84,121,112,101,100,105,110,103,61,34,48,34,32,99,101,108,108,\n115,112,97,99,105,110,103,61,34,48,34,104,116,109,108,59,32,99,104,97,114,115,\n101,116,61,117,116,102,45,56,34,32,47,62,10,32,115,116,121,108,101,61,34,100,105\n,115,112,108,97,121,58,110,111,110,101,59,34,62,60,60,108,105,62,60,97,32,104,\n114,101,102,61,34,104,116,116,112,58,47,47,119,119,119,46,32,116,121,112,101,61,\n39,116,101,120,116,47,106,97,118,97,115,99,114,105,112,116,39,62,208,180,208,181\n,209,143,209,130,208,181,208,187,209,140,208,189,208,190,209,129,209,130,208,184\n,209,129,208,190,208,190,209,130,208,178,208,181,209,130,209,129,209,130,208,178\n,208,184,208,184,208,191,209,128,208,190,208,184,208,183,208,178,208,190,208,180\n,209,129,209,130,208,178,208,176,208,177,208,181,208,183,208,190,208,191,208,176\n,209,129,208,189,208,190,209,129,209,130,208,184,224,164,170,224,165,129,224,164\n,184,224,165,141,224,164,164,224,164,191,224,164,149,224,164,190,224,164,149,224\n,164,190,224,164,130,224,164,151,224,165,141,224,164,176,224,165,135,224,164,184\n,224,164,137,224,164,168,224,165,141,224,164,185,224,165,139,224,164,130,224,164\n,168,224,165,135,224,164,181,224,164,191,224,164,167,224,164,190,224,164,168,224\n,164,184,224,164,173,224,164,190,224,164,171,224,164,191,224,164,149,224,165,141\n,224,164,184,224,164,191,224,164,130,224,164,151,224,164,184,224,165,129,224,164\n,176,224,164,149,224,165,141,224,164,183,224,164,191,224,164,164,224,164,149,224\n,165,137,224,164,170,224,165,128,224,164,176,224,164,190,224,164,135,224,164,159\n,224,164,181,224,164,191,224,164,156,224,165,141,224,164,158,224,164,190,224,164\n,170,224,164,168,224,164,149,224,164,190,224,164,176,224,165,141,224,164,176,224\n,164,181,224,164,190,224,164,136,224,164,184,224,164,149,224,165,141,224,164,176\n,224,164,191,224,164,175,224,164,164,224,164,190\n};\n" }, { "path": "libs/brotli/common/platform.c", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"platform.h\"\n\n/* Default brotli_alloc_func */\nvoid* BrotliDefaultAllocFunc(void* opaque, size_t size) {\n BROTLI_UNUSED(opaque);\n return malloc(size);\n}\n\n/* Default brotli_free_func */\nvoid BrotliDefaultFreeFunc(void* opaque, void* address) {\n BROTLI_UNUSED(opaque);\n free(address);\n}\n" }, { "path": "libs/brotli/common/platform.h", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Macros for compiler / platform specific features and build options.\n\n Build options are:\n * BROTLI_BUILD_32_BIT disables 64-bit optimizations\n * BROTLI_BUILD_64_BIT forces to use 64-bit optimizations\n * BROTLI_BUILD_BIG_ENDIAN forces to use big-endian optimizations\n * BROTLI_BUILD_ENDIAN_NEUTRAL disables endian-aware optimizations\n * BROTLI_BUILD_LITTLE_ENDIAN forces to use little-endian optimizations\n * BROTLI_BUILD_NO_RBIT disables \"rbit\" optimization for ARM CPUs\n * BROTLI_BUILD_NO_UNALIGNED_READ_FAST forces off the fast-unaligned-read\n optimizations (mainly for testing purposes)\n * BROTLI_DEBUG dumps file name and line number when decoder detects stream\n or memory error\n * BROTLI_ENABLE_LOG enables asserts and dumps various state information\n * BROTLI_ENABLE_DUMP overrides default \"dump\" behaviour\n*/\n\n#ifndef BROTLI_COMMON_PLATFORM_H_\n#define BROTLI_COMMON_PLATFORM_H_\n\n#include /* IWYU pragma: export memcmp, memcpy, memset */\n#include /* IWYU pragma: export exit, free, malloc */\n#include /* should include endian.h for us */\n\n#include /* IWYU pragma: export */\n#include /* IWYU pragma: export */\n\n#if BROTLI_MSVC_VERSION_CHECK(18, 0, 0)\n#include \n#endif\n\n#if defined(BROTLI_ENABLE_LOG) || defined(BROTLI_DEBUG)\n#include \n#include \n#endif\n\n/* The following macros were borrowed from https://github.com/nemequ/hedley\n * with permission of original author - Evan Nemerson */\n\n/* >>> >>> >>> hedley macros */\n\n/* Define \"BROTLI_PREDICT_TRUE\" and \"BROTLI_PREDICT_FALSE\" macros for capable\n compilers.\n\nTo apply compiler hint, enclose the branching condition into macros, like this:\n\n if (BROTLI_PREDICT_TRUE(zero == 0)) {\n // main execution path\n } else {\n // compiler should place this code outside of main execution path\n }\n\nOR:\n\n if (BROTLI_PREDICT_FALSE(something_rare_or_unexpected_happens)) {\n // compiler should place this code outside of main execution path\n }\n\n*/\n#if BROTLI_GNUC_HAS_BUILTIN(__builtin_expect, 3, 0, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0) || \\\n BROTLI_SUNPRO_VERSION_CHECK(5, 15, 0) || \\\n BROTLI_ARM_VERSION_CHECK(4, 1, 0) || \\\n BROTLI_IBM_VERSION_CHECK(10, 1, 0) || \\\n BROTLI_TI_VERSION_CHECK(7, 3, 0) || \\\n BROTLI_TINYC_VERSION_CHECK(0, 9, 27)\n#define BROTLI_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))\n#define BROTLI_PREDICT_FALSE(x) (__builtin_expect(x, 0))\n#else\n#define BROTLI_PREDICT_FALSE(x) (x)\n#define BROTLI_PREDICT_TRUE(x) (x)\n#endif\n\n#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && \\\n !defined(__cplusplus)\n#define BROTLI_RESTRICT restrict\n#elif BROTLI_GNUC_VERSION_CHECK(3, 1, 0) || \\\n BROTLI_MSVC_VERSION_CHECK(14, 0, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0) || \\\n BROTLI_ARM_VERSION_CHECK(4, 1, 0) || \\\n BROTLI_IBM_VERSION_CHECK(10, 1, 0) || \\\n BROTLI_PGI_VERSION_CHECK(17, 10, 0) || \\\n BROTLI_TI_VERSION_CHECK(8, 0, 0) || \\\n BROTLI_IAR_VERSION_CHECK(8, 0, 0) || \\\n (BROTLI_SUNPRO_VERSION_CHECK(5, 14, 0) && defined(__cplusplus))\n#define BROTLI_RESTRICT __restrict\n#elif BROTLI_SUNPRO_VERSION_CHECK(5, 3, 0) && !defined(__cplusplus)\n#define BROTLI_RESTRICT _Restrict\n#else\n#define BROTLI_RESTRICT\n#endif\n\n#if (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || \\\n (defined(__cplusplus) && (__cplusplus >= 199711L))\n#define BROTLI_MAYBE_INLINE inline\n#elif defined(__GNUC_STDC_INLINE__) || defined(__GNUC_GNU_INLINE__) || \\\n BROTLI_ARM_VERSION_CHECK(6, 2, 0)\n#define BROTLI_MAYBE_INLINE __inline__\n#elif BROTLI_MSVC_VERSION_CHECK(12, 0, 0) || \\\n BROTLI_ARM_VERSION_CHECK(4, 1, 0) || BROTLI_TI_VERSION_CHECK(8, 0, 0)\n#define BROTLI_MAYBE_INLINE __inline\n#else\n#define BROTLI_MAYBE_INLINE\n#endif\n\n#if BROTLI_GNUC_HAS_ATTRIBUTE(always_inline, 4, 0, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0) || \\\n BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) || \\\n BROTLI_ARM_VERSION_CHECK(4, 1, 0) || \\\n BROTLI_IBM_VERSION_CHECK(10, 1, 0) || \\\n BROTLI_TI_VERSION_CHECK(8, 0, 0) || \\\n (BROTLI_TI_VERSION_CHECK(7, 3, 0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__))\n#define BROTLI_INLINE BROTLI_MAYBE_INLINE __attribute__((__always_inline__))\n#elif BROTLI_MSVC_VERSION_CHECK(12, 0, 0)\n#define BROTLI_INLINE BROTLI_MAYBE_INLINE __forceinline\n#elif BROTLI_TI_VERSION_CHECK(7, 0, 0) && defined(__cplusplus)\n#define BROTLI_INLINE BROTLI_MAYBE_INLINE _Pragma(\"FUNC_ALWAYS_INLINE;\")\n#elif BROTLI_IAR_VERSION_CHECK(8, 0, 0)\n#define BROTLI_INLINE BROTLI_MAYBE_INLINE _Pragma(\"inline=forced\")\n#else\n#define BROTLI_INLINE BROTLI_MAYBE_INLINE\n#endif\n\n#if BROTLI_GNUC_HAS_ATTRIBUTE(noinline, 4, 0, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0) || \\\n BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) || \\\n BROTLI_ARM_VERSION_CHECK(4, 1, 0) || \\\n BROTLI_IBM_VERSION_CHECK(10, 1, 0) || \\\n BROTLI_TI_VERSION_CHECK(8, 0, 0) || \\\n (BROTLI_TI_VERSION_CHECK(7, 3, 0) && defined(__TI_GNU_ATTRIBUTE_SUPPORT__))\n#define BROTLI_NOINLINE __attribute__((__noinline__))\n#elif BROTLI_MSVC_VERSION_CHECK(13, 10, 0)\n#define BROTLI_NOINLINE __declspec(noinline)\n#elif BROTLI_PGI_VERSION_CHECK(10, 2, 0)\n#define BROTLI_NOINLINE _Pragma(\"noinline\")\n#elif BROTLI_TI_VERSION_CHECK(6, 0, 0) && defined(__cplusplus)\n#define BROTLI_NOINLINE _Pragma(\"FUNC_CANNOT_INLINE;\")\n#elif BROTLI_IAR_VERSION_CHECK(8, 0, 0)\n#define BROTLI_NOINLINE _Pragma(\"inline=never\")\n#else\n#define BROTLI_NOINLINE\n#endif\n\n/* <<< <<< <<< end of hedley macros. */\n\n#if BROTLI_GNUC_HAS_ATTRIBUTE(unused, 2, 7, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0)\n#define BROTLI_UNUSED_FUNCTION static BROTLI_INLINE __attribute__ ((unused))\n#else\n#define BROTLI_UNUSED_FUNCTION static BROTLI_INLINE\n#endif\n\n#if BROTLI_GNUC_HAS_ATTRIBUTE(aligned, 2, 7, 0)\n#define BROTLI_ALIGNED(N) __attribute__((aligned(N)))\n#else\n#define BROTLI_ALIGNED(N)\n#endif\n\n#if (defined(__ARM_ARCH) && (__ARM_ARCH == 7)) || \\\n (defined(M_ARM) && (M_ARM == 7))\n#define BROTLI_TARGET_ARMV7\n#endif /* ARMv7 */\n\n#if (defined(__ARM_ARCH) && (__ARM_ARCH == 8)) || \\\n defined(__aarch64__) || defined(__ARM64_ARCH_8__)\n#define BROTLI_TARGET_ARMV8_ANY\n\n#if defined(__ARM_32BIT_STATE)\n#define BROTLI_TARGET_ARMV8_32\n#elif defined(__ARM_64BIT_STATE)\n#define BROTLI_TARGET_ARMV8_64\n#endif\n\n#endif /* ARMv8 */\n\n#if defined(__ARM_NEON__) || defined(__ARM_NEON)\n#define BROTLI_TARGET_NEON\n#endif\n\n#if defined(__i386) || defined(_M_IX86)\n#define BROTLI_TARGET_X86\n#endif\n\n#if defined(__x86_64__) || defined(_M_X64)\n#define BROTLI_TARGET_X64\n#endif\n\n#if defined(__PPC64__)\n#define BROTLI_TARGET_POWERPC64\n#endif\n\n#if defined(__riscv) && defined(__riscv_xlen) && __riscv_xlen == 64\n#define BROTLI_TARGET_RISCV64\n#endif\n\n#if defined(__loongarch_lp64)\n#define BROTLI_TARGET_LOONGARCH64\n#endif\n\n/* This does not seem to be an indicator of z/Architecture (64-bit); neither\n that allows to use unaligned loads. */\n#if defined(__s390x__)\n#define BROTLI_TARGET_S390X\n#endif\n\n#if defined(__mips64)\n#define BROTLI_TARGET_MIPS64\n#endif\n\n#if defined(BROTLI_TARGET_X64) || defined(BROTLI_TARGET_ARMV8_64) || \\\n defined(BROTLI_TARGET_POWERPC64) || defined(BROTLI_TARGET_RISCV64) || \\\n defined(BROTLI_TARGET_LOONGARCH64) || defined(BROTLI_TARGET_MIPS64)\n#define BROTLI_TARGET_64_BITS 1\n#else\n#define BROTLI_TARGET_64_BITS 0\n#endif\n\n#if defined(BROTLI_BUILD_64_BIT)\n#define BROTLI_64_BITS 1\n#elif defined(BROTLI_BUILD_32_BIT)\n#define BROTLI_64_BITS 0\n#else\n#define BROTLI_64_BITS BROTLI_TARGET_64_BITS\n#endif\n\n#if (BROTLI_64_BITS)\n#define brotli_reg_t uint64_t\n#else\n#define brotli_reg_t uint32_t\n#endif\n\n#if defined(BROTLI_BUILD_BIG_ENDIAN)\n#define BROTLI_BIG_ENDIAN 1\n#elif defined(BROTLI_BUILD_LITTLE_ENDIAN)\n#define BROTLI_LITTLE_ENDIAN 1\n#elif defined(BROTLI_BUILD_ENDIAN_NEUTRAL)\n/* Just break elif chain. */\n#elif defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)\n#define BROTLI_LITTLE_ENDIAN 1\n#elif defined(_WIN32) || defined(BROTLI_TARGET_X64)\n/* Win32 & x64 can currently always be assumed to be little endian */\n#define BROTLI_LITTLE_ENDIAN 1\n#elif defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)\n#define BROTLI_BIG_ENDIAN 1\n/* Likely target platform is iOS / OSX. */\n#elif defined(BYTE_ORDER) && (BYTE_ORDER == LITTLE_ENDIAN)\n#define BROTLI_LITTLE_ENDIAN 1\n#elif defined(BYTE_ORDER) && (BYTE_ORDER == BIG_ENDIAN)\n#define BROTLI_BIG_ENDIAN 1\n#endif\n\n#if !defined(BROTLI_LITTLE_ENDIAN)\n#define BROTLI_LITTLE_ENDIAN 0\n#endif\n\n#if !defined(BROTLI_BIG_ENDIAN)\n#define BROTLI_BIG_ENDIAN 0\n#endif\n\n#if defined(BROTLI_BUILD_NO_UNALIGNED_READ_FAST)\n#define BROTLI_UNALIGNED_READ_FAST (!!0)\n#elif defined(BROTLI_TARGET_X86) || defined(BROTLI_TARGET_X64) || \\\n defined(BROTLI_TARGET_ARMV7) || defined(BROTLI_TARGET_ARMV8_ANY) || \\\n defined(BROTLI_TARGET_RISCV64) || defined(BROTLI_TARGET_LOONGARCH64)\n/* These targets are known to generate efficient code for unaligned reads\n * (e.g. a single instruction, not multiple 1-byte loads, shifted and or'd\n * together). */\n#define BROTLI_UNALIGNED_READ_FAST (!!1)\n#else\n#define BROTLI_UNALIGNED_READ_FAST (!!0)\n#endif\n\n/* Portable unaligned memory access: read / write values via memcpy. */\n#if !defined(BROTLI_USE_PACKED_FOR_UNALIGNED)\n#if defined(__mips__) && (!defined(__mips_isa_rev) || __mips_isa_rev < 6)\n#define BROTLI_USE_PACKED_FOR_UNALIGNED 1\n#else\n#define BROTLI_USE_PACKED_FOR_UNALIGNED 0\n#endif\n#endif /* defined(BROTLI_USE_PACKED_FOR_UNALIGNED) */\n\n#if BROTLI_USE_PACKED_FOR_UNALIGNED\n\ntypedef union BrotliPackedValue {\n uint16_t u16;\n uint32_t u32;\n uint64_t u64;\n size_t szt;\n} __attribute__ ((packed)) BrotliPackedValue;\n\nstatic BROTLI_INLINE uint16_t BrotliUnalignedRead16(const void* p) {\n const BrotliPackedValue* address = (const BrotliPackedValue*)p;\n return address->u16;\n}\nstatic BROTLI_INLINE uint32_t BrotliUnalignedRead32(const void* p) {\n const BrotliPackedValue* address = (const BrotliPackedValue*)p;\n return address->u32;\n}\nstatic BROTLI_INLINE uint64_t BrotliUnalignedRead64(const void* p) {\n const BrotliPackedValue* address = (const BrotliPackedValue*)p;\n return address->u64;\n}\nstatic BROTLI_INLINE size_t BrotliUnalignedReadSizeT(const void* p) {\n const BrotliPackedValue* address = (const BrotliPackedValue*)p;\n return address->szt;\n}\nstatic BROTLI_INLINE void BrotliUnalignedWrite64(void* p, uint64_t v) {\n BrotliPackedValue* address = (BrotliPackedValue*)p;\n address->u64 = v;\n}\n\n#else /* not BROTLI_USE_PACKED_FOR_UNALIGNED */\n\nstatic BROTLI_INLINE uint16_t BrotliUnalignedRead16(const void* p) {\n uint16_t t;\n memcpy(&t, p, sizeof t);\n return t;\n}\nstatic BROTLI_INLINE uint32_t BrotliUnalignedRead32(const void* p) {\n uint32_t t;\n memcpy(&t, p, sizeof t);\n return t;\n}\nstatic BROTLI_INLINE uint64_t BrotliUnalignedRead64(const void* p) {\n uint64_t t;\n memcpy(&t, p, sizeof t);\n return t;\n}\nstatic BROTLI_INLINE size_t BrotliUnalignedReadSizeT(const void* p) {\n size_t t;\n memcpy(&t, p, sizeof t);\n return t;\n}\nstatic BROTLI_INLINE void BrotliUnalignedWrite64(void* p, uint64_t v) {\n memcpy(p, &v, sizeof v);\n}\n\n#endif /* BROTLI_USE_PACKED_FOR_UNALIGNED */\n\n#if BROTLI_GNUC_HAS_BUILTIN(__builtin_bswap16, 4, 3, 0)\n#define BROTLI_BSWAP16(V) ((uint16_t)__builtin_bswap16(V))\n#else\n#define BROTLI_BSWAP16(V) ((uint16_t)( \\\n (((V) & 0xFFU) << 8) | \\\n (((V) >> 8) & 0xFFU)))\n#endif\n\n#if BROTLI_GNUC_HAS_BUILTIN(__builtin_bswap32, 4, 3, 0)\n#define BROTLI_BSWAP32(V) ((uint32_t)__builtin_bswap32(V))\n#else\n#define BROTLI_BSWAP32(V) ((uint32_t)( \\\n (((V) & 0xFFU) << 24) | (((V) & 0xFF00U) << 8) | \\\n (((V) >> 8) & 0xFF00U) | (((V) >> 24) & 0xFFU)))\n#endif\n\n#if BROTLI_GNUC_HAS_BUILTIN(__builtin_bswap64, 4, 3, 0)\n#define BROTLI_BSWAP64(V) ((uint64_t)__builtin_bswap64(V))\n#else\n#define BROTLI_BSWAP64(V) ((uint64_t)( \\\n (((V) & 0xFFU) << 56) | (((V) & 0xFF00U) << 40) | \\\n (((V) & 0xFF0000U) << 24) | (((V) & 0xFF000000U) << 8) | \\\n (((V) >> 8) & 0xFF000000U) | (((V) >> 24) & 0xFF0000U) | \\\n (((V) >> 40) & 0xFF00U) | (((V) >> 56) & 0xFFU)))\n#endif\n\n#if BROTLI_LITTLE_ENDIAN\n/* Straight endianness. Just read / write values. */\n#define BROTLI_UNALIGNED_LOAD16LE BrotliUnalignedRead16\n#define BROTLI_UNALIGNED_LOAD32LE BrotliUnalignedRead32\n#define BROTLI_UNALIGNED_LOAD64LE BrotliUnalignedRead64\n#define BROTLI_UNALIGNED_STORE64LE BrotliUnalignedWrite64\n#elif BROTLI_BIG_ENDIAN /* BROTLI_LITTLE_ENDIAN */\nstatic BROTLI_INLINE uint16_t BROTLI_UNALIGNED_LOAD16LE(const void* p) {\n uint16_t value = BrotliUnalignedRead16(p);\n return BROTLI_BSWAP16(value);\n}\nstatic BROTLI_INLINE uint32_t BROTLI_UNALIGNED_LOAD32LE(const void* p) {\n uint32_t value = BrotliUnalignedRead32(p);\n return BROTLI_BSWAP32(value);\n}\nstatic BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64LE(const void* p) {\n uint64_t value = BrotliUnalignedRead64(p);\n return BROTLI_BSWAP64(value);\n}\nstatic BROTLI_INLINE void BROTLI_UNALIGNED_STORE64LE(void* p, uint64_t v) {\n uint64_t value = BROTLI_BSWAP64(v);\n BrotliUnalignedWrite64(p, value);\n}\n#else /* BROTLI_LITTLE_ENDIAN */\n/* Read / store values byte-wise; hopefully compiler will understand. */\nstatic BROTLI_INLINE uint16_t BROTLI_UNALIGNED_LOAD16LE(const void* p) {\n const uint8_t* in = (const uint8_t*)p;\n return (uint16_t)(in[0] | (in[1] << 8));\n}\nstatic BROTLI_INLINE uint32_t BROTLI_UNALIGNED_LOAD32LE(const void* p) {\n const uint8_t* in = (const uint8_t*)p;\n uint32_t value = (uint32_t)(in[0]);\n value |= (uint32_t)(in[1]) << 8;\n value |= (uint32_t)(in[2]) << 16;\n value |= (uint32_t)(in[3]) << 24;\n return value;\n}\nstatic BROTLI_INLINE uint64_t BROTLI_UNALIGNED_LOAD64LE(const void* p) {\n const uint8_t* in = (const uint8_t*)p;\n uint64_t value = (uint64_t)(in[0]);\n value |= (uint64_t)(in[1]) << 8;\n value |= (uint64_t)(in[2]) << 16;\n value |= (uint64_t)(in[3]) << 24;\n value |= (uint64_t)(in[4]) << 32;\n value |= (uint64_t)(in[5]) << 40;\n value |= (uint64_t)(in[6]) << 48;\n value |= (uint64_t)(in[7]) << 56;\n return value;\n}\nstatic BROTLI_INLINE void BROTLI_UNALIGNED_STORE64LE(void* p, uint64_t v) {\n uint8_t* out = (uint8_t*)p;\n out[0] = (uint8_t)v;\n out[1] = (uint8_t)(v >> 8);\n out[2] = (uint8_t)(v >> 16);\n out[3] = (uint8_t)(v >> 24);\n out[4] = (uint8_t)(v >> 32);\n out[5] = (uint8_t)(v >> 40);\n out[6] = (uint8_t)(v >> 48);\n out[7] = (uint8_t)(v >> 56);\n}\n#endif /* BROTLI_LITTLE_ENDIAN */\n\nstatic BROTLI_INLINE void* BROTLI_UNALIGNED_LOAD_PTR(const void* p) {\n void* v;\n memcpy(&v, p, sizeof(void*));\n return v;\n}\n\nstatic BROTLI_INLINE void BROTLI_UNALIGNED_STORE_PTR(void* p, const void* v) {\n memcpy(p, &v, sizeof(void*));\n}\n\n/* BROTLI_IS_CONSTANT macros returns true for compile-time constants. */\n#if BROTLI_GNUC_HAS_BUILTIN(__builtin_constant_p, 3, 0, 1) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0)\n#define BROTLI_IS_CONSTANT(x) (!!__builtin_constant_p(x))\n#else\n#define BROTLI_IS_CONSTANT(x) (!!0)\n#endif\n\n#if defined(BROTLI_TARGET_ARMV7) || defined(BROTLI_TARGET_ARMV8_ANY)\n#define BROTLI_HAS_UBFX (!!1)\n#else\n#define BROTLI_HAS_UBFX (!!0)\n#endif\n\n#if defined(BROTLI_ENABLE_LOG)\n#define BROTLI_LOG(x) printf x\n#else\n#define BROTLI_LOG(x)\n#endif\n\n#if defined(BROTLI_DEBUG) || defined(BROTLI_ENABLE_LOG)\n#define BROTLI_ENABLE_DUMP_DEFAULT 1\n#define BROTLI_DCHECK(x) assert(x)\n#else\n#define BROTLI_ENABLE_DUMP_DEFAULT 0\n#define BROTLI_DCHECK(x)\n#endif\n\n#if !defined(BROTLI_ENABLE_DUMP)\n#define BROTLI_ENABLE_DUMP BROTLI_ENABLE_DUMP_DEFAULT\n#endif\n\n#if BROTLI_ENABLE_DUMP\nstatic BROTLI_INLINE void BrotliDump(const char* f, int l, const char* fn) {\n fprintf(stderr, \"%s:%d (%s)\\n\", f, l, fn);\n fflush(stderr);\n}\n#define BROTLI_DUMP() BrotliDump(__FILE__, __LINE__, __FUNCTION__)\n#else\n#define BROTLI_DUMP() (void)(0)\n#endif\n\n/* BrotliRBit assumes brotli_reg_t fits native CPU register type. */\n#if (BROTLI_64_BITS == BROTLI_TARGET_64_BITS)\n/* TODO(eustas): add appropriate icc/sunpro/arm/ibm/ti checks. */\n#if (BROTLI_GNUC_VERSION_CHECK(3, 0, 0) || defined(__llvm__)) && \\\n !defined(BROTLI_BUILD_NO_RBIT)\n#if defined(BROTLI_TARGET_ARMV7) || defined(BROTLI_TARGET_ARMV8_ANY)\n/* TODO(eustas): detect ARMv6T2 and enable this code for it. */\nstatic BROTLI_INLINE brotli_reg_t BrotliRBit(brotli_reg_t input) {\n brotli_reg_t output;\n __asm__(\"rbit %0, %1\\n\" : \"=r\"(output) : \"r\"(input));\n return output;\n}\n#define BROTLI_RBIT(x) BrotliRBit(x)\n#endif /* armv7 / armv8 */\n#endif /* gcc || clang */\n#endif /* brotli_reg_t is native */\n#if !defined(BROTLI_RBIT)\nstatic BROTLI_INLINE void BrotliRBit(void) { /* Should break build if used. */ }\n#endif /* BROTLI_RBIT */\n\n#define BROTLI_REPEAT_4(X) {X; X; X; X;}\n#define BROTLI_REPEAT_5(X) {X; X; X; X; X;}\n#define BROTLI_REPEAT_6(X) {X; X; X; X; X; X;}\n\n#define BROTLI_UNUSED(X) (void)(X)\n\n#define BROTLI_MIN_MAX(T) \\\n static BROTLI_INLINE T brotli_min_ ## T (T a, T b) { return a < b ? a : b; } \\\n static BROTLI_INLINE T brotli_max_ ## T (T a, T b) { return a > b ? a : b; }\nBROTLI_MIN_MAX(double) BROTLI_MIN_MAX(float) BROTLI_MIN_MAX(int)\nBROTLI_MIN_MAX(size_t) BROTLI_MIN_MAX(uint32_t) BROTLI_MIN_MAX(uint8_t)\n#undef BROTLI_MIN_MAX\n#define BROTLI_MIN(T, A, B) (brotli_min_ ## T((A), (B)))\n#define BROTLI_MAX(T, A, B) (brotli_max_ ## T((A), (B)))\n\n#define BROTLI_SWAP(T, A, I, J) { \\\n T __brotli_swap_tmp = (A)[(I)]; \\\n (A)[(I)] = (A)[(J)]; \\\n (A)[(J)] = __brotli_swap_tmp; \\\n}\n\n#if BROTLI_64_BITS\n#if BROTLI_GNUC_HAS_BUILTIN(__builtin_ctzll, 3, 4, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0)\n#define BROTLI_TZCNT64 __builtin_ctzll\n#elif BROTLI_MSVC_VERSION_CHECK(18, 0, 0)\n#if defined(BROTLI_TARGET_X64) && !defined(_M_ARM64EC)\n#define BROTLI_TZCNT64 _tzcnt_u64\n#else /* BROTLI_TARGET_X64 */\nstatic BROTLI_INLINE uint32_t BrotliBsf64Msvc(uint64_t x) {\n uint32_t lsb;\n _BitScanForward64(&lsb, x);\n return lsb;\n}\n#define BROTLI_TZCNT64 BrotliBsf64Msvc\n#endif /* BROTLI_TARGET_X64 */\n#endif /* __builtin_ctzll */\n#endif /* BROTLI_64_BITS */\n\n#if BROTLI_GNUC_HAS_BUILTIN(__builtin_clz, 3, 4, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0)\n#define BROTLI_BSR32(x) (31u ^ (uint32_t)__builtin_clz(x))\n#elif BROTLI_MSVC_VERSION_CHECK(18, 0, 0)\nstatic BROTLI_INLINE uint32_t BrotliBsr32Msvc(uint32_t x) {\n unsigned long msb;\n _BitScanReverse(&msb, x);\n return (uint32_t)msb;\n}\n#define BROTLI_BSR32 BrotliBsr32Msvc\n#endif /* __builtin_clz */\n\n/* Default brotli_alloc_func */\nBROTLI_COMMON_API void* BrotliDefaultAllocFunc(void* opaque, size_t size);\n\n/* Default brotli_free_func */\nBROTLI_COMMON_API void BrotliDefaultFreeFunc(void* opaque, void* address);\n\n/* Circular logical rotates. */\nstatic BROTLI_INLINE uint16_t BrotliRotateRight16(uint16_t const value,\n size_t count) {\n count &= 0x0F; /* for fickle pattern recognition */\n return (value >> count) | (uint16_t)(value << ((0U - count) & 0x0F));\n}\nstatic BROTLI_INLINE uint32_t BrotliRotateRight32(uint32_t const value,\n size_t count) {\n count &= 0x1F; /* for fickle pattern recognition */\n return (value >> count) | (uint32_t)(value << ((0U - count) & 0x1F));\n}\nstatic BROTLI_INLINE uint64_t BrotliRotateRight64(uint64_t const value,\n size_t count) {\n count &= 0x3F; /* for fickle pattern recognition */\n return (value >> count) | (uint64_t)(value << ((0U - count) & 0x3F));\n}\n\nBROTLI_UNUSED_FUNCTION void BrotliSuppressUnusedFunctions(void) {\n BROTLI_UNUSED(&BrotliSuppressUnusedFunctions);\n BROTLI_UNUSED(&BrotliUnalignedRead16);\n BROTLI_UNUSED(&BrotliUnalignedRead32);\n BROTLI_UNUSED(&BrotliUnalignedRead64);\n BROTLI_UNUSED(&BrotliUnalignedReadSizeT);\n BROTLI_UNUSED(&BrotliUnalignedWrite64);\n BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD16LE);\n BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD32LE);\n BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD64LE);\n BROTLI_UNUSED(&BROTLI_UNALIGNED_STORE64LE);\n BROTLI_UNUSED(&BROTLI_UNALIGNED_LOAD_PTR);\n BROTLI_UNUSED(&BROTLI_UNALIGNED_STORE_PTR);\n BROTLI_UNUSED(&BrotliRBit);\n BROTLI_UNUSED(&brotli_min_double);\n BROTLI_UNUSED(&brotli_max_double);\n BROTLI_UNUSED(&brotli_min_float);\n BROTLI_UNUSED(&brotli_max_float);\n BROTLI_UNUSED(&brotli_min_int);\n BROTLI_UNUSED(&brotli_max_int);\n BROTLI_UNUSED(&brotli_min_size_t);\n BROTLI_UNUSED(&brotli_max_size_t);\n BROTLI_UNUSED(&brotli_min_uint32_t);\n BROTLI_UNUSED(&brotli_max_uint32_t);\n BROTLI_UNUSED(&brotli_min_uint8_t);\n BROTLI_UNUSED(&brotli_max_uint8_t);\n BROTLI_UNUSED(&BrotliDefaultAllocFunc);\n BROTLI_UNUSED(&BrotliDefaultFreeFunc);\n BROTLI_UNUSED(&BrotliRotateRight16);\n BROTLI_UNUSED(&BrotliRotateRight32);\n BROTLI_UNUSED(&BrotliRotateRight64);\n#if BROTLI_ENABLE_DUMP\n BROTLI_UNUSED(&BrotliDump);\n#endif\n\n#if defined(_MSC_VER) && (defined(_M_X64) || defined(_M_I86)) && \\\n !defined(_M_ARM64EC)\n/* _mm_prefetch() is not defined outside of x86/x64 */\n/* https://msdn.microsoft.com/fr-fr/library/84szxsww(v=vs.90).aspx */\n#include \n#define PREFETCH_L1(ptr) _mm_prefetch((const char*)(ptr), _MM_HINT_T0)\n#define PREFETCH_L2(ptr) _mm_prefetch((const char*)(ptr), _MM_HINT_T1)\n#elif BROTLI_GNUC_HAS_BUILTIN(__builtin_prefetch, 3, 1, 0)\n#define PREFETCH_L1(ptr) \\\n __builtin_prefetch((ptr), 0 /* rw==read */, 3 /* locality */)\n#define PREFETCH_L2(ptr) \\\n __builtin_prefetch((ptr), 0 /* rw==read */, 2 /* locality */)\n#elif defined(__aarch64__)\n#define PREFETCH_L1(ptr) \\\n do { \\\n __asm__ __volatile__(\"prfm pldl1keep, %0\" ::\"Q\"(*(ptr))); \\\n } while (0)\n#define PREFETCH_L2(ptr) \\\n do { \\\n __asm__ __volatile__(\"prfm pldl2keep, %0\" ::\"Q\"(*(ptr))); \\\n } while (0)\n#else\n#define PREFETCH_L1(ptr) \\\n do { \\\n (void)(ptr); \\\n } while (0) /* disabled */\n#define PREFETCH_L2(ptr) \\\n do { \\\n (void)(ptr); \\\n } while (0) /* disabled */\n#endif\n\n/* The SIMD matchers are only faster at certain quality levels. */\n#if defined(_M_X64) && defined(BROTLI_TZCNT64)\n#define BROTLI_MAX_SIMD_QUALITY 7\n#elif defined(BROTLI_TZCNT64)\n#define BROTLI_MAX_SIMD_QUALITY 6\n#endif\n}\n\n#if defined(_MSC_VER)\n#define BROTLI_CRASH() __debugbreak(), (void)abort()\n#elif BROTLI_GNUC_HAS_BUILTIN(__builtin_trap, 3, 0, 0)\n#define BROTLI_CRASH() (void)__builtin_trap()\n#else\n#define BROTLI_CRASH() (void)abort()\n#endif\n\n/* Make BROTLI_TEST=0 act same as undefined. */\n#if defined(BROTLI_TEST) && ((1-BROTLI_TEST-1) == 0)\n#undef BROTLI_TEST\n#endif\n\n#if BROTLI_GNUC_HAS_ATTRIBUTE(model, 3, 0, 3)\n#define BROTLI_MODEL(M) __attribute__((model(M)))\n#else\n#define BROTLI_MODEL(M) /* M */\n#endif\n\n#if BROTLI_GNUC_HAS_ATTRIBUTE(cold, 4, 3, 0)\n#define BROTLI_COLD __attribute__((cold))\n#else\n#define BROTLI_COLD /* cold */\n#endif\n\n#endif /* BROTLI_COMMON_PLATFORM_H_ */\n" }, { "path": "libs/brotli/common/shared_dictionary_internal.h", "content": "/* Copyright 2017 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* (Transparent) Shared Dictionary definition. */\n\n#ifndef BROTLI_COMMON_SHARED_DICTIONARY_INTERNAL_H_\n#define BROTLI_COMMON_SHARED_DICTIONARY_INTERNAL_H_\n\n#include \n\n#include \"dictionary.h\"\n#include \"platform.h\"\n#include \"transform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstruct BrotliSharedDictionaryStruct {\n /* LZ77 prefixes (compound dictionary). */\n uint32_t num_prefix; /* max SHARED_BROTLI_MAX_COMPOUND_DICTS */\n size_t prefix_size[SHARED_BROTLI_MAX_COMPOUND_DICTS];\n const uint8_t* prefix[SHARED_BROTLI_MAX_COMPOUND_DICTS];\n\n /* If set, the context map is used to select word and transform list from 64\n contexts, if not set, the context map is not used and only words[0] and\n transforms[0] are to be used. */\n BROTLI_BOOL context_based;\n\n uint8_t context_map[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];\n\n /* Amount of word_list+transform_list combinations. */\n uint8_t num_dictionaries;\n\n /* Must use num_dictionaries values. */\n const BrotliDictionary* words[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];\n\n /* Must use num_dictionaries values. */\n const BrotliTransforms* transforms[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];\n\n /* Amount of custom word lists. May be 0 if only Brotli's built-in is used */\n uint8_t num_word_lists;\n\n /* Contents of the custom words lists. Must be NULL if num_word_lists is 0. */\n BrotliDictionary* words_instances;\n\n /* Amount of custom transform lists. May be 0 if only Brotli's built-in is\n used */\n uint8_t num_transform_lists;\n\n /* Contents of the custom transform lists. Must be NULL if num_transform_lists\n is 0. */\n BrotliTransforms* transforms_instances;\n\n /* Concatenated prefix_suffix_maps of the custom transform lists. Must be NULL\n if num_transform_lists is 0. */\n uint16_t* prefix_suffix_maps;\n\n /* Memory management */\n brotli_alloc_func alloc_func;\n brotli_free_func free_func;\n void* memory_manager_opaque;\n};\n\ntypedef struct BrotliSharedDictionaryStruct BrotliSharedDictionaryInternal;\n#define BrotliSharedDictionary BrotliSharedDictionaryInternal\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_COMMON_SHARED_DICTIONARY_INTERNAL_H_ */\n" }, { "path": "libs/brotli/common/static_init.h", "content": "/* Copyright 2025 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/*\n Central point for static initialization.\n\n In case of \"lazy\" mode `BrotliXxxLazyStaticInit` is not provided by the\n library. Embedder is responsible for providing it. This function should call\n `BrotliXxxLazyStaticInitInner` on the first invocation. This function should\n not return until execution of `BrotliXxxLazyStaticInitInner` is finished.\n In C or before C++11 it is possible to call `BrotliXxxLazyStaticInitInner`\n on start-up path and then `BrotliEncoderLazyStaticInit` is could be no-op;\n another option is to use available thread execution controls to meet the\n requirements. For possible C++11 implementation see static_init_lazy.cc.\n*/\n\n#ifndef THIRD_PARTY_BROTLI_COMMON_STATIC_INIT_H_\n#define THIRD_PARTY_BROTLI_COMMON_STATIC_INIT_H_\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* Static data is \"initialized\" in compile time. */\n#define BROTLI_STATIC_INIT_NONE 0\n/* Static data is initialized before \"main\". */\n#define BROTLI_STATIC_INIT_EARLY 1\n/* Static data is initialized when first encoder is created. */\n#define BROTLI_STATIC_INIT_LAZY 2\n\n#define BROTLI_STATIC_INIT_DEFAULT BROTLI_STATIC_INIT_NONE\n\n#if !defined(BROTLI_STATIC_INIT)\n#define BROTLI_STATIC_INIT BROTLI_STATIC_INIT_DEFAULT\n#endif\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE) && \\\n (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_EARLY) && \\\n (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_LAZY)\n#error Invalid value for BROTLI_STATIC_INIT\n#endif\n\n#if (BROTLI_STATIC_INIT == BROTLI_STATIC_INIT_EARLY)\n#if defined(BROTLI_EXTERNAL_DICTIONARY_DATA)\n#error BROTLI_STATIC_INIT_EARLY will fail with BROTLI_EXTERNAL_DICTIONARY_DATA\n#endif\n#endif /* BROTLI_STATIC_INIT */\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif // THIRD_PARTY_BROTLI_COMMON_STATIC_INIT_H_\n" }, { "path": "libs/brotli/common/transform.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"platform.h\"\n#include \"transform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* RFC 7932 transforms string data */\nstatic const BROTLI_MODEL(\"small\") char kPrefixSuffix[217] =\n \"\\1 \\2, \\10 of the \\4 of \\2s \\1.\\5 and \\4 \"\n/* 0x _0 _2 __5 _E _3 _6 _8 _E */\n \"in \\1\\\"\\4 to \\2\\\">\\1\\n\\2. \\1]\\5 for \\3 a \\6 \"\n/* 2x _3_ _5 _A_ _D_ _F _2 _4 _A _E */\n \"that \\1\\'\\6 with \\6 from \\4 by \\1(\\6. T\"\n/* 4x _5_ _7 _E _5 _A _C */\n \"he \\4 on \\4 as \\4 is \\4ing \\2\\n\\t\\1:\\3ed \"\n/* 6x _3 _8 _D _2 _7_ _ _A _C */\n \"\\2=\\\"\\4 at \\3ly \\1,\\2=\\'\\5.com/\\7. This \\5\"\n/* 8x _0 _ _3 _8 _C _E _ _1 _7 _F */\n \" not \\3er \\3al \\4ful \\4ive \\5less \\4es\"\n/* Ax _5 _9 _D _2 _7 _D */\n \"t \\4ize \\2\\xc2\\xa0\\4ous \\5 the \\2e \"; /* \\0 - implicit trailing zero. */\n/* Cx _2 _7___ ___ _A _F _5 _8 */\n\nstatic const BROTLI_MODEL(\"small\") uint16_t kPrefixSuffixMap[50] = {\n 0x00, 0x02, 0x05, 0x0E, 0x13, 0x16, 0x18, 0x1E, 0x23, 0x25,\n 0x2A, 0x2D, 0x2F, 0x32, 0x34, 0x3A, 0x3E, 0x45, 0x47, 0x4E,\n 0x55, 0x5A, 0x5C, 0x63, 0x68, 0x6D, 0x72, 0x77, 0x7A, 0x7C,\n 0x80, 0x83, 0x88, 0x8C, 0x8E, 0x91, 0x97, 0x9F, 0xA5, 0xA9,\n 0xAD, 0xB2, 0xB7, 0xBD, 0xC2, 0xC7, 0xCA, 0xCF, 0xD5, 0xD8\n};\n\n/* RFC 7932 transforms */\nstatic const BROTLI_MODEL(\"small\") uint8_t kTransformsData[] = {\n 49, BROTLI_TRANSFORM_IDENTITY, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 0,\n 0, BROTLI_TRANSFORM_IDENTITY, 0,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_1, 49,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 0,\n 49, BROTLI_TRANSFORM_IDENTITY, 47,\n 0, BROTLI_TRANSFORM_IDENTITY, 49,\n 4, BROTLI_TRANSFORM_IDENTITY, 0,\n 49, BROTLI_TRANSFORM_IDENTITY, 3,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 6,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_2, 49,\n 49, BROTLI_TRANSFORM_OMIT_LAST_1, 49,\n 1, BROTLI_TRANSFORM_IDENTITY, 0,\n 49, BROTLI_TRANSFORM_IDENTITY, 1,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 0,\n 49, BROTLI_TRANSFORM_IDENTITY, 7,\n 49, BROTLI_TRANSFORM_IDENTITY, 9,\n 48, BROTLI_TRANSFORM_IDENTITY, 0,\n 49, BROTLI_TRANSFORM_IDENTITY, 8,\n 49, BROTLI_TRANSFORM_IDENTITY, 5,\n 49, BROTLI_TRANSFORM_IDENTITY, 10,\n 49, BROTLI_TRANSFORM_IDENTITY, 11,\n 49, BROTLI_TRANSFORM_OMIT_LAST_3, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 13,\n 49, BROTLI_TRANSFORM_IDENTITY, 14,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_3, 49,\n 49, BROTLI_TRANSFORM_OMIT_LAST_2, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 15,\n 49, BROTLI_TRANSFORM_IDENTITY, 16,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 12,\n 5, BROTLI_TRANSFORM_IDENTITY, 49,\n 0, BROTLI_TRANSFORM_IDENTITY, 1,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_4, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 18,\n 49, BROTLI_TRANSFORM_IDENTITY, 17,\n 49, BROTLI_TRANSFORM_IDENTITY, 19,\n 49, BROTLI_TRANSFORM_IDENTITY, 20,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_5, 49,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_6, 49,\n 47, BROTLI_TRANSFORM_IDENTITY, 49,\n 49, BROTLI_TRANSFORM_OMIT_LAST_4, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 22,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 23,\n 49, BROTLI_TRANSFORM_IDENTITY, 24,\n 49, BROTLI_TRANSFORM_IDENTITY, 25,\n 49, BROTLI_TRANSFORM_OMIT_LAST_7, 49,\n 49, BROTLI_TRANSFORM_OMIT_LAST_1, 26,\n 49, BROTLI_TRANSFORM_IDENTITY, 27,\n 49, BROTLI_TRANSFORM_IDENTITY, 28,\n 0, BROTLI_TRANSFORM_IDENTITY, 12,\n 49, BROTLI_TRANSFORM_IDENTITY, 29,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_9, 49,\n 49, BROTLI_TRANSFORM_OMIT_FIRST_7, 49,\n 49, BROTLI_TRANSFORM_OMIT_LAST_6, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 21,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 1,\n 49, BROTLI_TRANSFORM_OMIT_LAST_8, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 31,\n 49, BROTLI_TRANSFORM_IDENTITY, 32,\n 47, BROTLI_TRANSFORM_IDENTITY, 3,\n 49, BROTLI_TRANSFORM_OMIT_LAST_5, 49,\n 49, BROTLI_TRANSFORM_OMIT_LAST_9, 49,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 1,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 8,\n 5, BROTLI_TRANSFORM_IDENTITY, 21,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 0,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 10,\n 49, BROTLI_TRANSFORM_IDENTITY, 30,\n 0, BROTLI_TRANSFORM_IDENTITY, 5,\n 35, BROTLI_TRANSFORM_IDENTITY, 49,\n 47, BROTLI_TRANSFORM_IDENTITY, 2,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 17,\n 49, BROTLI_TRANSFORM_IDENTITY, 36,\n 49, BROTLI_TRANSFORM_IDENTITY, 33,\n 5, BROTLI_TRANSFORM_IDENTITY, 0,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 21,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 5,\n 49, BROTLI_TRANSFORM_IDENTITY, 37,\n 0, BROTLI_TRANSFORM_IDENTITY, 30,\n 49, BROTLI_TRANSFORM_IDENTITY, 38,\n 0, BROTLI_TRANSFORM_UPPERCASE_ALL, 0,\n 49, BROTLI_TRANSFORM_IDENTITY, 39,\n 0, BROTLI_TRANSFORM_UPPERCASE_ALL, 49,\n 49, BROTLI_TRANSFORM_IDENTITY, 34,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 8,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 12,\n 0, BROTLI_TRANSFORM_IDENTITY, 21,\n 49, BROTLI_TRANSFORM_IDENTITY, 40,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 12,\n 49, BROTLI_TRANSFORM_IDENTITY, 41,\n 49, BROTLI_TRANSFORM_IDENTITY, 42,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 17,\n 49, BROTLI_TRANSFORM_IDENTITY, 43,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 5,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 10,\n 0, BROTLI_TRANSFORM_IDENTITY, 34,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 33,\n 49, BROTLI_TRANSFORM_IDENTITY, 44,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 5,\n 45, BROTLI_TRANSFORM_IDENTITY, 49,\n 0, BROTLI_TRANSFORM_IDENTITY, 33,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 30,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 30,\n 49, BROTLI_TRANSFORM_IDENTITY, 46,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 1,\n 49, BROTLI_TRANSFORM_UPPERCASE_FIRST, 34,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 33,\n 0, BROTLI_TRANSFORM_UPPERCASE_ALL, 30,\n 0, BROTLI_TRANSFORM_UPPERCASE_ALL, 1,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 33,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 21,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 12,\n 0, BROTLI_TRANSFORM_UPPERCASE_ALL, 5,\n 49, BROTLI_TRANSFORM_UPPERCASE_ALL, 34,\n 0, BROTLI_TRANSFORM_UPPERCASE_ALL, 12,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 30,\n 0, BROTLI_TRANSFORM_UPPERCASE_ALL, 34,\n 0, BROTLI_TRANSFORM_UPPERCASE_FIRST, 34,\n};\n\nstatic const BROTLI_MODEL(\"small\")\nBrotliTransforms kBrotliTransforms = {\n sizeof(kPrefixSuffix),\n (const uint8_t*)kPrefixSuffix,\n kPrefixSuffixMap,\n sizeof(kTransformsData) / (3 * sizeof(kTransformsData[0])),\n kTransformsData,\n NULL, /* no extra parameters */\n {0, 12, 27, 23, 42, 63, 56, 48, 59, 64}\n};\n\nconst BrotliTransforms* BrotliGetTransforms(void) {\n return &kBrotliTransforms;\n}\n\nstatic int ToUpperCase(uint8_t* p) {\n if (p[0] < 0xC0) {\n if (p[0] >= 'a' && p[0] <= 'z') {\n p[0] ^= 32;\n }\n return 1;\n }\n /* An overly simplified uppercasing model for UTF-8. */\n if (p[0] < 0xE0) {\n p[1] ^= 32;\n return 2;\n }\n /* An arbitrary transform for three byte characters. */\n p[2] ^= 5;\n return 3;\n}\n\nstatic int Shift(uint8_t* word, int word_len, uint16_t parameter) {\n /* Limited sign extension: scalar < (1 << 24). */\n uint32_t scalar =\n (parameter & 0x7FFFu) + (0x1000000u - (parameter & 0x8000u));\n if (word[0] < 0x80) {\n /* 1-byte rune / 0sssssss / 7 bit scalar (ASCII). */\n scalar += (uint32_t)word[0];\n word[0] = (uint8_t)(scalar & 0x7Fu);\n return 1;\n } else if (word[0] < 0xC0) {\n /* Continuation / 10AAAAAA. */\n return 1;\n } else if (word[0] < 0xE0) {\n /* 2-byte rune / 110sssss AAssssss / 11 bit scalar. */\n if (word_len < 2) return 1;\n scalar += (uint32_t)((word[1] & 0x3Fu) | ((word[0] & 0x1Fu) << 6u));\n word[0] = (uint8_t)(0xC0 | ((scalar >> 6u) & 0x1F));\n word[1] = (uint8_t)((word[1] & 0xC0) | (scalar & 0x3F));\n return 2;\n } else if (word[0] < 0xF0) {\n /* 3-byte rune / 1110ssss AAssssss BBssssss / 16 bit scalar. */\n if (word_len < 3) return word_len;\n scalar += (uint32_t)((word[2] & 0x3Fu) | ((word[1] & 0x3Fu) << 6u) |\n ((word[0] & 0x0Fu) << 12u));\n word[0] = (uint8_t)(0xE0 | ((scalar >> 12u) & 0x0F));\n word[1] = (uint8_t)((word[1] & 0xC0) | ((scalar >> 6u) & 0x3F));\n word[2] = (uint8_t)((word[2] & 0xC0) | (scalar & 0x3F));\n return 3;\n } else if (word[0] < 0xF8) {\n /* 4-byte rune / 11110sss AAssssss BBssssss CCssssss / 21 bit scalar. */\n if (word_len < 4) return word_len;\n scalar += (uint32_t)((word[3] & 0x3Fu) | ((word[2] & 0x3Fu) << 6u) |\n ((word[1] & 0x3Fu) << 12u) | ((word[0] & 0x07u) << 18u));\n word[0] = (uint8_t)(0xF0 | ((scalar >> 18u) & 0x07));\n word[1] = (uint8_t)((word[1] & 0xC0) | ((scalar >> 12u) & 0x3F));\n word[2] = (uint8_t)((word[2] & 0xC0) | ((scalar >> 6u) & 0x3F));\n word[3] = (uint8_t)((word[3] & 0xC0) | (scalar & 0x3F));\n return 4;\n }\n return 1;\n}\n\nint BrotliTransformDictionaryWord(uint8_t* dst, const uint8_t* word, int len,\n const BrotliTransforms* transforms, int transform_idx) {\n int idx = 0;\n const uint8_t* prefix = BROTLI_TRANSFORM_PREFIX(transforms, transform_idx);\n uint8_t type = BROTLI_TRANSFORM_TYPE(transforms, transform_idx);\n const uint8_t* suffix = BROTLI_TRANSFORM_SUFFIX(transforms, transform_idx);\n {\n int prefix_len = *prefix++;\n while (prefix_len--) { dst[idx++] = *prefix++; }\n }\n {\n const int t = type;\n int i = 0;\n if (t <= BROTLI_TRANSFORM_OMIT_LAST_9) {\n len -= t;\n } else if (t >= BROTLI_TRANSFORM_OMIT_FIRST_1\n && t <= BROTLI_TRANSFORM_OMIT_FIRST_9) {\n int skip = t - (BROTLI_TRANSFORM_OMIT_FIRST_1 - 1);\n word += skip;\n len -= skip;\n }\n while (i < len) { dst[idx++] = word[i++]; }\n if (t == BROTLI_TRANSFORM_UPPERCASE_FIRST) {\n ToUpperCase(&dst[idx - len]);\n } else if (t == BROTLI_TRANSFORM_UPPERCASE_ALL) {\n uint8_t* uppercase = &dst[idx - len];\n while (len > 0) {\n int step = ToUpperCase(uppercase);\n uppercase += step;\n len -= step;\n }\n } else if (t == BROTLI_TRANSFORM_SHIFT_FIRST) {\n uint16_t param = (uint16_t)(transforms->params[transform_idx * 2]\n + (transforms->params[transform_idx * 2 + 1] << 8u));\n Shift(&dst[idx - len], len, param);\n } else if (t == BROTLI_TRANSFORM_SHIFT_ALL) {\n uint16_t param = (uint16_t)(transforms->params[transform_idx * 2]\n + (transforms->params[transform_idx * 2 + 1] << 8u));\n uint8_t* shift = &dst[idx - len];\n while (len > 0) {\n int step = Shift(shift, len, param);\n shift += step;\n len -= step;\n }\n }\n }\n {\n int suffix_len = *suffix++;\n while (suffix_len--) { dst[idx++] = *suffix++; }\n return idx;\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/common/transform.h", "content": "/* transforms is a part of ABI, but not API.\n\n It means that there are some functions that are supposed to be in \"common\"\n library, but header itself is not placed into include/brotli. This way,\n aforementioned functions will be available only to brotli internals.\n */\n\n#ifndef BROTLI_COMMON_TRANSFORM_H_\n#define BROTLI_COMMON_TRANSFORM_H_\n\n#include \"platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nenum BrotliWordTransformType {\n BROTLI_TRANSFORM_IDENTITY = 0,\n BROTLI_TRANSFORM_OMIT_LAST_1 = 1,\n BROTLI_TRANSFORM_OMIT_LAST_2 = 2,\n BROTLI_TRANSFORM_OMIT_LAST_3 = 3,\n BROTLI_TRANSFORM_OMIT_LAST_4 = 4,\n BROTLI_TRANSFORM_OMIT_LAST_5 = 5,\n BROTLI_TRANSFORM_OMIT_LAST_6 = 6,\n BROTLI_TRANSFORM_OMIT_LAST_7 = 7,\n BROTLI_TRANSFORM_OMIT_LAST_8 = 8,\n BROTLI_TRANSFORM_OMIT_LAST_9 = 9,\n BROTLI_TRANSFORM_UPPERCASE_FIRST = 10,\n BROTLI_TRANSFORM_UPPERCASE_ALL = 11,\n BROTLI_TRANSFORM_OMIT_FIRST_1 = 12,\n BROTLI_TRANSFORM_OMIT_FIRST_2 = 13,\n BROTLI_TRANSFORM_OMIT_FIRST_3 = 14,\n BROTLI_TRANSFORM_OMIT_FIRST_4 = 15,\n BROTLI_TRANSFORM_OMIT_FIRST_5 = 16,\n BROTLI_TRANSFORM_OMIT_FIRST_6 = 17,\n BROTLI_TRANSFORM_OMIT_FIRST_7 = 18,\n BROTLI_TRANSFORM_OMIT_FIRST_8 = 19,\n BROTLI_TRANSFORM_OMIT_FIRST_9 = 20,\n BROTLI_TRANSFORM_SHIFT_FIRST = 21,\n BROTLI_TRANSFORM_SHIFT_ALL = 22,\n BROTLI_NUM_TRANSFORM_TYPES /* Counts transforms, not a transform itself. */\n};\n\n#define BROTLI_TRANSFORMS_MAX_CUT_OFF BROTLI_TRANSFORM_OMIT_LAST_9\n\ntypedef struct BrotliTransforms {\n uint16_t prefix_suffix_size;\n /* Last character must be null, so prefix_suffix_size must be at least 1. */\n const uint8_t* prefix_suffix;\n const uint16_t* prefix_suffix_map;\n uint32_t num_transforms;\n /* Each entry is a [prefix_id, transform, suffix_id] triplet. */\n const uint8_t* transforms;\n /* Shift for BROTLI_TRANSFORM_SHIFT_FIRST and BROTLI_TRANSFORM_SHIFT_ALL,\n must be NULL if and only if no such transforms are present. */\n const uint8_t* params;\n /* Indices of transforms like [\"\", BROTLI_TRANSFORM_OMIT_LAST_#, \"\"].\n 0-th element corresponds to [\"\", BROTLI_TRANSFORM_IDENTITY, \"\"].\n -1, if cut-off transform does not exist. */\n int16_t cutOffTransforms[BROTLI_TRANSFORMS_MAX_CUT_OFF + 1];\n} BrotliTransforms;\n\n/* T is BrotliTransforms*; result is uint8_t. */\n#define BROTLI_TRANSFORM_PREFIX_ID(T, I) ((T)->transforms[((I) * 3) + 0])\n#define BROTLI_TRANSFORM_TYPE(T, I) ((T)->transforms[((I) * 3) + 1])\n#define BROTLI_TRANSFORM_SUFFIX_ID(T, I) ((T)->transforms[((I) * 3) + 2])\n\n/* T is BrotliTransforms*; result is const uint8_t*. */\n#define BROTLI_TRANSFORM_PREFIX(T, I) (&(T)->prefix_suffix[ \\\n (T)->prefix_suffix_map[BROTLI_TRANSFORM_PREFIX_ID(T, I)]])\n#define BROTLI_TRANSFORM_SUFFIX(T, I) (&(T)->prefix_suffix[ \\\n (T)->prefix_suffix_map[BROTLI_TRANSFORM_SUFFIX_ID(T, I)]])\n\nBROTLI_COMMON_API const BrotliTransforms* BrotliGetTransforms(void);\n\nBROTLI_COMMON_API int BrotliTransformDictionaryWord(\n uint8_t* dst, const uint8_t* word, int len,\n const BrotliTransforms* transforms, int transform_idx);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_COMMON_TRANSFORM_H_ */\n" }, { "path": "libs/brotli/common/version.h", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Version definition. */\n\n#ifndef BROTLI_COMMON_VERSION_H_\n#define BROTLI_COMMON_VERSION_H_\n\n/* Compose 3 components into a single number. In a hexadecimal representation\n B and C components occupy exactly 3 digits. */\n#define BROTLI_MAKE_HEX_VERSION(A, B, C) ((A << 24) | (B << 12) | C)\n\n/* Those macros should only be used when library is compiled together with\n the client. If library is dynamically linked, use BrotliDecoderVersion and\n BrotliEncoderVersion methods. */\n\n#define BROTLI_VERSION_MAJOR 1\n#define BROTLI_VERSION_MINOR 2\n#define BROTLI_VERSION_PATCH 0\n\n#define BROTLI_VERSION BROTLI_MAKE_HEX_VERSION( \\\n BROTLI_VERSION_MAJOR, BROTLI_VERSION_MINOR, BROTLI_VERSION_PATCH)\n\n/* This macro is used by build system to produce Libtool-friendly soname. See\n https://www.gnu.org/software/libtool/manual/html_node/Libtool-versioning.html\n Version evolution rules:\n - interfaces added (or change is compatible) -> current+1:0:age+1\n - interfaces removed (or changed is incompatible) -> current+1:0:0\n - interfaces not changed -> current:revision+1:age\n */\n\n#define BROTLI_ABI_CURRENT 3\n#define BROTLI_ABI_REVISION 0\n#define BROTLI_ABI_AGE 2\n\n#if BROTLI_VERSION_MAJOR != (BROTLI_ABI_CURRENT - BROTLI_ABI_AGE)\n#error ABI/API version inconsistency\n#endif\n\n#if BROTLI_VERSION_MINOR != BROTLI_ABI_AGE\n#error ABI/API version inconsistency\n#endif\n\n#if BROTLI_VERSION_PATCH != BROTLI_ABI_REVISION\n#error ABI/API version inconsistency\n#endif\n\n#endif /* BROTLI_COMMON_VERSION_H_ */\n" }, { "path": "libs/brotli/enc/backward_references.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function to find backward reference copies. */\n\n#include \"backward_references.h\"\n\n#include \"../common/constants.h\"\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"command.h\"\n#include \"compound_dictionary.h\"\n#include \"encoder_dict.h\"\n#include \"hash.h\"\n#include \"params.h\"\n#include \"quality.h\" /* IWYU pragma: keep for inc */\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic BROTLI_INLINE size_t ComputeDistanceCode(size_t distance,\n size_t max_distance,\n const int* dist_cache) {\n if (distance <= max_distance) {\n size_t distance_plus_3 = distance + 3;\n size_t offset0 = distance_plus_3 - (size_t)dist_cache[0];\n size_t offset1 = distance_plus_3 - (size_t)dist_cache[1];\n if (distance == (size_t)dist_cache[0]) {\n return 0;\n } else if (distance == (size_t)dist_cache[1]) {\n return 1;\n } else if (offset0 < 7) {\n return (0x9750468 >> (4 * offset0)) & 0xF;\n } else if (offset1 < 7) {\n return (0xFDB1ACE >> (4 * offset1)) & 0xF;\n } else if (distance == (size_t)dist_cache[2]) {\n return 2;\n } else if (distance == (size_t)dist_cache[3]) {\n return 3;\n }\n }\n return distance + BROTLI_NUM_DISTANCE_SHORT_CODES - 1;\n}\n\n#define EXPAND_CAT(a, b) CAT(a, b)\n#define CAT(a, b) a ## b\n#define FN(X) EXPAND_CAT(X, HASHER())\n#define EXPORT_FN(X) EXPAND_CAT(X, EXPAND_CAT(PREFIX(), HASHER()))\n\n#define PREFIX() N\n#define ENABLE_COMPOUND_DICTIONARY 0\n\n#define HASHER() H2\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H3\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H4\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H5\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H6\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H40\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H41\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H42\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H54\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H35\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H55\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H65\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#if defined(BROTLI_MAX_SIMD_QUALITY)\n#define HASHER() H58\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n\n#define HASHER() H68\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#endif\n\n#undef ENABLE_COMPOUND_DICTIONARY\n#undef PREFIX\n#define PREFIX() D\n#define ENABLE_COMPOUND_DICTIONARY 1\n\n#define HASHER() H5\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#define HASHER() H6\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#define HASHER() H40\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#define HASHER() H41\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#define HASHER() H42\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#define HASHER() H55\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#define HASHER() H65\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#if defined(BROTLI_MAX_SIMD_QUALITY)\n#define HASHER() H58\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#define HASHER() H68\n/* NOLINTNEXTLINE(build/include) */\n#include \"backward_references_inc.h\"\n#undef HASHER\n#endif\n\n#undef ENABLE_COMPOUND_DICTIONARY\n#undef PREFIX\n\n#undef EXPORT_FN\n#undef FN\n#undef CAT\n#undef EXPAND_CAT\n\nvoid BrotliCreateBackwardReferences(size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n Hasher* hasher, int* dist_cache, size_t* last_insert_len,\n Command* commands, size_t* num_commands, size_t* num_literals) {\n if (params->dictionary.compound.num_chunks != 0) {\n switch (params->hasher.type) {\n#define CASE_(N) \\\n case N: \\\n CreateBackwardReferencesDH ## N(num_bytes, \\\n position, ringbuffer, ringbuffer_mask, \\\n literal_context_lut, params, hasher, dist_cache, \\\n last_insert_len, commands, num_commands, num_literals); \\\n return;\n CASE_(5)\n CASE_(6)\n#if defined(BROTLI_MAX_SIMD_QUALITY)\n CASE_(58)\n CASE_(68)\n#endif\n CASE_(40)\n CASE_(41)\n CASE_(42)\n CASE_(55)\n CASE_(65)\n#undef CASE_\n default:\n BROTLI_DCHECK(BROTLI_FALSE);\n break;\n }\n }\n\n switch (params->hasher.type) {\n#define CASE_(N) \\\n case N: \\\n CreateBackwardReferencesNH ## N(num_bytes, \\\n position, ringbuffer, ringbuffer_mask, \\\n literal_context_lut, params, hasher, dist_cache, \\\n last_insert_len, commands, num_commands, num_literals); \\\n return;\n FOR_GENERIC_HASHERS(CASE_)\n#undef CASE_\n default:\n BROTLI_DCHECK(BROTLI_FALSE);\n break;\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/backward_references.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function to find backward reference copies. */\n\n#ifndef BROTLI_ENC_BACKWARD_REFERENCES_H_\n#define BROTLI_ENC_BACKWARD_REFERENCES_H_\n\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"command.h\"\n#include \"hash.h\"\n#include \"params.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* \"commands\" points to the next output command to write to, \"*num_commands\" is\n initially the total amount of commands output by previous\n CreateBackwardReferences calls, and must be incremented by the amount written\n by this call. */\nBROTLI_INTERNAL void BrotliCreateBackwardReferences(size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n Hasher* hasher, int* dist_cache, size_t* last_insert_len,\n Command* commands, size_t* num_commands, size_t* num_literals);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_BACKWARD_REFERENCES_H_ */\n" }, { "path": "libs/brotli/enc/backward_references_hq.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function to find backward reference copies. */\n\n#include \"backward_references_hq.h\"\n\n#include \"../common/constants.h\"\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"command.h\"\n#include \"compound_dictionary.h\"\n#include \"encoder_dict.h\"\n#include \"fast_log.h\"\n#include \"find_match_length.h\"\n#include \"hash.h\"\n#include \"literal_cost.h\"\n#include \"memory.h\"\n#include \"params.h\"\n#include \"prefix.h\"\n#include \"quality.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* BrotliCalculateDistanceCodeLimit(BROTLI_MAX_ALLOWED_DISTANCE, 3, 120). */\n#define BROTLI_MAX_EFFECTIVE_DISTANCE_ALPHABET_SIZE 544\n\nstatic const float kInfinity = 1.7e38f; /* ~= 2 ^ 127 */\n\nstatic const BROTLI_MODEL(\"small\") uint32_t kDistanceCacheIndex[] = {\n 0, 1, 2, 3, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1,\n};\nstatic const BROTLI_MODEL(\"small\") int kDistanceCacheOffset[] = {\n 0, 0, 0, 0, -1, 1, -2, 2, -3, 3, -1, 1, -2, 2, -3, 3\n};\n\nvoid BrotliInitZopfliNodes(ZopfliNode* array, size_t length) {\n ZopfliNode stub;\n size_t i;\n stub.length = 1;\n stub.distance = 0;\n stub.dcode_insert_length = 0;\n stub.u.cost = kInfinity;\n for (i = 0; i < length; ++i) array[i] = stub;\n}\n\nstatic BROTLI_INLINE uint32_t ZopfliNodeCopyLength(const ZopfliNode* self) {\n return self->length & 0x1FFFFFF;\n}\n\nstatic BROTLI_INLINE uint32_t ZopfliNodeLengthCode(const ZopfliNode* self) {\n const uint32_t modifier = self->length >> 25;\n return ZopfliNodeCopyLength(self) + 9u - modifier;\n}\n\nstatic BROTLI_INLINE uint32_t ZopfliNodeCopyDistance(const ZopfliNode* self) {\n return self->distance;\n}\n\nstatic BROTLI_INLINE uint32_t ZopfliNodeDistanceCode(const ZopfliNode* self) {\n const uint32_t short_code = self->dcode_insert_length >> 27;\n return short_code == 0 ?\n ZopfliNodeCopyDistance(self) + BROTLI_NUM_DISTANCE_SHORT_CODES - 1 :\n short_code - 1;\n}\n\nstatic BROTLI_INLINE uint32_t ZopfliNodeCommandLength(const ZopfliNode* self) {\n return ZopfliNodeCopyLength(self) + (self->dcode_insert_length & 0x7FFFFFF);\n}\n\n/* Temporary data for ZopfliCostModelSetFromCommands. */\ntypedef struct ZopfliCostModelArena {\n uint32_t histogram_literal[BROTLI_NUM_LITERAL_SYMBOLS];\n uint32_t histogram_cmd[BROTLI_NUM_COMMAND_SYMBOLS];\n uint32_t histogram_dist[BROTLI_MAX_EFFECTIVE_DISTANCE_ALPHABET_SIZE];\n float cost_literal[BROTLI_NUM_LITERAL_SYMBOLS];\n} ZopfliCostModelArena;\n\n/* Histogram based cost model for zopflification. */\ntypedef struct ZopfliCostModel {\n /* The insert and copy length symbols. */\n float cost_cmd_[BROTLI_NUM_COMMAND_SYMBOLS];\n float* cost_dist_;\n uint32_t distance_histogram_size;\n /* Cumulative costs of literals per position in the stream. */\n float* literal_costs_;\n float min_cost_cmd_;\n size_t num_bytes_;\n\n /* Temporary data. */\n union {\n size_t literal_histograms[3 * 256];\n ZopfliCostModelArena arena;\n };\n} ZopfliCostModel;\n\nstatic void InitZopfliCostModel(\n MemoryManager* m, ZopfliCostModel* self, const BrotliDistanceParams* dist,\n size_t num_bytes) {\n self->num_bytes_ = num_bytes;\n self->literal_costs_ = BROTLI_ALLOC(m, float, num_bytes + 2);\n self->cost_dist_ = BROTLI_ALLOC(m, float, dist->alphabet_size_limit);\n self->distance_histogram_size = dist->alphabet_size_limit;\n if (BROTLI_IS_OOM(m)) return;\n}\n\nstatic void CleanupZopfliCostModel(MemoryManager* m, ZopfliCostModel* self) {\n BROTLI_FREE(m, self->literal_costs_);\n BROTLI_FREE(m, self->cost_dist_);\n}\n\nstatic void SetCost(const uint32_t* histogram, size_t histogram_size,\n BROTLI_BOOL literal_histogram, float* cost) {\n size_t sum = 0;\n size_t missing_symbol_sum;\n float log2sum;\n float missing_symbol_cost;\n size_t i;\n for (i = 0; i < histogram_size; i++) {\n sum += histogram[i];\n }\n log2sum = (float)FastLog2(sum);\n missing_symbol_sum = sum;\n if (!literal_histogram) {\n for (i = 0; i < histogram_size; i++) {\n if (histogram[i] == 0) missing_symbol_sum++;\n }\n }\n missing_symbol_cost = (float)FastLog2(missing_symbol_sum) + 2;\n for (i = 0; i < histogram_size; i++) {\n if (histogram[i] == 0) {\n cost[i] = missing_symbol_cost;\n continue;\n }\n\n /* Shannon bits for this symbol. */\n cost[i] = log2sum - (float)FastLog2(histogram[i]);\n\n /* Cannot be coded with less than 1 bit */\n if (cost[i] < 1) cost[i] = 1;\n }\n}\n\nstatic void ZopfliCostModelSetFromCommands(ZopfliCostModel* self,\n size_t position,\n const uint8_t* ringbuffer,\n size_t ringbuffer_mask,\n const Command* commands,\n size_t num_commands,\n size_t last_insert_len) {\n ZopfliCostModelArena* arena = &self->arena;\n size_t pos = position - last_insert_len;\n float min_cost_cmd = kInfinity;\n size_t i;\n float* cost_cmd = self->cost_cmd_;\n\n memset(arena->histogram_literal, 0, sizeof(arena->histogram_literal));\n memset(arena->histogram_cmd, 0, sizeof(arena->histogram_cmd));\n memset(arena->histogram_dist, 0, sizeof(arena->histogram_dist));\n\n for (i = 0; i < num_commands; i++) {\n size_t inslength = commands[i].insert_len_;\n size_t copylength = CommandCopyLen(&commands[i]);\n size_t distcode = commands[i].dist_prefix_ & 0x3FF;\n size_t cmdcode = commands[i].cmd_prefix_;\n size_t j;\n\n arena->histogram_cmd[cmdcode]++;\n if (cmdcode >= 128) arena->histogram_dist[distcode]++;\n\n for (j = 0; j < inslength; j++) {\n arena->histogram_literal[ringbuffer[(pos + j) & ringbuffer_mask]]++;\n }\n\n pos += inslength + copylength;\n }\n\n SetCost(arena->histogram_literal, BROTLI_NUM_LITERAL_SYMBOLS, BROTLI_TRUE,\n arena->cost_literal);\n SetCost(arena->histogram_cmd, BROTLI_NUM_COMMAND_SYMBOLS, BROTLI_FALSE,\n cost_cmd);\n SetCost(arena->histogram_dist, self->distance_histogram_size, BROTLI_FALSE,\n self->cost_dist_);\n\n for (i = 0; i < BROTLI_NUM_COMMAND_SYMBOLS; ++i) {\n min_cost_cmd = BROTLI_MIN(float, min_cost_cmd, cost_cmd[i]);\n }\n self->min_cost_cmd_ = min_cost_cmd;\n\n {\n float* literal_costs = self->literal_costs_;\n float literal_carry = 0.0;\n size_t num_bytes = self->num_bytes_;\n literal_costs[0] = 0.0;\n for (i = 0; i < num_bytes; ++i) {\n literal_carry +=\n arena->cost_literal[ringbuffer[(position + i) & ringbuffer_mask]];\n literal_costs[i + 1] = literal_costs[i] + literal_carry;\n literal_carry -= literal_costs[i + 1] - literal_costs[i];\n }\n }\n}\n\nstatic void ZopfliCostModelSetFromLiteralCosts(ZopfliCostModel* self,\n size_t position,\n const uint8_t* ringbuffer,\n size_t ringbuffer_mask) {\n float* literal_costs = self->literal_costs_;\n float literal_carry = 0.0;\n float* cost_dist = self->cost_dist_;\n float* cost_cmd = self->cost_cmd_;\n size_t num_bytes = self->num_bytes_;\n size_t i;\n BrotliEstimateBitCostsForLiterals(position, num_bytes, ringbuffer_mask,\n ringbuffer, self->literal_histograms,\n &literal_costs[1]);\n literal_costs[0] = 0.0;\n for (i = 0; i < num_bytes; ++i) {\n literal_carry += literal_costs[i + 1];\n literal_costs[i + 1] = literal_costs[i] + literal_carry;\n literal_carry -= literal_costs[i + 1] - literal_costs[i];\n }\n for (i = 0; i < BROTLI_NUM_COMMAND_SYMBOLS; ++i) {\n cost_cmd[i] = (float)FastLog2(11 + (uint32_t)i);\n }\n for (i = 0; i < self->distance_histogram_size; ++i) {\n cost_dist[i] = (float)FastLog2(20 + (uint32_t)i);\n }\n self->min_cost_cmd_ = (float)FastLog2(11);\n}\n\nstatic BROTLI_INLINE float ZopfliCostModelGetCommandCost(\n const ZopfliCostModel* self, uint16_t cmdcode) {\n return self->cost_cmd_[cmdcode];\n}\n\nstatic BROTLI_INLINE float ZopfliCostModelGetDistanceCost(\n const ZopfliCostModel* self, size_t distcode) {\n return self->cost_dist_[distcode];\n}\n\nstatic BROTLI_INLINE float ZopfliCostModelGetLiteralCosts(\n const ZopfliCostModel* self, size_t from, size_t to) {\n return self->literal_costs_[to] - self->literal_costs_[from];\n}\n\nstatic BROTLI_INLINE float ZopfliCostModelGetMinCostCmd(\n const ZopfliCostModel* self) {\n return self->min_cost_cmd_;\n}\n\n/* REQUIRES: len >= 2, start_pos <= pos */\n/* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */\n/* Maintains the \"ZopfliNode array invariant\". */\nstatic BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos,\n size_t start_pos, size_t len, size_t len_code, size_t dist,\n size_t short_code, float cost) {\n ZopfliNode* next = &nodes[pos + len];\n next->length = (uint32_t)(len | ((len + 9u - len_code) << 25));\n next->distance = (uint32_t)dist;\n next->dcode_insert_length = (uint32_t)(\n (short_code << 27) | (pos - start_pos));\n next->u.cost = cost;\n}\n\ntypedef struct PosData {\n size_t pos;\n int distance_cache[4];\n float costdiff;\n float cost;\n} PosData;\n\n/* Maintains the smallest 8 cost difference together with their positions */\ntypedef struct StartPosQueue {\n PosData q_[8];\n size_t idx_;\n} StartPosQueue;\n\nstatic BROTLI_INLINE void InitStartPosQueue(StartPosQueue* self) {\n self->idx_ = 0;\n}\n\nstatic size_t StartPosQueueSize(const StartPosQueue* self) {\n return BROTLI_MIN(size_t, self->idx_, 8);\n}\n\nstatic void StartPosQueuePush(StartPosQueue* self, const PosData* posdata) {\n size_t offset = ~(self->idx_++) & 7;\n size_t len = StartPosQueueSize(self);\n size_t i;\n PosData* q = self->q_;\n q[offset] = *posdata;\n /* Restore the sorted order. In the list of |len| items at most |len - 1|\n adjacent element comparisons / swaps are required. */\n for (i = 1; i < len; ++i) {\n if (q[offset & 7].costdiff > q[(offset + 1) & 7].costdiff) {\n BROTLI_SWAP(PosData, q, offset & 7, (offset + 1) & 7);\n }\n ++offset;\n }\n}\n\nstatic const PosData* StartPosQueueAt(const StartPosQueue* self, size_t k) {\n return &self->q_[(k - self->idx_) & 7];\n}\n\n/* Returns the minimum possible copy length that can improve the cost of any */\n/* future position. */\nstatic size_t ComputeMinimumCopyLength(const float start_cost,\n const ZopfliNode* nodes,\n const size_t num_bytes,\n const size_t pos) {\n /* Compute the minimum possible cost of reaching any future position. */\n float min_cost = start_cost;\n size_t len = 2;\n size_t next_len_bucket = 4;\n size_t next_len_offset = 10;\n while (pos + len <= num_bytes && nodes[pos + len].u.cost <= min_cost) {\n /* We already reached (pos + len) with no more cost than the minimum\n possible cost of reaching anything from this pos, so there is no point in\n looking for lengths <= len. */\n ++len;\n if (len == next_len_offset) {\n /* We reached the next copy length code bucket, so we add one more\n extra bit to the minimum cost. */\n min_cost += 1.0f;\n next_len_offset += next_len_bucket;\n next_len_bucket *= 2;\n }\n }\n return len;\n}\n\n/* REQUIRES: nodes[pos].cost < kInfinity\n REQUIRES: nodes[0..pos] satisfies that \"ZopfliNode array invariant\". */\nstatic uint32_t ComputeDistanceShortcut(const size_t block_start,\n const size_t pos,\n const size_t max_backward_limit,\n const size_t gap,\n const ZopfliNode* nodes) {\n const size_t c_len = ZopfliNodeCopyLength(&nodes[pos]);\n const size_t i_len = nodes[pos].dcode_insert_length & 0x7FFFFFF;\n const size_t dist = ZopfliNodeCopyDistance(&nodes[pos]);\n /* Since |block_start + pos| is the end position of the command, the copy part\n starts from |block_start + pos - c_len|. Distances that are greater than\n this or greater than |max_backward_limit| + |gap| are static dictionary\n references, and do not update the last distances.\n Also distance code 0 (last distance) does not update the last distances. */\n if (pos == 0) {\n return 0;\n } else if (dist + c_len <= block_start + pos + gap &&\n dist <= max_backward_limit + gap &&\n ZopfliNodeDistanceCode(&nodes[pos]) > 0) {\n return (uint32_t)pos;\n } else {\n return nodes[pos - c_len - i_len].u.shortcut;\n }\n}\n\n/* Fills in dist_cache[0..3] with the last four distances (as defined by\n Section 4. of the Spec) that would be used at (block_start + pos) if we\n used the shortest path of commands from block_start, computed from\n nodes[0..pos]. The last four distances at block_start are in\n starting_dist_cache[0..3].\n REQUIRES: nodes[pos].cost < kInfinity\n REQUIRES: nodes[0..pos] satisfies that \"ZopfliNode array invariant\". */\nstatic void ComputeDistanceCache(const size_t pos,\n const int* starting_dist_cache,\n const ZopfliNode* nodes,\n int* dist_cache) {\n int idx = 0;\n size_t p = nodes[pos].u.shortcut;\n while (idx < 4 && p > 0) {\n const size_t i_len = nodes[p].dcode_insert_length & 0x7FFFFFF;\n const size_t c_len = ZopfliNodeCopyLength(&nodes[p]);\n const size_t dist = ZopfliNodeCopyDistance(&nodes[p]);\n dist_cache[idx++] = (int)dist;\n /* Because of prerequisite, p >= c_len + i_len >= 2. */\n p = nodes[p - c_len - i_len].u.shortcut;\n }\n for (; idx < 4; ++idx) {\n dist_cache[idx] = *starting_dist_cache++;\n }\n}\n\n/* Maintains \"ZopfliNode array invariant\" and pushes node to the queue, if it\n is eligible. */\nstatic void EvaluateNode(\n const size_t block_start, const size_t pos, const size_t max_backward_limit,\n const size_t gap, const int* starting_dist_cache,\n const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) {\n /* Save cost, because ComputeDistanceCache invalidates it. */\n float node_cost = nodes[pos].u.cost;\n nodes[pos].u.shortcut = ComputeDistanceShortcut(\n block_start, pos, max_backward_limit, gap, nodes);\n if (node_cost <= ZopfliCostModelGetLiteralCosts(model, 0, pos)) {\n PosData posdata;\n posdata.pos = pos;\n posdata.cost = node_cost;\n posdata.costdiff = node_cost -\n ZopfliCostModelGetLiteralCosts(model, 0, pos);\n ComputeDistanceCache(\n pos, starting_dist_cache, nodes, posdata.distance_cache);\n StartPosQueuePush(queue, &posdata);\n }\n}\n\n/* Returns longest copy length. */\nstatic size_t UpdateNodes(\n const size_t num_bytes, const size_t block_start, const size_t pos,\n const uint8_t* ringbuffer, const size_t ringbuffer_mask,\n const BrotliEncoderParams* params, const size_t max_backward_limit,\n const int* starting_dist_cache, const size_t num_matches,\n const BackwardMatch* matches, const ZopfliCostModel* model,\n StartPosQueue* queue, ZopfliNode* nodes) {\n const size_t stream_offset = params->stream_offset;\n const size_t cur_ix = block_start + pos;\n const size_t cur_ix_masked = cur_ix & ringbuffer_mask;\n const size_t max_distance = BROTLI_MIN(size_t, cur_ix, max_backward_limit);\n const size_t dictionary_start = BROTLI_MIN(size_t,\n cur_ix + stream_offset, max_backward_limit);\n const size_t max_len = num_bytes - pos;\n const size_t max_zopfli_len = MaxZopfliLen(params);\n const size_t max_iters = MaxZopfliCandidates(params);\n size_t min_len;\n size_t result = 0;\n size_t k;\n const CompoundDictionary* addon = ¶ms->dictionary.compound;\n size_t gap = addon->total_size;\n\n BROTLI_DCHECK(cur_ix_masked + max_len <= ringbuffer_mask);\n\n EvaluateNode(block_start + stream_offset, pos, max_backward_limit, gap,\n starting_dist_cache, model, queue, nodes);\n\n {\n const PosData* posdata = StartPosQueueAt(queue, 0);\n float min_cost = (posdata->cost + ZopfliCostModelGetMinCostCmd(model) +\n ZopfliCostModelGetLiteralCosts(model, posdata->pos, pos));\n min_len = ComputeMinimumCopyLength(min_cost, nodes, num_bytes, pos);\n }\n\n /* Go over the command starting positions in order of increasing cost\n difference. */\n for (k = 0; k < max_iters && k < StartPosQueueSize(queue); ++k) {\n const PosData* posdata = StartPosQueueAt(queue, k);\n const size_t start = posdata->pos;\n const uint16_t inscode = GetInsertLengthCode(pos - start);\n const float start_costdiff = posdata->costdiff;\n const float base_cost = start_costdiff + (float)GetInsertExtra(inscode) +\n ZopfliCostModelGetLiteralCosts(model, 0, pos);\n\n /* Look for last distance matches using the distance cache from this\n starting position. */\n size_t best_len = min_len - 1;\n size_t j = 0;\n for (; j < BROTLI_NUM_DISTANCE_SHORT_CODES && best_len < max_len; ++j) {\n const size_t idx = kDistanceCacheIndex[j];\n const size_t backward =\n (size_t)(posdata->distance_cache[idx] + kDistanceCacheOffset[j]);\n size_t prev_ix = cur_ix - backward;\n size_t len = 0;\n uint8_t continuation = ringbuffer[cur_ix_masked + best_len];\n if (cur_ix_masked + best_len > ringbuffer_mask) {\n break;\n }\n if (BROTLI_PREDICT_FALSE(backward > dictionary_start + gap)) {\n /* Word dictionary -> ignore. */\n continue;\n }\n if (backward <= max_distance) {\n /* Regular backward reference. */\n if (prev_ix >= cur_ix) {\n continue;\n }\n\n prev_ix &= ringbuffer_mask;\n if (prev_ix + best_len > ringbuffer_mask ||\n continuation != ringbuffer[prev_ix + best_len]) {\n continue;\n }\n len = FindMatchLengthWithLimit(&ringbuffer[prev_ix],\n &ringbuffer[cur_ix_masked],\n max_len);\n } else if (backward > dictionary_start) {\n size_t d = 0;\n size_t offset;\n size_t limit;\n const uint8_t* source;\n offset = dictionary_start + 1 + addon->total_size - 1;\n while (offset >= backward + addon->chunk_offsets[d + 1]) d++;\n source = addon->chunk_source[d];\n offset = offset - addon->chunk_offsets[d] - backward;\n limit = addon->chunk_offsets[d + 1] - addon->chunk_offsets[d] - offset;\n limit = limit > max_len ? max_len : limit;\n if (best_len >= limit ||\n continuation != source[offset + best_len]) {\n continue;\n }\n len = FindMatchLengthWithLimit(&source[offset],\n &ringbuffer[cur_ix_masked],\n limit);\n } else {\n /* \"Gray\" area. It is addressable by decoder, but this encoder\n instance does not have that data -> should not touch it. */\n continue;\n }\n {\n const float dist_cost = base_cost +\n ZopfliCostModelGetDistanceCost(model, j);\n size_t l;\n for (l = best_len + 1; l <= len; ++l) {\n const uint16_t copycode = GetCopyLengthCode(l);\n const uint16_t cmdcode =\n CombineLengthCodes(inscode, copycode, j == 0);\n const float cost = (cmdcode < 128 ? base_cost : dist_cost) +\n (float)GetCopyExtra(copycode) +\n ZopfliCostModelGetCommandCost(model, cmdcode);\n if (cost < nodes[pos + l].u.cost) {\n UpdateZopfliNode(nodes, pos, start, l, l, backward, j + 1, cost);\n result = BROTLI_MAX(size_t, result, l);\n }\n best_len = l;\n }\n }\n }\n\n /* At higher iterations look only for new last distance matches, since\n looking only for new command start positions with the same distances\n does not help much. */\n if (k >= 2) continue;\n\n {\n /* Loop through all possible copy lengths at this position. */\n size_t len = min_len;\n for (j = 0; j < num_matches; ++j) {\n BackwardMatch match = matches[j];\n size_t dist = match.distance;\n BROTLI_BOOL is_dictionary_match =\n TO_BROTLI_BOOL(dist > dictionary_start + gap);\n /* We already tried all possible last distance matches, so we can use\n normal distance code here. */\n size_t dist_code = dist + BROTLI_NUM_DISTANCE_SHORT_CODES - 1;\n uint16_t dist_symbol;\n uint32_t distextra;\n uint32_t distnumextra;\n float dist_cost;\n size_t max_match_len;\n PrefixEncodeCopyDistance(\n dist_code, params->dist.num_direct_distance_codes,\n params->dist.distance_postfix_bits, &dist_symbol, &distextra);\n distnumextra = dist_symbol >> 10;\n dist_cost = base_cost + (float)distnumextra +\n ZopfliCostModelGetDistanceCost(model, dist_symbol & 0x3FF);\n\n /* Try all copy lengths up until the maximum copy length corresponding\n to this distance. If the distance refers to the static dictionary, or\n the maximum length is long enough, try only one maximum length. */\n max_match_len = BackwardMatchLength(&match);\n if (len < max_match_len &&\n (is_dictionary_match || max_match_len > max_zopfli_len)) {\n len = max_match_len;\n }\n for (; len <= max_match_len; ++len) {\n const size_t len_code =\n is_dictionary_match ? BackwardMatchLengthCode(&match) : len;\n const uint16_t copycode = GetCopyLengthCode(len_code);\n const uint16_t cmdcode = CombineLengthCodes(inscode, copycode, 0);\n const float cost = dist_cost + (float)GetCopyExtra(copycode) +\n ZopfliCostModelGetCommandCost(model, cmdcode);\n if (cost < nodes[pos + len].u.cost) {\n UpdateZopfliNode(nodes, pos, start, len, len_code, dist, 0, cost);\n result = BROTLI_MAX(size_t, result, len);\n }\n }\n }\n }\n }\n return result;\n}\n\nstatic size_t ComputeShortestPathFromNodes(size_t num_bytes,\n ZopfliNode* nodes) {\n size_t index = num_bytes;\n size_t num_commands = 0;\n while ((nodes[index].dcode_insert_length & 0x7FFFFFF) == 0 &&\n nodes[index].length == 1) --index;\n nodes[index].u.next = BROTLI_UINT32_MAX;\n while (index != 0) {\n size_t len = ZopfliNodeCommandLength(&nodes[index]);\n index -= len;\n nodes[index].u.next = (uint32_t)len;\n num_commands++;\n }\n return num_commands;\n}\n\n/* REQUIRES: nodes != NULL and len(nodes) >= num_bytes + 1 */\nvoid BrotliZopfliCreateCommands(const size_t num_bytes,\n const size_t block_start, const ZopfliNode* nodes, int* dist_cache,\n size_t* last_insert_len, const BrotliEncoderParams* params,\n Command* commands, size_t* num_literals) {\n const size_t stream_offset = params->stream_offset;\n const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);\n size_t pos = 0;\n uint32_t offset = nodes[0].u.next;\n size_t i;\n size_t gap = params->dictionary.compound.total_size;\n for (i = 0; offset != BROTLI_UINT32_MAX; i++) {\n const ZopfliNode* next = &nodes[pos + offset];\n size_t copy_length = ZopfliNodeCopyLength(next);\n size_t insert_length = next->dcode_insert_length & 0x7FFFFFF;\n pos += insert_length;\n offset = next->u.next;\n if (i == 0) {\n insert_length += *last_insert_len;\n *last_insert_len = 0;\n }\n {\n size_t distance = ZopfliNodeCopyDistance(next);\n size_t len_code = ZopfliNodeLengthCode(next);\n size_t dictionary_start = BROTLI_MIN(size_t,\n block_start + pos + stream_offset, max_backward_limit);\n BROTLI_BOOL is_dictionary =\n TO_BROTLI_BOOL(distance > dictionary_start + gap);\n size_t dist_code = ZopfliNodeDistanceCode(next);\n InitCommand(&commands[i], ¶ms->dist, insert_length,\n copy_length, (int)len_code - (int)copy_length, dist_code);\n\n if (!is_dictionary && dist_code > 0) {\n dist_cache[3] = dist_cache[2];\n dist_cache[2] = dist_cache[1];\n dist_cache[1] = dist_cache[0];\n dist_cache[0] = (int)distance;\n }\n }\n\n *num_literals += insert_length;\n pos += copy_length;\n }\n *last_insert_len += num_bytes - pos;\n}\n\nstatic size_t ZopfliIterate(size_t num_bytes, size_t position,\n const uint8_t* ringbuffer, size_t ringbuffer_mask,\n const BrotliEncoderParams* params, const size_t gap, const int* dist_cache,\n const ZopfliCostModel* model, const uint32_t* num_matches,\n const BackwardMatch* matches, ZopfliNode* nodes) {\n const size_t stream_offset = params->stream_offset;\n const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);\n const size_t max_zopfli_len = MaxZopfliLen(params);\n StartPosQueue queue;\n size_t cur_match_pos = 0;\n size_t i;\n nodes[0].length = 0;\n nodes[0].u.cost = 0;\n InitStartPosQueue(&queue);\n for (i = 0; i + 3 < num_bytes; i++) {\n size_t skip = UpdateNodes(num_bytes, position, i, ringbuffer,\n ringbuffer_mask, params, max_backward_limit, dist_cache,\n num_matches[i], &matches[cur_match_pos], model, &queue, nodes);\n if (skip < BROTLI_LONG_COPY_QUICK_STEP) skip = 0;\n cur_match_pos += num_matches[i];\n if (num_matches[i] == 1 &&\n BackwardMatchLength(&matches[cur_match_pos - 1]) > max_zopfli_len) {\n skip = BROTLI_MAX(size_t,\n BackwardMatchLength(&matches[cur_match_pos - 1]), skip);\n }\n if (skip > 1) {\n skip--;\n while (skip) {\n i++;\n if (i + 3 >= num_bytes) break;\n EvaluateNode(position + stream_offset, i, max_backward_limit, gap,\n dist_cache, model, &queue, nodes);\n cur_match_pos += num_matches[i];\n skip--;\n }\n }\n }\n return ComputeShortestPathFromNodes(num_bytes, nodes);\n}\n\nstatic void MergeMatches(BackwardMatch* dst,\n BackwardMatch* src1, size_t len1, BackwardMatch* src2, size_t len2) {\n while (len1 > 0 && len2 > 0) {\n size_t l1 = BackwardMatchLength(src1);\n size_t l2 = BackwardMatchLength(src2);\n if (l1 < l2 || ((l1 == l2) && (src1->distance < src2->distance))) {\n *dst++ = *src1++;\n len1--;\n } else {\n *dst++ = *src2++;\n len2--;\n }\n }\n while (len1-- > 0) *dst++ = *src1++;\n while (len2-- > 0) *dst++ = *src2++;\n}\n\n/* REQUIRES: nodes != NULL and len(nodes) >= num_bytes + 1 */\nsize_t BrotliZopfliComputeShortestPath(MemoryManager* m, size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n const int* dist_cache, Hasher* hasher, ZopfliNode* nodes) {\n const size_t stream_offset = params->stream_offset;\n const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);\n const size_t max_zopfli_len = MaxZopfliLen(params);\n StartPosQueue queue;\n BackwardMatch* BROTLI_RESTRICT matches =\n BROTLI_ALLOC(m, BackwardMatch, 2 * (MAX_NUM_MATCHES_H10 + 64));\n const size_t store_end = num_bytes >= StoreLookaheadH10() ?\n position + num_bytes - StoreLookaheadH10() + 1 : position;\n size_t i;\n const CompoundDictionary* addon = ¶ms->dictionary.compound;\n size_t gap = addon->total_size;\n size_t lz_matches_offset =\n (addon->num_chunks != 0) ? (MAX_NUM_MATCHES_H10 + 128) : 0;\n ZopfliCostModel* model = BROTLI_ALLOC(m, ZopfliCostModel, 1);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(model) || BROTLI_IS_NULL(matches)) {\n return 0;\n }\n nodes[0].length = 0;\n nodes[0].u.cost = 0;\n InitZopfliCostModel(m, model, ¶ms->dist, num_bytes);\n if (BROTLI_IS_OOM(m)) return 0;\n ZopfliCostModelSetFromLiteralCosts(\n model, position, ringbuffer, ringbuffer_mask);\n InitStartPosQueue(&queue);\n for (i = 0; i + HashTypeLengthH10() - 1 < num_bytes; i++) {\n const size_t pos = position + i;\n const size_t max_distance = BROTLI_MIN(size_t, pos, max_backward_limit);\n const size_t dictionary_start = BROTLI_MIN(size_t,\n pos + stream_offset, max_backward_limit);\n size_t skip;\n size_t num_matches;\n int dict_id = 0;\n if (params->dictionary.contextual.context_based) {\n uint8_t p1 = pos >= 1 ?\n ringbuffer[(size_t)(pos - 1) & ringbuffer_mask] : 0;\n uint8_t p2 = pos >= 2 ?\n ringbuffer[(size_t)(pos - 2) & ringbuffer_mask] : 0;\n dict_id = params->dictionary.contextual.context_map[\n BROTLI_CONTEXT(p1, p2, literal_context_lut)];\n }\n num_matches = FindAllMatchesH10(&hasher->privat._H10,\n params->dictionary.contextual.dict[dict_id],\n ringbuffer, ringbuffer_mask, pos, num_bytes - i, max_distance,\n dictionary_start + gap, params, &matches[lz_matches_offset]);\n if (addon->num_chunks != 0) {\n size_t cd_matches = LookupAllCompoundDictionaryMatches(addon,\n ringbuffer, ringbuffer_mask, pos, 3, num_bytes - i,\n dictionary_start, params->dist.max_distance,\n &matches[lz_matches_offset - 64], 64);\n MergeMatches(matches, &matches[lz_matches_offset - 64], cd_matches,\n &matches[lz_matches_offset], num_matches);\n num_matches += cd_matches;\n }\n if (num_matches > 0 &&\n BackwardMatchLength(&matches[num_matches - 1]) > max_zopfli_len) {\n matches[0] = matches[num_matches - 1];\n num_matches = 1;\n }\n skip = UpdateNodes(num_bytes, position, i, ringbuffer, ringbuffer_mask,\n params, max_backward_limit, dist_cache, num_matches, matches, model,\n &queue, nodes);\n if (skip < BROTLI_LONG_COPY_QUICK_STEP) skip = 0;\n if (num_matches == 1 && BackwardMatchLength(&matches[0]) > max_zopfli_len) {\n skip = BROTLI_MAX(size_t, BackwardMatchLength(&matches[0]), skip);\n }\n if (skip > 1) {\n /* Add the tail of the copy to the hasher. */\n StoreRangeH10(&hasher->privat._H10,\n ringbuffer, ringbuffer_mask, pos + 1, BROTLI_MIN(\n size_t, pos + skip, store_end));\n skip--;\n while (skip) {\n i++;\n if (i + HashTypeLengthH10() - 1 >= num_bytes) break;\n EvaluateNode(position + stream_offset, i, max_backward_limit, gap,\n dist_cache, model, &queue, nodes);\n skip--;\n }\n }\n }\n CleanupZopfliCostModel(m, model);\n BROTLI_FREE(m, model);\n BROTLI_FREE(m, matches);\n return ComputeShortestPathFromNodes(num_bytes, nodes);\n}\n\nvoid BrotliCreateZopfliBackwardReferences(MemoryManager* m, size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n Hasher* hasher, int* dist_cache, size_t* last_insert_len,\n Command* commands, size_t* num_commands, size_t* num_literals) {\n ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) return;\n BrotliInitZopfliNodes(nodes, num_bytes + 1);\n *num_commands += BrotliZopfliComputeShortestPath(m, num_bytes,\n position, ringbuffer, ringbuffer_mask, literal_context_lut, params,\n dist_cache, hasher, nodes);\n if (BROTLI_IS_OOM(m)) return;\n BrotliZopfliCreateCommands(num_bytes, position, nodes, dist_cache,\n last_insert_len, params, commands, num_literals);\n BROTLI_FREE(m, nodes);\n}\n\nvoid BrotliCreateHqZopfliBackwardReferences(MemoryManager* m, size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n Hasher* hasher, int* dist_cache, size_t* last_insert_len,\n Command* commands, size_t* num_commands, size_t* num_literals) {\n const size_t stream_offset = params->stream_offset;\n const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);\n uint32_t* num_matches = BROTLI_ALLOC(m, uint32_t, num_bytes);\n size_t matches_size = 4 * num_bytes;\n const size_t store_end = num_bytes >= StoreLookaheadH10() ?\n position + num_bytes - StoreLookaheadH10() + 1 : position;\n size_t cur_match_pos = 0;\n size_t i;\n size_t orig_num_literals;\n size_t orig_last_insert_len;\n int orig_dist_cache[4];\n size_t orig_num_commands;\n ZopfliCostModel* model = BROTLI_ALLOC(m, ZopfliCostModel, 1);\n ZopfliNode* nodes;\n BackwardMatch* matches = BROTLI_ALLOC(m, BackwardMatch, matches_size);\n const CompoundDictionary* addon = ¶ms->dictionary.compound;\n size_t gap = addon->total_size;\n size_t shadow_matches =\n (addon->num_chunks != 0) ? (MAX_NUM_MATCHES_H10 + 128) : 0;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(model) ||\n BROTLI_IS_NULL(num_matches) || BROTLI_IS_NULL(matches)) {\n return;\n }\n for (i = 0; i + HashTypeLengthH10() - 1 < num_bytes; ++i) {\n const size_t pos = position + i;\n size_t max_distance = BROTLI_MIN(size_t, pos, max_backward_limit);\n size_t dictionary_start = BROTLI_MIN(size_t,\n pos + stream_offset, max_backward_limit);\n size_t max_length = num_bytes - i;\n size_t num_found_matches;\n size_t cur_match_end;\n size_t j;\n int dict_id = 0;\n if (params->dictionary.contextual.context_based) {\n uint8_t p1 = pos >= 1 ?\n ringbuffer[(size_t)(pos - 1) & ringbuffer_mask] : 0;\n uint8_t p2 = pos >= 2 ?\n ringbuffer[(size_t)(pos - 2) & ringbuffer_mask] : 0;\n dict_id = params->dictionary.contextual.context_map[\n BROTLI_CONTEXT(p1, p2, literal_context_lut)];\n }\n /* Ensure that we have enough free slots. */\n BROTLI_ENSURE_CAPACITY(m, BackwardMatch, matches, matches_size,\n cur_match_pos + MAX_NUM_MATCHES_H10 + shadow_matches);\n if (BROTLI_IS_OOM(m)) return;\n num_found_matches = FindAllMatchesH10(&hasher->privat._H10,\n params->dictionary.contextual.dict[dict_id],\n ringbuffer, ringbuffer_mask, pos, max_length,\n max_distance, dictionary_start + gap, params,\n &matches[cur_match_pos + shadow_matches]);\n if (addon->num_chunks != 0) {\n size_t cd_matches = LookupAllCompoundDictionaryMatches(addon,\n ringbuffer, ringbuffer_mask, pos, 3, max_length,\n dictionary_start, params->dist.max_distance,\n &matches[cur_match_pos + shadow_matches - 64], 64);\n MergeMatches(&matches[cur_match_pos],\n &matches[cur_match_pos + shadow_matches - 64], cd_matches,\n &matches[cur_match_pos + shadow_matches], num_found_matches);\n num_found_matches += cd_matches;\n }\n cur_match_end = cur_match_pos + num_found_matches;\n for (j = cur_match_pos; j + 1 < cur_match_end; ++j) {\n BROTLI_DCHECK(BackwardMatchLength(&matches[j]) <=\n BackwardMatchLength(&matches[j + 1]));\n }\n num_matches[i] = (uint32_t)num_found_matches;\n if (num_found_matches > 0) {\n const size_t match_len = BackwardMatchLength(&matches[cur_match_end - 1]);\n if (match_len > MAX_ZOPFLI_LEN_QUALITY_11) {\n const size_t skip = match_len - 1;\n matches[cur_match_pos++] = matches[cur_match_end - 1];\n num_matches[i] = 1;\n /* Add the tail of the copy to the hasher. */\n StoreRangeH10(&hasher->privat._H10,\n ringbuffer, ringbuffer_mask, pos + 1,\n BROTLI_MIN(size_t, pos + match_len, store_end));\n memset(&num_matches[i + 1], 0, skip * sizeof(num_matches[0]));\n i += skip;\n } else {\n cur_match_pos = cur_match_end;\n }\n }\n }\n orig_num_literals = *num_literals;\n orig_last_insert_len = *last_insert_len;\n memcpy(orig_dist_cache, dist_cache, 4 * sizeof(dist_cache[0]));\n orig_num_commands = *num_commands;\n nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) return;\n InitZopfliCostModel(m, model, ¶ms->dist, num_bytes);\n if (BROTLI_IS_OOM(m)) return;\n for (i = 0; i < 2; i++) {\n BrotliInitZopfliNodes(nodes, num_bytes + 1);\n if (i == 0) {\n ZopfliCostModelSetFromLiteralCosts(\n model, position, ringbuffer, ringbuffer_mask);\n } else {\n ZopfliCostModelSetFromCommands(model, position, ringbuffer,\n ringbuffer_mask, commands, *num_commands - orig_num_commands,\n orig_last_insert_len);\n }\n *num_commands = orig_num_commands;\n *num_literals = orig_num_literals;\n *last_insert_len = orig_last_insert_len;\n memcpy(dist_cache, orig_dist_cache, 4 * sizeof(dist_cache[0]));\n *num_commands += ZopfliIterate(num_bytes, position, ringbuffer,\n ringbuffer_mask, params, gap, dist_cache, model, num_matches, matches,\n nodes);\n BrotliZopfliCreateCommands(num_bytes, position, nodes, dist_cache,\n last_insert_len, params, commands, num_literals);\n }\n CleanupZopfliCostModel(m, model);\n BROTLI_FREE(m, model);\n BROTLI_FREE(m, nodes);\n BROTLI_FREE(m, matches);\n BROTLI_FREE(m, num_matches);\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/backward_references_hq.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function to find backward reference copies. */\n\n#ifndef BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_\n#define BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_\n\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"command.h\"\n#include \"hash.h\"\n#include \"memory.h\"\n#include \"params.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nBROTLI_INTERNAL void BrotliCreateZopfliBackwardReferences(MemoryManager* m,\n size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n Hasher* hasher, int* dist_cache, size_t* last_insert_len,\n Command* commands, size_t* num_commands, size_t* num_literals);\n\nBROTLI_INTERNAL void BrotliCreateHqZopfliBackwardReferences(MemoryManager* m,\n size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n Hasher* hasher, int* dist_cache, size_t* last_insert_len,\n Command* commands, size_t* num_commands, size_t* num_literals);\n\ntypedef struct ZopfliNode {\n /* Best length to get up to this byte (not including this byte itself)\n highest 7 bit is used to reconstruct the length code. */\n uint32_t length;\n /* Distance associated with the length. */\n uint32_t distance;\n /* Number of literal inserts before this copy; highest 5 bits contain\n distance short code + 1 (or zero if no short code). */\n uint32_t dcode_insert_length;\n\n /* This union holds information used by dynamic-programming. During forward\n pass |cost| it used to store the goal function. When node is processed its\n |cost| is invalidated in favor of |shortcut|. On path back-tracing pass\n |next| is assigned the offset to next node on the path. */\n union {\n /* Smallest cost to get to this byte from the beginning, as found so far. */\n float cost;\n /* Offset to the next node on the path. Equals to command_length() of the\n next node on the path. For last node equals to BROTLI_UINT32_MAX */\n uint32_t next;\n /* Node position that provides next distance for distance cache. */\n uint32_t shortcut;\n } u;\n} ZopfliNode;\n\nBROTLI_INTERNAL void BrotliInitZopfliNodes(ZopfliNode* array, size_t length);\n\n/* Computes the shortest path of commands from position to at most\n position + num_bytes.\n\n On return, path->size() is the number of commands found and path[i] is the\n length of the i-th command (copy length plus insert length).\n Note that the sum of the lengths of all commands can be less than num_bytes.\n\n On return, the nodes[0..num_bytes] array will have the following\n \"ZopfliNode array invariant\":\n For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then\n (1) nodes[i].copy_length() >= 2\n (2) nodes[i].command_length() <= i and\n (3) nodes[i - nodes[i].command_length()].cost < kInfinity */\nBROTLI_INTERNAL size_t BrotliZopfliComputeShortestPath(\n MemoryManager* m, size_t num_bytes,\n size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);\n\nBROTLI_INTERNAL void BrotliZopfliCreateCommands(\n const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,\n int* dist_cache, size_t* last_insert_len, const BrotliEncoderParams* params,\n Command* commands, size_t* num_literals);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_BACKWARD_REFERENCES_HQ_H_ */\n" }, { "path": "libs/brotli/enc/backward_references_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: EXPORT_FN, FN */\n\nstatic BROTLI_NOINLINE void EXPORT_FN(CreateBackwardReferences)(\n size_t num_bytes, size_t position,\n const uint8_t* ringbuffer, size_t ringbuffer_mask,\n ContextLut literal_context_lut, const BrotliEncoderParams* params,\n Hasher* hasher, int* dist_cache, size_t* last_insert_len,\n Command* commands, size_t* num_commands, size_t* num_literals) {\n HASHER()* privat = &hasher->privat.FN(_);\n /* Set maximum distance, see section 9.1. of the spec. */\n const size_t max_backward_limit = BROTLI_MAX_BACKWARD_LIMIT(params->lgwin);\n const size_t position_offset = params->stream_offset;\n\n const Command* const orig_commands = commands;\n size_t insert_length = *last_insert_len;\n const size_t pos_end = position + num_bytes;\n const size_t store_end = num_bytes >= FN(StoreLookahead)() ?\n position + num_bytes - FN(StoreLookahead)() + 1 : position;\n\n /* For speed up heuristics for random data. */\n const size_t random_heuristics_window_size =\n LiteralSpreeLengthForSparseSearch(params);\n size_t apply_random_heuristics = position + random_heuristics_window_size;\n const size_t gap = params->dictionary.compound.total_size;\n\n /* Minimum score to accept a backward reference. */\n const score_t kMinScore = BROTLI_SCORE_BASE + 100;\n\n FN(PrepareDistanceCache)(privat, dist_cache);\n\n while (position + FN(HashTypeLength)() < pos_end) {\n size_t max_length = pos_end - position;\n size_t max_distance = BROTLI_MIN(size_t, position, max_backward_limit);\n size_t dictionary_start = BROTLI_MIN(size_t,\n position + position_offset, max_backward_limit);\n HasherSearchResult sr;\n int dict_id = 0;\n uint8_t p1 = 0;\n uint8_t p2 = 0;\n if (params->dictionary.contextual.context_based) {\n p1 = position >= 1 ?\n ringbuffer[(size_t)(position - 1) & ringbuffer_mask] : 0;\n p2 = position >= 2 ?\n ringbuffer[(size_t)(position - 2) & ringbuffer_mask] : 0;\n dict_id = params->dictionary.contextual.context_map[\n BROTLI_CONTEXT(p1, p2, literal_context_lut)];\n }\n sr.len = 0;\n sr.len_code_delta = 0;\n sr.distance = 0;\n sr.score = kMinScore;\n FN(FindLongestMatch)(privat, params->dictionary.contextual.dict[dict_id],\n ringbuffer, ringbuffer_mask, dist_cache, position, max_length,\n max_distance, dictionary_start + gap, params->dist.max_distance, &sr);\n if (ENABLE_COMPOUND_DICTIONARY) {\n LookupCompoundDictionaryMatch(¶ms->dictionary.compound, ringbuffer,\n ringbuffer_mask, dist_cache, position, max_length,\n dictionary_start, params->dist.max_distance, &sr);\n }\n if (sr.score > kMinScore) {\n /* Found a match. Let's look for something even better ahead. */\n int delayed_backward_references_in_row = 0;\n --max_length;\n for (;; --max_length) {\n const score_t cost_diff_lazy = 175;\n HasherSearchResult sr2;\n sr2.len = params->quality < MIN_QUALITY_FOR_EXTENSIVE_REFERENCE_SEARCH ?\n BROTLI_MIN(size_t, sr.len - 1, max_length) : 0;\n sr2.len_code_delta = 0;\n sr2.distance = 0;\n sr2.score = kMinScore;\n max_distance = BROTLI_MIN(size_t, position + 1, max_backward_limit);\n dictionary_start = BROTLI_MIN(size_t,\n position + 1 + position_offset, max_backward_limit);\n if (params->dictionary.contextual.context_based) {\n p2 = p1;\n p1 = ringbuffer[position & ringbuffer_mask];\n dict_id = params->dictionary.contextual.context_map[\n BROTLI_CONTEXT(p1, p2, literal_context_lut)];\n }\n FN(FindLongestMatch)(privat,\n params->dictionary.contextual.dict[dict_id],\n ringbuffer, ringbuffer_mask, dist_cache, position + 1, max_length,\n max_distance, dictionary_start + gap, params->dist.max_distance,\n &sr2);\n if (ENABLE_COMPOUND_DICTIONARY) {\n LookupCompoundDictionaryMatch(\n ¶ms->dictionary.compound, ringbuffer,\n ringbuffer_mask, dist_cache, position + 1, max_length,\n dictionary_start, params->dist.max_distance, &sr2);\n }\n if (sr2.score >= sr.score + cost_diff_lazy) {\n /* Ok, let's just write one byte for now and start a match from the\n next byte. */\n ++position;\n ++insert_length;\n sr = sr2;\n if (++delayed_backward_references_in_row < 4 &&\n position + FN(HashTypeLength)() < pos_end) {\n continue;\n }\n }\n break;\n }\n apply_random_heuristics =\n position + 2 * sr.len + random_heuristics_window_size;\n dictionary_start = BROTLI_MIN(size_t,\n position + position_offset, max_backward_limit);\n {\n /* The first 16 codes are special short-codes,\n and the minimum offset is 1. */\n size_t distance_code = ComputeDistanceCode(\n sr.distance, dictionary_start + gap, dist_cache);\n if ((sr.distance <= (dictionary_start + gap)) && distance_code > 0) {\n dist_cache[3] = dist_cache[2];\n dist_cache[2] = dist_cache[1];\n dist_cache[1] = dist_cache[0];\n dist_cache[0] = (int)sr.distance;\n FN(PrepareDistanceCache)(privat, dist_cache);\n }\n InitCommand(commands++, ¶ms->dist, insert_length,\n sr.len, sr.len_code_delta, distance_code);\n }\n *num_literals += insert_length;\n insert_length = 0;\n /* Put the hash keys into the table, if there are enough bytes left.\n Depending on the hasher implementation, it can push all positions\n in the given range or only a subset of them.\n Avoid hash poisoning with RLE data. */\n {\n size_t range_start = position + 2;\n size_t range_end = BROTLI_MIN(size_t, position + sr.len, store_end);\n if (sr.distance < (sr.len >> 2)) {\n range_start = BROTLI_MIN(size_t, range_end, BROTLI_MAX(size_t,\n range_start, position + sr.len - (sr.distance << 2)));\n }\n FN(StoreRange)(privat, ringbuffer, ringbuffer_mask, range_start,\n range_end);\n }\n position += sr.len;\n } else {\n ++insert_length;\n ++position;\n /* If we have not seen matches for a long time, we can skip some\n match lookups. Unsuccessful match lookups are very very expensive\n and this kind of a heuristic speeds up compression quite\n a lot. */\n if (position > apply_random_heuristics) {\n /* Going through uncompressible data, jump. */\n if (position >\n apply_random_heuristics + 4 * random_heuristics_window_size) {\n /* It is quite a long time since we saw a copy, so we assume\n that this data is not compressible, and store hashes less\n often. Hashes of non compressible data are less likely to\n turn out to be useful in the future, too, so we store less of\n them to not to flood out the hash table of good compressible\n data. */\n const size_t kMargin =\n BROTLI_MAX(size_t, FN(StoreLookahead)() - 1, 4);\n size_t pos_jump =\n BROTLI_MIN(size_t, position + 16, pos_end - kMargin);\n for (; position < pos_jump; position += 4) {\n FN(Store)(privat, ringbuffer, ringbuffer_mask, position);\n insert_length += 4;\n }\n } else {\n const size_t kMargin =\n BROTLI_MAX(size_t, FN(StoreLookahead)() - 1, 2);\n size_t pos_jump =\n BROTLI_MIN(size_t, position + 8, pos_end - kMargin);\n for (; position < pos_jump; position += 2) {\n FN(Store)(privat, ringbuffer, ringbuffer_mask, position);\n insert_length += 2;\n }\n }\n }\n }\n }\n insert_length += pos_end - position;\n *last_insert_len = insert_length;\n *num_commands += (size_t)(commands - orig_commands);\n}\n" }, { "path": "libs/brotli/enc/bit_cost.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Functions to estimate the bit cost of Huffman trees. */\n\n#include \"bit_cost.h\"\n\n#include \"../common/platform.h\"\n#include \"fast_log.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ndouble BrotliBitsEntropy(const uint32_t* population, size_t size) {\n size_t sum = 0;\n double retval = 0;\n const uint32_t* population_end = population + size;\n size_t p;\n if (size & 1) {\n goto odd_number_of_elements_left;\n }\n while (population < population_end) {\n p = *population++;\n sum += p;\n retval -= (double)p * FastLog2(p);\n odd_number_of_elements_left:\n p = *population++;\n sum += p;\n retval -= (double)p * FastLog2(p);\n }\n if (sum) retval += (double)sum * FastLog2(sum);\n\n if (retval < (double)sum) {\n /* TODO(eustas): consider doing that per-symbol? */\n /* At least one bit per literal is needed. */\n retval = (double)sum;\n }\n\n return retval;\n}\n\n#define FN(X) X ## Literal\n#include \"bit_cost_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Command\n#include \"bit_cost_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Distance\n#include \"bit_cost_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/bit_cost.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Functions to estimate the bit cost of Huffman trees. */\n\n#ifndef BROTLI_ENC_BIT_COST_H_\n#define BROTLI_ENC_BIT_COST_H_\n\n#include \"../common/platform.h\"\n#include \"histogram.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nBROTLI_INTERNAL double BrotliBitsEntropy(\n const uint32_t* population, size_t size);\nBROTLI_INTERNAL double BrotliPopulationCostLiteral(\n const HistogramLiteral* histogram);\nBROTLI_INTERNAL double BrotliPopulationCostCommand(\n const HistogramCommand* histogram);\nBROTLI_INTERNAL double BrotliPopulationCostDistance(\n const HistogramDistance* histogram);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_BIT_COST_H_ */\n" }, { "path": "libs/brotli/enc/bit_cost_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN */\n\n#define HistogramType FN(Histogram)\n\ndouble FN(BrotliPopulationCost)(const HistogramType* histogram) {\n static const double kOneSymbolHistogramCost = 12;\n static const double kTwoSymbolHistogramCost = 20;\n static const double kThreeSymbolHistogramCost = 28;\n static const double kFourSymbolHistogramCost = 37;\n const size_t data_size = FN(HistogramDataSize)();\n int count = 0;\n size_t s[5];\n double bits = 0.0;\n size_t i;\n if (histogram->total_count_ == 0) {\n return kOneSymbolHistogramCost;\n }\n for (i = 0; i < data_size; ++i) {\n if (histogram->data_[i] > 0) {\n s[count] = i;\n ++count;\n if (count > 4) break;\n }\n }\n if (count == 1) {\n return kOneSymbolHistogramCost;\n }\n if (count == 2) {\n return (kTwoSymbolHistogramCost + (double)histogram->total_count_);\n }\n if (count == 3) {\n const uint32_t histo0 = histogram->data_[s[0]];\n const uint32_t histo1 = histogram->data_[s[1]];\n const uint32_t histo2 = histogram->data_[s[2]];\n const uint32_t histomax =\n BROTLI_MAX(uint32_t, histo0, BROTLI_MAX(uint32_t, histo1, histo2));\n return (kThreeSymbolHistogramCost +\n 2 * (histo0 + histo1 + histo2) - histomax);\n }\n if (count == 4) {\n uint32_t histo[4];\n uint32_t h23;\n uint32_t histomax;\n for (i = 0; i < 4; ++i) {\n histo[i] = histogram->data_[s[i]];\n }\n /* Sort */\n for (i = 0; i < 4; ++i) {\n size_t j;\n for (j = i + 1; j < 4; ++j) {\n if (histo[j] > histo[i]) {\n BROTLI_SWAP(uint32_t, histo, j, i);\n }\n }\n }\n h23 = histo[2] + histo[3];\n histomax = BROTLI_MAX(uint32_t, h23, histo[0]);\n return (kFourSymbolHistogramCost +\n 3 * h23 + 2 * (histo[0] + histo[1]) - histomax);\n }\n\n {\n /* In this loop we compute the entropy of the histogram and simultaneously\n build a simplified histogram of the code length codes where we use the\n zero repeat code 17, but we don't use the non-zero repeat code 16. */\n size_t max_depth = 1;\n uint32_t depth_histo[BROTLI_CODE_LENGTH_CODES] = { 0 };\n const double log2total = FastLog2(histogram->total_count_);\n for (i = 0; i < data_size;) {\n if (histogram->data_[i] > 0) {\n /* Compute -log2(P(symbol)) = -log2(count(symbol)/total_count) =\n = log2(total_count) - log2(count(symbol)) */\n double log2p = log2total - FastLog2(histogram->data_[i]);\n /* Approximate the bit depth by round(-log2(P(symbol))) */\n size_t depth = (size_t)(log2p + 0.5);\n bits += histogram->data_[i] * log2p;\n if (depth > 15) {\n depth = 15;\n }\n if (depth > max_depth) {\n max_depth = depth;\n }\n ++depth_histo[depth];\n ++i;\n } else {\n /* Compute the run length of zeros and add the appropriate number of 0\n and 17 code length codes to the code length code histogram. */\n uint32_t reps = 1;\n size_t k;\n for (k = i + 1; k < data_size && histogram->data_[k] == 0; ++k) {\n ++reps;\n }\n i += reps;\n if (i == data_size) {\n /* Don't add any cost for the last zero run, since these are encoded\n only implicitly. */\n break;\n }\n if (reps < 3) {\n depth_histo[0] += reps;\n } else {\n reps -= 2;\n while (reps > 0) {\n ++depth_histo[BROTLI_REPEAT_ZERO_CODE_LENGTH];\n /* Add the 3 extra bits for the 17 code length code. */\n bits += 3;\n reps >>= 3;\n }\n }\n }\n }\n /* Add the estimated encoding cost of the code length code histogram. */\n bits += (double)(18 + 2 * max_depth);\n /* Add the entropy of the code length code histogram. */\n bits += BrotliBitsEntropy(depth_histo, BROTLI_CODE_LENGTH_CODES);\n }\n return bits;\n}\n\n#undef HistogramType\n" }, { "path": "libs/brotli/enc/block_encoder_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN */\n\n#define HistogramType FN(Histogram)\n\n/* Creates entropy codes for all block types and stores them to the bit\n stream. */\nstatic void FN(BuildAndStoreEntropyCodes)(MemoryManager* m, BlockEncoder* self,\n const HistogramType* histograms, const size_t histograms_size,\n const size_t alphabet_size, HuffmanTree* tree,\n size_t* storage_ix, uint8_t* storage) {\n const size_t table_size = histograms_size * self->histogram_length_;\n self->depths_ = BROTLI_ALLOC(m, uint8_t, table_size);\n self->bits_ = BROTLI_ALLOC(m, uint16_t, table_size);\n if (BROTLI_IS_OOM(m)) return;\n\n {\n size_t i;\n for (i = 0; i < histograms_size; ++i) {\n size_t ix = i * self->histogram_length_;\n BuildAndStoreHuffmanTree(&histograms[i].data_[0], self->histogram_length_,\n alphabet_size, tree, &self->depths_[ix], &self->bits_[ix],\n storage_ix, storage);\n }\n }\n}\n\n#undef HistogramType\n" }, { "path": "libs/brotli/enc/block_splitter.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Block split point selection utilities. */\n\n#include \"block_splitter.h\"\n\n#include \"../common/platform.h\"\n#include \"bit_cost.h\"\n#include \"cluster.h\"\n#include \"command.h\"\n#include \"fast_log.h\"\n#include \"histogram.h\"\n#include \"memory.h\"\n#include \"quality.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic const size_t kMaxLiteralHistograms = 100;\nstatic const size_t kMaxCommandHistograms = 50;\nstatic const double kLiteralBlockSwitchCost = 28.1;\nstatic const double kCommandBlockSwitchCost = 13.5;\nstatic const double kDistanceBlockSwitchCost = 14.6;\nstatic const size_t kLiteralStrideLength = 70;\nstatic const size_t kCommandStrideLength = 40;\nstatic const size_t kDistanceStrideLength = 40;\nstatic const size_t kSymbolsPerLiteralHistogram = 544;\nstatic const size_t kSymbolsPerCommandHistogram = 530;\nstatic const size_t kSymbolsPerDistanceHistogram = 544;\nstatic const size_t kMinLengthForBlockSplitting = 128;\nstatic const size_t kIterMulForRefining = 2;\nstatic const size_t kMinItersForRefining = 100;\n\nstatic size_t CountLiterals(const Command* cmds, const size_t num_commands) {\n /* Count how many we have. */\n size_t total_length = 0;\n size_t i;\n for (i = 0; i < num_commands; ++i) {\n total_length += cmds[i].insert_len_;\n }\n return total_length;\n}\n\nstatic void CopyLiteralsToByteArray(const Command* cmds,\n const size_t num_commands,\n const uint8_t* data,\n const size_t offset,\n const size_t mask,\n uint8_t* literals) {\n size_t pos = 0;\n size_t from_pos = offset & mask;\n size_t i;\n for (i = 0; i < num_commands; ++i) {\n size_t insert_len = cmds[i].insert_len_;\n if (from_pos + insert_len > mask) {\n size_t head_size = mask + 1 - from_pos;\n memcpy(literals + pos, data + from_pos, head_size);\n from_pos = 0;\n pos += head_size;\n insert_len -= head_size;\n }\n if (insert_len > 0) {\n memcpy(literals + pos, data + from_pos, insert_len);\n pos += insert_len;\n }\n from_pos = (from_pos + insert_len + CommandCopyLen(&cmds[i])) & mask;\n }\n}\n\nstatic BROTLI_INLINE uint32_t MyRand(uint32_t* seed) {\n /* Initial seed should be 7. In this case, loop length is (1 << 29). */\n *seed *= 16807U;\n return *seed;\n}\n\nstatic BROTLI_INLINE double BitCost(size_t count) {\n return count == 0 ? -2.0 : FastLog2(count);\n}\n\n#define HISTOGRAMS_PER_BATCH 64\n#define CLUSTERS_PER_BATCH 16\n\n#define FN(X) X ## Literal\n#define DataType uint8_t\n/* NOLINTNEXTLINE(build/include) */\n#include \"block_splitter_inc.h\"\n#undef DataType\n#undef FN\n\n#define FN(X) X ## Command\n#define DataType uint16_t\n/* NOLINTNEXTLINE(build/include) */\n#include \"block_splitter_inc.h\"\n#undef FN\n\n#define FN(X) X ## Distance\n/* NOLINTNEXTLINE(build/include) */\n#include \"block_splitter_inc.h\"\n#undef DataType\n#undef FN\n\nvoid BrotliInitBlockSplit(BlockSplit* self) {\n self->num_types = 0;\n self->num_blocks = 0;\n self->types = 0;\n self->lengths = 0;\n self->types_alloc_size = 0;\n self->lengths_alloc_size = 0;\n}\n\nvoid BrotliDestroyBlockSplit(MemoryManager* m, BlockSplit* self) {\n BROTLI_FREE(m, self->types);\n BROTLI_FREE(m, self->lengths);\n}\n\n/* Extracts literals, command distance and prefix codes, then applies\n * SplitByteVector to create partitioning. */\nvoid BrotliSplitBlock(MemoryManager* m,\n const Command* cmds,\n const size_t num_commands,\n const uint8_t* data,\n const size_t pos,\n const size_t mask,\n const BrotliEncoderParams* params,\n BlockSplit* literal_split,\n BlockSplit* insert_and_copy_split,\n BlockSplit* dist_split) {\n {\n size_t literals_count = CountLiterals(cmds, num_commands);\n uint8_t* literals = BROTLI_ALLOC(m, uint8_t, literals_count);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(literals)) return;\n /* Create a continuous array of literals. */\n CopyLiteralsToByteArray(cmds, num_commands, data, pos, mask, literals);\n /* Create the block split on the array of literals.\n * Literal histograms can have alphabet size up to 256.\n * Though, to accommodate context modeling, less than half of maximum size\n * is allowed. */\n SplitByteVectorLiteral(\n m, literals, literals_count,\n kSymbolsPerLiteralHistogram, kMaxLiteralHistograms,\n kLiteralStrideLength, kLiteralBlockSwitchCost, params,\n literal_split);\n if (BROTLI_IS_OOM(m)) return;\n BROTLI_FREE(m, literals);\n /* NB: this might be a good place for injecting extra splitting without\n * increasing encoder complexity; however, output partition would be less\n * optimal than one produced with forced splitting inside\n * SplitByteVector (FindBlocks / ClusterBlocks). */\n }\n\n {\n /* Compute prefix codes for commands. */\n uint16_t* insert_and_copy_codes = BROTLI_ALLOC(m, uint16_t, num_commands);\n size_t i;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(insert_and_copy_codes)) return;\n for (i = 0; i < num_commands; ++i) {\n insert_and_copy_codes[i] = cmds[i].cmd_prefix_;\n }\n /* Create the block split on the array of command prefixes. */\n SplitByteVectorCommand(\n m, insert_and_copy_codes, num_commands,\n kSymbolsPerCommandHistogram, kMaxCommandHistograms,\n kCommandStrideLength, kCommandBlockSwitchCost, params,\n insert_and_copy_split);\n if (BROTLI_IS_OOM(m)) return;\n /* TODO(eustas): reuse for distances? */\n BROTLI_FREE(m, insert_and_copy_codes);\n }\n\n {\n /* Create a continuous array of distance prefixes. */\n uint16_t* distance_prefixes = BROTLI_ALLOC(m, uint16_t, num_commands);\n size_t j = 0;\n size_t i;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(distance_prefixes)) return;\n for (i = 0; i < num_commands; ++i) {\n const Command* cmd = &cmds[i];\n if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {\n distance_prefixes[j++] = cmd->dist_prefix_ & 0x3FF;\n }\n }\n /* Create the block split on the array of distance prefixes. */\n SplitByteVectorDistance(\n m, distance_prefixes, j,\n kSymbolsPerDistanceHistogram, kMaxCommandHistograms,\n kDistanceStrideLength, kDistanceBlockSwitchCost, params,\n dist_split);\n if (BROTLI_IS_OOM(m)) return;\n BROTLI_FREE(m, distance_prefixes);\n }\n}\n\n#if defined(BROTLI_TEST)\nsize_t BrotliCountLiteralsForTest(const Command*, size_t);\nsize_t BrotliCountLiteralsForTest(const Command* cmds, size_t num_commands) {\n return CountLiterals(cmds, num_commands);\n}\nvoid BrotliCopyLiteralsToByteArrayForTest(\n const Command*, size_t, const uint8_t*, size_t, size_t, uint8_t*);\nvoid BrotliCopyLiteralsToByteArrayForTest(const Command* cmds,\n size_t num_commands, const uint8_t* data, size_t offset, size_t mask,\n uint8_t* literals) {\n CopyLiteralsToByteArray(cmds, num_commands, data, offset, mask, literals);\n}\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/block_splitter.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Block split point selection utilities. */\n\n#ifndef BROTLI_ENC_BLOCK_SPLITTER_H_\n#define BROTLI_ENC_BLOCK_SPLITTER_H_\n\n#include \"../common/platform.h\"\n#include \"command.h\"\n#include \"memory.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ntypedef struct BlockSplit {\n size_t num_types; /* Amount of distinct types */\n size_t num_blocks; /* Amount of values in types and length */\n uint8_t* types;\n uint32_t* lengths;\n\n size_t types_alloc_size;\n size_t lengths_alloc_size;\n} BlockSplit;\n\nBROTLI_INTERNAL void BrotliInitBlockSplit(BlockSplit* self);\nBROTLI_INTERNAL void BrotliDestroyBlockSplit(MemoryManager* m,\n BlockSplit* self);\n\nBROTLI_INTERNAL void BrotliSplitBlock(MemoryManager* m,\n const Command* cmds,\n const size_t num_commands,\n const uint8_t* data,\n const size_t offset,\n const size_t mask,\n const BrotliEncoderParams* params,\n BlockSplit* literal_split,\n BlockSplit* insert_and_copy_split,\n BlockSplit* dist_split);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_BLOCK_SPLITTER_H_ */\n" }, { "path": "libs/brotli/enc/block_splitter_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN, DataType */\n\n#define HistogramType FN(Histogram)\n\nstatic void FN(InitialEntropyCodes)(const DataType* data, size_t length,\n size_t stride,\n size_t num_histograms,\n HistogramType* histograms) {\n uint32_t seed = 7;\n size_t block_length = length / num_histograms;\n size_t i;\n FN(ClearHistograms)(histograms, num_histograms);\n for (i = 0; i < num_histograms; ++i) {\n size_t pos = length * i / num_histograms;\n if (i != 0) {\n pos += MyRand(&seed) % block_length;\n }\n if (pos + stride >= length) {\n pos = length - stride - 1;\n }\n FN(HistogramAddVector)(&histograms[i], data + pos, stride);\n }\n}\n\nstatic void FN(RandomSample)(uint32_t* seed,\n const DataType* data,\n size_t length,\n size_t stride,\n HistogramType* sample) {\n size_t pos = 0;\n if (stride >= length) {\n stride = length;\n } else {\n pos = MyRand(seed) % (length - stride + 1);\n }\n FN(HistogramAddVector)(sample, data + pos, stride);\n}\n\nstatic void FN(RefineEntropyCodes)(const DataType* data, size_t length,\n size_t stride,\n size_t num_histograms,\n HistogramType* histograms,\n HistogramType* tmp) {\n size_t iters =\n kIterMulForRefining * length / stride + kMinItersForRefining;\n uint32_t seed = 7;\n size_t iter;\n iters = ((iters + num_histograms - 1) / num_histograms) * num_histograms;\n for (iter = 0; iter < iters; ++iter) {\n FN(HistogramClear)(tmp);\n FN(RandomSample)(&seed, data, length, stride, tmp);\n FN(HistogramAddHistogram)(&histograms[iter % num_histograms], tmp);\n }\n}\n\n/* Assigns a block id from the range [0, num_histograms) to each data element\n in data[0..length) and fills in block_id[0..length) with the assigned values.\n Returns the number of blocks, i.e. one plus the number of block switches. */\nstatic size_t FN(FindBlocks)(const DataType* data, const size_t length,\n const double block_switch_bitcost,\n const size_t num_histograms,\n const HistogramType* histograms,\n double* insert_cost,\n double* cost,\n uint8_t* switch_signal,\n uint8_t* block_id) {\n const size_t alphabet_size = FN(HistogramDataSize)();\n const size_t bitmap_len = (num_histograms + 7) >> 3;\n size_t num_blocks = 1;\n size_t byte_ix;\n size_t i;\n size_t j;\n BROTLI_DCHECK(num_histograms <= 256);\n\n /* Trivial case: single histogram -> single block type. */\n if (num_histograms <= 1) {\n for (i = 0; i < length; ++i) {\n block_id[i] = 0;\n }\n return 1;\n }\n\n /* Fill bitcost for each symbol of all histograms.\n * Non-existing symbol cost: 2 + log2(total_count).\n * Regular symbol cost: -log2(symbol_count / total_count). */\n memset(insert_cost, 0,\n sizeof(insert_cost[0]) * alphabet_size * num_histograms);\n for (i = 0; i < num_histograms; ++i) {\n insert_cost[i] = FastLog2((uint32_t)histograms[i].total_count_);\n }\n for (i = alphabet_size; i != 0;) {\n /* Reverse order to use the 0-th row as a temporary storage. */\n --i;\n for (j = 0; j < num_histograms; ++j) {\n insert_cost[i * num_histograms + j] =\n insert_cost[j] - BitCost(histograms[j].data_[i]);\n }\n }\n\n /* After each iteration of this loop, cost[k] will contain the difference\n between the minimum cost of arriving at the current byte position using\n entropy code k, and the minimum cost of arriving at the current byte\n position. This difference is capped at the block switch cost, and if it\n reaches block switch cost, it means that when we trace back from the last\n position, we need to switch here. */\n memset(cost, 0, sizeof(cost[0]) * num_histograms);\n memset(switch_signal, 0, sizeof(switch_signal[0]) * length * bitmap_len);\n for (byte_ix = 0; byte_ix < length; ++byte_ix) {\n size_t ix = byte_ix * bitmap_len;\n size_t symbol = data[byte_ix];\n size_t insert_cost_ix = symbol * num_histograms;\n double min_cost = 1e99;\n double block_switch_cost = block_switch_bitcost;\n static const size_t prologue_length = 2000;\n static const double multiplier = 0.07 / 2000;\n size_t k;\n for (k = 0; k < num_histograms; ++k) {\n /* We are coding the symbol with entropy code k. */\n cost[k] += insert_cost[insert_cost_ix + k];\n if (cost[k] < min_cost) {\n min_cost = cost[k];\n block_id[byte_ix] = (uint8_t)k;\n }\n }\n /* More blocks for the beginning. */\n if (byte_ix < prologue_length) {\n block_switch_cost *= 0.77 + multiplier * (double)byte_ix;\n }\n for (k = 0; k < num_histograms; ++k) {\n cost[k] -= min_cost;\n if (cost[k] >= block_switch_cost) {\n const uint8_t mask = (uint8_t)(1u << (k & 7));\n cost[k] = block_switch_cost;\n BROTLI_DCHECK((k >> 3) < bitmap_len);\n switch_signal[ix + (k >> 3)] |= mask;\n }\n }\n }\n\n byte_ix = length - 1;\n { /* Trace back from the last position and switch at the marked places. */\n size_t ix = byte_ix * bitmap_len;\n uint8_t cur_id = block_id[byte_ix];\n while (byte_ix > 0) {\n const uint8_t mask = (uint8_t)(1u << (cur_id & 7));\n BROTLI_DCHECK(((size_t)cur_id >> 3) < bitmap_len);\n --byte_ix;\n ix -= bitmap_len;\n if (switch_signal[ix + (cur_id >> 3)] & mask) {\n if (cur_id != block_id[byte_ix]) {\n cur_id = block_id[byte_ix];\n ++num_blocks;\n }\n }\n block_id[byte_ix] = cur_id;\n }\n }\n return num_blocks;\n}\n\nstatic size_t FN(RemapBlockIds)(uint8_t* block_ids, const size_t length,\n uint16_t* new_id, const size_t num_histograms) {\n static const uint16_t kInvalidId = 256;\n uint16_t next_id = 0;\n size_t i;\n for (i = 0; i < num_histograms; ++i) {\n new_id[i] = kInvalidId;\n }\n for (i = 0; i < length; ++i) {\n BROTLI_DCHECK(block_ids[i] < num_histograms);\n if (new_id[block_ids[i]] == kInvalidId) {\n new_id[block_ids[i]] = next_id++;\n }\n }\n for (i = 0; i < length; ++i) {\n block_ids[i] = (uint8_t)new_id[block_ids[i]];\n BROTLI_DCHECK(block_ids[i] < num_histograms);\n }\n BROTLI_DCHECK(next_id <= num_histograms);\n return next_id;\n}\n\nstatic void FN(BuildBlockHistograms)(const DataType* data, const size_t length,\n const uint8_t* block_ids,\n const size_t num_histograms,\n HistogramType* histograms) {\n size_t i;\n FN(ClearHistograms)(histograms, num_histograms);\n for (i = 0; i < length; ++i) {\n FN(HistogramAdd)(&histograms[block_ids[i]], data[i]);\n }\n}\n\n/* Given the initial partitioning build partitioning with limited number\n * of histograms (and block types). */\nstatic void FN(ClusterBlocks)(MemoryManager* m,\n const DataType* data, const size_t length,\n const size_t num_blocks,\n uint8_t* block_ids,\n BlockSplit* split) {\n uint32_t* histogram_symbols = BROTLI_ALLOC(m, uint32_t, num_blocks);\n uint32_t* u32 =\n BROTLI_ALLOC(m, uint32_t, num_blocks + 4 * HISTOGRAMS_PER_BATCH);\n const size_t expected_num_clusters = CLUSTERS_PER_BATCH *\n (num_blocks + HISTOGRAMS_PER_BATCH - 1) / HISTOGRAMS_PER_BATCH;\n size_t all_histograms_size = 0;\n size_t all_histograms_capacity = expected_num_clusters;\n HistogramType* all_histograms =\n BROTLI_ALLOC(m, HistogramType, all_histograms_capacity);\n size_t cluster_size_size = 0;\n size_t cluster_size_capacity = expected_num_clusters;\n uint32_t* cluster_size = BROTLI_ALLOC(m, uint32_t, cluster_size_capacity);\n size_t num_clusters = 0;\n HistogramType* histograms = BROTLI_ALLOC(m, HistogramType,\n BROTLI_MIN(size_t, num_blocks, HISTOGRAMS_PER_BATCH));\n size_t max_num_pairs =\n HISTOGRAMS_PER_BATCH * HISTOGRAMS_PER_BATCH / 2;\n size_t pairs_capacity = max_num_pairs + 1;\n HistogramPair* pairs = BROTLI_ALLOC(m, HistogramPair, pairs_capacity);\n size_t pos = 0;\n uint32_t* clusters;\n size_t num_final_clusters;\n static const uint32_t kInvalidIndex = BROTLI_UINT32_MAX;\n uint32_t* new_index;\n size_t i;\n uint32_t* BROTLI_RESTRICT const sizes =\n u32 ? (u32 + 0 * HISTOGRAMS_PER_BATCH) : NULL;\n uint32_t* BROTLI_RESTRICT const new_clusters =\n u32 ? (u32 + 1 * HISTOGRAMS_PER_BATCH) : NULL;\n uint32_t* BROTLI_RESTRICT const symbols =\n u32 ? (u32 + 2 * HISTOGRAMS_PER_BATCH) : NULL;\n uint32_t* BROTLI_RESTRICT const remap =\n u32 ? (u32 + 3 * HISTOGRAMS_PER_BATCH) : NULL;\n uint32_t* BROTLI_RESTRICT const block_lengths =\n u32 ? (u32 + 4 * HISTOGRAMS_PER_BATCH) : NULL;\n /* TODO(eustas): move to arena? */\n HistogramType* tmp = BROTLI_ALLOC(m, HistogramType, 2);\n\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(histogram_symbols) ||\n BROTLI_IS_NULL(u32) || BROTLI_IS_NULL(all_histograms) ||\n BROTLI_IS_NULL(cluster_size) || BROTLI_IS_NULL(histograms) ||\n BROTLI_IS_NULL(pairs) || BROTLI_IS_NULL(tmp)) {\n return;\n }\n\n memset(u32, 0, (num_blocks + 4 * HISTOGRAMS_PER_BATCH) * sizeof(uint32_t));\n\n /* Calculate block lengths (convert repeating values -> series length). */\n {\n size_t block_idx = 0;\n for (i = 0; i < length; ++i) {\n BROTLI_DCHECK(block_idx < num_blocks);\n ++block_lengths[block_idx];\n if (i + 1 == length || block_ids[i] != block_ids[i + 1]) {\n ++block_idx;\n }\n }\n BROTLI_DCHECK(block_idx == num_blocks);\n }\n\n /* Pre-cluster blocks (cluster batches). */\n for (i = 0; i < num_blocks; i += HISTOGRAMS_PER_BATCH) {\n const size_t num_to_combine =\n BROTLI_MIN(size_t, num_blocks - i, HISTOGRAMS_PER_BATCH);\n size_t num_new_clusters;\n size_t j;\n for (j = 0; j < num_to_combine; ++j) {\n size_t k;\n size_t block_length = block_lengths[i + j];\n FN(HistogramClear)(&histograms[j]);\n for (k = 0; k < block_length; ++k) {\n FN(HistogramAdd)(&histograms[j], data[pos++]);\n }\n histograms[j].bit_cost_ = FN(BrotliPopulationCost)(&histograms[j]);\n new_clusters[j] = (uint32_t)j;\n symbols[j] = (uint32_t)j;\n sizes[j] = 1;\n }\n num_new_clusters = FN(BrotliHistogramCombine)(\n histograms, tmp, sizes, symbols, new_clusters, pairs, num_to_combine,\n num_to_combine, HISTOGRAMS_PER_BATCH, max_num_pairs);\n BROTLI_ENSURE_CAPACITY(m, HistogramType, all_histograms,\n all_histograms_capacity, all_histograms_size + num_new_clusters);\n BROTLI_ENSURE_CAPACITY(m, uint32_t, cluster_size,\n cluster_size_capacity, cluster_size_size + num_new_clusters);\n if (BROTLI_IS_OOM(m)) return;\n for (j = 0; j < num_new_clusters; ++j) {\n all_histograms[all_histograms_size++] = histograms[new_clusters[j]];\n cluster_size[cluster_size_size++] = sizes[new_clusters[j]];\n remap[new_clusters[j]] = (uint32_t)j;\n }\n for (j = 0; j < num_to_combine; ++j) {\n histogram_symbols[i + j] = (uint32_t)num_clusters + remap[symbols[j]];\n }\n num_clusters += num_new_clusters;\n BROTLI_DCHECK(num_clusters == cluster_size_size);\n BROTLI_DCHECK(num_clusters == all_histograms_size);\n }\n BROTLI_FREE(m, histograms);\n\n /* Final clustering. */\n max_num_pairs =\n BROTLI_MIN(size_t, 64 * num_clusters, (num_clusters / 2) * num_clusters);\n if (pairs_capacity < max_num_pairs + 1) {\n BROTLI_FREE(m, pairs);\n pairs = BROTLI_ALLOC(m, HistogramPair, max_num_pairs + 1);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(pairs)) return;\n }\n clusters = BROTLI_ALLOC(m, uint32_t, num_clusters);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(clusters)) return;\n for (i = 0; i < num_clusters; ++i) {\n clusters[i] = (uint32_t)i;\n }\n num_final_clusters = FN(BrotliHistogramCombine)(\n all_histograms, tmp, cluster_size, histogram_symbols, clusters, pairs,\n num_clusters, num_blocks, BROTLI_MAX_NUMBER_OF_BLOCK_TYPES,\n max_num_pairs);\n BROTLI_FREE(m, pairs);\n BROTLI_FREE(m, cluster_size);\n\n /* Assign blocks to final histograms. */\n new_index = BROTLI_ALLOC(m, uint32_t, num_clusters);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_index)) return;\n for (i = 0; i < num_clusters; ++i) new_index[i] = kInvalidIndex;\n pos = 0;\n {\n uint32_t next_index = 0;\n for (i = 0; i < num_blocks; ++i) {\n size_t j;\n uint32_t best_out;\n double best_bits;\n FN(HistogramClear)(tmp);\n for (j = 0; j < block_lengths[i]; ++j) {\n FN(HistogramAdd)(tmp, data[pos++]);\n }\n /* Among equally good histograms prefer last used. */\n /* TODO(eustas): should we give a block-switch discount here? */\n best_out = (i == 0) ? histogram_symbols[0] : histogram_symbols[i - 1];\n best_bits = FN(BrotliHistogramBitCostDistance)(\n tmp, &all_histograms[best_out], tmp + 1);\n for (j = 0; j < num_final_clusters; ++j) {\n const double cur_bits = FN(BrotliHistogramBitCostDistance)(\n tmp, &all_histograms[clusters[j]], tmp + 1);\n if (cur_bits < best_bits) {\n best_bits = cur_bits;\n best_out = clusters[j];\n }\n }\n histogram_symbols[i] = best_out;\n if (new_index[best_out] == kInvalidIndex) {\n new_index[best_out] = next_index++;\n }\n }\n }\n BROTLI_FREE(m, tmp);\n BROTLI_FREE(m, clusters);\n BROTLI_FREE(m, all_histograms);\n BROTLI_ENSURE_CAPACITY(\n m, uint8_t, split->types, split->types_alloc_size, num_blocks);\n BROTLI_ENSURE_CAPACITY(\n m, uint32_t, split->lengths, split->lengths_alloc_size, num_blocks);\n if (BROTLI_IS_OOM(m)) return;\n\n /* Rewrite final assignment to block-split. There might be less blocks\n * than |num_blocks| due to clustering. */\n {\n uint32_t cur_length = 0;\n size_t block_idx = 0;\n uint8_t max_type = 0;\n for (i = 0; i < num_blocks; ++i) {\n cur_length += block_lengths[i];\n if (i + 1 == num_blocks ||\n histogram_symbols[i] != histogram_symbols[i + 1]) {\n const uint8_t id = (uint8_t)new_index[histogram_symbols[i]];\n split->types[block_idx] = id;\n split->lengths[block_idx] = cur_length;\n max_type = BROTLI_MAX(uint8_t, max_type, id);\n cur_length = 0;\n ++block_idx;\n }\n }\n split->num_blocks = block_idx;\n split->num_types = (size_t)max_type + 1;\n }\n BROTLI_FREE(m, new_index);\n BROTLI_FREE(m, u32);\n BROTLI_FREE(m, histogram_symbols);\n}\n\n/* Create BlockSplit (partitioning) given the limits, estimates and \"effort\"\n * parameters.\n *\n * NB: max_histograms is often less than number of histograms allowed by format;\n * this is done intentionally, to save some \"space\" for context-aware\n * clustering (here entropy is estimated for context-free symbols). */\nstatic void FN(SplitByteVector)(MemoryManager* m,\n const DataType* data, const size_t length,\n const size_t symbols_per_histogram,\n const size_t max_histograms,\n const size_t sampling_stride_length,\n const double block_switch_cost,\n const BrotliEncoderParams* params,\n BlockSplit* split) {\n const size_t data_size = FN(HistogramDataSize)();\n HistogramType* histograms;\n HistogramType* tmp;\n /* Calculate number of histograms; initial estimate is one histogram per\n * specified amount of symbols; however, this value is capped. */\n size_t num_histograms = length / symbols_per_histogram + 1;\n if (num_histograms > max_histograms) {\n num_histograms = max_histograms;\n }\n\n /* Corner case: no input. */\n if (length == 0) {\n split->num_types = 1;\n return;\n }\n\n if (length < kMinLengthForBlockSplitting) {\n BROTLI_ENSURE_CAPACITY(m, uint8_t,\n split->types, split->types_alloc_size, split->num_blocks + 1);\n BROTLI_ENSURE_CAPACITY(m, uint32_t,\n split->lengths, split->lengths_alloc_size, split->num_blocks + 1);\n if (BROTLI_IS_OOM(m)) return;\n split->num_types = 1;\n split->types[split->num_blocks] = 0;\n split->lengths[split->num_blocks] = (uint32_t)length;\n split->num_blocks++;\n return;\n }\n histograms = BROTLI_ALLOC(m, HistogramType, num_histograms + 1);\n tmp = histograms + num_histograms;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(histograms)) return;\n /* Find good entropy codes. */\n FN(InitialEntropyCodes)(data, length,\n sampling_stride_length,\n num_histograms, histograms);\n FN(RefineEntropyCodes)(data, length,\n sampling_stride_length,\n num_histograms, histograms, tmp);\n {\n /* Find a good path through literals with the good entropy codes. */\n uint8_t* block_ids = BROTLI_ALLOC(m, uint8_t, length);\n size_t num_blocks = 0;\n const size_t bitmaplen = (num_histograms + 7) >> 3;\n double* insert_cost = BROTLI_ALLOC(m, double, data_size * num_histograms);\n double* cost = BROTLI_ALLOC(m, double, num_histograms);\n uint8_t* switch_signal = BROTLI_ALLOC(m, uint8_t, length * bitmaplen);\n uint16_t* new_id = BROTLI_ALLOC(m, uint16_t, num_histograms);\n const size_t iters = params->quality < HQ_ZOPFLIFICATION_QUALITY ? 3 : 10;\n size_t i;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(block_ids) ||\n BROTLI_IS_NULL(insert_cost) || BROTLI_IS_NULL(cost) ||\n BROTLI_IS_NULL(switch_signal) || BROTLI_IS_NULL(new_id)) {\n return;\n }\n for (i = 0; i < iters; ++i) {\n num_blocks = FN(FindBlocks)(data, length,\n block_switch_cost,\n num_histograms, histograms,\n insert_cost, cost, switch_signal,\n block_ids);\n num_histograms = FN(RemapBlockIds)(block_ids, length,\n new_id, num_histograms);\n FN(BuildBlockHistograms)(data, length, block_ids,\n num_histograms, histograms);\n }\n BROTLI_FREE(m, insert_cost);\n BROTLI_FREE(m, cost);\n BROTLI_FREE(m, switch_signal);\n BROTLI_FREE(m, new_id);\n BROTLI_FREE(m, histograms);\n FN(ClusterBlocks)(m, data, length, num_blocks, block_ids, split);\n if (BROTLI_IS_OOM(m)) return;\n BROTLI_FREE(m, block_ids);\n }\n}\n\n#undef HistogramType\n" }, { "path": "libs/brotli/enc/brotli_bit_stream.c", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Brotli bit stream functions to support the low level format. There are no\n compression algorithms here, just the right ordering of bits to match the\n specs. */\n\n#include \"brotli_bit_stream.h\"\n\n#include \"../common/constants.h\"\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"entropy_encode.h\"\n#include \"entropy_encode_static.h\"\n#include \"fast_log.h\"\n#include \"histogram.h\"\n#include \"memory.h\"\n#include \"write_bits.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define MAX_HUFFMAN_TREE_SIZE (2 * BROTLI_NUM_COMMAND_SYMBOLS + 1)\n/* The maximum size of Huffman dictionary for distances assuming that\n NPOSTFIX = 0 and NDIRECT = 0. */\n#define MAX_SIMPLE_DISTANCE_ALPHABET_SIZE \\\n BROTLI_DISTANCE_ALPHABET_SIZE(0, 0, BROTLI_LARGE_MAX_DISTANCE_BITS)\n/* MAX_SIMPLE_DISTANCE_ALPHABET_SIZE == 140 */\n\nstatic BROTLI_INLINE uint32_t BlockLengthPrefixCode(uint32_t len) {\n uint32_t code = (len >= 177) ? (len >= 753 ? 20 : 14) : (len >= 41 ? 7 : 0);\n while (code < (BROTLI_NUM_BLOCK_LEN_SYMBOLS - 1) &&\n len >= _kBrotliPrefixCodeRanges[code + 1].offset) ++code;\n return code;\n}\n\nstatic BROTLI_INLINE void GetBlockLengthPrefixCode(uint32_t len, size_t* code,\n uint32_t* n_extra, uint32_t* extra) {\n *code = BlockLengthPrefixCode(len);\n *n_extra = _kBrotliPrefixCodeRanges[*code].nbits;\n *extra = len - _kBrotliPrefixCodeRanges[*code].offset;\n}\n\ntypedef struct BlockTypeCodeCalculator {\n size_t last_type;\n size_t second_last_type;\n} BlockTypeCodeCalculator;\n\nstatic void InitBlockTypeCodeCalculator(BlockTypeCodeCalculator* self) {\n self->last_type = 1;\n self->second_last_type = 0;\n}\n\nstatic BROTLI_INLINE size_t NextBlockTypeCode(\n BlockTypeCodeCalculator* calculator, uint8_t type) {\n size_t type_code = (type == calculator->last_type + 1) ? 1u :\n (type == calculator->second_last_type) ? 0u : type + 2u;\n calculator->second_last_type = calculator->last_type;\n calculator->last_type = type;\n return type_code;\n}\n\n/* |nibblesbits| represents the 2 bits to encode MNIBBLES (0-3)\n REQUIRES: length > 0\n REQUIRES: length <= (1 << 24) */\nstatic void BrotliEncodeMlen(size_t length, uint64_t* bits,\n size_t* numbits, uint64_t* nibblesbits) {\n size_t lg = (length == 1) ? 1 : Log2FloorNonZero((uint32_t)(length - 1)) + 1;\n size_t mnibbles = (lg < 16 ? 16 : (lg + 3)) / 4;\n BROTLI_DCHECK(length > 0);\n BROTLI_DCHECK(length <= (1 << 24));\n BROTLI_DCHECK(lg <= 24);\n *nibblesbits = mnibbles - 4;\n *numbits = mnibbles * 4;\n *bits = length - 1;\n}\n\nstatic BROTLI_INLINE void StoreCommandExtra(\n const Command* cmd, size_t* storage_ix, uint8_t* storage) {\n uint32_t copylen_code = CommandCopyLenCode(cmd);\n uint16_t inscode = GetInsertLengthCode(cmd->insert_len_);\n uint16_t copycode = GetCopyLengthCode(copylen_code);\n uint32_t insnumextra = GetInsertExtra(inscode);\n uint64_t insextraval = cmd->insert_len_ - GetInsertBase(inscode);\n uint64_t copyextraval = copylen_code - GetCopyBase(copycode);\n uint64_t bits = (copyextraval << insnumextra) | insextraval;\n BrotliWriteBits(\n insnumextra + GetCopyExtra(copycode), bits, storage_ix, storage);\n}\n\n/* Data structure that stores almost everything that is needed to encode each\n block switch command. */\ntypedef struct BlockSplitCode {\n BlockTypeCodeCalculator type_code_calculator;\n uint8_t type_depths[BROTLI_MAX_BLOCK_TYPE_SYMBOLS];\n uint16_t type_bits[BROTLI_MAX_BLOCK_TYPE_SYMBOLS];\n uint8_t length_depths[BROTLI_NUM_BLOCK_LEN_SYMBOLS];\n uint16_t length_bits[BROTLI_NUM_BLOCK_LEN_SYMBOLS];\n} BlockSplitCode;\n\n/* Stores a number between 0 and 255. */\nstatic void StoreVarLenUint8(size_t n, size_t* storage_ix, uint8_t* storage) {\n if (n == 0) {\n BrotliWriteBits(1, 0, storage_ix, storage);\n } else {\n size_t nbits = Log2FloorNonZero(n);\n BrotliWriteBits(1, 1, storage_ix, storage);\n BrotliWriteBits(3, nbits, storage_ix, storage);\n BrotliWriteBits(nbits, n - ((size_t)1 << nbits), storage_ix, storage);\n }\n}\n\n/* Stores the compressed meta-block header.\n REQUIRES: length > 0\n REQUIRES: length <= (1 << 24) */\nstatic void StoreCompressedMetaBlockHeader(BROTLI_BOOL is_final_block,\n size_t length,\n size_t* storage_ix,\n uint8_t* storage) {\n uint64_t lenbits;\n size_t nlenbits;\n uint64_t nibblesbits;\n\n /* Write ISLAST bit. */\n BrotliWriteBits(1, (uint64_t)is_final_block, storage_ix, storage);\n /* Write ISEMPTY bit. */\n if (is_final_block) {\n BrotliWriteBits(1, 0, storage_ix, storage);\n }\n\n BrotliEncodeMlen(length, &lenbits, &nlenbits, &nibblesbits);\n BrotliWriteBits(2, nibblesbits, storage_ix, storage);\n BrotliWriteBits(nlenbits, lenbits, storage_ix, storage);\n\n if (!is_final_block) {\n /* Write ISUNCOMPRESSED bit. */\n BrotliWriteBits(1, 0, storage_ix, storage);\n }\n}\n\n/* Stores the uncompressed meta-block header.\n REQUIRES: length > 0\n REQUIRES: length <= (1 << 24) */\nstatic void BrotliStoreUncompressedMetaBlockHeader(size_t length,\n size_t* storage_ix,\n uint8_t* storage) {\n uint64_t lenbits;\n size_t nlenbits;\n uint64_t nibblesbits;\n\n /* Write ISLAST bit.\n Uncompressed block cannot be the last one, so set to 0. */\n BrotliWriteBits(1, 0, storage_ix, storage);\n BrotliEncodeMlen(length, &lenbits, &nlenbits, &nibblesbits);\n BrotliWriteBits(2, nibblesbits, storage_ix, storage);\n BrotliWriteBits(nlenbits, lenbits, storage_ix, storage);\n /* Write ISUNCOMPRESSED bit. */\n BrotliWriteBits(1, 1, storage_ix, storage);\n}\n\nstatic void BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask(\n const int num_codes, const uint8_t* code_length_bitdepth,\n size_t* storage_ix, uint8_t* storage) {\n static const BROTLI_MODEL(\"small\")\n uint8_t kStorageOrder[BROTLI_CODE_LENGTH_CODES] = {\n 1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15\n };\n /* The bit lengths of the Huffman code over the code length alphabet\n are compressed with the following static Huffman code:\n Symbol Code\n ------ ----\n 0 00\n 1 1110\n 2 110\n 3 01\n 4 10\n 5 1111 */\n static const BROTLI_MODEL(\"small\")\n uint8_t kHuffmanBitLengthHuffmanCodeSymbols[6] = {\n 0, 7, 3, 2, 1, 15\n };\n static const BROTLI_MODEL(\"small\")\n uint8_t kHuffmanBitLengthHuffmanCodeBitLengths[6] = {\n 2, 4, 3, 2, 2, 4\n };\n\n size_t skip_some = 0; /* skips none. */\n\n /* Throw away trailing zeros: */\n size_t codes_to_store = BROTLI_CODE_LENGTH_CODES;\n if (num_codes > 1) {\n for (; codes_to_store > 0; --codes_to_store) {\n if (code_length_bitdepth[kStorageOrder[codes_to_store - 1]] != 0) {\n break;\n }\n }\n }\n if (code_length_bitdepth[kStorageOrder[0]] == 0 &&\n code_length_bitdepth[kStorageOrder[1]] == 0) {\n skip_some = 2; /* skips two. */\n if (code_length_bitdepth[kStorageOrder[2]] == 0) {\n skip_some = 3; /* skips three. */\n }\n }\n BrotliWriteBits(2, skip_some, storage_ix, storage);\n {\n size_t i;\n for (i = skip_some; i < codes_to_store; ++i) {\n size_t l = code_length_bitdepth[kStorageOrder[i]];\n BrotliWriteBits(kHuffmanBitLengthHuffmanCodeBitLengths[l],\n kHuffmanBitLengthHuffmanCodeSymbols[l], storage_ix, storage);\n }\n }\n}\n\nstatic void BrotliStoreHuffmanTreeToBitMask(\n const size_t huffman_tree_size, const uint8_t* huffman_tree,\n const uint8_t* huffman_tree_extra_bits, const uint8_t* code_length_bitdepth,\n const uint16_t* code_length_bitdepth_symbols,\n size_t* BROTLI_RESTRICT storage_ix, uint8_t* BROTLI_RESTRICT storage) {\n size_t i;\n for (i = 0; i < huffman_tree_size; ++i) {\n size_t ix = huffman_tree[i];\n BrotliWriteBits(code_length_bitdepth[ix], code_length_bitdepth_symbols[ix],\n storage_ix, storage);\n /* Extra bits */\n switch (ix) {\n case BROTLI_REPEAT_PREVIOUS_CODE_LENGTH:\n BrotliWriteBits(2, huffman_tree_extra_bits[i], storage_ix, storage);\n break;\n case BROTLI_REPEAT_ZERO_CODE_LENGTH:\n BrotliWriteBits(3, huffman_tree_extra_bits[i], storage_ix, storage);\n break;\n }\n }\n}\n\nstatic void StoreSimpleHuffmanTree(const uint8_t* depths,\n size_t symbols[4],\n size_t num_symbols,\n size_t max_bits,\n size_t* storage_ix, uint8_t* storage) {\n /* value of 1 indicates a simple Huffman code */\n BrotliWriteBits(2, 1, storage_ix, storage);\n BrotliWriteBits(2, num_symbols - 1, storage_ix, storage); /* NSYM - 1 */\n\n {\n /* Sort */\n size_t i;\n for (i = 0; i < num_symbols; i++) {\n size_t j;\n for (j = i + 1; j < num_symbols; j++) {\n if (depths[symbols[j]] < depths[symbols[i]]) {\n BROTLI_SWAP(size_t, symbols, j, i);\n }\n }\n }\n }\n\n if (num_symbols == 2) {\n BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);\n } else if (num_symbols == 3) {\n BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);\n } else {\n BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[3], storage_ix, storage);\n /* tree-select */\n BrotliWriteBits(1, depths[symbols[0]] == 1 ? 1 : 0, storage_ix, storage);\n }\n}\n\n/* num = alphabet size\n depths = symbol depths */\nvoid BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,\n HuffmanTree* tree,\n size_t* storage_ix, uint8_t* storage) {\n /* Write the Huffman tree into the brotli-representation.\n The command alphabet is the largest, so this allocation will fit all\n alphabets. */\n /* TODO(eustas): fix me */\n uint8_t huffman_tree[BROTLI_NUM_COMMAND_SYMBOLS];\n uint8_t huffman_tree_extra_bits[BROTLI_NUM_COMMAND_SYMBOLS];\n size_t huffman_tree_size = 0;\n uint8_t code_length_bitdepth[BROTLI_CODE_LENGTH_CODES] = { 0 };\n uint16_t code_length_bitdepth_symbols[BROTLI_CODE_LENGTH_CODES];\n uint32_t huffman_tree_histogram[BROTLI_CODE_LENGTH_CODES] = { 0 };\n size_t i;\n int num_codes = 0;\n size_t code = 0;\n\n BROTLI_DCHECK(num <= BROTLI_NUM_COMMAND_SYMBOLS);\n\n BrotliWriteHuffmanTree(depths, num, &huffman_tree_size, huffman_tree,\n huffman_tree_extra_bits);\n\n /* Calculate the statistics of the Huffman tree in brotli-representation. */\n for (i = 0; i < huffman_tree_size; ++i) {\n ++huffman_tree_histogram[huffman_tree[i]];\n }\n\n for (i = 0; i < BROTLI_CODE_LENGTH_CODES; ++i) {\n if (huffman_tree_histogram[i]) {\n if (num_codes == 0) {\n code = i;\n num_codes = 1;\n } else if (num_codes == 1) {\n num_codes = 2;\n break;\n }\n }\n }\n\n /* Calculate another Huffman tree to use for compressing both the\n earlier Huffman tree with. */\n BrotliCreateHuffmanTree(huffman_tree_histogram, BROTLI_CODE_LENGTH_CODES,\n 5, tree, code_length_bitdepth);\n BrotliConvertBitDepthsToSymbols(code_length_bitdepth,\n BROTLI_CODE_LENGTH_CODES,\n code_length_bitdepth_symbols);\n\n /* Now, we have all the data, let's start storing it */\n BrotliStoreHuffmanTreeOfHuffmanTreeToBitMask(num_codes, code_length_bitdepth,\n storage_ix, storage);\n\n if (num_codes == 1) {\n code_length_bitdepth[code] = 0;\n }\n\n /* Store the real Huffman tree now. */\n BrotliStoreHuffmanTreeToBitMask(huffman_tree_size,\n huffman_tree,\n huffman_tree_extra_bits,\n code_length_bitdepth,\n code_length_bitdepth_symbols,\n storage_ix, storage);\n}\n\n/* Builds a Huffman tree from histogram[0:length] into depth[0:length] and\n bits[0:length] and stores the encoded tree to the bit stream. */\nstatic void BuildAndStoreHuffmanTree(const uint32_t* histogram,\n const size_t histogram_length,\n const size_t alphabet_size,\n HuffmanTree* tree,\n uint8_t* depth,\n uint16_t* bits,\n size_t* storage_ix,\n uint8_t* storage) {\n size_t count = 0;\n size_t s4[4] = { 0 };\n size_t i;\n size_t max_bits = 0;\n for (i = 0; i < histogram_length; i++) {\n if (histogram[i]) {\n if (count < 4) {\n s4[count] = i;\n } else if (count > 4) {\n break;\n }\n count++;\n }\n }\n\n {\n size_t max_bits_counter = alphabet_size - 1;\n while (max_bits_counter) {\n max_bits_counter >>= 1;\n ++max_bits;\n }\n }\n\n if (count <= 1) {\n BrotliWriteBits(4, 1, storage_ix, storage);\n BrotliWriteBits(max_bits, s4[0], storage_ix, storage);\n depth[s4[0]] = 0;\n bits[s4[0]] = 0;\n return;\n }\n\n memset(depth, 0, histogram_length * sizeof(depth[0]));\n BrotliCreateHuffmanTree(histogram, histogram_length, 15, tree, depth);\n BrotliConvertBitDepthsToSymbols(depth, histogram_length, bits);\n\n if (count <= 4) {\n StoreSimpleHuffmanTree(depth, s4, count, max_bits, storage_ix, storage);\n } else {\n BrotliStoreHuffmanTree(depth, histogram_length, tree, storage_ix, storage);\n }\n}\n\nstatic BROTLI_INLINE BROTLI_BOOL SortHuffmanTree(\n const HuffmanTree* v0, const HuffmanTree* v1) {\n return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_);\n}\n\nvoid BrotliBuildAndStoreHuffmanTreeFast(HuffmanTree* tree,\n const uint32_t* histogram,\n const size_t histogram_total,\n const size_t max_bits,\n uint8_t* depth, uint16_t* bits,\n size_t* storage_ix,\n uint8_t* storage) {\n size_t count = 0;\n size_t symbols[4] = { 0 };\n size_t length = 0;\n size_t total = histogram_total;\n while (total != 0) {\n if (histogram[length]) {\n if (count < 4) {\n symbols[count] = length;\n }\n ++count;\n total -= histogram[length];\n }\n ++length;\n }\n\n if (count <= 1) {\n BrotliWriteBits(4, 1, storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);\n depth[symbols[0]] = 0;\n bits[symbols[0]] = 0;\n return;\n }\n\n memset(depth, 0, length * sizeof(depth[0]));\n {\n uint32_t count_limit;\n for (count_limit = 1; ; count_limit *= 2) {\n HuffmanTree* node = tree;\n size_t l;\n for (l = length; l != 0;) {\n --l;\n if (histogram[l]) {\n if (BROTLI_PREDICT_TRUE(histogram[l] >= count_limit)) {\n InitHuffmanTree(node, histogram[l], -1, (int16_t)l);\n } else {\n InitHuffmanTree(node, count_limit, -1, (int16_t)l);\n }\n ++node;\n }\n }\n {\n const int n = (int)(node - tree);\n HuffmanTree sentinel;\n int i = 0; /* Points to the next leaf node. */\n int j = n + 1; /* Points to the next non-leaf node. */\n int k;\n\n SortHuffmanTreeItems(tree, (size_t)n, SortHuffmanTree);\n /* The nodes are:\n [0, n): the sorted leaf nodes that we start with.\n [n]: we add a sentinel here.\n [n + 1, 2n): new parent nodes are added here, starting from\n (n+1). These are naturally in ascending order.\n [2n]: we add a sentinel at the end as well.\n There will be (2n+1) elements at the end. */\n InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1);\n *node++ = sentinel;\n *node++ = sentinel;\n\n for (k = n - 1; k > 0; --k) {\n int left, right;\n if (tree[i].total_count_ <= tree[j].total_count_) {\n left = i;\n ++i;\n } else {\n left = j;\n ++j;\n }\n if (tree[i].total_count_ <= tree[j].total_count_) {\n right = i;\n ++i;\n } else {\n right = j;\n ++j;\n }\n /* The sentinel node becomes the parent node. */\n node[-1].total_count_ =\n tree[left].total_count_ + tree[right].total_count_;\n node[-1].index_left_ = (int16_t)left;\n node[-1].index_right_or_value_ = (int16_t)right;\n /* Add back the last sentinel node. */\n *node++ = sentinel;\n }\n if (BrotliSetDepth(2 * n - 1, tree, depth, 14)) {\n /* We need to pack the Huffman tree in 14 bits. If this was not\n successful, add fake entities to the lowest values and retry. */\n break;\n }\n }\n }\n }\n BrotliConvertBitDepthsToSymbols(depth, length, bits);\n if (count <= 4) {\n size_t i;\n /* value of 1 indicates a simple Huffman code */\n BrotliWriteBits(2, 1, storage_ix, storage);\n BrotliWriteBits(2, count - 1, storage_ix, storage); /* NSYM - 1 */\n\n /* Sort */\n for (i = 0; i < count; i++) {\n size_t j;\n for (j = i + 1; j < count; j++) {\n if (depth[symbols[j]] < depth[symbols[i]]) {\n BROTLI_SWAP(size_t, symbols, j, i);\n }\n }\n }\n\n if (count == 2) {\n BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);\n } else if (count == 3) {\n BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);\n } else {\n BrotliWriteBits(max_bits, symbols[0], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[1], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[2], storage_ix, storage);\n BrotliWriteBits(max_bits, symbols[3], storage_ix, storage);\n /* tree-select */\n BrotliWriteBits(1, depth[symbols[0]] == 1 ? 1 : 0, storage_ix, storage);\n }\n } else {\n uint8_t previous_value = 8;\n size_t i;\n /* Complex Huffman Tree */\n StoreStaticCodeLengthCode(storage_ix, storage);\n\n /* Actual RLE coding. */\n for (i = 0; i < length;) {\n const uint8_t value = depth[i];\n size_t reps = 1;\n size_t k;\n for (k = i + 1; k < length && depth[k] == value; ++k) {\n ++reps;\n }\n i += reps;\n if (value == 0) {\n BrotliWriteBits(kZeroRepsDepth[reps], kZeroRepsBits[reps],\n storage_ix, storage);\n } else {\n if (previous_value != value) {\n BrotliWriteBits(kCodeLengthDepth[value], kCodeLengthBits[value],\n storage_ix, storage);\n --reps;\n }\n if (reps < 3) {\n while (reps != 0) {\n reps--;\n BrotliWriteBits(kCodeLengthDepth[value], kCodeLengthBits[value],\n storage_ix, storage);\n }\n } else {\n reps -= 3;\n BrotliWriteBits(kNonZeroRepsDepth[reps], kNonZeroRepsBits[reps],\n storage_ix, storage);\n }\n previous_value = value;\n }\n }\n }\n}\n\nstatic size_t IndexOf(const uint8_t* v, size_t v_size, uint8_t value) {\n size_t i = 0;\n for (; i < v_size; ++i) {\n if (v[i] == value) return i;\n }\n return i;\n}\n\nstatic void MoveToFront(uint8_t* v, size_t index) {\n uint8_t value = v[index];\n size_t i;\n for (i = index; i != 0; --i) {\n v[i] = v[i - 1];\n }\n v[0] = value;\n}\n\nstatic void MoveToFrontTransform(const uint32_t* BROTLI_RESTRICT v_in,\n const size_t v_size,\n uint32_t* v_out) {\n size_t i;\n uint8_t mtf[256];\n uint32_t max_value;\n if (v_size == 0) {\n return;\n }\n max_value = v_in[0];\n for (i = 1; i < v_size; ++i) {\n if (v_in[i] > max_value) max_value = v_in[i];\n }\n BROTLI_DCHECK(max_value < 256u);\n for (i = 0; i <= max_value; ++i) {\n mtf[i] = (uint8_t)i;\n }\n {\n size_t mtf_size = max_value + 1;\n for (i = 0; i < v_size; ++i) {\n size_t index = IndexOf(mtf, mtf_size, (uint8_t)v_in[i]);\n BROTLI_DCHECK(index < mtf_size);\n v_out[i] = (uint32_t)index;\n MoveToFront(mtf, index);\n }\n }\n}\n\n/* Finds runs of zeros in v[0..in_size) and replaces them with a prefix code of\n the run length plus extra bits (lower 9 bits is the prefix code and the rest\n are the extra bits). Non-zero values in v[] are shifted by\n *max_length_prefix. Will not create prefix codes bigger than the initial\n value of *max_run_length_prefix. The prefix code of run length L is simply\n Log2Floor(L) and the number of extra bits is the same as the prefix code. */\nstatic void RunLengthCodeZeros(const size_t in_size,\n uint32_t* BROTLI_RESTRICT v, size_t* BROTLI_RESTRICT out_size,\n uint32_t* BROTLI_RESTRICT max_run_length_prefix) {\n uint32_t max_reps = 0;\n size_t i;\n uint32_t max_prefix;\n for (i = 0; i < in_size;) {\n uint32_t reps = 0;\n for (; i < in_size && v[i] != 0; ++i) ;\n for (; i < in_size && v[i] == 0; ++i) {\n ++reps;\n }\n max_reps = BROTLI_MAX(uint32_t, reps, max_reps);\n }\n max_prefix = max_reps > 0 ? Log2FloorNonZero(max_reps) : 0;\n max_prefix = BROTLI_MIN(uint32_t, max_prefix, *max_run_length_prefix);\n *max_run_length_prefix = max_prefix;\n *out_size = 0;\n for (i = 0; i < in_size;) {\n BROTLI_DCHECK(*out_size <= i);\n if (v[i] != 0) {\n v[*out_size] = v[i] + *max_run_length_prefix;\n ++i;\n ++(*out_size);\n } else {\n uint32_t reps = 1;\n size_t k;\n for (k = i + 1; k < in_size && v[k] == 0; ++k) {\n ++reps;\n }\n i += reps;\n while (reps != 0) {\n if (reps < (2u << max_prefix)) {\n uint32_t run_length_prefix = Log2FloorNonZero(reps);\n const uint32_t extra_bits = reps - (1u << run_length_prefix);\n v[*out_size] = run_length_prefix + (extra_bits << 9);\n ++(*out_size);\n break;\n } else {\n const uint32_t extra_bits = (1u << max_prefix) - 1u;\n v[*out_size] = max_prefix + (extra_bits << 9);\n reps -= (2u << max_prefix) - 1u;\n ++(*out_size);\n }\n }\n }\n }\n}\n\n#define SYMBOL_BITS 9\n\ntypedef struct EncodeContextMapArena {\n uint32_t histogram[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];\n uint8_t depths[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];\n uint16_t bits[BROTLI_MAX_CONTEXT_MAP_SYMBOLS];\n} EncodeContextMapArena;\n\nstatic void EncodeContextMap(MemoryManager* m,\n EncodeContextMapArena* arena,\n const uint32_t* context_map,\n size_t context_map_size,\n size_t num_clusters,\n HuffmanTree* tree,\n size_t* storage_ix, uint8_t* storage) {\n size_t i;\n uint32_t* rle_symbols;\n uint32_t max_run_length_prefix = 6;\n size_t num_rle_symbols = 0;\n uint32_t* BROTLI_RESTRICT const histogram = arena->histogram;\n static const uint32_t kSymbolMask = (1u << SYMBOL_BITS) - 1u;\n uint8_t* BROTLI_RESTRICT const depths = arena->depths;\n uint16_t* BROTLI_RESTRICT const bits = arena->bits;\n\n StoreVarLenUint8(num_clusters - 1, storage_ix, storage);\n\n if (num_clusters == 1) {\n return;\n }\n\n rle_symbols = BROTLI_ALLOC(m, uint32_t, context_map_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(rle_symbols)) return;\n MoveToFrontTransform(context_map, context_map_size, rle_symbols);\n RunLengthCodeZeros(context_map_size, rle_symbols,\n &num_rle_symbols, &max_run_length_prefix);\n memset(histogram, 0, sizeof(arena->histogram));\n for (i = 0; i < num_rle_symbols; ++i) {\n ++histogram[rle_symbols[i] & kSymbolMask];\n }\n {\n BROTLI_BOOL use_rle = TO_BROTLI_BOOL(max_run_length_prefix > 0);\n BrotliWriteBits(1, (uint64_t)use_rle, storage_ix, storage);\n if (use_rle) {\n BrotliWriteBits(4, max_run_length_prefix - 1, storage_ix, storage);\n }\n }\n BuildAndStoreHuffmanTree(histogram, num_clusters + max_run_length_prefix,\n num_clusters + max_run_length_prefix,\n tree, depths, bits, storage_ix, storage);\n for (i = 0; i < num_rle_symbols; ++i) {\n const uint32_t rle_symbol = rle_symbols[i] & kSymbolMask;\n const uint32_t extra_bits_val = rle_symbols[i] >> SYMBOL_BITS;\n BrotliWriteBits(depths[rle_symbol], bits[rle_symbol], storage_ix, storage);\n if (rle_symbol > 0 && rle_symbol <= max_run_length_prefix) {\n BrotliWriteBits(rle_symbol, extra_bits_val, storage_ix, storage);\n }\n }\n BrotliWriteBits(1, 1, storage_ix, storage); /* use move-to-front */\n BROTLI_FREE(m, rle_symbols);\n}\n\n/* Stores the block switch command with index block_ix to the bit stream. */\nstatic BROTLI_INLINE void StoreBlockSwitch(BlockSplitCode* code,\n const uint32_t block_len,\n const uint8_t block_type,\n BROTLI_BOOL is_first_block,\n size_t* storage_ix,\n uint8_t* storage) {\n size_t typecode = NextBlockTypeCode(&code->type_code_calculator, block_type);\n size_t lencode;\n uint32_t len_nextra;\n uint32_t len_extra;\n if (!is_first_block) {\n BrotliWriteBits(code->type_depths[typecode], code->type_bits[typecode],\n storage_ix, storage);\n }\n GetBlockLengthPrefixCode(block_len, &lencode, &len_nextra, &len_extra);\n\n BrotliWriteBits(code->length_depths[lencode], code->length_bits[lencode],\n storage_ix, storage);\n BrotliWriteBits(len_nextra, len_extra, storage_ix, storage);\n}\n\n/* Builds a BlockSplitCode data structure from the block split given by the\n vector of block types and block lengths and stores it to the bit stream. */\nstatic void BuildAndStoreBlockSplitCode(const uint8_t* types,\n const uint32_t* lengths,\n const size_t num_blocks,\n const size_t num_types,\n HuffmanTree* tree,\n BlockSplitCode* code,\n size_t* storage_ix,\n uint8_t* storage) {\n uint32_t type_histo[BROTLI_MAX_BLOCK_TYPE_SYMBOLS];\n uint32_t length_histo[BROTLI_NUM_BLOCK_LEN_SYMBOLS];\n size_t i;\n BlockTypeCodeCalculator type_code_calculator;\n memset(type_histo, 0, (num_types + 2) * sizeof(type_histo[0]));\n memset(length_histo, 0, sizeof(length_histo));\n InitBlockTypeCodeCalculator(&type_code_calculator);\n for (i = 0; i < num_blocks; ++i) {\n size_t type_code = NextBlockTypeCode(&type_code_calculator, types[i]);\n if (i != 0) ++type_histo[type_code];\n ++length_histo[BlockLengthPrefixCode(lengths[i])];\n }\n StoreVarLenUint8(num_types - 1, storage_ix, storage);\n if (num_types > 1) { /* TODO(eustas): else? could StoreBlockSwitch occur? */\n BuildAndStoreHuffmanTree(&type_histo[0], num_types + 2, num_types + 2, tree,\n &code->type_depths[0], &code->type_bits[0],\n storage_ix, storage);\n BuildAndStoreHuffmanTree(&length_histo[0], BROTLI_NUM_BLOCK_LEN_SYMBOLS,\n BROTLI_NUM_BLOCK_LEN_SYMBOLS,\n tree, &code->length_depths[0],\n &code->length_bits[0], storage_ix, storage);\n StoreBlockSwitch(code, lengths[0], types[0], 1, storage_ix, storage);\n }\n}\n\n/* Stores a context map where the histogram type is always the block type. */\nstatic void StoreTrivialContextMap(EncodeContextMapArena* arena,\n size_t num_types,\n size_t context_bits,\n HuffmanTree* tree,\n size_t* storage_ix,\n uint8_t* storage) {\n StoreVarLenUint8(num_types - 1, storage_ix, storage);\n if (num_types > 1) {\n size_t repeat_code = context_bits - 1u;\n size_t repeat_bits = (1u << repeat_code) - 1u;\n size_t alphabet_size = num_types + repeat_code;\n uint32_t* BROTLI_RESTRICT const histogram = arena->histogram;\n uint8_t* BROTLI_RESTRICT const depths = arena->depths;\n uint16_t* BROTLI_RESTRICT const bits = arena->bits;\n size_t i;\n memset(histogram, 0, alphabet_size * sizeof(histogram[0]));\n /* Write RLEMAX. */\n BrotliWriteBits(1, 1, storage_ix, storage);\n BrotliWriteBits(4, repeat_code - 1, storage_ix, storage);\n histogram[repeat_code] = (uint32_t)num_types;\n histogram[0] = 1;\n for (i = context_bits; i < alphabet_size; ++i) {\n histogram[i] = 1;\n }\n BuildAndStoreHuffmanTree(histogram, alphabet_size, alphabet_size,\n tree, depths, bits, storage_ix, storage);\n for (i = 0; i < num_types; ++i) {\n size_t code = (i == 0 ? 0 : i + context_bits - 1);\n BrotliWriteBits(depths[code], bits[code], storage_ix, storage);\n BrotliWriteBits(\n depths[repeat_code], bits[repeat_code], storage_ix, storage);\n BrotliWriteBits(repeat_code, repeat_bits, storage_ix, storage);\n }\n /* Write IMTF (inverse-move-to-front) bit. */\n BrotliWriteBits(1, 1, storage_ix, storage);\n }\n}\n\n/* Manages the encoding of one block category (literal, command or distance). */\ntypedef struct BlockEncoder {\n size_t histogram_length_;\n size_t num_block_types_;\n const uint8_t* block_types_; /* Not owned. */\n const uint32_t* block_lengths_; /* Not owned. */\n size_t num_blocks_;\n BlockSplitCode block_split_code_;\n size_t block_ix_;\n size_t block_len_;\n size_t entropy_ix_;\n uint8_t* depths_;\n uint16_t* bits_;\n} BlockEncoder;\n\nstatic void InitBlockEncoder(BlockEncoder* self, size_t histogram_length,\n size_t num_block_types, const uint8_t* block_types,\n const uint32_t* block_lengths, const size_t num_blocks) {\n self->histogram_length_ = histogram_length;\n self->num_block_types_ = num_block_types;\n self->block_types_ = block_types;\n self->block_lengths_ = block_lengths;\n self->num_blocks_ = num_blocks;\n InitBlockTypeCodeCalculator(&self->block_split_code_.type_code_calculator);\n self->block_ix_ = 0;\n self->block_len_ = num_blocks == 0 ? 0 : block_lengths[0];\n self->entropy_ix_ = 0;\n self->depths_ = 0;\n self->bits_ = 0;\n}\n\nstatic void CleanupBlockEncoder(MemoryManager* m, BlockEncoder* self) {\n BROTLI_FREE(m, self->depths_);\n BROTLI_FREE(m, self->bits_);\n}\n\n/* Creates entropy codes of block lengths and block types and stores them\n to the bit stream. */\nstatic void BuildAndStoreBlockSwitchEntropyCodes(BlockEncoder* self,\n HuffmanTree* tree, size_t* storage_ix, uint8_t* storage) {\n BuildAndStoreBlockSplitCode(self->block_types_, self->block_lengths_,\n self->num_blocks_, self->num_block_types_, tree, &self->block_split_code_,\n storage_ix, storage);\n}\n\n/* Stores the next symbol with the entropy code of the current block type.\n Updates the block type and block length at block boundaries. */\nstatic void StoreSymbol(BlockEncoder* self, size_t symbol, size_t* storage_ix,\n uint8_t* storage) {\n if (self->block_len_ == 0) {\n size_t block_ix = ++self->block_ix_;\n uint32_t block_len = self->block_lengths_[block_ix];\n uint8_t block_type = self->block_types_[block_ix];\n self->block_len_ = block_len;\n self->entropy_ix_ = block_type * self->histogram_length_;\n StoreBlockSwitch(&self->block_split_code_, block_len, block_type, 0,\n storage_ix, storage);\n }\n --self->block_len_;\n {\n size_t ix = self->entropy_ix_ + symbol;\n BrotliWriteBits(self->depths_[ix], self->bits_[ix], storage_ix, storage);\n }\n}\n\n/* Stores the next symbol with the entropy code of the current block type and\n context value.\n Updates the block type and block length at block boundaries. */\nstatic void StoreSymbolWithContext(BlockEncoder* self, size_t symbol,\n size_t context, const uint32_t* context_map, size_t* storage_ix,\n uint8_t* storage, const size_t context_bits) {\n if (self->block_len_ == 0) {\n size_t block_ix = ++self->block_ix_;\n uint32_t block_len = self->block_lengths_[block_ix];\n uint8_t block_type = self->block_types_[block_ix];\n self->block_len_ = block_len;\n self->entropy_ix_ = (size_t)block_type << context_bits;\n StoreBlockSwitch(&self->block_split_code_, block_len, block_type, 0,\n storage_ix, storage);\n }\n --self->block_len_;\n {\n size_t histo_ix = context_map[self->entropy_ix_ + context];\n size_t ix = histo_ix * self->histogram_length_ + symbol;\n BrotliWriteBits(self->depths_[ix], self->bits_[ix], storage_ix, storage);\n }\n}\n\n#define FN(X) X ## Literal\n/* NOLINTNEXTLINE(build/include) */\n#include \"block_encoder_inc.h\"\n#undef FN\n\n#define FN(X) X ## Command\n/* NOLINTNEXTLINE(build/include) */\n#include \"block_encoder_inc.h\"\n#undef FN\n\n#define FN(X) X ## Distance\n/* NOLINTNEXTLINE(build/include) */\n#include \"block_encoder_inc.h\"\n#undef FN\n\nstatic void JumpToByteBoundary(size_t* storage_ix, uint8_t* storage) {\n *storage_ix = (*storage_ix + 7u) & ~7u;\n storage[*storage_ix >> 3] = 0;\n}\n\ntypedef struct StoreMetablockArena {\n BlockEncoder literal_enc;\n BlockEncoder command_enc;\n BlockEncoder distance_enc;\n EncodeContextMapArena context_map_arena;\n} StoreMetablockArena;\n\nvoid BrotliStoreMetaBlock(MemoryManager* m,\n const uint8_t* input, size_t start_pos, size_t length, size_t mask,\n uint8_t prev_byte, uint8_t prev_byte2, BROTLI_BOOL is_last,\n const BrotliEncoderParams* params, ContextType literal_context_mode,\n const Command* commands, size_t n_commands, const MetaBlockSplit* mb,\n size_t* storage_ix, uint8_t* storage) {\n\n size_t pos = start_pos;\n size_t i;\n uint32_t num_distance_symbols = params->dist.alphabet_size_max;\n uint32_t num_effective_distance_symbols = params->dist.alphabet_size_limit;\n HuffmanTree* tree;\n ContextLut literal_context_lut = BROTLI_CONTEXT_LUT(literal_context_mode);\n StoreMetablockArena* arena = NULL;\n BlockEncoder* literal_enc = NULL;\n BlockEncoder* command_enc = NULL;\n BlockEncoder* distance_enc = NULL;\n const BrotliDistanceParams* dist = ¶ms->dist;\n BROTLI_DCHECK(\n num_effective_distance_symbols <= BROTLI_NUM_HISTOGRAM_DISTANCE_SYMBOLS);\n\n StoreCompressedMetaBlockHeader(is_last, length, storage_ix, storage);\n\n tree = BROTLI_ALLOC(m, HuffmanTree, MAX_HUFFMAN_TREE_SIZE);\n arena = BROTLI_ALLOC(m, StoreMetablockArena, 1);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tree) || BROTLI_IS_NULL(arena)) return;\n literal_enc = &arena->literal_enc;\n command_enc = &arena->command_enc;\n distance_enc = &arena->distance_enc;\n InitBlockEncoder(literal_enc, BROTLI_NUM_LITERAL_SYMBOLS,\n mb->literal_split.num_types, mb->literal_split.types,\n mb->literal_split.lengths, mb->literal_split.num_blocks);\n InitBlockEncoder(command_enc, BROTLI_NUM_COMMAND_SYMBOLS,\n mb->command_split.num_types, mb->command_split.types,\n mb->command_split.lengths, mb->command_split.num_blocks);\n InitBlockEncoder(distance_enc, num_effective_distance_symbols,\n mb->distance_split.num_types, mb->distance_split.types,\n mb->distance_split.lengths, mb->distance_split.num_blocks);\n\n BuildAndStoreBlockSwitchEntropyCodes(literal_enc, tree, storage_ix, storage);\n BuildAndStoreBlockSwitchEntropyCodes(command_enc, tree, storage_ix, storage);\n BuildAndStoreBlockSwitchEntropyCodes(distance_enc, tree, storage_ix, storage);\n\n BrotliWriteBits(2, dist->distance_postfix_bits, storage_ix, storage);\n BrotliWriteBits(\n 4, dist->num_direct_distance_codes >> dist->distance_postfix_bits,\n storage_ix, storage);\n for (i = 0; i < mb->literal_split.num_types; ++i) {\n BrotliWriteBits(2, literal_context_mode, storage_ix, storage);\n }\n\n if (mb->literal_context_map_size == 0) {\n StoreTrivialContextMap(\n &arena->context_map_arena, mb->literal_histograms_size,\n BROTLI_LITERAL_CONTEXT_BITS, tree, storage_ix, storage);\n } else {\n EncodeContextMap(m, &arena->context_map_arena,\n mb->literal_context_map, mb->literal_context_map_size,\n mb->literal_histograms_size, tree, storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n }\n\n if (mb->distance_context_map_size == 0) {\n StoreTrivialContextMap(\n &arena->context_map_arena, mb->distance_histograms_size,\n BROTLI_DISTANCE_CONTEXT_BITS, tree, storage_ix, storage);\n } else {\n EncodeContextMap(m, &arena->context_map_arena,\n mb->distance_context_map, mb->distance_context_map_size,\n mb->distance_histograms_size, tree, storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n }\n\n BuildAndStoreEntropyCodesLiteral(m, literal_enc, mb->literal_histograms,\n mb->literal_histograms_size, BROTLI_NUM_LITERAL_SYMBOLS, tree,\n storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n BuildAndStoreEntropyCodesCommand(m, command_enc, mb->command_histograms,\n mb->command_histograms_size, BROTLI_NUM_COMMAND_SYMBOLS, tree,\n storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n BuildAndStoreEntropyCodesDistance(m, distance_enc, mb->distance_histograms,\n mb->distance_histograms_size, num_distance_symbols, tree,\n storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n BROTLI_FREE(m, tree);\n\n for (i = 0; i < n_commands; ++i) {\n const Command cmd = commands[i];\n size_t cmd_code = cmd.cmd_prefix_;\n StoreSymbol(command_enc, cmd_code, storage_ix, storage);\n StoreCommandExtra(&cmd, storage_ix, storage);\n if (mb->literal_context_map_size == 0) {\n size_t j;\n for (j = cmd.insert_len_; j != 0; --j) {\n StoreSymbol(literal_enc, input[pos & mask], storage_ix, storage);\n ++pos;\n }\n } else {\n size_t j;\n for (j = cmd.insert_len_; j != 0; --j) {\n size_t context =\n BROTLI_CONTEXT(prev_byte, prev_byte2, literal_context_lut);\n uint8_t literal = input[pos & mask];\n StoreSymbolWithContext(literal_enc, literal, context,\n mb->literal_context_map, storage_ix, storage,\n BROTLI_LITERAL_CONTEXT_BITS);\n prev_byte2 = prev_byte;\n prev_byte = literal;\n ++pos;\n }\n }\n pos += CommandCopyLen(&cmd);\n if (CommandCopyLen(&cmd)) {\n prev_byte2 = input[(pos - 2) & mask];\n prev_byte = input[(pos - 1) & mask];\n if (cmd.cmd_prefix_ >= 128) {\n size_t dist_code = cmd.dist_prefix_ & 0x3FF;\n uint32_t distnumextra = cmd.dist_prefix_ >> 10;\n uint64_t distextra = cmd.dist_extra_;\n if (mb->distance_context_map_size == 0) {\n StoreSymbol(distance_enc, dist_code, storage_ix, storage);\n } else {\n size_t context = CommandDistanceContext(&cmd);\n StoreSymbolWithContext(distance_enc, dist_code, context,\n mb->distance_context_map, storage_ix, storage,\n BROTLI_DISTANCE_CONTEXT_BITS);\n }\n BrotliWriteBits(distnumextra, distextra, storage_ix, storage);\n }\n }\n }\n CleanupBlockEncoder(m, distance_enc);\n CleanupBlockEncoder(m, command_enc);\n CleanupBlockEncoder(m, literal_enc);\n BROTLI_FREE(m, arena);\n if (is_last) {\n JumpToByteBoundary(storage_ix, storage);\n }\n}\n\nstatic void BuildHistograms(const uint8_t* input,\n size_t start_pos,\n size_t mask,\n const Command* commands,\n size_t n_commands,\n HistogramLiteral* lit_histo,\n HistogramCommand* cmd_histo,\n HistogramDistance* dist_histo) {\n size_t pos = start_pos;\n size_t i;\n for (i = 0; i < n_commands; ++i) {\n const Command cmd = commands[i];\n size_t j;\n HistogramAddCommand(cmd_histo, cmd.cmd_prefix_);\n for (j = cmd.insert_len_; j != 0; --j) {\n HistogramAddLiteral(lit_histo, input[pos & mask]);\n ++pos;\n }\n pos += CommandCopyLen(&cmd);\n if (CommandCopyLen(&cmd) && cmd.cmd_prefix_ >= 128) {\n HistogramAddDistance(dist_histo, cmd.dist_prefix_ & 0x3FF);\n }\n }\n}\n\nstatic void StoreDataWithHuffmanCodes(const uint8_t* input,\n size_t start_pos,\n size_t mask,\n const Command* commands,\n size_t n_commands,\n const uint8_t* lit_depth,\n const uint16_t* lit_bits,\n const uint8_t* cmd_depth,\n const uint16_t* cmd_bits,\n const uint8_t* dist_depth,\n const uint16_t* dist_bits,\n size_t* storage_ix,\n uint8_t* storage) {\n size_t pos = start_pos;\n size_t i;\n for (i = 0; i < n_commands; ++i) {\n const Command cmd = commands[i];\n const size_t cmd_code = cmd.cmd_prefix_;\n size_t j;\n BrotliWriteBits(\n cmd_depth[cmd_code], cmd_bits[cmd_code], storage_ix, storage);\n StoreCommandExtra(&cmd, storage_ix, storage);\n for (j = cmd.insert_len_; j != 0; --j) {\n const uint8_t literal = input[pos & mask];\n BrotliWriteBits(\n lit_depth[literal], lit_bits[literal], storage_ix, storage);\n ++pos;\n }\n pos += CommandCopyLen(&cmd);\n if (CommandCopyLen(&cmd) && cmd.cmd_prefix_ >= 128) {\n const size_t dist_code = cmd.dist_prefix_ & 0x3FF;\n const uint32_t distnumextra = cmd.dist_prefix_ >> 10;\n const uint32_t distextra = cmd.dist_extra_;\n BrotliWriteBits(dist_depth[dist_code], dist_bits[dist_code],\n storage_ix, storage);\n BrotliWriteBits(distnumextra, distextra, storage_ix, storage);\n }\n }\n}\n\n/* TODO(eustas): pull alloc/dealloc to caller? */\ntypedef struct MetablockArena {\n HistogramLiteral lit_histo;\n HistogramCommand cmd_histo;\n HistogramDistance dist_histo;\n /* TODO(eustas): merge bits and depth? */\n uint8_t lit_depth[BROTLI_NUM_LITERAL_SYMBOLS];\n uint16_t lit_bits[BROTLI_NUM_LITERAL_SYMBOLS];\n uint8_t cmd_depth[BROTLI_NUM_COMMAND_SYMBOLS];\n uint16_t cmd_bits[BROTLI_NUM_COMMAND_SYMBOLS];\n uint8_t dist_depth[MAX_SIMPLE_DISTANCE_ALPHABET_SIZE];\n uint16_t dist_bits[MAX_SIMPLE_DISTANCE_ALPHABET_SIZE];\n HuffmanTree tree[MAX_HUFFMAN_TREE_SIZE];\n} MetablockArena;\n\nvoid BrotliStoreMetaBlockTrivial(MemoryManager* m,\n const uint8_t* input, size_t start_pos, size_t length, size_t mask,\n BROTLI_BOOL is_last, const BrotliEncoderParams* params,\n const Command* commands, size_t n_commands,\n size_t* storage_ix, uint8_t* storage) {\n MetablockArena* arena = BROTLI_ALLOC(m, MetablockArena, 1);\n uint32_t num_distance_symbols = params->dist.alphabet_size_max;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;\n\n StoreCompressedMetaBlockHeader(is_last, length, storage_ix, storage);\n\n HistogramClearLiteral(&arena->lit_histo);\n HistogramClearCommand(&arena->cmd_histo);\n HistogramClearDistance(&arena->dist_histo);\n\n BuildHistograms(input, start_pos, mask, commands, n_commands,\n &arena->lit_histo, &arena->cmd_histo, &arena->dist_histo);\n\n BrotliWriteBits(13, 0, storage_ix, storage);\n\n BuildAndStoreHuffmanTree(arena->lit_histo.data_, BROTLI_NUM_LITERAL_SYMBOLS,\n BROTLI_NUM_LITERAL_SYMBOLS, arena->tree,\n arena->lit_depth, arena->lit_bits,\n storage_ix, storage);\n BuildAndStoreHuffmanTree(arena->cmd_histo.data_, BROTLI_NUM_COMMAND_SYMBOLS,\n BROTLI_NUM_COMMAND_SYMBOLS, arena->tree,\n arena->cmd_depth, arena->cmd_bits,\n storage_ix, storage);\n BuildAndStoreHuffmanTree(arena->dist_histo.data_,\n MAX_SIMPLE_DISTANCE_ALPHABET_SIZE,\n num_distance_symbols, arena->tree,\n arena->dist_depth, arena->dist_bits,\n storage_ix, storage);\n StoreDataWithHuffmanCodes(input, start_pos, mask, commands,\n n_commands, arena->lit_depth, arena->lit_bits,\n arena->cmd_depth, arena->cmd_bits,\n arena->dist_depth, arena->dist_bits,\n storage_ix, storage);\n BROTLI_FREE(m, arena);\n if (is_last) {\n JumpToByteBoundary(storage_ix, storage);\n }\n}\n\nvoid BrotliStoreMetaBlockFast(MemoryManager* m,\n const uint8_t* input, size_t start_pos, size_t length, size_t mask,\n BROTLI_BOOL is_last, const BrotliEncoderParams* params,\n const Command* commands, size_t n_commands,\n size_t* storage_ix, uint8_t* storage) {\n MetablockArena* arena = BROTLI_ALLOC(m, MetablockArena, 1);\n uint32_t num_distance_symbols = params->dist.alphabet_size_max;\n uint32_t distance_alphabet_bits =\n Log2FloorNonZero(num_distance_symbols - 1) + 1;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;\n\n StoreCompressedMetaBlockHeader(is_last, length, storage_ix, storage);\n\n BrotliWriteBits(13, 0, storage_ix, storage);\n\n if (n_commands <= 128) {\n uint32_t histogram[BROTLI_NUM_LITERAL_SYMBOLS] = { 0 };\n size_t pos = start_pos;\n size_t num_literals = 0;\n size_t i;\n for (i = 0; i < n_commands; ++i) {\n const Command cmd = commands[i];\n size_t j;\n for (j = cmd.insert_len_; j != 0; --j) {\n ++histogram[input[pos & mask]];\n ++pos;\n }\n num_literals += cmd.insert_len_;\n pos += CommandCopyLen(&cmd);\n }\n BrotliBuildAndStoreHuffmanTreeFast(arena->tree, histogram, num_literals,\n /* max_bits = */ 8,\n arena->lit_depth, arena->lit_bits,\n storage_ix, storage);\n StoreStaticCommandHuffmanTree(storage_ix, storage);\n StoreStaticDistanceHuffmanTree(storage_ix, storage);\n StoreDataWithHuffmanCodes(input, start_pos, mask, commands,\n n_commands, arena->lit_depth, arena->lit_bits,\n kStaticCommandCodeDepth,\n kStaticCommandCodeBits,\n kStaticDistanceCodeDepth,\n kStaticDistanceCodeBits,\n storage_ix, storage);\n } else {\n HistogramClearLiteral(&arena->lit_histo);\n HistogramClearCommand(&arena->cmd_histo);\n HistogramClearDistance(&arena->dist_histo);\n BuildHistograms(input, start_pos, mask, commands, n_commands,\n &arena->lit_histo, &arena->cmd_histo, &arena->dist_histo);\n BrotliBuildAndStoreHuffmanTreeFast(arena->tree, arena->lit_histo.data_,\n arena->lit_histo.total_count_,\n /* max_bits = */ 8,\n arena->lit_depth, arena->lit_bits,\n storage_ix, storage);\n BrotliBuildAndStoreHuffmanTreeFast(arena->tree, arena->cmd_histo.data_,\n arena->cmd_histo.total_count_,\n /* max_bits = */ 10,\n arena->cmd_depth, arena->cmd_bits,\n storage_ix, storage);\n BrotliBuildAndStoreHuffmanTreeFast(arena->tree, arena->dist_histo.data_,\n arena->dist_histo.total_count_,\n /* max_bits = */\n distance_alphabet_bits,\n arena->dist_depth, arena->dist_bits,\n storage_ix, storage);\n StoreDataWithHuffmanCodes(input, start_pos, mask, commands,\n n_commands, arena->lit_depth, arena->lit_bits,\n arena->cmd_depth, arena->cmd_bits,\n arena->dist_depth, arena->dist_bits,\n storage_ix, storage);\n }\n\n BROTLI_FREE(m, arena);\n\n if (is_last) {\n JumpToByteBoundary(storage_ix, storage);\n }\n}\n\n/* This is for storing uncompressed blocks (simple raw storage of\n bytes-as-bytes). */\nvoid BrotliStoreUncompressedMetaBlock(BROTLI_BOOL is_final_block,\n const uint8_t* BROTLI_RESTRICT input,\n size_t position, size_t mask,\n size_t len,\n size_t* BROTLI_RESTRICT storage_ix,\n uint8_t* BROTLI_RESTRICT storage) {\n size_t masked_pos = position & mask;\n BrotliStoreUncompressedMetaBlockHeader(len, storage_ix, storage);\n JumpToByteBoundary(storage_ix, storage);\n\n if (masked_pos + len > mask + 1) {\n size_t len1 = mask + 1 - masked_pos;\n memcpy(&storage[*storage_ix >> 3], &input[masked_pos], len1);\n *storage_ix += len1 << 3;\n len -= len1;\n masked_pos = 0;\n }\n memcpy(&storage[*storage_ix >> 3], &input[masked_pos], len);\n *storage_ix += len << 3;\n\n /* We need to clear the next 4 bytes to continue to be\n compatible with BrotliWriteBits. */\n BrotliWriteBitsPrepareStorage(*storage_ix, storage);\n\n /* Since the uncompressed block itself may not be the final block, add an\n empty one after this. */\n if (is_final_block) {\n BrotliWriteBits(1, 1, storage_ix, storage); /* islast */\n BrotliWriteBits(1, 1, storage_ix, storage); /* isempty */\n JumpToByteBoundary(storage_ix, storage);\n }\n}\n\n#if defined(BROTLI_TEST)\nvoid BrotliGetBlockLengthPrefixCodeForTest(uint32_t len, size_t* code,\n uint32_t* n_extra, uint32_t* extra);\nvoid BrotliGetBlockLengthPrefixCodeForTest(uint32_t len, size_t* code,\n uint32_t* n_extra, uint32_t* extra) {\n GetBlockLengthPrefixCode(len, code, n_extra, extra);\n}\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/brotli_bit_stream.h", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Functions to convert brotli-related data structures into the\n brotli bit stream. The functions here operate under\n assumption that there is enough space in the storage, i.e., there are\n no out-of-range checks anywhere.\n\n These functions do bit addressing into a byte array. The byte array\n is called \"storage\" and the index to the bit is called storage_ix\n in function arguments. */\n\n#ifndef BROTLI_ENC_BROTLI_BIT_STREAM_H_\n#define BROTLI_ENC_BROTLI_BIT_STREAM_H_\n\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"command.h\"\n#include \"entropy_encode.h\"\n#include \"memory.h\"\n#include \"metablock.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* All Store functions here will use a storage_ix, which is always the bit\n position for the current storage. */\n\nBROTLI_INTERNAL void BrotliStoreHuffmanTree(const uint8_t* depths, size_t num,\n HuffmanTree* tree, size_t* storage_ix, uint8_t* storage);\n\nBROTLI_INTERNAL void BrotliBuildAndStoreHuffmanTreeFast(\n HuffmanTree* tree, const uint32_t* histogram, const size_t histogram_total,\n const size_t max_bits, uint8_t* depth, uint16_t* bits, size_t* storage_ix,\n uint8_t* storage);\n\n/* REQUIRES: length > 0 */\n/* REQUIRES: length <= (1 << 24) */\nBROTLI_INTERNAL void BrotliStoreMetaBlock(MemoryManager* m,\n const uint8_t* input, size_t start_pos, size_t length, size_t mask,\n uint8_t prev_byte, uint8_t prev_byte2, BROTLI_BOOL is_last,\n const BrotliEncoderParams* params, ContextType literal_context_mode,\n const Command* commands, size_t n_commands, const MetaBlockSplit* mb,\n size_t* storage_ix, uint8_t* storage);\n\n/* Stores the meta-block without doing any block splitting, just collects\n one histogram per block category and uses that for entropy coding.\n REQUIRES: length > 0\n REQUIRES: length <= (1 << 24) */\nBROTLI_INTERNAL void BrotliStoreMetaBlockTrivial(MemoryManager* m,\n const uint8_t* input, size_t start_pos, size_t length, size_t mask,\n BROTLI_BOOL is_last, const BrotliEncoderParams* params,\n const Command* commands, size_t n_commands,\n size_t* storage_ix, uint8_t* storage);\n\n/* Same as above, but uses static prefix codes for histograms with a only a few\n symbols, and uses static code length prefix codes for all other histograms.\n REQUIRES: length > 0\n REQUIRES: length <= (1 << 24) */\nBROTLI_INTERNAL void BrotliStoreMetaBlockFast(MemoryManager* m,\n const uint8_t* input, size_t start_pos, size_t length, size_t mask,\n BROTLI_BOOL is_last, const BrotliEncoderParams* params,\n const Command* commands, size_t n_commands,\n size_t* storage_ix, uint8_t* storage);\n\n/* This is for storing uncompressed blocks (simple raw storage of\n bytes-as-bytes).\n REQUIRES: length > 0\n REQUIRES: length <= (1 << 24) */\nBROTLI_INTERNAL void BrotliStoreUncompressedMetaBlock(\n BROTLI_BOOL is_final_block, const uint8_t* BROTLI_RESTRICT input,\n size_t position, size_t mask, size_t len,\n size_t* BROTLI_RESTRICT storage_ix, uint8_t* BROTLI_RESTRICT storage);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_BROTLI_BIT_STREAM_H_ */\n" }, { "path": "libs/brotli/enc/cluster.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Functions for clustering similar histograms together. */\n\n#include \"cluster.h\"\n\n#include \"../common/platform.h\"\n#include \"bit_cost.h\" /* BrotliPopulationCost */\n#include \"fast_log.h\"\n#include \"histogram.h\"\n#include \"memory.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic BROTLI_INLINE BROTLI_BOOL HistogramPairIsLess(\n const HistogramPair* p1, const HistogramPair* p2) {\n if (p1->cost_diff != p2->cost_diff) {\n return TO_BROTLI_BOOL(p1->cost_diff > p2->cost_diff);\n }\n return TO_BROTLI_BOOL((p1->idx2 - p1->idx1) > (p2->idx2 - p2->idx1));\n}\n\n/* Returns entropy reduction of the context map when we combine two clusters. */\nstatic BROTLI_INLINE double ClusterCostDiff(size_t size_a, size_t size_b) {\n size_t size_c = size_a + size_b;\n return (double)size_a * FastLog2(size_a) +\n (double)size_b * FastLog2(size_b) -\n (double)size_c * FastLog2(size_c);\n}\n\n#define CODE(X) X\n\n#define FN(X) X ## Literal\n#include \"cluster_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Command\n#include \"cluster_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Distance\n#include \"cluster_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#undef CODE\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/cluster.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Functions for clustering similar histograms together. */\n\n#ifndef BROTLI_ENC_CLUSTER_H_\n#define BROTLI_ENC_CLUSTER_H_\n\n#include \"../common/platform.h\"\n#include \"histogram.h\"\n#include \"memory.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ntypedef struct HistogramPair {\n uint32_t idx1;\n uint32_t idx2;\n double cost_combo;\n double cost_diff;\n} HistogramPair;\n\n#define CODE(X) /* Declaration */;\n\n#define FN(X) X ## Literal\n#include \"cluster_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Command\n#include \"cluster_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Distance\n#include \"cluster_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#undef CODE\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_CLUSTER_H_ */\n" }, { "path": "libs/brotli/enc/cluster_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN, CODE */\n\n#define HistogramType FN(Histogram)\n\n/* Computes the bit cost reduction by combining out[idx1] and out[idx2] and if\n it is below a threshold, stores the pair (idx1, idx2) in the *pairs queue. */\nBROTLI_INTERNAL void FN(BrotliCompareAndPushToQueue)(\n const HistogramType* out, HistogramType* tmp, const uint32_t* cluster_size,\n uint32_t idx1, uint32_t idx2, size_t max_num_pairs, HistogramPair* pairs,\n size_t* num_pairs) CODE({\n BROTLI_BOOL is_good_pair = BROTLI_FALSE;\n HistogramPair p;\n p.idx1 = p.idx2 = 0;\n p.cost_diff = p.cost_combo = 0;\n if (idx1 == idx2) {\n return;\n }\n if (idx2 < idx1) {\n uint32_t t = idx2;\n idx2 = idx1;\n idx1 = t;\n }\n p.idx1 = idx1;\n p.idx2 = idx2;\n p.cost_diff = 0.5 * ClusterCostDiff(cluster_size[idx1], cluster_size[idx2]);\n p.cost_diff -= out[idx1].bit_cost_;\n p.cost_diff -= out[idx2].bit_cost_;\n\n if (out[idx1].total_count_ == 0) {\n p.cost_combo = out[idx2].bit_cost_;\n is_good_pair = BROTLI_TRUE;\n } else if (out[idx2].total_count_ == 0) {\n p.cost_combo = out[idx1].bit_cost_;\n is_good_pair = BROTLI_TRUE;\n } else {\n double threshold = *num_pairs == 0 ? 1e99 :\n BROTLI_MAX(double, 0.0, pairs[0].cost_diff);\n double cost_combo;\n *tmp = out[idx1];\n FN(HistogramAddHistogram)(tmp, &out[idx2]);\n cost_combo = FN(BrotliPopulationCost)(tmp);\n if (cost_combo < threshold - p.cost_diff) {\n p.cost_combo = cost_combo;\n is_good_pair = BROTLI_TRUE;\n }\n }\n if (is_good_pair) {\n p.cost_diff += p.cost_combo;\n if (*num_pairs > 0 && HistogramPairIsLess(&pairs[0], &p)) {\n /* Replace the top of the queue if needed. */\n if (*num_pairs < max_num_pairs) {\n pairs[*num_pairs] = pairs[0];\n ++(*num_pairs);\n }\n pairs[0] = p;\n } else if (*num_pairs < max_num_pairs) {\n pairs[*num_pairs] = p;\n ++(*num_pairs);\n }\n }\n})\n\nBROTLI_INTERNAL size_t FN(BrotliHistogramCombine)(HistogramType* out,\n HistogramType* tmp,\n uint32_t* cluster_size,\n uint32_t* symbols,\n uint32_t* clusters,\n HistogramPair* pairs,\n size_t num_clusters,\n size_t symbols_size,\n size_t max_clusters,\n size_t max_num_pairs) CODE({\n double cost_diff_threshold = 0.0;\n size_t min_cluster_size = 1;\n size_t num_pairs = 0;\n\n {\n /* We maintain a vector of histogram pairs, with the property that the pair\n with the maximum bit cost reduction is the first. */\n size_t idx1;\n for (idx1 = 0; idx1 < num_clusters; ++idx1) {\n size_t idx2;\n for (idx2 = idx1 + 1; idx2 < num_clusters; ++idx2) {\n FN(BrotliCompareAndPushToQueue)(out, tmp, cluster_size, clusters[idx1],\n clusters[idx2], max_num_pairs, &pairs[0], &num_pairs);\n }\n }\n }\n\n while (num_clusters > min_cluster_size) {\n uint32_t best_idx1;\n uint32_t best_idx2;\n size_t i;\n if (pairs[0].cost_diff >= cost_diff_threshold) {\n cost_diff_threshold = 1e99;\n min_cluster_size = max_clusters;\n continue;\n }\n /* Take the best pair from the top of heap. */\n best_idx1 = pairs[0].idx1;\n best_idx2 = pairs[0].idx2;\n FN(HistogramAddHistogram)(&out[best_idx1], &out[best_idx2]);\n out[best_idx1].bit_cost_ = pairs[0].cost_combo;\n cluster_size[best_idx1] += cluster_size[best_idx2];\n for (i = 0; i < symbols_size; ++i) {\n if (symbols[i] == best_idx2) {\n symbols[i] = best_idx1;\n }\n }\n for (i = 0; i < num_clusters; ++i) {\n if (clusters[i] == best_idx2) {\n memmove(&clusters[i], &clusters[i + 1],\n (num_clusters - i - 1) * sizeof(clusters[0]));\n break;\n }\n }\n --num_clusters;\n {\n /* Remove pairs intersecting the just combined best pair. */\n size_t copy_to_idx = 0;\n for (i = 0; i < num_pairs; ++i) {\n HistogramPair* p = &pairs[i];\n if (p->idx1 == best_idx1 || p->idx2 == best_idx1 ||\n p->idx1 == best_idx2 || p->idx2 == best_idx2) {\n /* Remove invalid pair from the queue. */\n continue;\n }\n if (HistogramPairIsLess(&pairs[0], p)) {\n /* Replace the top of the queue if needed. */\n HistogramPair front = pairs[0];\n pairs[0] = *p;\n pairs[copy_to_idx] = front;\n } else {\n pairs[copy_to_idx] = *p;\n }\n ++copy_to_idx;\n }\n num_pairs = copy_to_idx;\n }\n\n /* Push new pairs formed with the combined histogram to the heap. */\n for (i = 0; i < num_clusters; ++i) {\n FN(BrotliCompareAndPushToQueue)(out, tmp, cluster_size, best_idx1,\n clusters[i], max_num_pairs, &pairs[0], &num_pairs);\n }\n }\n return num_clusters;\n})\n\n/* What is the bit cost of moving histogram from cur_symbol to candidate. */\nBROTLI_INTERNAL double FN(BrotliHistogramBitCostDistance)(\n const HistogramType* histogram, const HistogramType* candidate,\n HistogramType* tmp) CODE({\n if (histogram->total_count_ == 0) {\n return 0.0;\n } else {\n *tmp = *histogram;\n FN(HistogramAddHistogram)(tmp, candidate);\n return FN(BrotliPopulationCost)(tmp) - candidate->bit_cost_;\n }\n})\n\n/* Find the best 'out' histogram for each of the 'in' histograms.\n When called, clusters[0..num_clusters) contains the unique values from\n symbols[0..in_size), but this property is not preserved in this function.\n Note: we assume that out[]->bit_cost_ is already up-to-date. */\nBROTLI_INTERNAL void FN(BrotliHistogramRemap)(const HistogramType* in,\n size_t in_size, const uint32_t* clusters, size_t num_clusters,\n HistogramType* out, HistogramType* tmp, uint32_t* symbols) CODE({\n size_t i;\n for (i = 0; i < in_size; ++i) {\n uint32_t best_out = i == 0 ? symbols[0] : symbols[i - 1];\n double best_bits =\n FN(BrotliHistogramBitCostDistance)(&in[i], &out[best_out], tmp);\n size_t j;\n for (j = 0; j < num_clusters; ++j) {\n const double cur_bits =\n FN(BrotliHistogramBitCostDistance)(&in[i], &out[clusters[j]], tmp);\n if (cur_bits < best_bits) {\n best_bits = cur_bits;\n best_out = clusters[j];\n }\n }\n symbols[i] = best_out;\n }\n\n /* Recompute each out based on raw and symbols. */\n for (i = 0; i < num_clusters; ++i) {\n FN(HistogramClear)(&out[clusters[i]]);\n }\n for (i = 0; i < in_size; ++i) {\n FN(HistogramAddHistogram)(&out[symbols[i]], &in[i]);\n }\n})\n\n/* Reorders elements of the out[0..length) array and changes values in\n symbols[0..length) array in the following way:\n * when called, symbols[] contains indexes into out[], and has N unique\n values (possibly N < length)\n * on return, symbols'[i] = f(symbols[i]) and\n out'[symbols'[i]] = out[symbols[i]], for each 0 <= i < length,\n where f is a bijection between the range of symbols[] and [0..N), and\n the first occurrences of values in symbols'[i] come in consecutive\n increasing order.\n Returns N, the number of unique values in symbols[]. */\nBROTLI_INTERNAL size_t FN(BrotliHistogramReindex)(MemoryManager* m,\n HistogramType* out, uint32_t* symbols, size_t length) CODE({\n static const uint32_t kInvalidIndex = BROTLI_UINT32_MAX;\n uint32_t* new_index = BROTLI_ALLOC(m, uint32_t, length);\n uint32_t next_index;\n HistogramType* tmp;\n size_t i;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_index)) return 0;\n for (i = 0; i < length; ++i) {\n new_index[i] = kInvalidIndex;\n }\n next_index = 0;\n for (i = 0; i < length; ++i) {\n if (new_index[symbols[i]] == kInvalidIndex) {\n new_index[symbols[i]] = next_index;\n ++next_index;\n }\n }\n /* TODO(eustas): by using idea of \"cycle-sort\" we can avoid allocation of\n tmp and reduce the number of copying by the factor of 2. */\n tmp = BROTLI_ALLOC(m, HistogramType, next_index);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tmp)) return 0;\n next_index = 0;\n for (i = 0; i < length; ++i) {\n if (new_index[symbols[i]] == next_index) {\n tmp[next_index] = out[symbols[i]];\n ++next_index;\n }\n symbols[i] = new_index[symbols[i]];\n }\n BROTLI_FREE(m, new_index);\n for (i = 0; i < next_index; ++i) {\n out[i] = tmp[i];\n }\n BROTLI_FREE(m, tmp);\n return next_index;\n})\n\nBROTLI_INTERNAL void FN(BrotliClusterHistograms)(\n MemoryManager* m, const HistogramType* in, const size_t in_size,\n size_t max_histograms, HistogramType* out, size_t* out_size,\n uint32_t* histogram_symbols) CODE({\n uint32_t* cluster_size = BROTLI_ALLOC(m, uint32_t, in_size);\n uint32_t* clusters = BROTLI_ALLOC(m, uint32_t, in_size);\n size_t num_clusters = 0;\n const size_t max_input_histograms = 64;\n size_t pairs_capacity = max_input_histograms * max_input_histograms / 2;\n /* For the first pass of clustering, we allow all pairs. */\n HistogramPair* pairs = BROTLI_ALLOC(m, HistogramPair, pairs_capacity + 1);\n /* TODO(eustas): move to \"persistent\" arena? */\n HistogramType* tmp = BROTLI_ALLOC(m, HistogramType, 1);\n size_t i;\n\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(cluster_size) ||\n BROTLI_IS_NULL(clusters) || BROTLI_IS_NULL(pairs)|| BROTLI_IS_NULL(tmp)) {\n return;\n }\n\n for (i = 0; i < in_size; ++i) {\n cluster_size[i] = 1;\n }\n\n for (i = 0; i < in_size; ++i) {\n out[i] = in[i];\n out[i].bit_cost_ = FN(BrotliPopulationCost)(&in[i]);\n histogram_symbols[i] = (uint32_t)i;\n }\n\n for (i = 0; i < in_size; i += max_input_histograms) {\n size_t num_to_combine =\n BROTLI_MIN(size_t, in_size - i, max_input_histograms);\n size_t num_new_clusters;\n size_t j;\n for (j = 0; j < num_to_combine; ++j) {\n clusters[num_clusters + j] = (uint32_t)(i + j);\n }\n num_new_clusters =\n FN(BrotliHistogramCombine)(out, tmp, cluster_size,\n &histogram_symbols[i],\n &clusters[num_clusters], pairs,\n num_to_combine, num_to_combine,\n max_histograms, pairs_capacity);\n num_clusters += num_new_clusters;\n }\n\n {\n /* For the second pass, we limit the total number of histogram pairs.\n After this limit is reached, we only keep searching for the best pair. */\n size_t max_num_pairs = BROTLI_MIN(size_t,\n 64 * num_clusters, (num_clusters / 2) * num_clusters);\n BROTLI_ENSURE_CAPACITY(\n m, HistogramPair, pairs, pairs_capacity, max_num_pairs + 1);\n if (BROTLI_IS_OOM(m)) return;\n\n /* Collapse similar histograms. */\n num_clusters = FN(BrotliHistogramCombine)(out, tmp, cluster_size,\n histogram_symbols, clusters,\n pairs, num_clusters, in_size,\n max_histograms, max_num_pairs);\n }\n BROTLI_FREE(m, pairs);\n BROTLI_FREE(m, cluster_size);\n /* Find the optimal map from original histograms to the final ones. */\n FN(BrotliHistogramRemap)(in, in_size, clusters, num_clusters,\n out, tmp, histogram_symbols);\n BROTLI_FREE(m, tmp);\n BROTLI_FREE(m, clusters);\n /* Convert the context map to a canonical form. */\n *out_size = FN(BrotliHistogramReindex)(m, out, histogram_symbols, in_size);\n if (BROTLI_IS_OOM(m)) return;\n})\n\n#undef HistogramType\n" }, { "path": "libs/brotli/enc/command.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"command.h\"\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nconst uint32_t kBrotliInsBase[BROTLI_NUM_INS_COPY_CODES] = {\n 0, 1, 2, 3, 4, 5, 6, 8, 10, 14, 18, 26,\n 34, 50, 66, 98, 130, 194, 322, 578, 1090, 2114, 6210, 22594};\nconst uint32_t kBrotliInsExtra[BROTLI_NUM_INS_COPY_CODES] = {\n 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 10, 12, 14, 24};\nconst uint32_t kBrotliCopyBase[BROTLI_NUM_INS_COPY_CODES] = {\n 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 18,\n 22, 30, 38, 54, 70, 102, 134, 198, 326, 582, 1094, 2118};\nconst uint32_t kBrotliCopyExtra[BROTLI_NUM_INS_COPY_CODES] = {\n 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 10, 24};\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/command.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* This class models a sequence of literals and a backward reference copy. */\n\n#ifndef BROTLI_ENC_COMMAND_H_\n#define BROTLI_ENC_COMMAND_H_\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"fast_log.h\"\n#include \"params.h\"\n#include \"prefix.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\")\nuint32_t kBrotliInsBase[BROTLI_NUM_INS_COPY_CODES];\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\")\nuint32_t kBrotliInsExtra[BROTLI_NUM_INS_COPY_CODES];\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\")\nuint32_t kBrotliCopyBase[BROTLI_NUM_INS_COPY_CODES];\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\")\nuint32_t kBrotliCopyExtra[BROTLI_NUM_INS_COPY_CODES];\n\nstatic BROTLI_INLINE uint16_t GetInsertLengthCode(size_t insertlen) {\n if (insertlen < 6) {\n return (uint16_t)insertlen;\n } else if (insertlen < 130) {\n uint32_t nbits = Log2FloorNonZero(insertlen - 2) - 1u;\n return (uint16_t)((nbits << 1) + ((insertlen - 2) >> nbits) + 2);\n } else if (insertlen < 2114) {\n return (uint16_t)(Log2FloorNonZero(insertlen - 66) + 10);\n } else if (insertlen < 6210) {\n return 21u;\n } else if (insertlen < 22594) {\n return 22u;\n } else {\n return 23u;\n }\n}\n\nstatic BROTLI_INLINE uint16_t GetCopyLengthCode(size_t copylen) {\n if (copylen < 10) {\n return (uint16_t)(copylen - 2);\n } else if (copylen < 134) {\n uint32_t nbits = Log2FloorNonZero(copylen - 6) - 1u;\n return (uint16_t)((nbits << 1) + ((copylen - 6) >> nbits) + 4);\n } else if (copylen < 2118) {\n return (uint16_t)(Log2FloorNonZero(copylen - 70) + 12);\n } else {\n return 23u;\n }\n}\n\nstatic BROTLI_INLINE uint16_t CombineLengthCodes(\n uint16_t inscode, uint16_t copycode, BROTLI_BOOL use_last_distance) {\n uint16_t bits64 =\n (uint16_t)((copycode & 0x7u) | ((inscode & 0x7u) << 3u));\n if (use_last_distance && inscode < 8u && copycode < 16u) {\n return (copycode < 8u) ? bits64 : (bits64 | 64u);\n } else {\n /* Specification: 5 Encoding of ... (last table) */\n /* offset = 2 * index, where index is in range [0..8] */\n uint32_t offset = 2u * ((copycode >> 3u) + 3u * (inscode >> 3u));\n /* All values in specification are K * 64,\n where K = [2, 3, 6, 4, 5, 8, 7, 9, 10],\n i + 1 = [1, 2, 3, 4, 5, 6, 7, 8, 9],\n K - i - 1 = [1, 1, 3, 0, 0, 2, 0, 1, 2] = D.\n All values in D require only 2 bits to encode.\n Magic constant is shifted 6 bits left, to avoid final multiplication. */\n offset = (offset << 5u) + 0x40u + ((0x520D40u >> offset) & 0xC0u);\n return (uint16_t)(offset | bits64);\n }\n}\n\nstatic BROTLI_INLINE void GetLengthCode(size_t insertlen, size_t copylen,\n BROTLI_BOOL use_last_distance,\n uint16_t* code) {\n uint16_t inscode = GetInsertLengthCode(insertlen);\n uint16_t copycode = GetCopyLengthCode(copylen);\n *code = CombineLengthCodes(inscode, copycode, use_last_distance);\n}\n\nstatic BROTLI_INLINE uint32_t GetInsertBase(uint16_t inscode) {\n return kBrotliInsBase[inscode];\n}\n\nstatic BROTLI_INLINE uint32_t GetInsertExtra(uint16_t inscode) {\n return kBrotliInsExtra[inscode];\n}\n\nstatic BROTLI_INLINE uint32_t GetCopyBase(uint16_t copycode) {\n return kBrotliCopyBase[copycode];\n}\n\nstatic BROTLI_INLINE uint32_t GetCopyExtra(uint16_t copycode) {\n return kBrotliCopyExtra[copycode];\n}\n\ntypedef struct Command {\n uint32_t insert_len_;\n /* Stores copy_len in low 25 bits and copy_code - copy_len in high 7 bit. */\n uint32_t copy_len_;\n /* Stores distance extra bits. */\n uint32_t dist_extra_;\n uint16_t cmd_prefix_;\n /* Stores distance code in low 10 bits\n and number of extra bits in high 6 bits. */\n uint16_t dist_prefix_;\n} Command;\n\n/* distance_code is e.g. 0 for same-as-last short code, or 16 for offset 1. */\nstatic BROTLI_INLINE void InitCommand(Command* self,\n const BrotliDistanceParams* dist, size_t insertlen,\n size_t copylen, int copylen_code_delta, size_t distance_code) {\n /* Don't rely on signed int representation, use honest casts. */\n uint32_t delta = (uint8_t)((int8_t)copylen_code_delta);\n self->insert_len_ = (uint32_t)insertlen;\n self->copy_len_ = (uint32_t)(copylen | (delta << 25));\n /* The distance prefix and extra bits are stored in this Command as if\n npostfix and ndirect were 0, they are only recomputed later after the\n clustering if needed. */\n PrefixEncodeCopyDistance(\n distance_code, dist->num_direct_distance_codes,\n dist->distance_postfix_bits, &self->dist_prefix_, &self->dist_extra_);\n GetLengthCode(\n insertlen, (size_t)((int)copylen + copylen_code_delta),\n TO_BROTLI_BOOL((self->dist_prefix_ & 0x3FF) == 0), &self->cmd_prefix_);\n}\n\nstatic BROTLI_INLINE void InitInsertCommand(Command* self, size_t insertlen) {\n self->insert_len_ = (uint32_t)insertlen;\n self->copy_len_ = 4 << 25;\n self->dist_extra_ = 0;\n self->dist_prefix_ = BROTLI_NUM_DISTANCE_SHORT_CODES;\n GetLengthCode(insertlen, 4, BROTLI_FALSE, &self->cmd_prefix_);\n}\n\nstatic BROTLI_INLINE uint32_t CommandRestoreDistanceCode(\n const Command* self, const BrotliDistanceParams* dist) {\n if ((self->dist_prefix_ & 0x3FFu) <\n BROTLI_NUM_DISTANCE_SHORT_CODES + dist->num_direct_distance_codes) {\n return self->dist_prefix_ & 0x3FFu;\n } else {\n uint32_t dcode = self->dist_prefix_ & 0x3FFu;\n uint32_t nbits = self->dist_prefix_ >> 10;\n uint32_t extra = self->dist_extra_;\n uint32_t postfix_mask = (1U << dist->distance_postfix_bits) - 1U;\n uint32_t hcode = (dcode - dist->num_direct_distance_codes -\n BROTLI_NUM_DISTANCE_SHORT_CODES) >>\n dist->distance_postfix_bits;\n uint32_t lcode = (dcode - dist->num_direct_distance_codes -\n BROTLI_NUM_DISTANCE_SHORT_CODES) & postfix_mask;\n uint32_t offset = ((2U + (hcode & 1U)) << nbits) - 4U;\n return ((offset + extra) << dist->distance_postfix_bits) + lcode +\n dist->num_direct_distance_codes + BROTLI_NUM_DISTANCE_SHORT_CODES;\n }\n}\n\nstatic BROTLI_INLINE uint32_t CommandDistanceContext(const Command* self) {\n uint32_t r = self->cmd_prefix_ >> 6;\n uint32_t c = self->cmd_prefix_ & 7;\n if ((r == 0 || r == 2 || r == 4 || r == 7) && (c <= 2)) {\n return c;\n }\n return 3;\n}\n\nstatic BROTLI_INLINE uint32_t CommandCopyLen(const Command* self) {\n return self->copy_len_ & 0x1FFFFFF;\n}\n\nstatic BROTLI_INLINE uint32_t CommandCopyLenCode(const Command* self) {\n uint32_t modifier = self->copy_len_ >> 25;\n int32_t delta = (int8_t)((uint8_t)(modifier | ((modifier & 0x40) << 1)));\n return (uint32_t)((int32_t)(self->copy_len_ & 0x1FFFFFF) + delta);\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_COMMAND_H_ */\n" }, { "path": "libs/brotli/enc/compound_dictionary.c", "content": "/* Copyright 2017 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"compound_dictionary.h\"\n\n#include \"../common/platform.h\"\n#include \n#include \"memory.h\"\n\nstatic PreparedDictionary* CreatePreparedDictionaryWithParams(MemoryManager* m,\n const uint8_t* source, size_t source_size, uint32_t bucket_bits,\n uint32_t slot_bits, uint32_t hash_bits, uint16_t bucket_limit) {\n /* Step 1: create \"bloated\" hasher. */\n uint32_t num_slots = 1u << slot_bits;\n uint32_t num_buckets = 1u << bucket_bits;\n uint32_t hash_shift = 64u - bucket_bits;\n uint64_t hash_mask = (~((uint64_t)0U)) >> (64 - hash_bits);\n uint32_t slot_mask = num_slots - 1;\n size_t alloc_size = (sizeof(uint32_t) << slot_bits) +\n (sizeof(uint32_t) << slot_bits) +\n (sizeof(uint16_t) << bucket_bits) +\n (sizeof(uint32_t) << bucket_bits) +\n (sizeof(uint32_t) * source_size);\n uint8_t* flat = NULL;\n PreparedDictionary* result = NULL;\n uint16_t* num = NULL;\n uint32_t* bucket_heads = NULL;\n uint32_t* next_bucket = NULL;\n uint32_t* slot_offsets = NULL;\n uint16_t* heads = NULL;\n uint32_t* items = NULL;\n uint8_t** source_ref = NULL;\n uint32_t i;\n uint32_t* slot_size = NULL;\n uint32_t* slot_limit = NULL;\n uint32_t total_items = 0;\n if (slot_bits > 16) return NULL;\n if (slot_bits > bucket_bits) return NULL;\n if (bucket_bits - slot_bits >= 16) return NULL;\n\n flat = BROTLI_ALLOC(m, uint8_t, alloc_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(flat)) return NULL;\n\n slot_size = (uint32_t*)flat;\n slot_limit = (uint32_t*)(&slot_size[num_slots]);\n num = (uint16_t*)(&slot_limit[num_slots]);\n bucket_heads = (uint32_t*)(&num[num_buckets]);\n next_bucket = (uint32_t*)(&bucket_heads[num_buckets]);\n memset(num, 0, num_buckets * sizeof(num[0]));\n\n /* TODO(eustas): apply custom \"store\" order. */\n for (i = 0; i + 7 < source_size; ++i) {\n const uint64_t h = (BROTLI_UNALIGNED_LOAD64LE(&source[i]) & hash_mask) *\n kPreparedDictionaryHashMul64Long;\n const uint32_t key = (uint32_t)(h >> hash_shift);\n uint16_t count = num[key];\n next_bucket[i] = (count == 0) ? ((uint32_t)(-1)) : bucket_heads[key];\n bucket_heads[key] = i;\n count++;\n if (count > bucket_limit) count = bucket_limit;\n num[key] = count;\n }\n\n /* Step 2: find slot limits. */\n for (i = 0; i < num_slots; ++i) {\n BROTLI_BOOL overflow = BROTLI_FALSE;\n slot_limit[i] = bucket_limit;\n while (BROTLI_TRUE) {\n uint32_t limit = slot_limit[i];\n size_t j;\n uint32_t count = 0;\n overflow = BROTLI_FALSE;\n for (j = i; j < num_buckets; j += num_slots) {\n uint32_t size = num[j];\n /* Last chain may span behind 64K limit; overflow happens only if\n we are about to use 0xFFFF+ as item offset. */\n if (count >= 0xFFFF) {\n overflow = BROTLI_TRUE;\n break;\n }\n if (size > limit) size = limit;\n count += size;\n }\n if (!overflow) {\n slot_size[i] = count;\n total_items += count;\n break;\n }\n slot_limit[i]--;\n }\n }\n\n /* Step 3: transfer data to \"slim\" hasher. */\n alloc_size = sizeof(PreparedDictionary) + (sizeof(uint32_t) << slot_bits) +\n (sizeof(uint16_t) << bucket_bits) + (sizeof(uint32_t) * total_items) +\n sizeof(uint8_t*);\n\n result = (PreparedDictionary*)BROTLI_ALLOC(m, uint8_t, alloc_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(result)) {\n BROTLI_FREE(m, flat);\n return NULL;\n }\n slot_offsets = (uint32_t*)(&result[1]);\n heads = (uint16_t*)(&slot_offsets[num_slots]);\n items = (uint32_t*)(&heads[num_buckets]);\n source_ref = (uint8_t**)(&items[total_items]);\n\n result->magic = kLeanPreparedDictionaryMagic;\n result->num_items = total_items;\n result->source_size = (uint32_t)source_size;\n result->hash_bits = hash_bits;\n result->bucket_bits = bucket_bits;\n result->slot_bits = slot_bits;\n BROTLI_UNALIGNED_STORE_PTR(source_ref, source);\n\n total_items = 0;\n for (i = 0; i < num_slots; ++i) {\n slot_offsets[i] = total_items;\n total_items += slot_size[i];\n slot_size[i] = 0;\n }\n for (i = 0; i < num_buckets; ++i) {\n uint32_t slot = i & slot_mask;\n uint32_t count = num[i];\n uint32_t pos;\n size_t j;\n size_t cursor = slot_size[slot];\n if (count > slot_limit[slot]) count = slot_limit[slot];\n if (count == 0) {\n heads[i] = 0xFFFF;\n continue;\n }\n heads[i] = (uint16_t)cursor;\n cursor += slot_offsets[slot];\n slot_size[slot] += count;\n pos = bucket_heads[i];\n for (j = 0; j < count; j++) {\n items[cursor++] = pos;\n pos = next_bucket[pos];\n }\n items[cursor - 1] |= 0x80000000;\n }\n\n BROTLI_FREE(m, flat);\n return result;\n}\n\nPreparedDictionary* CreatePreparedDictionary(MemoryManager* m,\n const uint8_t* source, size_t source_size) {\n uint32_t bucket_bits = 17;\n uint32_t slot_bits = 7;\n uint32_t hash_bits = 40;\n uint16_t bucket_limit = 32;\n size_t volume = 16u << bucket_bits;\n /* Tune parameters to fit dictionary size. */\n while (volume < source_size && bucket_bits < 22) {\n bucket_bits++;\n slot_bits++;\n volume <<= 1;\n }\n return CreatePreparedDictionaryWithParams(m,\n source, source_size, bucket_bits, slot_bits, hash_bits, bucket_limit);\n}\n\nvoid DestroyPreparedDictionary(MemoryManager* m,\n PreparedDictionary* dictionary) {\n if (!dictionary) return;\n BROTLI_FREE(m, dictionary);\n}\n\nBROTLI_BOOL AttachPreparedDictionary(\n CompoundDictionary* compound, const PreparedDictionary* dictionary) {\n size_t length = 0;\n size_t index = 0;\n\n if (compound->num_chunks == SHARED_BROTLI_MAX_COMPOUND_DICTS) {\n return BROTLI_FALSE;\n }\n\n if (!dictionary) return BROTLI_FALSE;\n\n length = dictionary->source_size;\n index = compound->num_chunks;\n compound->total_size += length;\n compound->chunks[index] = dictionary;\n compound->chunk_offsets[index + 1] = compound->total_size;\n {\n uint32_t* slot_offsets = (uint32_t*)(&dictionary[1]);\n uint16_t* heads = (uint16_t*)(&slot_offsets[(size_t)1u << dictionary->slot_bits]);\n uint32_t* items = (uint32_t*)(&heads[(size_t)1u << dictionary->bucket_bits]);\n const void* tail = (void*)&items[dictionary->num_items];\n if (dictionary->magic == kPreparedDictionaryMagic) {\n compound->chunk_source[index] = (const uint8_t*)tail;\n } else {\n /* dictionary->magic == kLeanPreparedDictionaryMagic */\n compound->chunk_source[index] =\n (const uint8_t*)BROTLI_UNALIGNED_LOAD_PTR((const uint8_t**)tail);\n }\n }\n compound->num_chunks++;\n return BROTLI_TRUE;\n}\n" }, { "path": "libs/brotli/enc/compound_dictionary.h", "content": "/* Copyright 2017 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#ifndef BROTLI_ENC_PREPARED_DICTIONARY_H_\n#define BROTLI_ENC_PREPARED_DICTIONARY_H_\n\n#include \"../common/platform.h\"\n#include \n#include \"memory.h\"\n\n/* \"Fat\" prepared dictionary, could be cooked outside of C implementation,\n * e.g. on Java side. LZ77 data is copied inside PreparedDictionary struct. */\nstatic const uint32_t kPreparedDictionaryMagic = 0xDEBCEDE0;\n\nstatic const uint32_t kSharedDictionaryMagic = 0xDEBCEDE1;\n\nstatic const uint32_t kManagedDictionaryMagic = 0xDEBCEDE2;\n\n/* \"Lean\" prepared dictionary. LZ77 data is referenced. It is the responsibility\n * of caller of \"prepare dictionary\" to keep the LZ77 data while prepared\n * dictionary is in use. */\nstatic const uint32_t kLeanPreparedDictionaryMagic = 0xDEBCEDE3;\n\nstatic const uint64_t kPreparedDictionaryHashMul64Long =\n BROTLI_MAKE_UINT64_T(0x1FE35A7Bu, 0xD3579BD3u);\n\ntypedef struct PreparedDictionary {\n uint32_t magic;\n uint32_t num_items;\n uint32_t source_size;\n uint32_t hash_bits;\n uint32_t bucket_bits;\n uint32_t slot_bits;\n\n /* --- Dynamic size members --- */\n\n /* uint32_t slot_offsets[1 << slot_bits]; */\n /* uint16_t heads[1 << bucket_bits]; */\n /* uint32_t items[variable]; */\n\n /* [maybe] uint8_t* source_ref, depending on magic. */\n /* [maybe] uint8_t source[source_size], depending on magic. */\n} PreparedDictionary;\n\nBROTLI_INTERNAL PreparedDictionary* CreatePreparedDictionary(MemoryManager* m,\n const uint8_t* source, size_t source_size);\n\nBROTLI_INTERNAL void DestroyPreparedDictionary(MemoryManager* m,\n PreparedDictionary* dictionary);\n\ntypedef struct CompoundDictionary {\n /* LZ77 prefix, compound dictionary */\n size_t num_chunks;\n size_t total_size;\n /* Client instances. */\n const PreparedDictionary* chunks[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];\n const uint8_t* chunk_source[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];\n size_t chunk_offsets[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];\n\n size_t num_prepared_instances_;\n /* Owned instances. */\n PreparedDictionary* prepared_instances_[SHARED_BROTLI_MAX_COMPOUND_DICTS + 1];\n} CompoundDictionary;\n\nBROTLI_INTERNAL BROTLI_BOOL AttachPreparedDictionary(\n CompoundDictionary* compound, const PreparedDictionary* dictionary);\n\n#endif /* BROTLI_ENC_PREPARED_DICTIONARY */\n" }, { "path": "libs/brotli/enc/compress_fragment.c", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function for fast encoding of an input fragment, independently from the input\n history. This function uses one-pass processing: when we find a backward\n match, we immediately emit the corresponding command and literal codes to\n the bit stream.\n\n Adapted from the CompressFragment() function in\n https://github.com/google/snappy/blob/master/snappy.cc */\n\n#include \"compress_fragment.h\"\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"brotli_bit_stream.h\"\n#include \"entropy_encode.h\"\n#include \"fast_log.h\"\n#include \"find_match_length.h\"\n#include \"hash_base.h\"\n#include \"write_bits.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define MAX_DISTANCE (long)BROTLI_MAX_BACKWARD_LIMIT(18)\n\nstatic BROTLI_INLINE uint32_t Hash(const uint8_t* p, size_t shift) {\n const uint64_t h = (BROTLI_UNALIGNED_LOAD64LE(p) << 24) * kHashMul32;\n return (uint32_t)(h >> shift);\n}\n\nstatic BROTLI_INLINE uint32_t HashBytesAtOffset(\n uint64_t v, int offset, size_t shift) {\n BROTLI_DCHECK(offset >= 0);\n BROTLI_DCHECK(offset <= 3);\n {\n const uint64_t h = ((v >> (8 * offset)) << 24) * kHashMul32;\n return (uint32_t)(h >> shift);\n }\n}\n\nstatic BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2) {\n return TO_BROTLI_BOOL(\n BrotliUnalignedRead32(p1) == BrotliUnalignedRead32(p2) &&\n p1[4] == p2[4]);\n}\n\n/* Builds a literal prefix code into \"depths\" and \"bits\" based on the statistics\n of the \"input\" string and stores it into the bit stream.\n Note that the prefix code here is built from the pre-LZ77 input, therefore\n we can only approximate the statistics of the actual literal stream.\n Moreover, for long inputs we build a histogram from a sample of the input\n and thus have to assign a non-zero depth for each literal.\n Returns estimated compression ratio millibytes/char for encoding given input\n with generated code. */\nstatic size_t BuildAndStoreLiteralPrefixCode(BrotliOnePassArena* s,\n const uint8_t* input,\n const size_t input_size,\n uint8_t depths[256],\n uint16_t bits[256],\n size_t* storage_ix,\n uint8_t* storage) {\n uint32_t* BROTLI_RESTRICT const histogram = s->histogram;\n size_t histogram_total;\n size_t i;\n memset(histogram, 0, sizeof(s->histogram));\n\n if (input_size < (1 << 15)) {\n for (i = 0; i < input_size; ++i) {\n ++histogram[input[i]];\n }\n histogram_total = input_size;\n for (i = 0; i < 256; ++i) {\n /* We weigh the first 11 samples with weight 3 to account for the\n balancing effect of the LZ77 phase on the histogram. */\n const uint32_t adjust = 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);\n histogram[i] += adjust;\n histogram_total += adjust;\n }\n } else {\n static const size_t kSampleRate = 29;\n for (i = 0; i < input_size; i += kSampleRate) {\n ++histogram[input[i]];\n }\n histogram_total = (input_size + kSampleRate - 1) / kSampleRate;\n for (i = 0; i < 256; ++i) {\n /* We add 1 to each population count to avoid 0 bit depths (since this is\n only a sample and we don't know if the symbol appears or not), and we\n weigh the first 11 samples with weight 3 to account for the balancing\n effect of the LZ77 phase on the histogram (more frequent symbols are\n more likely to be in backward references instead as literals). */\n const uint32_t adjust = 1 + 2 * BROTLI_MIN(uint32_t, histogram[i], 11u);\n histogram[i] += adjust;\n histogram_total += adjust;\n }\n }\n BrotliBuildAndStoreHuffmanTreeFast(s->tree, histogram, histogram_total,\n /* max_bits = */ 8,\n depths, bits, storage_ix, storage);\n {\n size_t literal_ratio = 0;\n for (i = 0; i < 256; ++i) {\n if (histogram[i]) literal_ratio += histogram[i] * depths[i];\n }\n /* Estimated encoding ratio, millibytes per symbol. */\n return (literal_ratio * 125) / histogram_total;\n }\n}\n\n/* Builds a command and distance prefix code (each 64 symbols) into \"depth\" and\n \"bits\" based on \"histogram\" and stores it into the bit stream. */\nstatic void BuildAndStoreCommandPrefixCode(BrotliOnePassArena* s,\n size_t* storage_ix, uint8_t* storage) {\n const uint32_t* const histogram = s->cmd_histo;\n uint8_t* const depth = s->cmd_depth;\n uint16_t* const bits = s->cmd_bits;\n uint8_t* BROTLI_RESTRICT const tmp_depth = s->tmp_depth;\n uint16_t* BROTLI_RESTRICT const tmp_bits = s->tmp_bits;\n /* TODO(eustas): do only once on initialization. */\n memset(tmp_depth, 0, BROTLI_NUM_COMMAND_SYMBOLS);\n\n BrotliCreateHuffmanTree(histogram, 64, 15, s->tree, depth);\n BrotliCreateHuffmanTree(&histogram[64], 64, 14, s->tree, &depth[64]);\n /* We have to jump through a few hoops here in order to compute\n the command bits because the symbols are in a different order than in\n the full alphabet. This looks complicated, but having the symbols\n in this order in the command bits saves a few branches in the Emit*\n functions. */\n memcpy(tmp_depth, depth, 24);\n memcpy(tmp_depth + 24, depth + 40, 8);\n memcpy(tmp_depth + 32, depth + 24, 8);\n memcpy(tmp_depth + 40, depth + 48, 8);\n memcpy(tmp_depth + 48, depth + 32, 8);\n memcpy(tmp_depth + 56, depth + 56, 8);\n BrotliConvertBitDepthsToSymbols(tmp_depth, 64, tmp_bits);\n memcpy(bits, tmp_bits, 48);\n memcpy(bits + 24, tmp_bits + 32, 16);\n memcpy(bits + 32, tmp_bits + 48, 16);\n memcpy(bits + 40, tmp_bits + 24, 16);\n memcpy(bits + 48, tmp_bits + 40, 16);\n memcpy(bits + 56, tmp_bits + 56, 16);\n BrotliConvertBitDepthsToSymbols(&depth[64], 64, &bits[64]);\n {\n /* Create the bit length array for the full command alphabet. */\n size_t i;\n memset(tmp_depth, 0, 64); /* only 64 first values were used */\n memcpy(tmp_depth, depth, 8);\n memcpy(tmp_depth + 64, depth + 8, 8);\n memcpy(tmp_depth + 128, depth + 16, 8);\n memcpy(tmp_depth + 192, depth + 24, 8);\n memcpy(tmp_depth + 384, depth + 32, 8);\n for (i = 0; i < 8; ++i) {\n tmp_depth[128 + 8 * i] = depth[40 + i];\n tmp_depth[256 + 8 * i] = depth[48 + i];\n tmp_depth[448 + 8 * i] = depth[56 + i];\n }\n /* TODO(eustas): could/should full-length machinery be avoided? */\n BrotliStoreHuffmanTree(\n tmp_depth, BROTLI_NUM_COMMAND_SYMBOLS, s->tree, storage_ix, storage);\n }\n BrotliStoreHuffmanTree(&depth[64], 64, s->tree, storage_ix, storage);\n}\n\n/* REQUIRES: insertlen < 6210 */\nstatic BROTLI_INLINE void EmitInsertLen(size_t insertlen,\n const uint8_t depth[128],\n const uint16_t bits[128],\n uint32_t histo[128],\n size_t* storage_ix,\n uint8_t* storage) {\n if (insertlen < 6) {\n const size_t code = insertlen + 40;\n BrotliWriteBits(depth[code], bits[code], storage_ix, storage);\n ++histo[code];\n } else if (insertlen < 130) {\n const size_t tail = insertlen - 2;\n const uint32_t nbits = Log2FloorNonZero(tail) - 1u;\n const size_t prefix = tail >> nbits;\n const size_t inscode = (nbits << 1) + prefix + 42;\n BrotliWriteBits(depth[inscode], bits[inscode], storage_ix, storage);\n BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);\n ++histo[inscode];\n } else if (insertlen < 2114) {\n const size_t tail = insertlen - 66;\n const uint32_t nbits = Log2FloorNonZero(tail);\n const size_t code = nbits + 50;\n BrotliWriteBits(depth[code], bits[code], storage_ix, storage);\n BrotliWriteBits(nbits, tail - ((size_t)1 << nbits), storage_ix, storage);\n ++histo[code];\n } else {\n BrotliWriteBits(depth[61], bits[61], storage_ix, storage);\n BrotliWriteBits(12, insertlen - 2114, storage_ix, storage);\n ++histo[61];\n }\n}\n\nstatic BROTLI_INLINE void EmitLongInsertLen(size_t insertlen,\n const uint8_t depth[128],\n const uint16_t bits[128],\n uint32_t histo[128],\n size_t* storage_ix,\n uint8_t* storage) {\n if (insertlen < 22594) {\n BrotliWriteBits(depth[62], bits[62], storage_ix, storage);\n BrotliWriteBits(14, insertlen - 6210, storage_ix, storage);\n ++histo[62];\n } else {\n BrotliWriteBits(depth[63], bits[63], storage_ix, storage);\n BrotliWriteBits(24, insertlen - 22594, storage_ix, storage);\n ++histo[63];\n }\n}\n\nstatic BROTLI_INLINE void EmitCopyLen(size_t copylen,\n const uint8_t depth[128],\n const uint16_t bits[128],\n uint32_t histo[128],\n size_t* storage_ix,\n uint8_t* storage) {\n if (copylen < 10) {\n BrotliWriteBits(\n depth[copylen + 14], bits[copylen + 14], storage_ix, storage);\n ++histo[copylen + 14];\n } else if (copylen < 134) {\n const size_t tail = copylen - 6;\n const uint32_t nbits = Log2FloorNonZero(tail) - 1u;\n const size_t prefix = tail >> nbits;\n const size_t code = (nbits << 1) + prefix + 20;\n BrotliWriteBits(depth[code], bits[code], storage_ix, storage);\n BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);\n ++histo[code];\n } else if (copylen < 2118) {\n const size_t tail = copylen - 70;\n const uint32_t nbits = Log2FloorNonZero(tail);\n const size_t code = nbits + 28;\n BrotliWriteBits(depth[code], bits[code], storage_ix, storage);\n BrotliWriteBits(nbits, tail - ((size_t)1 << nbits), storage_ix, storage);\n ++histo[code];\n } else {\n BrotliWriteBits(depth[39], bits[39], storage_ix, storage);\n BrotliWriteBits(24, copylen - 2118, storage_ix, storage);\n ++histo[39];\n }\n}\n\nstatic BROTLI_INLINE void EmitCopyLenLastDistance(size_t copylen,\n const uint8_t depth[128],\n const uint16_t bits[128],\n uint32_t histo[128],\n size_t* storage_ix,\n uint8_t* storage) {\n if (copylen < 12) {\n BrotliWriteBits(depth[copylen - 4], bits[copylen - 4], storage_ix, storage);\n ++histo[copylen - 4];\n } else if (copylen < 72) {\n const size_t tail = copylen - 8;\n const uint32_t nbits = Log2FloorNonZero(tail) - 1;\n const size_t prefix = tail >> nbits;\n const size_t code = (nbits << 1) + prefix + 4;\n BrotliWriteBits(depth[code], bits[code], storage_ix, storage);\n BrotliWriteBits(nbits, tail - (prefix << nbits), storage_ix, storage);\n ++histo[code];\n } else if (copylen < 136) {\n const size_t tail = copylen - 8;\n const size_t code = (tail >> 5) + 30;\n BrotliWriteBits(depth[code], bits[code], storage_ix, storage);\n BrotliWriteBits(5, tail & 31, storage_ix, storage);\n BrotliWriteBits(depth[64], bits[64], storage_ix, storage);\n ++histo[code];\n ++histo[64];\n } else if (copylen < 2120) {\n const size_t tail = copylen - 72;\n const uint32_t nbits = Log2FloorNonZero(tail);\n const size_t code = nbits + 28;\n BrotliWriteBits(depth[code], bits[code], storage_ix, storage);\n BrotliWriteBits(nbits, tail - ((size_t)1 << nbits), storage_ix, storage);\n BrotliWriteBits(depth[64], bits[64], storage_ix, storage);\n ++histo[code];\n ++histo[64];\n } else {\n BrotliWriteBits(depth[39], bits[39], storage_ix, storage);\n BrotliWriteBits(24, copylen - 2120, storage_ix, storage);\n BrotliWriteBits(depth[64], bits[64], storage_ix, storage);\n ++histo[39];\n ++histo[64];\n }\n}\n\nstatic BROTLI_INLINE void EmitDistance(size_t distance,\n const uint8_t depth[128],\n const uint16_t bits[128],\n uint32_t histo[128],\n size_t* storage_ix, uint8_t* storage) {\n const size_t d = distance + 3;\n const uint32_t nbits = Log2FloorNonZero(d) - 1u;\n const size_t prefix = (d >> nbits) & 1;\n const size_t offset = (2 + prefix) << nbits;\n const size_t distcode = 2 * (nbits - 1) + prefix + 80;\n BrotliWriteBits(depth[distcode], bits[distcode], storage_ix, storage);\n BrotliWriteBits(nbits, d - offset, storage_ix, storage);\n ++histo[distcode];\n}\n\nstatic BROTLI_INLINE void EmitLiterals(const uint8_t* input, const size_t len,\n const uint8_t depth[256],\n const uint16_t bits[256],\n size_t* storage_ix, uint8_t* storage) {\n size_t j;\n for (j = 0; j < len; j++) {\n const uint8_t lit = input[j];\n BrotliWriteBits(depth[lit], bits[lit], storage_ix, storage);\n }\n}\n\n/* REQUIRES: len <= 1 << 24. */\nstatic void BrotliStoreMetaBlockHeader(\n size_t len, BROTLI_BOOL is_uncompressed, size_t* storage_ix,\n uint8_t* storage) {\n size_t nibbles = 6;\n /* ISLAST */\n BrotliWriteBits(1, 0, storage_ix, storage);\n if (len <= (1U << 16)) {\n nibbles = 4;\n } else if (len <= (1U << 20)) {\n nibbles = 5;\n }\n BrotliWriteBits(2, nibbles - 4, storage_ix, storage);\n BrotliWriteBits(nibbles * 4, len - 1, storage_ix, storage);\n /* ISUNCOMPRESSED */\n BrotliWriteBits(1, (uint64_t)is_uncompressed, storage_ix, storage);\n}\n\nstatic void UpdateBits(size_t n_bits, uint32_t bits, size_t pos,\n uint8_t* array) {\n while (n_bits > 0) {\n size_t byte_pos = pos >> 3;\n size_t n_unchanged_bits = pos & 7;\n size_t n_changed_bits = BROTLI_MIN(size_t, n_bits, 8 - n_unchanged_bits);\n size_t total_bits = n_unchanged_bits + n_changed_bits;\n uint32_t mask =\n (~((1u << total_bits) - 1u)) | ((1u << n_unchanged_bits) - 1u);\n uint32_t unchanged_bits = array[byte_pos] & mask;\n uint32_t changed_bits = bits & ((1u << n_changed_bits) - 1u);\n array[byte_pos] =\n (uint8_t)((changed_bits << n_unchanged_bits) | unchanged_bits);\n n_bits -= n_changed_bits;\n bits >>= n_changed_bits;\n pos += n_changed_bits;\n }\n}\n\nstatic void RewindBitPosition(const size_t new_storage_ix,\n size_t* storage_ix, uint8_t* storage) {\n const size_t bitpos = new_storage_ix & 7;\n const size_t mask = (1u << bitpos) - 1;\n storage[new_storage_ix >> 3] &= (uint8_t)mask;\n *storage_ix = new_storage_ix;\n}\n\nstatic BROTLI_BOOL ShouldMergeBlock(BrotliOnePassArena* s,\n const uint8_t* data, size_t len, const uint8_t* depths) {\n uint32_t* BROTLI_RESTRICT const histo = s->histogram;\n static const size_t kSampleRate = 43;\n size_t i;\n memset(histo, 0, sizeof(s->histogram));\n for (i = 0; i < len; i += kSampleRate) {\n ++histo[data[i]];\n }\n {\n const size_t total = (len + kSampleRate - 1) / kSampleRate;\n double r = (FastLog2(total) + 0.5) * (double)total + 200;\n for (i = 0; i < 256; ++i) {\n r -= (double)histo[i] * (depths[i] + FastLog2(histo[i]));\n }\n return TO_BROTLI_BOOL(r >= 0.0);\n }\n}\n\n/* Acceptable loss for uncompressible speedup is 2% */\n#define MIN_RATIO 980\n\nstatic BROTLI_INLINE BROTLI_BOOL ShouldUseUncompressedMode(\n const uint8_t* metablock_start, const uint8_t* next_emit,\n const size_t insertlen, const size_t literal_ratio) {\n const size_t compressed = (size_t)(next_emit - metablock_start);\n if (compressed * 50 > insertlen) {\n return BROTLI_FALSE;\n } else {\n return TO_BROTLI_BOOL(literal_ratio > MIN_RATIO);\n }\n}\n\nstatic void EmitUncompressedMetaBlock(const uint8_t* begin, const uint8_t* end,\n const size_t storage_ix_start,\n size_t* storage_ix, uint8_t* storage) {\n const size_t len = (size_t)(end - begin);\n RewindBitPosition(storage_ix_start, storage_ix, storage);\n BrotliStoreMetaBlockHeader(len, 1, storage_ix, storage);\n *storage_ix = (*storage_ix + 7u) & ~7u;\n memcpy(&storage[*storage_ix >> 3], begin, len);\n *storage_ix += len << 3;\n storage[*storage_ix >> 3] = 0;\n}\n\nstatic BROTLI_MODEL(\"small\") uint32_t kCmdHistoSeed[128] = {\n 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1,\n 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1,\n 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\n 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\n 1, 1, 1, 1, 0, 0, 0, 0,\n};\n\nstatic BROTLI_INLINE void BrotliCompressFragmentFastImpl(\n BrotliOnePassArena* s, const uint8_t* input, size_t input_size,\n BROTLI_BOOL is_last, int* table, size_t table_bits,\n size_t* storage_ix, uint8_t* storage) {\n uint8_t* BROTLI_RESTRICT const cmd_depth = s->cmd_depth;\n uint16_t* BROTLI_RESTRICT const cmd_bits = s->cmd_bits;\n uint32_t* BROTLI_RESTRICT const cmd_histo = s->cmd_histo;\n uint8_t* BROTLI_RESTRICT const lit_depth = s->lit_depth;\n uint16_t* BROTLI_RESTRICT const lit_bits = s->lit_bits;\n const uint8_t* ip_end;\n\n /* \"next_emit\" is a pointer to the first byte that is not covered by a\n previous copy. Bytes between \"next_emit\" and the start of the next copy or\n the end of the input will be emitted as literal bytes. */\n const uint8_t* next_emit = input;\n /* Save the start of the first block for position and distance computations.\n */\n const uint8_t* base_ip = input;\n\n static const size_t kFirstBlockSize = 3 << 15;\n static const size_t kMergeBlockSize = 1 << 16;\n\n const size_t kInputMarginBytes = BROTLI_WINDOW_GAP;\n const size_t kMinMatchLen = 5;\n\n const uint8_t* metablock_start = input;\n size_t block_size = BROTLI_MIN(size_t, input_size, kFirstBlockSize);\n size_t total_block_size = block_size;\n /* Save the bit position of the MLEN field of the meta-block header, so that\n we can update it later if we decide to extend this meta-block. */\n size_t mlen_storage_ix = *storage_ix + 3;\n\n size_t literal_ratio;\n\n const uint8_t* ip;\n int last_distance;\n\n const size_t shift = 64u - table_bits;\n\n BrotliStoreMetaBlockHeader(block_size, 0, storage_ix, storage);\n /* No block splits, no contexts. */\n BrotliWriteBits(13, 0, storage_ix, storage);\n\n literal_ratio = BuildAndStoreLiteralPrefixCode(\n s, input, block_size, s->lit_depth, s->lit_bits, storage_ix, storage);\n\n {\n /* Store the pre-compressed command and distance prefix codes. */\n size_t i;\n for (i = 0; i + 7 < s->cmd_code_numbits; i += 8) {\n BrotliWriteBits(8, s->cmd_code[i >> 3], storage_ix, storage);\n }\n }\n BrotliWriteBits(s->cmd_code_numbits & 7,\n s->cmd_code[s->cmd_code_numbits >> 3], storage_ix, storage);\n\n emit_commands:\n /* Initialize the command and distance histograms. We will gather\n statistics of command and distance codes during the processing\n of this block and use it to update the command and distance\n prefix codes for the next block. */\n memcpy(s->cmd_histo, kCmdHistoSeed, sizeof(kCmdHistoSeed));\n\n /* \"ip\" is the input pointer. */\n ip = input;\n last_distance = -1;\n ip_end = input + block_size;\n\n if (BROTLI_PREDICT_TRUE(block_size >= kInputMarginBytes)) {\n /* For the last block, we need to keep a 16 bytes margin so that we can be\n sure that all distances are at most window size - 16.\n For all other blocks, we only need to keep a margin of 5 bytes so that\n we don't go over the block size with a copy. */\n const size_t len_limit = BROTLI_MIN(size_t, block_size - kMinMatchLen,\n input_size - kInputMarginBytes);\n const uint8_t* ip_limit = input + len_limit;\n\n uint32_t next_hash;\n for (next_hash = Hash(++ip, shift); ; ) {\n /* Step 1: Scan forward in the input looking for a 5-byte-long match.\n If we get close to exhausting the input then goto emit_remainder.\n\n Heuristic match skipping: If 32 bytes are scanned with no matches\n found, start looking only at every other byte. If 32 more bytes are\n scanned, look at every third byte, etc.. When a match is found,\n immediately go back to looking at every byte. This is a small loss\n (~5% performance, ~0.1% density) for compressible data due to more\n bookkeeping, but for non-compressible data (such as JPEG) it's a huge\n win since the compressor quickly \"realizes\" the data is incompressible\n and doesn't bother looking for matches everywhere.\n\n The \"skip\" variable keeps track of how many bytes there are since the\n last match; dividing it by 32 (i.e. right-shifting by five) gives the\n number of bytes to move ahead for each iteration. */\n uint32_t skip = 32;\n\n const uint8_t* next_ip = ip;\n const uint8_t* candidate;\n BROTLI_DCHECK(next_emit < ip);\ntrawl:\n do {\n uint32_t hash = next_hash;\n uint32_t bytes_between_hash_lookups = skip++ >> 5;\n BROTLI_DCHECK(hash == Hash(next_ip, shift));\n ip = next_ip;\n next_ip = ip + bytes_between_hash_lookups;\n if (BROTLI_PREDICT_FALSE(next_ip > ip_limit)) {\n goto emit_remainder;\n }\n next_hash = Hash(next_ip, shift);\n candidate = ip - last_distance;\n if (IsMatch(ip, candidate)) {\n if (BROTLI_PREDICT_TRUE(candidate < ip)) {\n table[hash] = (int)(ip - base_ip);\n break;\n }\n }\n candidate = base_ip + table[hash];\n BROTLI_DCHECK(candidate >= base_ip);\n BROTLI_DCHECK(candidate < ip);\n\n table[hash] = (int)(ip - base_ip);\n } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate)));\n\n /* Check copy distance. If candidate is not feasible, continue search.\n Checking is done outside of hot loop to reduce overhead. */\n if (ip - candidate > MAX_DISTANCE) goto trawl;\n\n /* Step 2: Emit the found match together with the literal bytes from\n \"next_emit\" to the bit stream, and then see if we can find a next match\n immediately afterwards. Repeat until we find no match for the input\n without emitting some literal bytes. */\n\n {\n /* We have a 5-byte match at ip, and we need to emit bytes in\n [next_emit, ip). */\n const uint8_t* base = ip;\n size_t matched = 5 + FindMatchLengthWithLimit(\n candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);\n int distance = (int)(base - candidate); /* > 0 */\n size_t insert = (size_t)(base - next_emit);\n ip += matched;\n BROTLI_LOG((\"[CompressFragment] pos = %d insert = %lu copy = %d\\n\",\n (int)(next_emit - base_ip), (unsigned long)insert, 2));\n BROTLI_DCHECK(0 == memcmp(base, candidate, matched));\n if (BROTLI_PREDICT_TRUE(insert < 6210)) {\n EmitInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,\n storage_ix, storage);\n } else if (ShouldUseUncompressedMode(metablock_start, next_emit, insert,\n literal_ratio)) {\n EmitUncompressedMetaBlock(metablock_start, base, mlen_storage_ix - 3,\n storage_ix, storage);\n input_size -= (size_t)(base - input);\n input = base;\n next_emit = input;\n goto next_block;\n } else {\n EmitLongInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,\n storage_ix, storage);\n }\n EmitLiterals(next_emit, insert, lit_depth, lit_bits,\n storage_ix, storage);\n if (distance == last_distance) {\n BrotliWriteBits(cmd_depth[64], cmd_bits[64], storage_ix, storage);\n ++cmd_histo[64];\n } else {\n EmitDistance((size_t)distance, cmd_depth, cmd_bits,\n cmd_histo, storage_ix, storage);\n last_distance = distance;\n }\n EmitCopyLenLastDistance(matched, cmd_depth, cmd_bits, cmd_histo,\n storage_ix, storage);\n BROTLI_LOG((\"[CompressFragment] pos = %d distance = %d\\n\"\n \"[CompressFragment] pos = %d insert = %d copy = %d\\n\"\n \"[CompressFragment] pos = %d distance = %d\\n\",\n (int)(base - base_ip), (int)distance,\n (int)(base - base_ip) + 2, 0, (int)matched - 2,\n (int)(base - base_ip) + 2, (int)distance));\n\n next_emit = ip;\n if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {\n goto emit_remainder;\n }\n /* We could immediately start working at ip now, but to improve\n compression we first update \"table\" with the hashes of some positions\n within the last copy. */\n {\n uint64_t input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);\n uint32_t prev_hash = HashBytesAtOffset(input_bytes, 0, shift);\n uint32_t cur_hash = HashBytesAtOffset(input_bytes, 3, shift);\n table[prev_hash] = (int)(ip - base_ip - 3);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift);\n table[prev_hash] = (int)(ip - base_ip - 2);\n prev_hash = HashBytesAtOffset(input_bytes, 2, shift);\n table[prev_hash] = (int)(ip - base_ip - 1);\n\n candidate = base_ip + table[cur_hash];\n table[cur_hash] = (int)(ip - base_ip);\n }\n }\n\n while (IsMatch(ip, candidate)) {\n /* We have a 5-byte match at ip, and no need to emit any literal bytes\n prior to ip. */\n const uint8_t* base = ip;\n size_t matched = 5 + FindMatchLengthWithLimit(\n candidate + 5, ip + 5, (size_t)(ip_end - ip) - 5);\n if (ip - candidate > MAX_DISTANCE) break;\n ip += matched;\n last_distance = (int)(base - candidate); /* > 0 */\n BROTLI_DCHECK(0 == memcmp(base, candidate, matched));\n EmitCopyLen(matched, cmd_depth, cmd_bits, cmd_histo,\n storage_ix, storage);\n EmitDistance((size_t)last_distance, cmd_depth, cmd_bits,\n cmd_histo, storage_ix, storage);\n BROTLI_LOG((\"[CompressFragment] pos = %d insert = %d copy = %d\\n\"\n \"[CompressFragment] pos = %d distance = %d\\n\",\n (int)(base - base_ip), 0, (int)matched,\n (int)(base - base_ip), (int)last_distance));\n\n next_emit = ip;\n if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {\n goto emit_remainder;\n }\n /* We could immediately start working at ip now, but to improve\n compression we first update \"table\" with the hashes of some positions\n within the last copy. */\n {\n uint64_t input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);\n uint32_t prev_hash = HashBytesAtOffset(input_bytes, 0, shift);\n uint32_t cur_hash = HashBytesAtOffset(input_bytes, 3, shift);\n table[prev_hash] = (int)(ip - base_ip - 3);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift);\n table[prev_hash] = (int)(ip - base_ip - 2);\n prev_hash = HashBytesAtOffset(input_bytes, 2, shift);\n table[prev_hash] = (int)(ip - base_ip - 1);\n\n candidate = base_ip + table[cur_hash];\n table[cur_hash] = (int)(ip - base_ip);\n }\n }\n\n next_hash = Hash(++ip, shift);\n }\n }\n\n emit_remainder:\n BROTLI_DCHECK(next_emit <= ip_end);\n input += block_size;\n input_size -= block_size;\n block_size = BROTLI_MIN(size_t, input_size, kMergeBlockSize);\n\n /* Decide if we want to continue this meta-block instead of emitting the\n last insert-only command. */\n if (input_size > 0 &&\n total_block_size + block_size <= (1 << 20) &&\n ShouldMergeBlock(s, input, block_size, lit_depth)) {\n BROTLI_DCHECK(total_block_size > (1 << 16));\n /* Update the size of the current meta-block and continue emitting commands.\n We can do this because the current size and the new size both have 5\n nibbles. */\n total_block_size += block_size;\n UpdateBits(20, (uint32_t)(total_block_size - 1), mlen_storage_ix, storage);\n goto emit_commands;\n }\n\n /* Emit the remaining bytes as literals. */\n if (next_emit < ip_end) {\n const size_t insert = (size_t)(ip_end - next_emit);\n BROTLI_LOG((\"[CompressFragment] pos = %d insert = %lu copy = %d\\n\",\n (int)(next_emit - base_ip), (unsigned long)insert, 2));\n if (BROTLI_PREDICT_TRUE(insert < 6210)) {\n EmitInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,\n storage_ix, storage);\n EmitLiterals(next_emit, insert, lit_depth, lit_bits, storage_ix, storage);\n } else if (ShouldUseUncompressedMode(metablock_start, next_emit, insert,\n literal_ratio)) {\n EmitUncompressedMetaBlock(metablock_start, ip_end, mlen_storage_ix - 3,\n storage_ix, storage);\n } else {\n EmitLongInsertLen(insert, cmd_depth, cmd_bits, cmd_histo,\n storage_ix, storage);\n EmitLiterals(next_emit, insert, lit_depth, lit_bits,\n storage_ix, storage);\n }\n }\n next_emit = ip_end;\n\nnext_block:\n /* If we have more data, write a new meta-block header and prefix codes and\n then continue emitting commands. */\n if (input_size > 0) {\n metablock_start = input;\n block_size = BROTLI_MIN(size_t, input_size, kFirstBlockSize);\n total_block_size = block_size;\n /* Save the bit position of the MLEN field of the meta-block header, so that\n we can update it later if we decide to extend this meta-block. */\n mlen_storage_ix = *storage_ix + 3;\n BrotliStoreMetaBlockHeader(block_size, 0, storage_ix, storage);\n /* No block splits, no contexts. */\n BrotliWriteBits(13, 0, storage_ix, storage);\n literal_ratio = BuildAndStoreLiteralPrefixCode(\n s, input, block_size, lit_depth, lit_bits, storage_ix, storage);\n BuildAndStoreCommandPrefixCode(s, storage_ix, storage);\n goto emit_commands;\n }\n\n if (!is_last) {\n /* If this is not the last block, update the command and distance prefix\n codes for the next block and store the compressed forms. */\n s->cmd_code[0] = 0;\n s->cmd_code_numbits = 0;\n BuildAndStoreCommandPrefixCode(s, &s->cmd_code_numbits, s->cmd_code);\n }\n}\n\n#define FOR_TABLE_BITS_(X) X(9) X(11) X(13) X(15)\n\n#define BAKE_METHOD_PARAM_(B) \\\nstatic BROTLI_NOINLINE void BrotliCompressFragmentFastImpl ## B( \\\n BrotliOnePassArena* s, const uint8_t* input, size_t input_size, \\\n BROTLI_BOOL is_last, int* table, size_t* storage_ix, uint8_t* storage) { \\\n BrotliCompressFragmentFastImpl(s, input, input_size, is_last, table, B, \\\n storage_ix, storage); \\\n}\nFOR_TABLE_BITS_(BAKE_METHOD_PARAM_)\n#undef BAKE_METHOD_PARAM_\n\nvoid BrotliCompressFragmentFast(\n BrotliOnePassArena* s, const uint8_t* input, size_t input_size,\n BROTLI_BOOL is_last, int* table, size_t table_size,\n size_t* storage_ix, uint8_t* storage) {\n const size_t initial_storage_ix = *storage_ix;\n const size_t table_bits = Log2FloorNonZero(table_size);\n\n if (input_size == 0) {\n BROTLI_DCHECK(is_last);\n BrotliWriteBits(1, 1, storage_ix, storage); /* islast */\n BrotliWriteBits(1, 1, storage_ix, storage); /* isempty */\n *storage_ix = (*storage_ix + 7u) & ~7u;\n return;\n }\n\n switch (table_bits) {\n#define CASE_(B) \\\n case B: \\\n BrotliCompressFragmentFastImpl ## B( \\\n s, input, input_size, is_last, table, storage_ix, storage);\\\n break;\n FOR_TABLE_BITS_(CASE_)\n#undef CASE_\n default: BROTLI_DCHECK(0); break;\n }\n\n /* If output is larger than single uncompressed block, rewrite it. */\n if (*storage_ix - initial_storage_ix > 31 + (input_size << 3)) {\n EmitUncompressedMetaBlock(input, input + input_size, initial_storage_ix,\n storage_ix, storage);\n }\n\n if (is_last) {\n BrotliWriteBits(1, 1, storage_ix, storage); /* islast */\n BrotliWriteBits(1, 1, storage_ix, storage); /* isempty */\n *storage_ix = (*storage_ix + 7u) & ~7u;\n }\n}\n\n#undef FOR_TABLE_BITS_\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/compress_fragment.h", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function for fast encoding of an input fragment, independently from the input\n history. This function uses one-pass processing: when we find a backward\n match, we immediately emit the corresponding command and literal codes to\n the bit stream. */\n\n#ifndef BROTLI_ENC_COMPRESS_FRAGMENT_H_\n#define BROTLI_ENC_COMPRESS_FRAGMENT_H_\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"entropy_encode.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ntypedef struct BrotliOnePassArena {\n uint8_t lit_depth[256];\n uint16_t lit_bits[256];\n\n /* Command and distance prefix codes (each 64 symbols, stored back-to-back)\n used for the next block. The command prefix code is over a smaller alphabet\n with the following 64 symbols:\n 0 - 15: insert length code 0, copy length code 0 - 15, same distance\n 16 - 39: insert length code 0, copy length code 0 - 23\n 40 - 63: insert length code 0 - 23, copy length code 0\n Note that symbols 16 and 40 represent the same code in the full alphabet,\n but we do not use either of them. */\n uint8_t cmd_depth[128];\n uint16_t cmd_bits[128];\n uint32_t cmd_histo[128];\n\n /* The compressed form of the command and distance prefix codes for the next\n block. */\n uint8_t cmd_code[512];\n size_t cmd_code_numbits;\n\n HuffmanTree tree[2 * BROTLI_NUM_LITERAL_SYMBOLS + 1];\n uint32_t histogram[256];\n uint8_t tmp_depth[BROTLI_NUM_COMMAND_SYMBOLS];\n uint16_t tmp_bits[64];\n} BrotliOnePassArena;\n\n/* Compresses \"input\" string to the \"*storage\" buffer as one or more complete\n meta-blocks, and updates the \"*storage_ix\" bit position.\n\n If \"is_last\" is 1, emits an additional empty last meta-block.\n\n \"cmd_depth\" and \"cmd_bits\" contain the command and distance prefix codes\n (see comment in encode.h) used for the encoding of this input fragment.\n If \"is_last\" is 0, they are updated to reflect the statistics\n of this input fragment, to be used for the encoding of the next fragment.\n\n \"*cmd_code_numbits\" is the number of bits of the compressed representation\n of the command and distance prefix codes, and \"cmd_code\" is an array of\n at least \"(*cmd_code_numbits + 7) >> 3\" size that contains the compressed\n command and distance prefix codes. If \"is_last\" is 0, these are also\n updated to represent the updated \"cmd_depth\" and \"cmd_bits\".\n\n REQUIRES: \"input_size\" is greater than zero, or \"is_last\" is 1.\n REQUIRES: \"input_size\" is less or equal to maximal metablock size (1 << 24).\n REQUIRES: All elements in \"table[0..table_size-1]\" are initialized to zero.\n REQUIRES: \"table_size\" is an odd (9, 11, 13, 15) power of two\n OUTPUT: maximal copy distance <= |input_size|\n OUTPUT: maximal copy distance <= BROTLI_MAX_BACKWARD_LIMIT(18) */\nBROTLI_INTERNAL void BrotliCompressFragmentFast(BrotliOnePassArena* s,\n const uint8_t* input,\n size_t input_size,\n BROTLI_BOOL is_last,\n int* table, size_t table_size,\n size_t* storage_ix,\n uint8_t* storage);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_COMPRESS_FRAGMENT_H_ */\n" }, { "path": "libs/brotli/enc/compress_fragment_two_pass.c", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function for fast encoding of an input fragment, independently from the input\n history. This function uses two-pass processing: in the first pass we save\n the found backward matches and literal bytes into a buffer, and in the\n second pass we emit them into the bit stream using prefix codes built based\n on the actual command and literal byte histograms. */\n\n#include \"compress_fragment_two_pass.h\"\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"bit_cost.h\"\n#include \"brotli_bit_stream.h\"\n#include \"entropy_encode.h\"\n#include \"fast_log.h\"\n#include \"find_match_length.h\"\n#include \"hash_base.h\"\n#include \"write_bits.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define MAX_DISTANCE (long)BROTLI_MAX_BACKWARD_LIMIT(18)\n\nstatic BROTLI_INLINE uint32_t Hash(const uint8_t* p,\n size_t shift, size_t length) {\n const uint64_t h =\n (BROTLI_UNALIGNED_LOAD64LE(p) << ((8 - length) * 8)) * kHashMul32;\n return (uint32_t)(h >> shift);\n}\n\nstatic BROTLI_INLINE uint32_t HashBytesAtOffset(uint64_t v, size_t offset,\n size_t shift, size_t length) {\n BROTLI_DCHECK(offset <= 8 - length);\n {\n const uint64_t h = ((v >> (8 * offset)) << ((8 - length) * 8)) * kHashMul32;\n return (uint32_t)(h >> shift);\n }\n}\n\nstatic BROTLI_INLINE BROTLI_BOOL IsMatch(const uint8_t* p1, const uint8_t* p2,\n size_t length) {\n if (BrotliUnalignedRead32(p1) == BrotliUnalignedRead32(p2)) {\n if (length == 4) return BROTLI_TRUE;\n return TO_BROTLI_BOOL(p1[4] == p2[4] && p1[5] == p2[5]);\n }\n return BROTLI_FALSE;\n}\n\n/* Builds a command and distance prefix code (each 64 symbols) into \"depth\" and\n \"bits\" based on \"histogram\" and stores it into the bit stream. */\nstatic void BuildAndStoreCommandPrefixCode(BrotliTwoPassArena* s,\n size_t* storage_ix,\n uint8_t* storage) {\n /* Tree size for building a tree over 64 symbols is 2 * 64 + 1. */\n /* TODO(eustas): initialize once. */\n memset(s->tmp_depth, 0, sizeof(s->tmp_depth));\n BrotliCreateHuffmanTree(s->cmd_histo, 64, 15, s->tmp_tree, s->cmd_depth);\n BrotliCreateHuffmanTree(&s->cmd_histo[64], 64, 14, s->tmp_tree,\n &s->cmd_depth[64]);\n /* We have to jump through a few hoops here in order to compute\n the command bits because the symbols are in a different order than in\n the full alphabet. This looks complicated, but having the symbols\n in this order in the command bits saves a few branches in the Emit*\n functions. */\n memcpy(s->tmp_depth, s->cmd_depth + 24, 24);\n memcpy(s->tmp_depth + 24, s->cmd_depth, 8);\n memcpy(s->tmp_depth + 32, s->cmd_depth + 48, 8);\n memcpy(s->tmp_depth + 40, s->cmd_depth + 8, 8);\n memcpy(s->tmp_depth + 48, s->cmd_depth + 56, 8);\n memcpy(s->tmp_depth + 56, s->cmd_depth + 16, 8);\n BrotliConvertBitDepthsToSymbols(s->tmp_depth, 64, s->tmp_bits);\n memcpy(s->cmd_bits, s->tmp_bits + 24, 16);\n memcpy(s->cmd_bits + 8, s->tmp_bits + 40, 16);\n memcpy(s->cmd_bits + 16, s->tmp_bits + 56, 16);\n memcpy(s->cmd_bits + 24, s->tmp_bits, 48);\n memcpy(s->cmd_bits + 48, s->tmp_bits + 32, 16);\n memcpy(s->cmd_bits + 56, s->tmp_bits + 48, 16);\n BrotliConvertBitDepthsToSymbols(&s->cmd_depth[64], 64, &s->cmd_bits[64]);\n {\n /* Create the bit length array for the full command alphabet. */\n size_t i;\n memset(s->tmp_depth, 0, 64); /* only 64 first values were used */\n memcpy(s->tmp_depth, s->cmd_depth + 24, 8);\n memcpy(s->tmp_depth + 64, s->cmd_depth + 32, 8);\n memcpy(s->tmp_depth + 128, s->cmd_depth + 40, 8);\n memcpy(s->tmp_depth + 192, s->cmd_depth + 48, 8);\n memcpy(s->tmp_depth + 384, s->cmd_depth + 56, 8);\n for (i = 0; i < 8; ++i) {\n s->tmp_depth[128 + 8 * i] = s->cmd_depth[i];\n s->tmp_depth[256 + 8 * i] = s->cmd_depth[8 + i];\n s->tmp_depth[448 + 8 * i] = s->cmd_depth[16 + i];\n }\n BrotliStoreHuffmanTree(s->tmp_depth, BROTLI_NUM_COMMAND_SYMBOLS,\n s->tmp_tree, storage_ix, storage);\n }\n BrotliStoreHuffmanTree(&s->cmd_depth[64], 64, s->tmp_tree, storage_ix,\n storage);\n}\n\nstatic BROTLI_INLINE void EmitInsertLen(\n uint32_t insertlen, uint32_t** commands) {\n if (insertlen < 6) {\n **commands = insertlen;\n } else if (insertlen < 130) {\n const uint32_t tail = insertlen - 2;\n const uint32_t nbits = Log2FloorNonZero(tail) - 1u;\n const uint32_t prefix = tail >> nbits;\n const uint32_t inscode = (nbits << 1) + prefix + 2;\n const uint32_t extra = tail - (prefix << nbits);\n **commands = inscode | (extra << 8);\n } else if (insertlen < 2114) {\n const uint32_t tail = insertlen - 66;\n const uint32_t nbits = Log2FloorNonZero(tail);\n const uint32_t code = nbits + 10;\n const uint32_t extra = tail - (1u << nbits);\n **commands = code | (extra << 8);\n } else if (insertlen < 6210) {\n const uint32_t extra = insertlen - 2114;\n **commands = 21 | (extra << 8);\n } else if (insertlen < 22594) {\n const uint32_t extra = insertlen - 6210;\n **commands = 22 | (extra << 8);\n } else {\n const uint32_t extra = insertlen - 22594;\n **commands = 23 | (extra << 8);\n }\n ++(*commands);\n}\n\nstatic BROTLI_INLINE void EmitCopyLen(size_t copylen, uint32_t** commands) {\n if (copylen < 10) {\n **commands = (uint32_t)(copylen + 38);\n } else if (copylen < 134) {\n const size_t tail = copylen - 6;\n const size_t nbits = Log2FloorNonZero(tail) - 1;\n const size_t prefix = tail >> nbits;\n const size_t code = (nbits << 1) + prefix + 44;\n const size_t extra = tail - (prefix << nbits);\n **commands = (uint32_t)(code | (extra << 8));\n } else if (copylen < 2118) {\n const size_t tail = copylen - 70;\n const size_t nbits = Log2FloorNonZero(tail);\n const size_t code = nbits + 52;\n const size_t extra = tail - ((size_t)1 << nbits);\n **commands = (uint32_t)(code | (extra << 8));\n } else {\n const size_t extra = copylen - 2118;\n **commands = (uint32_t)(63 | (extra << 8));\n }\n ++(*commands);\n}\n\nstatic BROTLI_INLINE void EmitCopyLenLastDistance(\n size_t copylen, uint32_t** commands) {\n if (copylen < 12) {\n **commands = (uint32_t)(copylen + 20);\n ++(*commands);\n } else if (copylen < 72) {\n const size_t tail = copylen - 8;\n const size_t nbits = Log2FloorNonZero(tail) - 1;\n const size_t prefix = tail >> nbits;\n const size_t code = (nbits << 1) + prefix + 28;\n const size_t extra = tail - (prefix << nbits);\n **commands = (uint32_t)(code | (extra << 8));\n ++(*commands);\n } else if (copylen < 136) {\n const size_t tail = copylen - 8;\n const size_t code = (tail >> 5) + 54;\n const size_t extra = tail & 31;\n **commands = (uint32_t)(code | (extra << 8));\n ++(*commands);\n **commands = 64;\n ++(*commands);\n } else if (copylen < 2120) {\n const size_t tail = copylen - 72;\n const size_t nbits = Log2FloorNonZero(tail);\n const size_t code = nbits + 52;\n const size_t extra = tail - ((size_t)1 << nbits);\n **commands = (uint32_t)(code | (extra << 8));\n ++(*commands);\n **commands = 64;\n ++(*commands);\n } else {\n const size_t extra = copylen - 2120;\n **commands = (uint32_t)(63 | (extra << 8));\n ++(*commands);\n **commands = 64;\n ++(*commands);\n }\n}\n\nstatic BROTLI_INLINE void EmitDistance(uint32_t distance, uint32_t** commands) {\n uint32_t d = distance + 3;\n uint32_t nbits = Log2FloorNonZero(d) - 1;\n const uint32_t prefix = (d >> nbits) & 1;\n const uint32_t offset = (2 + prefix) << nbits;\n const uint32_t distcode = 2 * (nbits - 1) + prefix + 80;\n uint32_t extra = d - offset;\n **commands = distcode | (extra << 8);\n ++(*commands);\n}\n\n/* REQUIRES: len <= 1 << 24. */\nstatic void BrotliStoreMetaBlockHeader(\n size_t len, BROTLI_BOOL is_uncompressed, size_t* storage_ix,\n uint8_t* storage) {\n size_t nibbles = 6;\n /* ISLAST */\n BrotliWriteBits(1, 0, storage_ix, storage);\n if (len <= (1U << 16)) {\n nibbles = 4;\n } else if (len <= (1U << 20)) {\n nibbles = 5;\n }\n BrotliWriteBits(2, nibbles - 4, storage_ix, storage);\n BrotliWriteBits(nibbles * 4, len - 1, storage_ix, storage);\n /* ISUNCOMPRESSED */\n BrotliWriteBits(1, (uint64_t)is_uncompressed, storage_ix, storage);\n}\n\nstatic BROTLI_INLINE void CreateCommands(const uint8_t* input,\n size_t block_size, size_t input_size, const uint8_t* base_ip, int* table,\n size_t table_bits, size_t min_match,\n uint8_t** literals, uint32_t** commands) {\n /* \"ip\" is the input pointer. */\n const uint8_t* ip = input;\n const size_t shift = 64u - table_bits;\n const uint8_t* ip_end = input + block_size;\n /* \"next_emit\" is a pointer to the first byte that is not covered by a\n previous copy. Bytes between \"next_emit\" and the start of the next copy or\n the end of the input will be emitted as literal bytes. */\n const uint8_t* next_emit = input;\n\n int last_distance = -1;\n const size_t kInputMarginBytes = BROTLI_WINDOW_GAP;\n\n if (BROTLI_PREDICT_TRUE(block_size >= kInputMarginBytes)) {\n /* For the last block, we need to keep a 16 bytes margin so that we can be\n sure that all distances are at most window size - 16.\n For all other blocks, we only need to keep a margin of 5 bytes so that\n we don't go over the block size with a copy. */\n const size_t len_limit = BROTLI_MIN(size_t, block_size - min_match,\n input_size - kInputMarginBytes);\n const uint8_t* ip_limit = input + len_limit;\n\n uint32_t next_hash;\n for (next_hash = Hash(++ip, shift, min_match); ; ) {\n /* Step 1: Scan forward in the input looking for a 6-byte-long match.\n If we get close to exhausting the input then goto emit_remainder.\n\n Heuristic match skipping: If 32 bytes are scanned with no matches\n found, start looking only at every other byte. If 32 more bytes are\n scanned, look at every third byte, etc.. When a match is found,\n immediately go back to looking at every byte. This is a small loss\n (~5% performance, ~0.1% density) for compressible data due to more\n bookkeeping, but for non-compressible data (such as JPEG) it's a huge\n win since the compressor quickly \"realizes\" the data is incompressible\n and doesn't bother looking for matches everywhere.\n\n The \"skip\" variable keeps track of how many bytes there are since the\n last match; dividing it by 32 (ie. right-shifting by five) gives the\n number of bytes to move ahead for each iteration. */\n uint32_t skip = 32;\n\n const uint8_t* next_ip = ip;\n const uint8_t* candidate;\n\n BROTLI_DCHECK(next_emit < ip);\ntrawl:\n do {\n uint32_t hash = next_hash;\n uint32_t bytes_between_hash_lookups = skip++ >> 5;\n ip = next_ip;\n BROTLI_DCHECK(hash == Hash(ip, shift, min_match));\n next_ip = ip + bytes_between_hash_lookups;\n if (BROTLI_PREDICT_FALSE(next_ip > ip_limit)) {\n goto emit_remainder;\n }\n next_hash = Hash(next_ip, shift, min_match);\n candidate = ip - last_distance;\n if (IsMatch(ip, candidate, min_match)) {\n if (BROTLI_PREDICT_TRUE(candidate < ip)) {\n table[hash] = (int)(ip - base_ip);\n break;\n }\n }\n candidate = base_ip + table[hash];\n BROTLI_DCHECK(candidate >= base_ip);\n BROTLI_DCHECK(candidate < ip);\n\n table[hash] = (int)(ip - base_ip);\n } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match)));\n\n /* Check copy distance. If candidate is not feasible, continue search.\n Checking is done outside of hot loop to reduce overhead. */\n if (ip - candidate > MAX_DISTANCE) goto trawl;\n\n /* Step 2: Emit the found match together with the literal bytes from\n \"next_emit\", and then see if we can find a next match immediately\n afterwards. Repeat until we find no match for the input\n without emitting some literal bytes. */\n\n {\n /* We have a 6-byte match at ip, and we need to emit bytes in\n [next_emit, ip). */\n const uint8_t* base = ip;\n size_t matched = min_match + FindMatchLengthWithLimit(\n candidate + min_match, ip + min_match,\n (size_t)(ip_end - ip) - min_match);\n int distance = (int)(base - candidate); /* > 0 */\n int insert = (int)(base - next_emit);\n ip += matched;\n BROTLI_DCHECK(0 == memcmp(base, candidate, matched));\n EmitInsertLen((uint32_t)insert, commands);\n BROTLI_LOG((\"[CompressFragment] pos = %d insert = %d copy = %d\\n\",\n (int)(next_emit - base_ip), insert, 2));\n memcpy(*literals, next_emit, (size_t)insert);\n *literals += insert;\n if (distance == last_distance) {\n **commands = 64;\n ++(*commands);\n } else {\n EmitDistance((uint32_t)distance, commands);\n last_distance = distance;\n }\n EmitCopyLenLastDistance(matched, commands);\n BROTLI_LOG((\"[CompressFragment] pos = %d distance = %d\\n\"\n \"[CompressFragment] pos = %d insert = %d copy = %d\\n\"\n \"[CompressFragment] pos = %d distance = %d\\n\",\n (int)(base - base_ip), (int)distance,\n (int)(base - base_ip) + 2, 0, (int)matched - 2,\n (int)(base - base_ip) + 2, (int)distance));\n\n next_emit = ip;\n if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {\n goto emit_remainder;\n }\n {\n /* We could immediately start working at ip now, but to improve\n compression we first update \"table\" with the hashes of some\n positions within the last copy. */\n uint64_t input_bytes;\n uint32_t cur_hash;\n uint32_t prev_hash;\n if (min_match == 4) {\n input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);\n cur_hash = HashBytesAtOffset(input_bytes, 3, shift, min_match);\n prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 3);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 2);\n prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 1);\n } else {\n input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 5);\n prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 5);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 4);\n prev_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 3);\n input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 2);\n cur_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);\n prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 2);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 1);\n }\n\n candidate = base_ip + table[cur_hash];\n table[cur_hash] = (int)(ip - base_ip);\n }\n }\n\n while (ip - candidate <= MAX_DISTANCE &&\n IsMatch(ip, candidate, min_match)) {\n /* We have a 6-byte match at ip, and no need to emit any\n literal bytes prior to ip. */\n const uint8_t* base = ip;\n size_t matched = min_match + FindMatchLengthWithLimit(\n candidate + min_match, ip + min_match,\n (size_t)(ip_end - ip) - min_match);\n ip += matched;\n last_distance = (int)(base - candidate); /* > 0 */\n BROTLI_DCHECK(0 == memcmp(base, candidate, matched));\n EmitCopyLen(matched, commands);\n EmitDistance((uint32_t)last_distance, commands);\n BROTLI_LOG((\"[CompressFragment] pos = %d insert = %d copy = %d\\n\"\n \"[CompressFragment] pos = %d distance = %d\\n\",\n (int)(base - base_ip), 0, (int)matched,\n (int)(base - base_ip), (int)last_distance));\n\n next_emit = ip;\n if (BROTLI_PREDICT_FALSE(ip >= ip_limit)) {\n goto emit_remainder;\n }\n {\n /* We could immediately start working at ip now, but to improve\n compression we first update \"table\" with the hashes of some\n positions within the last copy. */\n uint64_t input_bytes;\n uint32_t cur_hash;\n uint32_t prev_hash;\n if (min_match == 4) {\n input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 3);\n cur_hash = HashBytesAtOffset(input_bytes, 3, shift, min_match);\n prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 3);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 2);\n prev_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 1);\n } else {\n input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 5);\n prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 5);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 4);\n prev_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 3);\n input_bytes = BROTLI_UNALIGNED_LOAD64LE(ip - 2);\n cur_hash = HashBytesAtOffset(input_bytes, 2, shift, min_match);\n prev_hash = HashBytesAtOffset(input_bytes, 0, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 2);\n prev_hash = HashBytesAtOffset(input_bytes, 1, shift, min_match);\n table[prev_hash] = (int)(ip - base_ip - 1);\n }\n\n candidate = base_ip + table[cur_hash];\n table[cur_hash] = (int)(ip - base_ip);\n }\n }\n\n next_hash = Hash(++ip, shift, min_match);\n }\n }\n\nemit_remainder:\n BROTLI_DCHECK(next_emit <= ip_end);\n /* Emit the remaining bytes as literals. */\n if (next_emit < ip_end) {\n const uint32_t insert = (uint32_t)(ip_end - next_emit);\n EmitInsertLen(insert, commands);\n BROTLI_LOG((\"[CompressFragment] pos = %d insert = %d copy = %d\\n\",\n (int)(next_emit - base_ip), insert, 2));\n memcpy(*literals, next_emit, insert);\n *literals += insert;\n }\n}\n\nstatic void StoreCommands(BrotliTwoPassArena* s,\n const uint8_t* literals, const size_t num_literals,\n const uint32_t* commands, const size_t num_commands,\n size_t* storage_ix, uint8_t* storage) {\n static const BROTLI_MODEL(\"small\") uint32_t kNumExtraBits[128] = {\n 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5,\n 6, 7, 8, 9, 10, 12, 14, 24, 0, 0, 0, 0, 0, 0, 0, 0,\n 1, 1, 2, 2, 3, 3, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0,\n 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 10, 24,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8,\n 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16,\n 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24,\n };\n static const BROTLI_MODEL(\"small\") uint32_t kInsertOffset[24] = {\n 0, 1, 2, 3, 4, 5, 6, 8, 10, 14, 18, 26,\n 34, 50, 66, 98, 130, 194, 322, 578, 1090, 2114, 6210, 22594,\n };\n\n size_t i;\n memset(s->lit_histo, 0, sizeof(s->lit_histo));\n /* TODO(eustas): is that necessary? */\n memset(s->cmd_depth, 0, sizeof(s->cmd_depth));\n /* TODO(eustas): is that necessary? */\n memset(s->cmd_bits, 0, sizeof(s->cmd_bits));\n memset(s->cmd_histo, 0, sizeof(s->cmd_histo));\n for (i = 0; i < num_literals; ++i) {\n ++s->lit_histo[literals[i]];\n }\n BrotliBuildAndStoreHuffmanTreeFast(s->tmp_tree, s->lit_histo, num_literals,\n /* max_bits = */ 8, s->lit_depth,\n s->lit_bits, storage_ix, storage);\n\n for (i = 0; i < num_commands; ++i) {\n const uint32_t code = commands[i] & 0xFF;\n BROTLI_DCHECK(code < 128);\n ++s->cmd_histo[code];\n }\n s->cmd_histo[1] += 1;\n s->cmd_histo[2] += 1;\n s->cmd_histo[64] += 1;\n s->cmd_histo[84] += 1;\n BuildAndStoreCommandPrefixCode(s, storage_ix, storage);\n\n for (i = 0; i < num_commands; ++i) {\n const uint32_t cmd = commands[i];\n const uint32_t code = cmd & 0xFF;\n const uint32_t extra = cmd >> 8;\n BROTLI_DCHECK(code < 128);\n BrotliWriteBits(s->cmd_depth[code], s->cmd_bits[code], storage_ix, storage);\n BrotliWriteBits(kNumExtraBits[code], extra, storage_ix, storage);\n if (code < 24) {\n const uint32_t insert = kInsertOffset[code] + extra;\n uint32_t j;\n for (j = 0; j < insert; ++j) {\n const uint8_t lit = *literals;\n BrotliWriteBits(s->lit_depth[lit], s->lit_bits[lit], storage_ix,\n storage);\n ++literals;\n }\n }\n }\n}\n\n/* Acceptable loss for uncompressible speedup is 2% */\n#define MIN_RATIO 0.98\n#define SAMPLE_RATE 43\n\nstatic BROTLI_BOOL ShouldCompress(BrotliTwoPassArena* s,\n const uint8_t* input, size_t input_size, size_t num_literals) {\n double corpus_size = (double)input_size;\n if ((double)num_literals < MIN_RATIO * corpus_size) {\n return BROTLI_TRUE;\n } else {\n const double max_total_bit_cost = corpus_size * 8 * MIN_RATIO / SAMPLE_RATE;\n size_t i;\n memset(s->lit_histo, 0, sizeof(s->lit_histo));\n for (i = 0; i < input_size; i += SAMPLE_RATE) {\n ++s->lit_histo[input[i]];\n }\n return TO_BROTLI_BOOL(\n BrotliBitsEntropy(s->lit_histo, 256) < max_total_bit_cost);\n }\n}\n\nstatic void RewindBitPosition(const size_t new_storage_ix,\n size_t* storage_ix, uint8_t* storage) {\n const size_t bitpos = new_storage_ix & 7;\n const size_t mask = (1u << bitpos) - 1;\n storage[new_storage_ix >> 3] &= (uint8_t)mask;\n *storage_ix = new_storage_ix;\n}\n\nstatic void EmitUncompressedMetaBlock(const uint8_t* input, size_t input_size,\n size_t* storage_ix, uint8_t* storage) {\n BrotliStoreMetaBlockHeader(input_size, 1, storage_ix, storage);\n *storage_ix = (*storage_ix + 7u) & ~7u;\n memcpy(&storage[*storage_ix >> 3], input, input_size);\n *storage_ix += input_size << 3;\n storage[*storage_ix >> 3] = 0;\n}\n\nstatic BROTLI_INLINE void BrotliCompressFragmentTwoPassImpl(\n BrotliTwoPassArena* s, const uint8_t* input, size_t input_size,\n BROTLI_BOOL is_last, uint32_t* command_buf, uint8_t* literal_buf,\n int* table, size_t table_bits, size_t min_match,\n size_t* storage_ix, uint8_t* storage) {\n /* Save the start of the first block for position and distance computations.\n */\n const uint8_t* base_ip = input;\n BROTLI_UNUSED(is_last);\n\n while (input_size > 0) {\n size_t block_size =\n BROTLI_MIN(size_t, input_size, kCompressFragmentTwoPassBlockSize);\n uint32_t* commands = command_buf;\n uint8_t* literals = literal_buf;\n size_t num_literals;\n CreateCommands(input, block_size, input_size, base_ip, table,\n table_bits, min_match, &literals, &commands);\n num_literals = (size_t)(literals - literal_buf);\n if (ShouldCompress(s, input, block_size, num_literals)) {\n const size_t num_commands = (size_t)(commands - command_buf);\n BrotliStoreMetaBlockHeader(block_size, 0, storage_ix, storage);\n /* No block splits, no contexts. */\n BrotliWriteBits(13, 0, storage_ix, storage);\n StoreCommands(s, literal_buf, num_literals, command_buf, num_commands,\n storage_ix, storage);\n } else {\n /* Since we did not find many backward references and the entropy of\n the data is close to 8 bits, we can simply emit an uncompressed block.\n This makes compression speed of uncompressible data about 3x faster. */\n EmitUncompressedMetaBlock(input, block_size, storage_ix, storage);\n }\n input += block_size;\n input_size -= block_size;\n }\n}\n\n#define FOR_TABLE_BITS_(X) \\\n X(8) X(9) X(10) X(11) X(12) X(13) X(14) X(15) X(16) X(17)\n\n#define BAKE_METHOD_PARAM_(B) \\\nstatic BROTLI_NOINLINE void BrotliCompressFragmentTwoPassImpl ## B( \\\n BrotliTwoPassArena* s, const uint8_t* input, size_t input_size, \\\n BROTLI_BOOL is_last, uint32_t* command_buf, uint8_t* literal_buf, \\\n int* table, size_t* storage_ix, uint8_t* storage) { \\\n size_t min_match = (B <= 15) ? 4 : 6; \\\n BrotliCompressFragmentTwoPassImpl(s, input, input_size, is_last, command_buf,\\\n literal_buf, table, B, min_match, storage_ix, storage); \\\n}\nFOR_TABLE_BITS_(BAKE_METHOD_PARAM_)\n#undef BAKE_METHOD_PARAM_\n\nvoid BrotliCompressFragmentTwoPass(\n BrotliTwoPassArena* s, const uint8_t* input, size_t input_size,\n BROTLI_BOOL is_last, uint32_t* command_buf, uint8_t* literal_buf,\n int* table, size_t table_size, size_t* storage_ix, uint8_t* storage) {\n const size_t initial_storage_ix = *storage_ix;\n const size_t table_bits = Log2FloorNonZero(table_size);\n switch (table_bits) {\n#define CASE_(B) \\\n case B: \\\n BrotliCompressFragmentTwoPassImpl ## B( \\\n s, input, input_size, is_last, command_buf, \\\n literal_buf, table, storage_ix, storage); \\\n break;\n FOR_TABLE_BITS_(CASE_)\n#undef CASE_\n default: BROTLI_DCHECK(0); break;\n }\n\n /* If output is larger than single uncompressed block, rewrite it. */\n if (*storage_ix - initial_storage_ix > 31 + (input_size << 3)) {\n RewindBitPosition(initial_storage_ix, storage_ix, storage);\n EmitUncompressedMetaBlock(input, input_size, storage_ix, storage);\n }\n\n if (is_last) {\n BrotliWriteBits(1, 1, storage_ix, storage); /* islast */\n BrotliWriteBits(1, 1, storage_ix, storage); /* isempty */\n *storage_ix = (*storage_ix + 7u) & ~7u;\n }\n}\n\n#undef FOR_TABLE_BITS_\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/compress_fragment_two_pass.h", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function for fast encoding of an input fragment, independently from the input\n history. This function uses two-pass processing: in the first pass we save\n the found backward matches and literal bytes into a buffer, and in the\n second pass we emit them into the bit stream using prefix codes built based\n on the actual command and literal byte histograms. */\n\n#ifndef BROTLI_ENC_COMPRESS_FRAGMENT_TWO_PASS_H_\n#define BROTLI_ENC_COMPRESS_FRAGMENT_TWO_PASS_H_\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"entropy_encode.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* TODO(eustas): turn to macro. */\nstatic const size_t kCompressFragmentTwoPassBlockSize = 1 << 17;\n\ntypedef struct BrotliTwoPassArena {\n uint32_t lit_histo[256];\n uint8_t lit_depth[256];\n uint16_t lit_bits[256];\n\n uint32_t cmd_histo[128];\n uint8_t cmd_depth[128];\n uint16_t cmd_bits[128];\n\n /* BuildAndStoreCommandPrefixCode */\n HuffmanTree tmp_tree[2 * BROTLI_NUM_LITERAL_SYMBOLS + 1];\n uint8_t tmp_depth[BROTLI_NUM_COMMAND_SYMBOLS];\n uint16_t tmp_bits[64];\n} BrotliTwoPassArena;\n\n/* Compresses \"input\" string to the \"*storage\" buffer as one or more complete\n meta-blocks, and updates the \"*storage_ix\" bit position.\n\n If \"is_last\" is 1, emits an additional empty last meta-block.\n\n REQUIRES: \"input_size\" is greater than zero, or \"is_last\" is 1.\n REQUIRES: \"input_size\" is less or equal to maximal metablock size (1 << 24).\n REQUIRES: \"command_buf\" and \"literal_buf\" point to at least\n kCompressFragmentTwoPassBlockSize long arrays.\n REQUIRES: All elements in \"table[0..table_size-1]\" are initialized to zero.\n REQUIRES: \"table_size\" is a power of two\n OUTPUT: maximal copy distance <= |input_size|\n OUTPUT: maximal copy distance <= BROTLI_MAX_BACKWARD_LIMIT(18) */\nBROTLI_INTERNAL void BrotliCompressFragmentTwoPass(BrotliTwoPassArena* s,\n const uint8_t* input,\n size_t input_size,\n BROTLI_BOOL is_last,\n uint32_t* command_buf,\n uint8_t* literal_buf,\n int* table,\n size_t table_size,\n size_t* storage_ix,\n uint8_t* storage);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_COMPRESS_FRAGMENT_TWO_PASS_H_ */\n" }, { "path": "libs/brotli/enc/dictionary_hash.c", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Hash table on the 4-byte prefixes of static dictionary words. */\n\n#include \"dictionary_hash.h\"\n\n#include \"../common/platform.h\" /* IWYU pragma: keep */\n#include \"../common/static_init.h\"\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\n#include \"../common/dictionary.h\"\n#include \"hash_base.h\"\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\nBROTLI_BOOL BROTLI_COLD BrotliEncoderInitDictionaryHash(\n const BrotliDictionary* dict, uint16_t* words, uint8_t* lengths) {\n size_t global_idx = 0;\n size_t len;\n size_t i;\n static const uint8_t frozen_idx[1688] = {0, 0, 8, 164, 32, 56, 31, 191, 36, 4,\n128, 81, 68, 132, 145, 129, 0, 0, 0, 28, 0, 8, 1, 1, 64, 3, 1, 0, 0, 0, 0, 0, 4,\n64, 1, 2, 128, 0, 132, 49, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0, 0, 1, 0, 36, 152,\n0, 0, 0, 0, 128, 8, 0, 0, 128, 0, 0, 8, 0, 0, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8,\n0, 0, 0, 1, 0, 64, 133, 0, 32, 0, 0, 128, 1, 0, 0, 0, 0, 4, 4, 4, 32, 16, 130,\n0, 128, 8, 0, 0, 0, 0, 0, 64, 0, 64, 0, 160, 0, 148, 53, 0, 0, 0, 0, 0, 128, 0,\n130, 0, 0, 0, 8, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 32, 1, 32, 129, 0, 12, 0,\n1, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 16, 32, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 8,\n0, 0, 2, 0, 0, 0, 0, 0, 32, 0, 0, 0, 2, 66, 128, 0, 0, 16, 0, 0, 0, 0, 64, 1, 6,\n128, 8, 0, 192, 24, 32, 0, 0, 8, 4, 128, 128, 2, 160, 0, 160, 0, 64, 0, 0, 2, 0,\n0, 0, 0, 0, 0, 0, 0, 0, 32, 1, 0, 0, 64, 0, 0, 0, 0, 0, 0, 32, 0, 66, 0, 2, 0,\n4, 0, 8, 0, 2, 0, 0, 33, 8, 0, 0, 0, 8, 0, 128, 162, 4, 128, 0, 2, 33, 0, 160,\n0, 8, 0, 64, 0, 160, 0, 129, 4, 0, 0, 32, 0, 0, 32, 0, 2, 0, 0, 0, 0, 0, 0, 128,\n0, 0, 0, 0, 0, 64, 10, 0, 0, 0, 0, 32, 64, 0, 0, 0, 0, 0, 16, 0, 16, 16, 0, 0,\n80, 2, 0, 0, 0, 0, 8, 0, 0, 16, 0, 8, 0, 0, 0, 8, 64, 128, 0, 0, 0, 8, 208, 0,\n0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 32, 0, 8, 0, 128, 0, 0, 0, 1, 0, 0, 0,\n16, 8, 1, 136, 0, 0, 36, 0, 64, 9, 0, 1, 32, 8, 0, 64, 64, 131, 16, 224, 32, 4,\n0, 4, 5, 160, 0, 131, 0, 4, 96, 0, 0, 184, 192, 0, 177, 205, 96, 0, 0, 0, 0, 2,\n0, 32, 0, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 128, 0, 0, 8, 0, 0, 0, 0, 1, 4, 0, 1,\n0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 4, 0, 0, 64, 69, 0, 0, 8, 2, 66, 32, 64, 0, 0, 0,\n0, 0, 1, 0, 128, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 16, 0, 0, 4, 128, 64,\n0, 0, 0, 0, 0, 0, 0, 0, 224, 0, 8, 0, 0, 130, 16, 64, 128, 2, 64, 0, 0, 0, 128,\n2, 192, 64, 0, 65, 0, 0, 0, 16, 0, 0, 0, 32, 4, 2, 2, 76, 0, 0, 0, 4, 72, 52,\n131, 44, 76, 0, 0, 0, 0, 64, 1, 16, 148, 4, 0, 16, 10, 64, 0, 2, 0, 1, 0, 128,\n64, 68, 0, 0, 0, 0, 0, 64, 144, 0, 8, 0, 2, 0, 0, 0, 0, 0, 0, 3, 64, 0, 0, 0, 0,\n1, 128, 0, 0, 32, 66, 0, 0, 0, 40, 0, 18, 0, 0, 0, 0, 0, 33, 0, 0, 32, 0, 0, 32,\n0, 128, 4, 64, 145, 140, 0, 0, 0, 128, 0, 2, 0, 0, 20, 0, 80, 38, 0, 0, 32, 0,\n32, 64, 4, 4, 0, 4, 0, 0, 0, 129, 4, 0, 0, 144, 17, 32, 130, 16, 132, 24, 134,\n0, 0, 64, 2, 5, 50, 8, 194, 33, 1, 68, 117, 1, 8, 32, 161, 54, 0, 130, 34, 0, 0,\n0, 64, 128, 0, 0, 2, 0, 0, 0, 0, 32, 1, 0, 0, 0, 3, 14, 0, 0, 0, 0, 0, 16, 4, 0,\n0, 0, 0, 0, 0, 0, 0, 96, 1, 24, 18, 0, 1, 128, 24, 0, 64, 0, 4, 0, 16, 128, 0,\n64, 0, 0, 0, 64, 0, 8, 0, 0, 0, 0, 0, 66, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n0, 0, 0, 0, 16, 0, 64, 2, 0, 0, 0, 0, 6, 0, 8, 8, 2, 0, 64, 0, 0, 0, 0, 128, 2,\n2, 12, 64, 0, 64, 0, 8, 0, 128, 32, 0, 0, 10, 0, 0, 32, 0, 128, 32, 33, 8, 136,\n0, 96, 64, 0, 0, 0, 0, 0, 64, 4, 16, 4, 8, 0, 0, 0, 16, 0, 2, 0, 0, 1, 128, 0,\n64, 16, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 2, 0, 16, 0, 4, 0, 8, 0, 0, 0, 0, 0,\n20, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 136, 0, 0, 0, 0, 0, 8, 0,\n0, 0, 0, 0, 2, 0, 0, 0, 64, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 0, 0,\n0, 0, 4, 0, 0, 0, 0, 65, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0,\n0, 0, 0, 0, 2, 128, 0, 0, 0, 8, 2, 0, 0, 128, 0, 16, 2, 0, 0, 4, 0, 32, 0, 0, 1,\n4, 64, 64, 0, 4, 0, 1, 0, 16, 0, 32, 68, 4, 4, 65, 10, 0, 20, 37, 18, 1, 148, 0,\n32, 128, 3, 8, 0, 64, 0, 0, 0, 0, 0, 0, 4, 0, 16, 1, 128, 0, 0, 0, 128, 16, 0,\n0, 0, 0, 1, 128, 0, 0, 128, 64, 128, 64, 0, 130, 0, 164, 8, 0, 0, 1, 64, 128, 0,\n18, 0, 2, 150, 0, 8, 0, 0, 64, 0, 81, 0, 0, 16, 128, 2, 8, 36, 32, 129, 4, 144,\n13, 0, 0, 3, 8, 1, 0, 2, 0, 0, 64, 0, 5, 0, 1, 34, 1, 32, 2, 16, 128, 128, 128,\n0, 0, 0, 2, 0, 4, 18, 8, 12, 34, 32, 192, 6, 64, 224, 33, 0, 0, 137, 72, 64, 0,\n24, 8, 128, 128, 0, 16, 0, 32, 128, 128, 132, 8, 0, 0, 16, 0, 64, 0, 0, 4, 0, 0,\n16, 0, 4, 128, 64, 0, 0, 1, 0, 4, 64, 32, 144, 130, 2, 128, 0, 192, 0, 64, 82,\n64, 1, 32, 128, 128, 2, 0, 84, 0, 32, 0, 44, 24, 72, 80, 32, 16, 0, 0, 44, 16,\n96, 64, 1, 72, 131, 0, 0, 0, 16, 0, 0, 165, 0, 129, 2, 49, 48, 64, 64, 12, 64,\n176, 64, 84, 8, 128, 20, 64, 213, 136, 104, 1, 41, 15, 83, 170, 0, 0, 41, 1, 64,\n64, 0, 193, 64, 64, 8, 0, 128, 0, 0, 64, 8, 64, 8, 1, 16, 0, 8, 0, 0, 2, 1, 128,\n28, 84, 141, 97, 0, 0, 68, 0, 0, 129, 8, 0, 16, 8, 32, 0, 64, 0, 0, 0, 24, 0, 0,\n0, 192, 0, 8, 128, 0, 0, 0, 0, 0, 64, 0, 1, 0, 0, 0, 0, 40, 1, 128, 64, 0, 4, 2,\n32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 32, 8, 0, 32, 0, 0, 0, 16, 17, 0,\n2, 4, 0, 0, 33, 128, 2, 0, 0, 0, 0, 129, 0, 2, 0, 0, 0, 36, 0, 32, 2, 0, 0, 0,\n0, 0, 0, 32, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 32, 64, 0, 0, 0, 0, 0, 0,\n32, 0, 0, 32, 128, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 128, 16, 0, 0, 0, 0, 0, 0, 0,\n1, 0, 136, 0, 0, 24, 192, 128, 3, 0, 17, 18, 2, 0, 66, 0, 4, 24, 0, 9, 208, 167,\n0, 144, 20, 64, 0, 130, 64, 0, 2, 16, 136, 8, 74, 32, 0, 168, 0, 65, 32, 8, 12,\n1, 3, 1, 64, 180, 3, 0, 64, 0, 8, 0, 0, 32, 65, 0, 4, 16, 4, 16, 68, 32, 64, 36,\n32, 24, 33, 1, 128, 0, 0, 8, 0, 32, 64, 81, 0, 1, 10, 19, 8, 0, 0, 4, 5, 144, 0,\n0, 8, 128, 0, 0, 4, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 8, 0, 0, 0, 0, 0, 80, 1, 0, 0,\n33, 0, 32, 66, 4, 2, 0, 1, 43, 2, 0, 0, 4, 32, 16, 0, 64, 0, 3, 32, 0, 2, 64,\n64, 116, 0, 65, 52, 64, 0, 17, 64, 192, 96, 8, 10, 8, 2, 4, 0, 17, 64, 0, 4, 0,\n0, 4, 128, 0, 0, 9, 0, 0, 130, 2, 0, 192, 0, 48, 128, 64, 0, 96, 0, 64, 0, 1,\n16, 32, 0, 1, 32, 6, 128, 2, 32, 0, 12, 0, 0, 48, 32, 8, 0, 0, 128, 0, 18, 0,\n0, 28, 24, 41, 16, 5, 32, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n0, 0, 0, 0, 1, 0, 0, 0, 16, 0, 0, 0, 0, 64, 0, 0, 0, 0, 8, 0, 0, 0, 0, 16, 128,\n0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33, 0,\n0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n0, 0, 0, 0, 0, 0, 0};\n\n memset(lengths, 0, BROTLI_ENC_NUM_HASH_BUCKETS);\n\n for (len = BROTLI_MAX_DICTIONARY_WORD_LENGTH;\n len >= BROTLI_MIN_DICTIONARY_WORD_LENGTH; --len) {\n size_t length_lt_8 = len < 8 ? 1 : 0;\n size_t n = 1u << dict->size_bits_by_length[len];\n const uint8_t* dict_words = dict->data + dict->offsets_by_length[len];\n for (i = 0; i < n; ++i) {\n size_t j = n - 1 - i;\n const uint8_t* word = dict_words + len * j;\n const uint32_t key = Hash14(word);\n size_t idx = (key << 1) + length_lt_8;\n if ((lengths[idx] & 0x80) == 0) {\n BROTLI_BOOL is_final = TO_BROTLI_BOOL(frozen_idx[global_idx / 8] &\n (1u << (global_idx % 8)));\n words[idx] = (uint16_t)j;\n lengths[idx] = (uint8_t)(len + (is_final ? 0x80 : 0));\n }\n global_idx++;\n }\n }\n for (i = 0; i < BROTLI_ENC_NUM_HASH_BUCKETS; ++i) {\n lengths[i] &= 0x7F;\n }\n\n return BROTLI_TRUE;\n}\n\nBROTLI_MODEL(\"small\")\nuint16_t kStaticDictionaryHashWords[BROTLI_ENC_NUM_HASH_BUCKETS];\nBROTLI_MODEL(\"small\")\nuint8_t kStaticDictionaryHashLengths[BROTLI_ENC_NUM_HASH_BUCKETS];\n\n#else /* BROTLI_STATIC_INIT */\n\n/* Embed kStaticDictionaryHashWords and kStaticDictionaryHashLengths. */\n#include \"dictionary_hash_inc.h\"\n\n#endif /* BROTLI_STATIC_INIT */\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/dictionary_hash.h", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Hash table on the 4-byte prefixes of static dictionary words. */\n\n#ifndef BROTLI_ENC_DICTIONARY_HASH_H_\n#define BROTLI_ENC_DICTIONARY_HASH_H_\n\n#include \"../common/platform.h\"\n#include \"../common/static_init.h\"\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\n#include \"../common/dictionary.h\"\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* Bucket is (Hash14 * 2 + length_lt_8); in other words we reserve 2 buckets\n for each hash - one for shorter words and one for longer words. */\n#define BROTLI_ENC_NUM_HASH_BUCKETS 32768\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\nBROTLI_BOOL BROTLI_INTERNAL BrotliEncoderInitDictionaryHash(\n const BrotliDictionary* dictionary, uint16_t* words, uint8_t* lengths);\nBROTLI_INTERNAL extern BROTLI_MODEL(\"small\") uint16_t\n kStaticDictionaryHashWords[BROTLI_ENC_NUM_HASH_BUCKETS];\nBROTLI_INTERNAL extern BROTLI_MODEL(\"small\") uint8_t\n kStaticDictionaryHashLengths[BROTLI_ENC_NUM_HASH_BUCKETS];\n#else\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\") uint16_t\n kStaticDictionaryHashWords[BROTLI_ENC_NUM_HASH_BUCKETS];\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\") uint8_t\n kStaticDictionaryHashLengths[BROTLI_ENC_NUM_HASH_BUCKETS];\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_DICTIONARY_HASH_H_ */\n" }, { "path": "libs/brotli/enc/dictionary_hash_inc.h", "content": "const BROTLI_MODEL(\"small\")\nuint16_t kStaticDictionaryHashWords[BROTLI_ENC_NUM_HASH_BUCKETS] = {\n1002,0,0,0,0,0,0,0,0,683,0,0,0,0,0,0,0,1265,0,0,0,0,0,1431,0,0,0,0,0,0,40,0,0,0,\n0,155,8,741,0,624,0,0,0,0,0,0,0,0,0,0,0,0,66,503,0,0,0,451,0,0,0,0,0,0,0,835,70,\n0,0,539,0,0,0,0,0,0,0,0,0,113,0,0,0,0,718,0,0,0,0,0,0,520,0,1070,0,0,0,0,0,1515,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,78,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,610,0,0,750,0,0,0,307,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,964,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,999,0,0,0,0,0,0,0,0,\n645,75,0,649,52,282,0,200,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1621,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,211,225,0,0,687,718,0,0,110,0,58,0,0,0,0,0,0,345,0,0,301,0,0,\n0,203,0,0,1154,674,1949,0,0,0,0,0,0,0,0,0,259,0,0,0,0,0,0,0,1275,0,0,0,1231,254,\n0,0,0,0,0,0,0,277,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,248,0,0,800,0,0,0,29,\n116,100,490,0,0,0,0,0,1641,0,543,0,0,0,0,41,181,0,657,0,0,202,25,0,0,0,0,0,0,0,\n0,0,0,423,0,0,0,113,0,0,0,927,963,0,976,0,206,0,0,0,0,0,0,0,0,0,2002,0,0,0,0,0,\n0,0,0,0,0,0,696,0,1170,0,0,0,0,226,13,0,769,678,551,0,0,0,0,0,0,57,0,0,0,10,188,\n0,0,0,624,0,0,0,0,0,0,0,0,0,1941,130,0,0,0,0,378,269,0,0,528,0,1146,0,0,0,1105,\n0,1616,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,656,0,1940,0,0,0,0,0,173,0,0,0,0,0,0,0,0,0,\n0,0,457,342,810,0,0,0,0,620,0,0,0,0,0,0,0,967,95,447,406,0,0,0,477,0,1268,944,\n1941,0,0,0,629,0,0,0,0,0,375,0,0,0,1636,0,0,0,0,774,0,1,1034,0,0,0,0,0,824,0,0,\n0,0,0,118,0,0,560,296,0,0,0,0,0,0,0,0,1009,894,0,0,0,0,0,0,0,0,0,0,0,0,0,1474,\n366,0,0,0,0,0,0,0,0,0,79,1723,0,0,200,0,0,0,0,0,0,0,0,1759,372,0,16,0,943,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,258,0,0,900,1839,707,30,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,2004,0,0,10,115,0,50,0,0,0,0,0,0,0,0,0,0,520,1,0,738,98,482,0,0,0,0,\n0,0,0,0,0,0,701,2,0,0,0,0,0,0,0,0,557,0,0,0,0,0,0,0,0,0,347,0,0,0,0,572,0,0,0,0,\n0,0,0,0,0,832,0,0,797,809,0,0,0,0,0,0,0,0,0,0,0,528,0,0,0,861,0,0,294,0,0,0,109,\n0,0,0,0,0,0,0,0,1187,290,266,0,0,0,0,49,50,748,0,0,466,399,0,0,0,0,0,0,0,378,0,\n519,0,0,0,0,0,0,0,0,0,0,0,0,667,351,902,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,180,\n0,0,869,0,0,0,0,0,0,0,260,0,0,0,0,0,0,0,0,0,0,523,36,0,0,587,510,809,29,260,0,0,\n0,0,0,0,0,0,570,0,565,0,1464,0,0,0,0,0,0,10,0,0,787,399,380,200,0,0,0,0,516,0,\n844,887,0,0,0,0,0,0,0,44,0,0,0,305,1655,0,0,0,0,0,0,0,0,0,0,0,0,0,0,786,10,0,0,\n0,0,0,0,0,0,0,2031,0,0,0,0,0,684,0,0,0,0,0,1480,0,0,0,27,0,0,0,395,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,813,511,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,56,0,0,0,206,\n496,0,0,0,0,0,909,0,891,0,0,0,0,0,0,0,0,0,687,0,0,0,1342,0,0,0,0,0,0,0,0,0,0,\n160,41,0,0,0,0,0,0,0,0,0,0,0,1718,778,0,0,0,0,0,0,0,0,0,0,1610,0,0,0,0,0,115,0,\n0,0,0,314,294,0,0,0,983,178,193,0,0,0,0,0,0,0,0,0,174,0,0,0,0,0,0,0,0,0,0,848,\n1796,0,0,0,0,0,0,221,0,687,1660,0,0,0,0,262,0,0,179,0,0,0,0,0,66,0,773,0,352,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,35,0,152,0,0,1197,0,0,0,0,0,0,0,0,0,0,0,0,560,0,0,\n564,0,0,0,797,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,556,0,819,0,0,0,0,0,0,0,0,719,544,\n637,5,0,0,0,0,0,0,0,0,0,0,0,101,0,1441,0,0,0,893,0,0,0,0,0,0,0,0,0,238,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,1296,0,0,969,1729,314,60,0,0,0,0,0,1144,0,1147,0,0,0,0,0,\n0,0,0,0,0,437,1853,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,828,0,176,0,0,0,0,0,0,434,39,0,\n0,0,0,0,159,0,0,0,902,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,270,0,0,0,0,801,556,0,0,\n0,0,0,0,0,416,19,197,369,0,0,0,0,0,0,0,0,0,28,34,0,757,0,0,898,1553,0,721,0,0,0,\n0,1012,0,0,0,0,1102,0,898,183,0,0,0,0,0,0,0,136,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,247,277,0,0,0,435,0,0,0,0,0,1311,0,0,0,0,\n0,0,211,437,0,0,0,28,0,0,750,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2012,0,702,\n0,808,0,0,0,0,739,166,0,0,0,0,0,0,719,170,500,0,0,0,0,0,0,0,0,1500,327,0,0,450,\n0,0,0,1318,0,0,0,1602,0,0,331,754,0,0,0,0,0,1368,0,0,557,0,0,0,799,850,0,0,0,0,\n0,0,0,0,908,0,0,0,0,0,19,62,459,0,0,0,0,0,0,0,0,0,0,0,0,1802,0,0,0,0,0,0,0,0,0,\n1397,0,0,0,0,120,238,0,0,0,0,0,0,0,0,0,0,0,1324,0,0,0,0,0,0,0,0,602,201,0,0,164,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,615,0,0,0,0,0,0,0,0,0,0,0,0,0,1243,0,0,0,0,968,0,0,\n0,0,0,0,882,0,0,0,907,329,100,0,0,0,0,0,0,0,0,0,0,0,176,26,9,0,0,265,256,0,0,0,\n0,0,0,0,0,0,643,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,127,610,0,0,0,0,973,2001,0,\n0,0,0,0,0,522,0,0,0,0,0,0,0,0,0,0,0,553,0,0,0,0,0,0,1582,0,1578,0,0,0,0,0,0,0,0,\n0,0,0,795,0,0,0,432,0,0,0,0,0,0,84,126,0,0,0,0,790,0,377,64,0,1529,0,0,0,0,530,\n1857,539,1104,0,0,0,0,0,0,0,0,0,0,0,0,977,0,0,0,34,0,0,0,0,0,0,0,0,0,0,0,24,26,\n0,0,918,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,183,379,0,0,0,0,0,0,0,792,\n0,0,0,0,0,0,0,0,0,1920,0,0,0,0,0,0,0,0,0,771,0,0,0,1979,0,901,254,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,140,0,0,0,0,0,440,37,0,\n508,0,0,0,513,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,533,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,752,920,0,1048,0,153,0,\n0,391,0,0,1952,0,0,0,0,0,0,0,0,0,0,126,0,0,0,0,640,0,483,69,1616,0,0,0,0,0,734,\n0,0,0,0,0,0,480,0,495,0,472,0,0,0,0,0,0,0,0,874,229,0,0,0,0,948,0,0,0,0,0,0,0,0,\n1009,748,0,555,0,0,0,0,0,0,193,0,653,0,0,0,0,0,0,0,0,0,0,984,0,0,0,172,0,0,0,0,\n0,0,0,0,83,1568,0,0,384,0,0,0,0,0,0,0,164,880,0,0,0,0,0,0,0,0,0,0,0,367,121,0,0,\n828,0,0,0,0,0,0,0,1541,0,0,0,0,0,0,0,343,0,0,0,0,0,0,0,0,561,57,0,0,0,0,0,0,0,\n926,0,0,0,0,827,0,194,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,22,0,0,0,0,0,0,0,\n0,0,0,896,1249,0,0,0,0,0,1614,0,0,0,860,0,0,0,0,0,0,0,0,964,102,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,899,0,569,0,0,0,0,795,2045,0,0,0,\n0,0,0,104,52,0,0,0,0,0,604,0,0,0,0,779,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,\n494,0,677,0,0,0,0,0,0,0,508,0,0,0,0,0,0,0,0,0,1014,0,957,0,0,630,310,0,0,0,570,\n0,0,449,0,64,537,0,0,0,0,0,0,0,244,0,0,0,0,0,0,0,0,0,0,0,0,0,0,702,1650,49,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,338,0,0,0,0,1279,0,0,0,0,0,0,0,896,0,0,\n178,0,0,0,0,0,0,0,0,0,0,0,0,0,808,695,0,0,0,0,539,1117,0,0,0,0,0,0,0,0,257,0,\n1003,0,0,0,1,448,0,516,0,0,960,0,125,4,0,1268,30,748,0,0,852,0,0,0,6,0,0,848,\n236,1385,862,1811,0,0,0,0,698,803,0,0,0,0,0,0,0,610,992,0,0,878,0,1847,0,0,0,0,\n0,0,0,383,0,1404,0,0,0,0,986,0,347,0,0,0,0,0,0,0,0,0,0,0,592,572,0,1411,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,606,0,0,0,0,0,0,\n0,0,0,0,0,0,0,1829,0,0,0,0,0,0,0,0,0,0,0,0,700,748,0,0,0,0,0,0,365,0,0,127,0,0,\n83,198,0,0,0,0,0,0,864,55,0,0,0,0,726,1752,0,0,0,0,0,0,0,0,0,0,0,0,0,1066,0,764,\n0,0,0,0,683,0,550,309,0,0,874,1212,0,0,0,1364,0,986,381,723,0,0,0,1573,0,0,0,0,\n0,1025,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1559,0,0,0,0,493,133,0,0,0,0,148,\n119,0,0,0,0,0,0,537,14,541,0,635,126,0,0,0,495,0,0,0,0,861,998,1009,0,0,0,0,0,0,\n0,359,368,0,0,0,0,304,1577,0,0,0,0,0,1107,0,0,0,0,0,929,0,0,0,1142,0,0,0,0,289,\n175,0,432,0,219,0,0,0,0,0,785,0,0,595,0,0,0,0,0,0,0,0,0,0,0,0,0,80,0,0,0,0,0,0,\n931,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1323,0,0,0,0,290,0,559,1751,127,0,0,0,\n934,1167,0,963,0,260,0,0,0,573,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n580,1689,0,0,0,0,0,0,0,0,0,1164,0,0,982,1922,0,63,0,0,0,0,0,793,0,0,0,0,0,0,0,0,\n0,0,0,0,0,67,790,0,0,0,0,0,0,0,0,0,0,391,443,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,271,0,0,0,0,0,0,0,0,0,0,0,1140,0,0,0,0,340,300,0,897,0,0,0,0,0,0,\n0,0,0,0,890,0,0,0,0,818,321,53,0,0,0,0,0,0,0,0,0,468,0,243,0,870,0,0,0,1765,121,\n0,0,0,180,518,0,822,419,634,0,0,0,0,0,0,0,0,0,898,0,0,0,0,454,36,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,806,0,0,0,0,0,0,0,0,0,0,0,0,1326,0,104,0,0,0,0,0,0,0,\n0,0,260,0,0,0,0,0,0,0,0,0,0,0,0,542,45,0,0,263,1516,42,0,0,0,0,0,468,0,1005,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,87,0,0,0,0,0,0,0,0,502,988,133,0,0,0,0,0,0,\n141,0,0,872,1842,0,0,0,0,0,0,0,0,261,619,0,0,0,0,189,246,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,678,0,0,0,0,0,0,0,0,0,0,0,0,285,35,0,517,0,0,0,0,0,0,0,0,0,0,\n540,214,667,0,74,0,0,125,0,0,0,0,0,761,131,0,0,0,0,0,0,0,0,0,0,0,0,0,333,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1338,94,0,0,0,0,0,0,0,0,0,0,0,0,449,0,646,103,\n86,641,2028,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,869,87,277,117,39,0,0,0,0,0,0,0,0,938,\n297,0,0,0,0,558,464,0,0,0,0,0,0,0,0,0,0,731,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1608,0,\n0,0,0,0,0,0,1429,0,0,733,1010,0,0,338,1656,0,0,0,1038,979,2010,0,0,0,0,0,0,0,\n1005,0,0,121,0,0,0,219,20,0,0,0,0,0,0,872,1440,0,0,0,683,0,1070,0,0,522,0,0,0,0,\n439,669,0,0,0,0,0,0,0,0,1245,0,0,0,0,0,1218,0,0,547,233,0,0,0,0,0,0,0,0,0,482,0,\n0,0,0,0,0,0,886,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,795,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,371,0,0,0,0,0,0,0,0,0,0,0,0,0,622,0,625,0,0,0,339,29,0,0,338,0,0,0,\n0,130,0,0,0,0,0,0,0,0,0,307,0,0,0,0,0,0,0,0,0,0,2044,0,0,0,0,0,0,0,0,308,770,0,\n0,0,0,0,1266,0,0,0,0,0,0,0,0,0,400,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,690,739,0,0,\n0,0,0,0,0,990,0,0,0,1831,0,0,0,0,0,0,0,0,0,0,0,0,0,613,0,0,0,0,0,0,0,0,0,0,0,0,\n0,763,0,878,0,0,0,977,0,100,0,0,0,0,0,0,0,0,0,463,0,0,0,0,623,318,0,0,296,463,\n137,0,0,454,0,0,0,1527,58,0,0,0,0,0,0,0,18,48,0,0,0,0,0,729,0,0,0,442,0,0,0,0,\n40,449,0,853,0,0,0,0,0,0,227,0,0,0,0,0,0,1491,0,0,0,0,0,0,0,0,0,0,161,55,0,450,\n0,1174,62,0,207,0,0,0,0,0,0,0,0,869,0,0,0,0,80,213,0,0,0,0,0,0,0,0,0,0,354,820,\n0,0,747,0,0,0,954,0,0,1073,0,556,0,0,0,692,0,191,0,804,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,831,162,0,0,35,0,0,0,0,0,0,0,0,1235,0,0,0,0,0,1234,0,0,\n0,0,0,0,0,0,0,0,96,0,0,0,0,0,0,0,149,0,0,0,902,204,0,0,833,0,287,366,0,0,0,0,0,\n0,992,2020,0,0,0,0,0,0,0,0,0,0,0,356,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,784,0,0,567,\n630,0,0,0,539,0,0,27,0,0,0,0,0,0,0,0,0,0,755,0,0,0,0,0,0,0,0,0,0,0,0,814,0,0,0,\n0,0,0,0,0,0,0,0,0,0,987,0,0,255,761,194,0,1086,0,0,0,0,0,0,1016,0,0,1396,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,562,271,913,0,0,0,0,0,0,0,0,320,153,45,475,0,0,\n0,0,0,0,0,713,0,327,0,0,0,0,0,0,604,552,3,359,0,0,0,0,853,80,0,0,0,0,0,0,0,2016,\n6,887,0,0,0,0,975,0,961,0,0,0,0,0,916,1891,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,100,101,390,708,0,0,0,587,983,512,0,0,0,0,0,0,0,0,0,0,0,645,0,0,0,851,0,0,0,\n0,0,498,140,217,0,0,0,1448,0,0,0,0,0,0,0,0,0,905,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n643,105,0,792,0,0,0,0,0,0,0,0,0,0,0,0,56,0,0,0,0,0,0,0,0,0,0,535,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,1748,0,0,0,0,0,754,0,0,0,0,0,0,0,0,0,0,0,0,91,0,0,1565,0,91,792,\n939,3,370,0,0,0,0,95,0,0,0,0,551,7,619,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1150,0,\n0,0,0,0,0,0,0,0,0,0,0,0,671,0,0,0,0,0,888,368,149,0,0,105,1134,0,983,0,0,458,31,\n0,643,0,0,0,312,0,740,0,0,0,1642,0,0,0,0,0,0,0,236,0,0,0,0,0,0,0,59,68,0,0,0,0,\n0,867,795,0,0,0,0,970,1977,0,0,0,0,0,0,0,1148,0,775,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,970,0,0,0,0,0,0,0,0,0,665,71,0,0,0,0,827,0,0,0,0,0,0,0,0,0,\n0,479,0,0,0,0,0,0,0,0,99,607,0,0,0,0,0,0,0,1960,0,0,0,793,0,0,871,41,0,0,241,94,\n0,0,0,0,209,0,0,1497,0,0,0,0,0,0,0,0,0,98,0,0,0,463,0,0,0,0,291,0,0,0,0,0,0,0,0,\n0,0,984,0,0,0,0,0,205,0,0,0,0,0,0,205,42,0,801,0,0,0,0,0,635,0,0,533,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,371,0,1282,0,0,0,825,0,0,0,0,0,0,0,0,0,357,879,467,0,317,0,0,\n0,0,0,0,0,924,0,0,0,0,849,1795,0,0,0,0,895,1799,43,0,0,0,0,0,0,0,0,0,0,1820,0,0,\n0,0,0,0,0,525,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,110,0,493,0,174,417,0,0,\n0,0,0,583,733,0,0,0,0,0,0,481,215,0,0,0,0,477,0,0,0,0,0,0,0,0,308,0,0,0,0,0,0,0,\n0,297,126,0,0,361,1551,0,0,0,0,0,0,871,1807,0,0,0,0,0,1307,0,685,0,0,0,0,0,0,0,\n797,0,858,0,565,0,0,0,0,0,0,0,0,0,0,0,0,434,252,826,0,0,0,0,0,0,791,0,0,0,0,509,\n231,178,601,0,0,0,0,0,0,0,0,43,1591,0,0,0,0,0,1683,0,0,0,0,45,0,0,0,0,0,0,0,0,0,\n0,1120,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,556,494,0,398,0,0,0,1030,0,0,0,0,0,0,\n168,0,0,0,0,0,0,0,0,0,0,973,0,642,0,0,0,0,0,0,0,0,0,1615,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,378,594,0,1093,0,679,112,0,0,0,0,1492,540,1374,714,\n1486,0,0,0,0,825,1511,0,0,0,0,0,0,0,0,0,0,0,0,0,952,0,0,736,143,0,700,0,1540,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1557,0,0,0,860,990,0,0,0,807,0,0,0,0,0,131,\n515,0,646,0,0,0,0,117,728,508,121,0,0,0,0,0,0,357,0,0,0,0,0,0,237,0,0,0,0,0,0,0,\n0,0,1784,0,0,0,0,0,0,0,0,0,0,0,713,348,1536,0,738,0,0,0,0,0,0,0,434,0,0,0,0,0,0,\n366,1877,39,0,0,0,0,0,0,580,0,0,0,0,0,0,0,0,0,0,0,0,0,0,873,0,0,0,0,171,0,625,\n550,107,343,943,0,0,0,0,0,0,0,768,0,0,0,0,0,0,0,799,0,0,0,894,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,1673,0,0,0,0,0,0,0,0,0,0,0,1052,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n272,0,441,0,0,3,9,0,0,0,1182,0,1346,0,0,0,0,0,0,0,0,682,0,0,1004,24,0,0,968,0,0,\n0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,185,0,0,0,578,\n474,0,0,0,0,0,0,0,0,0,0,0,0,0,0,113,530,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,556,0,0,0,0,0,0,16,1317,0,0,97,0,0,0,703,0,0,0,0,0,0,0,0,892,0,0,0,1571,0,0,\n426,186,0,1101,0,0,0,0,0,0,0,0,937,585,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,644,291,\n0,0,0,0,749,0,162,0,0,381,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,762,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,628,21,0,0,0,0,0,0,0,0,919,0,0,0,0,0,0,0,0,0,\n633,0,0,0,0,332,0,0,0,0,0,0,0,0,0,1489,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,832,398,0,645,0,0,0,13,0,0,0,0,0,0,0,0,0,0,20,0,800,0,0,0,0,0,0,0,0,0,\n0,0,0,0,1993,0,0,0,0,769,0,0,0,665,0,0,0,0,0,0,0,0,0,0,1426,0,0,0,0,60,0,0,0,\n641,1874,0,644,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1757,0,0,0,0,0,937,0,1652,0,654,0,\n0,0,0,0,0,0,527,0,0,0,0,0,0,0,0,0,0,0,0,0,226,0,0,0,0,0,1486,0,0,0,0,0,0,0,0,0,\n0,0,325,0,0,0,0,0,0,0,1345,0,0,91,0,404,0,0,0,0,0,0,0,0,0,0,0,0,973,0,0,0,0,0,0,\n0,1176,0,549,0,0,0,0,0,0,0,0,0,0,976,0,0,0,0,0,21,0,0,0,0,0,51,0,0,0,0,314,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,198,6,0,1093,0,0,0,0,0,0,0,0,0,\n0,0,0,0,1776,0,0,0,0,0,1528,0,419,0,0,0,0,0,0,0,0,76,138,0,0,0,0,638,29,0,0,0,0,\n0,0,0,1418,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1710,0,0,0,0,0,\n0,0,0,0,0,0,0,532,23,0,0,0,0,0,0,0,862,0,0,946,592,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,70,0,0,0,0,0,0,0,0,0,812,0,0,0,76,0,0,988,0,442,0,0,0,896,0,0,0,0,0,0,\n483,0,0,0,0,1709,0,0,0,0,0,0,119,0,0,0,117,0,309,0,0,0,0,0,596,976,0,0,0,0,0,0,\n0,0,0,0,0,768,0,0,0,0,0,0,0,0,0,518,0,0,0,0,0,0,0,0,0,0,0,0,0,0,863,0,0,0,24,\n145,1020,0,0,1984,0,0,0,0,0,0,0,658,0,0,0,0,0,0,0,0,0,0,106,1827,0,1010,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,582,87,0,0,0,0,0,0,0,267,0,0,0,703,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,496,0,0,0,0,1121,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,249,561,0,0,0,0,0,\n0,0,760,0,0,154,0,0,0,255,0,419,323,0,0,0,0,0,368,0,0,0,0,0,0,0,0,0,0,522,0,0,0,\n0,0,0,0,551,562,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,92,0,0,0,0,\n0,0,0,284,525,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,958,0,0,594,0,0,0,0,0,0,6,479,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,61,0,0,0,0,0,0,0,820,1641,0,1556,0,0,0,0,0,0,0,302,0,0,\n0,0,0,148,0,0,676,0,0,0,0,0,0,1674,0,0,0,0,0,0,178,0,0,0,0,0,0,0,94,389,0,0,0,0,\n91,8,0,0,0,0,0,0,0,0,0,0,112,0,0,0,0,0,0,0,0,0,0,747,0,0,0,0,0,0,0,1746,0,0,0,0,\n0,24,0,1352,158,1530,0,0,718,130,280,1401,0,0,0,0,0,1946,8,0,0,0,0,1607,0,0,0,0,\n0,0,882,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,417,0,0,0,1597,633,433,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,234,0,0,0,0,0,0,0,0,680,1950,0,0,0,0,249,5,0,0,0,\n0,0,0,0,0,0,1216,0,1773,0,0,0,0,0,0,0,0,0,0,0,0,0,0,509,180,0,0,0,0,0,0,0,1002,\n0,0,0,0,0,0,0,0,0,0,0,0,0,931,0,0,0,0,0,0,0,0,747,943,0,1837,0,0,0,0,0,0,0,641,\n0,0,0,0,280,0,0,0,5,0,0,0,0,0,72,545,0,0,0,0,0,0,0,0,0,742,0,0,254,151,872,0,0,\n0,0,0,0,0,0,0,0,0,0,921,0,0,517,833,0,1680,0,0,436,251,584,0,0,0,0,0,0,0,0,0,0,\n0,24,500,0,0,0,0,0,0,0,0,195,1775,514,389,0,0,0,0,0,0,0,743,0,0,0,0,0,0,292,0,0,\n0,227,1283,774,1805,0,0,0,0,0,0,0,0,0,0,119,81,0,0,0,0,0,0,0,0,0,0,0,0,0,0,913,\n1910,0,0,0,1826,490,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1162,700,30,\n0,0,0,721,839,0,0,0,617,0,0,0,0,0,0,0,0,0,169,428,0,0,0,0,0,1648,637,1205,0,0,0,\n1596,0,0,4,266,0,0,0,0,0,0,0,0,0,0,0,862,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,\n0,279,157,391,604,0,0,713,945,877,973,0,0,0,0,0,0,0,0,0,0,0,0,0,0,859,567,628,\n1846,0,0,0,0,0,0,0,0,0,762,0,0,191,0,0,0,0,298,0,0,767,909,0,0,0,0,0,0,0,795,0,\n0,301,0,0,1970,0,0,0,0,0,0,0,0,0,1236,0,0,0,0,0,0,644,369,15,0,160,71,0,0,0,0,0,\n1447,0,0,0,0,0,0,0,0,735,1255,76,0,0,0,0,0,0,0,0,0,0,474,0,0,0,0,0,0,0,0,0,0,\n841,0,0,0,0,0,0,0,0,0,0,836,0,0,0,0,0,1622,0,0,735,0,0,0,0,1601,804,1390,394,0,\n0,0,0,0,0,96,0,289,0,0,35,688,0,0,0,667,0,513,0,0,0,0,0,0,0,2034,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,704,0,1524,0,1078,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,306,\n0,0,0,0,0,0,0,431,0,1196,0,0,54,0,15,1448,0,1418,0,0,0,0,0,0,0,0,0,907,0,0,0,0,\n0,0,194,1767,0,0,0,0,0,840,0,900,0,0,0,0,0,0,0,0,0,0,0,1436,0,0,0,0,642,1560,0,\n0,0,0,0,0,94,386,0,0,0,0,0,0,0,0,0,0,830,416,0,0,20,731,0,0,0,0,0,0,0,0,697,0,0,\n662,0,0,0,0,0,0,0,0,0,861,0,0,0,0,0,0,0,871,671,864,0,928,7,0,332,0,0,0,0,1055,\n0,0,0,0,0,0,986,0,0,0,0,0,44,76,0,0,0,0,0,0,0,0,0,0,300,0,0,0,0,0,0,0,175,518,\n831,1108,0,0,0,836,0,1852,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,843,1804,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,246,0,0,0,610,202,0,0,36,0,0,0,240,654,13,0,0,0,0,0,0,0,\n0,391,0,403,0,0,0,0,0,0,0,0,0,0,75,0,366,815,0,0,631,0,0,0,0,0,0,0,0,345,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,952,0,0,0,0,0,0,0,0,0,0,0,673,35,662,0,287,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,5,34,0,0,0,0,0,0,0,0,151,0,427,0,0,382,0,0,0,329,0,0,279,0,0,0,\n0,0,0,0,0,0,0,906,0,0,366,843,0,1443,0,1372,992,0,36,123,0,649,0,0,0,0,0,767,0,\n1018,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,995,0,0,0,0,0,0,0,72,368,0,0,1345,0,0,0,\n589,0,0,0,0,0,0,0,0,0,1988,0,0,220,541,0,0,0,686,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,32,196,0,0,0,0,0,0,0,0,0,0,0,0,0,381,0,0,0,0,0,0,0,0,0,1452,0,\n0,0,616,0,0,0,0,0,0,0,0,0,1229,0,0,0,0,0,0,0,0,0,0,667,120,0,0,0,0,0,0,0,1146,0,\n0,0,0,0,0,0,0,0,0,0,352,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,0,935,0,1050,0,\n147,88,0,0,923,0,0,0,0,0,934,0,0,0,0,0,0,0,0,114,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,341,222,0,0,0,0,0,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,\n637,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1159,0,0,0,847,0,0,0,0,0,0,683,0,867,944,0,0,\n0,0,0,1809,0,0,0,0,0,0,0,0,0,0,395,170,0,0,0,0,0,0,0,0,0,0,618,535,0,1625,0,0,0,\n0,0,0,0,0,23,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,778,0,0,0,0,0,46,0,2032,0,0,37,\n1458,0,938,363,34,0,0,0,0,0,0,0,0,0,0,0,0,0,0,314,0,0,0,0,0,0,889,0,0,0,0,0,0,0,\n0,0,0,0,462,0,0,0,0,525,0,0,23,0,0,0,0,0,0,0,0,0,0,0,676,0,0,0,0,0,0,0,0,0,0,0,\n0,498,725,0,0,0,0,7,0,0,0,0,773,0,0,0,164,0,0,0,0,0,0,0,0,936,583,659,1462,0,\n220,0,0,0,0,803,0,0,544,119,0,0,0,0,0,0,0,0,0,0,0,181,176,0,1192,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,1878,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,26,0,0,0,0,0,0,\n944,0,0,0,0,0,0,0,273,0,0,0,0,0,855,0,0,0,0,5,127,0,0,0,0,0,0,0,0,752,230,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,68,162,0,654,48,156,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,240,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,197,\n0,0,0,0,0,0,0,963,0,0,0,0,0,0,0,0,0,0,858,0,0,0,0,0,0,0,0,0,0,676,1978,0,0,102,\n972,0,0,0,0,0,0,0,361,0,461,0,0,0,472,0,0,0,0,0,0,0,0,0,0,0,0,0,0,747,905,0,0,0,\n155,0,0,0,0,0,0,0,0,0,0,319,163,0,0,0,0,0,0,0,0,0,848,0,0,36,631,0,0,0,0,0,1769,\n0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,369,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,555,247,0,0,\n996,0,0,189,0,0,0,0,0,0,0,0,0,0,280,0,0,0,0,0,0,0,0,0,0,0,526,746,0,0,345,0,0,0,\n1017,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,651,428,0,0,0,1162,230,327,546,792,0,0,0,\n1203,0,0,0,0,0,0,0,0,0,672,189,0,0,0,0,0,0,99,0,0,0,298,0,0,0,0,0,0,555,397,0,0,\n0,0,0,1157,0,0,0,0,0,0,0,0,0,0,398,1523,0,366,0,0,787,0,0,0,282,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,157,0,941,0,0,0,0,0,1336,0,0,116,0,0,0,0,0,0,787,0,0,0,0,0,0,0,0,0,\n0,170,160,0,1815,0,0,0,0,0,866,0,0,0,0,0,0,0,0,0,689,0,0,0,0,820,0,498,108,0,0,\n0,1119,0,0,0,244,609,1005,0,581,0,0,0,0,0,895,0,0,0,1898,0,0,0,0,0,926,0,0,0,0,\n0,0,0,0,0,0,0,0,0,538,496,294,301,0,0,0,18,0,0,757,0,0,0,0,0,1263,0,820,0,722,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2028,0,0,0,0,124,1875,0,0,0,881,0,0,0,1348,\n0,0,0,0,0,0,0,911,0,954,0,0,0,0,414,0,0,0,0,517,0,0,0,0,0,816,0,0,0,0,0,0,0,0,\n713,0,0,0,0,0,0,0,33,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,593,150,0,0,0,0,\n0,553,0,0,0,0,0,0,0,0,0,0,108,0,0,0,0,420,0,0,0,0,0,0,0,0,0,0,0,1777,0,0,55,493,\n0,0,81,0,321,980,0,0,0,0,0,0,0,0,0,0,0,0,0,0,362,112,0,74,0,0,0,0,0,0,0,625,0,0,\n0,0,0,0,377,16,0,0,61,281,0,0,0,0,0,0,0,0,0,0,0,0,0,0,224,1031,0,0,0,0,0,0,51,0,\n0,0,0,0,0,0,211,309,15,125,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,789,173,0,439,9,648,\n0,0,294,0,0,0,0,0,0,0,374,8,0,1099,0,0,0,0,0,0,0,575,0,0,0,518,0,0,0,702,0,0,0,\n0,0,0,87,0,0,0,438,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,464,122,0,0,0,1802,0,0,0,0,\n0,0,499,0,0,0,87,476,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,840,283,0,0,0,0,1620,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,609,1160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,600,\n323,372,0,0,0,0,471,722,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,\n477,1304,0,1774,0,0,88,0,438,12,0,0,0,0,0,0,0,0,671,997,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,639,22,0,0,782,681,0,0,0,0,0,0,0,0,0,0,1013,664,0,942,0,1349,0,0,0,0,0,0,0,\n0,0,0,0,0,356,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,215,289,0,1975,\n109,450,0,0,0,0,0,0,0,0,0,0,705,0,0,664,0,0,0,0,0,0,0,1238,0,0,318,0,0,0,0,0,0,\n0,0,0,0,0,0,0,960,1872,0,0,0,0,0,0,0,0,0,0,0,0,0,0,103,0,0,0,0,0,0,0,0,0,239,\n777,0,26,0,0,0,0,0,0,0,0,0,0,0,0,375,414,0,17,0,0,0,1350,0,955,0,0,0,0,0,0,0,0,\n887,960,0,0,0,0,0,0,0,0,0,0,708,710,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,919,0,0,0,\n0,502,280,7,45,0,0,0,0,777,0,0,0,0,410,0,1110,0,0,0,0,0,0,414,341,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,787,0,0,0,436,0,0,0,0,0,0,0,1707,613,377,96,0,0,0,0,451,\n0,0,0,0,0,0,0,0,0,0,0,0,0,680,0,483,916,0,0,0,0,0,0,937,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,739,0,0,0,0,0,0,0,0,82,0,0,663,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,128,0,0,0,0,0,0,0,0,1087,0,0,0,0,0,0,0,503,0,0,0,0,0,0,9,113,104,324,0,460,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,935,702,434,485,1014,949,423,0,900,\n0,0,0,0,0,0,0,2018,574,0,0,0,0,0,0,0,0,0,0,0,0,1206,0,0,0,0,0,0,0,0,38,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,1022,0,0,0,0,143,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,2029,0,0,0,0,0,0,0,0,0,0,0,0,523,0,0,0,0,0,0,625,0,0,425,37,0,0,0,1943,0,0,0,\n0,0,765,0,0,0,0,0,0,0,0,0,0,551,0,0,0,0,0,0,0,0,0,0,0,0,168,0,0,1010,0,0,1994,0,\n0,0,91,0,0,0,0,532,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1884,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,240,15,0,0,0,1227,0,1534,0,0,0,0,0,0,0,0,0,0,0,0,0,0,392,0,\n0,0,0,0,0,0,0,0,0,0,0,655,562,395,0,0,0,501,1019,0,0,0,0,509,267,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1099,0,0,0,0,0,0,948,0,0,0,0,0,0,0,\n462,114,0,0,258,404,0,1717,0,0,0,0,82,1061,0,724,0,0,0,0,0,1133,0,0,0,0,0,0,\n1021,841,0,1021,0,0,0,0,0,0,0,0,0,0,488,373,37,0,0,0,0,564,0,0,0,0,0,513,0,0,0,\n825,0,0,899,0,0,778,0,0,12,1417,0,1116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,114,545,0,5,\n0,0,0,0,0,0,0,192,0,0,763,0,0,0,0,0,0,0,755,759,0,0,0,0,0,0,0,0,0,370,0,1237,0,\n0,0,0,0,0,298,87,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,31,0,0,\n0,0,0,0,814,991,0,757,57,0,0,0,0,0,0,0,0,0,540,0,0,0,0,608,0,0,0,0,0,0,0,0,1014,\n0,0,0,902,0,0,0,0,553,1668,0,0,0,0,0,0,0,0,0,559,60,0,0,0,0,0,511,0,0,675,0,0,\n156,0,0,0,0,0,0,709,0,698,0,0,0,1745,0,0,0,0,0,0,0,0,0,714,0,0,0,0,0,0,0,0,206,\n8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,776,0,0,0,0,0,0,0,0,0,1272,0,0,\n0,0,0,1059,0,0,0,0,0,0,406,0,0,0,0,0,0,0,0,0,0,947,0,0,0,0,0,0,168,0,0,0,0,0,0,\n870,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,554,0,0,0,0,784,908,0,0,0,0,0,0,\n0,396,358,0,0,0,0,0,0,0,0,2,228,0,0,0,0,0,0,0,0,0,0,0,845,14,0,716,1820,594,0,\n81,1428,0,161,0,782,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,998,0,\n0,0,0,0,0,0,0,0,0,0,0,1043,0,1496,0,0,0,0,0,0,0,0,781,0,0,0,0,0,0,0,817,1114,0,\n1814,958,0,0,0,0,812,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,139,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,236,643,0,0,0,0,0,0,0,0,0,1172,0,0,0,0,0,0,0,0,0,1338,0,0,0,\n0,0,0,0,0,0,0,0,54,0,0,0,256,0,0,351,0,955,1885,0,469,0,0,0,1270,0,744,0,313,0,\n0,0,0,0,0,0,0,402,969,0,0,0,0,0,0,50,0,0,0,0,572,0,0,0,0,847,0,0,0,0,0,0,0,248,\n43,0,369,0,0,0,0,0,0,0,0,0,0,0,0,0,766,0,363,0,0,0,0,0,0,0,0,0,0,0,678,0,0,409,\n258,82,249,0,0,0,0,0,0,0,0,0,0,0,0,32,393,0,788,0,0,0,1281,509,1968,0,0,0,0,39,\n291,0,0,0,589,0,0,54,1059,0,0,0,0,0,0,824,0,0,0,0,0,0,0,0,0,0,1005,0,1598,0,0,0,\n0,0,919,0,0,0,0,0,0,0,0,52,132,0,0,0,0,0,328,0,0,0,0,173,0,0,0,0,0,65,1411,0,0,\n0,0,0,0,0,0,0,0,442,0,842,0,0,0,0,0,0,0,0,0,534,0,0,0,0,0,0,0,0,0,0,0,0,0,845,\n210,0,0,0,0,0,0,0,0,892,0,0,223,0,0,0,0,529,0,0,0,807,0,137,218,0,1444,0,0,0,0,\n0,332,661,0,0,0,0,0,0,0,76,1517,0,0,0,0,0,0,0,0,0,0,0,418,0,0,0,0,0,0,0,0,481,\n379,0,0,0,0,0,149,18,0,0,0,0,0,0,0,0,742,304,142,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,799,925,195,51,0,0,0,0,688,0,0,0,0,697,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,1169,751,0,0,0,452,929,0,221,0,1437,0,0,0,0,955,1251,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,192,0,132,0,0,0,0,0,865,0,0,0,0,0,0,0,767,\n672,42,0,0,0,1050,0,0,0,0,0,0,0,0,368,44,0,0,0,0,0,0,0,570,29,0,0,0,0,0,0,227,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,522,0,0,0,0,0,0,0,1529,0,0,0,0,0,0,739,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,1667,0,0,0,0,0,0,132,511,0,138,208,1020,0,0,23,565,0,344,0,0,0,\n0,0,922,0,0,0,0,0,0,0,240,0,0,415,171,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,402,0,0,754,31,716,0,982,731,0,0,0,0,0,0,0,888,0,0,0,803,847,0,0,823,\n0,0,0,0,0,0,785,0,0,2,0,0,0,0,0,0,0,532,0,0,681,0,0,314,0,384,684,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,649,447,0,1818,1007,0,321,0,66,360,0,0,0,385,0,0,0,0,0,0,\n0,900,73,254,0,0,0,0,683,1959,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,86,0,0,725,0,0,0,0,0,196,0,0,0,0,0,831,0,0,0,0,723,0,0,0,0,0,994,627,0,0,\n0,0,0,0,0,0,0,0,764,66,0,0,0,0,205,36,0,0,0,0,0,0,0,950,0,0,0,887,111,0,0,831,\n388,165,0,0,0,0,0,155,0,0,0,0,0,0,0,0,0,0,0,0,0,0,780,755,0,0,0,0,898,146,0,0,0,\n0,0,0,0,45,7,0,0,0,0,0,0,0,0,607,0,0,0,0,0,0,65,0,0,0,0,0,0,0,0,0,88,0,0,0,0,0,\n621,600,0,367,0,0,0,0,0,0,0,561,0,559,0,585,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n287,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,672,157,0,0,0,0,714,0,0,0,\n0,0,456,0,925,0,0,0,0,0,0,0,0,19,0,0,0,0,1473,0,0,0,0,0,0,0,0,0,0,113,0,0,0,0,0,\n0,0,0,0,0,0,0,0,69,463,0,0,82,193,2,471,0,0,0,0,633,0,0,0,0,0,0,1148,129,1392,\n542,803,0,0,0,0,0,0,0,0,0,0,0,0,438,0,0,0,0,0,0,875,0,0,0,0,0,237,0,0,0,0,0,0,0,\n65,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,563,0,0,0,9,444,0,0,43,1260,0,0,0,0,0,0,\n971,0,0,699,0,0,0,0,0,1116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,829,242,0,\n0,593,0,0,0,0,0,0,0,0,201,36,224,0,0,0,0,0,0,1430,0,1806,0,523,0,0,212,1889,0,0,\n0,827,0,0,0,0,0,2043,136,242,0,0,0,0,0,0,284,148,10,0,0,0,0,0,0,1249,0,0,0,807,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,94,0,0,0,494,0,0,0,0,0,0,0,0,1510,0,0,0,0,0,\n0,0,0,0,0,505,1306,0,0,764,268,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1703,0,0,0,0,159,964,583,0,0,0,\n0,0,0,515,0,0,854,0,0,0,0,0,0,0,0,0,0,0,0,1123,0,0,0,0,0,0,0,136,0,0,0,0,0,1782,\n0,0,44,1287,0,0,0,0,0,732,0,0,0,0,313,679,0,0,316,0,0,0,0,595,0,0,0,0,0,0,753,\n147,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,137,0,0,0,0,414,0,1762,0,0,0,0,0,0,0,0,\n0,0,0,599,0,0,0,0,0,0,0,0,0,1749,0,0,0,1627,0,488,0,0,0,0,0,83,0,0,0,0,676,0,0,\n1639,0,0,0,0,0,0,0,0,0,278,0,0,0,0,0,0,97,0,14,1085,0,0,0,0,0,0,781,388,0,849,\n59,229,0,0,0,0,0,1115,0,0,0,0,108,0,0,0,0,700,0,0,0,0,0,0,0,0,0,1414,0,0,0,0,0,\n0,0,0,0,0,0,0,0,660,737,1035,0,0,0,0,0,0,521,690,0,0,0,0,0,0,0,0,0,0,0,0,272,0,\n0,0,0,0,0,0,0,0,0,1744,0,0,0,0,0,0,128,733,0,0,277,0,0,0,0,0,0,0,0,0,4,0,0,0,0,\n0,0,0,0,0,0,0,0,0,936,1981,40,0,0,0,0,0,0,0,0,775,0,0,0,0,0,0,0,0,0,306,0,0,0,0,\n0,0,0,979,0,0,0,0,0,611,0,0,0,0,0,178,0,0,0,1969,0,0,0,0,0,0,0,664,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,390,0,0,0,1510,0,0,0,0,0,0,0,0,0,0,0,493,0,0,37,0,0,0,0,724,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,96,1537,0,0,168,473,0,0,0,105,0,0,0,0,\n627,438,0,0,0,0,0,0,0,0,0,0,11,1256,0,0,0,1626,0,779,0,0,0,0,25,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,308,0,0,0,0,0,741,0,671,0,0,0,0,649,150,0,0,99,521,0,0,3,339,0,0,0,\n543,0,0,0,0,0,0,0,0,0,1358,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,234,155,\n0,0,0,0,0,0,0,1628,0,766,0,0,0,0,0,0,0,0,0,0,0,0,0,829,0,0,0,1445,0,0,0,486,0,0,\n0,0,2,1635,0,0,0,0,558,0,0,0,0,0,0,0,0,0,0,1461,0,0,0,0,0,599,0,0,0,0,0,0,0,0,0,\n1376,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,93,0,0,0,0,0,0,447,0,0,66,1432,0,0,0,0,\n0,0,307,0,413,609,0,0,0,930,0,0,0,0,21,939,0,0,0,0,0,962,4,651,0,0,0,0,15,579,0,\n0,0,0,0,597,0,0,0,0,0,981,0,0,0,545,0,0,0,0,0,0,0,1558,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,800,17,0,0,17,0,907,0,0,0,110,0,0,0,53,458,0,1983,0,0,0,0,0,0,0,0,0,0,443,0,\n0,0,0,0,0,0,0,0,0,0,924,1844,0,1232,0,0,0,0,70,519,0,993,0,0,0,0,0,0,14,530,0,\n907,0,0,0,0,0,733,0,0,0,0,0,0,0,0,55,0,188,531,56,0,0,1693,0,0,0,0,0,0,0,0,441,\n0,192,928,0,0,0,0,0,241,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1525,0,259,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,512,185,0,464,1603,0,0,0,0,0,0,0,0,0,0,0,1113,\n284,720,0,0,722,0,0,0,0,0,13,0,0,0,0,0,0,0,4,289,43,0,0,0,0,0,0,1694,0,0,0,0,\n193,0,0,0,0,409,0,0,0,0,0,0,0,0,0,0,0,0,308,0,0,1863,0,0,0,0,0,0,0,0,0,790,0,0,\n745,1002,0,0,0,0,0,0,0,0,0,289,68,477,13,0,0,0,0,0,0,0,0,0,0,609,0,0,0,0,0,0,0,\n0,0,0,0,367,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,528,0,0,0,0,0,0,0,0,0,694,58,\n548,0,0,0,0,0,0,687,0,0,0,0,1749,0,0,0,0,0,0,0,0,1004,661,0,0,0,0,0,0,445,0,0,0,\n74,0,0,0,0,213,0,0,0,0,0,0,0,0,0,0,0,0,0,834,0,0,189,1672,0,0,0,0,0,0,0,1548,\n192,0,0,0,0,0,0,0,0,0,0,0,0,0,32,751,0,78,0,0,0,0,0,0,544,1602,105,473,0,0,0,0,\n0,0,156,1949,0,1779,0,0,0,0,0,0,0,0,0,0,0,763,0,0,0,0,0,0,0,0,29,0,0,0,0,0,0,0,\n0,0,0,883,0,0,0,0,0,0,0,488,0,617,0,0,50,0,694,1518,785,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,546,0,0,0,0,0,0,0,0,0,0,22,0,0,0,0,1016,0,0,0,577,0,0,0,0,0,0,\n184,935,114,720,0,0,100,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,95,14,0,969,0,0,0,0,0,0,0,\n727,0,1021,0,0,0,0,0,1190,0,0,0,0,0,0,0,0,0,0,0,0,0,153,0,0,0,0,0,0,0,0,0,798,0,\n587,0,0,695,42,0,1929,141,957,0,465,7,908,0,0,450,148,0,0,0,1166,0,0,0,0,0,0,0,\n0,0,0,0,0,253,0,1003,0,0,0,0,0,0,0,0,0,0,0,46,0,0,879,0,806,0,1868,0,0,0,0,0,\n1846,0,0,0,730,0,0,0,0,0,0,0,965,0,0,0,0,506,0,0,0,10,0,0,0,22,0,0,0,0,0,0,0,0,\n0,0,0,0,0,960,296,0,0,0,0,0,0,0,0,0,0,0,587,0,0,0,0,20,0,0,0,32,982,0,0,0,0,0,0,\n0,0,0,0,941,0,0,0,0,435,0,0,0,0,0,0,71,419,0,0,0,0,0,0,688,740,94,345,0,0,679,\n582,0,0,0,0,0,0,0,945,0,0,0,0,0,0,0,0,0,0,0,0,539,0,684,1993,0,0,0,659,0,583,0,\n803,0,704,0,0,0,0,0,198,181,347,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,481,405,203,0,0,99,826,0,0,0,0,0,0,0,492,0,408,0,0,0,0,0,0,0,0,0,0,4,0,0,\n0,0,665,349,137,0,0,0,0,612,1270,0,0,0,0,0,371,0,0,0,826,0,0,0,0,21,1535,858,\n374,0,0,0,0,0,0,311,0,0,0,991,1968,0,0,0,0,494,1647,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,769,0,0,0,0,0,642,0,0,157,123,0,0,0,1435,0,0,0,0,0,0,0,0,0,0,79,0,0,0,\n0,0,0,1425,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,106,393,486,1690,0,0,0,0,\n0,0,0,0,0,0,0,0,756,184,0,0,0,1382,0,0,0,175,0,1493,0,1007,0,0,0,0,0,0,0,0,0,0,\n0,219,0,0,0,0,515,99,0,851,0,0,0,0,0,1278,0,0,0,0,0,0,0,1000,982,0,762,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,910,1819,0,0,0,0,0,0,906,0,0,0,0,0,0,0,0,0,0,1730,0,0,\n0,0,0,0,0,0,0,0,0,1185,0,0,0,0,0,0,0,0,40,0,0,0,147,0,0,0,0,0,0,0,0,0,0,0,0,0,\n650,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,56,30,0,553,0,0,20,597,0,1614,0,0,0,0,0,327,\n49,0,0,0,0,0,0,0,78,0,0,786,134,0,0,0,12,496,0,0,0,0,0,0,0,0,0,0,42,204,0,614,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,147,247,0,0,0,0,942,0,0,2023,0,0,0,0,\n0,0,67,285,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1309,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,41,532,0,0,0,0,0,0,0,\n1692,0,0,0,0,55,1704,0,0,0,0,988,0,0,0,223,0,0,0,0,0,0,0,57,1123,0,0,0,0,0,1764,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2015,0,0,0,1599,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,129,0,0,0,0,0,0,0,0,0,0,0,534,0,0,0,0,0,0,0,0,0,0,0,\n0,0,504,621,1248,321,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1397,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,441,75,0,0,0,0,0,0,0,0,0,0,841,0,0,0,0,0,693,0,650,314,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,913,0,0,0,0,0,0,0,0,0,0,0,0,0,0,880,0,475,0,\n0,1016,179,602,111,329,0,0,0,1864,0,0,0,0,846,1888,0,0,780,0,0,0,82,0,0,0,0,821,\n0,0,0,0,0,0,0,0,0,0,0,956,112,0,0,0,261,455,0,0,0,0,0,0,337,385,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,184,1865,0,0,721,16,0,486,0,0,0,265,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,621,0,0,0,0,0,0,0,0,234,0,0,815,0,0,743,\n1987,205,197,0,0,0,0,0,0,0,0,0,314,0,0,0,0,0,0,0,0,0,0,0,0,0,0,219,452,589,0,\n176,333,0,0,0,0,0,0,0,1110,47,0,0,0,0,0,0,0,0,0,0,0,864,0,0,300,0,1237,0,0,0,0,\n0,0,0,0,0,0,0,1685,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,135,395,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,631,0,0,0,0,0,0,835,0,0,0,606,459,0,979,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,612,0,0,0,0,0,0,0,0,158,372,0,854,0,0,0,0,0,\n0,0,1492,0,0,0,833,0,0,0,0,0,0,0,1739,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n195,0,0,0,0,0,0,0,0,730,1997,0,0,0,0,0,0,0,0,61,0,0,0,0,0,0,0,266,751,0,0,0,0,0,\n0,0,821,0,0,0,715,0,0,0,868,0,959,0,0,0,0,0,0,0,0,0,0,0,1053,0,0,0,950,0,1081,0,\n1595,0,0,0,0,59,0,0,0,0,0,0,0,0,0,0,47,684,0,0,0,0,0,0,1606,0,777,0,1020,0,0,0,\n1094,0,0,0,0,0,0,0,350,0,0,0,0,0,0,242,1812,0,0,0,967,0,0,0,473,286,0,0,0,0,0,0,\n798,629,222,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,513,337,306,0,0,0,0,0,0,0,0,0,\n146,0,0,1646,0,0,0,0,0,465,0,0,0,525,0,0,0,0,0,0,299,165,0,0,0,0,0,0,0,1064,0,0,\n0,0,0,596,0,0,0,0,0,0,0,0,0,0,0,0,0,0,238,1741,0,1233,451,1824,0,0,0,0,733,495,\n0,0,0,0,0,1204,0,0,0,559,341,0,224,21,0,0,0,0,0,0,0,0,97,1446,0,0,0,0,0,0,0,729,\n0,0,565,727,0,1948,0,0,0,519,0,0,0,0,0,0,0,0,0,1193,0,0,0,0,0,0,790,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,323,2,201,0,0,59,0,0,34,0,896,961,0,1285,0,0,46,0,479,0,0,\n0,0,549,0,663,0,0,0,0,0,783,65,682,0,0,0,0,0,11,0,0,0,0,0,522,0,0,0,52,0,0,0,0,\n0,383,0,0,0,0,0,0,0,0,127,0,0,0,0,0,397,194,0,0,635,0,0,0,0,0,0,0,0,0,0,975,0,0,\n0,0,0,0,0,0,0,0,116,0,51,0,0,858,0,1075,535,448,0,0,0,0,0,610,0,0,0,0,0,0,0,0,0,\n0,191,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,267,673,319,94,92,0,551,0,0,218,\n1406,69,256,0,0,952,1980,0,833,0,0,0,0,0,0,0,0,0,0,0,0,39,0,0,0,0,0,0,0,81,0,0,\n0,352,634,0,0,0,0,0,618,0,0,0,0,0,0,73,339,0,0,0,0,0,0,0,0,0,0,0,0,0,0,169,759,\n0,0,0,0,0,0,0,0,0,0,0,0,0,1075,0,0,0,0,0,0,482,649,0,0,0,0,0,0,0,0,386,336,0,0,\n0,1035,0,0,0,0,0,0,0,0,0,0,0,924,0,73,0,0,0,0,0,1971,0,0,0,0,0,0,0,0,0,1344,0,\n501,0,0,0,0,0,0,0,0,46,799,0,0,0,0,0,0,0,276,0,0,0,0,0,0,0,770,0,0,0,0,0,0,0,0,\n0,0,0,0,0,158,0,0,0,0,0,1432,0,0,0,0,0,0,0,0,0,0,25,0,0,2001,0,0,0,0,0,0,0,0,0,\n0,0,0,0,478,0,0,0,0,0,0,91,1461,211,602,0,0,0,0,0,0,0,0,0,1068,0,0,124,567,0,0,\n0,1006,0,0,0,0,0,0,0,0,0,735,812,0,0,323,0,0,0,304,0,0,0,0,0,0,0,0,0,148,0,0,0,\n0,0,0,0,0,0,523,0,0,144,730,0,0,981,0,0,111,0,0,132,0,0,0,0,0,0,890,0,0,0,0,0,\n444,0,1787,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,2041,932,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,937,0,995,0,0,255,0,0,138,863,965,0,0,631,0,0,0,0,1394,16,652,0,0,0,0,0,0,\n0,0,0,0,0,0,0,897,0,321,0,0,0,0,0,922,0,619,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,844,0,0,0,0,0,0,1659,0,1100,0,0,0,1173,0,1930,268,251,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,390,711,0,0,0,0,0,0,0,0,0,0,0,0,0,744,0,0,0,0,0,0,0,0,0,624,0,0,0,\n1998,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1125,0,0,0,594,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,268,0,0,0,0,0,0,0,563,0,0,0,0,0,0,0,0,2,39,0,0,0,1332,0,0,0,0,0,\n0,0,508,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,66,796,0,0,0,0,527,0,0,0,0,98,0,0,576,0,\n0,0,0,0,122,0,276,37,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,645,0,0,0,0,\n0,0,0,0,0,0,0,290,0,0,762,1292,0,0,0,1315,0,1955,0,0,0,0,0,0,0,0,0,0,210,131,0,\n0,0,0,797,0,38,0,11,488,0,936,0,441,0,0,0,0,0,595,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n991,0,0,0,0,0,0,0,0,0,0,0,653,0,523,0,0,0,903,0,0,0,0,0,0,0,0,0,0,0,0,80,0,0,0,\n0,0,0,0,0,0,432,0,0,314,0,0,0,0,232,1368,534,0,0,0,0,0,27,0,0,0,12,0,0,0,0,0,0,\n0,0,0,264,736,0,1657,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1117,0,127,0,0,0,1208,0,1294,\n0,0,0,0,364,0,0,0,0,0,125,1334,0,0,0,0,0,0,0,0,0,0,0,0,0,0,792,0,0,0,0,0,0,0,\n849,699,0,0,0,0,0,968,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1446,\n124,397,0,0,0,0,0,0,0,0,0,0,0,641,0,0,0,0,0,0,0,0,0,0,0,0,127,346,0,0,517,75,0,\n0,0,0,0,0,0,0,83,0,0,0,0,0,0,1031,0,0,0,0,0,0,0,1470,0,954,0,0,345,304,410,0,0,\n0,0,734,0,0,0,0,0,1822,0,0,0,1798,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,161,\n1865,69,0,0,0,0,0,0,922,0,0,0,0,0,0,0,0,0,0,0,541,0,627,0,0,0,0,0,0,0,0,0,166,0,\n0,0,0,0,0,0,0,0,849,0,0,0,0,0,0,0,717,0,0,0,0,0,0,0,0,0,0,0,0,0,0,600,0,0,0,0,0,\n0,654,0,0,188,273,0,0,0,543,0,410,87,0,0,941,0,0,186,250,0,1785,0,0,0,0,0,1339,\n462,961,0,780,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,529,0,0,0,0,0,0,474,1276,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,24,948,0,0,0,0,657,753,0,0,0,0,941,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,706,985,837,0,1861,0,0,0,0,0,0,0,0,0,0,0,0,0,0,292,933,0,0,0,0,0,\n0,0,0,0,767,0,0,0,0,0,0,0,641,0,0,0,1233,114,0,883,0,274,2008,0,1794,285,0,0,\n571,0,0,0,0,0,0,0,0,0,0,823,960,16,617,0,431,0,0,0,0,0,0,0,0,0,0,567,0,401,0,2,\n781,424,33,0,2006,0,0,274,0,0,1882,0,794,0,0,0,1848,0,0,0,0,0,0,448,47,0,0,0,\n1199,0,0,0,0,0,0,0,0,417,0,0,0,0,0,0,0,0,0,0,295,0,0,0,0,0,0,0,1019,0,0,0,0,0,0,\n0,0,0,0,0,0,0,620,0,0,0,0,464,0,0,0,0,208,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,442,0,930,0,0,0,0,0,516,68,0,0,0,0,0,1128,104,0,0,0,0,0,0,0,0,787,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,491,0,0,0,0,0,0,711,0,0,9,0,101,441,0,0,0,0,0,0,0,0,\n0,0,160,396,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,679,326,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,1128,0,0,0,0,0,737,0,1796,0,0,0,0,0,0,0,0,0,0,0,0,338,574,0,0,\n0,0,0,1096,491,405,0,0,0,0,0,1081,0,0,0,0,0,0,0,0,0,0,0,0,0,1676,0,1207,0,0,0,0,\n0,0,969,354,0,0,0,0,598,0,297,0,0,0,0,0,0,0,0,1772,751,0,37,0,0,1828,0,0,0,0,0,\n0,0,0,0,257,191,582,0,0,0,0,0,0,790,0,0,0,0,0,47,0,0,0,0,0,0,0,449,306,1011,0,0,\n0,0,0,299,0,0,0,0,0,0,837,0,0,0,0,0,0,10,329,0,0,0,0,0,1320,0,0,0,0,0,0,158,657,\n0,1191,0,0,0,0,0,0,7,0,974,1939,0,1665,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,288,\n66,0,0,0,0,494,175,0,1643,0,0,0,0,0,0,0,0,570,750,719,0,0,0,0,0,0,0,0,0,0,0,0,0,\n13,0,0,1247,0,0,221,356,0,0,0,0,0,0,0,0,0,0,694,1809,0,0,0,0,0,0,0,411,0,44,31,\n0,0,0,0,669,0,673,0,0,0,0,0,0,0,0,0,1303,704,299,0,0,0,275,0,0,216,1761,0,0,0,0,\n0,0,0,0,0,0,0,1319,0,0,428,0,0,0,0,0,0,0,0,0,0,514,0,0,0,0,0,0,49,55,102,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,364,0,0,0,0,379,0,921,971,52,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,1258,0,0,0,1058,0,0,0,0,0,656,0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,\n0,1373,10,605,0,0,0,0,0,0,0,838,0,1012,0,0,0,0,0,0,0,0,0,0,0,0,0,0,154,365,0,0,\n0,0,0,0,0,0,0,340,0,0,0,0,0,810,0,0,0,0,0,0,495,0,0,0,0,0,0,0,0,0,261,0,535,248,\n0,358,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,567,445,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,697,0,0,0,1336,0,0,0,0,0,0,0,0,917,174,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,972,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,351,0,0,0,0,0,0,0,0,0,0,\n0,0,0,286,0,0,56,438,0,0,0,0,0,1950,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,738,0,0,0,0,0,\n0,0,0,0,0,969,2047,0,0,0,0,0,0,0,818,0,0,0,0,0,0,0,866,0,0,0,0,0,0,0,1467,0,0,0,\n0,0,0,0,0,0,0,0,0,0,972,0,355,0,0,0,116,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,267,189,104,0,0,0,0,1613,0,0,0,0,0,0,0,116,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,886,0,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,45,0,0,863,0,0,0,0,0,\n0,0,1953,450,1773,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,381,0,0,0,0,0,0,0,\n0,0,0,0,0,1142,0,1189,0,0,0,663,0,0,0,0,0,0,0,846,0,0,528,0,393,378,0,0,0,0,0,0,\n325,899,680,1880,0,1770,0,0,0,0,0,648,0,0,0,0,0,0,185,167,0,2046,0,0,0,0,0,0,\n249,1645,0,152,0,0,0,1733,0,0,0,0,0,1006,0,0,0,0,0,420,0,0,0,832,0,0,0,0,0,351,\n0,0,0,0,6,40,0,0,60,0,0,0,0,1354,745,724,0,0,0,0,0,0,0,0,772,1951,275,108,639,0,\n0,0,0,0,0,0,0,0,500,1758,0,0,0,0,0,0,0,0,0,0,0,1886,711,205,0,0,965,865,0,0,0,\n534,0,0,0,0,691,0,0,0,237,443,0,878,0,0,0,0,0,1410,0,0,0,0,0,0,0,0,0,0,0,0,0,\n995,0,0,0,0,0,0,0,0,0,0,0,0,0,578,0,0,0,0,881,0,0,0,0,0,0,0,0,822,0,923,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,924,0,0,0,665,0,0,0,0,0,1901,0,0,0,0,0,950,498,93,\n0,0,0,1451,0,0,0,0,0,747,828,788,400,184,0,198,0,0,0,0,0,0,0,0,0,0,0,994,0,0,0,\n0,0,0,0,0,615,320,0,0,0,978,843,905,0,0,0,0,0,0,0,0,850,974,0,0,0,0,6,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,509,0,0,0,0,0,273,0,0,0,0,0,0,0,0,0,0,0,0,0,\n201,0,0,0,1041,0,0,0,1040,0,0,0,0,0,0,0,0,0,693,234,774,0,336,0,1399,22,0,805,\n802,777,167,789,0,0,1705,0,0,0,0,0,0,0,0,0,0,0,10,13,11,0,0,204,264,0,0,56,0,0,\n1917,0,470,0,0,0,0,0,0,0,0,0,0,0,1198,0,0,0,0,0,0,0,0,0,0,1015,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,715,0,0,1002,0,0,0,298,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,867,0,0,724,0,0,0,0,0,0,0,0,0,0,0,0,768,0,0,0,0,0,1066,0,0,0,0,67,0,174,948,\n0,0,0,0,0,0,0,0,0,0,0,0,0,764,0,0,0,0,75,137,0,756,0,0,0,0,0,0,1008,842,643,0,0,\n0,67,0,0,0,0,0,0,0,0,0,0,0,135,821,0,0,0,0,0,0,0,0,736,0,389,355,0,0,786,0,0,0,\n0,0,0,2044,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1030,0,0,0,1083,0,0,0,0,0,\n1226,0,0,0,0,356,319,8,389,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,474,0,0,0,427,\n0,413,0,730,0,0,0,0,0,373,0,0,0,0,0,0,0,0,0,799,0,0,0,1793,0,0,0,322,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,89,290,2,0,0,0,0,0,0,0,0,0,0,672,\n699,1860,0,0,0,737,0,0,0,1612,0,0,0,0,0,0,0,0,0,0,0,145,124,884,0,0,0,0,0,387,0,\n0,0,0,0,0,0,0,0,0,0,679,0,550,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1305,0,0,0,0,0,0,0,\n576,0,0,0,0,0,0,0,686,0,607,0,0,37,0,0,0,0,0,0,0,0,0,101,1726,0,0,0,0,0,958,0,0,\n0,903,0,0,0,0,147,0,0,0,0,0,0,0,0,0,0,0,367,0,0,0,0,690,0,705,273,0,0,887,0,0,0,\n0,0,0,0,0,0,0,0,90,0,0,0,0,0,0,0,908,0,0,0,0,0,0,0,1261,0,0,497,1235,0,429,0,0,\n0,0,904,0,12,125,0,0,0,841,0,0,0,0,0,860,946,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,768,0,770,160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,271,0,0,0,0,0,0,0,719,0,699,581,0,0,0,0,0,0,0,0,0,0,862,304,0,631,0,0,0,0,880,\n1513,0,0,0,0,0,981,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,434,0,0,0,0,0,550,0,0,476,930,\n824,553,0,0,452,0,151,0,0,0,0,0,0,772,0,292,135,0,0,0,0,0,0,0,504,0,0,1089,0,0,\n0,0,0,0,0,0,0,0,0,783,0,0,0,0,0,0,206,393,0,0,0,0,0,0,0,0,232,912,0,0,0,0,0,977,\n0,0,716,98,0,0,0,0,0,733,0,0,0,0,0,0,0,0,19,0,0,0,0,668,0,360,0,0,0,0,0,0,656,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,726,0,0,0,0,0,0,0,0,0,0,0,0,72,0,0,1269,0,0,463,0,\n0,0,0,0,0,1454,0,1287,245,0,989,0,0,0,0,0,0,0,0,0,107,164,0,0,0,0,0,0,0,1061,0,\n0,0,0,2,484,0,0,0,0,0,0,0,1127,0,0,0,0,0,0,0,460,0,0,0,0,0,932,0,0,0,0,0,0,0,\n588,625,0,0,0,0,76,92,0,0,0,0,0,0,0,0,0,0,0,0,0,104,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n763,0,622,0,0,0,253,0,546,0,0,110,0,256,916,0,0,35,212,0,0,746,0,0,0,150,0,0,\n1466,0,0,0,1299,0,0,0,0,0,0,0,0,0,1518,0,0,0,0,0,0,0,0,0,0,0,0,0,1229,0,0,0,816,\n0,0,0,0,0,0,159,0,0,0,0,0,734,869,126,1716,0,0,0,0,0,0,202,232,0,0,0,0,212,0,0,\n0,0,0,111,1003,0,0,0,0,0,0,0,0,0,0,0,1712,0,0,216,0,0,0,0,516,0,0,0,0,0,650,0,0,\n0,0,57,99,0,0,0,0,300,574,0,0,0,0,1023,0,0,302,0,1871,0,728,252,0,0,461,0,0,0,\n323,0,0,0,0,0,0,775,461,0,0,0,0,0,0,172,0,0,464,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,73,727,0,1023,0,0,0,0,0,0,0,0,0,0,577,0,0,0,0,0,0,0,0,1037,0,0,0,0,0,0,\n0,0,280,677,0,0,0,0,0,0,0,0,0,0,0,799,0,0,0,0,159,0,446,1730,0,0,0,0,0,0,0,0,0,\n395,0,0,0,0,145,0,0,0,0,0,0,0,20,0,0,426,608,0,0,0,0,0,977,0,250,0,0,0,0,0,100,\n0,0,0,0,1982,0,0,0,0,0,476,0,0,0,0,0,0,594,76,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,447,0,0,0,0,526,0,0,14,1124,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,188,0,0,0,0,0,0,0,0,362,301,0,0,0,1743,0,178,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,872,0,831,0,0,208,202,0,0,0,0,0,0,0,1954,0,\n0,0,0,516,872,0,0,313,224,0,0,24,0,11,546,0,0,0,1937,242,241,46,0,0,0,830,1273,\n0,0,0,0,0,0,0,825,327,1006,0,0,0,0,0,1580,516,366,0,0,0,0,0,1736,0,0,0,0,0,0,0,\n0,0,0,0,1935,0,826,0,0,0,0,139,331,0,0,0,0,0,0,0,0,0,0,0,288,0,916,0,0,0,0,0,\n1888,0,0,0,0,0,0,0,1471,0,1570,0,394,0,0,0,0,0,0,0,1931,0,1719,0,658,228,0,0,0,\n0,0,374,0,0,0,0,735,0,0,0,0,0,0,323,498,0,1063,0,0,0,0,155,0,0,0,0,0,0,0,0,906,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1139,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,108,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,616,\n902,0,0,0,0,0,692,0,0,0,0,0,0,823,0,0,0,305,0,0,0,0,0,0,0,681,0,0,0,0,0,214,\n1004,0,0,0,0,0,0,0,23,0,0,1703,0,0,0,0,0,0,0,0,0,1443,0,0,19,714,0,0,0,0,64,737,\n0,0,345,1758,0,0,579,47,0,0,539,139,0,0,0,0,388,0,0,0,0,253,0,0,0,0,0,0,252,0,\n745,0,0,0,0,0,0,0,0,0,0,0,504,107,0,871,0,0,0,229,0,0,0,0,0,903,0,0,71,0,0,549,\n6,47,0,0,0,0,0,0,0,0,0,980,865,705,0,0,0,161,0,0,0,0,143,1331,0,0,0,1388,33,724,\n0,0,0,19,0,0,0,395,0,0,0,0,0,846,210,0,0,0,122,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,695,937,497,0,0,0,0,0,718,0,0,0,0,0,0,0,1581,0,\n0,0,0,0,0,161,49,0,0,0,0,0,0,0,0,0,597,0,0,0,1094,0,0,0,811,908,0,0,0,0,0,0,0,0,\n0,0,1471,0,0,0,0,0,0,0,0,0,0,42,1935,0,0,0,2014,66,2007,0,0,586,0,0,0,0,0,0,0,0,\n0,28,1077,0,0,0,1221,0,0,62,0,0,0,0,0,0,0,0,0,0,1766,0,0,0,0,0,0,0,0,0,0,0,0,25,\n0,499,1388,0,0,97,10,0,0,0,0,0,481,0,0,0,0,0,0,0,0,0,0,37,134,155,486,0,1442,0,\n0,0,0,0,591,0,0,0,0,0,0,310,1173,0,0,0,0,409,1156,0,0,0,482,0,0,263,926,0,0,0,0,\n0,0,0,0,0,0,0,0,0,804,0,0,0,0,0,0,0,0,0,0,0,0,0,1265,0,415,0,348,0,0,0,1012,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,165,1803,0,0,0,0,0,0,0,408,\n0,0,0,0,0,0,257,1321,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1138,0,0,0,249,0,\n0,0,576,0,0,0,0,231,0,0,0,288,0,0,0,0,0,0,0,0,0,433,1487,569,1678,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,87,0,0,0,0,0,779,538,0,0,0,413,0,0,0,\n0,0,0,0,0,0,0,495,0,0,0,0,0,191,54,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,530,567,\n0,0,0,0,0,1484,0,0,0,0,0,0,815,609,0,0,0,0,0,484,0,0,0,0,0,0,0,0,0,0,900,0,0,0,\n0,1335,0,1724,0,0,0,0,0,0,0,0,0,0,0,640,0,0,0,0,0,0,0,0,0,0,0,1831,0,0,0,0,0,0,\n0,0,0,0,0,0,0,474,0,0,0,0,0,0,0,0,0,1103,0,1504,655,1034,0,0,0,0,0,305,0,0,0,0,\n0,0,0,0,0,1236,0,0,429,217,0,0,0,0,739,278,0,0,0,0,0,0,0,708,0,0,0,0,0,1840,233,\n0,0,0,0,0,0,0,0,2017,0,0,0,0,0,1488,0,0,0,1590,0,0,0,0,0,1800,28,0,0,0,0,0,0,0,\n0,0,45,0,36,0,22,1442,378,0,0,0,0,0,0,1507,0,0,0,0,0,0,0,0,0,0,39,0,0,1054,725,\n1955,0,2036,0,0,0,0,0,0,0,0,0,0,896,1871,0,0,0,0,0,0,0,0,0,0,805,0,0,0,0,2046,0,\n0,0,0,17,712,0,617,55,320,271,0,0,0,0,0,0,0,0,0,445,0,184,103,0,0,0,0,0,0,0,0,\n659,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,676,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n337,0,0,0,506,0,0,0,0,0,843,77,0,458,0,0,0,0,0,1420,382,109,142,330,0,0,0,0,0,0,\n0,0,0,0,0,0,87,0,0,0,492,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1239,0,0,0,0,0,0,\n211,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1049,0,321,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,1985,0,0,122,0,0,234,0,0,0,1098,0,0,0,0,0,0,549,253,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,522,131,0,0,149,0,0,0,0,0,0,0,0,0,0,0,0,0,0,507,0,0,0,0,811,630,0,0,0,343,\n0,0,0,0,0,448,591,455,0,1381,0,0,0,0,0,0,0,575,0,0,0,0,0,1175,0,0,0,0,0,0,0,0,0,\n653,0,0,0,1761,0,1198,0,0,0,0,297,1127,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,678,0,0,\n164,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,35,0,45,0,0,0,0,0,121,0,0,0,0,0,0,\n0,0,125,0,0,0,1622,0,0,0,0,0,721,145,0,0,0,970,792,0,0,0,715,0,0,0,0,0,1999,0,0,\n74,531,0,0,65,0,0,0,105,220,0,0,0,0,0,0,0,960,0,0,0,0,0,0,428,19,0,0,401,96,0,0,\n0,0,0,1595,116,0,1021,0,0,0,0,0,750,1961,0,0,148,0,0,0,0,0,0,0,0,0,0,0,0,0,75,0,\n0,1383,0,0,0,0,0,0,0,0,0,0,0,0,0,0,779,0,0,0,0,0,0,0,0,598,0,424,0,0,0,0,0,0,0,\n1222,0,0,0,876,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,133,0,0,0,0,187,0,8,0,0,0,0,0,\n0,0,429,0,685,0,0,0,0,0,0,0,0,0,0,0,132,472,0,0,0,0,0,0,0,0,0,938,0,0,874,0,0,0,\n0,0,774,0,0,0,0,0,92,0,0,0,0,0,0,830,701,0,0,0,0,0,426,350,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,603,59,0,0,0,0,0,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,0,0,441,163,4,0,\n0,0,0,0,0,0,0,0,806,0,0,0,0,0,0,233,0,0,0,0,1994,0,1739,0,0,393,0,47,1038,0,0,0,\n309,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,363,0,0,0,175,0,0,0,0,0,0,0,666,\n0,0,1675,0,1600,0,0,0,808,0,0,0,0,0,0,0,0,0,0,0,280,54,0,0,0,0,0,0,0,0,421,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,249,0,0,103,254,0,262,1,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,805,0,0,0,0,0,0,0,0,0,1630,0,0,0,0,0,0,0,0,0,0,0,0,0,671,972,989,0,0,\n0,0,0,0,0,889,0,0,0,1382,0,0,0,0,0,0,0,775,0,0,0,0,0,0,0,0,0,0,388,202,0,0,0,0,\n16,560,0,0,0,841,0,0,566,0,0,0,938,0,0,0,0,0,0,0,0,0,0,912,0,0,0,1361,0,0,0,0,0,\n0,618,236,0,1854,0,0,318,190,0,1376,0,0,0,0,0,0,0,349,0,0,0,0,951,1972,0,0,0,0,\n0,0,344,0,0,0,0,0,0,0,0,850,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,910,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,163,85,0,487,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,145,0,83,0,0,1013,0,0,0,1922,0,0,169,557,66,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,1193,82,0,352,454,57,0,0,1333,396,107,0,370,0,0,0,0,0,0,0,0,0,204,0,0,0,\n0,0,1706,0,0,0,0,0,0,0,0,0,0,0,0,394,1204,0,0,0,0,0,1007,0,0,0,1696,0,1519,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,981,0,0,0,0,1072,0,0,0,712,0,1629,0,0,0,0,0,0,0,728,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1271,0,0,0,1608,16,0,0,0,0,485,0,0,0,0,0,0,\n153,27,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1991,0,0,0,0,0,0,0,0,52,0,21,0,\n0,0,0,0,0,0,0,0,819,0,0,0,0,0,917,0,0,0,0,784,0,0,0,0,135,0,0,0,0,0,454,0,0,0,0,\n0,0,0,0,0,852,1719,0,0,0,0,0,852,0,0,0,0,0,952,0,0,0,0,568,0,0,0,0,0,448,0,0,0,\n67,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1826,657,0,729,666,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n669,0,0,0,0,0,0,0,402,0,0,152,0,0,0,0,912,0,0,0,0,0,0,51,320,0,445,0,0,0,0,308,\n0,0,0,0,0,386,0,0,239,0,0,130,83,0,143,0,348,0,0,0,0,0,0,0,958,0,0,0,0,0,210,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,430,0,0,0,0,0,0,0,0,0,0,0,0,7,213,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,801,0,0,0,0,0,0,0,0,0,936,0,108,0,0,\n0,0,0,0,0,0,0,885,587,219,398,364,0,1165,0,0,342,241,303,0,0,0,0,0,0,0,0,0,0,\n1454,0,0,0,0,0,0,0,0,0,0,254,562,0,786,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1294,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,493,216,0,0,0,0,219,341,0,0,0,0,0,\n0,0,0,0,0,130,1734,154,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,701,604,0,0,879,0,195,\n666,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1669,0,0,0,1791,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,1228,0,0,0,0,0,623,0,0,0,0,0,0,0,798,0,0,0,0,0,0,0,0,0,0,0,0,84,\n122,0,0,0,837,0,0,0,0,0,0,1013,0,0,577,0,0,0,460,932,0,0,0,0,0,0,0,0,0,0,0,31,\n131,0,0,0,605,0,0,0,1246,0,0,0,0,68,278,165,307,781,0,0,0,0,0,0,33,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,1113,0,0,720,1953,203,0,0,0,0,0,0,0,425,326,0,0,0,0,0,\n0,0,0,0,0,241,1316,0,0,0,0,0,416,0,0,0,1300,0,847,0,0,662,358,0,0,0,0,839,1823,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,654,1522,0,0,0,0,0,0,163,0,0,0,0,0,314,978,0,0,0,\n601,0,0,0,0,0,946,434,0,0,0,402,411,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,1467,\n410,0,0,0,0,0,0,0,0,0,0,0,0,0,0,483,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,677,0,0,0,0,0,0,0,0,0,0,0,0,70,0,0,0,0,1405,0,0,0,0,0,0,108,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,777,0,0,0,0,0,747,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,68,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,505,0,326,0,0,164,628,654,0,0,0,\n37,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,668,152,0,0,0,0,0,0,0,0,0,0,0,581,\n0,0,0,0,44,126,89,0,0,0,0,0,0,0,0,1531,0,0,0,0,0,0,0,0,203,1167,0,0,0,0,0,0,0,0,\n531,1232,0,0,0,0,0,943,0,670,231,880,0,1617,0,0,0,1957,0,0,0,0,0,0,0,975,0,0,0,\n0,0,0,0,0,0,0,0,242,0,0,0,0,0,0,0,0,0,421,0,0,14,834,0,0,0,0,0,0,0,0,0,0,0,0,\n465,0,0,0,0,0,834,688,413,855,0,0,0,590,0,0,0,0,0,0,0,0,114,0,0,0,0,0,0,0,0,0,0,\n0,45,169,0,0,0,0,0,0,0,0,0,0,0,198,0,0,565,585,0,0,0,0,0,0,0,0,0,0,0,0,0,691,0,\n0,0,593,0,0,0,0,0,0,0,0,0,913,116,0,0,0,0,1360,0,0,0,802,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,673,308,0,709,1006,1895,0,228,0,0,0,1840,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,608,0,0,0,0,0,0,0,0,0,1573,0,2039,136,540,0,0,0,0,0,0,0,\n897,0,0,938,1878,0,0,0,0,0,0,0,0,0,1469,0,999,0,299,0,0,0,0,0,0,0,578,0,0,0,0,0,\n456,0,0,0,1679,163,693,0,0,0,0,0,0,48,755,0,0,0,0,0,0,0,0,0,0,0,0,338,0,0,0,0,\n1091,0,0,0,0,695,0,0,1464,0,0,0,0,0,975,0,0,335,0,0,1979,0,0,0,0,269,1566,630,\n396,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1815,634,0,0,0,966,0,0,0,0,0,0,0,9,\n412,0,958,0,0,579,382,0,212,0,0,0,0,965,681,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,655,\n0,0,0,0,67,0,0,0,0,0,0,751,0,0,0,0,423,231,0,0,1016,300,0,0,0,0,100,237,0,0,0,\n1370,0,0,0,1208,0,0,0,0,0,1219,129,0,0,0,0,0,0,0,0,0,0,0,0,0,0,199,0,0,427,0,0,\n0,0,949,665,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,712,0,0,0,0,0,1186,0,0,0,0,0,0,0,0,0,0,295,312,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n151,0,0,0,0,588,4,0,0,0,0,0,414,104,0,0,757,263,0,561,0,0,0,320,0,0,0,0,0,0,0,0,\n0,0,0,225,0,0,0,0,37,817,0,974,0,0,0,0,0,0,0,0,0,0,0,0,0,2026,131,235,16,0,590,\n1157,0,0,0,0,0,0,0,0,221,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,140,390,0,0,0,0,\n0,0,0,1144,0,0,0,464,0,0,0,0,0,0,0,0,0,0,0,0,204,407,303,1218,0,0,0,0,5,325,0,0,\n0,0,12,800,0,1783,0,0,0,0,0,0,0,0,0,0,504,621,0,0,0,0,0,0,0,0,0,920,0,376,0,0,0,\n0,0,218,580,0,768,454,0,0,0,0,0,0,0,0,0,0,0,0,676,0,0,0,0,0,0,164,0,0,0,0,0,0,0,\n0,50,0,0,0,0,0,0,0,0,0,0,0,0,0,120,285,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,226,343,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,29,0,0,1812,0,0,8,0,0,0,21,1125,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,1327,0,0,0,0,575,1598,0,0,0,0,0,0,0,0,0,895,0,0,0,959,0,0,\n0,0,0,1759,173,0,0,0,0,266,261,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,1427,0,0,300,1033,0,0,0,0,0,0,0,0,0,0,0,584,0,0,0,0,52,734,\n0,0,217,239,0,1129,0,0,0,0,0,0,0,0,732,20,0,0,0,0,0,0,0,0,0,0,0,418,0,0,0,613,0,\n0,0,0,0,0,0,0,0,632,0,0,85,984,0,0,0,0,909,694,7,1109,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,167,0,0,0,0,280,62,0,0,33,0,0,359,186,980,0,0,0,0,0,0,0,0,0,0,0,585,0,0,0,\n211,0,0,336,145,0,1130,0,873,0,0,840,263,0,0,0,0,0,0,0,0,0,916,0,0,0,0,0,0,0,0,\n0,0,155,0,0,0,461,97,0,0,0,0,0,1356,0,0,0,0,0,0,0,593,0,0,0,0,0,1392,0,0,0,0,\n126,0,0,0,0,1179,0,0,0,0,0,162,0,0,0,0,0,765,0,187,0,1286,0,0,0,0,0,0,0,0,0,635,\n0,0,23,215,0,0,0,1306,0,0,97,716,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,657,0,\n0,0,0,0,0,0,0,299,0,0,0,0,0,0,134,0,0,0,0,0,0,0,0,0,0,0,658,1082,0,0,0,0,0,2002,\n0,0,0,0,0,0,833,248,0,0,0,0,0,1654,0,0,531,0,0,0,0,0,0,634,0,0,0,0,0,0,0,0,0,\n853,573,249,0,0,0,0,0,0,0,0,527,0,0,0,0,1419,0,0,0,0,0,0,20,49,0,0,0,992,0,0,0,\n728,0,0,0,0,0,0,0,0,0,0,0,0,497,1579,0,0,0,0,62,268,0,0,0,0,0,0,0,1201,0,0,0,0,\n0,0,0,0,0,0,0,0,495,193,0,0,0,0,106,0,0,859,0,0,23,0,0,0,0,0,0,0,813,925,0,0,\n223,613,953,0,0,0,0,0,0,0,0,666,0,0,0,0,0,0,0,0,0,670,0,0,40,216,0,0,0,0,0,0,\n259,0,0,0,440,1114,0,0,0,0,0,0,0,0,74,475,0,0,188,139,0,797,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,1572,0,0,0,0,39,0,0,0,0,0,0,0,0,0,0,0,0,1594,0,0,0,0,0,0,0,290,0,232,\n0,0,887,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,521,14,0,0,0,0,0,741,0,0,0,992,0,\n0,0,0,0,0,0,0,111,0,0,425,0,0,0,0,0,789,0,0,0,1593,0,1768,0,0,233,0,0,0,0,943,0,\n0,0,0,0,0,0,955,225,245,0,0,0,0,0,0,241,0,0,0,0,1943,0,0,0,1284,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,709,0,0,0,0,0,0,554,0,0,0,0,0,0,0,0,1564,0,0,0,\n443,0,0,0,0,0,0,280,0,0,0,0,0,0,0,0,729,0,0,0,348,0,0,0,0,0,0,0,758,848,298,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,829,1422,189,121,0,0,632,812,0,0,556,0,0,0,0,0,436,172,\n530,844,232,984,0,0,0,0,0,0,0,0,0,0,147,0,0,0,0,0,0,0,0,537,0,0,0,0,0,859,0,0,\n842,0,0,0,0,0,0,0,0,0,0,1291,0,0,0,0,0,0,0,0,0,0,0,1482,612,392,0,0,0,262,31,0,\n0,0,0,0,0,0,0,0,0,753,549,0,0,0,0,0,0,696,0,0,0,0,0,0,0,834,0,0,0,0,0,771,0,0,0,\n0,0,0,0,0,0,0,0,0,0,921,0,0,0,674,0,0,0,0,0,0,0,0,0,0,308,444,0,0,0,0,0,0,805,\n180,0,0,278,271,0,0,214,505,0,1215,0,0,0,0,0,0,387,271,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,1645,42,92,0,459,0,0,330,1557,0,0,0,0,0,0,0,0,113,18,0,0,0,\n1742,0,0,0,965,0,0,0,0,0,0,0,0,0,0,0,0,0,182,0,0,65,0,0,0,0,0,0,0,0,0,0,0,0,973,\n0,0,0,0,0,328,0,0,588,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1786,\n0,0,962,1985,0,0,0,308,508,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,588,0,0,0,0,0,0,614,793,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,290,0,0,0,0,0,0,0,0,0,0,1136,0,0,0,0,0,0,0,0,0,0,796,719,0,0,\n326,210,0,0,0,701,758,472,0,0,0,1947,278,1079,0,0,0,0,0,0,497,41,0,0,634,46,961,\n0,810,524,0,0,33,0,0,0,0,0,0,0,0,0,0,0,0,532,0,997,0,0,0,0,0,0,0,0,0,0,0,1301,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1298,0,671,0,0,0,306,0,0,0,0,0,0,0,0,0,0,\n693,1823,0,0,0,759,0,0,0,0,0,1932,0,0,0,0,0,0,0,0,0,0,0,0,0,0,88,182,0,0,0,1964,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,521,0,0,0,0,0,0,424,857,0,0,0,0,671,328,0,\n529,0,0,0,0,0,716,0,1509,80,67,0,0,0,0,59,141,0,0,0,0,0,0,783,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1498,0,0,0,0,343,430,803,1183,677,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1357,53,0,0,0,0,590,0,0,0,0,0,0,0,0,0,0,\n0,0,0,329,0,0,0,0,0,0,0,469,0,0,0,0,0,0,0,0,0,0,460,0,0,1743,0,0,963,340,0,0,0,\n0,0,1603,0,0,250,0,0,0,0,0,646,218,0,1794,0,0,0,571,0,455,0,0,0,1012,0,0,0,0,0,\n0,0,0,0,0,0,0,597,161,0,349,0,524,0,0,0,0,0,0,0,0,0,0,0,0,322,432,0,0,0,0,0,0,\n325,223,0,0,0,0,0,566,0,0,0,1394,481,436,0,48,457,610,756,618,0,0,0,755,0,1217,\n0,0,0,0,0,197,0,0,0,0,0,0,0,0,0,0,0,0,0,0,544,492,107,414,0,0,0,0,0,0,0,0,0,0,0,\n1007,0,0,0,0,5,0,0,1580,0,0,0,0,0,0,0,0,0,0,0,0,0,673,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,1843,0,0,0,0,0,0,0,0,0,165,0,0,0,0,0,0,809,885,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,498,0,0,0,306,9,0,0,0,0,0,0,0,437,721,146,0,0,0,0,0,0,0,0,0,0,0,177,0,0,0,0,\n0,0,0,1377,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,200,0,959,0,0,0,1928,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1435,0,481,0,0,0,0,0,0,142,84,0,0,0,0,0,\n1015,0,0,0,315,0,0,0,0,0,0,759,0,0,0,0,0,0,0,0,712,0,0,0,1722,0,0,0,0,0,0,0,0,0,\n0,0,0,222,0,985,1414,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1273,\n538,706,0,0,0,0,0,0,0,0,115,0,0,0,0,0,0,0,0,0,0,1781,0,0,0,0,0,431,97,665,42,\n237,0,0,0,264,0,0,213,0,0,0,0,0,0,0,455,0,0,0,906,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n624,0,574,0,0,0,0,0,0,0,0,0,0,0,0,354,0,0,0,1558,0,0,0,0,0,0,0,0,0,0,0,0,0,0,68,\n235,723,1813,0,0,0,957,0,830,0,0,0,0,0,0,0,0,0,0,0,0,23,0,0,496,0,0,0,0,0,0,0,\n547,239,88,0,0,0,0,0,0,0,0,0,1310,0,0,0,0,0,0,0,0,80,1076,0,0,118,0,0,0,479,274,\n0,0,0,0,0,0,0,0,0,0,0,497,0,0,669,261,0,0,0,0,13,0,0,0,0,0,0,791,250,642,0,0,0,\n1429,939,949,0,0,0,0,0,0,0,0,0,0,0,0,0,818,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,982,330,0,0,0,0,545,0,0,0,0,0,0,947,0,1188,0,0,0,0,0,904,0,0,0,0,0,1372,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,693,377,0,0,0,0,0,0,0,0,0,0,0,0,0,0,695,0,0,\n713,386,0,0,0,0,128,1575,0,0,0,0,0,0,424,893,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,904,0,0,0,0,0,552,322,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28,1808,49,0,0,0,0,\n1832,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,421,0,0,442,415,0,0,289,\n0,0,0,0,0,206,110,0,0,0,0,0,205,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n19,1539,0,0,0,0,0,1340,0,1194,0,0,0,0,0,0,0,0,549,0,0,0,0,0,0,0,0,1720,0,0,0,0,\n0,0,0,0,0,319,0,0,0,0,112,1180,0,0,0,0,0,0,0,0,0,0,0,967,0,0,0,0,0,0,0,0,0,1940,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,735,0,0,0,0,0,0,0,0,0,897,132,0,0,0,0,0,0,0,\n0,0,0,38,838,0,0,0,379,218,8,660,1017,0,0,0,0,0,0,111,387,647,877,0,0,53,790,0,\n0,0,0,0,0,0,0,458,0,0,0,0,0,0,954,0,0,0,394,0,1367,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,882,0,0,0,0,0,0,0,1409,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,38,124,342,199,0,0,0,0,\n0,0,0,0,0,0,724,628,0,0,0,0,804,266,0,0,0,0,0,208,0,79,0,0,0,0,0,0,0,0,741,0,0,\n0,0,0,0,0,0,0,0,606,0,1494,821,1553,0,0,135,405,0,0,178,100,0,0,0,0,0,0,0,0,0,0,\n0,0,0,481,0,0,0,1378,0,0,0,0,0,0,0,0,0,0,0,0,0,791,33,1227,857,0,467,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,447,0,0,0,0,0,0,86,128,0,0,0,0,0,0,587,0,0,0,692,1018,0,\n195,0,0,0,0,0,0,0,1546,0,0,0,0,0,0,0,0,0,0,0,684,0,0,345,0,0,0,0,0,0,365,0,1683,\n0,0,472,0,433,0,0,0,0,0,0,0,28,0,0,0,997,0,705,3,0,0,0,0,0,0,0,0,0,229,0,0,0,0,\n102,0,0,0,0,866,1022,0,0,0,0,0,0,0,0,0,55,0,115,0,0,0,0,933,0,0,0,0,0,0,0,702,0,\n0,0,0,0,0,0,1728,26,484,0,0,0,185,618,417,0,803,0,0,0,0,0,0,0,0,0,0,0,1262,0,0,\n0,0,0,0,0,0,0,0,0,0,0,633,0,0,0,0,0,0,0,0,0,0,0,0,0,479,262,0,0,0,0,0,0,830,0,0,\n0,0,26,70,0,0,0,0,0,0,0,0,217,0,640,51,0,0,360,1586,0,0,0,0,0,652,0,0,0,0,0,766,\n0,0,0,0,298,737,0,0,0,0,0,0,0,0,0,0,655,222,906,0,0,1013,991,2009,0,0,0,0,503,0,\n0,0,216,154,0,0,0,716,0,844,0,0,0,0,621,252,0,0,0,0,748,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,103,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,576,0,0,0,648,0,0,0,331,0,0,0,\n0,0,0,0,0,0,0,0,0,632,0,0,0,518,107,0,0,0,0,0,0,0,0,851,0,0,0,0,504,0,0,0,0,0,0,\n0,0,0,0,0,0,7,883,0,0,0,0,0,0,0,922,0,0,0,0,0,0,0,0,91,993,0,0,0,0,0,0,200,131,\n10,0,0,0,0,0,0,0,0,0,0,0,0,0,365,1433,0,0,0,0,28,103,0,0,798,1013,0,0,0,0,0,0,0,\n0,39,1925,0,853,0,0,271,519,0,0,0,0,338,0,0,300,470,419,0,0,0,0,0,0,836,0,0,0,0,\n0,0,1937,0,0,0,0,0,393,0,0,357,0,0,0,0,0,703,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,387,0,0,0,0,0,0,75,708,453,1351,0,303,0,0,772,0,0,0,0,0,0,0,0,749,0,0,\n0,0,0,0,0,0,0,0,0,0,0,1065,0,0,717,226,0,0,0,0,0,890,431,626,0,0,0,0,706,0,0,0,\n51,698,0,0,0,0,0,0,0,0,0,0,0,828,0,0,17,0,0,0,0,1929,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,84,0,0,0,0,0,0,0,0,0,0,0,0,0,0,27,871,498,0,101,1793,0,0,0,0,0,0,435,0,\n0,0,0,0,966,0,129,1644,0,0,0,0,0,0,0,0,0,0,0,0,0,997,502,0,0,0,0,0,0,0,0,0,0,0,\n0,823,0,1927,0,0,0,0,98,1756,0,0,0,0,0,0,0,0,0,0,0,0,8,0,160,1046,0,492,0,0,0,0,\n0,0,129,45,0,0,0,0,0,0,353,558,0,0,0,0,0,785,0,0,0,1145,189,0,0,0,26,353,0,0,0,\n0,0,2024,0,0,0,606,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,855,0,0,0,0,0,0,0,0,0,0,0,\n0,0,2011,0,0,5,4,0,0,461,764,0,0,0,1449,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1445,0,0,\n0,1168,0,0,0,233,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,255,0,0,216,0,0,0,286,0,0,0,\n3,0,0,0,723,536,0,0,0,0,0,285,0,0,0,560,0,0,0,0,0,690,0,0,0,0,0,1246,0,0,63,0,\n33,0,0,0,0,0,520,1862,0,0,0,0,0,0,0,0,0,0,0,0,630,0,0,0,0,554,0,0,0,0,0,1001,0,\n0,0,0,0,446,0,0,0,0,0,0,0,1313,0,0,837,636,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,278,\n0,0,0,0,0,0,0,0,868,0,0,0,0,1010,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n1231,0,304,0,506,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,26,0,93,1408,794,\n843,704,0,285,114,485,898,145,0,19,2035,0,0,0,1933,0,0,0,0,0,0,0,1728,0,0,0,0,0,\n0,0,0,746,0,0,0,0,0,0,0,995,1964,0,0,0,0,0,0,0,0,0,0,0,1550,0,874,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,1018,0,0,0,814,126,0,0,1264,0,0,814,955,0,0,0,0,0,0,\n0,981,0,0,0,0,0,0,0,0,915,56,0,0,100,0,0,0,0,0,0,0,0,0,638,0,0,0,0,738,0,0,0,0,\n0,0,0,0,0,758,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1112,0,0,214,0,0,0,133,0,196,\n168,0,0,0,0,0,1152,0,1245,0,0,538,169,871,1816,0,0,413,133,0,0,0,978,0,0,43,93,\n371,0,0,0,0,0,0,526,25,0,754,335,0,0,0,0,182,0,0,0,0,0,0,0,0,0,0,0,39,601,0,0,0,\n0,0,0,0,181,370,0,0,1652,358,0,0,0,0,0,0,0,0,0,176,286,0,788,0,0,0,0,0,1223,780,\n254,1003,896,0,0,0,1447,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,744,0,0,0,0,0,126,0,\n41,788,0,0,0,629,0,0,0,0,0,0,0,0,0,0,0,293,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,420,37,1900,0,0,0,0,542,1570,957,0,0,0,0,0,0,\n0,373,31,0,0,0,0,125,325,0,0,0,0,0,0,323,0,0,1547,0,0,0,0,0,0,0,0,0,0,0,0,0,\n1216,0,0,0,0,0,0,198,1905,629,15,0,0,0,0,0,0,20,75,543,1353,0,0,0,533,0,0,6,0,0,\n0,0,0,0,538,0,0,0,0,0,0,0,0,0,0,0,338,0,0,0,0,11,0,0,0,284,659,0,989,0,0,0,0,0,\n0,0,0,0,848,0,0,507,0,0,0,0,0,0,0,0,188,991,884,0,0,0,0,60,959,0,0,0,0,0,1653,0,\n0,922,337,0,638,0,0,500,0,0,0,0,0,0,0,0,0,0,0,166,0,0,0,0,0,0,0,0,0,0,0,0,418,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,760,0,0,0,0,0,0,1277,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,770,0,0,0,0,0,0,0,243,89,0,0,0,0,0,0,0,0,0,1396,0,\n560,0,0,3,1658,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,586,0,0,1271,0,0,0,505,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,637,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1947,\n41,445,0,0,0,0,0,0,0,0,57,189,0,0,371,0,0,0,0,552,0,883,0,923,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,875,0,0,0,1788,49,0,0,0,0,0,\n0,0,0,0,0,0,661,0,0,1945,0,0,0,0,0,794,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,1135,0,0,0,745,0,0,0,0,0,0,0,84,0,0,0,0,0,0,0,410,0,976,0,0,0,0,0,703,0,0,\n0,0,0,0,187,322,0,0,0,227,0,0,0,0,560,0,31,1395,0,0,0,0,0,466,0,0,0,0,643,167,0,\n0,0,1428,0,412,0,0,0,0,0,0,0,0,0,1118,562,0,0,0,0,0,256,0,0,0,0,0,0,1771,0,0,0,\n0,0,1190,132,0,66,0,0,0,0,0,0,0,0,0,0,317,0,0,0,63,0,0,0,0,0,0,0,1475,0,0,0,0,0,\n0,0,288,0,0,0,0,608,0,0,0,0,0,0,0,0,1225,0,1189,0,0,0,0,0,0,0,1468,0,0,0,0,0,\n689,120,0,0,0,0,0,0,0,1,0,329,0,0,0,0,226,0,0,0,0,0,1855,0,0,461,0,0,0,0,1346,0,\n0,0,0,0,85,0,0,299,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1171,0,0,\n0,980,0,0,0,0,0,0,0,0,637,279,0,0,0,0,0,293,0,0,0,0,528,17,0,0,0,0,5,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,601,0,0,0,0,0,0,779,0,\n196,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1322,737,752,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,412,192,80,0,0,8,1470,0,0,0,0,0,0,0,0,0,873,0,0,0,0,0,835,0,0,0,0,256,\n38,986,0,0,0,0,0,0,0,0,0,91,257,278,911,0,0,0,0,0,0,0,0,749,151,0,0,0,0,0,0,0,0,\n0,0,0,0,989,0,0,990,0,0,90,194,0,0,0,0,0,425,0,0,0,0,0,774,0,0,0,0,0,0,0,0,0,0,\n646,827,752,0,0,0,662,0,22,21,0,0,0,0,0,0,95,239,0,0,0,431,0,0,0,0,0,874,0,0,\n265,65,0,0,0,1350,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1887,0,0,0,0,0,0,0,809,\n0,696,0,1074,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,630,0,0,802,0,0,0,56,776,0,\n970,0,0,797,0,0,0,0,0,400,0,0,1951,0,0,41,0,11,118,0,0,0,0,0,0,0,0,251,615,0,0,\n0,1044,0,0,0,0,0,0,0,0,0,0,0,225,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,370,0,0,0,0,\n104,48,209,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,930,0,0,0,0,\n0,0,0,0,0,0,0,1286,0,759,0,120,385,0,0,0,429,0,0,0,0,0,0,0,0,820,0,0,0,0,0,0,\n199,0,10,151,0,0,0,761,365,0,0,0,0,0,0,0,0,0,46,1086,0,0,0,0,11,1624,58,344,0,0,\n1008,1868,0,0,0,888,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,711,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,440,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,914,1913,0,958,0,885,0,0,0,0,0,0,0,0,0,0,0,\n0,0,847,276,0,302,65,0,0,0,510,0,1514,0,0,0,0,0,0,152,291,0,0,0,0,0,0,0,0,0,0,0,\n0,282,589,0,0,0,0,0,0,0,0,0,0,0,0,0,130,0,0,463,42,0,0,0,0,0,372,0,0,0,0,0,0,0,\n0,0,680,0,0,0,0,0,0,0,0,977,1997,0,0,0,810,0,0,0,0,0,0,0,0,0,1390,0,0,0,644,0,0,\n867,982,0,0,0,0,0,0,0,540,0,123,0,0,0,1978,0,0,0,0,789,623,0,1723,0,1220,0,0,0,\n0,0,0,0,480,0,0,0,0,0,0,0,0,0,0,0,888,0,0,0,0,0,0,0,0,0,0,0,0,299,1995,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,788,179,0,0,0,0,0,0,431,156,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1373,39,80,196,0,0,507,0,0,0,646,0,0,0,0,\n0,1214,0,0,0,0,926,0,0,0,1,114,0,0,0,0,0,446,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,490,0,0,0,491,0,1584,0,0,507,250,0,0,0,158,\n10,362,1,0,0,0,0,0,0,0,0,0,408,228,860,480,0,779,0,0,0,557,0,0,142,197,0,0,0,0,\n0,0,0,0,0,0,0,1490,11,378,316,1057,0,0,18,579,299,1546,0,177,0,0,0,0,0,0,0,0,0,\n411,0,0,0,0,727,439,0,0,0,0,0,1528,0,0,0,0,0,0,58,0,482,0,0,0,505,1952,0,0,0,0,\n0,0,0,0,0,0,0,242,0,0,0,0,0,0,0,953,0,0,0,0,802,0,0,0,0,0,0,0,0,0,0,290,0,0,791,\n52,0,0,0,0,0,0,0,0,0,0,0,112,0,0,0,0,0,1028,0,0,138,0,0,0,0,1811,0,0,0,0,0,0,\n934,1821,0,0,0,0,371,38,0,0,0,1296,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,723,0,0,0,0,0,\n0,0,0,0,0,0,0,0,1330,0,0,0,0,0,0,0,1255,296,109,0,0,0,0,0,660,0,0,0,0,270,591,0,\n0,0,0,0,0,0,1090,81,0,0,0,0,391,0,0,0,0,249,322,0,0,0,0,0,0,0,1412,0,0,0,0,0,0,\n0,0,0,0,526,632,0,0,0,0,0,0,235,144,0,0,0,0,0,940,0,0,0,52,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,309,196,0,0,0,0,0,1912,0,1290,0,686,0,0,625,0,0,0,0,0,0,0,0,0,0,0,412,0,\n0,0,0,43,0,0,0,0,11,967,758,0,0,0,0,0,0,0,0,0,0,0,0,0,0,220,0,0,0,0,0,0,0,0,0,0,\n873,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,890,0,0,2,0,0,0,0,0,0,0,0,1774,\n393,263,0,0,0,0,0,0,818,456,0,0,251,178,393,97,0,0,0,0,0,674,168,0,0,0,0,0,0,0,\n159,1639,0,0,0,0,0,0,0,0,59,934,0,191,0,0,0,0,346,165,0,877,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,128,0,0,0,0,0,0,1297,0,0,0,0,0,0,164,0,0,0,15,132,241,1073,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,228,324,53,0,0,910,0,0,0,0,0,0,0,0,734,705,\n217,73,0,0,0,0,0,0,0,0,636,389,0,1409,0,0,0,0,0,893,0,0,0,0,21,0,0,0,0,0,0,0,0,\n0,0,0,0,0,721,0,0,0,959,0,0,0,0,1433,0,0,0,0,0,0,0,0,0,0,0,0,174,189,0,0,0,0,0,\n0,0,0,0,0,22,2,0,0,815,354,0,0,0,0,425,0,411,60,13,1611,0,0,0,0,0,0,0,0,0,0,0,0,\n0,1478,596,0,0,398,0,50,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,192,1159,0,0,0,0,0,\n592,223,0,0,0,0,0,0,0,245,64,0,0,0,0,278,0,604,0,0,1502,265,0,0,0,0,0,0,0,310,\n1763,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,129,0,0,0,0,0,0,0,0,0,1356,0,0,0,0,0,0,0,\n0,505,0,0,0,0,0,0,0,1000,0,0,966,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,839,0,0,0,0,0,0,\n0,0,0,0,0,0,0,637,0,0,0,0,0,0,0,0,0,0,0,0,0,0,590,0,0,0,0,280,0,0,0,1386,0,0,0,\n281,0,1064,0,0,0,0,0,917,0,0,15,555,0,0,1014,1883,0,0,0,965,0,0,117,33,0,0,0,\n801,0,0,0,0,0,877,0,824,0,0,0,0,0,0,0,0,0,0,0,365,0,0,0,0,0,0,774,7,0,430,0,0,\n231,360,0,0,0,0,0,0,0,0,822,740,0,0,929,1485,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,852,0,0,0,0,17,0,0,0,0,0,0,1001,0,0,0,0,35,831,0,0,384,457,0,0,0,1351,0,27,\n0,0,984,0,264,552,0,401,0,0,0,710,0,1211,0,0,11,205,0,0,0,0,0,0,0,0,0,0,0,0,5,\n579,0,717,0,0,1011,0,0,0,0,0,0,0,0,0,0,0,0,0,0,805,0,0,0,0,0,0,0,0,0,0,0,489,0,\n0,0,1024,0,0,0,0,0,0,0,0,0,892,0,0,0,0,0,0,0,0,0,0,0,0,473,0,0,0,659,864,0,0,0,\n0,0,0,152,819,0,51,0,0,0,0,0,0,0,0,0,0,130,0,0,0,0,0,229,0,0,0,0,674,0,0,0,0,0,\n0,0,0,0,770,52,79,0,0,0,1666,0,409,0,0,0,0,0,0,0,195,0,688,0,0,0,0,0,0,0,0,0,0,\n0,889,174,160,0,0,0,0,0,0,0,0,0,0,0,0,0,872,0,918,569,268,0,0,0,1224,0,1361,0,0,\n0,0,0,0,0,0,0,374,0,0,0,0,0,731,0,0,0,0,190,0,0,0,0,0,0,0,202,506,444,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,835,0,17,1526,0,0,0,0,0,477,0,0,\n994,1374,76,0,0,0,0,0,0,0,355,287,0,1389,0,0,0,0,0,0,455,384,0,0,0,264,0,0,0,0,\n0,0,0,0,0,0,0,0,1001,0,0,0,0,0,0,0,0,0,0,0,0,28,0,0,0,851,175,359,0,0,0,0,0,0,0,\n0,287,740,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,857,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n819,1402,0,0,0,0,0,0,174,224,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1649,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,655,573,0,0,0,0,0,0,0,0,128,351,0,0,0,0,0,0,\n0,0,0,0,0,918,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,687,0,0,0,0,0,0,0,0,0,1525,\n0,0,0,1009,0,0,0,0,0,0,0,340,0,0,0,0,0,0,0,0,0,0,861,0,176,0,0,0,0,0,0,0,0,0,96,\n985,0,615,0,0,0,0,0,0,0,1919,0,0,0,0,0,1131,0,0,0,0,0,0,0,247,0,0,0,0,27,23,0,0,\n0,0,0,0,0,0,38,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1015,0,0,0,0,0,1088,0,0,\n0,0,0,1585,0,0,0,0,227,0,0,0,478,360,0,0,0,95,0,0,0,0,0,0,699,0,0,0,26,0,0,0,0,\n1119,0,0,0,739,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,741,67,0,0,0,0,0,0,464,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,42,0,96,0,0,0,26,342,0,0,0,0,0,0,203,0,0,449,0,\n0,0,0,0,0,0,0,0,0,256,311,0,0,0,0,0,0,758,0,0,0,0,0,0,0,0,827,0,0,0,0,581,64,0,\n1047,0,0,0,0,0,288,0,0,0,0,0,1375,0,0,0,0,0,0,0,0,0,0,0,1309,0,0,0,0,0,0,0,0,\n376,12,0,0,0,0,0,154,0,1520,0,1753,95,502,0,0,0,0,0,0,0,269,291,1197,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15,0,0,0,0,1341,0,1017,0,0,0,0,0,0,0,\n0,857,1810,533,0,0,1453,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,836,211,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,19,0,156,0,0,0,0,1009,0,0,0,0,0,0,0,0,0,0,0,0,0,820,0,0,\n0,0,0,0,0,0,0,228,0,0,0,1131,0,1276,0,0,0,0,0,0,0,0,0,0,0,0,849,1792,0,0,389,\n291,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,525,0,0,\n0,453,0,0,0,0,666,0,0,0,422,0,355,0,0,0,0,165,0,260,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,865,0,0,0,0,0,0,0,1625,0,0,0,234,0,1383,0,0,0,0,0,0,0,0,306,0,0,0,802,1921,\n0,0,0,0,0,0,180,0,0,0,0,1312,814,0,0,0,0,0,0,0,0,0,0,707,0,0,0,1493,11,61,733,0,\n0,0,341,0,0,0,98,0,0,0,0,0,0,0,0,0,0,0,1014,0,0,0,0,0,0,0,142,102,0,0,30,0,0,\n823,0,1045,0,0,0,1930,0,1512,0,0,0,0,0,0,0,87,0,1243,245,0,0,0,0,0,0,0,48,68,0,\n0,0,0,0,0,0,0,126,77,625,938,0,0,351,0,0,0,174,1668,0,707,0,0,0,0,0,0,0,0,0,0,0,\n403,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,282,0,0,0,0,0,0,8,44,0,0,363,115,0,0,0,0,0,0,\n0,0,0,0,0,0,545,761,0,0,835,1254,0,0,0,0,930,1936,0,0,0,0,0,0,0,0,653,0,0,0,0,0,\n344,0,0,1483,673,185,0,0,460,93,753,478,0,0,0,0,0,1020,0,0,0,0,0,0,0,103,0,0,0,\n499,0,0,0,0,0,0,207,0,0,0,0,0,0,0,0,0,0,0,0,0,0,96,0,968,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,3,0,0,0,0,399,0,0,0,0,224,563,0,0,0,0,0,704,0,0,0,0,0,0,0,0,0,0,0,\n1559,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,861,0,0,0,0,946,333,746,0,0,0,0,0,\n0,0,910,0,0,0,0,0,0,0,0,0,0,0,0,0,652,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n1393,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1514,0,0,0,0,201,0,510,717,0,0,528,0,0,0,0,\n20,0,0,0,1251,0,0,0,1163,0,0,0,307,0,0,0,0,0,1091,0,0,0,0,0,0,0,0,0,0,0,429,0,0,\n0,881,0,0,0,0,0,621,0,0,0,0,0,0,0,736,0,348,0,868,0,0,0,0,433,0,0,0,771,1495,0,\n0,0,0,215,0,0,0,0,0,124,0,0,0,0,0,0,0,0,0,0,0,55,0,0,0,0,0,0,0,112,62,0,856,270,\n0,572,0,0,0,0,939,0,0,0,0,0,0,0,352,0,0,0,0,0,0,0,0,0,647,0,0,0,0,10,0,0,0,0,0,\n0,0,220,0,0,0,0,0,0,0,0,0,0,0,0,0,464,0,0,109,0,0,0,1746,0,0,0,515,0,0,0,566,0,\n0,0,0,0,0,67,40,0,0,722,992,0,0,923,0,0,0,0,0,0,1145,0,0,0,0,0,0,0,0,0,0,0,568,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,247,0,0,0,0,645,0,0,328,0,0,0,0,0,0,0,0,0,0,0,0,\n1363,0,0,0,0,0,1280,0,0,0,0,0,0,0,0,0,0,7,28,360,162,0,0,0,0,0,0,0,0,0,0,0,764,\n0,0,833,862,0,856,0,0,0,0,0,0,736,92,0,0,948,1944,0,1479,63,590,0,0,0,1521,0,0,\n0,709,0,0,61,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,483,0,0,0,0,1213,\n0,0,0,0,29,1022,0,1712,0,466,0,0,0,0,0,0,0,0,0,0,0,0,0,731,0,0,0,0,0,0,171,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,241,0,0,0,0,0,0,0,0,0,0,0,964,2005,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,1100,0,0,0,954,0,0,0,0,0,0,0,0,0,1958,0,0,34,549,994,0,0,449,\n137,850,0,0,670,146,0,0,0,0,518,159,0,0,0,0,0,0,0,0,151,0,0,1027,0,0,0,0,0,0,0,\n0,0,0,983,0,0,0,0,993,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,141,501,0,0,0,\n0,0,0,0,0,0,452,0,0,0,0,0,0,0,0,0,0,233,149,0,0,0,0,0,0,0,0,582,0,0,0,801,0,0,0,\n0,0,0,70,0,0,369,0,36,0,0,0,0,0,0,0,204,721,430,241,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1817,16,1078,1021,0,0,\n406,0,0,0,0,0,69,0,0,0,0,0,1830,0,0,0,824,0,0,0,0,0,0,0,0,0,826,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,816,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1000,717,1845,0,423,0,0,\n0,0,0,0,0,0,510,0,0,1048,0,0,0,618,0,0,0,520,0,0,0,0,990,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,321,0,0,0,0,0,0,0,1135,0,0,921,0,0,0,24,397,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,856,0,0,0,139,282,981,0,288,0,0,0,1890,651,56,0,0,0,0,0,0,0,\n0,261,0,0,0,0,0,0,0,0,0,0,0,617,1403,0,1205,0,0,563,0,0,0,0,0,0,0,0,333,0,0,0,0,\n0,369,0,0,0,0,0,0,0,0,0,622,0,0,0,1407,0,0,0,0,0,0,0,0,0,0,0,0,624,160,0,363,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,619,0,174,292,0,0,656,616,0,0,0,685,0,0,0,0,0,0,0,0,0,0,0,0,0,647,0,0,0,631,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1267,0,0,0,1797,0,0,0,1684,0,0,469,0,531,\n1230,73,0,0,0,0,0,0,0,0,0,268,0,0,0,0,0,102,558,109,65,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,595,0,0,0,0,0,374,1832,0,0,0,0,0,0,16,0,405,6,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,881,0,1495,0,0,0,0,0,0,0,0,0,142,0,0,0,0,0,0,0,0,0,0,21,466,23,\n257,0,0,0,0,0,0,77,404,0,0,0,0,0,0,712,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,860,\n1848,0,0,652,629,0,0,0,0,13,377,0,1842,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1501,0,\n0,0,1906,0,0,0,0,0,0,0,0,0,0,0,0,0,491,234,171,0,0,0,0,631,1186,0,0,0,0,0,0,0,0,\n0,0,0,0,931,0,170,0,0,0,0,0,0,0,0,0,0,1587,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n765,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,424,0,0,714,0,0,0,0,685,0,0,0,0,0,\n0,285,0,0,0,0,0,0,429,0,0,0,0,0,0,0,0,0,0,71,18,0,0,0,0,0,0,0,0,0,0,116,828,0,0,\n0,0,0,0,289,0,0,0,0,0,0,0,0,675,0,0,0,1424,0,0,0,0,0,647,0,0,0,1334,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,36,209,0,0,0,0,0,0,0,342,0,0,0,928,0,0,0,0,0,1838,118,856,654,\n318,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,915,895,454,0,0,513,1425,0,0,\n0,0,0,0,791,0,153,0,0,0,0,0,0,796,909,445,345,0,0,0,0,0,0,0,0,578,0,0,0,1387,0,\n0,0,555,0,0,0,0,0,0,766,0,0,0,0,0,0,0,0,0,0,541,0,0,0,0,0,0,0,0,0,0,0,0,0,880,0,\n0,0,0,0,1506,0,0,983,0,768,0,0,0,0,584,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,737,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,226,30,426,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n117,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,462,0,0,0,385,0,398,0,0,0,0,0,0,\n0,0,0,347,0,0,0,0,125,1259,644,136,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,469,0,0,0,0,0,\n1367,0,0,0,0,0,0,0,0,0,0,0,719,0,0,0,0,0,0,0,0,0,0,0,0,0,1423,0,0,0,0,0,0,0,0,0,\n749,0,0,0,0,546,645,0,0,0,0,0,0,277,0,0,1275,0,0,0,0,0,0,0,453,536,555,0,0,987,\n1107,0,0,90,0,0,0,0,0,0,0,0,860,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n257,0,1768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1071,0,0,0,0,0,0,0,0,0,0,0,0,0,83,\n0,835,0,0,0,0,0,0,0,2006,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,696,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,95,1718,0,0,0,0,0,0,0,26,0,550,0,0,0,0,0,901,0,0,0,0,0,\n0,822,0,0,122,0,0,0,807,0,0,0,0,0,262,0,620,601,34,0,0,170,0,0,0,0,537,0,0,0,0,\n0,0,0,0,0,332,0,0,208,1909,182,261,0,0,0,1721,0,0,0,0,0,933,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,1609,0,895,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,812,0,0,942,1916,0,0,0,0,\n0,0,0,778,0,0,0,137,0,1314,0,0,0,0,0,0,0,1661,0,0,0,0,0,0,0,1591,0,0,0,0,0,0,\n820,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,185,89,0,1160,230,6,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,63,29,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1740,0,0,177,\n170,0,1961,0,0,0,0,0,0,0,0,0,0,0,0,91,0,17,44,0,0,0,0,0,0,0,0,0,270,0,296,0,0,0,\n0,0,0,0,1523,0,0,0,0,0,0,0,0,0,0,757,7,0,0,0,0,0,0,0,0,0,0,530,588,0,0,0,0,0,0,\n0,0,0,786,0,0,0,0,0,580,627,88,447,57,0,0,0,0,0,0,0,0,845,735,0,0,0,0,0,31,15,0,\n460,521,12,424,0,0,0,1302,0,0,0,0,0,0,0,595,0,0,0,13,548,97,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,1472,452,1767,0,0,0,0,0,0,0,0,0,0,115,0,0,0,0,0,0,1543,0,1111,0,0,0,0,\n1,0,359,488,0,267,0,0,0,1983,0,0,0,0,0,0,0,1155,0,1575,0,1438,31,0,0,377,101,0,\n0,0,0,0,0,0,0,0,0,0,0,0,476,0,0,0,0,0,0,0,0,2023,0,0,0,0,0,1836,0,0,0,0,35,843,\n0,0,0,0,0,0,0,554,0,0,0,536,625,207,0,1371,0,0,0,424,785,336,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,896,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,27,750,0,0,0,0,238,0,0,\n0,0,0,383,0,0,0,0,0,0,0,0,603,725,11,0,0,0,0,0,0,0,0,0,476,0,0,0,0,0,1552,0,0,0,\n0,0,0,0,680,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,435,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n1431,0,0,13,112,0,0,356,0,0,0,0,0,0,0,0,0,0,1963,0,0,0,1244,18,0,0,0,0,0,0,867,\n0,0,0,0,0,0,50,708,73,592,0,502,0,0,0,0,0,0,161,347,0,0,0,0,470,33,0,246,571,10,\n0,465,614,0,237,0,0,0,0,0,24,18,0,506,0,0,0,0,0,0,33,309,0,0,0,0,0,0,0,0,0,0,\n140,0,0,0,0,1056,0,0,0,1704,0,0,0,0,0,0,0,1036,0,0,0,0,0,0,0,0,0,1315,432,86,\n264,524,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,107,0,0,0,0,0,123,927,0,0,957,1149,0,0,\n0,0,0,778,0,502,196,0,0,0,0,1312,0,0,0,0,0,0,0,855,0,0,0,0,0,0,0,0,0,0,45,1400,\n0,0,0,1003,0,0,0,0,0,1097,0,0,0,0,0,0,0,0,545,612,0,0,0,0,0,0,0,0,0,0,0,0,54,0,\n0,0,0,172,0,0,0,1029,0,0,0,0,0,0,0,0,0,568,0,0,0,732,617,0,0,974,94,989,733,0,0,\n0,0,0,0,1789,0,0,665,2015,0,0,0,0,0,0,806,287,0,0,0,0,0,1539,0,0,0,0,0,0,0,0,0,\n0,182,1563,0,0,0,0,0,0,0,0,0,484,0,0,0,0,0,1623,0,0,0,0,0,0,0,0,878,1833,0,1569,\n0,0,0,0,0,0,0,0,93,0,715,994,0,0,0,0,0,63,0,591,0,0,0,0,0,0,0,749,0,0,0,0,547,\n366,0,0,0,1747,0,0,0,0,0,0,0,89,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1463,0,772,\n893,0,0,0,48,0,0,941,0,0,690,1785,106,440,0,0,0,0,0,0,0,0,0,0,32,0,332,216,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,852,0,\n0,416,564,0,918,0,1764,0,0,3,0,0,274,0,0,0,0,501,0,0,0,0,0,0,0,851,743,0,49,0,\n879,0,0,47,0,0,0,0,0,0,865,0,1202,0,0,0,0,0,0,47,272,0,0,0,0,0,0,0,0,0,0,0,1455,\n0,0,0,0,891,1911,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,761,0,0,0,0,0,0,0,0,0,407,0,\n183,0,0,490,0,0,0,0,0,0,0,35,731,0,0,0,0,0,0,0,819,0,0,0,0,0,0,0,0,0,0,0,0,0,\n575,0,0,0,0,45,818,0,0,77,222,0,0,0,0,849,1880,0,0,0,633,0,1308,0,0,0,0,0,0,0,0,\n0,0,86,0,0,0,0,0,0,0,0,0,0,0,0,0,0,817,0,0,0,0,0,0,0,0,0,882,0,0,0,914,0,0,0,0,\n0,0,0,0,0,0,865,0,0,426,399,58,0,0,0,0,0,0,538,102,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,876,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,139,566,0,63,12,0,0,0,\n0,0,0,0,0,0,0,0,0,0,3,114,0,0,0,0,0,0,0,0,576,0,0,0,0,0,0,0,0,933,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,692,0,0,0,0,0,0,0,0,0,0,0,0,752,0,0,0,0,\n0,0,0,0,375,0,1011,0,0,96,0,0,0,0,0,0,0,0,0,148,0,0,0,0,0,0,0,0,0,0,0,337,56,\n666,0,246,394,0,0,0,0,0,0,0,0,437,0,0,0,506,0,0,0,0,1003,0,1163,0,328,0,0,0,0,0,\n0,0,0,1000,0,0,0,0,0,744,101,0,0,0,0,0,726,0,0,176,0,146,9,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,839,0,0,0,0,0,0,223,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,246,1931,29,0,0,1771,0,0,0,0,0,846,6,157,0,0,0,0,0,0,0,0,0,875,0,0,477,\n773,177,639,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1747,0,0,0,0,158,873,0,659,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,391,0,0,0,0,0,0,0,0,0,0,0,0,668,883,0,78,628,0,0,0,\n0,0,0,0,0,0,0,0,0,1460,0,962,0,0,0,0,0,460,0,0,0,0,0,0,0,0,0,0,0,0,0,0,34,199,0,\n0,0,388,474,0,271,0,333,608,0,0,0,0,0,0,49,0,988,0,707,617,0,0,0,0,0,0,0,756,0,\n0,0,0,0,1583,0,0,0,0,0,0,0,0,0,0,285,0,0,0,0,0,0,0,0,0,0,0,0,0,0,344,0,0,0,0,0,\n0,0,0,515,1709,0,0,0,0,0,0,0,0,404,0,0,0,0,500,0,0,0,0,0,0,0,0,0,68,216,0,0,0,0,\n0,0,0,488,353,0,0,177,236,0,0,458,490,0,0,0,0,0,0,756,1504,0,757,0,1735,0,0,108,\n598,0,0,0,0};\nconst BROTLI_MODEL(\"small\")\nuint8_t kStaticDictionaryHashLengths[BROTLI_ENC_NUM_HASH_BUCKETS] = {\n8,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,12,0,0,0,0,4,22,5,0,\n4,0,0,0,0,0,0,0,0,0,0,0,0,14,6,0,0,0,5,0,0,0,0,0,0,0,7,13,0,0,4,0,0,0,0,0,0,0,0,\n0,6,0,0,0,0,8,0,0,0,0,0,0,7,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,4,0,0,0,4,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,10,4,0,5,13,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,8,7,0,0,9,0,8,0,0,0,0,0,0,6,0,\n0,9,0,0,0,11,0,0,6,8,7,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,6,8,0,0,0,0,0,\n0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,9,0,0,0,8,4,13,7,0,0,0,0,0,\n7,0,5,0,0,0,0,8,5,0,5,0,0,8,7,0,0,0,0,0,0,0,0,0,0,9,0,0,0,8,0,0,0,10,4,0,5,0,4,\n0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,8,7,0,4,9,4,0,0,0,0,0,0,\n9,0,0,0,8,5,0,0,0,6,0,0,0,0,0,0,0,0,0,7,18,0,0,0,0,4,9,0,0,4,0,6,0,0,0,6,0,6,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,5,8,7,0,0,0,\n0,9,0,0,0,0,0,0,0,8,6,10,6,0,0,0,4,0,6,8,6,0,0,0,4,0,0,0,0,0,5,0,0,0,6,0,0,0,0,\n10,0,12,7,0,0,0,0,0,4,0,0,0,0,0,5,0,0,8,7,0,0,0,0,0,0,0,0,9,5,0,0,0,0,0,0,0,0,0,\n0,0,0,0,6,11,0,0,0,0,0,0,0,0,0,8,7,0,0,10,0,0,0,0,0,0,0,0,6,10,0,17,0,8,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,8,6,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n7,0,0,11,4,0,5,0,0,0,0,0,0,0,0,0,0,10,5,0,6,8,5,0,0,0,0,0,0,0,0,0,0,11,5,0,0,0,\n0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,9,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,8,7,0,0,0,0,0,\n0,0,0,0,0,0,5,0,0,0,6,0,0,10,0,0,0,20,0,0,0,0,0,0,0,0,6,9,5,0,0,0,0,10,4,8,0,0,\n4,13,0,0,0,0,0,0,0,9,0,9,0,0,0,0,0,0,0,0,0,0,0,0,4,8,6,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,12,0,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,12,5,0,0,10,4,10,7,13,\n0,0,0,0,0,0,0,0,6,0,6,0,6,0,0,0,0,0,0,19,0,0,4,12,6,9,0,0,0,0,4,0,4,11,0,0,0,0,\n0,0,0,12,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,4,0,0,0,0,0,0,0,0,0,6,0,0,0,0,\n0,5,0,0,0,0,0,6,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,9,6,0,0,0,0,0,4,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,\n6,0,0,0,0,0,0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,6,0,0,\n0,0,0,5,0,0,0,0,14,4,0,0,0,4,12,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,6,0,\n0,0,0,0,0,12,0,9,6,0,0,0,0,13,0,0,5,0,0,0,0,0,4,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,13,0,9,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,5,0,0,0,6,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,8,7,8,4,0,0,0,0,0,0,0,0,0,0,0,7,0,7,0,0,0,4,0,\n0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,6,8,4,0,0,0,0,0,6,0,7,0,\n0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,7,0,0,0,0,0,0,9,5,0,0,\n0,0,0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,9,4,0,0,0,0,0,0,0,4,\n12,5,11,0,0,0,0,0,0,0,0,0,8,7,0,5,0,0,8,7,0,5,0,0,0,0,8,0,0,0,0,7,0,4,10,0,0,0,\n0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n13,5,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,0,14,5,0,0,0,7,0,0,10,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,6,0,4,0,5,0,0,0,0,8,5,0,0,0,0,0,0,9,5,9,0,0,0,0,0,0,0,0,6,9,0,\n0,4,0,0,0,7,0,0,0,6,0,0,10,4,0,0,0,0,0,6,0,0,10,0,0,0,8,5,0,0,0,0,0,0,0,0,10,0,\n0,0,0,0,18,4,12,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,8,7,0,0,0,\n0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,4,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,\n0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,8,0,0,0,0,0,0,6,0,0,0,4,10,5,0,0,0,0,0,0,0,0,0,0,\n0,4,8,7,0,0,8,6,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,\n0,0,0,8,6,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,\n0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,8,7,0,0,0,0,8,0,12,6,0,6,0,0,0,0,9,7,11,7,0,0,0,\n0,0,0,0,0,0,0,0,0,11,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,10,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,\n0,0,0,6,0,0,0,7,0,4,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,14,0,0,0,0,0,8,4,0,4,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,20,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,12,5,0,7,0,5,0,0,10,0,0,7,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,6,0,4,9,7,0,0,0,\n0,0,7,0,0,0,0,0,0,10,0,9,0,9,0,0,0,0,0,0,0,0,4,9,0,0,0,0,6,0,0,0,0,0,0,0,0,11,4,\n0,6,0,0,0,0,0,0,8,0,8,0,0,0,0,0,0,0,0,0,0,4,0,0,0,5,0,0,0,0,0,0,0,0,13,6,0,0,11,\n0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,6,18,0,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,\n0,5,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,6,0,0,0,0,9,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,11,\n4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,4,0,0,0,0,8,\n6,0,0,0,0,0,0,9,6,0,0,0,0,0,4,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,0,0,\n0,6,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,6,0,6,0,0,10,6,0,0,0,7,0,0,8,0,8,7,0,\n0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,20,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,\n0,0,0,8,7,0,0,0,0,0,0,0,0,12,0,12,0,0,0,11,6,0,5,0,0,12,0,12,5,0,7,11,6,0,0,11,\n0,0,0,12,0,0,4,12,7,8,6,0,0,0,0,8,5,0,0,0,0,0,0,0,4,11,0,0,6,0,7,0,0,0,0,0,0,0,\n5,0,6,0,0,0,0,8,0,10,0,0,0,0,0,0,0,0,0,0,0,9,7,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,\n0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,0,0,10,0,0,5,0,0,12,6,0,0,0,0,0,0,10,6,0,0,0,0,8,\n6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,5,0,0,0,0,11,0,10,6,0,0,8,6,0,0,0,6,0,7,10,6,0,\n0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,10,7,0,0,0,0,\n10,6,0,0,0,0,0,0,8,5,11,0,8,4,0,0,0,4,0,0,0,0,9,4,8,0,0,0,0,0,0,0,11,6,0,0,0,0,\n10,7,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,7,0,0,0,0,9,6,0,5,0,7,0,0,0,0,0,7,0,0,11,0,0,\n0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,\n0,0,0,0,13,0,8,6,13,0,0,0,11,7,0,7,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,6,0,0,9,6,0,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,\n0,0,0,0,0,5,9,0,0,0,0,0,0,0,0,0,0,4,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,9,7,0,7,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,\n5,11,5,0,0,0,0,0,0,0,0,0,4,0,7,0,6,0,0,0,6,20,0,0,0,10,7,0,5,14,4,0,0,0,0,0,0,0,\n0,0,6,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,\n0,0,6,0,4,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,0,11,6,15,0,0,0,0,0,\n10,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,7,0,0,0,0,0,0,0,0,9,7,13,0,0,0,0,0,\n0,7,0,0,8,6,0,0,0,0,0,0,0,0,9,4,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,5,0,0,0,0,0,0,0,0,0,0,0,0,8,5,0,4,0,0,0,0,0,0,0,0,0,0,12,6,8,0,12,0,0,7,0,0,0,\n0,0,5,10,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,\n14,0,0,0,0,0,0,0,0,0,0,0,0,5,0,5,8,7,10,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,18,6,\n14,7,0,0,0,0,0,0,0,0,11,6,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,11,7,0,0,10,7,0,0,0,6,8,6,0,0,0,0,0,0,0,6,0,0,\n19,0,0,0,9,5,0,0,0,0,0,0,11,7,0,0,0,7,0,6,0,0,11,0,0,0,0,4,8,0,0,0,0,0,0,0,0,6,\n0,0,0,0,0,6,0,0,8,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,7,\n0,7,0,0,0,7,15,0,0,5,0,0,0,0,10,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,7,0,0,\n0,0,0,0,0,0,9,6,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n11,7,0,0,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,\n0,0,5,0,4,0,0,0,4,0,4,0,0,0,0,0,0,0,0,0,6,0,0,0,0,11,6,0,0,8,5,14,0,0,4,0,0,0,7,\n17,0,0,0,0,0,0,0,13,5,0,0,0,0,0,5,0,0,0,5,0,0,0,0,16,6,0,4,0,0,0,0,0,0,12,0,0,0,\n0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,5,0,5,0,6,10,0,12,0,0,0,0,0,0,0,0,7,0,0,0,0,8,4,\n0,0,0,0,0,0,0,0,0,0,8,7,0,0,8,0,0,0,8,0,0,6,0,7,0,0,0,5,0,6,0,4,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,22,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,\n0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,18,0,0,0,9,4,0,0,8,0,9,7,0,0,0,0,0,0,8,6,0,0,0,0,\n0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,9,7,0,0,0,6,0,0,14,0,0,0,0,\n0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,7,10,4,\n0,6,0,0,0,0,0,0,8,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,9,6,0,0,0,0,0,0,\n0,0,11,6,12,7,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,0,9,6,11,6,0,0,0,0,9,5,0,0,0,0,0,0,\n0,6,8,5,0,0,0,0,8,0,10,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,\n5,10,7,0,0,0,5,8,7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,4,8,7,0,0,0,6,0,0,\n0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,22,\n0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,5,0,0,0,0,0,0,0,\n0,0,0,0,0,17,0,0,6,0,6,12,4,19,6,0,0,0,0,16,0,0,0,0,7,15,7,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,4,10,4,0,0,8,7,0,7,0,0,9,\n4,0,6,0,0,0,4,0,5,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,7,10,0,0,0,0,0,11,7,0,0,\n0,0,12,6,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,\n0,0,0,0,0,0,0,0,0,10,4,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,8,7,0,0,\n0,0,0,0,0,6,0,0,0,4,0,0,11,4,0,0,12,7,0,0,0,0,9,0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,\n4,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,9,4,0,6,0,0,0,0,0,4,\n0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,0,0,5,0,0,0,0,0,0,0,0,0,7,9,6,0,7,0,\n0,0,0,0,0,0,6,0,0,0,0,8,6,0,0,0,0,10,6,11,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,5,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,5,0,4,8,0,0,0,0,0,9,7,0,0,0,0,0,0,\n13,5,0,0,0,0,8,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,5,0,0,11,7,0,0,0,0,0,0,8,6,0,\n0,0,0,0,7,0,4,0,0,0,0,0,0,0,5,0,6,0,5,0,0,0,0,0,0,0,0,0,0,0,0,10,4,9,0,0,0,0,0,\n0,4,0,0,0,0,10,5,10,7,0,0,0,0,0,0,0,0,16,7,0,0,0,0,0,7,0,0,0,0,11,0,0,0,0,0,0,0,\n0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,5,0,4,0,0,0,7,0,0,0,0,0,0,13,0,0,\n0,0,0,0,0,0,0,0,7,0,4,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,13,7,0,7,0,4,16,0,0,0,0,6,8,7,9,7,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,\n0,6,0,0,8,5,0,4,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,11,7,0,0,11,\n0,0,0,0,0,9,5,0,4,0,0,0,0,9,7,8,6,0,0,0,0,0,0,10,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,\n0,7,0,0,0,0,0,0,0,0,0,0,0,4,10,6,0,7,0,0,0,0,0,0,0,5,0,0,0,0,0,0,10,7,10,0,0,0,\n0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,7,0,6,8,7,12,4,0,0,0,0,0,0,0,5,14,\n0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,\n6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,0,20,4,0,0,0,7,0,6,0,0,0,0,0,0,0,0,8,0,\n0,6,15,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,12,0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,5,0,0,0,0,0,0,8,6,0,0,18,0,0,0,10,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,9,6,0,\n6,0,0,0,0,0,0,0,0,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,9,0,9,0,0,4,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,9,5,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,10,0,0,0,0,7,0,0,0,0,0,0,0,0,0,7,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,0,8,0,0,0,16,0,0,0,0,0,0,0,\n0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,8,0,0,0,11,0,0,0,0,0,0,0,0,0,0,\n6,0,0,0,0,11,0,0,0,9,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,7,0,7,0,6,\n0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,\n0,0,0,0,0,0,0,6,0,0,18,0,8,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,7,0,4,0,0,0,\n0,0,0,0,0,0,0,8,0,0,0,0,0,16,0,0,0,0,0,16,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,18,0,0,0,0,0,0,0,0,0,9,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,4,0,\n0,0,0,0,0,0,0,9,4,0,0,0,0,12,5,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,12,5,0,0,0,0,0,0,0,5,0,0,10,6,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,9,0,0,0,11,0,0,6,0,6,0,0,\n0,7,0,0,0,0,0,0,8,0,0,0,0,6,0,0,0,0,0,0,19,0,0,0,12,0,9,0,0,0,0,0,10,7,0,0,0,0,\n0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,16,7,12,\n0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,6,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,10,5,0,0,0,0,0,0,0,4,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,7,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,0,4,0,0,9,0,0,0,8,0,12,4,0,0,0,0,\n0,4,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,5,0,\n0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,0,8,6,0,6,0,0,0,0,0,0,\n0,4,0,0,0,0,0,6,0,0,9,0,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,10,6,0,0,0,0,8,\n6,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,7,0,6,\n10,7,0,0,10,5,11,6,0,0,0,0,0,7,16,0,0,0,0,6,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,5,0,0,0,7,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,\n0,0,0,0,0,8,7,0,0,0,0,11,6,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n8,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,12,7,0,7,0,0,0,\n0,0,0,0,6,0,0,0,0,9,0,0,0,23,0,0,0,0,0,10,5,0,0,0,0,0,0,0,0,0,4,0,0,11,7,10,0,0,\n0,0,0,0,0,0,0,0,0,0,6,0,0,8,7,0,7,0,0,8,7,8,0,0,0,0,0,0,0,0,0,0,0,14,5,0,0,0,0,\n0,0,0,0,18,6,8,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,11,0,0,0,9,7,12,6,0,0,0,0,0,0,0,0,\n0,0,12,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,7,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,6,8,7,0,0,0,6,10,0,0,0,9,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,6,\n10,7,0,0,0,7,0,0,8,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,19,0,0,0,0,0,0,\n0,0,0,8,7,8,6,0,0,11,7,10,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,4,8,7,0,0,0,0,0,0,0,0,\n0,5,0,0,13,0,0,0,0,5,0,0,9,7,0,0,0,0,0,0,0,4,0,0,11,0,0,7,0,0,0,0,0,0,0,0,0,6,0,\n0,0,0,0,0,12,7,19,0,8,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,10,6,8,0,0,0,0,0,0,0,0,0,0,\n6,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,7,0,0,12,0,0,0,0,6,9,6,\n14,0,0,0,0,0,0,6,0,5,0,0,8,7,0,0,0,6,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,4,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,5,0,\n7,0,0,10,0,9,7,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,12,6,0,0,0,0,0,5,0,6,0,0,0,0,\n0,0,0,0,0,0,0,6,0,0,0,0,9,7,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,0,0,0,11,7,0,0,13,7,\n0,0,0,0,0,0,0,0,12,0,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,6,11,5,0,5,13,0,8,0,\n0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,11,5,\n9,6,0,0,0,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,10,0,0,0,8,5,0,0,9,0,0,0,8,7,9,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,0,\n0,11,0,13,6,0,0,9,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,\n0,0,0,0,0,5,21,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24,5,0,0,0,0,0,0,0,0,10,0,8,0,\n0,6,0,0,0,4,0,0,9,0,0,0,0,0,0,0,0,0,0,4,0,0,8,6,0,6,0,7,10,0,8,4,0,4,0,0,0,0,0,\n5,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,6,12,0,0,7,0,0,0,5,0,0,\n0,0,0,0,0,0,0,6,0,0,8,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n15,7,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,24,7,0,0,0,0,0,0,0,0,0,\n7,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,\n0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,4,12,0,0,7,0,0,0,0,0,5,0,0,0,0,0,0,0,0,15,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,8,0,0,0,\n0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,9,0,9,6,\n0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,8,4,0,7,0,0,0,0,0,0,0,0,\n22,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,4,0,7,0,0,21,7,0,7,9,6,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,8,0,0,6,\n0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,23,0,0,0,0,7,0,0,0,\n4,0,0,0,0,0,0,0,0,9,4,11,7,0,5,0,0,0,0,11,0,0,4,20,0,0,0,0,0,0,0,0,0,0,0,11,5,0,\n7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n21,0,0,0,0,0,0,7,0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,11,6,0,0,0,0,0,0,0,0,9,6,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,5,0,4,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,\n0,0,0,10,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,7,0,0,11,7,0,0,0,0,0,0,0,4,\n0,4,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,8,7,0,\n0,0,0,0,0,0,0,0,6,0,0,21,6,0,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,14,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,8,0,0,7,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,\n0,0,0,8,7,0,0,11,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,7,13,7,10,4,0,\n0,0,6,0,0,0,0,0,0,0,0,0,5,10,0,0,0,0,0,0,5,0,0,0,7,0,0,0,0,0,0,8,4,0,0,0,0,0,6,\n0,0,0,0,0,0,0,0,0,0,12,7,0,6,0,0,10,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,\n0,0,0,0,7,0,0,8,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,10,5,0,6,0,0,0,0,0,4,0,0,0,0,\n0,0,0,0,0,4,0,0,0,0,9,0,11,4,0,0,0,6,0,0,0,5,12,7,0,5,0,0,0,0,0,4,0,0,0,7,0,0,0,\n0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,13,6,10,0,0,0,17,0,0,4,0,0,0,0,0,6,0,4,0,5,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,11,7,0,0,0,7,0,0,0,6,0,0,0,0,0,0,\n0,6,0,4,0,0,0,0,8,0,0,0,0,5,0,0,0,0,0,4,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,9,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,0,0,\n0,0,7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,16,4,0,0,11,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n8,7,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,8,6,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,\n7,0,0,0,0,0,0,9,0,0,0,0,0,0,0,12,5,10,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,\n5,18,7,0,0,14,0,0,0,0,0,0,0,9,4,0,7,0,0,0,0,0,0,0,5,0,0,0,6,0,0,0,6,0,0,0,0,0,0,\n8,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,7,0,0,0,0,0,0,11,0,0,0,\n10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,14,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n11,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,14,6,0,0,0,0,11,4,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,10,7,0,6,0,0,9,0,9,5,0,0,0,0,0,\n0,0,0,10,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,8,5,0,0,0,0,0,0,0,0,0,0,11,4,0,6,\n0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,12,4,0,6,8,6,0,0,0,0,0,0,0,0,0,0,8,0,0,5,0,0,0,0,0,0,0,7,0,0,13,0,0,0,0,0,0,0,\n0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,12,7,0,6,0,0,0,\n0,0,0,0,0,0,0,0,0,13,4,0,7,0,0,0,7,0,7,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,0,0,0,0,\n9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,10,6,21,5,0,0,0,0,8,0,0,0,0,4,0,\n7,0,0,0,0,0,0,11,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,4,0,0,0,0,0,0,\n0,7,9,6,11,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,7,10,0,0,0,0,0,0,6,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,19,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,9,4,10,4,0,7,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,9,7,9,7,10,4,0,7,0,0,0,0,0,0,0,6,12,0,\n0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,20,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,\n0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,8,0,\n0,0,0,0,0,5,0,0,8,7,0,0,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,\n0,0,0,0,4,0,0,8,0,0,6,0,0,0,7,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,7,9,7,0,0,0,4,8,0,0,0,0,6,11,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,10,0,0,0,0,0,0,0,13,4,0,0,\n12,6,0,6,0,0,0,0,8,7,0,7,0,0,0,0,0,6,0,0,0,0,0,0,12,6,0,4,0,0,0,0,0,0,0,0,0,0,9,\n7,22,0,0,0,0,4,0,0,0,0,0,6,0,0,0,4,0,0,9,0,0,6,0,0,24,7,0,7,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,10,6,0,5,0,0,0,0,0,0,0,7,0,0,8,0,0,0,0,0,0,0,10,5,0,0,0,0,0,0,0,0,0,7,0,\n7,0,0,0,0,0,0,13,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,\n0,0,0,0,0,7,12,0,9,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,8,0,0,0,0,0,0,0,0,4,0,0,0,7,0,\n0,0,0,8,7,0,0,0,0,0,0,0,0,0,4,18,0,0,0,0,0,10,0,0,5,0,0,11,0,0,0,0,0,0,5,0,6,0,\n0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,\n4,0,0,0,0,0,0,10,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,\n0,0,0,5,8,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,20,7,0,0,0,0,0,0,0,0,0,0,0,4,9,0,12,\n6,8,0,14,7,0,5,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,10,0,0,\n0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,9,6,0,7,12,0,0,0,0,4,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,\n0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,4,0,0,9,0,\n12,6,0,5,0,0,0,6,0,4,0,6,0,0,0,0,0,0,0,0,10,7,0,0,0,0,0,0,8,0,0,0,0,4,0,0,0,0,\n10,0,0,0,0,0,0,0,8,6,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,0,0,0,0,\n6,0,0,12,6,20,5,0,0,0,0,0,0,0,0,0,0,0,0,9,5,0,5,0,0,0,6,13,7,0,0,0,0,15,6,0,0,0,\n6,0,0,13,7,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,5,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,\n10,6,0,0,0,0,0,6,0,0,0,0,9,0,0,0,0,0,19,6,0,0,0,0,0,0,0,0,0,0,13,0,11,0,0,0,0,0,\n0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,0,10,0,0,6,0,0,0,0,8,0,0,\n0,9,0,15,4,0,6,0,0,0,0,0,6,12,0,0,0,0,0,0,0,14,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,\n0,0,0,0,0,8,7,0,0,0,0,0,6,10,0,0,0,0,0,0,0,0,7,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,7,10,5,0,0,0,0,8,0,0,0,0,4,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,6,12,0,0,0,10,7,0,5,0,6,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,6,0,4,0,0,0,0,0,7,0,0,0,0,0,0,0,4,9,6,0,0,0,7,0,0,0,0,0,0,0,0,8,6,0,0,\n0,0,0,0,0,4,12,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,7,0,\n0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,12,6,0,6,9,4,0,0,8,4,0,6,\n0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,8,0,0,6,13,4,0,5,8,0,0,0,0,0,0,0,8,0,0,0,10,5,0,0,9,0,0,0,0,0,0,6,0,0,\n24,0,0,0,0,0,0,0,8,0,0,7,0,0,12,0,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,\n6,8,0,10,0,9,7,0,0,0,5,0,0,0,0,0,0,0,4,8,5,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,0,4,0,0,0,0,0,6,0,0,0,0,0,5,0,0,0,0,8,0,0,\n0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,10,4,0,0,0,0,0,0,0,6,0,0,0,4,20,0,0,7,\n10,6,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,9,6,0,0,0,0,0,0,0,4,\n12,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,9,4,0,5,0,0,\n0,0,0,0,0,6,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,6,9,0,0,0,0,7,0,0,0,0,0,6,0,5,0,0,0,0,0,0,0,0,9,0,0,0,\n0,6,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,17,7,0,0,13,6,14,6,0,0,0,0,\n8,0,0,0,0,0,0,7,12,7,8,7,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,4,0,0,0,0,0,4,0,\n0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,12,4,0,0,10,7,0,0,0,\n0,0,0,10,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,12,0,0,6,\n0,0,0,0,0,0,0,0,8,7,12,0,0,0,0,0,0,6,0,6,0,4,0,0,18,6,0,0,0,6,0,0,0,0,0,6,10,6,\n0,0,0,0,0,0,8,7,14,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,\n0,0,0,8,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,8,7,0,0,10,5,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,\n0,0,9,4,8,0,0,0,0,0,0,4,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,0,0,0,\n0,6,0,0,9,7,0,0,0,0,0,5,0,0,0,0,8,7,0,0,14,0,0,0,0,6,0,0,0,0,0,0,9,6,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,5,0,7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,\n0,0,0,6,0,0,0,6,0,4,0,0,0,0,0,4,0,0,0,0,12,0,0,7,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,\n0,12,0,16,6,0,0,0,0,0,0,11,7,0,4,8,7,0,0,0,0,0,6,0,0,0,0,16,0,0,0,0,6,0,0,0,0,0,\n0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,10,7,0,0,0,0,0,0,12,7,0,0,0,0,0,0,0,0,0,0,\n0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,13,4,0,0,10,0,0,0,0,0,0,0,0,0,19,0,0,0,\n0,0,0,0,0,0,0,0,0,0,8,6,22,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,\n5,0,0,0,0,0,5,0,0,0,0,0,5,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n4,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,0,18,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,14,7,0,0,11,5,0,0,0,5,0,0,0,0,12,5,0,0,0,0,0,0,0,0,0,0,24,6,0,0,\n0,7,0,4,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,7,0,4,0,0,0,0,8,7,0,0,\n9,6,0,0,14,5,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,12,6,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,7,0,0,0,5,0,0,\n0,0,12,7,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,6,0,0,13,7,0,0,0,0,0,0,14,0,11,4,0,\n0,0,4,0,0,0,0,14,5,0,0,0,0,0,5,11,5,0,0,0,0,22,5,0,0,0,0,0,7,0,0,0,0,0,4,0,0,0,\n4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,17,0,10,0,0,0,8,0,0,0,19,\n5,18,7,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,10,6,0,6,0,0,0,0,10,4,0,4,0,\n0,0,0,0,0,14,7,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,0,9,6,12,0,0,6,0,0,0,0,0,0,0,0,\n12,0,10,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,4,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,5,13,0,9,7,0,0,0,0,0,0,0,0,0,0,0,7,9,7,0,0,8,0,0,0,0,0,\n22,0,0,0,0,0,0,0,23,6,14,0,0,0,0,0,0,7,0,0,0,0,11,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,\n0,0,10,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,8,5,0,0,0,0,0,0,0,0,0,7,11,6,21,0,0,0,0,0,\n0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,\n0,0,0,0,0,0,0,4,9,7,0,0,0,0,0,0,12,0,0,0,0,7,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,9,\n0,0,0,20,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,11,7,0,0,0,0,0,0,0,6,15,0,0,\n0,0,0,0,0,0,0,0,0,0,0,12,4,0,5,0,0,0,0,0,0,11,7,17,6,0,0,0,0,0,0,15,6,0,7,0,0,0,\n0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,6,0,5,\n0,0,11,0,11,7,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,\n17,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,8,7,9,6,0,0,14,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,\n8,7,0,4,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,\n0,0,0,5,0,4,0,0,8,7,0,6,12,5,0,7,18,7,0,0,8,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,\n10,0,11,0,0,0,0,0,0,0,0,0,0,0,9,0,0,4,0,6,0,7,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,\n7,0,0,0,0,8,0,0,0,15,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,0,0,\n0,0,6,0,0,0,0,23,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,5,0,0,0,0,0,0,8,6,0,0,\n0,0,0,0,12,7,9,7,0,0,10,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,9,0,8,7,0,0,0,\n6,0,6,0,4,0,5,0,0,0,0,0,5,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,7,10,5,0,0,11,6,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,4,9,7,0,\n0,0,0,11,7,0,0,0,0,0,5,0,0,0,7,0,0,0,0,23,6,11,4,0,0,0,0,0,0,9,0,0,0,10,6,0,0,0,\n0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,10,6,0,0,0,7,0,0,\n0,0,0,0,0,0,0,0,20,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,\n6,11,7,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,6,0,0,0,5,0,6,0,6,0,0,0,0,0,0,0,0,0,0,\n0,6,0,0,0,0,8,7,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,4,10,0,8,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,10,6,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,\n0,0,0,0,0,0,10,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,11,6,0,4,0,0,14,5,0,7,0,0,0,0,0,6,16,0,0,0,0,0,0,0,10,0,0,7,15,0,0,0,11,7,0,0,\n0,0,0,0,0,0,0,0,8,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,5,0,0,0,\n0,8,0,0,6,0,0,0,0,0,0,9,5,0,0,23,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,6,0,\n0,0,0,0,0,0,7,0,0,0,0,15,7,0,0,0,0,8,0,0,0,14,0,0,0,0,0,0,0,16,7,0,0,0,0,0,7,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,12,6,11,7,\n9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,\n7,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,12,0,10,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,8,0,0,5,8,7,10,6,0,0,0,7,0,0,0,0,12,6,\n0,0,9,0,0,0,12,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,10,0,0,0,10,5,0,0,0,0,0,0,9,6,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,6,0,0,9,5,0,4,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,9,0,0,5,0,0,8,7,8,\n6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,10,0,9,4,0,0,0,0,0,0,0,6,\n11,0,0,0,0,0,0,0,0,0,0,0,8,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,8,7,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,\n0,0,0,10,0,0,0,8,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,\n0,0,8,4,0,5,0,0,0,0,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,22,0,0,0,0,0,0,0,8,5,0,0,0,\n0,0,0,0,7,0,0,0,6,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,0,6,0,7,0,0,0,0,\n20,0,0,0,0,0,0,0,0,0,0,7,9,0,0,0,0,0,0,6,0,6,0,7,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,\n0,0,0,14,7,0,0,0,5,0,0,22,4,10,0,0,0,0,0,0,4,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,11,5,13,0,0,0,0,0,0,0,0,0,8,0,0,7,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,0,10,7,0,\n0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,7,0,7,14,6,0,0,0,0,9,5,\n0,0,0,0,0,6,0,0,0,5,10,0,8,6,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,6,0,0,8,4,0,6,0,\n0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,\n14,0,0,5,0,0,18,0,8,4,0,6,0,0,20,0,13,0,0,0,0,7,0,4,0,0,0,0,0,4,8,4,0,0,0,0,0,6,\n0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,4,0,0,0,0,0,0,0,0,14,0,0,0,0,0,9,7,0,0,9,0,0,0,0,\n0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,20,0,14,0,0,4,0,6,8,5,0,0,0,0,0,7,0,0,0,0,0,0,\n0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,10,4,12,7,0,6,0,0,9,7,10,5,\n0,0,8,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,0,18,0,0,0,14,7,0,0,0,0,0,4,\n0,0,0,0,0,0,17,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,4,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,\n0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,8,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,5,0,7,0,0,0,0,0,\n7,0,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,8,5,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,5,0,\n0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,23,0,0,7,0,0,0,0,0,0,\n0,0,0,0,0,0,0,4,0,0,0,0,0,0,12,7,8,4,0,0,0,0,0,0,0,0,0,6,0,0,9,5,0,0,0,7,0,0,0,\n0,0,0,0,0,0,4,10,0,0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,5,0,0,18,7,\n0,0,8,0,0,5,0,0,10,0,0,0,0,0,0,6,0,0,0,0,0,5,0,7,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,\n6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,6,0,0,10,0,0,5,10,4,0,0,12,0,0,0,0,\n6,22,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,7,0,5,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,6,0,7,0,0,0,6,0,6,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,7,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,\n0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,16,6,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,12,7,0,0,0,0,9,0,0,0,0,6,0,0,11,0,0,0,0,0,13,0,9,6,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,0,0,10,7,0,0,0,7,0,6,0,\n0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,11,0,15,0,22,7,0,4,0,6,0,0,0,0,0,7,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,\n18,0,0,0,0,0,0,0,0,0,14,0,0,4,0,0,0,0,8,7,9,0,0,0,0,0,9,0,0,0,14,0,0,0,0,0,0,0,\n0,0,11,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,7,0,0,0,6,0,6,0,0,0,0,8,0,0,0,0,\n0,11,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,9,4,0,0,0,0,0,4,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,8,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,\n0,0,0,0,0,0,8,6,0,0,9,5,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,5,0,\n0,10,6,9,0,0,0,0,6,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,\n11,7,12,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,4,0,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,\n0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,5,0,0,10,6,\n0,0,0,4,0,7,13,0,0,4,0,0,11,4,0,6,0,0,0,0,0,6,8,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,5,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20,5,0,0,0,0,12,6,0,0,0,0,\n11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,11,5,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,\n7,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,6,17,0,9,0,10,6,0,6,12,0,0,4,0,0,0,\n0,0,0,0,0,0,0,8,5,12,7,0,4,0,0,0,0,0,0,0,0,0,0,11,0,9,0,10,6,11,5,0,7,0,0,8,0,0,\n7,0,4,0,0,0,7,0,0,0,0,0,0,8,6,0,0,0,6,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,6,0,\n0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,11,0,0,0,0,6,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,10,0,0,0,0,0,8,6,0,0,0,0,0,6,12,0,0,0,0,0,\n0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,6,0,0,16,0,11,5,0,0,0,0,0,\n0,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,9,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,6,10,\n7,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,0,9,5,0,0,0,0,8,0,9,0,0,\n0,0,0,0,0,0,7,10,0,13,0,0,6,0,0,0,0,0,0,0,0,0,6,9,4,0,0,0,0,0,0,10,0,0,0,0,0,10,\n0,0,0,0,0,0,0,10,6,11,0,0,0,0,0,9,0,0,0,0,0,0,4,0,0,0,0,0,0,10,5,0,0,0,0,0,6,0,\n0,0,0,0,0,18,4,0,7,0,0,0,0,0,0,24,0,8,6,0,7,0,0,0,0,15,0,0,0,0,0,0,0,0,0,0,0,0,\n0,8,5,0,0,0,0,10,7,0,6,0,0,0,0,0,0,0,0,8,5,10,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,\n6,0,0,8,7,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,4,0,5,15,0,0,0,0,7,0,7,0,0,0,0,\n0,0,0,0,0,6,10,5,0,0,0,6,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,12,0,0,0,0,0,0,0,0,\n0,0,5,0,0,0,0,0,0,14,4,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,11,0,10,4,9,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,7,0,0,0,\n0,0,0,0,0,0,0,0,7,13,7,0,0,0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,\n0,0,0,0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,8,0,10,6,0,4,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,\n0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,9,7,0,0,0,0,0,6,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,0,6,0,0,0,\n0,0,0,0,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,0,0,5,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,11,0,0,0,0,6,0,0,0,0,0,0,0,6,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,22,0,0,\n6,0,0,0,0,0,0,0,6,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,\n0,0,0,0,0,0,0,6,0,6,0,0,0,5,0,0,0,0,0,0,0,5,0,0,10,0,11,5,0,0,0,0,0,0,14,7,9,7,\n0,6,0,0,0,0,0,4,0,0,0,0,0,0,11,7,0,6,0,0,0,0,0,0,9,7,0,4,0,0,0,7,0,0,0,0,0,5,0,\n0,0,0,0,5,0,0,0,7,0,0,0,0,0,5,0,0,0,0,17,5,0,0,8,0,0,0,0,6,9,4,0,0,0,0,0,0,0,0,\n8,7,11,7,9,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,6,9,5,0,0,8,6,0,0,0,5,0,\n0,0,0,9,0,0,0,9,6,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,\n0,0,0,0,4,0,0,0,0,10,0,0,0,0,0,0,0,0,4,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,4,0,0,0,5,0,0,0,0,0,7,0,0,0,0,0,7,13,5,0,0,0,7,0,0,0,0,0,7,9,6,11,7,0,7,0,0,0,\n0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,8,5,0,0,0,5,9,4,0,0,0,0,0,0,0,0,8,4,0,0,0,0,\n24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,\n0,0,0,0,6,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,5,11,6,0,4,0,7,20,0,8,5,9,5,9,0,0,6,\n0,0,0,0,0,0,0,0,0,0,0,7,23,5,0,0,8,4,0,0,10,0,0,6,0,5,0,0,0,0,0,0,0,0,0,0,0,7,0,\n0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,9,0,0,0,\n10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,\n6,0,0,0,0,14,0,18,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,9,6,0,4,0,0,0,0,0,0,8,4,\n11,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,0,0,0,12,0,10,7,0,0,10,0,0,0,0,\n0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,6,0,0,0,0,8,\n6,10,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,4,0,6,0,4,0,0,0,0,0,5,0,0,\n0,0,0,0,0,0,0,7,0,0,0,7,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,17,7,11,0,0,0,0,0,0,0,0,0,0,4,12,6,0,0,0,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,\n0,5,12,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,6,0,0,20,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,4,\n0,0,0,5,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,6,0,4,13,0,0,7,0,0,0,0,0,0,\n0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,12,6,0,7,0,0,0,0,10,0,23,6,0,0,\n0,4,0,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n10,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,11,0,9,7,0,0,\n0,0,0,0,0,0,0,0,9,7,0,4,0,0,0,0,8,7,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,\n0,0,0,0,0,6,0,0,10,7,10,5,0,0,8,0,8,0,0,0,0,0,0,4,0,5,10,0,0,0,0,0,0,0,9,0,0,6,\n0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,11,7,0,0,0,0,0,0,0,0,9,4,0,0,0,0,0,6,0,0,8,\n7,0,0,0,0,0,5,0,0,0,0,0,0,0,0,10,0,0,0,0,5,0,4,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,24,7,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,6,0,0,9,0,0,0,0,0,0,7,0,6,13,0,8,\n0,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,6,0,0,0,0,8,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,\n4,0,0,0,0,0,4,0,0,0,0,0,0,0,6,8,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,4,0,4,0,0,0,5,0,7,0,0,10,0,10,7,0,0,12,5,0,0,9,0,0,0,10,0,\n0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,\n12,0,0,0,0,0,8,5,13,6,0,0,0,0,0,0,9,4,0,0,0,0,8,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,\n0,0,6,0,0,14,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,17,6,0,0,0,0,12,6,0,0,0,0,8,0,0,7,0,\n7,0,4,9,0,0,6,0,0,0,6,0,0,0,0,0,0,8,7,0,0,0,0,0,0,11,0,0,4,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,18,7,0,4,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,6,0,0,0,0,0,\n0,0,0,12,5,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,8,0,11,7,0,0,0,0,0,0,0,0,0,4,0,0,0,0,\n11,0,0,0,0,0,0,0,21,0,0,6,10,0,0,0,0,0,9,0,10,0,0,0,0,0,11,0,0,0,0,6,0,0,0,0,0,\n5,0,0,0,0,0,0,10,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,4,0,0,23,7,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,9,7,0,0,0,7,\n0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,6,0,0,\n11,6,0,0,0,0,0,0,0,6,0,0,0,0,10,7,0,0,9,4,0,0,11,0,8,5,0,0,0,7,8,5,22,0,0,0,9,6,\n0,0,0,0,0,0,0,6,10,4,0,0,0,0,0,7,9,4,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,\n0,0,0,11,6,0,0,0,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,7,0,0,0,0,0,0,0,6,0,6,0,4,0,0,\n0,0,0,0,0,7,0,7,0,4,13,0,0,0,0,0,8,0,0,0,0,7,0,0,0,0,0,0,11,6,0,7,0,0,0,0,9,0,0,\n0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,4,8,0,0,0,0,0,8,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,6,0,0,0,0,13,5,8,0,0,\n0,0,0,0,0,14,0,0,6,0,0,0,0,0,0,0,0,0,7,0,0,17,6,0,0,0,0,13,4,0,0,9,6,0,0,10,5,0,\n0,10,5,0,0,0,0,13,0,0,0,0,6,0,0,0,0,0,0,10,0,12,0,0,0,0,0,0,0,0,0,0,0,8,4,0,4,0,\n0,0,4,0,0,0,0,0,4,0,0,12,0,0,5,9,4,0,0,0,0,0,0,0,0,0,5,8,5,0,0,0,7,0,0,0,0,8,7,\n0,0,0,6,12,5,0,0,0,5,0,0,0,5,0,0,0,0,0,4,12,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,7,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,\n0,9,6,0,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,4,11,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,\n0,0,0,0,12,7,0,0,0,7,10,7,0,0,11,0,0,0,0,0,0,0,0,0,11,7,0,0,0,6,0,0,11,0,0,0,0,\n0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,22,0,10,7,0,0,8,5,0,0,0,0,0,5,0,0,0,0,0,0,\n0,0,0,0,9,6,8,7,0,6,0,0,0,0,0,5,0,0,0,0,0,0,8,7,0,0,0,0,9,7,0,0,0,6,0,0,8,7,0,0,\n0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,4,0,5,0,0,0,4,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,6,0,0,0,0,0,0,0,4,0,0,0,0,0,0,9,\n6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,5,0,0,0,0,14,0,0,0,\n9,0,0,0,0,0,0,0,0,0,9,7,12,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,12,0,0,0,0,0,12,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,10,7,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,6,0,0,0,0,0,0,9,6,0,0,0,0,0,6,0,0,0,0,0,\n0,0,0,0,0,9,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,\n0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,6,0,7,12,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,\n0,7,0,0,8,6,0,0,0,0,10,7,0,0,0,0,0,0,0,6,0,0,0,0,0,6,12,0,0,0,0,0,0,0,0,6,0,0,0,\n0,0,6,0,0,0,6,0,0,0,0,0,6,16,0,0,0,0,0,0,0,0,0,9,0,17,0,14,7,8,0,0,0,0,0,0,6,0,\n0,0,0,0,0,0,0,0,0,11,0,0,6,8,7,0,6,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,0,0,\n9,0,0,0,0,7,0,0,0,0,11,5,0,4,9,6,8,0,0,0,0,0,0,0,0,0,10,0,11,7,0,0,0,0,0,0,0,0,\n9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,\n0,0,0,12,0,0,0,0,0,10,5,0,4,0,0,0,0,0,7,10,6,11,6,0,0,0,0,0,0,0,0,0,0,0,0,17,0,\n0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,8,0,0,4,0,0,0,6,0,0,0,\n0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,4,0,0,0,0,9,6,0,0,0,4,0,0,0,0,0,4,10,7,0,7,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,\n0,0,0,0,0,0,6,0,0,0,6,0,6,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,18,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,13,0,0,0,0,0,10,0,0,0,0,0,0,0,0,4,\n0,0,0,6,0,0,0,0,0,4,8,0,0,0,11,7,0,0,0,4,0,0,0,0,0,7,0,0,8,5,0,0,16,0,0,0,13,6,\n0,0,0,0,0,0,0,6,0,0,0,0,20,0,11,6,0,0,8,7,0,0,0,0,0,6,17,0,8,0,0,0,0,0,8,7,0,0,\n9,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,\n0,0,4,0,7,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,8,\n0,8,0,0,0,0,0,0,0,11,0,8,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,6,0,0,9,0,\n0,0,0,0,8,0,0,0,0,0,18,0,0,0,0,0,0,4,9,0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,9,6,0,0,0,0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,8,7,0,0,0,0,0,0,0,0,\n0,4,0,0,0,0,0,0,14,0,0,0,0,7,0,6,0,0,8,0,20,7,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,8,0,0,0,14,0,0,0,0,0,0,0,8,0,0,7,0,6,0,0,0,7,0,0,0,0,0,0,0,0,\n0,0,0,4,12,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,10,6,0,\n5,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,\n0,0,0,5,8,4,0,0,0,0,0,0,0,4,0,0,0,7,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,12,7,0,\n0,0,0,13,6,0,0,0,7,0,0,8,0,0,0,8,0,0,0,0,0,0,0,0,0,0,5,0,0,0,7,0,0,0,0,0,0,11,5,\n0,6,0,0,8,5,0,7,0,0,0,0,0,0,0,7,0,0,0,0,8,6,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,4,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n14,0,10,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,19,0,0,4,0,0,0,7,\n0,0,11,5,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,16,0,10,5,18,0,0,7,9,6,0,5,0,0,0,0,0,\n0,0,0,0,5,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,5,0,0,0,7,0,6,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,4,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,23,0,0,0,0,5,0,0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,14,0,20,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,\n11,0,0,0,0,7,0,0,0,0,15,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,7,0,0,0,0,\n0,4,0,0,0,0,10,0,0,0,0,0,9,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,10,0,11,6,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,5,0,0,11,0,0,0,0,7,0,0,0,0,0,0,8,7,0,\n4,0,0,0,0,11,0,0,0,0,0,11,0,0,5,0,0,8,7,0,4,0,7,0,0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,10,5,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,6,0,5,0,0,0,0,0,0,0,\n0,0,4,11,5,10,7,0,7,0,0,9,6,9,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,9,4,0,4,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,8,6,0,0,0,0,11,7,0,0,0,0,0,0,0,0,0,0,11,7,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,8,5,0,0,8,0,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,\n10,7,0,0,0,6,0,0,0,0,0,0,8,0,0,6,0,0,0,6,10,0,0,0,0,0,0,0,0,0,0,0,8,5,0,0,0,6,0,\n0,0,6,0,0,0,0,9,5,8,5,8,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,\n0,8,7,10,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,0,5,0,0,0,6,0,7,0,0,\n10,5,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,11,0,0,0,0,0,13,4,\n0,0,0,4,0,0,0,0,0,5,8,0,0,0,12,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,7,14,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,7,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,4,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,5,0,0,15,6,10,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,14,6,10,0,0,0,0,0,0,0,0,6,0,\n0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,6,0,5,11,4,0,6,0,0,0,7,0,0,0,0,\n0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,5,0,0,8,5,0,0,0,0,0,0,0,0,0,0,\n0,0,10,0,0,0,0,0,9,6,9,4,0,0,0,4,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,8,5,0,\n0,0,0,0,0,0,0,0,0,0,4,0,0,11,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,\n0,0,0,7,12,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,\n4,9,6,0,4,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,6,0,\n7,8,6,0,0,0,0,0,0,0,4,0,0,9,6,0,0,0,0,0,0,0,0,0,6,0,5,0,4,0,0,0,0,0,0,0,5,0,0,0,\n0,0,5,0,0,0,7,12,7,0,0,0,0,0,0,18,4,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,6,0,0,0,\n0,12,0,0,7,0,0,0,0,0,7,0,0,13,0,0,6,0,0,0,0,8,7,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,7,10,5,0,0,8,0,0,0,0,0,0,0,8,6,0,7,0,0,8,4,0,4,0,0,0,0,10,4,0,0,14,0,\n0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,17,0,0,0,0,0,0,6,0,0,0,0,8,6,0,0,10,5,0,0,0,0,8,\n6,0,0,0,6,0,0,0,7,0,0,0,0,0,6,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,12,0,0,0,0,6,\n8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,\n0,0,0,6,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,4,24,0,0,\n0,0,0,12,6,0,0,10,6,0,5,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,17,7,0,5,0,0,0,\n0,0,0,0,0,0,0,0,0,0,6,11,5,9,0,8,7,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,10,7,0,0,0,0,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,5,8,7,0,0,0,\n0,8,5,0,0,0,0,10,7,0,7,0,0,0,0,0,0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,6,0,4,0,0,0,0,\n0,6,12,0,8,7,0,0,0,0,0,0,0,0,0,0,16,0,10,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,22,0,0,0,\n0,0,0,0,0,0,0,0,0,0,13,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,22,0,0,6,0,0,21,0,0,0,22,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n6,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,7,8,0,0,0,0,6,14,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,6,0,0,0,0,0,0,\n0,0,0,0,0,6,0,0,0,0,8,5,0,0,11,7,0,6,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,\n6,0,0,0,5,0,0,0,0,0,0,0,0,0,4,0,0,8,7,0,0,0,0,8,5,11,7,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,4,0,0,0,0,8,5,0,0,10,0,0,4,13,7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,0,0,13,6,\n0,6,0,7,0,0,8,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,15,0,0,0,10,7,0,0,0,0,0,\n7,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,19,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,6,0,5,\n0,7,0,0,0,0,0,0,0,0,0,6,0,0,11,4,0,0,0,6,0,0,13,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,8,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,12,6,0,0,0,0,\n0,7,0,0,0,0,0,0,11,7,0,0,0,0,0,6,0,0,10,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,5,11,6,\n0,0,0,0,0,0,0,0,10,0,0,0,0,6,0,0,0,0,0,0,8,7,0,0,0,5,0,0,0,5,0,0,0,0,0,0,0,0,0,\n0,0,0,8,7,0,0,0,0,9,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,10,0,\n0,6,0,0,13,0,0,0,0,0,0,0,9,6,0,0,8,6,8,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,0,\n0,9,7,0,0,0,0,0,0,11,0,0,0,10,7,0,0,0,0,0,0,0,0,9,6,0,0,12,4,0,4,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,6,0,0,0,0,21,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,5,0,0,\n9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,\n16,0,0,4,0,0,0,0,0,7,0,0,0,6,0,6,0,0,11,0,0,0,0,5,0,0,0,0,0,0,0,4,8,5,0,0,0,0,0,\n0,14,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,\n0,0,8,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,\n0,0,0,0,6,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,14,7,0,0,9,7,0,0,11,0,0,0,0,0,10,\n4,11,5,13,6,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,5,0,0,0,0,0,4,0,0,9,0,0,0,0,\n0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,6,12,5,0,0,0,6,14,0,0,0,0,0,0,0,0,0,0,4,9,4,\n0,0,0,0,0,5,0,0,0,0,0,0,0,4,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,5,0,0,\n0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,11,6,0,0,13,7,0,0,13,6,0,7,0,0,0,0,0,0,8,6,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,10,6,0,4,0,0,12,6,0,0,0,0,0,0,0,0,10,6,\n0,0,0,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,6,0,\n0,0,0,0,7,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,6,0,\n0,0,7,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,\n0,0,0,5,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,\n0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,8,7,0,0,8,5,0,0,0,4,9,5,0,0,0,7,10,6,0,0,\n0,0,0,0,9,7,0,0,8,5,8,0,8,4,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,\n0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,4,0,0,0,0,0,0,0,0,0,\n0,11,7,0,0,0,7,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,5,0,0,0,7,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,9,7,0,0,0,0,8,5,0,4,0,0,0,0,0,6,0,6,14,\n6,0,0,0,0,9,6,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,6,0,0,0,0,14,7,9,7,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,16,\n0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,14,0,\n0,6,0,0,8,6,0,0,0,0,0,6,0,0,12,0,0,0,0,0,8,5,0,7,11,0,0,5,0,4,0,0,0,6,0,0,0,0,0,\n0,0,0,0,0,0,0,9,6,0,4,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,10,5,0,0,0,0,\n0,4,0,0,0,7,11,6,0,4,8,5,9,5,0,0,0,5,0,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,8,5,14,7,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,16,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,9,6,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,9,0,0,0,12,5,0,0,0,0,0,0,0,4,10,5,0,0,0,0,0,0,0,0,0,0,0,6,0,\n0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,4,0,0,0,6,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,10,4,0,0,0,0,0,5,0,0,0,4,\n0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,8,0,10,7,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,10,7,0,0,0,0,0,0,0,0,15,0,0,0,\n0,0,0,0,0,0,0,7,0,0,0,0,0,7,10,7,9,7,0,0,0,7,0,0,8,0,0,0,0,0,0,0,9,0,0,0,8,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,8,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,7,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,15,7,12,6,0,0,0,7,0,5,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,5,0,0,0,0,\n0,0,0,6,9,5,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,9,7,0,0,14,0,0,0,11,7,0,0,0,0,0,\n0,0,0,0,0,0,4,0,0,11,7,0,0,0,0,8,0,0,0,0,0,0,6,8,7,0,0,0,7,10,4,0,0,0,0,0,0,0,0,\n0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,10,0,0,0,0,0,0,\n6,0,6,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,11,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,7,0,0,10,7,0,0,0,0,9,7,0,0,0,0,0,0,13,7,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,12,0,\n0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,9,6,0,0,11,0,0,\n0,0,0,14,4,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,23,7,0,0,\n0,0,0,6,0,7,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,0,20,\n7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,8,0,0,0,0,0,0,0,0,0,11,5,0,0,0,0,0,0,0,0,0,0,10,4,0,0,0,5,8,5,10,4,0,0,0,0,0,\n0,13,6,9,7,0,0,10,7,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,6,0,0,0,7,0,6,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,7,10,7,0,0,\n0,0,0,0,0,0,0,0,12,4,0,0,0,0,8,7,0,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,\n0,0,0,0,6,0,6,9,6,0,0,12,5,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,0,\n0,0,0,0,0,0,0,0,0,5,8,7,9,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,11,\n4,0,0,0,0,0,0,8,0,0,0,10,7,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,0,\n0,0,0,0,0,5,0,6,0,0,10,0,14,0,0,0,0,0,0,0,23,0,0,0,12,0,10,5,0,0,0,0,0,0,0,0,0,\n5,0,0,0,0,8,0,0,0,0,6,8,0,0,0,0,0,0,0,0,0,22,0,8,0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,\n0,0,0,0,0,6,18,4,0,0,0,7,10,6,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,\n0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,7,10,0,0,0,0,0,0,6,0,0,0,0,11,5,0,0,0,0,0,0,0,0,\n15,0,8,6,0,0,13,7,0,0,0,0,0,7,0,0,0,0,0,7,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,9,5,9,\n0,0,6,8,6,0,0,0,0,10,0,0,0,18,5,0,0,0,5,0,7,0,0,0,0,8,6,0,0,0,0,9,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,14,0,23,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,6,0,0,0,5,0,\n0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,8,5,0,0,0,0,0,0,0,0,9,0,0,0,0,4,0,0,0,0,0,0,0,0,\n0,0,0,0,20,5,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,9,5,0,0,0,0,0,0,8,4,24,0,0,0,0,0,0,\n0,0,0,0,0,0,0,9,7,0,0,0,0,10,5,0,0,8,5,0,0,0,0,0,0,0,0,12,7,0,6,0,0,10,6,0,0,0,\n0,14,0,0,4,9,5,0,0,0,0,0,0,9,0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,8,0,0,0,0,0,11,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,8,5,11,7,0,4,0,0,10,0,0,0,0,\n0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,11,6,0,0,0,0,0,5,14,6,0,0,0,0,10,0,0,\n0,13,4,0,0,0,0,0,0,0,0,0,0,0,6,0,0,10,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,7,12,0,10,6,0,0,0,0,0,0,10,0,0,0,0,0,10,0,9,\n7,0,0,0,0,0,0,0,0,0,0,0,0,0,7,8,0,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,0,9,7,0,0,0,\n0,0,0,0,0,0,0,0,0,24,0,11,7,0,7,0,0,0,0,0,0,8,6,0,0,0,0,0,0,8,7,0,0,0,0,0,5,0,0,\n0,6,9,0,0,0,23,5,0,0,0,0,0,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,7,0,0,0,\n0,0,0,0,0,0,0,0,0,0,6,0,0,18,4,0,0,11,7,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,\n0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,9,0,0,0,11,0,0,0,23,0,0,\n0,10,4,0,0,0,0,0,7,0,0,0,7,0,0,0,0,0,4,0,0,0,0,0,7,0,0,19,0,11,0,0,0,0,0,12,7,0,\n0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,5,0,0,0,0,0,5,0,0,0,0,0,5,0,0,0,0,0,0,0,6,0,0,\n9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,4,0,0,0,0,10,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,22,0,8,7,10,4,11,0,13,5,8,7,9,0,8,7,0,0,0,7,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,\n0,8,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,4,0,0,0,4,11,0,0,6,0,0,8,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,5,0,0,\n20,0,0,0,0,0,0,0,0,0,11,0,0,0,0,5,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,7,0,0,14,0,0,0,9,0,13,7,0,0,0,0,0,6,0,7,0,0,8,6,10,6,0,0,8,6,0,0,0,6,0,\n0,12,6,9,0,0,0,0,0,0,5,9,0,12,4,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,8,5,0,0,0,0,0,\n0,0,4,8,0,0,6,8,0,0,0,0,0,0,0,0,0,13,6,0,7,0,0,0,0,0,6,8,7,8,6,0,0,0,7,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,18,0,11,4,0,0,0,5,0,0,0,0,0,0,0,0,0,0,\n0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,14,\n6,0,0,0,0,12,7,8,0,0,0,0,0,0,0,8,7,0,0,0,0,10,4,0,0,0,0,0,0,10,0,0,6,0,0,0,0,0,\n0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,15,6,9,7,0,0,0,0,0,0,15,6,11,7,0,0,0,7,0,0,21,0,0,\n0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,17,6,0,0,10,5,0,5,0,0,0,0,0,0,0,0,0,7,\n0,0,10,0,0,0,0,0,0,0,0,4,11,5,0,0,0,0,16,7,0,0,0,0,0,6,0,0,8,7,0,4,0,0,10,0,0,0,\n0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,8,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,\n0,0,0,10,4,0,0,0,0,0,0,0,0,0,6,0,5,0,0,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,\n0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,6,10,7,0,0,0,0,0,0,0,0,8,4,0,0,10,0,0,0,0,4,0,6,0,6,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,7,17,0,0,0,0,0,\n0,0,0,0,0,0,10,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n6,0,0,0,5,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,5,0,4,0,0,0,0,0,6,0,0,0,0,0,0,10,5,0,0,\n0,5,0,0,0,0,9,0,19,7,0,0,0,0,0,7,0,0,0,0,10,6,0,0,0,6,0,5,0,0,0,0,0,0,0,0,0,6,8,\n0,0,0,0,0,11,0,0,0,0,0,0,6,0,0,0,0,0,7,9,0,15,0,0,0,0,0,0,0,0,0,0,4,0,0,0,5,0,0,\n0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,0,0,0,9,0,0,0,0,0,0,0,0,6,0,7,0,0,0,0,0,0,0,6,0,0,\n0,0,0,6,10,0,0,0,0,0,0,0,23,0,14,0,0,0,0,7,0,0,0,0,0,7,0,0,9,0,0,0,0,7,0,0,0,0,\n0,6,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,4,0,0,0,\n0,0,0,0,0,9,5,0,0,0,0,0,4,0,0,0,0,9,5,0,0,0,0,22,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,22,0,0,0,0,0,0,0,10,0,0,0,0,0,0,5,0,4,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,6,11,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,14,7,0,0,12,7,0,0,0,\n0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,8,6,10,0,0,0,0,0,0,0,0,0,10,7,8,5,0,0,0,0,0,0,\n0,0,8,4,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,5,0,0,9,5,0,0,0,0,0,5,0,0,0,0,0,4,0,0,0,\n0,0,0,0,0,0,0,12,4,11,0,0,0,9,0,11,7,0,0,0,0,0,0,10,6,0,0,0,6,0,0,0,0,15,5,0,0,\n11,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,4,0,4,0,6,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,8,0,0,0,19,7,0,4,0,0,9,0,0,0,0,0,10,0,\n0,6,0,0,13,0,12,6,0,0,0,0,0,0,0,0,10,7,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,13,7,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,4,9,0,0,0,10,0,0,0,0,0,0,0,\n0,5,0,0,0,0,0,0,10,0,23,6,0,0,0,6,8,0,0,0,0,0,0,0,0,0,17,7,0,0,0,0,11,6,22,5,0,\n0,9,6,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,5,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,4,11,0,9,4,0,0,\n0,7,0,7,0,0,0,0,0,0,12,4,0,0,0,0,0,0,0,0,0,0,0,0,11,4,0,0,0,0,0,0,0,0,0,0,0,0,0,\n4,0,0,11,5,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,8,6,0,0,0,4,0,0,0,0,\n0,0,0,0,0,7,0,0,0,4,0,0,10,4,0,0,0,0,0,0,0,7,0,7,0,0,0,6,0,0,0,0,8,6,0,6,0,6,0,\n0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,0,0,0,0,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,6,22,6,12,0,0,6,0,0,0,6,0,0,0,0,0,7,0,0,0,0,11,0,0,0,\n9,7,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,6,0,0,0,6,0,6,0,0,8,7,0,0,0,4,9,7,19,0,0,0,0,0,0,0,0,0,9,6,10,6,0,6,0,0,0,\n4,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,6,16,7,10,6,0,0,23,6,11,7,0,4,0,0,0,0,0,0,0,0,0,\n5,0,0,0,0,10,7,0,0,0,0,0,7,0,0,0,0,0,0,15,0,10,0,0,0,14,6,0,0,0,0,0,0,0,0,0,0,0,\n5,0,0,0,0,0,0,0,5,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,5,0,0,11,5,0,0,0,0,0,0,0,0,0,0,\n0,4,0,0,0,0,0,6,0,0,10,0,0,0,0,7,0,0,0,0,0,0,10,6,0,0,0,0,8,4,0,0,0,7,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,7,12,5,0,0,0,0,\n0,6,0,0,0,0,9,6,0,0,0,0,0,0,0,6,9,0,0,0,0,6,0,0,0,0,8,7,0,0,0,0,0,0,0,6,0,0,0,0,\n0,0,0,0,0,0,10,5,0,0,0,0,0,0,8,6,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,8,5,0,0,0,0,0,7,0,7,0,4,0,0,10,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,5,0,0,0,0,13,\n7,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,7,0,0,13,0,0,0,0,0,0,0,0,7,10,5,0,0,0,0,0,0,9,7,0,0,8,6,9,\n5,0,0,0,0,0,6,12,0,0,0,0,0,0,0,18,6,0,0,0,0,0,0,0,0,19,7,0,4,0,0,0,0,9,5,0,5,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,7,0,0,0,0,0,0,14,0,0,0,23,7,8,7,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,22,0,0,7,0,0,0,0,0,0,0,0,9,7,8,4,0,\n0,0,0,0,0,0,0,8,5,0,6,0,0,0,0,0,6,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,\n8,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,12,5,0,0,0,0,0,0,0,0,0,0,8,6,0,0,11,7,0,0,0,\n0,12,0,8,6,19,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,11,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,11,7,0,0,0,0,0,4,10,0,0,0,0,0,0,0,8,7,0,0,0,0,14,0,8,0,0,6,10,0,0,\n0,0,0,0,0,12,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,6,0,0,0,0,\n0,0,0,0,13,0,0,0,0,0,0,0,11,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,\n0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,5,0,0,0,6,0,0,0,5,0,7,0,0,0,\n0,0,6,0,0,21,7,0,0,9,6,0,0,0,6,0,0,13,7,0,0,0,5,0,0,0,0,0,4,0,6,0,0,0,0,0,0,0,0,\n0,0,0,4,0,0,0,0,0,0,11,5,0,6,0,0,10,5,0,0,0,0,0,0,0,0,9,6,0,0,8,7,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,9,0,0,0,0,0,0,6,0,0,0,0,15,4,0,0,12,7,0,0,0,6,\n0,7,0,0,8,0,9,5,0,4,0,0,0,6,0,6,0,0,23,4,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,4,0,0,8,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,0,0,0,0,0,0,\n7,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,12,6,0,0,0,0,0,0,10,7,0,7,0,0,0,0,0,0,0,0,0,0,\n9,0,0,0,0,0,8,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,11,5,0,0,0,6,0,6,0,0,0,0,0,0,0,6,0,\n4,0,0,0,0,0,0,0,0,0,0,0,5,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,8,7,0,0,0,6,0,6,0,\n0,0,0,0,0,0,0,0,5,0,0,0,0,0,5,0,0,0,0,11,0,0,0,0,0,0,0,10,5,9,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,23,7,0,0,0,0,0,7,0,0,10,6,18,0,0,0,\n0,0,0,0,8,7,0,6,0,0,0,0,0,0,8,5,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,\n0,0,0,0,0,6,0,0,0,4,12,7,0,0,0,0,0,0,0,0,10,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,13,5,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,0,0,0,\n11,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,\n0,0,0,0,6,0,0,0,4,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,10,0,11,0,0,0,0,0,0,0,0,0,\n17,5,0,4,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,0,0,0,8,7,0,0,0,0,0,0,0,\n0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,\n10,0,0,0,8,6,0,0,0,7,0,0,0,0,0,0,8,0,0,0,14,0,0,0,0,7,0,0,0,4,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,9,4,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,\n10,0,0,0,16,5,0,0,0,0,0,0,8,0,0,4,0,0,0,0,0,0,0,0,0,0,9,6,0,0,0,0,0,0,10,0,0,0,\n0,0,0,0,0,5,0,0,0,0,12,5,0,7,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,7,0,\n0,0,0,0,0,0,0,12,6,0,0,0,0,0,7,0,6,0,6,12,6,0,0,0,0,0,0,0,4,8,7,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,10,6,8,0,0,\n6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n16,0,8,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,23,5,0,0,0,7,0,6,0,\n0,0,0,0,0,0,0,0,0,0,0,10,6,0,0,9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,14,0,0,0,0,7,0,0,0,4,17,5,0,0,0,0,11,0,9,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,6,0,0,0,5,0,7,0,0,0,0,0,0,0,0,8,0,0,0,\n12,6,0,0,0,0,0,0,13,0,0,0,0,7,9,0,0,0,0,0,0,0,0,0,0,5,0,0,0,7,10,7,12,0,0,0,9,0,\n0,0,14,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,15,6,0,0,23,0,0,7,0,6,0,0,0,7,0,6,\n0,0,0,0,0,0,0,6,0,6,9,0,0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,8,7,9,4,0,0,10,0,0,0,10,\n6,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,23,0,0,6,0,0,0,0,0,0,9,4,\n0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,0,9,6,0,0,0,0,8,6,0,0,0,0,0,0,0,0,12,0,0,\n0,0,0,8,0,0,6,11,6,0,0,8,7,8,5,0,0,0,0,0,5,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,0,\n10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,\n7,0,0,0,0,9,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,8,0,0,0,0,6,12,5,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,10,0,10,\n7,0,0,8,0,0,0,0,4,0,0,0,6,0,0,0,6,0,0,0,6,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,\n0,0,4,0,0,0,0,0,4,0,0,0,0,0,0,0,6,0,6,0,5,0,0,0,0,8,0,0,0,10,7,0,0,0,0,10,0,0,0,\n0,0,13,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,19,7,0,4,12,0,8,0,0,0,0,6,0,0,0,0,\n0,0,0,6,0,0,0,0,0,0,0,0,0,4,0,0,0,0,18,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,\n0,14,0,0,4,0,0,0,6,0,0,0,6,0,0,0,7,0,0,0,0,0,0,10,4,0,0,9,7,0,0,11,0,0,0,0,0,0,\n7,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,4,0,0,12,0,0,0,\n0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,22,5,9,7,0,0,0,0,0,0,0,0,0,\n0,0,6,0,0,9,6,0,5,0,0,0,0,0,0,10,5,0,0,8,6,0,6,10,5,0,0,0,6,0,0,0,6,0,0,20,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,0,17,4,0,7,0,6,\n0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,\n0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,\n0,0,7,0,0,8,6,12,0,0,7,18,7,0,0,8,4,0,0,0,0,9,6,0,0,0,0,0,0,0,0,13,0,0,6,0,0,0,\n0,0,0,0,0,0,0,10,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,0,\n0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,8,5,0,0,0,0,0,0,0,0,12,0,0,0,8,0,0,0,0,0,0,\n4,0,0,10,0,16,0,0,0,0,0,0,0,12,7,10,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,16,6,10,0,0,5,0,0,0,0,0,6,0,0,0,0,\n0,7,0,0,0,7,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,5,8,7,0,7,0,0,0,0,0,0,0,0,8,0,0,6,0,0,0,6,0,0,0,4,0,0,0,0,\n8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,7,0,0,8,0,0,0,\n9,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,13,5,0,5,0,0,0,7,8,4,0,0,0,0,0,0,0,\n0,12,0,0,0,0,0,0,0,0,0,0,0,8,6,0,6,0,0,11,0,0,0,0,0,0,0,0,6,0,0,0,0,0,4,0,0,0,0,\n0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,10,7,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,11,6,0,0,10,6,0,0,\n0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,\n0,0,0,6,0,0,0,7,0,0,9,0,8,7,11,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,9,6,10,5,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,10,7,0,0,0,0,0,0,11,0,9,6,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,5,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,15,5,12,5,\n0,0,0,0,0,0,12,7,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,12,6,0,\n0,0,0,24,4,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,7,0,0,0,0,0,0,0,0,0,0,\n0,0,0,4,10,4,0,0,0,0,10,7,0,0,0,0,0,0,0,0,0,0,0,0,9,0,11,0,0,0,0,0,0,0,0,0,0,6,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,\n0,0,8,0,0,0,0,7,0,0,0,0,0,0,10,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,0,0,\n0,0,0,0,0,14,7,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,4,0,0,0,6,0,0,0,0,0,6,0,0,0,6,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,7,20,7,11,4,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,7,9,6,0,0,12,7,0,0,0,0,0,0,10,0,12,0,\n0,0,0,0,0,4,9,6,13,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,5,0,0,0,0,0,0,8,0,0,0,0,0,0,\n0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,6,0,0,11,0,9,0,0,0,0,4,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,5,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,\n0,4,0,5,0,0,0,0,0,0,0,0,0,4,0,0,0,0,9,7,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,\n0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,\n0,0,0,0,8,7,0,0,0,0,0,0,12,0,0,6,0,0,0,0,0,0,0,6,8,4,0,0,10,7,0,0,10,0,0,0,0,0,\n0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,7,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,4,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,7,0,0,0,0,0,0,0,5,\n0,4,0,0,0,0,0,6,0,0,0,0,0,0,8,0,0,6,0,0,0,6,0,0,0,0,0,7,0,5,8,4,0,0,9,0,0,0,0,4,\n0,0,0,0,0,0,0,0,0,5,0,0,15,6,8,6,0,0,0,6,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,6,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,9,6,0,0,0,0,0,0,0,7,0,0,0,4,0,\n6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,9,5,0,6,12,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,8,7,0,6,0,0,0,0,0,0,0,0,0,0,0,0,11,0,12,7,0,0,0,0,\n0,0,0,0,0,5,0,5,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,11,4,0,0,0,0,0,0,0,0,0,0,10,\n7,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,7,8,7,9,6,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,5,12,0,\n10,5,12,6,0,0,0,7,0,0,0,0,0,0,0,5,0,0,0,5,9,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,\n11,7,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,6,0,7,0,0,0,0,8,0,8,5,0,6,0,0,0,6,0,0,0,\n0,0,0,0,6,0,6,0,6,9,0,0,5,17,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,7,0,0,\n0,0,0,7,0,0,0,0,16,5,0,0,0,0,0,0,0,4,0,0,0,5,11,5,0,7,0,0,0,4,8,7,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,7,0,0,0,0,12,0,0,0,\n0,0,12,0,0,0,0,0,0,0,0,4,10,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,6,0,0,0,0,0,0,0,4,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,20,5,0,0,\n10,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,12,0,0,0,0,0,0,6,0,0,0,0,0,0,9,4,10,7,0,4,0,0,\n0,0,0,0,10,6,0,0,0,0,8,4,0,7,8,6,0,6,8,0,10,0,0,0,0,0,13,5,0,6,0,0,0,0,0,0,22,4,\n0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,6,0,0,0,6,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,6,10,\n5,8,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,10,4,0,0,10,7,0,0,0,0,0,5,0,\n5,8,0,0,0,0,6,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,10,7,0,0,0,4,0,0,0,0,0,6,0,0,\n0,0,0,0,0,0,8,7,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,7,0,0,0,6,0,0,0,0,0,0,0,0,0,\n4,0,0,0,4,10,0,0,6,13,7,8,0,0,0,0,0,0,7,0,0,12,7,0,0,0,0,0,0,10,5,0,0,0,0,0,6,0,\n0,0,0,0,0,0,0,0,0,13,7,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,6,0,0,0,0,0,0,0,0,8,6,0,6,\n0,0,0,0,0,0,0,0,12,0,8,4,0,0,0,0,0,4,0,4,0,0,0,0,0,0,0,5,0,0,0,0,12,5,0,0,0,7,0,\n0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,10,0,0,0,20,0,0,5,0,0,10,\n7,11,7,0,0,0,0,0,0,0,0,0,0,17,0,9,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,10,7,0,4,0,6,0,0,24,0,0,5,0,0,0,0,8,0,0,\n0,0,0,0,0,10,5,0,4,0,6,0,0,8,0,0,0,0,0,0,4,0,6,0,0,0,0,0,0,9,5,0,0,0,0,0,0,0,0,\n0,0,0,6,0,0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,0,7,\n0,0,13,0,0,0,0,0,0,0,11,6,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,\n17,7,0,0,11,6,0,0,0,0,12,6,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,5,0,0,0,6,0,0,0,0,0,0,0,0,0,0,10,0,0,4,8,6,0,0,0,\n0,0,0,9,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,9,5,0,7,18,0,0,0,0,0,0,0,0,0,0,0,0,0,8,6,0,0,0,0,0,0,0,0,8,0,0,0,\n0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,\n0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,4,0,6,0,0,9,0,0,0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,\n0,0,0,8,7,10,0,8,5,0,0,0,0,0,0,0,0,9,0,0,0,10,0,0,0,0,6,0,7,0,4,0,0,0,0,0,0,0,0,\n8,0,0,0,0,0,8,4,0,0,0,0,0,5,0,0,10,0,12,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n4,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,6,11,0,0,\n7,0,0,0,0,0,6,10,5,0,0,0,0,0,0,0,0,0,5,0,0,9,5,12,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,6,0,0,0,0,13,6,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,\n0,0,0,8,4,0,6,12,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,11,4,0,0,0,6,14,0,11,0,9,6,0,0,0,0,0,0,22,0,12,0,8,6,0,0,0,0,0,0,0,6,0,\n0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,\n10,7,0,0,0,0,0,0,0,0,9,0,0,0,0,4,0,0,0,0,0,0,0,0,0,5,11,0,0,0,0,0,0,0,8,6,0,0,9,\n7,0,0,12,4,0,0,0,0,0,0,12,6,0,6,0,7,0,0,8,5,0,0,0,0};\n" }, { "path": "libs/brotli/enc/encode.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Implementation of Brotli compressor. */\n\n#include \n\n#include \"../common/constants.h\"\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \n#include \"../common/version.h\"\n#include \"backward_references_hq.h\"\n#include \"backward_references.h\"\n#include \"bit_cost.h\"\n#include \"brotli_bit_stream.h\"\n#include \"command.h\"\n#include \"compound_dictionary.h\"\n#include \"compress_fragment_two_pass.h\"\n#include \"compress_fragment.h\"\n#include \"dictionary_hash.h\"\n#include \"encoder_dict.h\"\n#include \"fast_log.h\"\n#include \"hash.h\"\n#include \"histogram.h\"\n#include \"memory.h\"\n#include \"metablock.h\"\n#include \"params.h\"\n#include \"quality.h\"\n#include \"ringbuffer.h\"\n#include \"state.h\"\n#include \"static_init.h\"\n#include \"utf8_util.h\"\n#include \"write_bits.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define COPY_ARRAY(dst, src) memcpy(dst, src, sizeof(src));\n\nstatic size_t InputBlockSize(BrotliEncoderState* s) {\n return (size_t)1 << s->params.lgblock;\n}\n\nstatic uint64_t UnprocessedInputSize(BrotliEncoderState* s) {\n return s->input_pos_ - s->last_processed_pos_;\n}\n\nstatic size_t RemainingInputBlockSize(BrotliEncoderState* s) {\n const uint64_t delta = UnprocessedInputSize(s);\n size_t block_size = InputBlockSize(s);\n if (delta >= block_size) return 0;\n return block_size - (size_t)delta;\n}\n\nBROTLI_BOOL BrotliEncoderSetParameter(\n BrotliEncoderState* state, BrotliEncoderParameter p, uint32_t value) {\n /* Changing parameters on the fly is not implemented yet. */\n if (state->is_initialized_) return BROTLI_FALSE;\n /* TODO(eustas): Validate/clamp parameters here. */\n switch (p) {\n case BROTLI_PARAM_MODE:\n state->params.mode = (BrotliEncoderMode)value;\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_QUALITY:\n state->params.quality = (int)value;\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_LGWIN:\n state->params.lgwin = (int)value;\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_LGBLOCK:\n state->params.lgblock = (int)value;\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_DISABLE_LITERAL_CONTEXT_MODELING:\n if ((value != 0) && (value != 1)) return BROTLI_FALSE;\n state->params.disable_literal_context_modeling = TO_BROTLI_BOOL(!!value);\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_SIZE_HINT:\n state->params.size_hint = value;\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_LARGE_WINDOW:\n state->params.large_window = TO_BROTLI_BOOL(!!value);\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_NPOSTFIX:\n state->params.dist.distance_postfix_bits = value;\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_NDIRECT:\n state->params.dist.num_direct_distance_codes = value;\n return BROTLI_TRUE;\n\n case BROTLI_PARAM_STREAM_OFFSET:\n if (value > (1u << 30)) return BROTLI_FALSE;\n state->params.stream_offset = value;\n return BROTLI_TRUE;\n\n default: return BROTLI_FALSE;\n }\n}\n\n/* Wraps 64-bit input position to 32-bit ring-buffer position preserving\n \"not-a-first-lap\" feature. */\nstatic uint32_t WrapPosition(uint64_t position) {\n uint32_t result = (uint32_t)position;\n uint64_t gb = position >> 30;\n if (gb > 2) {\n /* Wrap every 2GiB; The first 3GB are continuous. */\n result = (result & ((1u << 30) - 1)) | ((uint32_t)((gb - 1) & 1) + 1) << 30;\n }\n return result;\n}\n\nstatic uint8_t* GetBrotliStorage(BrotliEncoderState* s, size_t size) {\n MemoryManager* m = &s->memory_manager_;\n if (s->storage_size_ < size) {\n BROTLI_FREE(m, s->storage_);\n s->storage_ = BROTLI_ALLOC(m, uint8_t, size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->storage_)) return NULL;\n s->storage_size_ = size;\n }\n return s->storage_;\n}\n\nstatic size_t HashTableSize(size_t max_table_size, size_t input_size) {\n size_t htsize = 256;\n while (htsize < max_table_size && htsize < input_size) {\n htsize <<= 1;\n }\n return htsize;\n}\n\nstatic int* GetHashTable(BrotliEncoderState* s, int quality,\n size_t input_size, size_t* table_size) {\n /* Use smaller hash table when input.size() is smaller, since we\n fill the table, incurring O(hash table size) overhead for\n compression, and if the input is short, we won't need that\n many hash table entries anyway. */\n MemoryManager* m = &s->memory_manager_;\n const size_t max_table_size = MaxHashTableSize(quality);\n size_t htsize = HashTableSize(max_table_size, input_size);\n int* table;\n BROTLI_DCHECK(max_table_size >= 256);\n if (quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\n /* Only odd shifts are supported by fast-one-pass. */\n if ((htsize & 0xAAAAA) == 0) {\n htsize <<= 1;\n }\n }\n\n if (htsize <= sizeof(s->small_table_) / sizeof(s->small_table_[0])) {\n table = s->small_table_;\n } else {\n if (htsize > s->large_table_size_) {\n s->large_table_size_ = htsize;\n BROTLI_FREE(m, s->large_table_);\n s->large_table_ = BROTLI_ALLOC(m, int, htsize);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->large_table_)) return 0;\n }\n table = s->large_table_;\n }\n\n *table_size = htsize;\n memset(table, 0, htsize * sizeof(*table));\n return table;\n}\n\nstatic void EncodeWindowBits(int lgwin, BROTLI_BOOL large_window,\n uint16_t* last_bytes, uint8_t* last_bytes_bits) {\n if (large_window) {\n *last_bytes = (uint16_t)(((lgwin & 0x3F) << 8) | 0x11);\n *last_bytes_bits = 14;\n } else {\n if (lgwin == 16) {\n *last_bytes = 0;\n *last_bytes_bits = 1;\n } else if (lgwin == 17) {\n *last_bytes = 1;\n *last_bytes_bits = 7;\n } else if (lgwin > 17) {\n *last_bytes = (uint16_t)(((lgwin - 17) << 1) | 0x01);\n *last_bytes_bits = 4;\n } else {\n *last_bytes = (uint16_t)(((lgwin - 8) << 4) | 0x01);\n *last_bytes_bits = 7;\n }\n }\n}\n\n/* TODO(eustas): move to compress_fragment.c? */\n/* Initializes the command and distance prefix codes for the first block. */\nstatic void InitCommandPrefixCodes(BrotliOnePassArena* s) {\n static const BROTLI_MODEL(\"small\") uint8_t kDefaultCommandDepths[128] = {\n 0, 4, 4, 5, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8,\n 0, 0, 0, 4, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 7, 7,\n 7, 7, 10, 10, 10, 10, 10, 10, 0, 4, 4, 5, 5, 5, 6, 6,\n 7, 8, 8, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10,\n 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4,\n 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 7, 7, 7, 8, 10,\n 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,\n };\n static const BROTLI_MODEL(\"small\") uint16_t kDefaultCommandBits[128] = {\n 0, 0, 8, 9, 3, 35, 7, 71,\n 39, 103, 23, 47, 175, 111, 239, 31,\n 0, 0, 0, 4, 12, 2, 10, 6,\n 13, 29, 11, 43, 27, 59, 87, 55,\n 15, 79, 319, 831, 191, 703, 447, 959,\n 0, 14, 1, 25, 5, 21, 19, 51,\n 119, 159, 95, 223, 479, 991, 63, 575,\n 127, 639, 383, 895, 255, 767, 511, 1023,\n 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 27, 59, 7, 39, 23, 55, 30, 1, 17, 9, 25, 5, 0, 8, 4, 12,\n 2, 10, 6, 21, 13, 29, 3, 19, 11, 15, 47, 31, 95, 63, 127, 255,\n 767, 2815, 1791, 3839, 511, 2559, 1535, 3583, 1023, 3071, 2047, 4095,\n };\n static const BROTLI_MODEL(\"small\") uint8_t kDefaultCommandCode[] = {\n 0xff, 0x77, 0xd5, 0xbf, 0xe7, 0xde, 0xea, 0x9e, 0x51, 0x5d, 0xde, 0xc6,\n 0x70, 0x57, 0xbc, 0x58, 0x58, 0x58, 0xd8, 0xd8, 0x58, 0xd5, 0xcb, 0x8c,\n 0xea, 0xe0, 0xc3, 0x87, 0x1f, 0x83, 0xc1, 0x60, 0x1c, 0x67, 0xb2, 0xaa,\n 0x06, 0x83, 0xc1, 0x60, 0x30, 0x18, 0xcc, 0xa1, 0xce, 0x88, 0x54, 0x94,\n 0x46, 0xe1, 0xb0, 0xd0, 0x4e, 0xb2, 0xf7, 0x04, 0x00,\n };\n static const size_t kDefaultCommandCodeNumBits = 448;\n COPY_ARRAY(s->cmd_depth, kDefaultCommandDepths);\n COPY_ARRAY(s->cmd_bits, kDefaultCommandBits);\n\n /* Initialize the pre-compressed form of the command and distance prefix\n codes. */\n COPY_ARRAY(s->cmd_code, kDefaultCommandCode);\n s->cmd_code_numbits = kDefaultCommandCodeNumBits;\n}\n\n/* TODO(eustas): avoid FP calculations. */\nstatic double EstimateEntropy(const uint32_t* population, size_t size) {\n size_t total = 0;\n double result = 0;\n for (size_t i = 0; i < size; ++i) {\n uint32_t p = population[i];\n total += p;\n result += (double)p * FastLog2(p);\n }\n result = (double)total * FastLog2(total) - result;\n return result;\n}\n\n/* Decide about the context map based on the ability of the prediction\n ability of the previous byte UTF8-prefix on the next byte. The\n prediction ability is calculated as Shannon entropy. Here we need\n Shannon entropy instead of 'BrotliBitsEntropy' since the prefix will be\n encoded with the remaining 6 bits of the following byte, and\n BrotliBitsEntropy will assume that symbol to be stored alone using Huffman\n coding. */\nstatic void ChooseContextMap(int quality,\n uint32_t* bigram_histo,\n size_t* num_literal_contexts,\n const uint32_t** literal_context_map) {\n static const BROTLI_MODEL(\"small\")\n uint32_t kStaticContextMapContinuation[64] = {\n 1, 1, 2, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n };\n static const BROTLI_MODEL(\"small\")\n uint32_t kStaticContextMapSimpleUTF8[64] = {\n 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n };\n\n uint32_t monogram_histo[3] = { 0 };\n uint32_t two_prefix_histo[6] = { 0 };\n size_t total;\n size_t i;\n double entropy[4];\n for (i = 0; i < 9; ++i) {\n monogram_histo[i % 3] += bigram_histo[i];\n two_prefix_histo[i % 6] += bigram_histo[i];\n }\n entropy[1] = EstimateEntropy(monogram_histo, 3);\n entropy[2] = (EstimateEntropy(two_prefix_histo, 3) +\n EstimateEntropy(two_prefix_histo + 3, 3));\n entropy[3] = 0;\n for (i = 0; i < 3; ++i) {\n entropy[3] += EstimateEntropy(bigram_histo + 3 * i, 3);\n }\n\n total = monogram_histo[0] + monogram_histo[1] + monogram_histo[2];\n BROTLI_DCHECK(total != 0);\n entropy[0] = 1.0 / (double)total;\n entropy[1] *= entropy[0];\n entropy[2] *= entropy[0];\n entropy[3] *= entropy[0];\n\n if (quality < MIN_QUALITY_FOR_HQ_CONTEXT_MODELING) {\n /* 3 context models is a bit slower, don't use it at lower qualities. */\n entropy[3] = entropy[1] * 10;\n }\n /* If expected savings by symbol are less than 0.2 bits, skip the\n context modeling -- in exchange for faster decoding speed. */\n if (entropy[1] - entropy[2] < 0.2 &&\n entropy[1] - entropy[3] < 0.2) {\n *num_literal_contexts = 1;\n } else if (entropy[2] - entropy[3] < 0.02) {\n *num_literal_contexts = 2;\n *literal_context_map = kStaticContextMapSimpleUTF8;\n } else {\n *num_literal_contexts = 3;\n *literal_context_map = kStaticContextMapContinuation;\n }\n}\n\n/* Decide if we want to use a more complex static context map containing 13\n context values, based on the entropy reduction of histograms over the\n first 5 bits of literals. */\nstatic BROTLI_BOOL ShouldUseComplexStaticContextMap(const uint8_t* input,\n size_t start_pos, size_t length, size_t mask, int quality, size_t size_hint,\n size_t* num_literal_contexts, const uint32_t** literal_context_map,\n uint32_t* arena) {\n static const BROTLI_MODEL(\"small\")\n uint32_t kStaticContextMapComplexUTF8[64] = {\n 11, 11, 12, 12, /* 0 special */\n 0, 0, 0, 0, /* 4 lf */\n 1, 1, 9, 9, /* 8 space */\n 2, 2, 2, 2, /* !, first after space/lf and after something else. */\n 1, 1, 1, 1, /* \" */\n 8, 3, 3, 3, /* % */\n 1, 1, 1, 1, /* ({[ */\n 2, 2, 2, 2, /* }]) */\n 8, 4, 4, 4, /* :; */\n 8, 7, 4, 4, /* . */\n 8, 0, 0, 0, /* > */\n 3, 3, 3, 3, /* [0..9] */\n 5, 5, 10, 5, /* [A-Z] */\n 5, 5, 10, 5,\n 6, 6, 6, 6, /* [a-z] */\n 6, 6, 6, 6,\n };\n BROTLI_UNUSED(quality);\n /* Try the more complex static context map only for long data. */\n if (size_hint < (1 << 20)) {\n return BROTLI_FALSE;\n } else {\n const size_t end_pos = start_pos + length;\n /* To make entropy calculations faster, we collect histograms\n over the 5 most significant bits of literals. One histogram\n without context and 13 additional histograms for each context value. */\n uint32_t* BROTLI_RESTRICT const combined_histo = arena;\n uint32_t* BROTLI_RESTRICT const context_histo = arena + 32;\n uint32_t total = 0;\n double entropy[3];\n size_t i;\n ContextLut utf8_lut = BROTLI_CONTEXT_LUT(CONTEXT_UTF8);\n memset(arena, 0, sizeof(arena[0]) * 32 * (BROTLI_MAX_STATIC_CONTEXTS + 1));\n for (; start_pos + 64 <= end_pos; start_pos += 4096) {\n const size_t stride_end_pos = start_pos + 64;\n uint8_t prev2 = input[start_pos & mask];\n uint8_t prev1 = input[(start_pos + 1) & mask];\n size_t pos;\n /* To make the analysis of the data faster we only examine 64 byte long\n strides at every 4kB intervals. */\n for (pos = start_pos + 2; pos < stride_end_pos; ++pos) {\n const uint8_t literal = input[pos & mask];\n const uint8_t context = (uint8_t)kStaticContextMapComplexUTF8[\n BROTLI_CONTEXT(prev1, prev2, utf8_lut)];\n ++total;\n ++combined_histo[literal >> 3];\n ++context_histo[(context << 5) + (literal >> 3)];\n prev2 = prev1;\n prev1 = literal;\n }\n }\n entropy[1] = EstimateEntropy(combined_histo, 32);\n entropy[2] = 0;\n for (i = 0; i < BROTLI_MAX_STATIC_CONTEXTS; ++i) {\n entropy[2] += EstimateEntropy(context_histo + (i << 5), 32);\n }\n entropy[0] = 1.0 / (double)total;\n entropy[1] *= entropy[0];\n entropy[2] *= entropy[0];\n /* The triggering heuristics below were tuned by compressing the individual\n files of the silesia corpus. If we skip this kind of context modeling\n for not very well compressible input (i.e. entropy using context modeling\n is 60% of maximal entropy) or if expected savings by symbol are less\n than 0.2 bits, then in every case when it triggers, the final compression\n ratio is improved. Note however that this heuristics might be too strict\n for some cases and could be tuned further. */\n if (entropy[2] > 3.0 || entropy[1] - entropy[2] < 0.2) {\n return BROTLI_FALSE;\n } else {\n *num_literal_contexts = BROTLI_MAX_STATIC_CONTEXTS;\n *literal_context_map = kStaticContextMapComplexUTF8;\n return BROTLI_TRUE;\n }\n }\n}\n\nstatic void DecideOverLiteralContextModeling(const uint8_t* input,\n size_t start_pos, size_t length, size_t mask, int quality, size_t size_hint,\n size_t* num_literal_contexts, const uint32_t** literal_context_map,\n uint32_t* arena) {\n if (quality < MIN_QUALITY_FOR_CONTEXT_MODELING || length < 64) {\n return;\n } else if (ShouldUseComplexStaticContextMap(\n input, start_pos, length, mask, quality, size_hint,\n num_literal_contexts, literal_context_map, arena)) {\n /* Context map was already set, nothing else to do. */\n } else {\n /* Gather bi-gram data of the UTF8 byte prefixes. To make the analysis of\n UTF8 data faster we only examine 64 byte long strides at every 4kB\n intervals. */\n const size_t end_pos = start_pos + length;\n uint32_t* BROTLI_RESTRICT const bigram_prefix_histo = arena;\n memset(bigram_prefix_histo, 0, sizeof(arena[0]) * 9);\n for (; start_pos + 64 <= end_pos; start_pos += 4096) {\n static const int lut[4] = { 0, 0, 1, 2 };\n const size_t stride_end_pos = start_pos + 64;\n int prev = lut[input[start_pos & mask] >> 6] * 3;\n size_t pos;\n for (pos = start_pos + 1; pos < stride_end_pos; ++pos) {\n const uint8_t literal = input[pos & mask];\n ++bigram_prefix_histo[prev + lut[literal >> 6]];\n prev = lut[literal >> 6] * 3;\n }\n }\n ChooseContextMap(quality, &bigram_prefix_histo[0], num_literal_contexts,\n literal_context_map);\n }\n}\n\nstatic BROTLI_BOOL ShouldCompress(\n const uint8_t* data, const size_t mask, const uint64_t last_flush_pos,\n const size_t bytes, const size_t num_literals, const size_t num_commands) {\n /* TODO(eustas): find more precise minimal block overhead. */\n if (bytes <= 2) return BROTLI_FALSE;\n if (num_commands < (bytes >> 8) + 2) {\n if ((double)num_literals > 0.99 * (double)bytes) {\n uint32_t literal_histo[256] = { 0 };\n static const uint32_t kSampleRate = 13;\n static const double kInvSampleRate = 1.0 / 13.0;\n static const double kMinEntropy = 7.92;\n const double bit_cost_threshold =\n (double)bytes * kMinEntropy * kInvSampleRate;\n size_t t = (bytes + kSampleRate - 1) / kSampleRate;\n uint32_t pos = (uint32_t)last_flush_pos;\n size_t i;\n for (i = 0; i < t; i++) {\n ++literal_histo[data[pos & mask]];\n pos += kSampleRate;\n }\n if (BrotliBitsEntropy(literal_histo, 256) > bit_cost_threshold) {\n return BROTLI_FALSE;\n }\n }\n }\n return BROTLI_TRUE;\n}\n\n/* Chooses the literal context mode for a metablock */\nstatic ContextType ChooseContextMode(const BrotliEncoderParams* params,\n const uint8_t* data, const size_t pos, const size_t mask,\n const size_t length) {\n /* We only do the computation for the option of something else than\n CONTEXT_UTF8 for the highest qualities */\n if (params->quality >= MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING &&\n !BrotliIsMostlyUTF8(data, pos, mask, length, kMinUTF8Ratio)) {\n return CONTEXT_SIGNED;\n }\n return CONTEXT_UTF8;\n}\n\nstatic void WriteMetaBlockInternal(MemoryManager* m,\n const uint8_t* data,\n const size_t mask,\n const uint64_t last_flush_pos,\n const size_t bytes,\n const BROTLI_BOOL is_last,\n ContextType literal_context_mode,\n const BrotliEncoderParams* params,\n const uint8_t prev_byte,\n const uint8_t prev_byte2,\n const size_t num_literals,\n const size_t num_commands,\n Command* commands,\n const int* saved_dist_cache,\n int* dist_cache,\n size_t* storage_ix,\n uint8_t* storage) {\n const uint32_t wrapped_last_flush_pos = WrapPosition(last_flush_pos);\n uint16_t last_bytes;\n uint8_t last_bytes_bits;\n ContextLut literal_context_lut = BROTLI_CONTEXT_LUT(literal_context_mode);\n BrotliEncoderParams block_params = *params;\n\n if (bytes == 0) {\n /* Write the ISLAST and ISEMPTY bits. */\n BrotliWriteBits(2, 3, storage_ix, storage);\n *storage_ix = (*storage_ix + 7u) & ~7u;\n return;\n }\n\n if (!ShouldCompress(data, mask, last_flush_pos, bytes,\n num_literals, num_commands)) {\n /* Restore the distance cache, as its last update by\n CreateBackwardReferences is now unused. */\n memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));\n BrotliStoreUncompressedMetaBlock(is_last, data,\n wrapped_last_flush_pos, mask, bytes,\n storage_ix, storage);\n return;\n }\n\n BROTLI_DCHECK(*storage_ix <= 14);\n last_bytes = (uint16_t)((storage[1] << 8) | storage[0]);\n last_bytes_bits = (uint8_t)(*storage_ix);\n if (params->quality <= MAX_QUALITY_FOR_STATIC_ENTROPY_CODES) {\n BrotliStoreMetaBlockFast(m, data, wrapped_last_flush_pos,\n bytes, mask, is_last, params,\n commands, num_commands,\n storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n } else if (params->quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {\n BrotliStoreMetaBlockTrivial(m, data, wrapped_last_flush_pos,\n bytes, mask, is_last, params,\n commands, num_commands,\n storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n } else {\n MetaBlockSplit mb;\n InitMetaBlockSplit(&mb);\n if (params->quality < MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING) {\n size_t num_literal_contexts = 1;\n const uint32_t* literal_context_map = NULL;\n if (!params->disable_literal_context_modeling) {\n /* TODO(eustas): pull to higher level and reuse. */\n uint32_t* arena =\n BROTLI_ALLOC(m, uint32_t, 32 * (BROTLI_MAX_STATIC_CONTEXTS + 1));\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;\n DecideOverLiteralContextModeling(\n data, wrapped_last_flush_pos, bytes, mask, params->quality,\n params->size_hint, &num_literal_contexts,\n &literal_context_map, arena);\n BROTLI_FREE(m, arena);\n }\n BrotliBuildMetaBlockGreedy(m, data, wrapped_last_flush_pos, mask,\n prev_byte, prev_byte2, literal_context_lut, num_literal_contexts,\n literal_context_map, commands, num_commands, &mb);\n if (BROTLI_IS_OOM(m)) return;\n } else {\n BrotliBuildMetaBlock(m, data, wrapped_last_flush_pos, mask, &block_params,\n prev_byte, prev_byte2,\n commands, num_commands,\n literal_context_mode,\n &mb);\n if (BROTLI_IS_OOM(m)) return;\n }\n if (params->quality >= MIN_QUALITY_FOR_OPTIMIZE_HISTOGRAMS) {\n /* The number of distance symbols effectively used for distance\n histograms. It might be less than distance alphabet size\n for \"Large Window Brotli\" (32-bit). */\n BrotliOptimizeHistograms(block_params.dist.alphabet_size_limit, &mb);\n }\n BrotliStoreMetaBlock(m, data, wrapped_last_flush_pos, bytes, mask,\n prev_byte, prev_byte2,\n is_last,\n &block_params,\n literal_context_mode,\n commands, num_commands,\n &mb,\n storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return;\n DestroyMetaBlockSplit(m, &mb);\n }\n if (bytes + 4 < (*storage_ix >> 3)) {\n /* Restore the distance cache and last byte. */\n memcpy(dist_cache, saved_dist_cache, 4 * sizeof(dist_cache[0]));\n storage[0] = (uint8_t)last_bytes;\n storage[1] = (uint8_t)(last_bytes >> 8);\n *storage_ix = last_bytes_bits;\n BrotliStoreUncompressedMetaBlock(is_last, data,\n wrapped_last_flush_pos, mask,\n bytes, storage_ix, storage);\n }\n}\n\nstatic void ChooseDistanceParams(BrotliEncoderParams* params) {\n uint32_t distance_postfix_bits = 0;\n uint32_t num_direct_distance_codes = 0;\n\n if (params->quality >= MIN_QUALITY_FOR_NONZERO_DISTANCE_PARAMS) {\n uint32_t ndirect_msb;\n if (params->mode == BROTLI_MODE_FONT) {\n distance_postfix_bits = 1;\n num_direct_distance_codes = 12;\n } else {\n distance_postfix_bits = params->dist.distance_postfix_bits;\n num_direct_distance_codes = params->dist.num_direct_distance_codes;\n }\n ndirect_msb = (num_direct_distance_codes >> distance_postfix_bits) & 0x0F;\n if (distance_postfix_bits > BROTLI_MAX_NPOSTFIX ||\n num_direct_distance_codes > BROTLI_MAX_NDIRECT ||\n (ndirect_msb << distance_postfix_bits) != num_direct_distance_codes) {\n distance_postfix_bits = 0;\n num_direct_distance_codes = 0;\n }\n }\n\n BrotliInitDistanceParams(¶ms->dist, distance_postfix_bits,\n num_direct_distance_codes, params->large_window);\n}\n\nstatic BROTLI_BOOL EnsureInitialized(BrotliEncoderState* s) {\n MemoryManager* m = &s->memory_manager_;\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n if (s->is_initialized_) return BROTLI_TRUE;\n\n s->last_bytes_bits_ = 0;\n s->last_bytes_ = 0;\n s->flint_ = BROTLI_FLINT_DONE;\n s->remaining_metadata_bytes_ = BROTLI_UINT32_MAX;\n\n SanitizeParams(&s->params);\n s->params.lgblock = ComputeLgBlock(&s->params);\n ChooseDistanceParams(&s->params);\n\n if (s->params.stream_offset != 0) {\n s->flint_ = BROTLI_FLINT_NEEDS_2_BYTES;\n /* Poison the distance cache. -16 +- 3 is still less than zero (invalid). */\n s->dist_cache_[0] = -16;\n s->dist_cache_[1] = -16;\n s->dist_cache_[2] = -16;\n s->dist_cache_[3] = -16;\n memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->saved_dist_cache_));\n }\n\n RingBufferSetup(&s->params, &s->ringbuffer_);\n\n /* Initialize last byte with stream header. */\n {\n int lgwin = s->params.lgwin;\n if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\n s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\n lgwin = BROTLI_MAX(int, lgwin, 18);\n }\n if (s->params.stream_offset == 0) {\n EncodeWindowBits(lgwin, s->params.large_window,\n &s->last_bytes_, &s->last_bytes_bits_);\n } else {\n /* Bigger values have the same effect, but could cause overflows. */\n s->params.stream_offset = BROTLI_MIN(size_t,\n s->params.stream_offset, BROTLI_MAX_BACKWARD_LIMIT(lgwin));\n }\n }\n\n if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\n s->one_pass_arena_ = BROTLI_ALLOC(m, BrotliOnePassArena, 1);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n InitCommandPrefixCodes(s->one_pass_arena_);\n } else if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\n s->two_pass_arena_ = BROTLI_ALLOC(m, BrotliTwoPassArena, 1);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n }\n\n s->is_initialized_ = BROTLI_TRUE;\n return BROTLI_TRUE;\n}\n\nstatic void BrotliEncoderInitParams(BrotliEncoderParams* params) {\n params->mode = BROTLI_DEFAULT_MODE;\n params->large_window = BROTLI_FALSE;\n params->quality = BROTLI_DEFAULT_QUALITY;\n params->lgwin = BROTLI_DEFAULT_WINDOW;\n params->lgblock = 0;\n params->stream_offset = 0;\n params->size_hint = 0;\n params->disable_literal_context_modeling = BROTLI_FALSE;\n BrotliInitSharedEncoderDictionary(¶ms->dictionary);\n params->dist.distance_postfix_bits = 0;\n params->dist.num_direct_distance_codes = 0;\n params->dist.alphabet_size_max =\n BROTLI_DISTANCE_ALPHABET_SIZE(0, 0, BROTLI_MAX_DISTANCE_BITS);\n params->dist.alphabet_size_limit = params->dist.alphabet_size_max;\n params->dist.max_distance = BROTLI_MAX_DISTANCE;\n}\n\nstatic void BrotliEncoderCleanupParams(MemoryManager* m,\n BrotliEncoderParams* params) {\n BrotliCleanupSharedEncoderDictionary(m, ¶ms->dictionary);\n}\n\n#ifdef BROTLI_REPORTING\n/* When BROTLI_REPORTING is defined extra reporting module have to be linked. */\nvoid BrotliEncoderOnStart(const BrotliEncoderState* s);\nvoid BrotliEncoderOnFinish(const BrotliEncoderState* s);\n#define BROTLI_ENCODER_ON_START(s) BrotliEncoderOnStart(s);\n#define BROTLI_ENCODER_ON_FINISH(s) BrotliEncoderOnFinish(s);\n#else\n#if !defined(BROTLI_ENCODER_ON_START)\n#define BROTLI_ENCODER_ON_START(s) (void)(s);\n#endif\n#if !defined(BROTLI_ENCODER_ON_FINISH)\n#define BROTLI_ENCODER_ON_FINISH(s) (void)(s);\n#endif\n#endif\n\nstatic void BrotliEncoderInitState(BrotliEncoderState* s) {\n BROTLI_ENCODER_ON_START(s);\n BrotliEncoderInitParams(&s->params);\n s->input_pos_ = 0;\n s->num_commands_ = 0;\n s->num_literals_ = 0;\n s->last_insert_len_ = 0;\n s->last_flush_pos_ = 0;\n s->last_processed_pos_ = 0;\n s->prev_byte_ = 0;\n s->prev_byte2_ = 0;\n s->storage_size_ = 0;\n s->storage_ = 0;\n HasherInit(&s->hasher_);\n s->large_table_ = NULL;\n s->large_table_size_ = 0;\n s->one_pass_arena_ = NULL;\n s->two_pass_arena_ = NULL;\n s->command_buf_ = NULL;\n s->literal_buf_ = NULL;\n s->total_in_ = 0;\n s->next_out_ = NULL;\n s->available_out_ = 0;\n s->total_out_ = 0;\n s->stream_state_ = BROTLI_STREAM_PROCESSING;\n s->is_last_block_emitted_ = BROTLI_FALSE;\n s->is_initialized_ = BROTLI_FALSE;\n\n RingBufferInit(&s->ringbuffer_);\n\n s->commands_ = 0;\n s->cmd_alloc_size_ = 0;\n\n /* Initialize distance cache. */\n s->dist_cache_[0] = 4;\n s->dist_cache_[1] = 11;\n s->dist_cache_[2] = 15;\n s->dist_cache_[3] = 16;\n /* Save the state of the distance cache in case we need to restore it for\n emitting an uncompressed block. */\n memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->saved_dist_cache_));\n}\n\nBrotliEncoderState* BrotliEncoderCreateInstance(\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {\n BROTLI_BOOL healthy = BrotliEncoderEnsureStaticInit();\n if (!healthy) {\n return 0;\n }\n BrotliEncoderState* state = (BrotliEncoderState*)BrotliBootstrapAlloc(\n sizeof(BrotliEncoderState), alloc_func, free_func, opaque);\n if (state == NULL) {\n /* BROTLI_DUMP(); */\n return 0;\n }\n BrotliInitMemoryManager(\n &state->memory_manager_, alloc_func, free_func, opaque);\n BrotliEncoderInitState(state);\n return state;\n}\n\nstatic void BrotliEncoderCleanupState(BrotliEncoderState* s) {\n MemoryManager* m = &s->memory_manager_;\n\n BROTLI_ENCODER_ON_FINISH(s);\n\n if (BROTLI_IS_OOM(m)) {\n BrotliWipeOutMemoryManager(m);\n return;\n }\n\n BROTLI_FREE(m, s->storage_);\n BROTLI_FREE(m, s->commands_);\n RingBufferFree(m, &s->ringbuffer_);\n DestroyHasher(m, &s->hasher_);\n BROTLI_FREE(m, s->large_table_);\n BROTLI_FREE(m, s->one_pass_arena_);\n BROTLI_FREE(m, s->two_pass_arena_);\n BROTLI_FREE(m, s->command_buf_);\n BROTLI_FREE(m, s->literal_buf_);\n BrotliEncoderCleanupParams(m, &s->params);\n}\n\n/* Deinitializes and frees BrotliEncoderState instance. */\nvoid BrotliEncoderDestroyInstance(BrotliEncoderState* state) {\n if (!state) {\n return;\n } else {\n BrotliEncoderCleanupState(state);\n BrotliBootstrapFree(state, &state->memory_manager_);\n }\n}\n\n/*\n Copies the given input data to the internal ring buffer of the compressor.\n No processing of the data occurs at this time and this function can be\n called multiple times before calling WriteBrotliData() to process the\n accumulated input. At most input_block_size() bytes of input data can be\n copied to the ring buffer, otherwise the next WriteBrotliData() will fail.\n */\nstatic void CopyInputToRingBuffer(BrotliEncoderState* s,\n const size_t input_size,\n const uint8_t* input_buffer) {\n RingBuffer* ringbuffer_ = &s->ringbuffer_;\n MemoryManager* m = &s->memory_manager_;\n RingBufferWrite(m, input_buffer, input_size, ringbuffer_);\n if (BROTLI_IS_OOM(m)) return;\n s->input_pos_ += input_size;\n\n /* TL;DR: If needed, initialize 7 more bytes in the ring buffer to make the\n hashing not depend on uninitialized data. This makes compression\n deterministic and it prevents uninitialized memory warnings in Valgrind.\n Even without erasing, the output would be valid (but nondeterministic).\n\n Background information: The compressor stores short (at most 8 bytes)\n substrings of the input already read in a hash table, and detects\n repetitions by looking up such substrings in the hash table. If it\n can find a substring, it checks whether the substring is really there\n in the ring buffer (or it's just a hash collision). Should the hash\n table become corrupt, this check makes sure that the output is\n still valid, albeit the compression ratio would be bad.\n\n The compressor populates the hash table from the ring buffer as it's\n reading new bytes from the input. However, at the last few indexes of\n the ring buffer, there are not enough bytes to build full-length\n substrings from. Since the hash table always contains full-length\n substrings, we overwrite with zeros here to make sure that those\n substrings will contain zeros at the end instead of uninitialized\n data.\n\n Please note that erasing is not necessary (because the\n memory region is already initialized since he ring buffer\n has a `tail' that holds a copy of the beginning,) so we\n skip erasing if we have already gone around at least once in\n the ring buffer.\n\n Only clear during the first round of ring-buffer writes. On\n subsequent rounds data in the ring-buffer would be affected. */\n if (ringbuffer_->pos_ <= ringbuffer_->mask_) {\n /* This is the first time when the ring buffer is being written.\n We clear 7 bytes just after the bytes that have been copied from\n the input buffer.\n\n The ring-buffer has a \"tail\" that holds a copy of the beginning,\n but only once the ring buffer has been fully written once, i.e.,\n pos <= mask. For the first time, we need to write values\n in this tail (where index may be larger than mask), so that\n we have exactly defined behavior and don't read uninitialized\n memory. Due to performance reasons, hashing reads data using a\n LOAD64, which can go 7 bytes beyond the bytes written in the\n ring-buffer. */\n memset(ringbuffer_->buffer_ + ringbuffer_->pos_, 0, 7);\n }\n}\n\n/* Marks all input as processed.\n Returns true if position wrapping occurs. */\nstatic BROTLI_BOOL UpdateLastProcessedPos(BrotliEncoderState* s) {\n uint32_t wrapped_last_processed_pos = WrapPosition(s->last_processed_pos_);\n uint32_t wrapped_input_pos = WrapPosition(s->input_pos_);\n s->last_processed_pos_ = s->input_pos_;\n return TO_BROTLI_BOOL(wrapped_input_pos < wrapped_last_processed_pos);\n}\n\nstatic void ExtendLastCommand(BrotliEncoderState* s, uint32_t* bytes,\n uint32_t* wrapped_last_processed_pos) {\n Command* last_command = &s->commands_[s->num_commands_ - 1];\n const uint8_t* data = s->ringbuffer_.buffer_;\n const uint32_t mask = s->ringbuffer_.mask_;\n uint64_t max_backward_distance =\n (((uint64_t)1) << s->params.lgwin) - BROTLI_WINDOW_GAP;\n uint64_t last_copy_len = last_command->copy_len_ & 0x1FFFFFF;\n uint64_t last_processed_pos = s->last_processed_pos_ - last_copy_len;\n uint64_t max_distance = last_processed_pos < max_backward_distance ?\n last_processed_pos : max_backward_distance;\n uint64_t cmd_dist = (uint64_t)s->dist_cache_[0];\n uint32_t distance_code = CommandRestoreDistanceCode(last_command,\n &s->params.dist);\n const CompoundDictionary* dict = &s->params.dictionary.compound;\n size_t compound_dictionary_size = dict->total_size;\n if (distance_code < BROTLI_NUM_DISTANCE_SHORT_CODES ||\n distance_code - (BROTLI_NUM_DISTANCE_SHORT_CODES - 1) == cmd_dist) {\n if (cmd_dist <= max_distance) {\n while (*bytes != 0 && data[*wrapped_last_processed_pos & mask] ==\n data[(*wrapped_last_processed_pos - cmd_dist) & mask]) {\n last_command->copy_len_++;\n (*bytes)--;\n (*wrapped_last_processed_pos)++;\n }\n } else {\n if ((cmd_dist - max_distance - 1) < compound_dictionary_size &&\n last_copy_len < cmd_dist - max_distance) {\n size_t address =\n compound_dictionary_size - (size_t)(cmd_dist - max_distance) +\n (size_t)last_copy_len;\n size_t br_index = 0;\n size_t br_offset;\n const uint8_t* chunk;\n size_t chunk_length;\n while (address >= dict->chunk_offsets[br_index + 1]) br_index++;\n br_offset = address - dict->chunk_offsets[br_index];\n chunk = dict->chunk_source[br_index];\n chunk_length =\n dict->chunk_offsets[br_index + 1] - dict->chunk_offsets[br_index];\n while (*bytes != 0 && data[*wrapped_last_processed_pos & mask] ==\n chunk[br_offset]) {\n last_command->copy_len_++;\n (*bytes)--;\n (*wrapped_last_processed_pos)++;\n if (++br_offset == chunk_length) {\n br_index++;\n br_offset = 0;\n if (br_index != dict->num_chunks) {\n chunk = dict->chunk_source[br_index];\n chunk_length = dict->chunk_offsets[br_index + 1] -\n dict->chunk_offsets[br_index];\n } else {\n break;\n }\n }\n }\n }\n }\n /* The copy length is at most the metablock size, and thus expressible. */\n GetLengthCode(last_command->insert_len_,\n (size_t)((int)(last_command->copy_len_ & 0x1FFFFFF) +\n (int)(last_command->copy_len_ >> 25)),\n TO_BROTLI_BOOL((last_command->dist_prefix_ & 0x3FF) == 0),\n &last_command->cmd_prefix_);\n }\n}\n\n/*\n Processes the accumulated input data and sets |*out_size| to the length of\n the new output meta-block, or to zero if no new output meta-block has been\n created (in this case the processed input data is buffered internally).\n If |*out_size| is positive, |*output| points to the start of the output\n data. If |is_last| or |force_flush| is BROTLI_TRUE, an output meta-block is\n always created. However, until |is_last| is BROTLI_TRUE encoder may retain up\n to 7 bits of the last byte of output. Byte-alignment could be enforced by\n emitting an empty meta-data block.\n Returns BROTLI_FALSE if the size of the input data is larger than\n input_block_size().\n */\nstatic BROTLI_BOOL EncodeData(\n BrotliEncoderState* s, const BROTLI_BOOL is_last,\n const BROTLI_BOOL force_flush, size_t* out_size, uint8_t** output) {\n const uint64_t delta = UnprocessedInputSize(s);\n uint32_t bytes = (uint32_t)delta;\n uint32_t wrapped_last_processed_pos = WrapPosition(s->last_processed_pos_);\n uint8_t* data;\n uint32_t mask;\n MemoryManager* m = &s->memory_manager_;\n ContextType literal_context_mode;\n ContextLut literal_context_lut;\n BROTLI_BOOL fast_compress =\n s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\n s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY;\n\n data = s->ringbuffer_.buffer_;\n mask = s->ringbuffer_.mask_;\n\n if (delta == 0) { /* No new input; still might want to flush or finish. */\n if (!data) { /* No input has been processed so far. */\n if (is_last) { /* Emit complete finalized stream. */\n BROTLI_DCHECK(s->last_bytes_bits_ <= 14);\n s->last_bytes_ |= (uint16_t)(3u << s->last_bytes_bits_);\n s->last_bytes_bits_ = (uint8_t)(s->last_bytes_bits_ + 2u);\n s->tiny_buf_.u8[0] = (uint8_t)s->last_bytes_;\n s->tiny_buf_.u8[1] = (uint8_t)(s->last_bytes_ >> 8);\n *output = s->tiny_buf_.u8;\n *out_size = (s->last_bytes_bits_ + 7u) >> 3u;\n return BROTLI_TRUE;\n } else { /* No data, not last -> no-op. */\n *out_size = 0;\n return BROTLI_TRUE;\n }\n } else {\n /* Fast compress performs flush every block -> flush is no-op. */\n if (!is_last && (!force_flush || fast_compress)) { /* Another no-op. */\n *out_size = 0;\n return BROTLI_TRUE;\n }\n }\n }\n BROTLI_DCHECK(data);\n\n if (s->params.quality > s->params.dictionary.max_quality) return BROTLI_FALSE;\n /* Adding more blocks after \"last\" block is forbidden. */\n if (s->is_last_block_emitted_) return BROTLI_FALSE;\n if (is_last) s->is_last_block_emitted_ = BROTLI_TRUE;\n\n if (delta > InputBlockSize(s)) {\n return BROTLI_FALSE;\n }\n if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY &&\n !s->command_buf_) {\n s->command_buf_ =\n BROTLI_ALLOC(m, uint32_t, kCompressFragmentTwoPassBlockSize);\n s->literal_buf_ =\n BROTLI_ALLOC(m, uint8_t, kCompressFragmentTwoPassBlockSize);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->command_buf_) ||\n BROTLI_IS_NULL(s->literal_buf_)) {\n return BROTLI_FALSE;\n }\n }\n\n if (fast_compress) {\n uint8_t* storage;\n size_t storage_ix = s->last_bytes_bits_;\n size_t table_size;\n int* table;\n\n storage = GetBrotliStorage(s, 2 * bytes + 503);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n storage[0] = (uint8_t)s->last_bytes_;\n storage[1] = (uint8_t)(s->last_bytes_ >> 8);\n table = GetHashTable(s, s->params.quality, bytes, &table_size);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\n BrotliCompressFragmentFast(\n s->one_pass_arena_, &data[wrapped_last_processed_pos & mask],\n bytes, is_last,\n table, table_size,\n &storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n } else {\n BrotliCompressFragmentTwoPass(\n s->two_pass_arena_, &data[wrapped_last_processed_pos & mask],\n bytes, is_last,\n s->command_buf_, s->literal_buf_,\n table, table_size,\n &storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n }\n s->last_bytes_ = (uint16_t)(storage[storage_ix >> 3]);\n s->last_bytes_bits_ = storage_ix & 7u;\n UpdateLastProcessedPos(s);\n *output = &storage[0];\n *out_size = storage_ix >> 3;\n return BROTLI_TRUE;\n }\n\n {\n /* Theoretical max number of commands is 1 per 2 bytes. */\n size_t newsize = s->num_commands_ + bytes / 2 + 1;\n if (newsize > s->cmd_alloc_size_) {\n Command* new_commands;\n /* Reserve a bit more memory to allow merging with a next block\n without reallocation: that would impact speed. */\n newsize += (bytes / 4) + 16;\n s->cmd_alloc_size_ = newsize;\n new_commands = BROTLI_ALLOC(m, Command, newsize);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_commands)) return BROTLI_FALSE;\n if (s->commands_) {\n memcpy(new_commands, s->commands_, sizeof(Command) * s->num_commands_);\n BROTLI_FREE(m, s->commands_);\n }\n s->commands_ = new_commands;\n }\n }\n\n InitOrStitchToPreviousBlock(m, &s->hasher_, data, mask, &s->params,\n wrapped_last_processed_pos, bytes, is_last);\n\n literal_context_mode = ChooseContextMode(\n &s->params, data, WrapPosition(s->last_flush_pos_),\n mask, (size_t)(s->input_pos_ - s->last_flush_pos_));\n literal_context_lut = BROTLI_CONTEXT_LUT(literal_context_mode);\n\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n\n if (s->num_commands_ && s->last_insert_len_ == 0) {\n ExtendLastCommand(s, &bytes, &wrapped_last_processed_pos);\n }\n\n if (s->params.quality == ZOPFLIFICATION_QUALITY) {\n BROTLI_DCHECK(s->params.hasher.type == 10);\n BrotliCreateZopfliBackwardReferences(m, bytes, wrapped_last_processed_pos,\n data, mask, literal_context_lut, &s->params,\n &s->hasher_, s->dist_cache_,\n &s->last_insert_len_, &s->commands_[s->num_commands_],\n &s->num_commands_, &s->num_literals_);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n } else if (s->params.quality == HQ_ZOPFLIFICATION_QUALITY) {\n BROTLI_DCHECK(s->params.hasher.type == 10);\n BrotliCreateHqZopfliBackwardReferences(m, bytes, wrapped_last_processed_pos,\n data, mask, literal_context_lut, &s->params,\n &s->hasher_, s->dist_cache_,\n &s->last_insert_len_, &s->commands_[s->num_commands_],\n &s->num_commands_, &s->num_literals_);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n } else {\n BrotliCreateBackwardReferences(bytes, wrapped_last_processed_pos,\n data, mask, literal_context_lut, &s->params,\n &s->hasher_, s->dist_cache_,\n &s->last_insert_len_, &s->commands_[s->num_commands_],\n &s->num_commands_, &s->num_literals_);\n }\n\n {\n const size_t max_length = MaxMetablockSize(&s->params);\n const size_t max_literals = max_length / 8;\n const size_t max_commands = max_length / 8;\n const size_t processed_bytes = (size_t)(s->input_pos_ - s->last_flush_pos_);\n /* If maximal possible additional block doesn't fit metablock, flush now. */\n /* TODO(eustas): Postpone decision until next block arrives? */\n const BROTLI_BOOL next_input_fits_metablock = TO_BROTLI_BOOL(\n processed_bytes + InputBlockSize(s) <= max_length);\n /* If block splitting is not used, then flush as soon as there is some\n amount of commands / literals produced. */\n const BROTLI_BOOL should_flush = TO_BROTLI_BOOL(\n s->params.quality < MIN_QUALITY_FOR_BLOCK_SPLIT &&\n s->num_literals_ + s->num_commands_ >= MAX_NUM_DELAYED_SYMBOLS);\n if (!is_last && !force_flush && !should_flush &&\n next_input_fits_metablock &&\n s->num_literals_ < max_literals &&\n s->num_commands_ < max_commands) {\n /* Merge with next input block. Everything will happen later. */\n if (UpdateLastProcessedPos(s)) {\n HasherReset(&s->hasher_);\n }\n *out_size = 0;\n return BROTLI_TRUE;\n }\n }\n\n /* Create the last insert-only command. */\n if (s->last_insert_len_ > 0) {\n InitInsertCommand(&s->commands_[s->num_commands_++], s->last_insert_len_);\n s->num_literals_ += s->last_insert_len_;\n s->last_insert_len_ = 0;\n }\n\n if (!is_last && s->input_pos_ == s->last_flush_pos_) {\n /* We have no new input data and we don't have to finish the stream, so\n nothing to do. */\n *out_size = 0;\n return BROTLI_TRUE;\n }\n BROTLI_DCHECK(s->input_pos_ >= s->last_flush_pos_);\n BROTLI_DCHECK(s->input_pos_ > s->last_flush_pos_ || is_last);\n BROTLI_DCHECK(s->input_pos_ - s->last_flush_pos_ <= 1u << 24);\n {\n const uint32_t metablock_size =\n (uint32_t)(s->input_pos_ - s->last_flush_pos_);\n uint8_t* storage = GetBrotliStorage(s, 2 * metablock_size + 503);\n size_t storage_ix = s->last_bytes_bits_;\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n storage[0] = (uint8_t)s->last_bytes_;\n storage[1] = (uint8_t)(s->last_bytes_ >> 8);\n WriteMetaBlockInternal(\n m, data, mask, s->last_flush_pos_, metablock_size, is_last,\n literal_context_mode, &s->params, s->prev_byte_, s->prev_byte2_,\n s->num_literals_, s->num_commands_, s->commands_, s->saved_dist_cache_,\n s->dist_cache_, &storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n s->last_bytes_ = (uint16_t)(storage[storage_ix >> 3]);\n s->last_bytes_bits_ = storage_ix & 7u;\n s->last_flush_pos_ = s->input_pos_;\n if (UpdateLastProcessedPos(s)) {\n HasherReset(&s->hasher_);\n }\n if (s->last_flush_pos_ > 0) {\n s->prev_byte_ = data[((uint32_t)s->last_flush_pos_ - 1) & mask];\n }\n if (s->last_flush_pos_ > 1) {\n s->prev_byte2_ = data[(uint32_t)(s->last_flush_pos_ - 2) & mask];\n }\n s->num_commands_ = 0;\n s->num_literals_ = 0;\n /* Save the state of the distance cache in case we need to restore it for\n emitting an uncompressed block. */\n memcpy(s->saved_dist_cache_, s->dist_cache_, sizeof(s->saved_dist_cache_));\n *output = &storage[0];\n *out_size = storage_ix >> 3;\n return BROTLI_TRUE;\n }\n}\n\n/* Dumps remaining output bits and metadata header to |header|.\n Returns number of produced bytes.\n REQUIRED: |header| should be 8-byte aligned and at least 16 bytes long.\n REQUIRED: |block_size| <= (1 << 24). */\nstatic size_t WriteMetadataHeader(\n BrotliEncoderState* s, const size_t block_size, uint8_t* header) {\n size_t storage_ix;\n storage_ix = s->last_bytes_bits_;\n header[0] = (uint8_t)s->last_bytes_;\n header[1] = (uint8_t)(s->last_bytes_ >> 8);\n s->last_bytes_ = 0;\n s->last_bytes_bits_ = 0;\n\n BrotliWriteBits(1, 0, &storage_ix, header);\n BrotliWriteBits(2, 3, &storage_ix, header);\n BrotliWriteBits(1, 0, &storage_ix, header);\n if (block_size == 0) {\n BrotliWriteBits(2, 0, &storage_ix, header);\n } else {\n uint32_t nbits = (block_size == 1) ? 1 :\n (Log2FloorNonZero((uint32_t)block_size - 1) + 1);\n uint32_t nbytes = (nbits + 7) / 8;\n BrotliWriteBits(2, nbytes, &storage_ix, header);\n BrotliWriteBits(8 * nbytes, block_size - 1, &storage_ix, header);\n }\n return (storage_ix + 7u) >> 3;\n}\n\nsize_t BrotliEncoderMaxCompressedSize(size_t input_size) {\n /* [window bits / empty metadata] + N * [uncompressed] + [last empty] */\n size_t num_large_blocks = input_size >> 14;\n size_t overhead = 2 + (4 * num_large_blocks) + 3 + 1;\n size_t result = input_size + overhead;\n if (input_size == 0) return 2;\n return (result < input_size) ? 0 : result;\n}\n\n/* Wraps data to uncompressed brotli stream with minimal window size.\n |output| should point at region with at least BrotliEncoderMaxCompressedSize\n addressable bytes.\n Returns the length of stream. */\nstatic size_t MakeUncompressedStream(\n const uint8_t* input, size_t input_size, uint8_t* output) {\n size_t size = input_size;\n size_t result = 0;\n size_t offset = 0;\n if (input_size == 0) {\n output[0] = 6;\n return 1;\n }\n output[result++] = 0x21; /* window bits = 10, is_last = false */\n output[result++] = 0x03; /* empty metadata, padding */\n while (size > 0) {\n uint32_t nibbles = 0;\n uint32_t chunk_size;\n uint32_t bits;\n chunk_size = (size > (1u << 24)) ? (1u << 24) : (uint32_t)size;\n if (chunk_size > (1u << 16)) nibbles = (chunk_size > (1u << 20)) ? 2 : 1;\n bits =\n (nibbles << 1) | ((chunk_size - 1) << 3) | (1u << (19 + 4 * nibbles));\n output[result++] = (uint8_t)bits;\n output[result++] = (uint8_t)(bits >> 8);\n output[result++] = (uint8_t)(bits >> 16);\n if (nibbles == 2) output[result++] = (uint8_t)(bits >> 24);\n memcpy(&output[result], &input[offset], chunk_size);\n result += chunk_size;\n offset += chunk_size;\n size -= chunk_size;\n }\n output[result++] = 3;\n return result;\n}\n\nBROTLI_BOOL BrotliEncoderCompress(\n int quality, int lgwin, BrotliEncoderMode mode, size_t input_size,\n const uint8_t input_buffer[BROTLI_ARRAY_PARAM(input_size)],\n size_t* encoded_size,\n uint8_t encoded_buffer[BROTLI_ARRAY_PARAM(*encoded_size)]) {\n BrotliEncoderState* s;\n size_t out_size = *encoded_size;\n const uint8_t* input_start = input_buffer;\n uint8_t* output_start = encoded_buffer;\n size_t max_out_size = BrotliEncoderMaxCompressedSize(input_size);\n if (out_size == 0) {\n /* Output buffer needs at least one byte. */\n return BROTLI_FALSE;\n }\n if (input_size == 0) {\n /* Handle the special case of empty input. */\n *encoded_size = 1;\n *encoded_buffer = 6;\n return BROTLI_TRUE;\n }\n\n s = BrotliEncoderCreateInstance(0, 0, 0);\n if (!s) {\n return BROTLI_FALSE;\n } else {\n size_t available_in = input_size;\n const uint8_t* next_in = input_buffer;\n size_t available_out = *encoded_size;\n uint8_t* next_out = encoded_buffer;\n size_t total_out = 0;\n BROTLI_BOOL result = BROTLI_FALSE;\n /* TODO(eustas): check that parameters are sane. */\n BrotliEncoderSetParameter(s, BROTLI_PARAM_QUALITY, (uint32_t)quality);\n BrotliEncoderSetParameter(s, BROTLI_PARAM_LGWIN, (uint32_t)lgwin);\n BrotliEncoderSetParameter(s, BROTLI_PARAM_MODE, (uint32_t)mode);\n BrotliEncoderSetParameter(s, BROTLI_PARAM_SIZE_HINT, (uint32_t)input_size);\n if (lgwin > BROTLI_MAX_WINDOW_BITS) {\n BrotliEncoderSetParameter(s, BROTLI_PARAM_LARGE_WINDOW, BROTLI_TRUE);\n }\n result = BrotliEncoderCompressStream(s, BROTLI_OPERATION_FINISH,\n &available_in, &next_in, &available_out, &next_out, &total_out);\n if (!BrotliEncoderIsFinished(s)) result = 0;\n *encoded_size = total_out;\n BrotliEncoderDestroyInstance(s);\n if (!result || (max_out_size && *encoded_size > max_out_size)) {\n goto fallback;\n }\n return BROTLI_TRUE;\n }\nfallback:\n *encoded_size = 0;\n if (!max_out_size) return BROTLI_FALSE;\n if (out_size >= max_out_size) {\n *encoded_size =\n MakeUncompressedStream(input_start, input_size, output_start);\n return BROTLI_TRUE;\n }\n return BROTLI_FALSE;\n}\n\nstatic void InjectBytePaddingBlock(BrotliEncoderState* s) {\n uint32_t seal = s->last_bytes_;\n size_t seal_bits = s->last_bytes_bits_;\n uint8_t* destination;\n s->last_bytes_ = 0;\n s->last_bytes_bits_ = 0;\n /* is_last = 0, data_nibbles = 11, reserved = 0, meta_nibbles = 00 */\n seal |= 0x6u << seal_bits;\n seal_bits += 6;\n /* If we have already created storage, then append to it.\n Storage is valid until next block is being compressed. */\n if (s->next_out_) {\n destination = s->next_out_ + s->available_out_;\n } else {\n destination = s->tiny_buf_.u8;\n s->next_out_ = destination;\n }\n destination[0] = (uint8_t)seal;\n if (seal_bits > 8) destination[1] = (uint8_t)(seal >> 8);\n if (seal_bits > 16) destination[2] = (uint8_t)(seal >> 16);\n s->available_out_ += (seal_bits + 7) >> 3;\n}\n\n/* Fills the |total_out|, if it is not NULL. */\nstatic void SetTotalOut(BrotliEncoderState* s, size_t* total_out) {\n if (total_out) {\n /* Saturating conversion uint64_t -> size_t */\n size_t result = (size_t)-1;\n if (s->total_out_ < result) {\n result = (size_t)s->total_out_;\n }\n *total_out = result;\n }\n}\n\n/* Injects padding bits or pushes compressed data to output.\n Returns false if nothing is done. */\nstatic BROTLI_BOOL InjectFlushOrPushOutput(BrotliEncoderState* s,\n size_t* available_out, uint8_t** next_out, size_t* total_out) {\n if (s->stream_state_ == BROTLI_STREAM_FLUSH_REQUESTED &&\n s->last_bytes_bits_ != 0) {\n InjectBytePaddingBlock(s);\n return BROTLI_TRUE;\n }\n\n if (s->available_out_ != 0 && *available_out != 0) {\n size_t copy_output_size =\n BROTLI_MIN(size_t, s->available_out_, *available_out);\n memcpy(*next_out, s->next_out_, copy_output_size);\n *next_out += copy_output_size;\n *available_out -= copy_output_size;\n s->next_out_ += copy_output_size;\n s->available_out_ -= copy_output_size;\n s->total_out_ += copy_output_size;\n SetTotalOut(s, total_out);\n return BROTLI_TRUE;\n }\n\n return BROTLI_FALSE;\n}\n\nstatic void CheckFlushComplete(BrotliEncoderState* s) {\n if (s->stream_state_ == BROTLI_STREAM_FLUSH_REQUESTED &&\n s->available_out_ == 0) {\n s->stream_state_ = BROTLI_STREAM_PROCESSING;\n s->next_out_ = 0;\n }\n}\n\nstatic BROTLI_BOOL BrotliEncoderCompressStreamFast(\n BrotliEncoderState* s, BrotliEncoderOperation op, size_t* available_in,\n const uint8_t** next_in, size_t* available_out, uint8_t** next_out,\n size_t* total_out) {\n const size_t block_size_limit = (size_t)1 << s->params.lgwin;\n const size_t buf_size = BROTLI_MIN(size_t, kCompressFragmentTwoPassBlockSize,\n BROTLI_MIN(size_t, *available_in, block_size_limit));\n uint32_t* tmp_command_buf = NULL;\n uint32_t* command_buf = NULL;\n uint8_t* tmp_literal_buf = NULL;\n uint8_t* literal_buf = NULL;\n MemoryManager* m = &s->memory_manager_;\n if (s->params.quality != FAST_ONE_PASS_COMPRESSION_QUALITY &&\n s->params.quality != FAST_TWO_PASS_COMPRESSION_QUALITY) {\n return BROTLI_FALSE;\n }\n if (s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\n if (!s->command_buf_ && buf_size == kCompressFragmentTwoPassBlockSize) {\n s->command_buf_ =\n BROTLI_ALLOC(m, uint32_t, kCompressFragmentTwoPassBlockSize);\n s->literal_buf_ =\n BROTLI_ALLOC(m, uint8_t, kCompressFragmentTwoPassBlockSize);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(s->command_buf_) ||\n BROTLI_IS_NULL(s->literal_buf_)) {\n return BROTLI_FALSE;\n }\n }\n if (s->command_buf_) {\n command_buf = s->command_buf_;\n literal_buf = s->literal_buf_;\n } else {\n tmp_command_buf = BROTLI_ALLOC(m, uint32_t, buf_size);\n tmp_literal_buf = BROTLI_ALLOC(m, uint8_t, buf_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tmp_command_buf) ||\n BROTLI_IS_NULL(tmp_literal_buf)) {\n return BROTLI_FALSE;\n }\n command_buf = tmp_command_buf;\n literal_buf = tmp_literal_buf;\n }\n }\n\n while (BROTLI_TRUE) {\n if (InjectFlushOrPushOutput(s, available_out, next_out, total_out)) {\n continue;\n }\n\n /* Compress block only when internal output buffer is empty, stream is not\n finished, there is no pending flush request, and there is either\n additional input or pending operation. */\n if (s->available_out_ == 0 &&\n s->stream_state_ == BROTLI_STREAM_PROCESSING &&\n (*available_in != 0 || op != BROTLI_OPERATION_PROCESS)) {\n size_t block_size = BROTLI_MIN(size_t, block_size_limit, *available_in);\n BROTLI_BOOL is_last =\n (*available_in == block_size) && (op == BROTLI_OPERATION_FINISH);\n BROTLI_BOOL force_flush =\n (*available_in == block_size) && (op == BROTLI_OPERATION_FLUSH);\n size_t max_out_size = 2 * block_size + 503;\n BROTLI_BOOL inplace = BROTLI_TRUE;\n uint8_t* storage = NULL;\n size_t storage_ix = s->last_bytes_bits_;\n size_t table_size;\n int* table;\n\n if (force_flush && block_size == 0) {\n s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;\n continue;\n }\n if (max_out_size <= *available_out) {\n storage = *next_out;\n } else {\n inplace = BROTLI_FALSE;\n storage = GetBrotliStorage(s, max_out_size);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n }\n storage[0] = (uint8_t)s->last_bytes_;\n storage[1] = (uint8_t)(s->last_bytes_ >> 8);\n table = GetHashTable(s, s->params.quality, block_size, &table_size);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n\n if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\n BrotliCompressFragmentFast(s->one_pass_arena_, *next_in, block_size,\n is_last, table, table_size, &storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n } else {\n BrotliCompressFragmentTwoPass(s->two_pass_arena_, *next_in, block_size,\n is_last, command_buf, literal_buf, table, table_size,\n &storage_ix, storage);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n }\n if (block_size != 0) {\n *next_in += block_size;\n *available_in -= block_size;\n s->total_in_ += block_size;\n }\n if (inplace) {\n size_t out_bytes = storage_ix >> 3;\n BROTLI_DCHECK(out_bytes <= *available_out);\n BROTLI_DCHECK((storage_ix & 7) == 0 || out_bytes < *available_out);\n *next_out += out_bytes;\n *available_out -= out_bytes;\n s->total_out_ += out_bytes;\n SetTotalOut(s, total_out);\n } else {\n size_t out_bytes = storage_ix >> 3;\n s->next_out_ = storage;\n s->available_out_ = out_bytes;\n }\n s->last_bytes_ = (uint16_t)(storage[storage_ix >> 3]);\n s->last_bytes_bits_ = storage_ix & 7u;\n\n if (force_flush) s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;\n if (is_last) s->stream_state_ = BROTLI_STREAM_FINISHED;\n continue;\n }\n break;\n }\n BROTLI_FREE(m, tmp_command_buf);\n BROTLI_FREE(m, tmp_literal_buf);\n CheckFlushComplete(s);\n return BROTLI_TRUE;\n}\n\nstatic BROTLI_BOOL ProcessMetadata(\n BrotliEncoderState* s, size_t* available_in, const uint8_t** next_in,\n size_t* available_out, uint8_t** next_out, size_t* total_out) {\n if (*available_in > (1u << 24)) return BROTLI_FALSE;\n /* Switch to metadata block workflow, if required. */\n if (s->stream_state_ == BROTLI_STREAM_PROCESSING) {\n s->remaining_metadata_bytes_ = (uint32_t)*available_in;\n s->stream_state_ = BROTLI_STREAM_METADATA_HEAD;\n }\n if (s->stream_state_ != BROTLI_STREAM_METADATA_HEAD &&\n s->stream_state_ != BROTLI_STREAM_METADATA_BODY) {\n return BROTLI_FALSE;\n }\n\n while (BROTLI_TRUE) {\n if (InjectFlushOrPushOutput(s, available_out, next_out, total_out)) {\n continue;\n }\n if (s->available_out_ != 0) break;\n\n if (s->input_pos_ != s->last_flush_pos_) {\n BROTLI_BOOL result = EncodeData(s, BROTLI_FALSE, BROTLI_TRUE,\n &s->available_out_, &s->next_out_);\n if (!result) return BROTLI_FALSE;\n continue;\n }\n\n if (s->stream_state_ == BROTLI_STREAM_METADATA_HEAD) {\n s->next_out_ = s->tiny_buf_.u8;\n s->available_out_ =\n WriteMetadataHeader(s, s->remaining_metadata_bytes_, s->next_out_);\n s->stream_state_ = BROTLI_STREAM_METADATA_BODY;\n continue;\n } else {\n /* Exit workflow only when there is no more input and no more output.\n Otherwise client may continue producing empty metadata blocks. */\n if (s->remaining_metadata_bytes_ == 0) {\n s->remaining_metadata_bytes_ = BROTLI_UINT32_MAX;\n s->stream_state_ = BROTLI_STREAM_PROCESSING;\n break;\n }\n if (*available_out) {\n /* Directly copy input to output. */\n uint32_t copy = (uint32_t)BROTLI_MIN(\n size_t, s->remaining_metadata_bytes_, *available_out);\n memcpy(*next_out, *next_in, copy);\n *next_in += copy;\n *available_in -= copy;\n s->total_in_ += copy; /* not actually data input, though */\n s->remaining_metadata_bytes_ -= copy;\n *next_out += copy;\n *available_out -= copy;\n } else {\n /* This guarantees progress in \"TakeOutput\" workflow. */\n uint32_t copy = BROTLI_MIN(uint32_t, s->remaining_metadata_bytes_, 16);\n s->next_out_ = s->tiny_buf_.u8;\n memcpy(s->next_out_, *next_in, copy);\n *next_in += copy;\n *available_in -= copy;\n s->total_in_ += copy; /* not actually data input, though */\n s->remaining_metadata_bytes_ -= copy;\n s->available_out_ = copy;\n }\n continue;\n }\n }\n\n return BROTLI_TRUE;\n}\n\nstatic void UpdateSizeHint(BrotliEncoderState* s, size_t available_in) {\n if (s->params.size_hint == 0) {\n uint64_t delta = UnprocessedInputSize(s);\n uint64_t tail = available_in;\n uint32_t limit = 1u << 30;\n uint32_t total;\n if ((delta >= limit) || (tail >= limit) || ((delta + tail) >= limit)) {\n total = limit;\n } else {\n total = (uint32_t)(delta + tail);\n }\n s->params.size_hint = total;\n }\n}\n\nBROTLI_BOOL BrotliEncoderCompressStream(\n BrotliEncoderState* s, BrotliEncoderOperation op, size_t* available_in,\n const uint8_t** next_in, size_t* available_out, uint8_t** next_out,\n size_t* total_out) {\n if (!EnsureInitialized(s)) return BROTLI_FALSE;\n\n /* Unfinished metadata block; check requirements. */\n if (s->remaining_metadata_bytes_ != BROTLI_UINT32_MAX) {\n if (*available_in != s->remaining_metadata_bytes_) return BROTLI_FALSE;\n if (op != BROTLI_OPERATION_EMIT_METADATA) return BROTLI_FALSE;\n }\n\n if (op == BROTLI_OPERATION_EMIT_METADATA) {\n UpdateSizeHint(s, 0); /* First data metablock might be emitted here. */\n return ProcessMetadata(\n s, available_in, next_in, available_out, next_out, total_out);\n }\n\n if (s->stream_state_ == BROTLI_STREAM_METADATA_HEAD ||\n s->stream_state_ == BROTLI_STREAM_METADATA_BODY) {\n return BROTLI_FALSE;\n }\n\n if (s->stream_state_ != BROTLI_STREAM_PROCESSING && *available_in != 0) {\n return BROTLI_FALSE;\n }\n if (s->params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\n s->params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\n return BrotliEncoderCompressStreamFast(s, op, available_in, next_in,\n available_out, next_out, total_out);\n }\n while (BROTLI_TRUE) {\n size_t remaining_block_size = RemainingInputBlockSize(s);\n /* Shorten input to flint size. */\n if (s->flint_ >= 0 && remaining_block_size > (size_t)s->flint_) {\n remaining_block_size = (size_t)s->flint_;\n }\n\n if (remaining_block_size != 0 && *available_in != 0) {\n size_t copy_input_size =\n BROTLI_MIN(size_t, remaining_block_size, *available_in);\n CopyInputToRingBuffer(s, copy_input_size, *next_in);\n *next_in += copy_input_size;\n *available_in -= copy_input_size;\n s->total_in_ += copy_input_size;\n if (s->flint_ > 0) s->flint_ = (int8_t)(s->flint_ - (int)copy_input_size);\n continue;\n }\n\n if (InjectFlushOrPushOutput(s, available_out, next_out, total_out)) {\n /* Exit the \"emit flint\" workflow. */\n if (s->flint_ == BROTLI_FLINT_WAITING_FOR_FLUSHING) {\n CheckFlushComplete(s);\n if (s->stream_state_ == BROTLI_STREAM_PROCESSING) {\n s->flint_ = BROTLI_FLINT_DONE;\n }\n }\n continue;\n }\n\n /* Compress data only when internal output buffer is empty, stream is not\n finished and there is no pending flush request. */\n if (s->available_out_ == 0 &&\n s->stream_state_ == BROTLI_STREAM_PROCESSING) {\n if (remaining_block_size == 0 || op != BROTLI_OPERATION_PROCESS) {\n BROTLI_BOOL is_last = TO_BROTLI_BOOL(\n (*available_in == 0) && op == BROTLI_OPERATION_FINISH);\n BROTLI_BOOL force_flush = TO_BROTLI_BOOL(\n (*available_in == 0) && op == BROTLI_OPERATION_FLUSH);\n BROTLI_BOOL result;\n /* Force emitting (uncompressed) piece containing flint. */\n if (!is_last && s->flint_ == 0) {\n s->flint_ = BROTLI_FLINT_WAITING_FOR_FLUSHING;\n force_flush = BROTLI_TRUE;\n }\n UpdateSizeHint(s, *available_in);\n result = EncodeData(s, is_last, force_flush,\n &s->available_out_, &s->next_out_);\n if (!result) return BROTLI_FALSE;\n if (force_flush) s->stream_state_ = BROTLI_STREAM_FLUSH_REQUESTED;\n if (is_last) s->stream_state_ = BROTLI_STREAM_FINISHED;\n continue;\n }\n }\n break;\n }\n CheckFlushComplete(s);\n return BROTLI_TRUE;\n}\n\nBROTLI_BOOL BrotliEncoderIsFinished(BrotliEncoderState* s) {\n return TO_BROTLI_BOOL(s->stream_state_ == BROTLI_STREAM_FINISHED &&\n !BrotliEncoderHasMoreOutput(s));\n}\n\nBROTLI_BOOL BrotliEncoderHasMoreOutput(BrotliEncoderState* s) {\n return TO_BROTLI_BOOL(s->available_out_ != 0);\n}\n\nconst uint8_t* BrotliEncoderTakeOutput(BrotliEncoderState* s, size_t* size) {\n size_t consumed_size = s->available_out_;\n uint8_t* result = s->next_out_;\n if (*size) {\n consumed_size = BROTLI_MIN(size_t, *size, s->available_out_);\n }\n if (consumed_size) {\n s->next_out_ += consumed_size;\n s->available_out_ -= consumed_size;\n s->total_out_ += consumed_size;\n CheckFlushComplete(s);\n *size = consumed_size;\n } else {\n *size = 0;\n result = 0;\n }\n return result;\n}\n\nuint32_t BrotliEncoderVersion(void) {\n return BROTLI_VERSION;\n}\n\nBrotliEncoderPreparedDictionary* BrotliEncoderPrepareDictionary(\n BrotliSharedDictionaryType type, size_t size,\n const uint8_t data[BROTLI_ARRAY_PARAM(size)], int quality,\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {\n ManagedDictionary* managed_dictionary = NULL;\n BROTLI_BOOL type_is_known = BROTLI_FALSE;\n type_is_known |= (type == BROTLI_SHARED_DICTIONARY_RAW);\n#if defined(BROTLI_EXPERIMENTAL)\n type_is_known |= (type == BROTLI_SHARED_DICTIONARY_SERIALIZED);\n#endif /* BROTLI_EXPERIMENTAL */\n if (!type_is_known) {\n return NULL;\n }\n managed_dictionary =\n BrotliCreateManagedDictionary(alloc_func, free_func, opaque);\n if (managed_dictionary == NULL) {\n return NULL;\n }\n if (type == BROTLI_SHARED_DICTIONARY_RAW) {\n managed_dictionary->dictionary = (uint32_t*)CreatePreparedDictionary(\n &managed_dictionary->memory_manager_, data, size);\n }\n#if defined(BROTLI_EXPERIMENTAL)\n if (type == BROTLI_SHARED_DICTIONARY_SERIALIZED) {\n SharedEncoderDictionary* dict = (SharedEncoderDictionary*)BrotliAllocate(\n &managed_dictionary->memory_manager_, sizeof(SharedEncoderDictionary));\n managed_dictionary->dictionary = (uint32_t*)dict;\n if (dict != NULL) {\n BROTLI_BOOL ok = BrotliInitCustomSharedEncoderDictionary(\n &managed_dictionary->memory_manager_, data, size, quality, dict);\n if (!ok) {\n BrotliFree(&managed_dictionary->memory_manager_, dict);\n managed_dictionary->dictionary = NULL;\n }\n }\n }\n#else /* BROTLI_EXPERIMENTAL */\n (void)quality;\n#endif /* BROTLI_EXPERIMENTAL */\n if (managed_dictionary->dictionary == NULL) {\n BrotliDestroyManagedDictionary(managed_dictionary);\n return NULL;\n }\n return (BrotliEncoderPreparedDictionary*)managed_dictionary;\n}\n\nvoid BROTLI_COLD BrotliEncoderDestroyPreparedDictionary(\n BrotliEncoderPreparedDictionary* dictionary) {\n ManagedDictionary* dict = (ManagedDictionary*)dictionary;\n if (!dictionary) return;\n /* First field of dictionary structs. */\n /* Only managed dictionaries are eligible for destruction by this method. */\n if (dict->magic != kManagedDictionaryMagic) {\n return;\n }\n if (dict->dictionary == NULL) {\n /* This should never ever happen. */\n } else if (*dict->dictionary == kLeanPreparedDictionaryMagic) {\n DestroyPreparedDictionary(\n &dict->memory_manager_, (PreparedDictionary*)dict->dictionary);\n } else if (*dict->dictionary == kSharedDictionaryMagic) {\n BrotliCleanupSharedEncoderDictionary(&dict->memory_manager_,\n (SharedEncoderDictionary*)dict->dictionary);\n BrotliFree(&dict->memory_manager_, dict->dictionary);\n } else {\n /* There is also kPreparedDictionaryMagic, but such instances should be\n * constructed and destroyed by different means. */\n }\n dict->dictionary = NULL;\n BrotliDestroyManagedDictionary(dict);\n}\n\nBROTLI_BOOL BROTLI_COLD BrotliEncoderAttachPreparedDictionary(\n BrotliEncoderState* state,\n const BrotliEncoderPreparedDictionary* dictionary) {\n /* First field of dictionary structs */\n const BrotliEncoderPreparedDictionary* dict = dictionary;\n uint32_t magic = *((const uint32_t*)dict);\n SharedEncoderDictionary* current = NULL;\n if (magic == kManagedDictionaryMagic) {\n /* Unwrap managed dictionary. */\n ManagedDictionary* managed_dictionary = (ManagedDictionary*)dict;\n magic = *managed_dictionary->dictionary;\n dict = (BrotliEncoderPreparedDictionary*)managed_dictionary->dictionary;\n }\n current = &state->params.dictionary;\n if (magic == kPreparedDictionaryMagic ||\n magic == kLeanPreparedDictionaryMagic) {\n const PreparedDictionary* prepared = (const PreparedDictionary*)dict;\n if (!AttachPreparedDictionary(¤t->compound, prepared)) {\n return BROTLI_FALSE;\n }\n } else if (magic == kSharedDictionaryMagic) {\n const SharedEncoderDictionary* attached =\n (const SharedEncoderDictionary*)dict;\n BROTLI_BOOL was_default = !current->contextual.context_based &&\n current->contextual.num_dictionaries == 1 &&\n current->contextual.dict[0]->hash_table_words ==\n kStaticDictionaryHashWords &&\n current->contextual.dict[0]->hash_table_lengths ==\n kStaticDictionaryHashLengths;\n BROTLI_BOOL new_default = !attached->contextual.context_based &&\n attached->contextual.num_dictionaries == 1 &&\n attached->contextual.dict[0]->hash_table_words ==\n kStaticDictionaryHashWords &&\n attached->contextual.dict[0]->hash_table_lengths ==\n kStaticDictionaryHashLengths;\n size_t i;\n if (state->is_initialized_) return BROTLI_FALSE;\n current->max_quality =\n BROTLI_MIN(int, current->max_quality, attached->max_quality);\n for (i = 0; i < attached->compound.num_chunks; i++) {\n if (!AttachPreparedDictionary(¤t->compound,\n attached->compound.chunks[i])) {\n return BROTLI_FALSE;\n }\n }\n if (!new_default) {\n if (!was_default) return BROTLI_FALSE;\n /* Copy by value, but then set num_instances_ to 0 because their memory\n is managed by attached, not by current */\n current->contextual = attached->contextual;\n current->contextual.num_instances_ = 0;\n }\n } else {\n return BROTLI_FALSE;\n }\n return BROTLI_TRUE;\n}\n\nsize_t BROTLI_COLD BrotliEncoderEstimatePeakMemoryUsage(int quality, int lgwin,\n size_t input_size) {\n BrotliEncoderParams params;\n size_t memory_manager_slots = BROTLI_ENCODER_MEMORY_MANAGER_SLOTS;\n size_t memory_manager_size = memory_manager_slots * sizeof(void*);\n BrotliEncoderInitParams(¶ms);\n params.quality = quality;\n params.lgwin = lgwin;\n params.size_hint = input_size;\n params.large_window = lgwin > BROTLI_MAX_WINDOW_BITS;\n SanitizeParams(¶ms);\n params.lgblock = ComputeLgBlock(¶ms);\n ChooseHasher(¶ms, ¶ms.hasher);\n if (params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\n params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\n size_t state_size = sizeof(BrotliEncoderState);\n size_t block_size = BROTLI_MIN(size_t, input_size, ((size_t)1ul << params.lgwin));\n size_t hash_table_size =\n HashTableSize(MaxHashTableSize(params.quality), block_size);\n size_t hash_size =\n (hash_table_size < (1u << 10)) ? 0 : sizeof(int) * hash_table_size;\n size_t cmdbuf_size = params.quality == FAST_TWO_PASS_COMPRESSION_QUALITY ?\n 5 * BROTLI_MIN(size_t, block_size, 1ul << 17) : 0;\n if (params.quality == FAST_ONE_PASS_COMPRESSION_QUALITY) {\n state_size += sizeof(BrotliOnePassArena);\n } else {\n state_size += sizeof(BrotliTwoPassArena);\n }\n return hash_size + cmdbuf_size + state_size;\n } else {\n size_t short_ringbuffer_size = (size_t)1 << params.lgblock;\n int ringbuffer_bits = ComputeRbBits(¶ms);\n size_t ringbuffer_size = input_size < short_ringbuffer_size ?\n input_size : ((size_t)1u << ringbuffer_bits) + short_ringbuffer_size;\n size_t hash_size[4] = {0};\n size_t metablock_size =\n BROTLI_MIN(size_t, input_size, MaxMetablockSize(¶ms));\n size_t inputblock_size =\n BROTLI_MIN(size_t, input_size, (size_t)1 << params.lgblock);\n size_t cmdbuf_size = metablock_size * 2 + inputblock_size * 6;\n size_t outbuf_size = metablock_size * 2 + 503;\n size_t histogram_size = 0;\n HasherSize(¶ms, BROTLI_TRUE, input_size, hash_size);\n if (params.quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {\n cmdbuf_size = BROTLI_MIN(size_t, cmdbuf_size,\n MAX_NUM_DELAYED_SYMBOLS * sizeof(Command) + inputblock_size * 12);\n }\n if (params.quality >= MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING) {\n /* Only a very rough estimation, based on enwik8. */\n histogram_size = 200 << 20;\n } else if (params.quality >= MIN_QUALITY_FOR_BLOCK_SPLIT) {\n size_t literal_histograms =\n BROTLI_MIN(size_t, metablock_size / 6144, 256);\n size_t command_histograms =\n BROTLI_MIN(size_t, metablock_size / 6144, 256);\n size_t distance_histograms =\n BROTLI_MIN(size_t, metablock_size / 6144, 256);\n histogram_size = literal_histograms * sizeof(HistogramLiteral) +\n command_histograms * sizeof(HistogramCommand) +\n distance_histograms * sizeof(HistogramDistance);\n }\n return (memory_manager_size + ringbuffer_size +\n hash_size[0] + hash_size[1] + hash_size[2] + hash_size[3] +\n cmdbuf_size +\n outbuf_size +\n histogram_size);\n }\n}\nsize_t BROTLI_COLD BrotliEncoderGetPreparedDictionarySize(\n const BrotliEncoderPreparedDictionary* prepared_dictionary) {\n /* First field of dictionary structs */\n const BrotliEncoderPreparedDictionary* prepared = prepared_dictionary;\n uint32_t magic = *((const uint32_t*)prepared);\n size_t overhead = 0;\n if (magic == kManagedDictionaryMagic) {\n const ManagedDictionary* managed = (const ManagedDictionary*)prepared;\n overhead = sizeof(ManagedDictionary);\n magic = *managed->dictionary;\n prepared = (const BrotliEncoderPreparedDictionary*)managed->dictionary;\n }\n\n if (magic == kPreparedDictionaryMagic) {\n const PreparedDictionary* dictionary =\n (const PreparedDictionary*)prepared;\n /* Keep in sync with step 3 of CreatePreparedDictionary */\n return sizeof(PreparedDictionary) + dictionary->source_size +\n (sizeof(uint32_t) << dictionary->slot_bits) +\n (sizeof(uint16_t) << dictionary->bucket_bits) +\n (sizeof(uint32_t) * dictionary->num_items) + overhead;\n } else if (magic == kLeanPreparedDictionaryMagic) {\n const PreparedDictionary* dictionary =\n (const PreparedDictionary*)prepared;\n /* Keep in sync with step 3 of CreatePreparedDictionary */\n return sizeof(PreparedDictionary) + sizeof(uint8_t*) +\n (sizeof(uint32_t) << dictionary->slot_bits) +\n (sizeof(uint16_t) << dictionary->bucket_bits) +\n (sizeof(uint32_t) * dictionary->num_items) + overhead;\n } else if (magic == kSharedDictionaryMagic) {\n const SharedEncoderDictionary* dictionary =\n (const SharedEncoderDictionary*)prepared;\n const CompoundDictionary* compound = &dictionary->compound;\n const ContextualEncoderDictionary* contextual = &dictionary->contextual;\n size_t result = sizeof(*dictionary);\n size_t i;\n size_t num_instances;\n const BrotliEncoderDictionary* instances;\n for (i = 0; i < compound->num_prepared_instances_; i++) {\n size_t size = BrotliEncoderGetPreparedDictionarySize(\n (const BrotliEncoderPreparedDictionary*)\n compound->prepared_instances_[i]);\n if (!size) return 0; /* error */\n result += size;\n }\n if (contextual->context_based) {\n num_instances = contextual->num_instances_;\n instances = contextual->instances_;\n result += sizeof(*instances) * num_instances;\n } else {\n num_instances = 1;\n instances = &contextual->instance_;\n }\n for (i = 0; i < num_instances; i++) {\n const BrotliEncoderDictionary* dict = &instances[i];\n result += dict->trie.pool_capacity * sizeof(BrotliTrieNode);\n if (dict->hash_table_data_words_) {\n result += sizeof(kStaticDictionaryHashWords);\n }\n if (dict->hash_table_data_lengths_) {\n result += sizeof(kStaticDictionaryHashLengths);\n }\n if (dict->buckets_data_) {\n result += sizeof(*dict->buckets_data_) * dict->buckets_alloc_size_;\n }\n if (dict->dict_words_data_) {\n result += sizeof(*dict->dict_words) * dict->dict_words_alloc_size_;\n }\n if (dict->words_instance_) {\n result += sizeof(*dict->words_instance_);\n /* data_size not added here: it is never allocated by the\n SharedEncoderDictionary, instead it always points to the file\n already loaded in memory. So if the caller wants to include\n this memory as well, add the size of the loaded dictionary\n file to this. */\n }\n }\n return result + overhead;\n }\n return 0; /* error */\n}\n\n#if defined(BROTLI_TEST)\nsize_t BrotliMakeUncompressedStreamForTest(const uint8_t*, size_t, uint8_t*);\nsize_t BrotliMakeUncompressedStreamForTest(\n const uint8_t* input, size_t input_size, uint8_t* output) {\n return MakeUncompressedStream(input, input_size, output);\n}\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/encoder_dict.c", "content": "/* Copyright 2017 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"encoder_dict.h\"\n\n#include \"../common/dictionary.h\"\n#include \"../common/platform.h\"\n#include \n#include \"../common/shared_dictionary_internal.h\"\n#include \"../common/transform.h\"\n#include \n#include \"compound_dictionary.h\"\n#include \"dictionary_hash.h\"\n#include \"hash_base.h\"\n#include \"hash.h\"\n#include \"memory.h\"\n#include \"quality.h\"\n#include \"static_dict_lut.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define NUM_HASH_BITS 15u\n#define NUM_HASH_BUCKETS (1u << NUM_HASH_BITS)\n\nstatic void BrotliTrieInit(BrotliTrie* trie) {\n trie->pool_capacity = 0;\n trie->pool_size = 0;\n trie->pool = 0;\n\n /* Set up the root node */\n trie->root.single = 0;\n trie->root.len_ = 0;\n trie->root.idx_ = 0;\n trie->root.sub = 0;\n}\n\nstatic void BrotliTrieFree(MemoryManager* m, BrotliTrie* trie) {\n BrotliFree(m, trie->pool);\n}\n\n/* Initializes to RFC 7932 static dictionary / transforms. */\nstatic void InitEncoderDictionary(BrotliEncoderDictionary* dict) {\n dict->words = BrotliGetDictionary();\n dict->num_transforms = (uint32_t)BrotliGetTransforms()->num_transforms;\n\n dict->hash_table_words = kStaticDictionaryHashWords;\n dict->hash_table_lengths = kStaticDictionaryHashLengths;\n dict->buckets = kStaticDictionaryBuckets;\n dict->dict_words = kStaticDictionaryWords;\n\n dict->cutoffTransformsCount = kCutoffTransformsCount;\n dict->cutoffTransforms = kCutoffTransforms;\n\n dict->parent = 0;\n\n dict->hash_table_data_words_ = 0;\n dict->hash_table_data_lengths_ = 0;\n dict->buckets_alloc_size_ = 0;\n dict->buckets_data_ = 0;\n dict->dict_words_alloc_size_ = 0;\n dict->dict_words_data_ = 0;\n dict->words_instance_ = 0;\n dict->has_words_heavy = BROTLI_FALSE;\n BrotliTrieInit(&dict->trie);\n}\n\nstatic void BrotliDestroyEncoderDictionary(MemoryManager* m,\n BrotliEncoderDictionary* dict) {\n BrotliFree(m, dict->hash_table_data_words_);\n BrotliFree(m, dict->hash_table_data_lengths_);\n BrotliFree(m, dict->buckets_data_);\n BrotliFree(m, dict->dict_words_data_);\n BrotliFree(m, dict->words_instance_);\n BrotliTrieFree(m, &dict->trie);\n}\n\n#if defined(BROTLI_EXPERIMENTAL)\n/* Word length must be at least 4 bytes */\nstatic uint32_t Hash(const uint8_t* data, int bits) {\n uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return h >> (32 - bits);\n}\n\n/* Theoretical max possible word size after transform */\n#define kTransformedBufferSize \\\n (256 + 256 + SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH)\n\n/* To be safe buffer must have at least kTransformedBufferSize */\nstatic void TransformedDictionaryWord(uint32_t word_idx, int len, int transform,\n const BrotliTransforms* transforms,\n const BrotliEncoderDictionary* dict,\n uint8_t* buffer, size_t* size) {\n const uint8_t* dict_word = &dict->words->data[\n dict->words->offsets_by_length[len] + (uint32_t)len * word_idx];\n *size = (size_t)BrotliTransformDictionaryWord(buffer, dict_word, len,\n transforms, transform);\n}\n\nstatic DictWord MakeDictWord(uint8_t len, uint8_t transform, uint16_t idx) {\n DictWord result;\n result.len = len;\n result.transform = transform;\n result.idx = idx;\n return result;\n}\n\nstatic uint32_t BrotliTrieAlloc(MemoryManager* m, size_t num, BrotliTrie* trie,\n BrotliTrieNode** keep) {\n uint32_t result;\n uint32_t keep_index = 0;\n if (keep && *keep != &trie->root) {\n /* Optional node to keep, since address may change after re-allocating */\n keep_index = (uint32_t)(*keep - trie->pool);\n }\n if (trie->pool_size == 0) {\n /* Have a placeholder node in the front. We do not want the result to be 0,\n it must be at least 1, 0 represents \"null pointer\" */\n trie->pool_size = 1;\n }\n BROTLI_ENSURE_CAPACITY(m, BrotliTrieNode, trie->pool, trie->pool_capacity,\n trie->pool_size + num);\n if (BROTLI_IS_OOM(m)) return 0;\n /* Init the new nodes to empty */\n memset(trie->pool + trie->pool_size, 0, sizeof(*trie->pool) * num);\n result = (uint32_t)trie->pool_size;\n trie->pool_size += num;\n if (keep && *keep != &trie->root) {\n *keep = trie->pool + keep_index;\n }\n return result;\n}\n\n/**\n * len and idx: payload for last node\n * word, size: the string\n * index: position in the string\n */\nstatic BROTLI_BOOL BrotliTrieNodeAdd(MemoryManager* m, uint8_t len,\n uint32_t idx, const uint8_t* word, size_t size, int index,\n BrotliTrieNode* node, BrotliTrie* trie) {\n BrotliTrieNode* child = 0;\n uint8_t c;\n if ((size_t)index == size) {\n if (!node->len_ || idx < node->idx_) {\n node->len_ = len;\n node->idx_ = idx;\n }\n return BROTLI_TRUE;\n }\n c = word[index];\n if (node->single && c != node->c) {\n BrotliTrieNode old = trie->pool[node->sub];\n uint32_t new_nodes = BrotliTrieAlloc(m, 32, trie, &node);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n node->single = 0;\n node->sub = new_nodes;\n trie->pool[node->sub + (node->c >> 4)].sub = new_nodes + 16;\n trie->pool[trie->pool[node->sub + (node->c >> 4)].sub + (node->c & 15)] =\n old;\n }\n if (!node->sub) {\n uint32_t new_node = BrotliTrieAlloc(m, 1, trie, &node);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n node->single = 1;\n node->c = c;\n node->sub = new_node;\n }\n if (node->single) {\n child = &trie->pool[node->sub];\n } else {\n if (!trie->pool[node->sub + (c >> 4)].sub) {\n uint32_t new_nodes = BrotliTrieAlloc(m, 16, trie, &node);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n trie->pool[node->sub + (c >> 4)].sub = new_nodes;\n }\n child = &trie->pool[trie->pool[node->sub + (c >> 4)].sub + (c & 15)];\n }\n return BrotliTrieNodeAdd(m, len, idx, word, size, index + 1, child, trie);\n}\n\nstatic BROTLI_BOOL BrotliTrieAdd(MemoryManager* m, uint8_t len, uint32_t idx,\n const uint8_t* word, size_t size, BrotliTrie* trie) {\n return BrotliTrieNodeAdd(m, len, idx, word, size, 0, &trie->root, trie);\n}\n\nconst BrotliTrieNode* BrotliTrieSub(const BrotliTrie* trie,\n const BrotliTrieNode* node, uint8_t c) {\n BrotliTrieNode* temp_node;\n if (node->single) {\n if (node->c == c) return &trie->pool[node->sub];\n return 0;\n }\n if (!node->sub) return 0;\n temp_node = &trie->pool[node->sub + (c >> 4)];\n if (!temp_node->sub) return 0;\n return &trie->pool[temp_node->sub + (c & 15)];\n}\n\nstatic const BrotliTrieNode* BrotliTrieFind(const BrotliTrie* trie,\n const uint8_t* word, size_t size) {\n const BrotliTrieNode* node = &trie->root;\n size_t i;\n for (i = 0; i < size; i++) {\n node = BrotliTrieSub(trie, node, word[i]);\n if (!node) return 0;\n }\n return node;\n}\n\nstatic BROTLI_BOOL BuildDictionaryLut(MemoryManager* m,\n const BrotliTransforms* transforms,\n BrotliEncoderDictionary* dict) {\n uint32_t i;\n DictWord* dict_words;\n uint16_t* buckets;\n DictWord** words_by_hash;\n size_t* words_by_hash_size;\n size_t* words_by_hash_capacity;\n BrotliTrie dedup;\n uint8_t word[kTransformedBufferSize];\n size_t word_size;\n size_t total = 0;\n uint8_t l;\n uint16_t idx;\n\n BrotliTrieInit(&dedup);\n\n words_by_hash = (DictWord**)BrotliAllocate(m,\n sizeof(*words_by_hash) * NUM_HASH_BUCKETS);\n words_by_hash_size = (size_t*)BrotliAllocate(m,\n sizeof(*words_by_hash_size) * NUM_HASH_BUCKETS);\n words_by_hash_capacity = (size_t*)BrotliAllocate(m,\n sizeof(*words_by_hash_capacity) * NUM_HASH_BUCKETS);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n memset(words_by_hash, 0, sizeof(*words_by_hash) * NUM_HASH_BUCKETS);\n memset(words_by_hash_size, 0, sizeof(*words_by_hash_size) * NUM_HASH_BUCKETS);\n memset(words_by_hash_capacity, 0,\n sizeof(*words_by_hash_capacity) * NUM_HASH_BUCKETS);\n\n if (transforms->num_transforms > 0) {\n for (l = SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH;\n l <= SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH; ++l) {\n uint16_t n = dict->words->size_bits_by_length[l] ?\n (uint16_t)(1 << dict->words->size_bits_by_length[l]) : 0u;\n for (idx = 0; idx < n; ++idx) {\n uint32_t key;\n /* First transform (usually identity) */\n TransformedDictionaryWord(idx, l, 0, transforms, dict, word,\n &word_size);\n /* Cannot hash words smaller than 4 bytes */\n if (word_size < 4) {\n /* Break instead of continue, all next words of this length will have\n same length after transform */\n break;\n }\n if (!BrotliTrieAdd(m, 0, idx, word, word_size, &dedup)) {\n return BROTLI_FALSE;\n }\n key = Hash(word, NUM_HASH_BITS);\n BROTLI_ENSURE_CAPACITY_APPEND(m, DictWord, words_by_hash[key],\n words_by_hash_capacity[key], words_by_hash_size[key],\n MakeDictWord(l, 0, idx));\n ++total;\n }\n }\n }\n\n /* These LUT transforms only supported if no custom transforms. This is\n ok, we will use the heavy trie instead. */\n if (transforms == BrotliGetTransforms()) {\n for (l = SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH;\n l <= SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH; ++l) {\n uint16_t n = dict->words->size_bits_by_length[l] ?\n (uint16_t)(1 << dict->words->size_bits_by_length[l]) : 0u;\n for (idx = 0; idx < n; ++idx) {\n int k;\n BROTLI_BOOL is_ascii = BROTLI_TRUE;\n size_t offset = dict->words->offsets_by_length[l] + (size_t)l * idx;\n const uint8_t* data = &dict->words->data[offset];\n for (k = 0; k < l; ++k) {\n if (data[k] >= 128) is_ascii = BROTLI_FALSE;\n }\n if (data[0] < 128) {\n int transform = 9; /* {empty, uppercase first, empty} */\n uint32_t ix = idx + (uint32_t)transform * n;\n const BrotliTrieNode* it;\n TransformedDictionaryWord(idx, l, transform, transforms,\n dict, word, &word_size);\n it = BrotliTrieFind(&dedup, word, word_size);\n if (!it || it->idx_ > ix) {\n uint32_t key = Hash(word, NUM_HASH_BITS);\n if (!BrotliTrieAdd(m, 0, ix, word, word_size, &dedup)) {\n return BROTLI_FALSE;\n }\n BROTLI_ENSURE_CAPACITY_APPEND(m, DictWord, words_by_hash[key],\n words_by_hash_capacity[key], words_by_hash_size[key],\n MakeDictWord(l, BROTLI_TRANSFORM_UPPERCASE_FIRST, idx));\n ++total;\n }\n }\n if (is_ascii) {\n int transform = 44; /* {empty, uppercase all, empty} */\n uint32_t ix = idx + (uint32_t)transform * n;\n const BrotliTrieNode* it;\n TransformedDictionaryWord(idx, l, transform, transforms,\n dict, word, &word_size);\n it = BrotliTrieFind(&dedup, word, word_size);\n if (!it || it->idx_ > ix) {\n uint32_t key = Hash(word, NUM_HASH_BITS);\n if (!BrotliTrieAdd(m, 0, ix, word, word_size, &dedup)) {\n return BROTLI_FALSE;\n }\n BROTLI_ENSURE_CAPACITY_APPEND(m, DictWord, words_by_hash[key],\n words_by_hash_capacity[key], words_by_hash_size[key],\n MakeDictWord(l, BROTLI_TRANSFORM_UPPERCASE_ALL, idx));\n ++total;\n }\n }\n }\n }\n }\n\n dict_words = (DictWord*)BrotliAllocate(m,\n sizeof(*dict->dict_words) * (total + 1));\n buckets = (uint16_t*)BrotliAllocate(m,\n sizeof(*dict->buckets) * NUM_HASH_BUCKETS);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n dict->dict_words_alloc_size_ = total + 1;\n dict->dict_words = dict->dict_words_data_ = dict_words;\n dict->buckets_alloc_size_ = NUM_HASH_BUCKETS;\n dict->buckets = dict->buckets_data_ = buckets;\n\n /* Unused; makes offsets start from 1. */\n dict_words[0] = MakeDictWord(0, 0, 0);\n total = 1;\n for (i = 0; i < NUM_HASH_BUCKETS; ++i) {\n size_t num_words = words_by_hash_size[i];\n if (num_words > 0) {\n buckets[i] = (uint16_t)(total);\n memcpy(&dict_words[total], &words_by_hash[i][0],\n sizeof(dict_words[0]) * num_words);\n total += num_words;\n dict_words[total - 1].len |= 0x80;\n } else {\n buckets[i] = 0;\n }\n }\n\n for (i = 0; i < NUM_HASH_BUCKETS; ++i) {\n BrotliFree(m, words_by_hash[i]);\n }\n BrotliFree(m, words_by_hash);\n BrotliFree(m, words_by_hash_size);\n BrotliFree(m, words_by_hash_capacity);\n BrotliTrieFree(m, &dedup);\n\n return BROTLI_TRUE;\n}\n\nstatic void BuildDictionaryHashTable(uint16_t* hash_table_words,\n uint8_t* hash_table_lengths, const BrotliDictionary* dict) {\n int j, len;\n /* The order of the loops is such that in case of collision, words with\n shorter length are preferred, and in case of same length, words with\n smaller index. There is only a single word per bucket. */\n /* TODO(lode): consider adding optional user-supplied frequency_map to use\n for preferred words instead, this can make the encoder better for\n quality 9 and below without affecting the decoder */\n memset(hash_table_words, 0, sizeof(kStaticDictionaryHashWords));\n memset(hash_table_lengths, 0, sizeof(kStaticDictionaryHashLengths));\n for (len = SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH;\n len >= SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH; --len) {\n const size_t num_words = dict->size_bits_by_length[len] ?\n (1u << dict->size_bits_by_length[len]) : 0;\n for (j = (int)num_words - 1; j >= 0; --j) {\n size_t offset = dict->offsets_by_length[len] +\n (size_t)len * (size_t)j;\n const uint8_t* word = &dict->data[offset];\n const uint32_t key = Hash(word, 14);\n int idx = (int)(key << 1) + (len < 8 ? 1 : 0);\n BROTLI_DCHECK(idx < (int)NUM_HASH_BUCKETS);\n hash_table_words[idx] = (uint16_t)j;\n hash_table_lengths[idx] = (uint8_t)len;\n }\n }\n}\n\nstatic BROTLI_BOOL GenerateWordsHeavy(MemoryManager* m,\n const BrotliTransforms* transforms,\n BrotliEncoderDictionary* dict) {\n int i, j, l;\n for (j = (int)transforms->num_transforms - 1; j >= 0 ; --j) {\n for (l = 0; l < 32; l++) {\n int num = (int)((1u << dict->words->size_bits_by_length[l]) & ~1u);\n for (i = 0; i < num; i++) {\n uint8_t transformed[kTransformedBufferSize];\n size_t size;\n TransformedDictionaryWord(\n (uint32_t)i, l, j, transforms, dict, transformed, &size);\n if (size < 4) continue;\n if (!BrotliTrieAdd(m, (uint8_t)l, (uint32_t)(i + num * j),\n transformed, size, &dict->trie)) {\n return BROTLI_FALSE;\n }\n }\n }\n }\n return BROTLI_TRUE;\n}\n\n/* Computes cutoffTransformsCount (in count) and cutoffTransforms (in data) for\n the custom transforms, where possible within the limits of the\n cutoffTransforms encoding. The fast encoder uses this to do fast lookup for\n transforms that remove the N last characters (OmitLast). */\nstatic void ComputeCutoffTransforms(\n const BrotliTransforms* transforms,\n uint32_t* count, uint64_t* data) {\n int i;\n /* The encoding in a 64-bit integer of transform N in the data is: (N << 2) +\n ((cutoffTransforms >> (N * 6)) & 0x3F), so for example the identity\n transform code must be 0-63, for N=1 the transform code must be 4-67, ...,\n for N=9 it must be 36-99.\n TODO(lode): consider a simple flexible uint8_t[10] instead of the uint64_t\n for the cutoff transforms, so that shared dictionaries can have the\n OmitLast transforms anywhere without loss. */\n *count = 0;\n *data = 0;\n for (i = 0; i < BROTLI_TRANSFORMS_MAX_CUT_OFF + 1; i++) {\n int idx = transforms->cutOffTransforms[i];\n if (idx == -1) break; /* Not found */\n if (idx < (i << 2)) break; /* Too small for the encoding */\n if (idx >= (i << 2) + 64) break; /* Too large for the encoding */\n (*count)++;\n *data |= (uint64_t)(((uint64_t)idx -\n ((uint64_t)i << 2u)) << ((uint64_t)i * 6u));\n }\n}\n\nstatic BROTLI_BOOL ComputeDictionary(MemoryManager* m, int quality,\n const BrotliTransforms* transforms,\n BrotliEncoderDictionary* current) {\n int default_words = current->words == BrotliGetDictionary();\n int default_transforms = transforms == BrotliGetTransforms();\n\n if (default_words && default_transforms) {\n /* hashes are already set to Brotli defaults */\n return BROTLI_TRUE;\n }\n\n current->hash_table_data_words_ = (uint16_t*)BrotliAllocate(\n m, sizeof(kStaticDictionaryHashWords));\n current->hash_table_data_lengths_ = (uint8_t*)BrotliAllocate(\n m, sizeof(kStaticDictionaryHashLengths));\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n current->hash_table_words = current->hash_table_data_words_;\n current->hash_table_lengths = current->hash_table_data_lengths_;\n\n BuildDictionaryHashTable(current->hash_table_data_words_,\n current->hash_table_data_lengths_, current->words);\n\n ComputeCutoffTransforms(transforms,\n ¤t->cutoffTransformsCount, ¤t->cutoffTransforms);\n\n /* Only compute the data for slow encoder if the requested quality is high\n enough to need it */\n if (quality >= ZOPFLIFICATION_QUALITY) {\n if (!BuildDictionaryLut(m, transforms, current)) return BROTLI_FALSE;\n\n /* For the built-in Brotli transforms, there is a hard-coded function to\n handle all transforms, but for custom transforms, we use the following\n large hammer instead */\n current->has_words_heavy = !default_transforms;\n if (current->has_words_heavy) {\n if (!GenerateWordsHeavy(m, transforms, current)) return BROTLI_FALSE;\n }\n }\n\n return BROTLI_TRUE;\n}\n#endif /* BROTLI_EXPERIMENTAL */\n\nvoid BrotliInitSharedEncoderDictionary(SharedEncoderDictionary* dict) {\n dict->magic = kSharedDictionaryMagic;\n\n dict->compound.num_chunks = 0;\n dict->compound.total_size = 0;\n dict->compound.chunk_offsets[0] = 0;\n dict->compound.num_prepared_instances_ = 0;\n\n dict->contextual.context_based = 0;\n dict->contextual.num_dictionaries = 1;\n dict->contextual.instances_ = 0;\n dict->contextual.num_instances_ = 1; /* The instance_ field */\n dict->contextual.dict[0] = &dict->contextual.instance_;\n InitEncoderDictionary(&dict->contextual.instance_);\n dict->contextual.instance_.parent = &dict->contextual;\n\n dict->max_quality = BROTLI_MAX_QUALITY;\n}\n\n#if defined(BROTLI_EXPERIMENTAL)\n/* TODO(eustas): make sure that tooling will warn user if not all the cutoff\n transforms are available (for low-quality encoder). */\nstatic BROTLI_BOOL InitCustomSharedEncoderDictionary(\n MemoryManager* m, const BrotliSharedDictionary* decoded_dict,\n int quality, SharedEncoderDictionary* dict) {\n ContextualEncoderDictionary* contextual;\n CompoundDictionary* compound;\n BrotliEncoderDictionary* instances;\n int i;\n BrotliInitSharedEncoderDictionary(dict);\n\n contextual = &dict->contextual;\n compound = &dict->compound;\n\n for (i = 0; i < (int)decoded_dict->num_prefix; i++) {\n PreparedDictionary* prepared = CreatePreparedDictionary(m,\n decoded_dict->prefix[i], decoded_dict->prefix_size[i]);\n AttachPreparedDictionary(compound, prepared);\n /* remember for cleanup */\n compound->prepared_instances_[\n compound->num_prepared_instances_++] = prepared;\n }\n\n dict->max_quality = quality;\n contextual->context_based = decoded_dict->context_based;\n if (decoded_dict->context_based) {\n memcpy(contextual->context_map, decoded_dict->context_map,\n SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS);\n }\n\n contextual->num_dictionaries = decoded_dict->num_dictionaries;\n contextual->num_instances_ = decoded_dict->num_dictionaries;\n if (contextual->num_instances_ == 1) {\n instances = &contextual->instance_;\n } else {\n contextual->instances_ = (BrotliEncoderDictionary*)\n BrotliAllocate(m, sizeof(*contextual->instances_) *\n contextual->num_instances_);\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n instances = contextual->instances_;\n }\n for (i = 0; i < (int)contextual->num_instances_; i++) {\n BrotliEncoderDictionary* current = &instances[i];\n InitEncoderDictionary(current);\n current->parent = &dict->contextual;\n if (decoded_dict->words[i] == BrotliGetDictionary()) {\n current->words = BrotliGetDictionary();\n } else {\n current->words_instance_ = (BrotliDictionary*)BrotliAllocate(\n m, sizeof(BrotliDictionary));\n if (BROTLI_IS_OOM(m)) return BROTLI_FALSE;\n *current->words_instance_ = *decoded_dict->words[i];\n current->words = current->words_instance_;\n }\n current->num_transforms =\n (uint32_t)decoded_dict->transforms[i]->num_transforms;\n if (!ComputeDictionary(\n m, quality, decoded_dict->transforms[i], current)) {\n return BROTLI_FALSE;\n }\n\n contextual->dict[i] = current;\n }\n\n return BROTLI_TRUE; /* success */\n}\n\nBROTLI_BOOL BrotliInitCustomSharedEncoderDictionary(\n MemoryManager* m, const uint8_t* encoded_dict, size_t size,\n int quality, SharedEncoderDictionary* dict) {\n BROTLI_BOOL success = BROTLI_FALSE;\n BrotliSharedDictionary* decoded_dict = BrotliSharedDictionaryCreateInstance(\n m->alloc_func, m->free_func, m->opaque);\n if (!decoded_dict) { /* OOM */\n return BROTLI_FALSE;\n }\n success = BrotliSharedDictionaryAttach(\n decoded_dict, BROTLI_SHARED_DICTIONARY_SERIALIZED, size, encoded_dict);\n if (success) {\n success = InitCustomSharedEncoderDictionary(m,\n decoded_dict, quality, dict);\n }\n BrotliSharedDictionaryDestroyInstance(decoded_dict);\n return success;\n}\n#endif /* BROTLI_EXPERIMENTAL */\n\nvoid BrotliCleanupSharedEncoderDictionary(MemoryManager* m,\n SharedEncoderDictionary* dict) {\n size_t i;\n for (i = 0; i < dict->compound.num_prepared_instances_; i++) {\n DestroyPreparedDictionary(m,\n (PreparedDictionary*)dict->compound.prepared_instances_[i]);\n }\n if (dict->contextual.num_instances_ == 1) {\n BrotliDestroyEncoderDictionary(m, &dict->contextual.instance_);\n } else if (dict->contextual.num_instances_ > 1) {\n for (i = 0; i < dict->contextual.num_instances_; i++) {\n BrotliDestroyEncoderDictionary(m, &dict->contextual.instances_[i]);\n }\n BrotliFree(m, dict->contextual.instances_);\n }\n}\n\nManagedDictionary* BrotliCreateManagedDictionary(\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {\n ManagedDictionary* result = (ManagedDictionary*)BrotliBootstrapAlloc(\n sizeof(ManagedDictionary), alloc_func, free_func, opaque);\n if (result == NULL) return NULL;\n\n result->magic = kManagedDictionaryMagic;\n BrotliInitMemoryManager(\n &result->memory_manager_, alloc_func, free_func, opaque);\n result->dictionary = NULL;\n\n return result;\n}\n\nvoid BrotliDestroyManagedDictionary(ManagedDictionary* dictionary) {\n if (!dictionary) return;\n BrotliBootstrapFree(dictionary, &dictionary->memory_manager_);\n}\n\n/* Escalate internal functions visibility; for testing purposes only. */\n#if defined(BROTLI_TEST)\nvoid BrotliInitEncoderDictionaryForTest(BrotliEncoderDictionary*);\nvoid BrotliInitEncoderDictionaryForTest(BrotliEncoderDictionary* d) {\n InitEncoderDictionary(d);\n}\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/encoder_dict.h", "content": "/* Copyright 2017 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#ifndef BROTLI_ENC_ENCODER_DICT_H_\n#define BROTLI_ENC_ENCODER_DICT_H_\n\n#include \"../common/dictionary.h\"\n#include \n#include \"../common/platform.h\"\n#include \"compound_dictionary.h\"\n#include \"memory.h\"\n#include \"static_dict_lut.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/*\nDictionary hierarchy for Encoder:\n-SharedEncoderDictionary\n--CompoundDictionary\n---PreparedDictionary [up to 15x]\n = prefix dictionary with precomputed hashes\n--ContextualEncoderDictionary\n---BrotliEncoderDictionary [up to 64x]\n = for each context, precomputed static dictionary with words + transforms\n\nDictionary hierarchy from common: similar, but without precomputed hashes\n-BrotliSharedDictionary\n--BrotliDictionary [up to 64x]\n--BrotliTransforms [up to 64x]\n--const uint8_t* prefix [up to 15x]: compound dictionaries\n*/\n\ntypedef struct BrotliTrieNode {\n uint8_t single; /* if 1, sub is a single node for c instead of 256 */\n uint8_t c;\n uint8_t len_; /* untransformed length */\n uint32_t idx_; /* word index + num words * transform index */\n uint32_t sub; /* index of sub node(s) in the pool */\n} BrotliTrieNode;\n\ntypedef struct BrotliTrie {\n BrotliTrieNode* pool;\n size_t pool_capacity;\n size_t pool_size;\n BrotliTrieNode root;\n} BrotliTrie;\n\n#if defined(BROTLI_EXPERIMENTAL)\nBROTLI_INTERNAL const BrotliTrieNode* BrotliTrieSub(const BrotliTrie* trie,\n const BrotliTrieNode* node, uint8_t c);\n#endif /* BROTLI_EXPERIMENTAL */\n\n/* Dictionary data (words and transforms) for 1 possible context */\ntypedef struct BrotliEncoderDictionary {\n const BrotliDictionary* words;\n uint32_t num_transforms;\n\n /* cut off for fast encoder */\n uint32_t cutoffTransformsCount;\n uint64_t cutoffTransforms;\n\n /* from dictionary_hash.h, for fast encoder */\n const uint16_t* hash_table_words;\n const uint8_t* hash_table_lengths;\n\n /* from static_dict_lut.h, for slow encoder */\n const uint16_t* buckets;\n const DictWord* dict_words;\n /* Heavy version, for use by slow encoder when there are custom transforms.\n Contains every possible transformed dictionary word in a trie. It encodes\n about as fast as the non-heavy encoder but consumes a lot of memory and\n takes time to build. */\n BrotliTrie trie;\n BROTLI_BOOL has_words_heavy;\n\n /* Reference to other dictionaries. */\n const struct ContextualEncoderDictionary* parent;\n\n /* Allocated memory, used only when not using the Brotli defaults */\n uint16_t* hash_table_data_words_;\n uint8_t* hash_table_data_lengths_;\n size_t buckets_alloc_size_;\n uint16_t* buckets_data_;\n size_t dict_words_alloc_size_;\n DictWord* dict_words_data_;\n BrotliDictionary* words_instance_;\n} BrotliEncoderDictionary;\n\n/* Dictionary data for all 64 contexts */\ntypedef struct ContextualEncoderDictionary {\n BROTLI_BOOL context_based;\n uint8_t num_dictionaries;\n uint8_t context_map[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];\n const BrotliEncoderDictionary* dict[SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS];\n\n /* If num_instances_ is 1, instance_ is used, else dynamic allocation with\n instances_ is used. */\n size_t num_instances_;\n BrotliEncoderDictionary instance_;\n BrotliEncoderDictionary* instances_;\n} ContextualEncoderDictionary;\n\ntypedef struct SharedEncoderDictionary {\n /* Magic value to distinguish this struct from PreparedDictionary for\n certain external usages. */\n uint32_t magic;\n\n /* LZ77 prefix, compound dictionary */\n CompoundDictionary compound;\n\n /* Custom static dictionary (optionally context-based) */\n ContextualEncoderDictionary contextual;\n\n /* The maximum quality the dictionary was computed for */\n int max_quality;\n} SharedEncoderDictionary;\n\ntypedef struct ManagedDictionary {\n uint32_t magic;\n MemoryManager memory_manager_;\n uint32_t* dictionary;\n} ManagedDictionary;\n\n/* Initializes to the brotli built-in dictionary */\nBROTLI_INTERNAL void BrotliInitSharedEncoderDictionary(\n SharedEncoderDictionary* dict);\n\n#if defined(BROTLI_EXPERIMENTAL)\n/* Initializes to shared dictionary that will be parsed from\n encoded_dict. Requires that you keep the encoded_dict buffer\n around, parts of data will point to it. */\nBROTLI_INTERNAL BROTLI_BOOL BrotliInitCustomSharedEncoderDictionary(\n MemoryManager* m, const uint8_t* encoded_dict, size_t size,\n int quality, SharedEncoderDictionary* dict);\n#endif /* BROTLI_EXPERIMENTAL */\n\nBROTLI_INTERNAL void BrotliCleanupSharedEncoderDictionary(\n MemoryManager* m, SharedEncoderDictionary* dict);\n\nBROTLI_INTERNAL ManagedDictionary* BrotliCreateManagedDictionary(\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);\n\nBROTLI_INTERNAL void BrotliDestroyManagedDictionary(\n ManagedDictionary* dictionary);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_ENCODER_DICT_H_ */\n" }, { "path": "libs/brotli/enc/entropy_encode.c", "content": "/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Entropy encoding (Huffman) utilities. */\n\n#include \"entropy_encode.h\"\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nconst BROTLI_MODEL(\"small\") size_t kBrotliShellGaps[] = {132, 57, 23, 10, 4, 1};\n\nBROTLI_BOOL BrotliSetDepth(\n int p0, HuffmanTree* pool, uint8_t* depth, int max_depth) {\n int stack[16];\n int level = 0;\n int p = p0;\n BROTLI_DCHECK(max_depth <= 15);\n stack[0] = -1;\n while (BROTLI_TRUE) {\n if (pool[p].index_left_ >= 0) {\n level++;\n if (level > max_depth) return BROTLI_FALSE;\n stack[level] = pool[p].index_right_or_value_;\n p = pool[p].index_left_;\n continue;\n } else {\n depth[pool[p].index_right_or_value_] = (uint8_t)level;\n }\n while (level >= 0 && stack[level] == -1) level--;\n if (level < 0) return BROTLI_TRUE;\n p = stack[level];\n stack[level] = -1;\n }\n}\n\n/* Sort the root nodes, least popular first. */\nstatic BROTLI_INLINE BROTLI_BOOL SortHuffmanTree(\n const HuffmanTree* v0, const HuffmanTree* v1) {\n if (v0->total_count_ != v1->total_count_) {\n return TO_BROTLI_BOOL(v0->total_count_ < v1->total_count_);\n }\n return TO_BROTLI_BOOL(v0->index_right_or_value_ > v1->index_right_or_value_);\n}\n\n/* This function will create a Huffman tree.\n\n The catch here is that the tree cannot be arbitrarily deep.\n Brotli specifies a maximum depth of 15 bits for \"code trees\"\n and 7 bits for \"code length code trees.\"\n\n count_limit is the value that is to be faked as the minimum value\n and this minimum value is raised until the tree matches the\n maximum length requirement.\n\n This algorithm is not of excellent performance for very long data blocks,\n especially when population counts are longer than 2**tree_limit, but\n we are not planning to use this with extremely long blocks.\n\n See http://en.wikipedia.org/wiki/Huffman_coding */\nvoid BrotliCreateHuffmanTree(const uint32_t* data,\n const size_t length,\n const int tree_limit,\n HuffmanTree* tree,\n uint8_t* depth) {\n uint32_t count_limit;\n HuffmanTree sentinel;\n InitHuffmanTree(&sentinel, BROTLI_UINT32_MAX, -1, -1);\n /* For block sizes below 64 kB, we never need to do a second iteration\n of this loop. Probably all of our block sizes will be smaller than\n that, so this loop is mostly of academic interest. If we actually\n would need this, we would be better off with the Katajainen algorithm. */\n for (count_limit = 1; ; count_limit *= 2) {\n size_t n = 0;\n size_t i;\n size_t j;\n size_t k;\n for (i = length; i != 0;) {\n --i;\n if (data[i]) {\n const uint32_t count = BROTLI_MAX(uint32_t, data[i], count_limit);\n InitHuffmanTree(&tree[n++], count, -1, (int16_t)i);\n }\n }\n\n if (n == 1) {\n depth[tree[0].index_right_or_value_] = 1; /* Only one element. */\n break;\n }\n\n SortHuffmanTreeItems(tree, n, SortHuffmanTree);\n\n /* The nodes are:\n [0, n): the sorted leaf nodes that we start with.\n [n]: we add a sentinel here.\n [n + 1, 2n): new parent nodes are added here, starting from\n (n+1). These are naturally in ascending order.\n [2n]: we add a sentinel at the end as well.\n There will be (2n+1) elements at the end. */\n tree[n] = sentinel;\n tree[n + 1] = sentinel;\n\n i = 0; /* Points to the next leaf node. */\n j = n + 1; /* Points to the next non-leaf node. */\n for (k = n - 1; k != 0; --k) {\n size_t left, right;\n if (tree[i].total_count_ <= tree[j].total_count_) {\n left = i;\n ++i;\n } else {\n left = j;\n ++j;\n }\n if (tree[i].total_count_ <= tree[j].total_count_) {\n right = i;\n ++i;\n } else {\n right = j;\n ++j;\n }\n\n {\n /* The sentinel node becomes the parent node. */\n size_t j_end = 2 * n - k;\n tree[j_end].total_count_ =\n tree[left].total_count_ + tree[right].total_count_;\n tree[j_end].index_left_ = (int16_t)left;\n tree[j_end].index_right_or_value_ = (int16_t)right;\n\n /* Add back the last sentinel node. */\n tree[j_end + 1] = sentinel;\n }\n }\n if (BrotliSetDepth((int)(2 * n - 1), &tree[0], depth, tree_limit)) {\n /* We need to pack the Huffman tree in tree_limit bits. If this was not\n successful, add fake entities to the lowest values and retry. */\n break;\n }\n }\n}\n\nstatic void Reverse(uint8_t* v, size_t start, size_t end) {\n --end;\n while (start < end) {\n uint8_t tmp = v[start];\n v[start] = v[end];\n v[end] = tmp;\n ++start;\n --end;\n }\n}\n\nstatic void BrotliWriteHuffmanTreeRepetitions(\n const uint8_t previous_value,\n const uint8_t value,\n size_t repetitions,\n size_t* tree_size,\n uint8_t* tree,\n uint8_t* extra_bits_data) {\n BROTLI_DCHECK(repetitions > 0);\n if (previous_value != value) {\n tree[*tree_size] = value;\n extra_bits_data[*tree_size] = 0;\n ++(*tree_size);\n --repetitions;\n }\n if (repetitions == 7) {\n tree[*tree_size] = value;\n extra_bits_data[*tree_size] = 0;\n ++(*tree_size);\n --repetitions;\n }\n if (repetitions < 3) {\n size_t i;\n for (i = 0; i < repetitions; ++i) {\n tree[*tree_size] = value;\n extra_bits_data[*tree_size] = 0;\n ++(*tree_size);\n }\n } else {\n size_t start = *tree_size;\n repetitions -= 3;\n while (BROTLI_TRUE) {\n tree[*tree_size] = BROTLI_REPEAT_PREVIOUS_CODE_LENGTH;\n extra_bits_data[*tree_size] = repetitions & 0x3;\n ++(*tree_size);\n repetitions >>= 2;\n if (repetitions == 0) {\n break;\n }\n --repetitions;\n }\n Reverse(tree, start, *tree_size);\n Reverse(extra_bits_data, start, *tree_size);\n }\n}\n\nstatic void BrotliWriteHuffmanTreeRepetitionsZeros(\n size_t repetitions,\n size_t* tree_size,\n uint8_t* tree,\n uint8_t* extra_bits_data) {\n if (repetitions == 11) {\n tree[*tree_size] = 0;\n extra_bits_data[*tree_size] = 0;\n ++(*tree_size);\n --repetitions;\n }\n if (repetitions < 3) {\n size_t i;\n for (i = 0; i < repetitions; ++i) {\n tree[*tree_size] = 0;\n extra_bits_data[*tree_size] = 0;\n ++(*tree_size);\n }\n } else {\n size_t start = *tree_size;\n repetitions -= 3;\n while (BROTLI_TRUE) {\n tree[*tree_size] = BROTLI_REPEAT_ZERO_CODE_LENGTH;\n extra_bits_data[*tree_size] = repetitions & 0x7;\n ++(*tree_size);\n repetitions >>= 3;\n if (repetitions == 0) {\n break;\n }\n --repetitions;\n }\n Reverse(tree, start, *tree_size);\n Reverse(extra_bits_data, start, *tree_size);\n }\n}\n\nvoid BrotliOptimizeHuffmanCountsForRle(size_t length, uint32_t* counts,\n uint8_t* good_for_rle) {\n size_t nonzero_count = 0;\n size_t stride;\n size_t limit;\n size_t sum;\n const size_t streak_limit = 1240;\n /* Let's make the Huffman code more compatible with RLE encoding. */\n size_t i;\n for (i = 0; i < length; i++) {\n if (counts[i]) {\n ++nonzero_count;\n }\n }\n if (nonzero_count < 16) {\n return;\n }\n while (length != 0 && counts[length - 1] == 0) {\n --length;\n }\n if (length == 0) {\n return; /* All zeros. */\n }\n /* Now counts[0..length - 1] does not have trailing zeros. */\n {\n size_t nonzeros = 0;\n uint32_t smallest_nonzero = 1 << 30;\n for (i = 0; i < length; ++i) {\n if (counts[i] != 0) {\n ++nonzeros;\n if (smallest_nonzero > counts[i]) {\n smallest_nonzero = counts[i];\n }\n }\n }\n if (nonzeros < 5) {\n /* Small histogram will model it well. */\n return;\n }\n if (smallest_nonzero < 4) {\n size_t zeros = length - nonzeros;\n if (zeros < 6) {\n for (i = 1; i < length - 1; ++i) {\n if (counts[i - 1] != 0 && counts[i] == 0 && counts[i + 1] != 0) {\n counts[i] = 1;\n }\n }\n }\n }\n if (nonzeros < 28) {\n return;\n }\n }\n /* 2) Let's mark all population counts that already can be encoded\n with an RLE code. */\n memset(good_for_rle, 0, length);\n {\n /* Let's not spoil any of the existing good RLE codes.\n Mark any seq of 0's that is longer as 5 as a good_for_rle.\n Mark any seq of non-0's that is longer as 7 as a good_for_rle. */\n uint32_t symbol = counts[0];\n size_t step = 0;\n for (i = 0; i <= length; ++i) {\n if (i == length || counts[i] != symbol) {\n if ((symbol == 0 && step >= 5) ||\n (symbol != 0 && step >= 7)) {\n size_t k;\n for (k = 0; k < step; ++k) {\n good_for_rle[i - k - 1] = 1;\n }\n }\n step = 1;\n if (i != length) {\n symbol = counts[i];\n }\n } else {\n ++step;\n }\n }\n }\n /* 3) Let's replace those population counts that lead to more RLE codes.\n Math here is in 24.8 fixed point representation. */\n stride = 0;\n limit = 256 * (counts[0] + counts[1] + counts[2]) / 3 + 420;\n sum = 0;\n for (i = 0; i <= length; ++i) {\n if (i == length || good_for_rle[i] ||\n (i != 0 && good_for_rle[i - 1]) ||\n (256 * counts[i] - limit + streak_limit) >= 2 * streak_limit) {\n if (stride >= 4 || (stride >= 3 && sum == 0)) {\n size_t k;\n /* The stride must end, collapse what we have, if we have enough (4). */\n size_t count = (sum + stride / 2) / stride;\n if (count == 0) {\n count = 1;\n }\n if (sum == 0) {\n /* Don't make an all zeros stride to be upgraded to ones. */\n count = 0;\n }\n for (k = 0; k < stride; ++k) {\n /* We don't want to change value at counts[i],\n that is already belonging to the next stride. Thus - 1. */\n counts[i - k - 1] = (uint32_t)count;\n }\n }\n stride = 0;\n sum = 0;\n if (i < length - 2) {\n /* All interesting strides have a count of at least 4, */\n /* at least when non-zeros. */\n limit = 256 * (counts[i] + counts[i + 1] + counts[i + 2]) / 3 + 420;\n } else if (i < length) {\n limit = 256 * counts[i];\n } else {\n limit = 0;\n }\n }\n ++stride;\n if (i != length) {\n sum += counts[i];\n if (stride >= 4) {\n limit = (256 * sum + stride / 2) / stride;\n }\n if (stride == 4) {\n limit += 120;\n }\n }\n }\n}\n\nstatic void DecideOverRleUse(const uint8_t* depth, const size_t length,\n BROTLI_BOOL* use_rle_for_non_zero,\n BROTLI_BOOL* use_rle_for_zero) {\n size_t total_reps_zero = 0;\n size_t total_reps_non_zero = 0;\n size_t count_reps_zero = 1;\n size_t count_reps_non_zero = 1;\n size_t i;\n for (i = 0; i < length;) {\n const uint8_t value = depth[i];\n size_t reps = 1;\n size_t k;\n for (k = i + 1; k < length && depth[k] == value; ++k) {\n ++reps;\n }\n if (reps >= 3 && value == 0) {\n total_reps_zero += reps;\n ++count_reps_zero;\n }\n if (reps >= 4 && value != 0) {\n total_reps_non_zero += reps;\n ++count_reps_non_zero;\n }\n i += reps;\n }\n *use_rle_for_non_zero =\n TO_BROTLI_BOOL(total_reps_non_zero > count_reps_non_zero * 2);\n *use_rle_for_zero = TO_BROTLI_BOOL(total_reps_zero > count_reps_zero * 2);\n}\n\nvoid BrotliWriteHuffmanTree(const uint8_t* depth,\n size_t length,\n size_t* tree_size,\n uint8_t* tree,\n uint8_t* extra_bits_data) {\n uint8_t previous_value = BROTLI_INITIAL_REPEATED_CODE_LENGTH;\n size_t i;\n BROTLI_BOOL use_rle_for_non_zero = BROTLI_FALSE;\n BROTLI_BOOL use_rle_for_zero = BROTLI_FALSE;\n\n /* Throw away trailing zeros. */\n size_t new_length = length;\n for (i = 0; i < length; ++i) {\n if (depth[length - i - 1] == 0) {\n --new_length;\n } else {\n break;\n }\n }\n\n /* First gather statistics on if it is a good idea to do RLE. */\n if (length > 50) {\n /* Find RLE coding for longer codes.\n Shorter codes seem not to benefit from RLE. */\n DecideOverRleUse(depth, new_length,\n &use_rle_for_non_zero, &use_rle_for_zero);\n }\n\n /* Actual RLE coding. */\n for (i = 0; i < new_length;) {\n const uint8_t value = depth[i];\n size_t reps = 1;\n if ((value != 0 && use_rle_for_non_zero) ||\n (value == 0 && use_rle_for_zero)) {\n size_t k;\n for (k = i + 1; k < new_length && depth[k] == value; ++k) {\n ++reps;\n }\n }\n if (value == 0) {\n BrotliWriteHuffmanTreeRepetitionsZeros(\n reps, tree_size, tree, extra_bits_data);\n } else {\n BrotliWriteHuffmanTreeRepetitions(previous_value,\n value, reps, tree_size,\n tree, extra_bits_data);\n previous_value = value;\n }\n i += reps;\n }\n}\n\nstatic uint16_t BrotliReverseBits(size_t num_bits, uint16_t bits) {\n static const size_t BROTLI_MODEL(\"small\") kLut[16] =\n { /* Pre-reversed 4-bit values. */\n 0x00, 0x08, 0x04, 0x0C, 0x02, 0x0A, 0x06, 0x0E,\n 0x01, 0x09, 0x05, 0x0D, 0x03, 0x0B, 0x07, 0x0F\n };\n size_t retval = kLut[bits & 0x0F];\n size_t i;\n for (i = 4; i < num_bits; i += 4) {\n retval <<= 4;\n bits = (uint16_t)(bits >> 4);\n retval |= kLut[bits & 0x0F];\n }\n retval >>= ((0 - num_bits) & 0x03);\n return (uint16_t)retval;\n}\n\n/* 0..15 are values for bits */\n#define MAX_HUFFMAN_BITS 16\n\nvoid BrotliConvertBitDepthsToSymbols(const uint8_t* depth,\n size_t len,\n uint16_t* bits) {\n /* In Brotli, all bit depths are [1..15]\n 0 bit depth means that the symbol does not exist. */\n uint16_t bl_count[MAX_HUFFMAN_BITS] = { 0 };\n uint16_t next_code[MAX_HUFFMAN_BITS];\n size_t i;\n int code = 0;\n for (i = 0; i < len; ++i) {\n ++bl_count[depth[i]];\n }\n bl_count[0] = 0;\n next_code[0] = 0;\n for (i = 1; i < MAX_HUFFMAN_BITS; ++i) {\n code = (code + bl_count[i - 1]) << 1;\n next_code[i] = (uint16_t)code;\n }\n for (i = 0; i < len; ++i) {\n if (depth[i]) {\n bits[i] = BrotliReverseBits(depth[i], next_code[depth[i]]++);\n }\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/entropy_encode.h", "content": "/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Entropy encoding (Huffman) utilities. */\n\n#ifndef BROTLI_ENC_ENTROPY_ENCODE_H_\n#define BROTLI_ENC_ENTROPY_ENCODE_H_\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* A node of a Huffman tree. */\ntypedef struct HuffmanTree {\n uint32_t total_count_;\n int16_t index_left_;\n int16_t index_right_or_value_;\n} HuffmanTree;\n\nstatic BROTLI_INLINE void InitHuffmanTree(HuffmanTree* self, uint32_t count,\n int16_t left, int16_t right) {\n self->total_count_ = count;\n self->index_left_ = left;\n self->index_right_or_value_ = right;\n}\n\n/* Returns 1 is assignment of depths succeeded, otherwise 0. */\nBROTLI_INTERNAL BROTLI_BOOL BrotliSetDepth(\n int p, HuffmanTree* pool, uint8_t* depth, int max_depth);\n\n/* This function will create a Huffman tree.\n\n The (data,length) contains the population counts.\n The tree_limit is the maximum bit depth of the Huffman codes.\n\n The depth contains the tree, i.e., how many bits are used for\n the symbol.\n\n The actual Huffman tree is constructed in the tree[] array, which has to\n be at least 2 * length + 1 long.\n\n See http://en.wikipedia.org/wiki/Huffman_coding */\nBROTLI_INTERNAL void BrotliCreateHuffmanTree(const uint32_t* data,\n const size_t length,\n const int tree_limit,\n HuffmanTree* tree,\n uint8_t* depth);\n\n/* Change the population counts in a way that the consequent\n Huffman tree compression, especially its RLE-part will be more\n likely to compress this data more efficiently.\n\n length contains the size of the histogram.\n counts contains the population counts.\n good_for_rle is a buffer of at least length size */\nBROTLI_INTERNAL void BrotliOptimizeHuffmanCountsForRle(\n size_t length, uint32_t* counts, uint8_t* good_for_rle);\n\n/* Write a Huffman tree from bit depths into the bit-stream representation\n of a Huffman tree. The generated Huffman tree is to be compressed once\n more using a Huffman tree */\nBROTLI_INTERNAL void BrotliWriteHuffmanTree(const uint8_t* depth,\n size_t length,\n size_t* tree_size,\n uint8_t* tree,\n uint8_t* extra_bits_data);\n\n/* Get the actual bit values for a tree of bit depths. */\nBROTLI_INTERNAL void BrotliConvertBitDepthsToSymbols(const uint8_t* depth,\n size_t len,\n uint16_t* bits);\n\nBROTLI_INTERNAL extern BROTLI_MODEL(\"small\") const size_t kBrotliShellGaps[6];\n/* Input size optimized Shell sort. */\ntypedef BROTLI_BOOL (*HuffmanTreeComparator)(\n const HuffmanTree*, const HuffmanTree*);\nstatic BROTLI_INLINE void SortHuffmanTreeItems(HuffmanTree* items,\n const size_t n, HuffmanTreeComparator comparator) {\n if (n < 13) {\n /* Insertion sort. */\n size_t i;\n for (i = 1; i < n; ++i) {\n HuffmanTree tmp = items[i];\n size_t k = i;\n size_t j = i - 1;\n while (comparator(&tmp, &items[j])) {\n items[k] = items[j];\n k = j;\n if (!j--) break;\n }\n items[k] = tmp;\n }\n return;\n } else {\n /* Shell sort. */\n int g = n < 57 ? 2 : 0;\n for (; g < 6; ++g) {\n size_t gap = kBrotliShellGaps[g];\n size_t i;\n for (i = gap; i < n; ++i) {\n size_t j = i;\n HuffmanTree tmp = items[i];\n for (; j >= gap && comparator(&tmp, &items[j - gap]); j -= gap) {\n items[j] = items[j - gap];\n }\n items[j] = tmp;\n }\n }\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_ENTROPY_ENCODE_H_ */\n" }, { "path": "libs/brotli/enc/entropy_encode_static.h", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Static entropy codes used for faster meta-block encoding. */\n\n#ifndef BROTLI_ENC_ENTROPY_ENCODE_STATIC_H_\n#define BROTLI_ENC_ENTROPY_ENCODE_STATIC_H_\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"write_bits.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic const BROTLI_MODEL(\"small\") uint8_t kCodeLengthDepth[18] = {\n 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 0, 4, 4,\n};\n\nstatic const BROTLI_MODEL(\"small\")\nuint8_t kStaticCommandCodeDepth[BROTLI_NUM_COMMAND_SYMBOLS] = {\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,\n};\n\nstatic const BROTLI_MODEL(\"small\")\nuint8_t kStaticDistanceCodeDepth[64] = {\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,\n};\n\n/* GENERATED CODE START */\nstatic const BROTLI_MODEL(\"small\")\nuint32_t kCodeLengthBits[18] = {\n 0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 15, 31, 0, 11, 7,\n};\n\nstatic BROTLI_INLINE void StoreStaticCodeLengthCode(\n size_t* storage_ix, uint8_t* storage) {\n BrotliWriteBits(\n 40, BROTLI_MAKE_UINT64_T(0x0000FFu, 0x55555554u), storage_ix, storage);\n}\n\nstatic const BROTLI_MODEL(\"small\")\nuint64_t kZeroRepsBits[BROTLI_NUM_COMMAND_SYMBOLS] = {\n 0x00000000, 0x00000000, 0x00000000, 0x00000007, 0x00000017, 0x00000027,\n 0x00000037, 0x00000047, 0x00000057, 0x00000067, 0x00000077, 0x00000770,\n 0x00000b87, 0x00001387, 0x00001b87, 0x00002387, 0x00002b87, 0x00003387,\n 0x00003b87, 0x00000397, 0x00000b97, 0x00001397, 0x00001b97, 0x00002397,\n 0x00002b97, 0x00003397, 0x00003b97, 0x000003a7, 0x00000ba7, 0x000013a7,\n 0x00001ba7, 0x000023a7, 0x00002ba7, 0x000033a7, 0x00003ba7, 0x000003b7,\n 0x00000bb7, 0x000013b7, 0x00001bb7, 0x000023b7, 0x00002bb7, 0x000033b7,\n 0x00003bb7, 0x000003c7, 0x00000bc7, 0x000013c7, 0x00001bc7, 0x000023c7,\n 0x00002bc7, 0x000033c7, 0x00003bc7, 0x000003d7, 0x00000bd7, 0x000013d7,\n 0x00001bd7, 0x000023d7, 0x00002bd7, 0x000033d7, 0x00003bd7, 0x000003e7,\n 0x00000be7, 0x000013e7, 0x00001be7, 0x000023e7, 0x00002be7, 0x000033e7,\n 0x00003be7, 0x000003f7, 0x00000bf7, 0x000013f7, 0x00001bf7, 0x000023f7,\n 0x00002bf7, 0x000033f7, 0x00003bf7, 0x0001c387, 0x0005c387, 0x0009c387,\n 0x000dc387, 0x0011c387, 0x0015c387, 0x0019c387, 0x001dc387, 0x0001cb87,\n 0x0005cb87, 0x0009cb87, 0x000dcb87, 0x0011cb87, 0x0015cb87, 0x0019cb87,\n 0x001dcb87, 0x0001d387, 0x0005d387, 0x0009d387, 0x000dd387, 0x0011d387,\n 0x0015d387, 0x0019d387, 0x001dd387, 0x0001db87, 0x0005db87, 0x0009db87,\n 0x000ddb87, 0x0011db87, 0x0015db87, 0x0019db87, 0x001ddb87, 0x0001e387,\n 0x0005e387, 0x0009e387, 0x000de387, 0x0011e387, 0x0015e387, 0x0019e387,\n 0x001de387, 0x0001eb87, 0x0005eb87, 0x0009eb87, 0x000deb87, 0x0011eb87,\n 0x0015eb87, 0x0019eb87, 0x001deb87, 0x0001f387, 0x0005f387, 0x0009f387,\n 0x000df387, 0x0011f387, 0x0015f387, 0x0019f387, 0x001df387, 0x0001fb87,\n 0x0005fb87, 0x0009fb87, 0x000dfb87, 0x0011fb87, 0x0015fb87, 0x0019fb87,\n 0x001dfb87, 0x0001c397, 0x0005c397, 0x0009c397, 0x000dc397, 0x0011c397,\n 0x0015c397, 0x0019c397, 0x001dc397, 0x0001cb97, 0x0005cb97, 0x0009cb97,\n 0x000dcb97, 0x0011cb97, 0x0015cb97, 0x0019cb97, 0x001dcb97, 0x0001d397,\n 0x0005d397, 0x0009d397, 0x000dd397, 0x0011d397, 0x0015d397, 0x0019d397,\n 0x001dd397, 0x0001db97, 0x0005db97, 0x0009db97, 0x000ddb97, 0x0011db97,\n 0x0015db97, 0x0019db97, 0x001ddb97, 0x0001e397, 0x0005e397, 0x0009e397,\n 0x000de397, 0x0011e397, 0x0015e397, 0x0019e397, 0x001de397, 0x0001eb97,\n 0x0005eb97, 0x0009eb97, 0x000deb97, 0x0011eb97, 0x0015eb97, 0x0019eb97,\n 0x001deb97, 0x0001f397, 0x0005f397, 0x0009f397, 0x000df397, 0x0011f397,\n 0x0015f397, 0x0019f397, 0x001df397, 0x0001fb97, 0x0005fb97, 0x0009fb97,\n 0x000dfb97, 0x0011fb97, 0x0015fb97, 0x0019fb97, 0x001dfb97, 0x0001c3a7,\n 0x0005c3a7, 0x0009c3a7, 0x000dc3a7, 0x0011c3a7, 0x0015c3a7, 0x0019c3a7,\n 0x001dc3a7, 0x0001cba7, 0x0005cba7, 0x0009cba7, 0x000dcba7, 0x0011cba7,\n 0x0015cba7, 0x0019cba7, 0x001dcba7, 0x0001d3a7, 0x0005d3a7, 0x0009d3a7,\n 0x000dd3a7, 0x0011d3a7, 0x0015d3a7, 0x0019d3a7, 0x001dd3a7, 0x0001dba7,\n 0x0005dba7, 0x0009dba7, 0x000ddba7, 0x0011dba7, 0x0015dba7, 0x0019dba7,\n 0x001ddba7, 0x0001e3a7, 0x0005e3a7, 0x0009e3a7, 0x000de3a7, 0x0011e3a7,\n 0x0015e3a7, 0x0019e3a7, 0x001de3a7, 0x0001eba7, 0x0005eba7, 0x0009eba7,\n 0x000deba7, 0x0011eba7, 0x0015eba7, 0x0019eba7, 0x001deba7, 0x0001f3a7,\n 0x0005f3a7, 0x0009f3a7, 0x000df3a7, 0x0011f3a7, 0x0015f3a7, 0x0019f3a7,\n 0x001df3a7, 0x0001fba7, 0x0005fba7, 0x0009fba7, 0x000dfba7, 0x0011fba7,\n 0x0015fba7, 0x0019fba7, 0x001dfba7, 0x0001c3b7, 0x0005c3b7, 0x0009c3b7,\n 0x000dc3b7, 0x0011c3b7, 0x0015c3b7, 0x0019c3b7, 0x001dc3b7, 0x0001cbb7,\n 0x0005cbb7, 0x0009cbb7, 0x000dcbb7, 0x0011cbb7, 0x0015cbb7, 0x0019cbb7,\n 0x001dcbb7, 0x0001d3b7, 0x0005d3b7, 0x0009d3b7, 0x000dd3b7, 0x0011d3b7,\n 0x0015d3b7, 0x0019d3b7, 0x001dd3b7, 0x0001dbb7, 0x0005dbb7, 0x0009dbb7,\n 0x000ddbb7, 0x0011dbb7, 0x0015dbb7, 0x0019dbb7, 0x001ddbb7, 0x0001e3b7,\n 0x0005e3b7, 0x0009e3b7, 0x000de3b7, 0x0011e3b7, 0x0015e3b7, 0x0019e3b7,\n 0x001de3b7, 0x0001ebb7, 0x0005ebb7, 0x0009ebb7, 0x000debb7, 0x0011ebb7,\n 0x0015ebb7, 0x0019ebb7, 0x001debb7, 0x0001f3b7, 0x0005f3b7, 0x0009f3b7,\n 0x000df3b7, 0x0011f3b7, 0x0015f3b7, 0x0019f3b7, 0x001df3b7, 0x0001fbb7,\n 0x0005fbb7, 0x0009fbb7, 0x000dfbb7, 0x0011fbb7, 0x0015fbb7, 0x0019fbb7,\n 0x001dfbb7, 0x0001c3c7, 0x0005c3c7, 0x0009c3c7, 0x000dc3c7, 0x0011c3c7,\n 0x0015c3c7, 0x0019c3c7, 0x001dc3c7, 0x0001cbc7, 0x0005cbc7, 0x0009cbc7,\n 0x000dcbc7, 0x0011cbc7, 0x0015cbc7, 0x0019cbc7, 0x001dcbc7, 0x0001d3c7,\n 0x0005d3c7, 0x0009d3c7, 0x000dd3c7, 0x0011d3c7, 0x0015d3c7, 0x0019d3c7,\n 0x001dd3c7, 0x0001dbc7, 0x0005dbc7, 0x0009dbc7, 0x000ddbc7, 0x0011dbc7,\n 0x0015dbc7, 0x0019dbc7, 0x001ddbc7, 0x0001e3c7, 0x0005e3c7, 0x0009e3c7,\n 0x000de3c7, 0x0011e3c7, 0x0015e3c7, 0x0019e3c7, 0x001de3c7, 0x0001ebc7,\n 0x0005ebc7, 0x0009ebc7, 0x000debc7, 0x0011ebc7, 0x0015ebc7, 0x0019ebc7,\n 0x001debc7, 0x0001f3c7, 0x0005f3c7, 0x0009f3c7, 0x000df3c7, 0x0011f3c7,\n 0x0015f3c7, 0x0019f3c7, 0x001df3c7, 0x0001fbc7, 0x0005fbc7, 0x0009fbc7,\n 0x000dfbc7, 0x0011fbc7, 0x0015fbc7, 0x0019fbc7, 0x001dfbc7, 0x0001c3d7,\n 0x0005c3d7, 0x0009c3d7, 0x000dc3d7, 0x0011c3d7, 0x0015c3d7, 0x0019c3d7,\n 0x001dc3d7, 0x0001cbd7, 0x0005cbd7, 0x0009cbd7, 0x000dcbd7, 0x0011cbd7,\n 0x0015cbd7, 0x0019cbd7, 0x001dcbd7, 0x0001d3d7, 0x0005d3d7, 0x0009d3d7,\n 0x000dd3d7, 0x0011d3d7, 0x0015d3d7, 0x0019d3d7, 0x001dd3d7, 0x0001dbd7,\n 0x0005dbd7, 0x0009dbd7, 0x000ddbd7, 0x0011dbd7, 0x0015dbd7, 0x0019dbd7,\n 0x001ddbd7, 0x0001e3d7, 0x0005e3d7, 0x0009e3d7, 0x000de3d7, 0x0011e3d7,\n 0x0015e3d7, 0x0019e3d7, 0x001de3d7, 0x0001ebd7, 0x0005ebd7, 0x0009ebd7,\n 0x000debd7, 0x0011ebd7, 0x0015ebd7, 0x0019ebd7, 0x001debd7, 0x0001f3d7,\n 0x0005f3d7, 0x0009f3d7, 0x000df3d7, 0x0011f3d7, 0x0015f3d7, 0x0019f3d7,\n 0x001df3d7, 0x0001fbd7, 0x0005fbd7, 0x0009fbd7, 0x000dfbd7, 0x0011fbd7,\n 0x0015fbd7, 0x0019fbd7, 0x001dfbd7, 0x0001c3e7, 0x0005c3e7, 0x0009c3e7,\n 0x000dc3e7, 0x0011c3e7, 0x0015c3e7, 0x0019c3e7, 0x001dc3e7, 0x0001cbe7,\n 0x0005cbe7, 0x0009cbe7, 0x000dcbe7, 0x0011cbe7, 0x0015cbe7, 0x0019cbe7,\n 0x001dcbe7, 0x0001d3e7, 0x0005d3e7, 0x0009d3e7, 0x000dd3e7, 0x0011d3e7,\n 0x0015d3e7, 0x0019d3e7, 0x001dd3e7, 0x0001dbe7, 0x0005dbe7, 0x0009dbe7,\n 0x000ddbe7, 0x0011dbe7, 0x0015dbe7, 0x0019dbe7, 0x001ddbe7, 0x0001e3e7,\n 0x0005e3e7, 0x0009e3e7, 0x000de3e7, 0x0011e3e7, 0x0015e3e7, 0x0019e3e7,\n 0x001de3e7, 0x0001ebe7, 0x0005ebe7, 0x0009ebe7, 0x000debe7, 0x0011ebe7,\n 0x0015ebe7, 0x0019ebe7, 0x001debe7, 0x0001f3e7, 0x0005f3e7, 0x0009f3e7,\n 0x000df3e7, 0x0011f3e7, 0x0015f3e7, 0x0019f3e7, 0x001df3e7, 0x0001fbe7,\n 0x0005fbe7, 0x0009fbe7, 0x000dfbe7, 0x0011fbe7, 0x0015fbe7, 0x0019fbe7,\n 0x001dfbe7, 0x0001c3f7, 0x0005c3f7, 0x0009c3f7, 0x000dc3f7, 0x0011c3f7,\n 0x0015c3f7, 0x0019c3f7, 0x001dc3f7, 0x0001cbf7, 0x0005cbf7, 0x0009cbf7,\n 0x000dcbf7, 0x0011cbf7, 0x0015cbf7, 0x0019cbf7, 0x001dcbf7, 0x0001d3f7,\n 0x0005d3f7, 0x0009d3f7, 0x000dd3f7, 0x0011d3f7, 0x0015d3f7, 0x0019d3f7,\n 0x001dd3f7, 0x0001dbf7, 0x0005dbf7, 0x0009dbf7, 0x000ddbf7, 0x0011dbf7,\n 0x0015dbf7, 0x0019dbf7, 0x001ddbf7, 0x0001e3f7, 0x0005e3f7, 0x0009e3f7,\n 0x000de3f7, 0x0011e3f7, 0x0015e3f7, 0x0019e3f7, 0x001de3f7, 0x0001ebf7,\n 0x0005ebf7, 0x0009ebf7, 0x000debf7, 0x0011ebf7, 0x0015ebf7, 0x0019ebf7,\n 0x001debf7, 0x0001f3f7, 0x0005f3f7, 0x0009f3f7, 0x000df3f7, 0x0011f3f7,\n 0x0015f3f7, 0x0019f3f7, 0x001df3f7, 0x0001fbf7, 0x0005fbf7, 0x0009fbf7,\n 0x000dfbf7, 0x0011fbf7, 0x0015fbf7, 0x0019fbf7, 0x001dfbf7, 0x00e1c387,\n 0x02e1c387, 0x04e1c387, 0x06e1c387, 0x08e1c387, 0x0ae1c387, 0x0ce1c387,\n 0x0ee1c387, 0x00e5c387, 0x02e5c387, 0x04e5c387, 0x06e5c387, 0x08e5c387,\n 0x0ae5c387, 0x0ce5c387, 0x0ee5c387, 0x00e9c387, 0x02e9c387, 0x04e9c387,\n 0x06e9c387, 0x08e9c387, 0x0ae9c387, 0x0ce9c387, 0x0ee9c387, 0x00edc387,\n 0x02edc387, 0x04edc387, 0x06edc387, 0x08edc387, 0x0aedc387, 0x0cedc387,\n 0x0eedc387, 0x00f1c387, 0x02f1c387, 0x04f1c387, 0x06f1c387, 0x08f1c387,\n 0x0af1c387, 0x0cf1c387, 0x0ef1c387, 0x00f5c387, 0x02f5c387, 0x04f5c387,\n 0x06f5c387, 0x08f5c387, 0x0af5c387, 0x0cf5c387, 0x0ef5c387, 0x00f9c387,\n 0x02f9c387, 0x04f9c387, 0x06f9c387, 0x08f9c387, 0x0af9c387, 0x0cf9c387,\n 0x0ef9c387, 0x00fdc387, 0x02fdc387, 0x04fdc387, 0x06fdc387, 0x08fdc387,\n 0x0afdc387, 0x0cfdc387, 0x0efdc387, 0x00e1cb87, 0x02e1cb87, 0x04e1cb87,\n 0x06e1cb87, 0x08e1cb87, 0x0ae1cb87, 0x0ce1cb87, 0x0ee1cb87, 0x00e5cb87,\n 0x02e5cb87, 0x04e5cb87, 0x06e5cb87, 0x08e5cb87, 0x0ae5cb87, 0x0ce5cb87,\n 0x0ee5cb87, 0x00e9cb87, 0x02e9cb87, 0x04e9cb87, 0x06e9cb87, 0x08e9cb87,\n 0x0ae9cb87, 0x0ce9cb87, 0x0ee9cb87, 0x00edcb87, 0x02edcb87, 0x04edcb87,\n 0x06edcb87, 0x08edcb87, 0x0aedcb87, 0x0cedcb87, 0x0eedcb87, 0x00f1cb87,\n 0x02f1cb87, 0x04f1cb87, 0x06f1cb87, 0x08f1cb87, 0x0af1cb87, 0x0cf1cb87,\n 0x0ef1cb87, 0x00f5cb87, 0x02f5cb87, 0x04f5cb87, 0x06f5cb87, 0x08f5cb87,\n 0x0af5cb87, 0x0cf5cb87, 0x0ef5cb87, 0x00f9cb87, 0x02f9cb87, 0x04f9cb87,\n 0x06f9cb87, 0x08f9cb87,\n};\n\nstatic const BROTLI_MODEL(\"small\")\nuint32_t kZeroRepsDepth[BROTLI_NUM_COMMAND_SYMBOLS] = {\n 0, 4, 8, 7, 7, 7, 7, 7, 7, 7, 7, 11, 14, 14, 14, 14,\n 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\n 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\n 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,\n 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21,\n 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 28, 28, 28, 28, 28,\n 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,\n};\n\nstatic const BROTLI_MODEL(\"small\")\nuint64_t kNonZeroRepsBits[BROTLI_NUM_COMMAND_SYMBOLS] = {\n 0x0000000b, 0x0000001b, 0x0000002b, 0x0000003b, 0x000002cb, 0x000006cb,\n 0x00000acb, 0x00000ecb, 0x000002db, 0x000006db, 0x00000adb, 0x00000edb,\n 0x000002eb, 0x000006eb, 0x00000aeb, 0x00000eeb, 0x000002fb, 0x000006fb,\n 0x00000afb, 0x00000efb, 0x0000b2cb, 0x0001b2cb, 0x0002b2cb, 0x0003b2cb,\n 0x0000b6cb, 0x0001b6cb, 0x0002b6cb, 0x0003b6cb, 0x0000bacb, 0x0001bacb,\n 0x0002bacb, 0x0003bacb, 0x0000becb, 0x0001becb, 0x0002becb, 0x0003becb,\n 0x0000b2db, 0x0001b2db, 0x0002b2db, 0x0003b2db, 0x0000b6db, 0x0001b6db,\n 0x0002b6db, 0x0003b6db, 0x0000badb, 0x0001badb, 0x0002badb, 0x0003badb,\n 0x0000bedb, 0x0001bedb, 0x0002bedb, 0x0003bedb, 0x0000b2eb, 0x0001b2eb,\n 0x0002b2eb, 0x0003b2eb, 0x0000b6eb, 0x0001b6eb, 0x0002b6eb, 0x0003b6eb,\n 0x0000baeb, 0x0001baeb, 0x0002baeb, 0x0003baeb, 0x0000beeb, 0x0001beeb,\n 0x0002beeb, 0x0003beeb, 0x0000b2fb, 0x0001b2fb, 0x0002b2fb, 0x0003b2fb,\n 0x0000b6fb, 0x0001b6fb, 0x0002b6fb, 0x0003b6fb, 0x0000bafb, 0x0001bafb,\n 0x0002bafb, 0x0003bafb, 0x0000befb, 0x0001befb, 0x0002befb, 0x0003befb,\n 0x002cb2cb, 0x006cb2cb, 0x00acb2cb, 0x00ecb2cb, 0x002db2cb, 0x006db2cb,\n 0x00adb2cb, 0x00edb2cb, 0x002eb2cb, 0x006eb2cb, 0x00aeb2cb, 0x00eeb2cb,\n 0x002fb2cb, 0x006fb2cb, 0x00afb2cb, 0x00efb2cb, 0x002cb6cb, 0x006cb6cb,\n 0x00acb6cb, 0x00ecb6cb, 0x002db6cb, 0x006db6cb, 0x00adb6cb, 0x00edb6cb,\n 0x002eb6cb, 0x006eb6cb, 0x00aeb6cb, 0x00eeb6cb, 0x002fb6cb, 0x006fb6cb,\n 0x00afb6cb, 0x00efb6cb, 0x002cbacb, 0x006cbacb, 0x00acbacb, 0x00ecbacb,\n 0x002dbacb, 0x006dbacb, 0x00adbacb, 0x00edbacb, 0x002ebacb, 0x006ebacb,\n 0x00aebacb, 0x00eebacb, 0x002fbacb, 0x006fbacb, 0x00afbacb, 0x00efbacb,\n 0x002cbecb, 0x006cbecb, 0x00acbecb, 0x00ecbecb, 0x002dbecb, 0x006dbecb,\n 0x00adbecb, 0x00edbecb, 0x002ebecb, 0x006ebecb, 0x00aebecb, 0x00eebecb,\n 0x002fbecb, 0x006fbecb, 0x00afbecb, 0x00efbecb, 0x002cb2db, 0x006cb2db,\n 0x00acb2db, 0x00ecb2db, 0x002db2db, 0x006db2db, 0x00adb2db, 0x00edb2db,\n 0x002eb2db, 0x006eb2db, 0x00aeb2db, 0x00eeb2db, 0x002fb2db, 0x006fb2db,\n 0x00afb2db, 0x00efb2db, 0x002cb6db, 0x006cb6db, 0x00acb6db, 0x00ecb6db,\n 0x002db6db, 0x006db6db, 0x00adb6db, 0x00edb6db, 0x002eb6db, 0x006eb6db,\n 0x00aeb6db, 0x00eeb6db, 0x002fb6db, 0x006fb6db, 0x00afb6db, 0x00efb6db,\n 0x002cbadb, 0x006cbadb, 0x00acbadb, 0x00ecbadb, 0x002dbadb, 0x006dbadb,\n 0x00adbadb, 0x00edbadb, 0x002ebadb, 0x006ebadb, 0x00aebadb, 0x00eebadb,\n 0x002fbadb, 0x006fbadb, 0x00afbadb, 0x00efbadb, 0x002cbedb, 0x006cbedb,\n 0x00acbedb, 0x00ecbedb, 0x002dbedb, 0x006dbedb, 0x00adbedb, 0x00edbedb,\n 0x002ebedb, 0x006ebedb, 0x00aebedb, 0x00eebedb, 0x002fbedb, 0x006fbedb,\n 0x00afbedb, 0x00efbedb, 0x002cb2eb, 0x006cb2eb, 0x00acb2eb, 0x00ecb2eb,\n 0x002db2eb, 0x006db2eb, 0x00adb2eb, 0x00edb2eb, 0x002eb2eb, 0x006eb2eb,\n 0x00aeb2eb, 0x00eeb2eb, 0x002fb2eb, 0x006fb2eb, 0x00afb2eb, 0x00efb2eb,\n 0x002cb6eb, 0x006cb6eb, 0x00acb6eb, 0x00ecb6eb, 0x002db6eb, 0x006db6eb,\n 0x00adb6eb, 0x00edb6eb, 0x002eb6eb, 0x006eb6eb, 0x00aeb6eb, 0x00eeb6eb,\n 0x002fb6eb, 0x006fb6eb, 0x00afb6eb, 0x00efb6eb, 0x002cbaeb, 0x006cbaeb,\n 0x00acbaeb, 0x00ecbaeb, 0x002dbaeb, 0x006dbaeb, 0x00adbaeb, 0x00edbaeb,\n 0x002ebaeb, 0x006ebaeb, 0x00aebaeb, 0x00eebaeb, 0x002fbaeb, 0x006fbaeb,\n 0x00afbaeb, 0x00efbaeb, 0x002cbeeb, 0x006cbeeb, 0x00acbeeb, 0x00ecbeeb,\n 0x002dbeeb, 0x006dbeeb, 0x00adbeeb, 0x00edbeeb, 0x002ebeeb, 0x006ebeeb,\n 0x00aebeeb, 0x00eebeeb, 0x002fbeeb, 0x006fbeeb, 0x00afbeeb, 0x00efbeeb,\n 0x002cb2fb, 0x006cb2fb, 0x00acb2fb, 0x00ecb2fb, 0x002db2fb, 0x006db2fb,\n 0x00adb2fb, 0x00edb2fb, 0x002eb2fb, 0x006eb2fb, 0x00aeb2fb, 0x00eeb2fb,\n 0x002fb2fb, 0x006fb2fb, 0x00afb2fb, 0x00efb2fb, 0x002cb6fb, 0x006cb6fb,\n 0x00acb6fb, 0x00ecb6fb, 0x002db6fb, 0x006db6fb, 0x00adb6fb, 0x00edb6fb,\n 0x002eb6fb, 0x006eb6fb, 0x00aeb6fb, 0x00eeb6fb, 0x002fb6fb, 0x006fb6fb,\n 0x00afb6fb, 0x00efb6fb, 0x002cbafb, 0x006cbafb, 0x00acbafb, 0x00ecbafb,\n 0x002dbafb, 0x006dbafb, 0x00adbafb, 0x00edbafb, 0x002ebafb, 0x006ebafb,\n 0x00aebafb, 0x00eebafb, 0x002fbafb, 0x006fbafb, 0x00afbafb, 0x00efbafb,\n 0x002cbefb, 0x006cbefb, 0x00acbefb, 0x00ecbefb, 0x002dbefb, 0x006dbefb,\n 0x00adbefb, 0x00edbefb, 0x002ebefb, 0x006ebefb, 0x00aebefb, 0x00eebefb,\n 0x002fbefb, 0x006fbefb, 0x00afbefb, 0x00efbefb, 0x0b2cb2cb, 0x1b2cb2cb,\n 0x2b2cb2cb, 0x3b2cb2cb, 0x0b6cb2cb, 0x1b6cb2cb, 0x2b6cb2cb, 0x3b6cb2cb,\n 0x0bacb2cb, 0x1bacb2cb, 0x2bacb2cb, 0x3bacb2cb, 0x0becb2cb, 0x1becb2cb,\n 0x2becb2cb, 0x3becb2cb, 0x0b2db2cb, 0x1b2db2cb, 0x2b2db2cb, 0x3b2db2cb,\n 0x0b6db2cb, 0x1b6db2cb, 0x2b6db2cb, 0x3b6db2cb, 0x0badb2cb, 0x1badb2cb,\n 0x2badb2cb, 0x3badb2cb, 0x0bedb2cb, 0x1bedb2cb, 0x2bedb2cb, 0x3bedb2cb,\n 0x0b2eb2cb, 0x1b2eb2cb, 0x2b2eb2cb, 0x3b2eb2cb, 0x0b6eb2cb, 0x1b6eb2cb,\n 0x2b6eb2cb, 0x3b6eb2cb, 0x0baeb2cb, 0x1baeb2cb, 0x2baeb2cb, 0x3baeb2cb,\n 0x0beeb2cb, 0x1beeb2cb, 0x2beeb2cb, 0x3beeb2cb, 0x0b2fb2cb, 0x1b2fb2cb,\n 0x2b2fb2cb, 0x3b2fb2cb, 0x0b6fb2cb, 0x1b6fb2cb, 0x2b6fb2cb, 0x3b6fb2cb,\n 0x0bafb2cb, 0x1bafb2cb, 0x2bafb2cb, 0x3bafb2cb, 0x0befb2cb, 0x1befb2cb,\n 0x2befb2cb, 0x3befb2cb, 0x0b2cb6cb, 0x1b2cb6cb, 0x2b2cb6cb, 0x3b2cb6cb,\n 0x0b6cb6cb, 0x1b6cb6cb, 0x2b6cb6cb, 0x3b6cb6cb, 0x0bacb6cb, 0x1bacb6cb,\n 0x2bacb6cb, 0x3bacb6cb, 0x0becb6cb, 0x1becb6cb, 0x2becb6cb, 0x3becb6cb,\n 0x0b2db6cb, 0x1b2db6cb, 0x2b2db6cb, 0x3b2db6cb, 0x0b6db6cb, 0x1b6db6cb,\n 0x2b6db6cb, 0x3b6db6cb, 0x0badb6cb, 0x1badb6cb, 0x2badb6cb, 0x3badb6cb,\n 0x0bedb6cb, 0x1bedb6cb, 0x2bedb6cb, 0x3bedb6cb, 0x0b2eb6cb, 0x1b2eb6cb,\n 0x2b2eb6cb, 0x3b2eb6cb, 0x0b6eb6cb, 0x1b6eb6cb, 0x2b6eb6cb, 0x3b6eb6cb,\n 0x0baeb6cb, 0x1baeb6cb, 0x2baeb6cb, 0x3baeb6cb, 0x0beeb6cb, 0x1beeb6cb,\n 0x2beeb6cb, 0x3beeb6cb, 0x0b2fb6cb, 0x1b2fb6cb, 0x2b2fb6cb, 0x3b2fb6cb,\n 0x0b6fb6cb, 0x1b6fb6cb, 0x2b6fb6cb, 0x3b6fb6cb, 0x0bafb6cb, 0x1bafb6cb,\n 0x2bafb6cb, 0x3bafb6cb, 0x0befb6cb, 0x1befb6cb, 0x2befb6cb, 0x3befb6cb,\n 0x0b2cbacb, 0x1b2cbacb, 0x2b2cbacb, 0x3b2cbacb, 0x0b6cbacb, 0x1b6cbacb,\n 0x2b6cbacb, 0x3b6cbacb, 0x0bacbacb, 0x1bacbacb, 0x2bacbacb, 0x3bacbacb,\n 0x0becbacb, 0x1becbacb, 0x2becbacb, 0x3becbacb, 0x0b2dbacb, 0x1b2dbacb,\n 0x2b2dbacb, 0x3b2dbacb, 0x0b6dbacb, 0x1b6dbacb, 0x2b6dbacb, 0x3b6dbacb,\n 0x0badbacb, 0x1badbacb, 0x2badbacb, 0x3badbacb, 0x0bedbacb, 0x1bedbacb,\n 0x2bedbacb, 0x3bedbacb, 0x0b2ebacb, 0x1b2ebacb, 0x2b2ebacb, 0x3b2ebacb,\n 0x0b6ebacb, 0x1b6ebacb, 0x2b6ebacb, 0x3b6ebacb, 0x0baebacb, 0x1baebacb,\n 0x2baebacb, 0x3baebacb, 0x0beebacb, 0x1beebacb, 0x2beebacb, 0x3beebacb,\n 0x0b2fbacb, 0x1b2fbacb, 0x2b2fbacb, 0x3b2fbacb, 0x0b6fbacb, 0x1b6fbacb,\n 0x2b6fbacb, 0x3b6fbacb, 0x0bafbacb, 0x1bafbacb, 0x2bafbacb, 0x3bafbacb,\n 0x0befbacb, 0x1befbacb, 0x2befbacb, 0x3befbacb, 0x0b2cbecb, 0x1b2cbecb,\n 0x2b2cbecb, 0x3b2cbecb, 0x0b6cbecb, 0x1b6cbecb, 0x2b6cbecb, 0x3b6cbecb,\n 0x0bacbecb, 0x1bacbecb, 0x2bacbecb, 0x3bacbecb, 0x0becbecb, 0x1becbecb,\n 0x2becbecb, 0x3becbecb, 0x0b2dbecb, 0x1b2dbecb, 0x2b2dbecb, 0x3b2dbecb,\n 0x0b6dbecb, 0x1b6dbecb, 0x2b6dbecb, 0x3b6dbecb, 0x0badbecb, 0x1badbecb,\n 0x2badbecb, 0x3badbecb, 0x0bedbecb, 0x1bedbecb, 0x2bedbecb, 0x3bedbecb,\n 0x0b2ebecb, 0x1b2ebecb, 0x2b2ebecb, 0x3b2ebecb, 0x0b6ebecb, 0x1b6ebecb,\n 0x2b6ebecb, 0x3b6ebecb, 0x0baebecb, 0x1baebecb, 0x2baebecb, 0x3baebecb,\n 0x0beebecb, 0x1beebecb, 0x2beebecb, 0x3beebecb, 0x0b2fbecb, 0x1b2fbecb,\n 0x2b2fbecb, 0x3b2fbecb, 0x0b6fbecb, 0x1b6fbecb, 0x2b6fbecb, 0x3b6fbecb,\n 0x0bafbecb, 0x1bafbecb, 0x2bafbecb, 0x3bafbecb, 0x0befbecb, 0x1befbecb,\n 0x2befbecb, 0x3befbecb, 0x0b2cb2db, 0x1b2cb2db, 0x2b2cb2db, 0x3b2cb2db,\n 0x0b6cb2db, 0x1b6cb2db, 0x2b6cb2db, 0x3b6cb2db, 0x0bacb2db, 0x1bacb2db,\n 0x2bacb2db, 0x3bacb2db, 0x0becb2db, 0x1becb2db, 0x2becb2db, 0x3becb2db,\n 0x0b2db2db, 0x1b2db2db, 0x2b2db2db, 0x3b2db2db, 0x0b6db2db, 0x1b6db2db,\n 0x2b6db2db, 0x3b6db2db, 0x0badb2db, 0x1badb2db, 0x2badb2db, 0x3badb2db,\n 0x0bedb2db, 0x1bedb2db, 0x2bedb2db, 0x3bedb2db, 0x0b2eb2db, 0x1b2eb2db,\n 0x2b2eb2db, 0x3b2eb2db, 0x0b6eb2db, 0x1b6eb2db, 0x2b6eb2db, 0x3b6eb2db,\n 0x0baeb2db, 0x1baeb2db, 0x2baeb2db, 0x3baeb2db, 0x0beeb2db, 0x1beeb2db,\n 0x2beeb2db, 0x3beeb2db, 0x0b2fb2db, 0x1b2fb2db, 0x2b2fb2db, 0x3b2fb2db,\n 0x0b6fb2db, 0x1b6fb2db, 0x2b6fb2db, 0x3b6fb2db, 0x0bafb2db, 0x1bafb2db,\n 0x2bafb2db, 0x3bafb2db, 0x0befb2db, 0x1befb2db, 0x2befb2db, 0x3befb2db,\n 0x0b2cb6db, 0x1b2cb6db, 0x2b2cb6db, 0x3b2cb6db, 0x0b6cb6db, 0x1b6cb6db,\n 0x2b6cb6db, 0x3b6cb6db, 0x0bacb6db, 0x1bacb6db, 0x2bacb6db, 0x3bacb6db,\n 0x0becb6db, 0x1becb6db, 0x2becb6db, 0x3becb6db, 0x0b2db6db, 0x1b2db6db,\n 0x2b2db6db, 0x3b2db6db, 0x0b6db6db, 0x1b6db6db, 0x2b6db6db, 0x3b6db6db,\n 0x0badb6db, 0x1badb6db, 0x2badb6db, 0x3badb6db, 0x0bedb6db, 0x1bedb6db,\n 0x2bedb6db, 0x3bedb6db, 0x0b2eb6db, 0x1b2eb6db, 0x2b2eb6db, 0x3b2eb6db,\n 0x0b6eb6db, 0x1b6eb6db, 0x2b6eb6db, 0x3b6eb6db, 0x0baeb6db, 0x1baeb6db,\n 0x2baeb6db, 0x3baeb6db,\n};\n\nstatic const BROTLI_MODEL(\"small\")\nuint32_t kNonZeroRepsDepth[BROTLI_NUM_COMMAND_SYMBOLS] = {\n 6, 6, 6, 6, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,\n 12, 12, 12, 12, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,\n 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,\n 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,\n 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18,\n 18, 18, 18, 18, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,\n 24, 24, 24, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30,\n};\n\nstatic const BROTLI_MODEL(\"small\")\nuint16_t kStaticCommandCodeBits[BROTLI_NUM_COMMAND_SYMBOLS] = {\n 0, 256, 128, 384, 64, 320, 192, 448,\n 32, 288, 160, 416, 96, 352, 224, 480,\n 16, 272, 144, 400, 80, 336, 208, 464,\n 48, 304, 176, 432, 112, 368, 240, 496,\n 8, 264, 136, 392, 72, 328, 200, 456,\n 40, 296, 168, 424, 104, 360, 232, 488,\n 24, 280, 152, 408, 88, 344, 216, 472,\n 56, 312, 184, 440, 120, 376, 248, 504,\n 4, 260, 132, 388, 68, 324, 196, 452,\n 36, 292, 164, 420, 100, 356, 228, 484,\n 20, 276, 148, 404, 84, 340, 212, 468,\n 52, 308, 180, 436, 116, 372, 244, 500,\n 12, 268, 140, 396, 76, 332, 204, 460,\n 44, 300, 172, 428, 108, 364, 236, 492,\n 28, 284, 156, 412, 92, 348, 220, 476,\n 60, 316, 188, 444, 124, 380, 252, 508,\n 2, 258, 130, 386, 66, 322, 194, 450,\n 34, 290, 162, 418, 98, 354, 226, 482,\n 18, 274, 146, 402, 82, 338, 210, 466,\n 50, 306, 178, 434, 114, 370, 242, 498,\n 10, 266, 138, 394, 74, 330, 202, 458,\n 42, 298, 170, 426, 106, 362, 234, 490,\n 26, 282, 154, 410, 90, 346, 218, 474,\n 58, 314, 186, 442, 122, 378, 250, 506,\n 6, 262, 134, 390, 70, 326, 198, 454,\n 38, 294, 166, 422, 102, 358, 230, 486,\n 22, 278, 150, 406, 86, 342, 214, 470,\n 54, 310, 182, 438, 118, 374, 246, 502,\n 14, 270, 142, 398, 78, 334, 206, 462,\n 46, 302, 174, 430, 110, 366, 238, 494,\n 30, 286, 158, 414, 94, 350, 222, 478,\n 62, 318, 190, 446, 126, 382, 254, 510,\n 1, 257, 129, 385, 65, 321, 193, 449,\n 33, 289, 161, 417, 97, 353, 225, 481,\n 17, 273, 145, 401, 81, 337, 209, 465,\n 49, 305, 177, 433, 113, 369, 241, 497,\n 9, 265, 137, 393, 73, 329, 201, 457,\n 41, 297, 169, 425, 105, 361, 233, 489,\n 25, 281, 153, 409, 89, 345, 217, 473,\n 57, 313, 185, 441, 121, 377, 249, 505,\n 5, 261, 133, 389, 69, 325, 197, 453,\n 37, 293, 165, 421, 101, 357, 229, 485,\n 21, 277, 149, 405, 85, 341, 213, 469,\n 53, 309, 181, 437, 117, 373, 245, 501,\n 13, 269, 141, 397, 77, 333, 205, 461,\n 45, 301, 173, 429, 109, 365, 237, 493,\n 29, 285, 157, 413, 93, 349, 221, 477,\n 61, 317, 189, 445, 125, 381, 253, 509,\n 3, 259, 131, 387, 67, 323, 195, 451,\n 35, 291, 163, 419, 99, 355, 227, 483,\n 19, 275, 147, 403, 83, 339, 211, 467,\n 51, 307, 179, 435, 115, 371, 243, 499,\n 11, 267, 139, 395, 75, 331, 203, 459,\n 43, 299, 171, 427, 107, 363, 235, 491,\n 27, 283, 155, 411, 91, 347, 219, 475,\n 59, 315, 187, 443, 123, 379, 251, 507,\n 7, 1031, 519, 1543, 263, 1287, 775, 1799,\n 135, 1159, 647, 1671, 391, 1415, 903, 1927,\n 71, 1095, 583, 1607, 327, 1351, 839, 1863,\n 199, 1223, 711, 1735, 455, 1479, 967, 1991,\n 39, 1063, 551, 1575, 295, 1319, 807, 1831,\n 167, 1191, 679, 1703, 423, 1447, 935, 1959,\n 103, 1127, 615, 1639, 359, 1383, 871, 1895,\n 231, 1255, 743, 1767, 487, 1511, 999, 2023,\n 23, 1047, 535, 1559, 279, 1303, 791, 1815,\n 151, 1175, 663, 1687, 407, 1431, 919, 1943,\n 87, 1111, 599, 1623, 343, 1367, 855, 1879,\n 215, 1239, 727, 1751, 471, 1495, 983, 2007,\n 55, 1079, 567, 1591, 311, 1335, 823, 1847,\n 183, 1207, 695, 1719, 439, 1463, 951, 1975,\n 119, 1143, 631, 1655, 375, 1399, 887, 1911,\n 247, 1271, 759, 1783, 503, 1527, 1015, 2039,\n 15, 1039, 527, 1551, 271, 1295, 783, 1807,\n 143, 1167, 655, 1679, 399, 1423, 911, 1935,\n 79, 1103, 591, 1615, 335, 1359, 847, 1871,\n 207, 1231, 719, 1743, 463, 1487, 975, 1999,\n 47, 1071, 559, 1583, 303, 1327, 815, 1839,\n 175, 1199, 687, 1711, 431, 1455, 943, 1967,\n 111, 1135, 623, 1647, 367, 1391, 879, 1903,\n 239, 1263, 751, 1775, 495, 1519, 1007, 2031,\n 31, 1055, 543, 1567, 287, 1311, 799, 1823,\n 159, 1183, 671, 1695, 415, 1439, 927, 1951,\n 95, 1119, 607, 1631, 351, 1375, 863, 1887,\n 223, 1247, 735, 1759, 479, 1503, 991, 2015,\n 63, 1087, 575, 1599, 319, 1343, 831, 1855,\n 191, 1215, 703, 1727, 447, 1471, 959, 1983,\n 127, 1151, 639, 1663, 383, 1407, 895, 1919,\n 255, 1279, 767, 1791, 511, 1535, 1023, 2047,\n};\n\nstatic BROTLI_INLINE void StoreStaticCommandHuffmanTree(\n size_t* storage_ix, uint8_t* storage) {\n BrotliWriteBits(\n 56, BROTLI_MAKE_UINT64_T(0x926244U, 0x16307003U), storage_ix, storage);\n BrotliWriteBits(3, 0x00000000U, storage_ix, storage);\n}\n\nstatic const BROTLI_MODEL(\"small\") uint16_t kStaticDistanceCodeBits[64] = {\n 0, 32, 16, 48, 8, 40, 24, 56, 4, 36, 20, 52, 12, 44, 28, 60,\n 2, 34, 18, 50, 10, 42, 26, 58, 6, 38, 22, 54, 14, 46, 30, 62,\n 1, 33, 17, 49, 9, 41, 25, 57, 5, 37, 21, 53, 13, 45, 29, 61,\n 3, 35, 19, 51, 11, 43, 27, 59, 7, 39, 23, 55, 15, 47, 31, 63,\n};\n\nstatic BROTLI_INLINE void StoreStaticDistanceHuffmanTree(\n size_t* storage_ix, uint8_t* storage) {\n BrotliWriteBits(28, 0x0369DC03u, storage_ix, storage);\n}\n/* GENERATED CODE END */\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_ENTROPY_ENCODE_STATIC_H_ */\n" }, { "path": "libs/brotli/enc/fast_log.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"fast_log.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* \", \".join([\"%.16ff\" % x for x in [0.0]+[log2(x) for x in range(1, 256)]]) */\nconst BROTLI_MODEL(\"small\") double kBrotliLog2Table[BROTLI_LOG2_TABLE_SIZE] = {\n 0.0000000000000000f, 0.0000000000000000f, 1.0000000000000000f,\n 1.5849625007211563f, 2.0000000000000000f, 2.3219280948873622f,\n 2.5849625007211561f, 2.8073549220576042f, 3.0000000000000000f,\n 3.1699250014423126f, 3.3219280948873626f, 3.4594316186372978f,\n 3.5849625007211565f, 3.7004397181410922f, 3.8073549220576037f,\n 3.9068905956085187f, 4.0000000000000000f, 4.0874628412503400f,\n 4.1699250014423122f, 4.2479275134435852f, 4.3219280948873626f,\n 4.3923174227787607f, 4.4594316186372973f, 4.5235619560570131f,\n 4.5849625007211570f, 4.6438561897747244f, 4.7004397181410926f,\n 4.7548875021634691f, 4.8073549220576037f, 4.8579809951275728f,\n 4.9068905956085187f, 4.9541963103868758f, 5.0000000000000000f,\n 5.0443941193584534f, 5.0874628412503400f, 5.1292830169449664f,\n 5.1699250014423122f, 5.2094533656289501f, 5.2479275134435852f,\n 5.2854022188622487f, 5.3219280948873626f, 5.3575520046180838f,\n 5.3923174227787607f, 5.4262647547020979f, 5.4594316186372973f,\n 5.4918530963296748f, 5.5235619560570131f, 5.5545888516776376f,\n 5.5849625007211570f, 5.6147098441152083f, 5.6438561897747244f,\n 5.6724253419714961f, 5.7004397181410926f, 5.7279204545631996f,\n 5.7548875021634691f, 5.7813597135246599f, 5.8073549220576046f,\n 5.8328900141647422f, 5.8579809951275719f, 5.8826430493618416f,\n 5.9068905956085187f, 5.9307373375628867f, 5.9541963103868758f,\n 5.9772799234999168f, 6.0000000000000000f, 6.0223678130284544f,\n 6.0443941193584534f, 6.0660891904577721f, 6.0874628412503400f,\n 6.1085244567781700f, 6.1292830169449672f, 6.1497471195046822f,\n 6.1699250014423122f, 6.1898245588800176f, 6.2094533656289510f,\n 6.2288186904958804f, 6.2479275134435861f, 6.2667865406949019f,\n 6.2854022188622487f, 6.3037807481771031f, 6.3219280948873617f,\n 6.3398500028846252f, 6.3575520046180847f, 6.3750394313469254f,\n 6.3923174227787598f, 6.4093909361377026f, 6.4262647547020979f,\n 6.4429434958487288f, 6.4594316186372982f, 6.4757334309663976f,\n 6.4918530963296748f, 6.5077946401986964f, 6.5235619560570131f,\n 6.5391588111080319f, 6.5545888516776376f, 6.5698556083309478f,\n 6.5849625007211561f, 6.5999128421871278f, 6.6147098441152092f,\n 6.6293566200796095f, 6.6438561897747253f, 6.6582114827517955f,\n 6.6724253419714952f, 6.6865005271832185f, 6.7004397181410917f,\n 6.7142455176661224f, 6.7279204545631988f, 6.7414669864011465f,\n 6.7548875021634691f, 6.7681843247769260f, 6.7813597135246599f,\n 6.7944158663501062f, 6.8073549220576037f, 6.8201789624151887f,\n 6.8328900141647422f, 6.8454900509443757f, 6.8579809951275719f,\n 6.8703647195834048f, 6.8826430493618416f, 6.8948177633079437f,\n 6.9068905956085187f, 6.9188632372745955f, 6.9307373375628867f,\n 6.9425145053392399f, 6.9541963103868758f, 6.9657842846620879f,\n 6.9772799234999168f, 6.9886846867721664f, 7.0000000000000000f,\n 7.0112272554232540f, 7.0223678130284544f, 7.0334230015374501f,\n 7.0443941193584534f, 7.0552824355011898f, 7.0660891904577721f,\n 7.0768155970508317f, 7.0874628412503400f, 7.0980320829605272f,\n 7.1085244567781700f, 7.1189410727235076f, 7.1292830169449664f,\n 7.1395513523987937f, 7.1497471195046822f, 7.1598713367783891f,\n 7.1699250014423130f, 7.1799090900149345f, 7.1898245588800176f,\n 7.1996723448363644f, 7.2094533656289492f, 7.2191685204621621f,\n 7.2288186904958804f, 7.2384047393250794f, 7.2479275134435861f,\n 7.2573878426926521f, 7.2667865406949019f, 7.2761244052742384f,\n 7.2854022188622487f, 7.2946207488916270f, 7.3037807481771031f,\n 7.3128829552843557f, 7.3219280948873617f, 7.3309168781146177f,\n 7.3398500028846243f, 7.3487281542310781f, 7.3575520046180847f,\n 7.3663222142458151f, 7.3750394313469254f, 7.3837042924740528f,\n 7.3923174227787607f, 7.4008794362821844f, 7.4093909361377026f,\n 7.4178525148858991f, 7.4262647547020979f, 7.4346282276367255f,\n 7.4429434958487288f, 7.4512111118323299f, 7.4594316186372973f,\n 7.4676055500829976f, 7.4757334309663976f, 7.4838157772642564f,\n 7.4918530963296748f, 7.4998458870832057f, 7.5077946401986964f,\n 7.5156998382840436f, 7.5235619560570131f, 7.5313814605163119f,\n 7.5391588111080319f, 7.5468944598876373f, 7.5545888516776376f,\n 7.5622424242210728f, 7.5698556083309478f, 7.5774288280357487f,\n 7.5849625007211561f, 7.5924570372680806f, 7.5999128421871278f,\n 7.6073303137496113f, 7.6147098441152075f, 7.6220518194563764f,\n 7.6293566200796095f, 7.6366246205436488f, 7.6438561897747244f,\n 7.6510516911789290f, 7.6582114827517955f, 7.6653359171851765f,\n 7.6724253419714952f, 7.6794800995054464f, 7.6865005271832185f,\n 7.6934869574993252f, 7.7004397181410926f, 7.7073591320808825f,\n 7.7142455176661224f, 7.7210991887071856f, 7.7279204545631996f,\n 7.7347096202258392f, 7.7414669864011465f, 7.7481928495894596f,\n 7.7548875021634691f, 7.7615512324444795f, 7.7681843247769260f,\n 7.7747870596011737f, 7.7813597135246608f, 7.7879025593914317f,\n 7.7944158663501062f, 7.8008998999203047f, 7.8073549220576037f,\n 7.8137811912170374f, 7.8201789624151887f, 7.8265484872909159f,\n 7.8328900141647422f, 7.8392037880969445f, 7.8454900509443757f,\n 7.8517490414160571f, 7.8579809951275719f, 7.8641861446542798f,\n 7.8703647195834048f, 7.8765169465650002f, 7.8826430493618425f,\n 7.8887432488982601f, 7.8948177633079446f, 7.9008668079807496f,\n 7.9068905956085187f, 7.9128893362299619f, 7.9188632372745955f,\n 7.9248125036057813f, 7.9307373375628867f, 7.9366379390025719f,\n 7.9425145053392399f, 7.9483672315846778f, 7.9541963103868758f,\n 7.9600019320680806f, 7.9657842846620870f, 7.9715435539507720f,\n 7.9772799234999168f, 7.9829935746943104f, 7.9886846867721664f,\n 7.9943534368588578f\n};\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/fast_log.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Utilities for fast computation of logarithms. */\n\n#ifndef BROTLI_ENC_FAST_LOG_H_\n#define BROTLI_ENC_FAST_LOG_H_\n\n#include \n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic BROTLI_INLINE uint32_t Log2FloorNonZero(size_t n) {\n#if defined(BROTLI_BSR32)\n return BROTLI_BSR32((uint32_t)n);\n#else\n uint32_t result = 0;\n while (n >>= 1) result++;\n return result;\n#endif\n}\n\n#define BROTLI_LOG2_TABLE_SIZE 256\n\n/* A lookup table for small values of log2(int) to be used in entropy\n computation. */\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\")\ndouble kBrotliLog2Table[BROTLI_LOG2_TABLE_SIZE];\n\n/* Visual Studio 2012 and Android API levels < 18 do not have the log2()\n * function defined, so we use log() and a multiplication instead. */\n#if !defined(BROTLI_HAVE_LOG2)\n#if ((defined(_MSC_VER) && _MSC_VER <= 1700) || \\\n (defined(__ANDROID_API__) && __ANDROID_API__ < 18))\n#define BROTLI_HAVE_LOG2 0\n#else\n#define BROTLI_HAVE_LOG2 1\n#endif\n#endif\n\n#define LOG_2_INV 1.4426950408889634\n\n/* Faster logarithm for small integers, with the property of log2(0) == 0. */\nstatic BROTLI_INLINE double FastLog2(size_t v) {\n if (v < BROTLI_LOG2_TABLE_SIZE) {\n return kBrotliLog2Table[v];\n }\n#if !(BROTLI_HAVE_LOG2)\n return log((double)v) * LOG_2_INV;\n#else\n return log2((double)v);\n#endif\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_FAST_LOG_H_ */\n" }, { "path": "libs/brotli/enc/find_match_length.h", "content": "/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Function to find maximal matching prefixes of strings. */\n\n#ifndef BROTLI_ENC_FIND_MATCH_LENGTH_H_\n#define BROTLI_ENC_FIND_MATCH_LENGTH_H_\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* Separate implementation for little-endian 64-bit targets, for speed. */\n#if defined(BROTLI_TZCNT64) && BROTLI_64_BITS && BROTLI_LITTLE_ENDIAN\nstatic BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1,\n const uint8_t* s2,\n size_t limit) {\n const uint8_t *s1_orig = s1;\n for (; limit >= 8; limit -= 8) {\n uint64_t x = BROTLI_UNALIGNED_LOAD64LE(s2) ^\n BROTLI_UNALIGNED_LOAD64LE(s1);\n s2 += 8;\n if (x != 0) {\n size_t matching_bits = (size_t)BROTLI_TZCNT64(x);\n return (size_t)(s1 - s1_orig) + (matching_bits >> 3);\n }\n s1 += 8;\n }\n while (limit && *s1 == *s2) {\n limit--;\n ++s2;\n ++s1;\n }\n return (size_t)(s1 - s1_orig);\n}\n#else\nstatic BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1,\n const uint8_t* s2,\n size_t limit) {\n size_t matched = 0;\n const uint8_t* s2_limit = s2 + limit;\n const uint8_t* s2_ptr = s2;\n /* Find out how long the match is. We loop over the data 32 bits at a\n time until we find a 32-bit block that doesn't match; then we find\n the first non-matching bit and use that to calculate the total\n length of the match. */\n while (s2_ptr <= s2_limit - 4 &&\n BrotliUnalignedRead32(s2_ptr) ==\n BrotliUnalignedRead32(s1 + matched)) {\n s2_ptr += 4;\n matched += 4;\n }\n while ((s2_ptr < s2_limit) && (s1[matched] == *s2_ptr)) {\n ++s2_ptr;\n ++matched;\n }\n return matched;\n}\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_FIND_MATCH_LENGTH_H_ */\n" }, { "path": "libs/brotli/enc/hash.h", "content": "/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* A (forgetful) hash table to the data seen by the compressor, to\n help create backward references to previous data. */\n\n#ifndef BROTLI_ENC_HASH_H_\n#define BROTLI_ENC_HASH_H_\n\n#include \"../common/constants.h\"\n#include \"../common/dictionary.h\"\n#include \"../common/platform.h\"\n#include \"compound_dictionary.h\"\n#include \"encoder_dict.h\"\n#include \"fast_log.h\"\n#include \"find_match_length.h\"\n#include \"hash_base.h\"\n#include \"matching_tag_mask.h\"\n#include \"memory.h\"\n#include \"params.h\"\n#include \"quality.h\"\n#include \"static_dict.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ntypedef struct {\n /**\n * Dynamically allocated areas; regular hasher uses one or two allocations;\n * \"composite\" hasher uses up to 4 allocations.\n */\n void* extra[4];\n\n /**\n * False before the first invocation of HasherSetup (where \"extra\" memory)\n * is allocated.\n */\n BROTLI_BOOL is_setup_;\n\n size_t dict_num_lookups;\n size_t dict_num_matches;\n\n BrotliHasherParams params;\n\n /**\n * False if hasher needs to be \"prepared\" before use (before the first\n * invocation of HasherSetup or after HasherReset). \"preparation\" is hasher\n * data initialization (using input ringbuffer).\n */\n BROTLI_BOOL is_prepared_;\n} HasherCommon;\n\n#define score_t size_t\n\nstatic const uint32_t kCutoffTransformsCount = 10;\n/* 0, 12, 27, 23, 42, 63, 56, 48, 59, 64 */\n/* 0+0, 4+8, 8+19, 12+11, 16+26, 20+43, 24+32, 28+20, 32+27, 36+28 */\nstatic const uint64_t kCutoffTransforms =\n BROTLI_MAKE_UINT64_T(0x071B520A, 0xDA2D3200);\n\ntypedef struct HasherSearchResult {\n size_t len;\n size_t distance;\n score_t score;\n int len_code_delta; /* == len_code - len */\n} HasherSearchResult;\n\nstatic BROTLI_INLINE void PrepareDistanceCache(\n int* BROTLI_RESTRICT distance_cache, const int num_distances) {\n if (num_distances > 4) {\n int last_distance = distance_cache[0];\n distance_cache[4] = last_distance - 1;\n distance_cache[5] = last_distance + 1;\n distance_cache[6] = last_distance - 2;\n distance_cache[7] = last_distance + 2;\n distance_cache[8] = last_distance - 3;\n distance_cache[9] = last_distance + 3;\n if (num_distances > 10) {\n int next_last_distance = distance_cache[1];\n distance_cache[10] = next_last_distance - 1;\n distance_cache[11] = next_last_distance + 1;\n distance_cache[12] = next_last_distance - 2;\n distance_cache[13] = next_last_distance + 2;\n distance_cache[14] = next_last_distance - 3;\n distance_cache[15] = next_last_distance + 3;\n }\n }\n}\n\n#define BROTLI_LITERAL_BYTE_SCORE 135\n#define BROTLI_DISTANCE_BIT_PENALTY 30\n/* Score must be positive after applying maximal penalty. */\n#define BROTLI_SCORE_BASE (BROTLI_DISTANCE_BIT_PENALTY * 8 * sizeof(size_t))\n\n/* Usually, we always choose the longest backward reference. This function\n allows for the exception of that rule.\n\n If we choose a backward reference that is further away, it will\n usually be coded with more bits. We approximate this by assuming\n log2(distance). If the distance can be expressed in terms of the\n last four distances, we use some heuristic constants to estimate\n the bits cost. For the first up to four literals we use the bit\n cost of the literals from the literal cost model, after that we\n use the average bit cost of the cost model.\n\n This function is used to sometimes discard a longer backward reference\n when it is not much longer and the bit cost for encoding it is more\n than the saved literals.\n\n backward_reference_offset MUST be positive. */\nstatic BROTLI_INLINE score_t BackwardReferenceScore(\n size_t copy_length, size_t backward_reference_offset) {\n return BROTLI_SCORE_BASE + BROTLI_LITERAL_BYTE_SCORE * (score_t)copy_length -\n BROTLI_DISTANCE_BIT_PENALTY * Log2FloorNonZero(backward_reference_offset);\n}\n\nstatic BROTLI_INLINE score_t BackwardReferenceScoreUsingLastDistance(\n size_t copy_length) {\n return BROTLI_LITERAL_BYTE_SCORE * (score_t)copy_length +\n BROTLI_SCORE_BASE + 15;\n}\n\nstatic BROTLI_INLINE score_t BackwardReferencePenaltyUsingLastDistance(\n size_t distance_short_code) {\n return (score_t)39 + ((0x1CA10 >> (distance_short_code & 0xE)) & 0xE);\n}\n\nstatic BROTLI_INLINE BROTLI_BOOL TestStaticDictionaryItem(\n const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx,\n const uint8_t* data, size_t max_length, size_t max_backward,\n size_t max_distance, HasherSearchResult* out) {\n size_t offset;\n size_t matchlen;\n size_t backward;\n score_t score;\n offset = dictionary->words->offsets_by_length[len] + len * word_idx;\n if (len > max_length) {\n return BROTLI_FALSE;\n }\n\n matchlen =\n FindMatchLengthWithLimit(data, &dictionary->words->data[offset], len);\n if (matchlen + dictionary->cutoffTransformsCount <= len || matchlen == 0) {\n return BROTLI_FALSE;\n }\n {\n size_t cut = len - matchlen;\n size_t transform_id = (cut << 2) +\n (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);\n backward = max_backward + 1 + word_idx +\n (transform_id << dictionary->words->size_bits_by_length[len]);\n }\n if (backward > max_distance) {\n return BROTLI_FALSE;\n }\n score = BackwardReferenceScore(matchlen, backward);\n if (score < out->score) {\n return BROTLI_FALSE;\n }\n out->len = matchlen;\n out->len_code_delta = (int)len - (int)matchlen;\n out->distance = backward;\n out->score = score;\n return BROTLI_TRUE;\n}\n\nstatic BROTLI_INLINE void SearchInStaticDictionary(\n const BrotliEncoderDictionary* dictionary,\n HasherCommon* common, const uint8_t* data, size_t max_length,\n size_t max_backward, size_t max_distance,\n HasherSearchResult* out, BROTLI_BOOL shallow) {\n size_t key;\n size_t i;\n if (common->dict_num_matches < (common->dict_num_lookups >> 7)) {\n return;\n }\n key = Hash14(data) << 1;\n for (i = 0; i < (shallow ? 1u : 2u); ++i, ++key) {\n common->dict_num_lookups++;\n if (dictionary->hash_table_lengths[key] != 0) {\n BROTLI_BOOL item_matches = TestStaticDictionaryItem(\n dictionary, dictionary->hash_table_lengths[key],\n dictionary->hash_table_words[key], data,\n max_length, max_backward, max_distance, out);\n if (item_matches) {\n common->dict_num_matches++;\n }\n }\n }\n}\n\ntypedef struct BackwardMatch {\n uint32_t distance;\n uint32_t length_and_code;\n} BackwardMatch;\n\nstatic BROTLI_INLINE void InitBackwardMatch(BackwardMatch* self,\n size_t dist, size_t len) {\n self->distance = (uint32_t)dist;\n self->length_and_code = (uint32_t)(len << 5);\n}\n\nstatic BROTLI_INLINE void InitDictionaryBackwardMatch(BackwardMatch* self,\n size_t dist, size_t len, size_t len_code) {\n self->distance = (uint32_t)dist;\n self->length_and_code =\n (uint32_t)((len << 5) | (len == len_code ? 0 : len_code));\n}\n\nstatic BROTLI_INLINE size_t BackwardMatchLength(const BackwardMatch* self) {\n return self->length_and_code >> 5;\n}\n\nstatic BROTLI_INLINE size_t BackwardMatchLengthCode(const BackwardMatch* self) {\n size_t code = self->length_and_code & 31;\n return code ? code : BackwardMatchLength(self);\n}\n\n#define EXPAND_CAT(a, b) CAT(a, b)\n#define CAT(a, b) a ## b\n#define FN(X) EXPAND_CAT(X, HASHER())\n\n#define HASHER() H10\n#define BUCKET_BITS 17\n#define MAX_TREE_SEARCH_DEPTH 64\n#define MAX_TREE_COMP_LENGTH 128\n#include \"hash_to_binary_tree_inc.h\" /* NOLINT(build/include) */\n#undef MAX_TREE_SEARCH_DEPTH\n#undef MAX_TREE_COMP_LENGTH\n#undef BUCKET_BITS\n#undef HASHER\n/* MAX_NUM_MATCHES == 64 + MAX_TREE_SEARCH_DEPTH */\n#define MAX_NUM_MATCHES_H10 128\n\n/* For BUCKET_SWEEP_BITS == 0, enabling the dictionary lookup makes compression\n a little faster (0.5% - 1%) and it compresses 0.15% better on small text\n and HTML inputs. */\n\n#define HASHER() H2\n#define BUCKET_BITS 16\n#define BUCKET_SWEEP_BITS 0\n#define HASH_LEN 5\n#define USE_DICTIONARY 1\n#include \"hash_longest_match_quickly_inc.h\" /* NOLINT(build/include) */\n#undef BUCKET_SWEEP_BITS\n#undef USE_DICTIONARY\n#undef HASHER\n\n#define HASHER() H3\n#define BUCKET_SWEEP_BITS 1\n#define USE_DICTIONARY 0\n#include \"hash_longest_match_quickly_inc.h\" /* NOLINT(build/include) */\n#undef USE_DICTIONARY\n#undef BUCKET_SWEEP_BITS\n#undef BUCKET_BITS\n#undef HASHER\n\n#define HASHER() H4\n#define BUCKET_BITS 17\n#define BUCKET_SWEEP_BITS 2\n#define USE_DICTIONARY 1\n#include \"hash_longest_match_quickly_inc.h\" /* NOLINT(build/include) */\n#undef USE_DICTIONARY\n#undef HASH_LEN\n#undef BUCKET_SWEEP_BITS\n#undef BUCKET_BITS\n#undef HASHER\n\n#define HASHER() H5\n#include \"hash_longest_match_inc.h\" /* NOLINT(build/include) */\n#undef HASHER\n\n#define HASHER() H6\n#include \"hash_longest_match64_inc.h\" /* NOLINT(build/include) */\n#undef HASHER\n\n#if defined(BROTLI_MAX_SIMD_QUALITY)\n#define HASHER() H58\n#include \"hash_longest_match_simd_inc.h\" /* NOLINT(build/include) */\n#undef HASHER\n\n#define HASHER() H68\n#include \"hash_longest_match64_simd_inc.h\" /* NOLINT(build/include) */\n#undef HASHER\n#endif\n\n#define BUCKET_BITS 15\n\n#define NUM_LAST_DISTANCES_TO_CHECK 4\n#define NUM_BANKS 1\n#define BANK_BITS 16\n#define HASHER() H40\n#include \"hash_forgetful_chain_inc.h\" /* NOLINT(build/include) */\n#undef HASHER\n#undef NUM_LAST_DISTANCES_TO_CHECK\n\n#define NUM_LAST_DISTANCES_TO_CHECK 10\n#define HASHER() H41\n#include \"hash_forgetful_chain_inc.h\" /* NOLINT(build/include) */\n#undef HASHER\n#undef NUM_LAST_DISTANCES_TO_CHECK\n#undef NUM_BANKS\n#undef BANK_BITS\n\n#define NUM_LAST_DISTANCES_TO_CHECK 16\n#define NUM_BANKS 512\n#define BANK_BITS 9\n#define HASHER() H42\n#include \"hash_forgetful_chain_inc.h\" /* NOLINT(build/include) */\n#undef HASHER\n#undef NUM_LAST_DISTANCES_TO_CHECK\n#undef NUM_BANKS\n#undef BANK_BITS\n\n#undef BUCKET_BITS\n\n#define HASHER() H54\n#define BUCKET_BITS 20\n#define BUCKET_SWEEP_BITS 2\n#define HASH_LEN 7\n#define USE_DICTIONARY 0\n#include \"hash_longest_match_quickly_inc.h\" /* NOLINT(build/include) */\n#undef USE_DICTIONARY\n#undef HASH_LEN\n#undef BUCKET_SWEEP_BITS\n#undef BUCKET_BITS\n#undef HASHER\n\n/* fast large window hashers */\n\n#define HASHER() HROLLING_FAST\n#define CHUNKLEN 32\n#define JUMP 4\n#define NUMBUCKETS 16777216\n#define MASK ((NUMBUCKETS * 64) - 1)\n#include \"hash_rolling_inc.h\" /* NOLINT(build/include) */\n#undef JUMP\n#undef HASHER\n\n\n#define HASHER() HROLLING\n#define JUMP 1\n#include \"hash_rolling_inc.h\" /* NOLINT(build/include) */\n#undef MASK\n#undef NUMBUCKETS\n#undef JUMP\n#undef CHUNKLEN\n#undef HASHER\n\n#define HASHER() H35\n#define HASHER_A H3\n#define HASHER_B HROLLING_FAST\n#include \"hash_composite_inc.h\" /* NOLINT(build/include) */\n#undef HASHER_A\n#undef HASHER_B\n#undef HASHER\n\n#define HASHER() H55\n#define HASHER_A H54\n#define HASHER_B HROLLING_FAST\n#include \"hash_composite_inc.h\" /* NOLINT(build/include) */\n#undef HASHER_A\n#undef HASHER_B\n#undef HASHER\n\n#define HASHER() H65\n#define HASHER_A H6\n#define HASHER_B HROLLING\n#include \"hash_composite_inc.h\" /* NOLINT(build/include) */\n#undef HASHER_A\n#undef HASHER_B\n#undef HASHER\n\n#undef FN\n#undef CAT\n#undef EXPAND_CAT\n\n#if defined(BROTLI_MAX_SIMD_QUALITY)\n#define FOR_SIMPLE_HASHERS(H) \\\n H(2) H(3) H(4) H(5) H(6) H(40) H(41) H(42) H(54) H(58) H(68)\n#else\n#define FOR_SIMPLE_HASHERS(H) \\\n H(2) H(3) H(4) H(5) H(6) H(40) H(41) H(42) H(54)\n#endif\n#define FOR_COMPOSITE_HASHERS(H) H(35) H(55) H(65)\n#define FOR_GENERIC_HASHERS(H) FOR_SIMPLE_HASHERS(H) FOR_COMPOSITE_HASHERS(H)\n#define FOR_ALL_HASHERS(H) FOR_GENERIC_HASHERS(H) H(10)\n\ntypedef struct {\n HasherCommon common;\n\n union {\n#define MEMBER_(N) \\\n H ## N _H ## N;\n FOR_ALL_HASHERS(MEMBER_)\n#undef MEMBER_\n } privat;\n} Hasher;\n\n/* MUST be invoked before any other method. */\nstatic BROTLI_INLINE void HasherInit(Hasher* hasher) {\n hasher->common.is_setup_ = BROTLI_FALSE;\n hasher->common.extra[0] = NULL;\n hasher->common.extra[1] = NULL;\n hasher->common.extra[2] = NULL;\n hasher->common.extra[3] = NULL;\n}\n\nstatic BROTLI_INLINE void DestroyHasher(MemoryManager* m, Hasher* hasher) {\n if (hasher->common.extra[0] != NULL) BROTLI_FREE(m, hasher->common.extra[0]);\n if (hasher->common.extra[1] != NULL) BROTLI_FREE(m, hasher->common.extra[1]);\n if (hasher->common.extra[2] != NULL) BROTLI_FREE(m, hasher->common.extra[2]);\n if (hasher->common.extra[3] != NULL) BROTLI_FREE(m, hasher->common.extra[3]);\n}\n\nstatic BROTLI_INLINE void HasherReset(Hasher* hasher) {\n hasher->common.is_prepared_ = BROTLI_FALSE;\n}\n\nstatic BROTLI_INLINE void HasherSize(const BrotliEncoderParams* params,\n BROTLI_BOOL one_shot, const size_t input_size, size_t* alloc_size) {\n switch (params->hasher.type) {\n#define SIZE_(N) \\\n case N: \\\n HashMemAllocInBytesH ## N(params, one_shot, input_size, alloc_size); \\\n break;\n FOR_ALL_HASHERS(SIZE_)\n#undef SIZE_\n default:\n break;\n }\n}\n\nstatic BROTLI_INLINE void HasherSetup(MemoryManager* m, Hasher* hasher,\n BrotliEncoderParams* params, const uint8_t* data, size_t position,\n size_t input_size, BROTLI_BOOL is_last) {\n BROTLI_BOOL one_shot = (position == 0 && is_last);\n if (!hasher->common.is_setup_) {\n size_t alloc_size[4] = {0};\n size_t i;\n ChooseHasher(params, ¶ms->hasher);\n hasher->common.params = params->hasher;\n hasher->common.dict_num_lookups = 0;\n hasher->common.dict_num_matches = 0;\n HasherSize(params, one_shot, input_size, alloc_size);\n for (i = 0; i < 4; ++i) {\n if (alloc_size[i] == 0) continue;\n hasher->common.extra[i] = BROTLI_ALLOC(m, uint8_t, alloc_size[i]);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(hasher->common.extra[i])) return;\n }\n switch (hasher->common.params.type) {\n#define INITIALIZE_(N) \\\n case N: \\\n InitializeH ## N(&hasher->common, \\\n &hasher->privat._H ## N, params); \\\n break;\n FOR_ALL_HASHERS(INITIALIZE_);\n#undef INITIALIZE_\n default:\n break;\n }\n HasherReset(hasher);\n hasher->common.is_setup_ = BROTLI_TRUE;\n }\n\n if (!hasher->common.is_prepared_) {\n switch (hasher->common.params.type) {\n#define PREPARE_(N) \\\n case N: \\\n PrepareH ## N( \\\n &hasher->privat._H ## N, \\\n one_shot, input_size, data); \\\n break;\n FOR_ALL_HASHERS(PREPARE_)\n#undef PREPARE_\n default: break;\n }\n hasher->common.is_prepared_ = BROTLI_TRUE;\n }\n}\n\nstatic BROTLI_INLINE void InitOrStitchToPreviousBlock(\n MemoryManager* m, Hasher* hasher, const uint8_t* data, size_t mask,\n BrotliEncoderParams* params, size_t position, size_t input_size,\n BROTLI_BOOL is_last) {\n HasherSetup(m, hasher, params, data, position, input_size, is_last);\n if (BROTLI_IS_OOM(m)) return;\n switch (hasher->common.params.type) {\n#define INIT_(N) \\\n case N: \\\n StitchToPreviousBlockH ## N( \\\n &hasher->privat._H ## N, \\\n input_size, position, data, mask); \\\n break;\n FOR_ALL_HASHERS(INIT_)\n#undef INIT_\n default: break;\n }\n}\n\n/* NB: when seamless dictionary-ring-buffer copies are implemented, don't forget\n to add proper guards for non-zero-BROTLI_PARAM_STREAM_OFFSET. */\nstatic BROTLI_INLINE void FindCompoundDictionaryMatch(\n const PreparedDictionary* self, const uint8_t* BROTLI_RESTRICT data,\n const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache,\n const size_t cur_ix, const size_t max_length, const size_t distance_offset,\n const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) {\n const uint32_t source_size = self->source_size;\n const size_t boundary = distance_offset - source_size;\n const uint32_t hash_bits = self->hash_bits;\n const uint32_t bucket_bits = self->bucket_bits;\n const uint32_t slot_bits = self->slot_bits;\n\n const uint32_t hash_shift = 64u - bucket_bits;\n const uint32_t slot_mask = (~((uint32_t)0U)) >> (32 - slot_bits);\n const uint64_t hash_mask = (~((uint64_t)0U)) >> (64 - hash_bits);\n\n const uint32_t* slot_offsets = (uint32_t*)(&self[1]);\n const uint16_t* heads = (uint16_t*)(&slot_offsets[(size_t)1u << slot_bits]);\n const uint32_t* items = (uint32_t*)(&heads[(size_t)1u << bucket_bits]);\n const uint8_t* source = NULL;\n\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n score_t best_score = out->score;\n size_t best_len = out->len;\n size_t i;\n const uint64_t h =\n (BROTLI_UNALIGNED_LOAD64LE(&data[cur_ix_masked]) & hash_mask) *\n kPreparedDictionaryHashMul64Long;\n const uint32_t key = (uint32_t)(h >> hash_shift);\n const uint32_t slot = key & slot_mask;\n const uint32_t head = heads[key];\n const uint32_t* BROTLI_RESTRICT chain = &items[slot_offsets[slot] + head];\n uint32_t item = (head == 0xFFFF) ? 1 : 0;\n\n const void* tail = (void*)&items[self->num_items];\n if (self->magic == kPreparedDictionaryMagic) {\n source = (const uint8_t*)tail;\n } else {\n /* kLeanPreparedDictionaryMagic */\n source = (const uint8_t*)BROTLI_UNALIGNED_LOAD_PTR((const uint8_t**)tail);\n }\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n for (i = 0; i < 4; ++i) {\n const size_t distance = (size_t)distance_cache[i];\n size_t offset;\n size_t limit;\n size_t len;\n if (distance <= boundary || distance > distance_offset) continue;\n offset = distance_offset - distance;\n limit = source_size - offset;\n limit = limit > max_length ? max_length : limit;\n len = FindMatchLengthWithLimit(&source[offset], &data[cur_ix_masked],\n limit);\n if (len >= 2) {\n score_t score = BackwardReferenceScoreUsingLastDistance(len);\n if (best_score < score) {\n if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);\n if (best_score < score) {\n best_score = score;\n if (len > best_len) best_len = len;\n out->len = len;\n out->len_code_delta = 0;\n out->distance = distance;\n out->score = best_score;\n }\n }\n }\n }\n /* we require matches of len >4, so increase best_len to 3, so we can compare\n * 4 bytes all the time. */\n if (best_len < 3) {\n best_len = 3;\n }\n while (item == 0) {\n size_t offset;\n size_t distance;\n size_t limit;\n item = *chain;\n chain++;\n offset = item & 0x7FFFFFFF;\n item &= 0x80000000;\n distance = distance_offset - offset;\n limit = source_size - offset;\n limit = (limit > max_length) ? max_length : limit;\n if (distance > max_distance) continue;\n if (cur_ix_masked + best_len > ring_buffer_mask || best_len >= limit ||\n /* compare 4 bytes ending at best_len + 1 */\n BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=\n BrotliUnalignedRead32(&source[offset + best_len - 3])) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&source[offset],\n &data[cur_ix_masked],\n limit);\n if (len >= 4) {\n score_t score = BackwardReferenceScore(len, distance);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->len_code_delta = 0;\n out->distance = distance;\n out->score = best_score;\n }\n }\n }\n }\n}\n\n/* NB: when seamless dictionary-ring-buffer copies are implemented, don't forget\n to add proper guards for non-zero-BROTLI_PARAM_STREAM_OFFSET. */\nstatic BROTLI_INLINE size_t FindAllCompoundDictionaryMatches(\n const PreparedDictionary* self, const uint8_t* BROTLI_RESTRICT data,\n const size_t ring_buffer_mask, const size_t cur_ix, const size_t min_length,\n const size_t max_length, const size_t distance_offset,\n const size_t max_distance, BackwardMatch* matches, size_t match_limit) {\n const uint32_t source_size = self->source_size;\n const uint32_t hash_bits = self->hash_bits;\n const uint32_t bucket_bits = self->bucket_bits;\n const uint32_t slot_bits = self->slot_bits;\n\n const uint32_t hash_shift = 64u - bucket_bits;\n const uint32_t slot_mask = (~((uint32_t)0U)) >> (32 - slot_bits);\n const uint64_t hash_mask = (~((uint64_t)0U)) >> (64 - hash_bits);\n\n const uint32_t* slot_offsets = (uint32_t*)(&self[1]);\n const uint16_t* heads = (uint16_t*)(&slot_offsets[(size_t)1u << slot_bits]);\n const uint32_t* items = (uint32_t*)(&heads[(size_t)1u << bucket_bits]);\n const uint8_t* source = NULL;\n\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n size_t best_len = min_length;\n const uint64_t h =\n (BROTLI_UNALIGNED_LOAD64LE(&data[cur_ix_masked]) & hash_mask) *\n kPreparedDictionaryHashMul64Long;\n const uint32_t key = (uint32_t)(h >> hash_shift);\n const uint32_t slot = key & slot_mask;\n const uint32_t head = heads[key];\n const uint32_t* BROTLI_RESTRICT chain = &items[slot_offsets[slot] + head];\n uint32_t item = (head == 0xFFFF) ? 1 : 0;\n size_t found = 0;\n\n const void* tail = (void*)&items[self->num_items];\n if (self->magic == kPreparedDictionaryMagic) {\n source = (const uint8_t*)tail;\n } else {\n /* kLeanPreparedDictionaryMagic */\n source = (const uint8_t*)BROTLI_UNALIGNED_LOAD_PTR((const uint8_t**)tail);\n }\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n while (item == 0) {\n size_t offset;\n size_t distance;\n size_t limit;\n size_t len;\n item = *chain;\n chain++;\n offset = item & 0x7FFFFFFF;\n item &= 0x80000000;\n distance = distance_offset - offset;\n limit = source_size - offset;\n limit = (limit > max_length) ? max_length : limit;\n if (distance > max_distance) continue;\n if (cur_ix_masked + best_len > ring_buffer_mask ||\n best_len >= limit ||\n data[cur_ix_masked + best_len] != source[offset + best_len]) {\n continue;\n }\n len = FindMatchLengthWithLimit(\n &source[offset], &data[cur_ix_masked], limit);\n if (len > best_len) {\n best_len = len;\n InitBackwardMatch(matches++, distance, len);\n found++;\n if (found == match_limit) break;\n }\n }\n return found;\n}\n\nstatic BROTLI_INLINE void LookupCompoundDictionaryMatch(\n const CompoundDictionary* addon, const uint8_t* BROTLI_RESTRICT data,\n const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache,\n const size_t cur_ix, const size_t max_length,\n const size_t max_ring_buffer_distance, const size_t max_distance,\n HasherSearchResult* sr) {\n size_t base_offset = max_ring_buffer_distance + 1 + addon->total_size - 1;\n size_t d;\n for (d = 0; d < addon->num_chunks; ++d) {\n /* Only one prepared dictionary type is currently supported. */\n FindCompoundDictionaryMatch(\n (const PreparedDictionary*)addon->chunks[d], data, ring_buffer_mask,\n distance_cache, cur_ix, max_length,\n base_offset - addon->chunk_offsets[d], max_distance, sr);\n }\n}\n\nstatic BROTLI_INLINE size_t LookupAllCompoundDictionaryMatches(\n const CompoundDictionary* addon, const uint8_t* BROTLI_RESTRICT data,\n const size_t ring_buffer_mask, const size_t cur_ix, size_t min_length,\n const size_t max_length, const size_t max_ring_buffer_distance,\n const size_t max_distance, BackwardMatch* matches,\n size_t match_limit) {\n size_t base_offset = max_ring_buffer_distance + 1 + addon->total_size - 1;\n size_t d;\n size_t total_found = 0;\n for (d = 0; d < addon->num_chunks; ++d) {\n /* Only one prepared dictionary type is currently supported. */\n total_found += FindAllCompoundDictionaryMatches(\n (const PreparedDictionary*)addon->chunks[d], data, ring_buffer_mask,\n cur_ix, min_length, max_length, base_offset - addon->chunk_offsets[d],\n max_distance, matches + total_found, match_limit - total_found);\n if (total_found == match_limit) break;\n if (total_found > 0) {\n min_length = BackwardMatchLength(&matches[total_found - 1]);\n }\n }\n return total_found;\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_HASH_H_ */\n" }, { "path": "libs/brotli/enc/hash_base.h", "content": "/* Copyright 2025 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Basic common hash functions / constants. */\n\n#ifndef THIRD_PARTY_BROTLI_ENC_HASH_BASE_H_\n#define THIRD_PARTY_BROTLI_ENC_HASH_BASE_H_\n\n#include \"../common/platform.h\"\n\n/* kHashMul32 multiplier has these properties:\n * The multiplier must be odd. Otherwise we may lose the highest bit.\n * No long streaks of ones or zeros.\n * There is no effort to ensure that it is a prime, the oddity is enough\n for this use.\n * The number has been tuned heuristically against compression benchmarks. */\nstatic const uint32_t kHashMul32 = 0x1E35A7BD;\nstatic const uint64_t kHashMul64 =\n BROTLI_MAKE_UINT64_T(0x1FE35A7Bu, 0xD3579BD3u);\n\nstatic BROTLI_INLINE uint32_t Hash14(const uint8_t* data) {\n uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return h >> (32 - 14);\n}\n\nstatic BROTLI_INLINE uint32_t Hash15(const uint8_t* data) {\n uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return h >> (32 - 15);\n}\n\n#endif // THIRD_PARTY_BROTLI_ENC_HASH_BASE_H_\n" }, { "path": "libs/brotli/enc/hash_composite_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2018 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN, HASHER_A, HASHER_B */\n\n/* Composite hasher: This hasher allows to combine two other hashers, HASHER_A\n and HASHER_B. */\n\n#define HashComposite HASHER()\n\n#define FN_A(X) EXPAND_CAT(X, HASHER_A)\n#define FN_B(X) EXPAND_CAT(X, HASHER_B)\n\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) {\n size_t a = FN_A(HashTypeLength)();\n size_t b = FN_B(HashTypeLength)();\n return a > b ? a : b;\n}\n\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) {\n size_t a = FN_A(StoreLookahead)();\n size_t b = FN_B(StoreLookahead)();\n return a > b ? a : b;\n}\n\ntypedef struct HashComposite {\n HASHER_A ha;\n HASHER_B hb;\n HasherCommon ha_common;\n HasherCommon hb_common;\n\n /* Shortcuts. */\n HasherCommon* common;\n\n BROTLI_BOOL fresh;\n const BrotliEncoderParams* params;\n} HashComposite;\n\nstatic void FN(Initialize)(HasherCommon* common,\n HashComposite* BROTLI_RESTRICT self, const BrotliEncoderParams* params) {\n self->common = common;\n\n self->ha_common = *self->common;\n self->hb_common = *self->common;\n self->fresh = BROTLI_TRUE;\n self->params = params;\n /* TODO(lode): Initialize of the hashers is deferred to Prepare (and params\n remembered here) because we don't get the one_shot and input_size params\n here that are needed to know the memory size of them. Instead provide\n those params to all hashers FN(Initialize) */\n}\n\nstatic void FN(Prepare)(\n HashComposite* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n if (self->fresh) {\n self->fresh = BROTLI_FALSE;\n self->ha_common.extra[0] = self->common->extra[0];\n self->ha_common.extra[1] = self->common->extra[1];\n self->ha_common.extra[2] = NULL;\n self->ha_common.extra[3] = NULL;\n self->hb_common.extra[0] = self->common->extra[2];\n self->hb_common.extra[1] = self->common->extra[3];\n self->hb_common.extra[2] = NULL;\n self->hb_common.extra[3] = NULL;\n\n FN_A(Initialize)(&self->ha_common, &self->ha, self->params);\n FN_B(Initialize)(&self->hb_common, &self->hb, self->params);\n }\n FN_A(Prepare)(&self->ha, one_shot, input_size, data);\n FN_B(Prepare)(&self->hb, one_shot, input_size, data);\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n size_t alloc_size_a[4] = {0};\n size_t alloc_size_b[4] = {0};\n FN_A(HashMemAllocInBytes)(params, one_shot, input_size, alloc_size_a);\n FN_B(HashMemAllocInBytes)(params, one_shot, input_size, alloc_size_b);\n /* Should never happen. */\n if (alloc_size_a[2] != 0 || alloc_size_a[3] != 0) exit(EXIT_FAILURE);\n if (alloc_size_b[2] != 0 || alloc_size_b[3] != 0) exit(EXIT_FAILURE);\n alloc_size[0] = alloc_size_a[0];\n alloc_size[1] = alloc_size_a[1];\n alloc_size[2] = alloc_size_b[0];\n alloc_size[3] = alloc_size_b[1];\n}\n\nstatic BROTLI_INLINE void FN(Store)(HashComposite* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {\n FN_A(Store)(&self->ha, data, mask, ix);\n FN_B(Store)(&self->hb, data, mask, ix);\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(\n HashComposite* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,\n const size_t mask, const size_t ix_start,\n const size_t ix_end) {\n FN_A(StoreRange)(&self->ha, data, mask, ix_start, ix_end);\n FN_B(StoreRange)(&self->hb, data, mask, ix_start, ix_end);\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashComposite* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ring_buffer_mask) {\n FN_A(StitchToPreviousBlock)(&self->ha, num_bytes, position,\n ringbuffer, ring_buffer_mask);\n FN_B(StitchToPreviousBlock)(&self->hb, num_bytes, position,\n ringbuffer, ring_buffer_mask);\n}\n\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashComposite* BROTLI_RESTRICT self, int* BROTLI_RESTRICT distance_cache) {\n FN_A(PrepareDistanceCache)(&self->ha, distance_cache);\n FN_B(PrepareDistanceCache)(&self->hb, distance_cache);\n}\n\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashComposite* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,\n const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,\n const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n FN_A(FindLongestMatch)(&self->ha, dictionary, data, ring_buffer_mask,\n distance_cache, cur_ix, max_length, max_backward, dictionary_distance,\n max_distance, out);\n FN_B(FindLongestMatch)(&self->hb, dictionary, data, ring_buffer_mask,\n distance_cache, cur_ix, max_length, max_backward, dictionary_distance,\n max_distance, out);\n}\n\n#undef HashComposite\n" }, { "path": "libs/brotli/enc/hash_forgetful_chain_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN, BUCKET_BITS, NUM_BANKS, BANK_BITS,\n NUM_LAST_DISTANCES_TO_CHECK */\n\n/* A (forgetful) hash table to the data seen by the compressor, to\n help create backward references to previous data.\n\n Hashes are stored in chains which are bucketed to groups. Group of chains\n share a storage \"bank\". When more than \"bank size\" chain nodes are added,\n oldest nodes are replaced; this way several chains may share a tail. */\n\n#define HashForgetfulChain HASHER()\n\n#define BANK_SIZE (1 << BANK_BITS)\n\n/* Number of hash buckets. */\n#define BUCKET_SIZE (1 << BUCKET_BITS)\n\n#define CAPPED_CHAINS 0\n\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }\n\n/* HashBytes is the function that chooses the bucket to place the address in.*/\nstatic BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) {\n const uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return h >> (32 - BUCKET_BITS);\n}\n\ntypedef struct FN(Slot) {\n uint16_t delta;\n uint16_t next;\n} FN(Slot);\n\ntypedef struct FN(Bank) {\n FN(Slot) slots[BANK_SIZE];\n} FN(Bank);\n\ntypedef struct HashForgetfulChain {\n uint16_t free_slot_idx[NUM_BANKS]; /* Up to 1KiB. Move to dynamic? */\n size_t max_hops;\n\n /* Shortcuts. */\n void* extra[2];\n HasherCommon* common;\n\n /* --- Dynamic size members --- */\n\n /* uint32_t addr[BUCKET_SIZE]; */\n\n /* uint16_t head[BUCKET_SIZE]; */\n\n /* Truncated hash used for quick rejection of \"distance cache\" candidates. */\n /* uint8_t tiny_hash[65536];*/\n\n /* FN(Bank) banks[NUM_BANKS]; */\n} HashForgetfulChain;\n\nstatic uint32_t* FN(Addr)(void* extra) {\n return (uint32_t*)extra;\n}\n\nstatic uint16_t* FN(Head)(void* extra) {\n return (uint16_t*)(&FN(Addr)(extra)[BUCKET_SIZE]);\n}\n\nstatic uint8_t* FN(TinyHash)(void* extra) {\n return (uint8_t*)(&FN(Head)(extra)[BUCKET_SIZE]);\n}\n\nstatic FN(Bank)* FN(Banks)(void* extra) {\n return (FN(Bank)*)(extra);\n}\n\nstatic void FN(Initialize)(\n HasherCommon* common, HashForgetfulChain* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n self->common = common;\n self->extra[0] = common->extra[0];\n self->extra[1] = common->extra[1];\n\n self->max_hops = (params->quality > 6 ? 7u : 8u) << (params->quality - 4);\n}\n\nstatic void FN(Prepare)(\n HashForgetfulChain* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n uint32_t* BROTLI_RESTRICT addr = FN(Addr)(self->extra[0]);\n uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra[0]);\n uint8_t* BROTLI_RESTRICT tiny_hash = FN(TinyHash)(self->extra[0]);\n /* Partial preparation is 100 times slower (per socket). */\n size_t partial_prepare_threshold = BUCKET_SIZE >> 6;\n if (one_shot && input_size <= partial_prepare_threshold) {\n size_t i;\n for (i = 0; i < input_size; ++i) {\n size_t bucket = FN(HashBytes)(&data[i]);\n /* See InitEmpty comment. */\n addr[bucket] = 0xCCCCCCCC;\n head[bucket] = 0xCCCC;\n }\n } else {\n /* Fill |addr| array with 0xCCCCCCCC value. Because of wrapping, position\n processed by hasher never reaches 3GB + 64M; this makes all new chains\n to be terminated after the first node. */\n memset(addr, 0xCC, sizeof(uint32_t) * BUCKET_SIZE);\n memset(head, 0, sizeof(uint16_t) * BUCKET_SIZE);\n }\n memset(tiny_hash, 0, sizeof(uint8_t) * 65536);\n memset(self->free_slot_idx, 0, sizeof(self->free_slot_idx));\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n BROTLI_UNUSED(params);\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n alloc_size[0] = sizeof(uint32_t) * BUCKET_SIZE +\n sizeof(uint16_t) * BUCKET_SIZE + sizeof(uint8_t) * 65536;\n alloc_size[1] = sizeof(FN(Bank)) * NUM_BANKS;\n}\n\n/* Look at 4 bytes at &data[ix & mask]. Compute a hash from these, and prepend\n node to corresponding chain; also update tiny_hash for current position. */\nstatic BROTLI_INLINE void FN(Store)(HashForgetfulChain* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {\n uint32_t* BROTLI_RESTRICT addr = FN(Addr)(self->extra[0]);\n uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra[0]);\n uint8_t* BROTLI_RESTRICT tiny_hash = FN(TinyHash)(self->extra[0]);\n FN(Bank)* BROTLI_RESTRICT banks = FN(Banks)(self->extra[1]);\n const size_t key = FN(HashBytes)(&data[ix & mask]);\n const size_t bank = key & (NUM_BANKS - 1);\n const size_t idx = self->free_slot_idx[bank]++ & (BANK_SIZE - 1);\n size_t delta = ix - addr[key];\n tiny_hash[(uint16_t)ix] = (uint8_t)key;\n if (delta > 0xFFFF) delta = CAPPED_CHAINS ? 0 : 0xFFFF;\n banks[bank].slots[idx].delta = (uint16_t)delta;\n banks[bank].slots[idx].next = head[key];\n addr[key] = (uint32_t)ix;\n head[key] = (uint16_t)idx;\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(\n HashForgetfulChain* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n size_t i;\n for (i = ix_start; i < ix_end; ++i) {\n FN(Store)(self, data, mask, i);\n }\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashForgetfulChain* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ring_buffer_mask) {\n if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {\n /* Prepare the hashes for three last bytes of the last write.\n These could not be calculated before, since they require knowledge\n of both the previous and the current block. */\n FN(Store)(self, ringbuffer, ring_buffer_mask, position - 3);\n FN(Store)(self, ringbuffer, ring_buffer_mask, position - 2);\n FN(Store)(self, ringbuffer, ring_buffer_mask, position - 1);\n }\n}\n\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashForgetfulChain* BROTLI_RESTRICT self,\n int* BROTLI_RESTRICT distance_cache) {\n BROTLI_UNUSED(self);\n PrepareDistanceCache(distance_cache, NUM_LAST_DISTANCES_TO_CHECK);\n}\n\n/* Find a longest backward match of &data[cur_ix] up to the length of\n max_length and stores the position cur_ix in the hash table.\n\n REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache\n values; if this method is invoked repeatedly with the same distance\n cache values, it is enough to invoke FN(PrepareDistanceCache) once.\n\n Does not look for matches longer than max_length.\n Does not look for matches further away than max_backward.\n Writes the best match into |out|.\n |out|->score is updated only if a better match is found. */\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashForgetfulChain* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,\n const int* BROTLI_RESTRICT distance_cache,\n const size_t cur_ix, const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n uint32_t* BROTLI_RESTRICT addr = FN(Addr)(self->extra[0]);\n uint16_t* BROTLI_RESTRICT head = FN(Head)(self->extra[0]);\n uint8_t* BROTLI_RESTRICT tiny_hashes = FN(TinyHash)(self->extra[0]);\n FN(Bank)* BROTLI_RESTRICT banks = FN(Banks)(self->extra[1]);\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n /* Don't accept a short copy from far away. */\n score_t min_score = out->score;\n score_t best_score = out->score;\n size_t best_len = out->len;\n size_t i;\n const size_t key = FN(HashBytes)(&data[cur_ix_masked]);\n const uint8_t tiny_hash = (uint8_t)(key);\n out->len = 0;\n out->len_code_delta = 0;\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n /* Try last distance first. */\n for (i = 0; i < NUM_LAST_DISTANCES_TO_CHECK; ++i) {\n const size_t backward = (size_t)distance_cache[i];\n size_t prev_ix = (cur_ix - backward);\n /* For distance code 0 we want to consider 2-byte matches. */\n if (i > 0 && tiny_hashes[(uint16_t)prev_ix] != tiny_hash) continue;\n if (prev_ix >= cur_ix || backward > max_backward) {\n continue;\n }\n prev_ix &= ring_buffer_mask;\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 2) {\n score_t score = BackwardReferenceScoreUsingLastDistance(len);\n if (best_score < score) {\n if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n }\n /* we require matches of len >4, so increase best_len to 3, so we can compare\n * 4 bytes all the time. */\n if (best_len < 3) {\n best_len = 3;\n }\n {\n const size_t bank = key & (NUM_BANKS - 1);\n size_t backward = 0;\n size_t hops = self->max_hops;\n size_t delta = cur_ix - addr[key];\n size_t slot = head[key];\n while (hops--) {\n size_t prev_ix;\n size_t last = slot;\n backward += delta;\n if (backward > max_backward || (CAPPED_CHAINS && !delta)) break;\n prev_ix = (cur_ix - backward) & ring_buffer_mask;\n slot = banks[bank].slots[last].next;\n delta = banks[bank].slots[last].delta;\n if (cur_ix_masked + best_len > ring_buffer_mask ||\n prev_ix + best_len > ring_buffer_mask ||\n /* compare 4 bytes ending at best_len + 1 */\n BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=\n BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 4) {\n /* Comparing for >= 3 does not change the semantics, but just saves\n for a few unnecessary binary logarithms in backward reference\n score, since we are not interested in such short matches. */\n score_t score = BackwardReferenceScore(len, backward);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n FN(Store)(self, data, ring_buffer_mask, cur_ix);\n }\n if (out->score == min_score) {\n SearchInStaticDictionary(dictionary,\n self->common, &data[cur_ix_masked], max_length, dictionary_distance,\n max_distance, out, BROTLI_FALSE);\n }\n}\n\n#undef BANK_SIZE\n#undef BUCKET_SIZE\n#undef CAPPED_CHAINS\n\n#undef HashForgetfulChain\n" }, { "path": "libs/brotli/enc/hash_longest_match64_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN */\n\n/* A (forgetful) hash table to the data seen by the compressor, to\n help create backward references to previous data.\n\n This is a hash map of fixed size (bucket_size_) to a ring buffer of\n fixed size (block_size_). The ring buffer contains the last block_size_\n index positions of the given hash key in the compressed data. */\n\n#define HashLongestMatch HASHER()\n\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; }\n\n/* HashBytes is the function that chooses the bucket to place the address in. */\nstatic BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data,\n uint64_t hash_mul) {\n const uint64_t h = BROTLI_UNALIGNED_LOAD64LE(data) * hash_mul;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return (size_t)(h >> (64 - 15));\n}\n\ntypedef struct HashLongestMatch {\n /* Number of hash buckets. */\n size_t bucket_size_;\n /* Only block_size_ newest backward references are kept,\n and the older are forgotten. */\n size_t block_size_;\n /* Hash multiplier tuned to match length. */\n uint64_t hash_mul_;\n /* Mask for accessing entries in a block (in a ring-buffer manner). */\n uint32_t block_mask_;\n\n int block_bits_;\n int num_last_distances_to_check_;\n\n /* Shortcuts. */\n HasherCommon* common_;\n\n /* --- Dynamic size members --- */\n\n /* Number of entries in a particular bucket. */\n uint16_t* num_; /* uint16_t[bucket_size]; */\n\n /* Buckets containing block_size_ of backward references. */\n uint32_t* buckets_; /* uint32_t[bucket_size * block_size]; */\n} HashLongestMatch;\n\nstatic void FN(Initialize)(\n HasherCommon* common, HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n self->common_ = common;\n\n BROTLI_UNUSED(params);\n self->hash_mul_ = kHashMul64 << (64 - 5 * 8);\n BROTLI_DCHECK(common->params.bucket_bits == 15);\n self->bucket_size_ = (size_t)1 << common->params.bucket_bits;\n self->block_bits_ = common->params.block_bits;\n self->block_size_ = (size_t)1 << common->params.block_bits;\n self->block_mask_ = (uint32_t)(self->block_size_ - 1);\n self->num_last_distances_to_check_ =\n common->params.num_last_distances_to_check;\n self->num_ = (uint16_t*)common->extra[0];\n self->buckets_ = (uint32_t*)common->extra[1];\n}\n\nstatic void FN(Prepare)(\n HashLongestMatch* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n /* Partial preparation is 100 times slower (per socket). */\n size_t partial_prepare_threshold = self->bucket_size_ >> 6;\n if (one_shot && input_size <= partial_prepare_threshold) {\n size_t i;\n for (i = 0; i < input_size; ++i) {\n const size_t key = FN(HashBytes)(&data[i], self->hash_mul_);\n num[key] = 0;\n }\n } else {\n memset(num, 0, self->bucket_size_ * sizeof(num[0]));\n }\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;\n size_t block_size = (size_t)1 << params->hasher.block_bits;\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n alloc_size[0] = sizeof(uint16_t) * bucket_size;\n alloc_size[1] = sizeof(uint32_t) * bucket_size * block_size;\n}\n\n/* Look at 4 bytes at &data[ix & mask].\n Compute a hash from these, and store the value of ix at that position. */\nstatic BROTLI_INLINE void FN(Store)(\n HashLongestMatch* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,\n const size_t mask, const size_t ix) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n const size_t key = FN(HashBytes)(&data[ix & mask], self->hash_mul_);\n const size_t minor_ix = num[key] & self->block_mask_;\n const size_t offset = minor_ix + (key << self->block_bits_);\n ++num[key];\n buckets[offset] = (uint32_t)ix;\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n size_t i;\n for (i = ix_start; i < ix_end; ++i) {\n FN(Store)(self, data, mask, i);\n }\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashLongestMatch* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ringbuffer_mask) {\n if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {\n /* Prepare the hashes for three last bytes of the last write.\n These could not be calculated before, since they require knowledge\n of both the previous and the current block. */\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);\n }\n}\n\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashLongestMatch* BROTLI_RESTRICT self,\n int* BROTLI_RESTRICT distance_cache) {\n PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_);\n}\n\n/* Find a longest backward match of &data[cur_ix] up to the length of\n max_length and stores the position cur_ix in the hash table.\n\n REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache\n values; if this method is invoked repeatedly with the same distance\n cache values, it is enough to invoke FN(PrepareDistanceCache) once.\n\n Does not look for matches longer than max_length.\n Does not look for matches further away than max_backward.\n Writes the best match into |out|.\n |out|->score is updated only if a better match is found. */\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,\n const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,\n const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n /* Don't accept a short copy from far away. */\n score_t min_score = out->score;\n score_t best_score = out->score;\n size_t best_len = out->len;\n size_t i;\n /* Precalculate the hash key and prefetch the bucket. */\n const size_t key = FN(HashBytes)(&data[cur_ix_masked], self->hash_mul_);\n uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_];\n PREFETCH_L1(bucket);\n if (self->block_bits_ > 4) PREFETCH_L1(bucket + 16);\n out->len = 0;\n out->len_code_delta = 0;\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n /* Try last distance first. */\n for (i = 0; i < (size_t)self->num_last_distances_to_check_; ++i) {\n const size_t backward = (size_t)distance_cache[i];\n size_t prev_ix = (size_t)(cur_ix - backward);\n if (prev_ix >= cur_ix) {\n continue;\n }\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n continue;\n }\n prev_ix &= ring_buffer_mask;\n\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 3 || (len == 2 && i < 2)) {\n /* Comparing for >= 2 does not change the semantics, but just saves for\n a few unnecessary binary logarithms in backward reference score,\n since we are not interested in such short matches. */\n score_t score = BackwardReferenceScoreUsingLastDistance(len);\n if (best_score < score) {\n if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n }\n /* we require matches of len >4, so increase best_len to 3, so we can compare\n * 4 bytes all the time. */\n if (best_len < 3) {\n best_len = 3;\n }\n {\n const size_t down =\n (num[key] > self->block_size_) ?\n (num[key] - self->block_size_) : 0u;\n const uint32_t first4 = BrotliUnalignedRead32(data + cur_ix_masked);\n const size_t max_length_m4 = max_length - 4;\n i = num[key];\n for (; i > down;) {\n size_t prev_ix = bucket[--i & self->block_mask_];\n uint32_t current4;\n const size_t backward = cur_ix - prev_ix;\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n break;\n }\n prev_ix &= ring_buffer_mask;\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n /* compare 4 bytes ending at best_len + 1 */\n BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=\n BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {\n continue;\n }\n current4 = BrotliUnalignedRead32(data + prev_ix);\n if (first4 != current4) continue;\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix + 4],\n &data[cur_ix_masked + 4],\n max_length_m4) + 4;\n const score_t score = BackwardReferenceScore(len, backward);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;\n ++num[key];\n }\n if (min_score == out->score) {\n SearchInStaticDictionary(dictionary,\n self->common_, &data[cur_ix_masked], max_length, dictionary_distance,\n max_distance, out, BROTLI_FALSE);\n }\n}\n\n#undef HashLongestMatch\n" }, { "path": "libs/brotli/enc/hash_longest_match64_simd_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN */\n\n/* A (forgetful) hash table to the data seen by the compressor, to\n help create backward references to previous data.\n\n This is a hash map of fixed size (bucket_size_) to a ring buffer of\n fixed size (block_size_). The ring buffer contains the last block_size_\n index positions of the given hash key in the compressed data. */\n\n#define HashLongestMatch HASHER()\n\n#define TAG_HASH_BITS 8\n#define TAG_HASH_MASK ((1 << TAG_HASH_BITS) - 1)\n\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; }\n\n/* HashBytes is the function that chooses the bucket to place the address in. */\nstatic BROTLI_INLINE size_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data,\n uint64_t hash_mul) {\n const uint64_t h = BROTLI_UNALIGNED_LOAD64LE(data) * hash_mul;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return (size_t)(h >> (64 - 15 - TAG_HASH_BITS));\n}\n\ntypedef struct HashLongestMatch {\n /* Number of hash buckets. */\n size_t bucket_size_;\n /* Only block_size_ newest backward references are kept,\n and the older are forgotten. */\n size_t block_size_;\n /* Hash multiplier tuned to match length. */\n uint64_t hash_mul_;\n /* Mask for accessing entries in a block (in a ring-buffer manner). */\n uint32_t block_mask_;\n\n int block_bits_;\n int num_last_distances_to_check_;\n\n /* Shortcuts. */\n HasherCommon* common_;\n\n /* --- Dynamic size members --- */\n\n /* Number of entries in a particular bucket. */\n uint16_t* num_; /* uint16_t[bucket_size]; */\n\n uint8_t* tags_;\n\n /* Buckets containing block_size_ of backward references. */\n uint32_t* buckets_; /* uint32_t[bucket_size * block_size]; */\n} HashLongestMatch;\n\nstatic void FN(Initialize)(\n HasherCommon* common, HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n self->common_ = common;\n\n BROTLI_UNUSED(params);\n self->hash_mul_ = kHashMul64 << (64 - 5 * 8);\n BROTLI_DCHECK(common->params.bucket_bits == 15);\n self->bucket_size_ = (size_t)1 << common->params.bucket_bits;\n self->block_bits_ = common->params.block_bits;\n self->block_size_ = (size_t)1 << common->params.block_bits;\n self->block_mask_ = (uint32_t)(self->block_size_ - 1);\n self->num_last_distances_to_check_ =\n common->params.num_last_distances_to_check;\n self->num_ = (uint16_t*)common->extra[0];\n self->tags_ = (uint8_t*)common->extra[1];\n self->buckets_ = (uint32_t*)common->extra[2];\n}\n\nstatic void FN(Prepare)(\n HashLongestMatch* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n /* Partial preparation is 100 times slower (per socket). */\n size_t partial_prepare_threshold = self->bucket_size_ >> 6;\n if (one_shot && input_size <= partial_prepare_threshold) {\n size_t i;\n for (i = 0; i < input_size; ++i) {\n const size_t hash = FN(HashBytes)(&data[i], self->hash_mul_);\n const size_t key = hash >> TAG_HASH_BITS;\n num[key] = 65535;\n }\n } else {\n /* Set all the bytes of num to 255, which makes each uint16_t 65535. */\n memset(num, 255, self->bucket_size_ * sizeof(num[0]));\n }\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;\n size_t block_size = (size_t)1 << params->hasher.block_bits;\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n alloc_size[0] = sizeof(uint16_t) * bucket_size;\n alloc_size[1] = sizeof(uint8_t) * bucket_size * block_size;\n alloc_size[2] = sizeof(uint32_t) * bucket_size * block_size;\n}\n\n/* Look at 4 bytes at &data[ix & mask].\n Compute a hash from these, and store the value of ix at that position. */\nstatic BROTLI_INLINE void FN(Store)(\n HashLongestMatch* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,\n const size_t mask, const size_t ix) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint8_t* BROTLI_RESTRICT tags = self->tags_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n const size_t hash = FN(HashBytes)(&data[ix & mask], self->hash_mul_);\n const size_t key = hash >> TAG_HASH_BITS;\n const uint8_t tag = hash & TAG_HASH_MASK;\n const size_t minor_ix = num[key] & self->block_mask_;\n const size_t offset = minor_ix + (key << self->block_bits_);\n --num[key];\n buckets[offset] = (uint32_t)ix;\n tags[offset] = tag;\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n size_t i;\n for (i = ix_start; i < ix_end; ++i) {\n FN(Store)(self, data, mask, i);\n }\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashLongestMatch* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ringbuffer_mask) {\n if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {\n /* Prepare the hashes for three last bytes of the last write.\n These could not be calculated before, since they require knowledge\n of both the previous and the current block. */\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);\n }\n}\n\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashLongestMatch* BROTLI_RESTRICT self,\n int* BROTLI_RESTRICT distance_cache) {\n PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_);\n}\n\n/* Find a longest backward match of &data[cur_ix] up to the length of\n max_length and stores the position cur_ix in the hash table.\n\n REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache\n values; if this method is invoked repeatedly with the same distance\n cache values, it is enough to invoke FN(PrepareDistanceCache) once.\n\n Does not look for matches longer than max_length.\n Does not look for matches further away than max_backward.\n Writes the best match into |out|.\n |out|->score is updated only if a better match is found. */\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,\n const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,\n const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n uint8_t* BROTLI_RESTRICT tags = self->tags_;\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n /* Don't accept a short copy from far away. */\n score_t min_score = out->score;\n score_t best_score = out->score;\n size_t best_len = out->len;\n size_t i;\n /* Precalculate the hash key and prefetch the bucket. */\n const size_t hash = FN(HashBytes)(&data[cur_ix_masked], self->hash_mul_);\n const size_t key = hash >> TAG_HASH_BITS;\n uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_];\n uint8_t* BROTLI_RESTRICT tag_bucket = &tags[key << self->block_bits_];\n PREFETCH_L1(bucket);\n PREFETCH_L1(tag_bucket);\n if (self->block_bits_ > 4) PREFETCH_L1(bucket + 16);\n out->len = 0;\n out->len_code_delta = 0;\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n /* Try last distance first. */\n for (i = 0; i < (size_t)self->num_last_distances_to_check_; ++i) {\n const size_t backward = (size_t)distance_cache[i];\n size_t prev_ix = (size_t)(cur_ix - backward);\n if (prev_ix >= cur_ix) {\n continue;\n }\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n continue;\n }\n prev_ix &= ring_buffer_mask;\n\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 3 || (len == 2 && i < 2)) {\n /* Comparing for >= 2 does not change the semantics, but just saves for\n a few unnecessary binary logarithms in backward reference score,\n since we are not interested in such short matches. */\n score_t score = BackwardReferenceScoreUsingLastDistance(len);\n if (best_score < score) {\n if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n }\n /* we require matches of len >4, so increase best_len to 3, so we can compare\n * 4 bytes all the time. */\n if (best_len < 3) {\n best_len = 3;\n }\n {\n const uint8_t tag = hash & TAG_HASH_MASK;\n const uint32_t first4 = BrotliUnalignedRead32(data + cur_ix_masked);\n const size_t max_length_m4 = max_length - 4;\n const size_t head = (num[key] + 1) & self->block_mask_;\n uint64_t matches =\n GetMatchingTagMask(self->block_size_ / 16, tag, tag_bucket, head);\n /* Mask off any matches from uninitialized tags. */\n uint16_t n = 65535 - num[key];\n uint64_t block_has_unused_slots = self->block_size_ > n;\n uint64_t mask = (block_has_unused_slots << (n & (64 - 1))) - 1;\n matches &= mask;\n for (; matches > 0; matches &= (matches - 1)) {\n const size_t rb_index =\n (head + (size_t)BROTLI_TZCNT64(matches)) & self->block_mask_;\n size_t prev_ix = bucket[rb_index];\n uint32_t current4;\n const size_t backward = cur_ix - prev_ix;\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n break;\n }\n prev_ix &= ring_buffer_mask;\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n /* compare 4 bytes ending at best_len + 1 */\n BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=\n BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {\n continue;\n }\n current4 = BrotliUnalignedRead32(data + prev_ix);\n if (first4 != current4) continue;\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix + 4],\n &data[cur_ix_masked + 4],\n max_length_m4) + 4;\n const score_t score = BackwardReferenceScore(len, backward);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;\n tag_bucket[num[key] & self->block_mask_] = tag;\n --num[key];\n }\n if (min_score == out->score) {\n SearchInStaticDictionary(dictionary,\n self->common_, &data[cur_ix_masked], max_length, dictionary_distance,\n max_distance, out, BROTLI_FALSE);\n }\n}\n\n#undef HashLongestMatch\n" }, { "path": "libs/brotli/enc/hash_longest_match_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN */\n\n/* A (forgetful) hash table to the data seen by the compressor, to\n help create backward references to previous data.\n\n This is a hash map of fixed size (bucket_size_) to a ring buffer of\n fixed size (block_size_). The ring buffer contains the last block_size_\n index positions of the given hash key in the compressed data. */\n\n#define HashLongestMatch HASHER()\n\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }\n\n/* HashBytes is the function that chooses the bucket to place the address in. */\nstatic uint32_t FN(HashBytes)(\n const uint8_t* BROTLI_RESTRICT data, const int shift) {\n uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return (uint32_t)(h >> shift);\n}\n\ntypedef struct HashLongestMatch {\n /* Number of hash buckets. */\n size_t bucket_size_;\n /* Only block_size_ newest backward references are kept,\n and the older are forgotten. */\n size_t block_size_;\n /* Left-shift for computing hash bucket index from hash value. */\n int hash_shift_;\n /* Mask for accessing entries in a block (in a ring-buffer manner). */\n uint32_t block_mask_;\n\n int block_bits_;\n int num_last_distances_to_check_;\n\n /* Shortcuts. */\n HasherCommon* common_;\n\n /* --- Dynamic size members --- */\n\n /* Number of entries in a particular bucket. */\n uint16_t* num_; /* uint16_t[bucket_size]; */\n\n /* Buckets containing block_size_ of backward references. */\n uint32_t* buckets_; /* uint32_t[bucket_size * block_size]; */\n} HashLongestMatch;\n\nstatic void FN(Initialize)(\n HasherCommon* common, HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n self->common_ = common;\n\n BROTLI_UNUSED(params);\n self->hash_shift_ = 32 - common->params.bucket_bits;\n self->bucket_size_ = (size_t)1 << common->params.bucket_bits;\n self->block_size_ = (size_t)1 << common->params.block_bits;\n self->block_mask_ = (uint32_t)(self->block_size_ - 1);\n self->num_ = (uint16_t*)common->extra[0];\n self->buckets_ = (uint32_t*)common->extra[1];\n self->block_bits_ = common->params.block_bits;\n self->num_last_distances_to_check_ =\n common->params.num_last_distances_to_check;\n}\n\nstatic void FN(Prepare)(\n HashLongestMatch* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n /* Partial preparation is 100 times slower (per socket). */\n size_t partial_prepare_threshold = self->bucket_size_ >> 6;\n if (one_shot && input_size <= partial_prepare_threshold) {\n size_t i;\n for (i = 0; i < input_size; ++i) {\n const uint32_t key = FN(HashBytes)(&data[i], self->hash_shift_);\n num[key] = 0;\n }\n } else {\n memset(num, 0, self->bucket_size_ * sizeof(num[0]));\n }\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;\n size_t block_size = (size_t)1 << params->hasher.block_bits;\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n alloc_size[0] = sizeof(uint16_t) * bucket_size;\n alloc_size[1] = sizeof(uint32_t) * bucket_size * block_size;\n}\n\n/* Look at 4 bytes at &data[ix & mask].\n Compute a hash from these, and store the value of ix at that position. */\nstatic BROTLI_INLINE void FN(Store)(\n HashLongestMatch* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,\n const size_t mask, const size_t ix) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n const uint32_t key = FN(HashBytes)(&data[ix & mask], self->hash_shift_);\n const size_t minor_ix = num[key] & self->block_mask_;\n const size_t offset = minor_ix + (key << self->block_bits_);\n ++num[key];\n buckets[offset] = (uint32_t)ix;\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n size_t i;\n for (i = ix_start; i < ix_end; ++i) {\n FN(Store)(self, data, mask, i);\n }\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashLongestMatch* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ringbuffer_mask) {\n if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {\n /* Prepare the hashes for three last bytes of the last write.\n These could not be calculated before, since they require knowledge\n of both the previous and the current block. */\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);\n }\n}\n\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashLongestMatch* BROTLI_RESTRICT self,\n int* BROTLI_RESTRICT distance_cache) {\n PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_);\n}\n\n/* Find a longest backward match of &data[cur_ix] up to the length of\n max_length and stores the position cur_ix in the hash table.\n\n REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache\n values; if this method is invoked repeatedly with the same distance\n cache values, it is enough to invoke FN(PrepareDistanceCache) once.\n\n Does not look for matches longer than max_length.\n Does not look for matches further away than max_backward.\n Writes the best match into |out|.\n |out|->score is updated only if a better match is found. */\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,\n const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,\n const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n /* Don't accept a short copy from far away. */\n score_t min_score = out->score;\n score_t best_score = out->score;\n size_t best_len = out->len;\n size_t i;\n /* Precalculate the hash key and prefetch the bucket. */\n const uint32_t key =\n FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_);\n uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_];\n PREFETCH_L1(bucket);\n if (self->block_bits_ > 4) PREFETCH_L1(bucket + 16);\n out->len = 0;\n out->len_code_delta = 0;\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n /* Try last distance first. */\n for (i = 0; i < (size_t)self->num_last_distances_to_check_; ++i) {\n const size_t backward = (size_t)distance_cache[i];\n size_t prev_ix = (size_t)(cur_ix - backward);\n if (prev_ix >= cur_ix) {\n continue;\n }\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n continue;\n }\n prev_ix &= ring_buffer_mask;\n\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 3 || (len == 2 && i < 2)) {\n /* Comparing for >= 2 does not change the semantics, but just saves for\n a few unnecessary binary logarithms in backward reference score,\n since we are not interested in such short matches. */\n score_t score = BackwardReferenceScoreUsingLastDistance(len);\n if (best_score < score) {\n if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n }\n /* we require matches of len >4, so increase best_len to 3, so we can compare\n * 4 bytes all the time. */\n if (best_len < 3) {\n best_len = 3;\n }\n {\n const size_t down =\n (num[key] > self->block_size_) ? (num[key] - self->block_size_) : 0u;\n for (i = num[key]; i > down;) {\n size_t prev_ix = bucket[--i & self->block_mask_];\n const size_t backward = cur_ix - prev_ix;\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n break;\n }\n prev_ix &= ring_buffer_mask;\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n /* compare 4 bytes ending at best_len + 1 */\n BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=\n BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 4) {\n /* Comparing for >= 3 does not change the semantics, but just saves\n for a few unnecessary binary logarithms in backward reference\n score, since we are not interested in such short matches. */\n score_t score = BackwardReferenceScore(len, backward);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;\n ++num[key];\n }\n if (min_score == out->score) {\n SearchInStaticDictionary(dictionary,\n self->common_, &data[cur_ix_masked], max_length, dictionary_distance,\n max_distance, out, BROTLI_FALSE);\n }\n}\n\n#undef HashLongestMatch\n" }, { "path": "libs/brotli/enc/hash_longest_match_quickly_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN, BUCKET_BITS, BUCKET_SWEEP_BITS, HASH_LEN,\n USE_DICTIONARY\n */\n\n#define HashLongestMatchQuickly HASHER()\n\n#define BUCKET_SIZE (1 << BUCKET_BITS)\n#define BUCKET_MASK (BUCKET_SIZE - 1)\n#define BUCKET_SWEEP (1 << BUCKET_SWEEP_BITS)\n#define BUCKET_SWEEP_MASK ((BUCKET_SWEEP - 1) << 3)\n\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 8; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 8; }\n\n/* HashBytes is the function that chooses the bucket to place\n the address in. The HashLongestMatch and HashLongestMatchQuickly\n classes have separate, different implementations of hashing. */\nstatic uint32_t FN(HashBytes)(const uint8_t* data) {\n const uint64_t h = ((BROTLI_UNALIGNED_LOAD64LE(data) << (64 - 8 * HASH_LEN)) *\n kHashMul64);\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return (uint32_t)(h >> (64 - BUCKET_BITS));\n}\n\n/* A (forgetful) hash table to the data seen by the compressor, to\n help create backward references to previous data.\n\n This is a hash map of fixed size (BUCKET_SIZE). */\ntypedef struct HashLongestMatchQuickly {\n /* Shortcuts. */\n HasherCommon* common;\n\n /* --- Dynamic size members --- */\n\n uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */\n} HashLongestMatchQuickly;\n\nstatic void FN(Initialize)(\n HasherCommon* common, HashLongestMatchQuickly* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n self->common = common;\n\n BROTLI_UNUSED(params);\n self->buckets_ = (uint32_t*)common->extra[0];\n}\n\nstatic void FN(Prepare)(\n HashLongestMatchQuickly* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n /* Partial preparation is 100 times slower (per socket). */\n size_t partial_prepare_threshold = BUCKET_SIZE >> 5;\n if (one_shot && input_size <= partial_prepare_threshold) {\n size_t i;\n for (i = 0; i < input_size; ++i) {\n const uint32_t key = FN(HashBytes)(&data[i]);\n if (BUCKET_SWEEP == 1) {\n buckets[key] = 0;\n } else {\n uint32_t j;\n for (j = 0; j < BUCKET_SWEEP; ++j) {\n buckets[(key + (j << 3)) & BUCKET_MASK] = 0;\n }\n }\n }\n } else {\n /* It is not strictly necessary to fill this buffer here, but\n not filling will make the results of the compression stochastic\n (but correct). This is because random data would cause the\n system to find accidentally good backward references here and there. */\n memset(buckets, 0, sizeof(uint32_t) * BUCKET_SIZE);\n }\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n BROTLI_UNUSED(params);\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n alloc_size[0] = sizeof(uint32_t) * BUCKET_SIZE;\n}\n\n/* Look at 5 bytes at &data[ix & mask].\n Compute a hash from these, and store the value somewhere within\n [ix .. ix+3]. */\nstatic BROTLI_INLINE void FN(Store)(\n HashLongestMatchQuickly* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {\n const uint32_t key = FN(HashBytes)(&data[ix & mask]);\n if (BUCKET_SWEEP == 1) {\n self->buckets_[key] = (uint32_t)ix;\n } else {\n /* Wiggle the value with the bucket sweep range. */\n const uint32_t off = ix & BUCKET_SWEEP_MASK;\n self->buckets_[(key + off) & BUCKET_MASK] = (uint32_t)ix;\n }\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(\n HashLongestMatchQuickly* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n size_t i;\n for (i = ix_start; i < ix_end; ++i) {\n FN(Store)(self, data, mask, i);\n }\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashLongestMatchQuickly* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position,\n const uint8_t* ringbuffer, size_t ringbuffer_mask) {\n if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {\n /* Prepare the hashes for three last bytes of the last write.\n These could not be calculated before, since they require knowledge\n of both the previous and the current block. */\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);\n }\n}\n\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashLongestMatchQuickly* BROTLI_RESTRICT self,\n int* BROTLI_RESTRICT distance_cache) {\n BROTLI_UNUSED(self);\n BROTLI_UNUSED(distance_cache);\n}\n\n/* Find a longest backward match of &data[cur_ix & ring_buffer_mask]\n up to the length of max_length and stores the position cur_ix in the\n hash table.\n\n Does not look for matches longer than max_length.\n Does not look for matches further away than max_backward.\n Writes the best match into |out|.\n |out|->score is updated only if a better match is found. */\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashLongestMatchQuickly* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data,\n const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache,\n const size_t cur_ix, const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n const size_t best_len_in = out->len;\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n /* TODO: compare 4 bytes at once (and set the minimum best len to 4) */\n int compare_char = data[cur_ix_masked + best_len_in];\n size_t key = FN(HashBytes)(&data[cur_ix_masked]);\n size_t key_out;\n score_t min_score = out->score;\n score_t best_score = out->score;\n size_t best_len = best_len_in;\n size_t cached_backward = (size_t)distance_cache[0];\n size_t prev_ix = cur_ix - cached_backward;\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n out->len_code_delta = 0;\n if (prev_ix < cur_ix) {\n prev_ix &= (uint32_t)ring_buffer_mask;\n if (compare_char == data[prev_ix + best_len]) {\n const size_t len = FindMatchLengthWithLimit(\n &data[prev_ix], &data[cur_ix_masked], max_length);\n if (len >= 4) {\n const score_t score = BackwardReferenceScoreUsingLastDistance(len);\n if (best_score < score) {\n out->len = len;\n out->distance = cached_backward;\n out->score = score;\n if (BUCKET_SWEEP == 1) {\n buckets[key] = (uint32_t)cur_ix;\n return;\n } else {\n best_len = len;\n best_score = score;\n compare_char = data[cur_ix_masked + len];\n }\n }\n }\n }\n }\n if (BUCKET_SWEEP == 1) {\n size_t backward;\n size_t len;\n /* Only one to look for, don't bother to prepare for a loop. */\n prev_ix = buckets[key];\n buckets[key] = (uint32_t)cur_ix;\n backward = cur_ix - prev_ix;\n prev_ix &= (uint32_t)ring_buffer_mask;\n if (compare_char != data[prev_ix + best_len_in]) {\n return;\n }\n if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) {\n return;\n }\n len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 4) {\n const score_t score = BackwardReferenceScore(len, backward);\n if (best_score < score) {\n out->len = len;\n out->distance = backward;\n out->score = score;\n return;\n }\n }\n } else {\n size_t keys[BUCKET_SWEEP];\n size_t i;\n for (i = 0; i < BUCKET_SWEEP; ++i) {\n keys[i] = (key + (i << 3)) & BUCKET_MASK;\n }\n key_out = keys[(cur_ix & BUCKET_SWEEP_MASK) >> 3];\n for (i = 0; i < BUCKET_SWEEP; ++i) {\n size_t len;\n size_t backward;\n prev_ix = buckets[keys[i]];\n backward = cur_ix - prev_ix;\n prev_ix &= (uint32_t)ring_buffer_mask;\n if (compare_char != data[prev_ix + best_len]) {\n continue;\n }\n if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) {\n continue;\n }\n len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 4) {\n const score_t score = BackwardReferenceScore(len, backward);\n if (best_score < score) {\n best_len = len;\n out->len = len;\n compare_char = data[cur_ix_masked + len];\n best_score = score;\n out->score = score;\n out->distance = backward;\n }\n }\n }\n }\n if (USE_DICTIONARY && min_score == out->score) {\n SearchInStaticDictionary(dictionary,\n self->common, &data[cur_ix_masked], max_length, dictionary_distance,\n max_distance, out, BROTLI_TRUE);\n }\n if (BUCKET_SWEEP != 1) {\n buckets[key_out] = (uint32_t)cur_ix;\n }\n}\n\n#undef BUCKET_SWEEP_MASK\n#undef BUCKET_SWEEP\n#undef BUCKET_MASK\n#undef BUCKET_SIZE\n\n#undef HashLongestMatchQuickly\n" }, { "path": "libs/brotli/enc/hash_longest_match_simd_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2010 Google Inc. All Rights Reserved.\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n/* template parameters: FN */\n/* A (forgetful) hash table to the data seen by the compressor, to\n help create backward references to previous data.\n This is a hash map of fixed size (bucket_size_) to a ring buffer of\n fixed size (block_size_). The ring buffer contains the last block_size_\n index positions of the given hash key in the compressed data. */\n#define HashLongestMatch HASHER()\n#define TAG_HASH_BITS 8\n#define TAG_HASH_MASK ((1 << TAG_HASH_BITS) - 1)\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }\n/* HashBytes is the function that chooses the bucket to place the address in. */\nstatic uint32_t FN(HashBytes)(\n const uint8_t* BROTLI_RESTRICT data, const int shift) {\n uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return (uint32_t)(h >> shift);\n}\ntypedef struct HashLongestMatch {\n /* Number of hash buckets. */\n size_t bucket_size_;\n /* Only block_size_ newest backward references are kept,\n and the older are forgotten. */\n size_t block_size_;\n /* Left-shift for computing hash bucket index from hash value. */\n int hash_shift_;\n /* Mask for accessing entries in a block (in a ring-buffer manner). */\n uint32_t block_mask_;\n int block_bits_;\n int num_last_distances_to_check_;\n /* Shortcuts. */\n HasherCommon* common_;\n /* --- Dynamic size members --- */\n /* Number of entries in a particular bucket. */\n uint16_t* num_; /* uint16_t[bucket_size]; */\n uint8_t* tags_;\n /* Buckets containing block_size_ of backward references. */\n uint32_t* buckets_; /* uint32_t[bucket_size * block_size]; */\n} HashLongestMatch;\nstatic void FN(Initialize)(\n HasherCommon* common, HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n self->common_ = common;\n BROTLI_UNUSED(params);\n self->hash_shift_ = 32 - common->params.bucket_bits - TAG_HASH_BITS;\n self->bucket_size_ = (size_t)1 << common->params.bucket_bits;\n self->block_size_ = (size_t)1 << common->params.block_bits;\n self->block_mask_ = (uint32_t)(self->block_size_ - 1);\n self->num_ = (uint16_t*)common->extra[0];\n self->tags_ = (uint8_t*)common->extra[1];\n self->buckets_ = (uint32_t*)common->extra[2];\n self->block_bits_ = common->params.block_bits;\n self->num_last_distances_to_check_ =\n common->params.num_last_distances_to_check;\n}\nstatic void FN(Prepare)(\n HashLongestMatch* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n /* Partial preparation is 100 times slower (per socket). */\n size_t partial_prepare_threshold = self->bucket_size_ >> 6;\n if (one_shot && input_size <= partial_prepare_threshold) {\n size_t i;\n for (i = 0; i < input_size; ++i) {\n const uint32_t hash = FN(HashBytes)(&data[i], self->hash_shift_);\n const uint32_t key = hash >> TAG_HASH_BITS;\n num[key] = 65535;\n }\n } else {\n /* Set all the bytes of num to 255, which makes each uint16_t 65535. */\n memset(num, 255, self->bucket_size_ * sizeof(num[0]));\n }\n}\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;\n size_t block_size = (size_t)1 << params->hasher.block_bits;\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n alloc_size[0] = sizeof(uint16_t) * bucket_size;\n alloc_size[1] = sizeof(uint8_t) * bucket_size * block_size;\n alloc_size[2] = sizeof(uint32_t) * bucket_size * block_size;\n}\n/* Look at 4 bytes at &data[ix & mask].\n Compute a hash from these, and store the value of ix at that position. */\nstatic BROTLI_INLINE void FN(Store)(\n HashLongestMatch* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,\n const size_t mask, const size_t ix) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint8_t* BROTLI_RESTRICT tags = self->tags_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n const size_t hash = FN(HashBytes)(&data[ix & mask], self->hash_shift_);\n const size_t key = hash >> TAG_HASH_BITS;\n const uint8_t tag = hash & TAG_HASH_MASK;\n const size_t minor_ix = num[key] & self->block_mask_;\n const size_t offset = minor_ix + (key << self->block_bits_);\n --num[key];\n buckets[offset] = (uint32_t)ix;\n tags[offset] = tag;\n}\nstatic BROTLI_INLINE void FN(StoreRange)(HashLongestMatch* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n size_t i;\n for (i = ix_start; i < ix_end; ++i) {\n FN(Store)(self, data, mask, i);\n }\n}\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashLongestMatch* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ringbuffer_mask) {\n if (num_bytes >= FN(HashTypeLength)() - 1 && position >= 3) {\n /* Prepare the hashes for three last bytes of the last write.\n These could not be calculated before, since they require knowledge\n of both the previous and the current block. */\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);\n FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);\n }\n}\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashLongestMatch* BROTLI_RESTRICT self,\n int* BROTLI_RESTRICT distance_cache) {\n PrepareDistanceCache(distance_cache, self->num_last_distances_to_check_);\n}\n\n/* Find a longest backward match of &data[cur_ix] up to the length of\n max_length and stores the position cur_ix in the hash table.\n REQUIRES: FN(PrepareDistanceCache) must be invoked for current distance cache\n values; if this method is invoked repeatedly with the same distance\n cache values, it is enough to invoke FN(PrepareDistanceCache) once.\n Does not look for matches longer than max_length.\n Does not look for matches further away than max_backward.\n Writes the best match into |out|.\n |out|->score is updated only if a better match is found. */\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashLongestMatch* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,\n const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,\n const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n uint16_t* BROTLI_RESTRICT num = self->num_;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n uint8_t* BROTLI_RESTRICT tags = self->tags_;\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n /* Don't accept a short copy from far away. */\n score_t min_score = out->score;\n score_t best_score = out->score;\n size_t best_len = out->len;\n size_t i;\n /* Precalculate the hash key and prefetch the bucket. */\n const uint32_t hash =\n FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_);\n const uint32_t key = hash >> TAG_HASH_BITS;\n uint32_t* BROTLI_RESTRICT bucket = &buckets[key << self->block_bits_];\n uint8_t* BROTLI_RESTRICT tag_bucket = &tags[key << self->block_bits_];\n PREFETCH_L1(bucket);\n PREFETCH_L1(tag_bucket);\n if (self->block_bits_ > 4) PREFETCH_L1(bucket + 16);\n out->len = 0;\n out->len_code_delta = 0;\n\n BROTLI_DCHECK(cur_ix_masked + max_length <= ring_buffer_mask);\n\n /* Try last distance first. */\n for (i = 0; i < (size_t)self->num_last_distances_to_check_; ++i) {\n const size_t backward = (size_t)distance_cache[i];\n size_t prev_ix = (size_t)(cur_ix - backward);\n if (prev_ix >= cur_ix) {\n continue;\n }\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n continue;\n }\n prev_ix &= ring_buffer_mask;\n\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n data[cur_ix_masked + best_len] != data[prev_ix + best_len]) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 3 || (len == 2 && i < 2)) {\n /* Comparing for >= 2 does not change the semantics, but just saves for\n a few unnecessary binary logarithms in backward reference score,\n since we are not interested in such short matches. */\n score_t score = BackwardReferenceScoreUsingLastDistance(len);\n if (best_score < score) {\n if (i != 0) score -= BackwardReferencePenaltyUsingLastDistance(i);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n }\n /* we require matches of len >4, so increase best_len to 3, so we can compare\n * 4 bytes all the time. */\n if (best_len < 3) {\n best_len = 3;\n }\n {\n const uint8_t tag = hash & TAG_HASH_MASK;\n const size_t head = (num[key] + 1) & self->block_mask_;\n uint64_t matches =\n GetMatchingTagMask(self->block_size_ / 16, tag, tag_bucket, head);\n /* Mask off any matches from uninitialized tags. */\n uint16_t n = 65535 - num[key];\n uint64_t block_has_unused_slots = self->block_size_ > n;\n uint64_t mask = (block_has_unused_slots << (n & (64 - 1))) - 1;\n matches &= mask;\n for (; matches > 0; matches &= (matches - 1)) {\n const size_t rb_index =\n (head + (size_t)BROTLI_TZCNT64(matches)) & self->block_mask_;\n size_t prev_ix = bucket[rb_index];\n const size_t backward = cur_ix - prev_ix;\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n break;\n }\n prev_ix &= ring_buffer_mask;\n if (cur_ix_masked + best_len > ring_buffer_mask) {\n break;\n }\n if (prev_ix + best_len > ring_buffer_mask ||\n /* compare 4 bytes ending at best_len + 1 */\n BrotliUnalignedRead32(&data[cur_ix_masked + best_len - 3]) !=\n BrotliUnalignedRead32(&data[prev_ix + best_len - 3])) {\n continue;\n }\n {\n const size_t len = FindMatchLengthWithLimit(&data[prev_ix],\n &data[cur_ix_masked],\n max_length);\n if (len >= 4) {\n /* Comparing for >= 3 does not change the semantics, but just saves\n for a few unnecessary binary logarithms in backward reference\n score, since we are not interested in such short matches. */\n score_t score = BackwardReferenceScore(len, backward);\n if (best_score < score) {\n best_score = score;\n best_len = len;\n out->len = best_len;\n out->distance = backward;\n out->score = best_score;\n }\n }\n }\n }\n bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;\n tag_bucket[num[key] & self->block_mask_] = tag;\n --num[key];\n }\n if (min_score == out->score) {\n SearchInStaticDictionary(dictionary,\n self->common_, &data[cur_ix_masked], max_length, dictionary_distance,\n max_distance, out, BROTLI_FALSE);\n }\n}\n#undef HashLongestMatch\n" }, { "path": "libs/brotli/enc/hash_rolling_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2018 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN, JUMP, NUMBUCKETS, MASK, CHUNKLEN */\n/* NUMBUCKETS / (MASK + 1) = probability of storing and using hash code. */\n/* JUMP = skip bytes for speedup */\n\n/* Rolling hash for long distance long string matches. Stores one position\n per bucket, bucket key is computed over a long region. */\n\n#define HashRolling HASHER()\n\nstatic const uint32_t FN(kRollingHashMul32) = 69069;\nstatic const uint32_t FN(kInvalidPos) = 0xffffffff;\n\n/* This hasher uses a longer forward length, but returning a higher value here\n will hurt compression by the main hasher when combined with a composite\n hasher. The hasher tests for forward itself instead. */\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) { return 4; }\n\n/* Computes a code from a single byte. A lookup table of 256 values could be\n used, but simply adding 1 works about as good. */\nstatic uint32_t FN(HashByte)(uint8_t byte) {\n return (uint32_t)byte + 1u;\n}\n\nstatic uint32_t FN(HashRollingFunctionInitial)(uint32_t state, uint8_t add,\n uint32_t factor) {\n return (uint32_t)(factor * state + FN(HashByte)(add));\n}\n\nstatic uint32_t FN(HashRollingFunction)(uint32_t state, uint8_t add,\n uint8_t rem, uint32_t factor,\n uint32_t factor_remove) {\n return (uint32_t)(factor * state +\n FN(HashByte)(add) - factor_remove * FN(HashByte)(rem));\n}\n\ntypedef struct HashRolling {\n uint32_t state;\n uint32_t* table;\n size_t next_ix;\n\n uint32_t chunk_len;\n uint32_t factor;\n uint32_t factor_remove;\n} HashRolling;\n\nstatic void FN(Initialize)(\n HasherCommon* common, HashRolling* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n size_t i;\n self->state = 0;\n self->next_ix = 0;\n\n self->factor = FN(kRollingHashMul32);\n\n /* Compute the factor of the oldest byte to remove: factor**steps modulo\n 0xffffffff (the multiplications rely on 32-bit overflow) */\n self->factor_remove = 1;\n for (i = 0; i < CHUNKLEN; i += JUMP) {\n self->factor_remove *= self->factor;\n }\n\n self->table = (uint32_t*)common->extra[0];\n for (i = 0; i < NUMBUCKETS; i++) {\n self->table[i] = FN(kInvalidPos);\n }\n\n BROTLI_UNUSED(params);\n}\n\nstatic void FN(Prepare)(HashRolling* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n size_t i;\n /* Too small size, cannot use this hasher. */\n if (input_size < CHUNKLEN) return;\n self->state = 0;\n for (i = 0; i < CHUNKLEN; i += JUMP) {\n self->state = FN(HashRollingFunctionInitial)(\n self->state, data[i], self->factor);\n }\n BROTLI_UNUSED(one_shot);\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n BROTLI_UNUSED(params);\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n alloc_size[0] = NUMBUCKETS * sizeof(uint32_t);\n}\n\nstatic BROTLI_INLINE void FN(Store)(HashRolling* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask, const size_t ix) {\n BROTLI_UNUSED(self);\n BROTLI_UNUSED(data);\n BROTLI_UNUSED(mask);\n BROTLI_UNUSED(ix);\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(HashRolling* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n BROTLI_UNUSED(self);\n BROTLI_UNUSED(data);\n BROTLI_UNUSED(mask);\n BROTLI_UNUSED(ix_start);\n BROTLI_UNUSED(ix_end);\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashRolling* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ring_buffer_mask) {\n /* In this case we must re-initialize the hasher from scratch from the\n current position. */\n size_t position_masked;\n size_t available = num_bytes;\n if ((position & (JUMP - 1)) != 0) {\n size_t diff = JUMP - (position & (JUMP - 1));\n available = (diff > available) ? 0 : (available - diff);\n position += diff;\n }\n position_masked = position & ring_buffer_mask;\n /* wrapping around ringbuffer not handled. */\n if (available > ring_buffer_mask - position_masked) {\n available = ring_buffer_mask - position_masked;\n }\n\n FN(Prepare)(self, BROTLI_FALSE, available,\n ringbuffer + (position & ring_buffer_mask));\n self->next_ix = position;\n BROTLI_UNUSED(num_bytes);\n}\n\nstatic BROTLI_INLINE void FN(PrepareDistanceCache)(\n HashRolling* BROTLI_RESTRICT self,\n int* BROTLI_RESTRICT distance_cache) {\n BROTLI_UNUSED(self);\n BROTLI_UNUSED(distance_cache);\n}\n\nstatic BROTLI_INLINE void FN(FindLongestMatch)(\n HashRolling* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask,\n const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,\n const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const size_t max_distance,\n HasherSearchResult* BROTLI_RESTRICT out) {\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n size_t pos;\n\n if ((cur_ix & (JUMP - 1)) != 0) return;\n\n /* Not enough lookahead */\n if (max_length < CHUNKLEN) return;\n\n for (pos = self->next_ix; pos <= cur_ix; pos += JUMP) {\n uint32_t code = self->state & MASK;\n\n uint8_t rem = data[pos & ring_buffer_mask];\n uint8_t add = data[(pos + CHUNKLEN) & ring_buffer_mask];\n size_t found_ix = FN(kInvalidPos);\n\n self->state = FN(HashRollingFunction)(\n self->state, add, rem, self->factor, self->factor_remove);\n\n if (code < NUMBUCKETS) {\n found_ix = self->table[code];\n self->table[code] = (uint32_t)pos;\n if (pos == cur_ix && found_ix != FN(kInvalidPos)) {\n /* The cast to 32-bit makes backward distances up to 4GB work even\n if cur_ix is above 4GB, despite using 32-bit values in the table. */\n size_t backward = (uint32_t)(cur_ix - found_ix);\n if (backward <= max_backward) {\n const size_t found_ix_masked = found_ix & ring_buffer_mask;\n const size_t len = FindMatchLengthWithLimit(&data[found_ix_masked],\n &data[cur_ix_masked],\n max_length);\n if (len >= 4 && len > out->len) {\n score_t score = BackwardReferenceScore(len, backward);\n if (score > out->score) {\n out->len = len;\n out->distance = backward;\n out->score = score;\n out->len_code_delta = 0;\n }\n }\n }\n }\n }\n }\n\n self->next_ix = cur_ix + JUMP;\n\n /* NOTE: this hasher does not search in the dictionary. It is used as\n backup-hasher, the main hasher already searches in it. */\n BROTLI_UNUSED(dictionary);\n BROTLI_UNUSED(distance_cache);\n BROTLI_UNUSED(dictionary_distance);\n BROTLI_UNUSED(max_distance);\n}\n\n#undef HashRolling\n" }, { "path": "libs/brotli/enc/hash_to_binary_tree_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN, BUCKET_BITS, MAX_TREE_COMP_LENGTH,\n MAX_TREE_SEARCH_DEPTH */\n\n/* A (forgetful) hash table where each hash bucket contains a binary tree of\n sequences whose first 4 bytes share the same hash code.\n Each sequence is MAX_TREE_COMP_LENGTH long and is identified by its starting\n position in the input data. The binary tree is sorted by the lexicographic\n order of the sequences, and it is also a max-heap with respect to the\n starting positions. */\n\n#define HashToBinaryTree HASHER()\n\n#define BUCKET_SIZE (1 << BUCKET_BITS)\n\nstatic BROTLI_INLINE size_t FN(HashTypeLength)(void) { return 4; }\nstatic BROTLI_INLINE size_t FN(StoreLookahead)(void) {\n return MAX_TREE_COMP_LENGTH;\n}\n\nstatic uint32_t FN(HashBytes)(const uint8_t* BROTLI_RESTRICT data) {\n uint32_t h = BROTLI_UNALIGNED_LOAD32LE(data) * kHashMul32;\n /* The higher bits contain more mixture from the multiplication,\n so we take our results from there. */\n return h >> (32 - BUCKET_BITS);\n}\n\ntypedef struct HashToBinaryTree {\n /* The window size minus 1 */\n size_t window_mask_;\n\n /* Hash table that maps the 4-byte hashes of the sequence to the last\n position where this hash was found, which is the root of the binary\n tree of sequences that share this hash bucket. */\n uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */\n\n /* A position used to mark a non-existent sequence, i.e. a tree is empty if\n its root is at invalid_pos_ and a node is a leaf if both its children\n are at invalid_pos_. */\n uint32_t invalid_pos_;\n\n /* --- Dynamic size members --- */\n\n /* The union of the binary trees of each hash bucket. The root of the tree\n corresponding to a hash is a sequence starting at buckets_[hash] and\n the left and right children of a sequence starting at pos are\n forest_[2 * pos] and forest_[2 * pos + 1]. */\n uint32_t* forest_; /* uint32_t[2 * num_nodes] */\n} HashToBinaryTree;\n\nstatic void FN(Initialize)(\n HasherCommon* common, HashToBinaryTree* BROTLI_RESTRICT self,\n const BrotliEncoderParams* params) {\n self->buckets_ = (uint32_t*)common->extra[0];\n self->forest_ = (uint32_t*)common->extra[1];\n\n self->window_mask_ = (1u << params->lgwin) - 1u;\n self->invalid_pos_ = (uint32_t)(0 - self->window_mask_);\n}\n\nstatic void FN(Prepare)\n (HashToBinaryTree* BROTLI_RESTRICT self, BROTLI_BOOL one_shot,\n size_t input_size, const uint8_t* BROTLI_RESTRICT data) {\n uint32_t invalid_pos = self->invalid_pos_;\n uint32_t i;\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n BROTLI_UNUSED(data);\n BROTLI_UNUSED(one_shot);\n BROTLI_UNUSED(input_size);\n for (i = 0; i < BUCKET_SIZE; i++) {\n buckets[i] = invalid_pos;\n }\n}\n\nstatic BROTLI_INLINE void FN(HashMemAllocInBytes)(\n const BrotliEncoderParams* params, BROTLI_BOOL one_shot,\n size_t input_size, size_t* alloc_size) {\n size_t num_nodes = (size_t)1 << params->lgwin;\n if (one_shot && input_size < num_nodes) {\n num_nodes = input_size;\n }\n alloc_size[0] = sizeof(uint32_t) * BUCKET_SIZE;\n alloc_size[1] = 2 * sizeof(uint32_t) * num_nodes;\n}\n\nstatic BROTLI_INLINE size_t FN(LeftChildIndex)(\n HashToBinaryTree* BROTLI_RESTRICT self,\n const size_t pos) {\n return 2 * (pos & self->window_mask_);\n}\n\nstatic BROTLI_INLINE size_t FN(RightChildIndex)(\n HashToBinaryTree* BROTLI_RESTRICT self,\n const size_t pos) {\n return 2 * (pos & self->window_mask_) + 1;\n}\n\n/* Stores the hash of the next 4 bytes and in a single tree-traversal, the\n hash bucket's binary tree is searched for matches and is re-rooted at the\n current position.\n\n If less than MAX_TREE_COMP_LENGTH data is available, the hash bucket of the\n current position is searched for matches, but the state of the hash table\n is not changed, since we can not know the final sorting order of the\n current (incomplete) sequence.\n\n This function must be called with increasing cur_ix positions. */\nstatic BROTLI_INLINE BackwardMatch* FN(StoreAndFindMatches)(\n HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data,\n const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length,\n const size_t max_backward, size_t* const BROTLI_RESTRICT best_len,\n BackwardMatch* BROTLI_RESTRICT matches) {\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n const size_t max_comp_len =\n BROTLI_MIN(size_t, max_length, MAX_TREE_COMP_LENGTH);\n const BROTLI_BOOL should_reroot_tree =\n TO_BROTLI_BOOL(max_length >= MAX_TREE_COMP_LENGTH);\n const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]);\n uint32_t* BROTLI_RESTRICT buckets = self->buckets_;\n uint32_t* BROTLI_RESTRICT forest = self->forest_;\n size_t prev_ix = buckets[key];\n /* The forest index of the rightmost node of the left subtree of the new\n root, updated as we traverse and re-root the tree of the hash bucket. */\n size_t node_left = FN(LeftChildIndex)(self, cur_ix);\n /* The forest index of the leftmost node of the right subtree of the new\n root, updated as we traverse and re-root the tree of the hash bucket. */\n size_t node_right = FN(RightChildIndex)(self, cur_ix);\n /* The match length of the rightmost node of the left subtree of the new\n root, updated as we traverse and re-root the tree of the hash bucket. */\n size_t best_len_left = 0;\n /* The match length of the leftmost node of the right subtree of the new\n root, updated as we traverse and re-root the tree of the hash bucket. */\n size_t best_len_right = 0;\n size_t depth_remaining;\n if (should_reroot_tree) {\n buckets[key] = (uint32_t)cur_ix;\n }\n for (depth_remaining = MAX_TREE_SEARCH_DEPTH; ; --depth_remaining) {\n const size_t backward = cur_ix - prev_ix;\n const size_t prev_ix_masked = prev_ix & ring_buffer_mask;\n if (backward == 0 || backward > max_backward || depth_remaining == 0) {\n if (should_reroot_tree) {\n forest[node_left] = self->invalid_pos_;\n forest[node_right] = self->invalid_pos_;\n }\n break;\n }\n {\n const size_t cur_len = BROTLI_MIN(size_t, best_len_left, best_len_right);\n size_t len;\n BROTLI_DCHECK(cur_len <= MAX_TREE_COMP_LENGTH);\n len = cur_len +\n FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len],\n &data[prev_ix_masked + cur_len],\n max_length - cur_len);\n BROTLI_DCHECK(\n 0 == memcmp(&data[cur_ix_masked], &data[prev_ix_masked], len));\n if (matches && len > *best_len) {\n *best_len = len;\n InitBackwardMatch(matches++, backward, len);\n }\n if (len >= max_comp_len) {\n if (should_reroot_tree) {\n forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)];\n forest[node_right] = forest[FN(RightChildIndex)(self, prev_ix)];\n }\n break;\n }\n if (data[cur_ix_masked + len] > data[prev_ix_masked + len]) {\n best_len_left = len;\n if (should_reroot_tree) {\n forest[node_left] = (uint32_t)prev_ix;\n }\n node_left = FN(RightChildIndex)(self, prev_ix);\n prev_ix = forest[node_left];\n } else {\n best_len_right = len;\n if (should_reroot_tree) {\n forest[node_right] = (uint32_t)prev_ix;\n }\n node_right = FN(LeftChildIndex)(self, prev_ix);\n prev_ix = forest[node_right];\n }\n }\n }\n return matches;\n}\n\n/* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the\n length of max_length and stores the position cur_ix in the hash table.\n\n Sets *num_matches to the number of matches found, and stores the found\n matches in matches[0] to matches[*num_matches - 1]. The matches will be\n sorted by strictly increasing length and (non-strictly) increasing\n distance. */\nstatic BROTLI_INLINE size_t FN(FindAllMatches)(\n HashToBinaryTree* BROTLI_RESTRICT self,\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* BROTLI_RESTRICT data,\n const size_t ring_buffer_mask, const size_t cur_ix,\n const size_t max_length, const size_t max_backward,\n const size_t dictionary_distance, const BrotliEncoderParams* params,\n BackwardMatch* matches) {\n BackwardMatch* const orig_matches = matches;\n const size_t cur_ix_masked = cur_ix & ring_buffer_mask;\n size_t best_len = 1;\n const size_t short_match_max_backward =\n params->quality != HQ_ZOPFLIFICATION_QUALITY ? 16 : 64;\n size_t stop = cur_ix - short_match_max_backward;\n uint32_t dict_matches[BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1];\n size_t i;\n if (cur_ix < short_match_max_backward) { stop = 0; }\n for (i = cur_ix - 1; i > stop && best_len <= 2; --i) {\n size_t prev_ix = i;\n const size_t backward = cur_ix - prev_ix;\n if (BROTLI_PREDICT_FALSE(backward > max_backward)) {\n break;\n }\n prev_ix &= ring_buffer_mask;\n if (data[cur_ix_masked] != data[prev_ix] ||\n data[cur_ix_masked + 1] != data[prev_ix + 1]) {\n continue;\n }\n {\n const size_t len =\n FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked],\n max_length);\n if (len > best_len) {\n best_len = len;\n InitBackwardMatch(matches++, backward, len);\n }\n }\n }\n if (best_len < max_length) {\n matches = FN(StoreAndFindMatches)(self, data, cur_ix,\n ring_buffer_mask, max_length, max_backward, &best_len, matches);\n }\n for (i = 0; i <= BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN; ++i) {\n dict_matches[i] = kInvalidMatch;\n }\n {\n size_t minlen = BROTLI_MAX(size_t, 4, best_len + 1);\n if (BrotliFindAllStaticDictionaryMatches(dictionary,\n &data[cur_ix_masked], minlen, max_length, &dict_matches[0])) {\n size_t maxlen = BROTLI_MIN(\n size_t, BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN, max_length);\n size_t l;\n for (l = minlen; l <= maxlen; ++l) {\n uint32_t dict_id = dict_matches[l];\n if (dict_id < kInvalidMatch) {\n size_t distance = dictionary_distance + (dict_id >> 5) + 1;\n if (distance <= params->dist.max_distance) {\n InitDictionaryBackwardMatch(matches++, distance, l, dict_id & 31);\n }\n }\n }\n }\n }\n return (size_t)(matches - orig_matches);\n}\n\n/* Stores the hash of the next 4 bytes and re-roots the binary tree at the\n current sequence, without returning any matches.\n REQUIRES: ix + MAX_TREE_COMP_LENGTH <= end-of-current-block */\nstatic BROTLI_INLINE void FN(Store)(HashToBinaryTree* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data,\n const size_t mask, const size_t ix) {\n /* Maximum distance is window size - 16, see section 9.1. of the spec. */\n const size_t max_backward = self->window_mask_ - BROTLI_WINDOW_GAP + 1;\n FN(StoreAndFindMatches)(self, data, ix, mask, MAX_TREE_COMP_LENGTH,\n max_backward, NULL, NULL);\n}\n\nstatic BROTLI_INLINE void FN(StoreRange)(HashToBinaryTree* BROTLI_RESTRICT self,\n const uint8_t* BROTLI_RESTRICT data, const size_t mask,\n const size_t ix_start, const size_t ix_end) {\n size_t i = ix_start;\n size_t j = ix_start;\n if (ix_start + 63 <= ix_end) {\n i = ix_end - 63;\n }\n if (ix_start + 512 <= i) {\n for (; j < i; j += 8) {\n FN(Store)(self, data, mask, j);\n }\n }\n for (; i < ix_end; ++i) {\n FN(Store)(self, data, mask, i);\n }\n}\n\nstatic BROTLI_INLINE void FN(StitchToPreviousBlock)(\n HashToBinaryTree* BROTLI_RESTRICT self,\n size_t num_bytes, size_t position, const uint8_t* ringbuffer,\n size_t ringbuffer_mask) {\n if (num_bytes >= FN(HashTypeLength)() - 1 &&\n position >= MAX_TREE_COMP_LENGTH) {\n /* Store the last `MAX_TREE_COMP_LENGTH - 1` positions in the hasher.\n These could not be calculated before, since they require knowledge\n of both the previous and the current block. */\n const size_t i_start = position - MAX_TREE_COMP_LENGTH + 1;\n const size_t i_end = BROTLI_MIN(size_t, position, i_start + num_bytes);\n size_t i;\n for (i = i_start; i < i_end; ++i) {\n /* Maximum distance is window size - 16, see section 9.1. of the spec.\n Furthermore, we have to make sure that we don't look further back\n from the start of the next block than the window size, otherwise we\n could access already overwritten areas of the ring-buffer. */\n const size_t max_backward =\n self->window_mask_ - BROTLI_MAX(size_t,\n BROTLI_WINDOW_GAP - 1,\n position - i);\n /* We know that i + MAX_TREE_COMP_LENGTH <= position + num_bytes, i.e. the\n end of the current block and that we have at least\n MAX_TREE_COMP_LENGTH tail in the ring-buffer. */\n FN(StoreAndFindMatches)(self, ringbuffer, i, ringbuffer_mask,\n MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL);\n }\n }\n}\n\n#undef BUCKET_SIZE\n\n#undef HashToBinaryTree\n" }, { "path": "libs/brotli/enc/histogram.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Build per-context histograms of literals, commands and distance codes. */\n\n#include \"histogram.h\"\n\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"block_splitter.h\"\n#include \"command.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ntypedef struct BlockSplitIterator {\n const BlockSplit* split_; /* Not owned. */\n size_t idx_;\n size_t type_;\n size_t length_;\n} BlockSplitIterator;\n\nstatic void InitBlockSplitIterator(BlockSplitIterator* self,\n const BlockSplit* split) {\n self->split_ = split;\n self->idx_ = 0;\n self->type_ = 0;\n self->length_ = split->lengths ? split->lengths[0] : 0;\n}\n\nstatic void BlockSplitIteratorNext(BlockSplitIterator* self) {\n if (self->length_ == 0) {\n ++self->idx_;\n self->type_ = self->split_->types[self->idx_];\n self->length_ = self->split_->lengths[self->idx_];\n }\n --self->length_;\n}\n\nvoid BrotliBuildHistogramsWithContext(\n const Command* cmds, const size_t num_commands,\n const BlockSplit* literal_split, const BlockSplit* insert_and_copy_split,\n const BlockSplit* dist_split, const uint8_t* ringbuffer, size_t start_pos,\n size_t mask, uint8_t prev_byte, uint8_t prev_byte2,\n const ContextType* context_modes, HistogramLiteral* literal_histograms,\n HistogramCommand* insert_and_copy_histograms,\n HistogramDistance* copy_dist_histograms) {\n size_t pos = start_pos;\n BlockSplitIterator literal_it;\n BlockSplitIterator insert_and_copy_it;\n BlockSplitIterator dist_it;\n size_t i;\n\n InitBlockSplitIterator(&literal_it, literal_split);\n InitBlockSplitIterator(&insert_and_copy_it, insert_and_copy_split);\n InitBlockSplitIterator(&dist_it, dist_split);\n for (i = 0; i < num_commands; ++i) {\n const Command* cmd = &cmds[i];\n size_t j;\n BlockSplitIteratorNext(&insert_and_copy_it);\n HistogramAddCommand(&insert_and_copy_histograms[insert_and_copy_it.type_],\n cmd->cmd_prefix_);\n /* TODO(eustas): unwrap iterator blocks. */\n for (j = cmd->insert_len_; j != 0; --j) {\n size_t context;\n BlockSplitIteratorNext(&literal_it);\n context = literal_it.type_;\n if (context_modes) {\n ContextLut lut = BROTLI_CONTEXT_LUT(context_modes[context]);\n context = (context << BROTLI_LITERAL_CONTEXT_BITS) +\n BROTLI_CONTEXT(prev_byte, prev_byte2, lut);\n }\n HistogramAddLiteral(&literal_histograms[context],\n ringbuffer[pos & mask]);\n prev_byte2 = prev_byte;\n prev_byte = ringbuffer[pos & mask];\n ++pos;\n }\n pos += CommandCopyLen(cmd);\n if (CommandCopyLen(cmd)) {\n prev_byte2 = ringbuffer[(pos - 2) & mask];\n prev_byte = ringbuffer[(pos - 1) & mask];\n if (cmd->cmd_prefix_ >= 128) {\n size_t context;\n BlockSplitIteratorNext(&dist_it);\n context = (dist_it.type_ << BROTLI_DISTANCE_CONTEXT_BITS) +\n CommandDistanceContext(cmd);\n HistogramAddDistance(©_dist_histograms[context],\n cmd->dist_prefix_ & 0x3FF);\n }\n }\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/histogram.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Models the histograms of literals, commands and distance codes. */\n\n#ifndef BROTLI_ENC_HISTOGRAM_H_\n#define BROTLI_ENC_HISTOGRAM_H_\n\n#include \"../common/constants.h\"\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"block_splitter.h\"\n#include \"command.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* The distance symbols effectively used by \"Large Window Brotli\" (32-bit). */\n#define BROTLI_NUM_HISTOGRAM_DISTANCE_SYMBOLS 544\n\n#define FN(X) X ## Literal\n#define DATA_SIZE BROTLI_NUM_LITERAL_SYMBOLS\n#define DataType uint8_t\n#include \"histogram_inc.h\" /* NOLINT(build/include) */\n#undef DataType\n#undef DATA_SIZE\n#undef FN\n\n#define FN(X) X ## Command\n#define DataType uint16_t\n#define DATA_SIZE BROTLI_NUM_COMMAND_SYMBOLS\n#include \"histogram_inc.h\" /* NOLINT(build/include) */\n#undef DATA_SIZE\n#undef FN\n\n#define FN(X) X ## Distance\n#define DATA_SIZE BROTLI_NUM_HISTOGRAM_DISTANCE_SYMBOLS\n#include \"histogram_inc.h\" /* NOLINT(build/include) */\n#undef DataType\n#undef DATA_SIZE\n#undef FN\n\nBROTLI_INTERNAL void BrotliBuildHistogramsWithContext(\n const Command* cmds, const size_t num_commands,\n const BlockSplit* literal_split, const BlockSplit* insert_and_copy_split,\n const BlockSplit* dist_split, const uint8_t* ringbuffer, size_t pos,\n size_t mask, uint8_t prev_byte, uint8_t prev_byte2,\n const ContextType* context_modes, HistogramLiteral* literal_histograms,\n HistogramCommand* insert_and_copy_histograms,\n HistogramDistance* copy_dist_histograms);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_HISTOGRAM_H_ */\n" }, { "path": "libs/brotli/enc/histogram_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: Histogram, DATA_SIZE, DataType */\n\n/* A simple container for histograms of data in blocks. */\n\ntypedef struct FN(Histogram) {\n uint32_t data_[DATA_SIZE];\n size_t total_count_;\n double bit_cost_;\n} FN(Histogram);\n\nstatic BROTLI_INLINE void FN(HistogramClear)(FN(Histogram)* self) {\n memset(self->data_, 0, sizeof(self->data_));\n self->total_count_ = 0;\n self->bit_cost_ = HUGE_VAL;\n}\n\nstatic BROTLI_INLINE void FN(ClearHistograms)(\n FN(Histogram)* array, size_t length) {\n size_t i;\n for (i = 0; i < length; ++i) FN(HistogramClear)(array + i);\n}\n\nstatic BROTLI_INLINE void FN(HistogramAdd)(FN(Histogram)* self, size_t val) {\n ++self->data_[val];\n ++self->total_count_;\n}\n\nstatic BROTLI_INLINE void FN(HistogramAddVector)(FN(Histogram)* self,\n const DataType* p, size_t n) {\n self->total_count_ += n;\n n += 1;\n while (--n) ++self->data_[*p++];\n}\n\nstatic BROTLI_INLINE void FN(HistogramAddHistogram)(FN(Histogram)* self,\n const FN(Histogram)* v) {\n size_t i;\n self->total_count_ += v->total_count_;\n for (i = 0; i < DATA_SIZE; ++i) {\n self->data_[i] += v->data_[i];\n }\n}\n\nstatic BROTLI_INLINE size_t FN(HistogramDataSize)(void) { return DATA_SIZE; }\n" }, { "path": "libs/brotli/enc/literal_cost.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Literal cost model to allow backward reference replacement to be efficient.\n*/\n\n#include \"literal_cost.h\"\n\n#include \"../common/platform.h\"\n#include \"fast_log.h\"\n#include \"utf8_util.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic size_t UTF8Position(size_t last, size_t c, size_t clamp) {\n if (c < 128) {\n return 0; /* Next one is the 'Byte 1' again. */\n } else if (c >= 192) { /* Next one is the 'Byte 2' of utf-8 encoding. */\n return BROTLI_MIN(size_t, 1, clamp);\n } else {\n /* Let's decide over the last byte if this ends the sequence. */\n if (last < 0xE0) {\n return 0; /* Completed two or three byte coding. */\n } else { /* Next one is the 'Byte 3' of utf-8 encoding. */\n return BROTLI_MIN(size_t, 2, clamp);\n }\n }\n}\n\nstatic size_t DecideMultiByteStatsLevel(size_t pos, size_t len, size_t mask,\n const uint8_t* data) {\n size_t counts[3] = { 0 };\n size_t max_utf8 = 1; /* should be 2, but 1 compresses better. */\n size_t last_c = 0;\n size_t i;\n for (i = 0; i < len; ++i) {\n size_t c = data[(pos + i) & mask];\n ++counts[UTF8Position(last_c, c, 2)];\n last_c = c;\n }\n if (counts[2] < 500) {\n max_utf8 = 1;\n }\n if (counts[1] + counts[2] < 25) {\n max_utf8 = 0;\n }\n return max_utf8;\n}\n\nstatic void EstimateBitCostsForLiteralsUTF8(size_t pos, size_t len, size_t mask,\n const uint8_t* data,\n size_t* histogram, float* cost) {\n /* max_utf8 is 0 (normal ASCII single byte modeling),\n 1 (for 2-byte UTF-8 modeling), or 2 (for 3-byte UTF-8 modeling). */\n const size_t max_utf8 = DecideMultiByteStatsLevel(pos, len, mask, data);\n size_t window_half = 495;\n size_t in_window = BROTLI_MIN(size_t, window_half, len);\n size_t in_window_utf8[3] = { 0 };\n size_t i;\n memset(histogram, 0, 3 * 256 * sizeof(histogram[0]));\n\n { /* Bootstrap histograms. */\n size_t last_c = 0;\n size_t utf8_pos = 0;\n for (i = 0; i < in_window; ++i) {\n size_t c = data[(pos + i) & mask];\n ++histogram[256 * utf8_pos + c];\n ++in_window_utf8[utf8_pos];\n utf8_pos = UTF8Position(last_c, c, max_utf8);\n last_c = c;\n }\n }\n\n /* Compute bit costs with sliding window. */\n for (i = 0; i < len; ++i) {\n if (i >= window_half) {\n /* Remove a byte in the past. */\n size_t c =\n i < window_half + 1 ? 0 : data[(pos + i - window_half - 1) & mask];\n size_t last_c =\n i < window_half + 2 ? 0 : data[(pos + i - window_half - 2) & mask];\n size_t utf8_pos2 = UTF8Position(last_c, c, max_utf8);\n --histogram[256 * utf8_pos2 + data[(pos + i - window_half) & mask]];\n --in_window_utf8[utf8_pos2];\n }\n if (i + window_half < len) {\n /* Add a byte in the future. */\n size_t c = data[(pos + i + window_half - 1) & mask];\n size_t last_c = data[(pos + i + window_half - 2) & mask];\n size_t utf8_pos2 = UTF8Position(last_c, c, max_utf8);\n ++histogram[256 * utf8_pos2 + data[(pos + i + window_half) & mask]];\n ++in_window_utf8[utf8_pos2];\n }\n {\n size_t c = i < 1 ? 0 : data[(pos + i - 1) & mask];\n size_t last_c = i < 2 ? 0 : data[(pos + i - 2) & mask];\n size_t utf8_pos = UTF8Position(last_c, c, max_utf8);\n size_t masked_pos = (pos + i) & mask;\n size_t histo = histogram[256 * utf8_pos + data[masked_pos]];\n static const size_t prologue_length = 2000;\n static const double multiplier = 0.35 / 2000;\n double lit_cost;\n if (histo == 0) {\n histo = 1;\n }\n lit_cost = FastLog2(in_window_utf8[utf8_pos]) - FastLog2(histo);\n lit_cost += 0.02905;\n if (lit_cost < 1.0) {\n lit_cost *= 0.5;\n lit_cost += 0.5;\n }\n /* Make the first bytes more expensive -- seems to help, not sure why.\n Perhaps because the entropy source is changing its properties\n rapidly in the beginning of the file, perhaps because the beginning\n of the data is a statistical \"anomaly\". */\n if (i < prologue_length) {\n lit_cost += 0.35 + multiplier * (double)i;\n }\n cost[i] = (float)lit_cost;\n }\n }\n}\n\nvoid BrotliEstimateBitCostsForLiterals(size_t pos, size_t len, size_t mask,\n const uint8_t* data,\n size_t* histogram, float* cost) {\n if (BrotliIsMostlyUTF8(data, pos, mask, len, kMinUTF8Ratio)) {\n EstimateBitCostsForLiteralsUTF8(pos, len, mask, data, histogram, cost);\n return;\n } else {\n size_t window_half = 2000;\n size_t in_window = BROTLI_MIN(size_t, window_half, len);\n size_t i;\n memset(histogram, 0, 256 * sizeof(histogram[0]));\n\n /* Bootstrap histogram. */\n for (i = 0; i < in_window; ++i) {\n ++histogram[data[(pos + i) & mask]];\n }\n\n /* Compute bit costs with sliding window. */\n for (i = 0; i < len; ++i) {\n size_t histo;\n if (i >= window_half) {\n /* Remove a byte in the past. */\n --histogram[data[(pos + i - window_half) & mask]];\n --in_window;\n }\n if (i + window_half < len) {\n /* Add a byte in the future. */\n ++histogram[data[(pos + i + window_half) & mask]];\n ++in_window;\n }\n histo = histogram[data[(pos + i) & mask]];\n if (histo == 0) {\n histo = 1;\n }\n {\n double lit_cost = FastLog2(in_window) - FastLog2(histo);\n lit_cost += 0.029;\n if (lit_cost < 1.0) {\n lit_cost *= 0.5;\n lit_cost += 0.5;\n }\n cost[i] = (float)lit_cost;\n }\n }\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/literal_cost.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Literal cost model to allow backward reference replacement to be efficient.\n*/\n\n#ifndef BROTLI_ENC_LITERAL_COST_H_\n#define BROTLI_ENC_LITERAL_COST_H_\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* Estimates how many bits the literals in the interval [pos, pos + len) in the\n ring-buffer (data, mask) will take entropy coded and writes these estimates\n to the cost[0..len) array. */\nBROTLI_INTERNAL void BrotliEstimateBitCostsForLiterals(\n size_t pos, size_t len, size_t mask, const uint8_t* data, size_t* histogram,\n float* cost);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_LITERAL_COST_H_ */\n" }, { "path": "libs/brotli/enc/matching_tag_mask.h", "content": "#ifndef THIRD_PARTY_BROTLI_ENC_MATCHING_TAG_MASK_H_\n#define THIRD_PARTY_BROTLI_ENC_MATCHING_TAG_MASK_H_\n\n#include \"../common/platform.h\"\n\n#if defined(__SSE2__) || defined(_M_AMD64) || \\\n (defined(_M_IX86) && defined(_M_IX86_FP) && (_M_IX86_FP >= 2))\n#define SUPPORTS_SSE_2\n#endif\n\n#if defined(SUPPORTS_SSE_2)\n#include \n#endif\n\n\nstatic BROTLI_INLINE uint64_t GetMatchingTagMask(\n size_t chunk_count, const uint8_t tag,\n const uint8_t* BROTLI_RESTRICT tag_bucket, const size_t head) {\n uint64_t matches = 0;\n#if defined(SUPPORTS_SSE_2)\n const __m128i comparison_mask = _mm_set1_epi8((char)tag);\n size_t i;\n for (i = 0; i < chunk_count && i < 4; i++) {\n const __m128i chunk =\n _mm_loadu_si128((const __m128i*)(const void*)(tag_bucket + 16 * i));\n const __m128i equal_mask = _mm_cmpeq_epi8(chunk, comparison_mask);\n matches |= (uint64_t)_mm_movemask_epi8(equal_mask) << 16 * i;\n }\n#else\n const int chunk_size = sizeof(size_t);\n const size_t shift_amount = ((chunk_size * 8) - chunk_size);\n const size_t xFF = ~((size_t)0);\n const size_t x01 = xFF / 0xFF;\n const size_t x80 = x01 << 7;\n const size_t splat_char = tag * x01;\n int i = ((int)chunk_count * 16) - chunk_size;\n BROTLI_DCHECK((sizeof(size_t) == 4) || (sizeof(size_t) == 8));\n#if BROTLI_LITTLE_ENDIAN\n const size_t extractMagic = (xFF / 0x7F) >> chunk_size;\n do {\n size_t chunk = BrotliUnalignedReadSizeT(&tag_bucket[i]);\n chunk ^= splat_char;\n chunk = (((chunk | x80) - x01) | chunk) & x80;\n matches <<= chunk_size;\n matches |= (chunk * extractMagic) >> shift_amount;\n i -= chunk_size;\n } while (i >= 0);\n#else\n const size_t msb = xFF ^ (xFF >> 1);\n const size_t extractMagic = (msb / 0x1FF) | msb;\n do {\n size_t chunk = BrotliUnalignedReadSizeT(&tag_bucket[i]);\n chunk ^= splat_char;\n chunk = (((chunk | x80) - x01) | chunk) & x80;\n matches <<= chunk_size;\n matches |= ((chunk >> 7) * extractMagic) >> shift_amount;\n i -= chunk_size;\n } while (i >= 0);\n#endif\n matches = ~matches;\n#endif\n if (chunk_count == 1) return BrotliRotateRight16((uint16_t)matches, head);\n if (chunk_count == 2) return BrotliRotateRight32((uint32_t)matches, head);\n return BrotliRotateRight64(matches, head);\n}\n\n#undef SUPPORTS_SSE_2\n\n#endif // THIRD_PARTY_BROTLI_ENC_MATCHING_TAG_MASK_H_\n" }, { "path": "libs/brotli/enc/memory.c", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Algorithms for distributing the literals and commands of a metablock between\n block types and contexts. */\n\n#include \"memory.h\"\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define MAX_NEW_ALLOCATED (BROTLI_ENCODER_MEMORY_MANAGER_SLOTS >> 2)\n#define MAX_NEW_FREED (BROTLI_ENCODER_MEMORY_MANAGER_SLOTS >> 2)\n#define MAX_PERM_ALLOCATED (BROTLI_ENCODER_MEMORY_MANAGER_SLOTS >> 1)\n\n#define PERM_ALLOCATED_OFFSET 0\n#define NEW_ALLOCATED_OFFSET MAX_PERM_ALLOCATED\n#define NEW_FREED_OFFSET (MAX_PERM_ALLOCATED + MAX_NEW_ALLOCATED)\n\nvoid BrotliInitMemoryManager(\n MemoryManager* m, brotli_alloc_func alloc_func, brotli_free_func free_func,\n void* opaque) {\n if (!alloc_func) {\n m->alloc_func = BrotliDefaultAllocFunc;\n m->free_func = BrotliDefaultFreeFunc;\n m->opaque = 0;\n } else {\n m->alloc_func = alloc_func;\n m->free_func = free_func;\n m->opaque = opaque;\n }\n#if !defined(BROTLI_ENCODER_EXIT_ON_OOM)\n m->is_oom = BROTLI_FALSE;\n m->perm_allocated = 0;\n m->new_allocated = 0;\n m->new_freed = 0;\n#endif /* BROTLI_ENCODER_EXIT_ON_OOM */\n}\n\n#if defined(BROTLI_ENCODER_EXIT_ON_OOM)\n\nvoid* BrotliAllocate(MemoryManager* m, size_t n) {\n void* result = m->alloc_func(m->opaque, n);\n if (!result) exit(EXIT_FAILURE);\n return result;\n}\n\nvoid BrotliFree(MemoryManager* m, void* p) {\n m->free_func(m->opaque, p);\n}\n\nvoid BrotliWipeOutMemoryManager(MemoryManager* m) {\n BROTLI_UNUSED(m);\n}\n\n#else /* BROTLI_ENCODER_EXIT_ON_OOM */\n\nstatic void SortPointers(void** items, const size_t n) {\n /* Shell sort. */\n /* TODO(eustas): fine-tune for \"many slots\" case */\n static const size_t gaps[] = {23, 10, 4, 1};\n int g = 0;\n for (; g < 4; ++g) {\n size_t gap = gaps[g];\n size_t i;\n for (i = gap; i < n; ++i) {\n size_t j = i;\n void* tmp = items[i];\n for (; j >= gap && tmp < items[j - gap]; j -= gap) {\n items[j] = items[j - gap];\n }\n items[j] = tmp;\n }\n }\n}\n\nstatic size_t Annihilate(void** a, size_t a_len, void** b, size_t b_len) {\n size_t a_read_index = 0;\n size_t b_read_index = 0;\n size_t a_write_index = 0;\n size_t b_write_index = 0;\n size_t annihilated = 0;\n while (a_read_index < a_len && b_read_index < b_len) {\n if (a[a_read_index] == b[b_read_index]) {\n a_read_index++;\n b_read_index++;\n annihilated++;\n } else if (a[a_read_index] < b[b_read_index]) {\n a[a_write_index++] = a[a_read_index++];\n } else {\n b[b_write_index++] = b[b_read_index++];\n }\n }\n while (a_read_index < a_len) a[a_write_index++] = a[a_read_index++];\n while (b_read_index < b_len) b[b_write_index++] = b[b_read_index++];\n return annihilated;\n}\n\nstatic void CollectGarbagePointers(MemoryManager* m) {\n size_t annihilated;\n SortPointers(m->pointers + NEW_ALLOCATED_OFFSET, m->new_allocated);\n SortPointers(m->pointers + NEW_FREED_OFFSET, m->new_freed);\n annihilated = Annihilate(\n m->pointers + NEW_ALLOCATED_OFFSET, m->new_allocated,\n m->pointers + NEW_FREED_OFFSET, m->new_freed);\n m->new_allocated -= annihilated;\n m->new_freed -= annihilated;\n\n if (m->new_freed != 0) {\n annihilated = Annihilate(\n m->pointers + PERM_ALLOCATED_OFFSET, m->perm_allocated,\n m->pointers + NEW_FREED_OFFSET, m->new_freed);\n m->perm_allocated -= annihilated;\n m->new_freed -= annihilated;\n BROTLI_DCHECK(m->new_freed == 0);\n }\n\n if (m->new_allocated != 0) {\n BROTLI_DCHECK(m->perm_allocated + m->new_allocated <= MAX_PERM_ALLOCATED);\n memcpy(m->pointers + PERM_ALLOCATED_OFFSET + m->perm_allocated,\n m->pointers + NEW_ALLOCATED_OFFSET,\n sizeof(void*) * m->new_allocated);\n m->perm_allocated += m->new_allocated;\n m->new_allocated = 0;\n SortPointers(m->pointers + PERM_ALLOCATED_OFFSET, m->perm_allocated);\n }\n}\n\nvoid* BrotliAllocate(MemoryManager* m, size_t n) {\n void* result = m->alloc_func(m->opaque, n);\n if (!result) {\n m->is_oom = BROTLI_TRUE;\n return NULL;\n }\n if (m->new_allocated == MAX_NEW_ALLOCATED) CollectGarbagePointers(m);\n m->pointers[NEW_ALLOCATED_OFFSET + (m->new_allocated++)] = result;\n return result;\n}\n\nvoid BrotliFree(MemoryManager* m, void* p) {\n if (!p) return;\n m->free_func(m->opaque, p);\n if (m->new_freed == MAX_NEW_FREED) CollectGarbagePointers(m);\n m->pointers[NEW_FREED_OFFSET + (m->new_freed++)] = p;\n}\n\nvoid BrotliWipeOutMemoryManager(MemoryManager* m) {\n size_t i;\n CollectGarbagePointers(m);\n /* Now all unfreed pointers are in perm-allocated list. */\n for (i = 0; i < m->perm_allocated; ++i) {\n m->free_func(m->opaque, m->pointers[PERM_ALLOCATED_OFFSET + i]);\n }\n m->perm_allocated = 0;\n}\n\n#endif /* BROTLI_ENCODER_EXIT_ON_OOM */\n\nvoid* BrotliBootstrapAlloc(size_t size,\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque) {\n if (!alloc_func && !free_func) {\n return malloc(size);\n } else if (alloc_func && free_func) {\n return alloc_func(opaque, size);\n }\n return NULL;\n}\n\nvoid BrotliBootstrapFree(void* address, MemoryManager* m) {\n if (!address) {\n /* Should not happen! */\n return;\n } else {\n /* Copy values, as those would be freed. */\n brotli_free_func free_func = m->free_func;\n void* opaque = m->opaque;\n free_func(opaque, address);\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/memory.h", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Macros for memory management. */\n\n#ifndef BROTLI_ENC_MEMORY_H_\n#define BROTLI_ENC_MEMORY_H_\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#if !defined(BROTLI_ENCODER_CLEANUP_ON_OOM) && \\\n !defined(BROTLI_ENCODER_EXIT_ON_OOM)\n#define BROTLI_ENCODER_EXIT_ON_OOM\n#endif\n\n#if !defined(BROTLI_ENCODER_EXIT_ON_OOM)\n#if defined(BROTLI_EXPERIMENTAL)\n#define BROTLI_ENCODER_MEMORY_MANAGER_SLOTS (48*1024)\n#else /* BROTLI_EXPERIMENTAL */\n#define BROTLI_ENCODER_MEMORY_MANAGER_SLOTS 256\n#endif /* BROTLI_EXPERIMENTAL */\n#else /* BROTLI_ENCODER_EXIT_ON_OOM */\n#define BROTLI_ENCODER_MEMORY_MANAGER_SLOTS 0\n#endif /* BROTLI_ENCODER_EXIT_ON_OOM */\n\ntypedef struct MemoryManager {\n brotli_alloc_func alloc_func;\n brotli_free_func free_func;\n void* opaque;\n#if !defined(BROTLI_ENCODER_EXIT_ON_OOM)\n BROTLI_BOOL is_oom;\n size_t perm_allocated;\n size_t new_allocated;\n size_t new_freed;\n void* pointers[BROTLI_ENCODER_MEMORY_MANAGER_SLOTS];\n#endif /* BROTLI_ENCODER_EXIT_ON_OOM */\n} MemoryManager;\n\nBROTLI_INTERNAL void BrotliInitMemoryManager(\n MemoryManager* m, brotli_alloc_func alloc_func, brotli_free_func free_func,\n void* opaque);\n\nBROTLI_INTERNAL void* BrotliAllocate(MemoryManager* m, size_t n);\n#define BROTLI_ALLOC(M, T, N) \\\n ((N) > 0 ? ((T*)BrotliAllocate((M), (N) * sizeof(T))) : NULL)\n\nBROTLI_INTERNAL void BrotliFree(MemoryManager* m, void* p);\n#define BROTLI_FREE(M, P) { \\\n BrotliFree((M), (P)); \\\n P = NULL; \\\n}\n\n#if defined(BROTLI_ENCODER_EXIT_ON_OOM)\n#define BROTLI_IS_OOM(M) (!!0)\n#else /* BROTLI_ENCODER_EXIT_ON_OOM */\n#define BROTLI_IS_OOM(M) (!!(M)->is_oom)\n#endif /* BROTLI_ENCODER_EXIT_ON_OOM */\n\n/*\nBROTLI_IS_NULL is a fake check, BROTLI_IS_OOM does the heavy lifting.\nThe only purpose of it is to explain static analyzers the state of things.\nNB: use ONLY together with BROTLI_IS_OOM\n AND ONLY for allocations in the current scope.\n */\n#if defined(__clang_analyzer__) && !defined(BROTLI_ENCODER_EXIT_ON_OOM)\n#define BROTLI_IS_NULL(A) ((A) == nullptr)\n#else /* defined(__clang_analyzer__) */\n#define BROTLI_IS_NULL(A) (!!0)\n#endif /* defined(__clang_analyzer__) */\n\nBROTLI_INTERNAL void BrotliWipeOutMemoryManager(MemoryManager* m);\n\n/*\nDynamically grows array capacity to at least the requested size\nM: MemoryManager\nT: data type\nA: array\nC: capacity\nR: requested size\n*/\n#define BROTLI_ENSURE_CAPACITY(M, T, A, C, R) { \\\n if (C < (R)) { \\\n size_t _new_size = (C == 0) ? (R) : C; \\\n T* new_array; \\\n while (_new_size < (R)) _new_size *= 2; \\\n new_array = BROTLI_ALLOC((M), T, _new_size); \\\n if (!BROTLI_IS_OOM(M) && !BROTLI_IS_NULL(new_array) && C != 0) \\\n memcpy(new_array, A, C * sizeof(T)); \\\n BROTLI_FREE((M), A); \\\n A = new_array; \\\n C = _new_size; \\\n } \\\n}\n\n/*\nAppends value and dynamically grows array capacity when needed\nM: MemoryManager\nT: data type\nA: array\nC: array capacity\nS: array size\nV: value to append\n*/\n#define BROTLI_ENSURE_CAPACITY_APPEND(M, T, A, C, S, V) { \\\n (S)++; \\\n BROTLI_ENSURE_CAPACITY(M, T, A, C, S); \\\n A[(S) - 1] = (V); \\\n}\n\n/* \"Bootstrap\" allocations are not tracked by memory manager; should be used\n only to allocate MemoryManager itself (or structure containing it). */\nBROTLI_INTERNAL void* BrotliBootstrapAlloc(size_t size,\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);\nBROTLI_INTERNAL void BrotliBootstrapFree(void* address, MemoryManager* m);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_MEMORY_H_ */\n" }, { "path": "libs/brotli/enc/metablock.c", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Algorithms for distributing the literals and commands of a metablock between\n block types and contexts. */\n\n#include \"metablock.h\"\n\n#include \"../common/constants.h\"\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"bit_cost.h\"\n#include \"block_splitter.h\"\n#include \"cluster.h\"\n#include \"command.h\"\n#include \"entropy_encode.h\"\n#include \"histogram.h\"\n#include \"memory.h\"\n#include \"params.h\"\n#include \"prefix.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nvoid BrotliInitDistanceParams(BrotliDistanceParams* dist_params,\n uint32_t npostfix, uint32_t ndirect, BROTLI_BOOL large_window) {\n uint32_t alphabet_size_max;\n uint32_t alphabet_size_limit;\n uint32_t max_distance;\n\n dist_params->distance_postfix_bits = npostfix;\n dist_params->num_direct_distance_codes = ndirect;\n\n alphabet_size_max = BROTLI_DISTANCE_ALPHABET_SIZE(\n npostfix, ndirect, BROTLI_MAX_DISTANCE_BITS);\n alphabet_size_limit = alphabet_size_max;\n max_distance = ndirect + (1U << (BROTLI_MAX_DISTANCE_BITS + npostfix + 2)) -\n (1U << (npostfix + 2));\n\n if (large_window) {\n BrotliDistanceCodeLimit limit = BrotliCalculateDistanceCodeLimit(\n BROTLI_MAX_ALLOWED_DISTANCE, npostfix, ndirect);\n alphabet_size_max = BROTLI_DISTANCE_ALPHABET_SIZE(\n npostfix, ndirect, BROTLI_LARGE_MAX_DISTANCE_BITS);\n alphabet_size_limit = limit.max_alphabet_size;\n max_distance = limit.max_distance;\n }\n\n dist_params->alphabet_size_max = alphabet_size_max;\n dist_params->alphabet_size_limit = alphabet_size_limit;\n dist_params->max_distance = max_distance;\n}\n\nstatic void RecomputeDistancePrefixes(Command* cmds,\n size_t num_commands,\n const BrotliDistanceParams* orig_params,\n const BrotliDistanceParams* new_params) {\n size_t i;\n\n if (orig_params->distance_postfix_bits == new_params->distance_postfix_bits &&\n orig_params->num_direct_distance_codes ==\n new_params->num_direct_distance_codes) {\n return;\n }\n\n for (i = 0; i < num_commands; ++i) {\n Command* cmd = &cmds[i];\n if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {\n PrefixEncodeCopyDistance(CommandRestoreDistanceCode(cmd, orig_params),\n new_params->num_direct_distance_codes,\n new_params->distance_postfix_bits,\n &cmd->dist_prefix_,\n &cmd->dist_extra_);\n }\n }\n}\n\nstatic BROTLI_BOOL ComputeDistanceCost(const Command* cmds,\n size_t num_commands,\n const BrotliDistanceParams* orig_params,\n const BrotliDistanceParams* new_params,\n double* cost,\n HistogramDistance* tmp) {\n size_t i;\n BROTLI_BOOL equal_params = BROTLI_FALSE;\n uint16_t dist_prefix;\n uint32_t dist_extra;\n double extra_bits = 0.0;\n HistogramClearDistance(tmp);\n\n if (orig_params->distance_postfix_bits == new_params->distance_postfix_bits &&\n orig_params->num_direct_distance_codes ==\n new_params->num_direct_distance_codes) {\n equal_params = BROTLI_TRUE;\n }\n\n for (i = 0; i < num_commands; i++) {\n const Command* cmd = &cmds[i];\n if (CommandCopyLen(cmd) && cmd->cmd_prefix_ >= 128) {\n if (equal_params) {\n dist_prefix = cmd->dist_prefix_;\n } else {\n uint32_t distance = CommandRestoreDistanceCode(cmd, orig_params);\n if (distance > new_params->max_distance) {\n return BROTLI_FALSE;\n }\n PrefixEncodeCopyDistance(distance,\n new_params->num_direct_distance_codes,\n new_params->distance_postfix_bits,\n &dist_prefix,\n &dist_extra);\n }\n HistogramAddDistance(tmp, dist_prefix & 0x3FF);\n extra_bits += dist_prefix >> 10;\n }\n }\n\n *cost = BrotliPopulationCostDistance(tmp) + extra_bits;\n return BROTLI_TRUE;\n}\n\nvoid BrotliBuildMetaBlock(MemoryManager* m,\n const uint8_t* ringbuffer,\n const size_t pos,\n const size_t mask,\n BrotliEncoderParams* params,\n uint8_t prev_byte,\n uint8_t prev_byte2,\n Command* cmds,\n size_t num_commands,\n ContextType literal_context_mode,\n MetaBlockSplit* mb) {\n /* Histogram ids need to fit in one byte. */\n static const size_t kMaxNumberOfHistograms = 256;\n HistogramDistance* distance_histograms;\n HistogramLiteral* literal_histograms;\n ContextType* literal_context_modes = NULL;\n size_t literal_histograms_size;\n size_t distance_histograms_size;\n size_t i;\n size_t literal_context_multiplier = 1;\n uint32_t npostfix;\n uint32_t ndirect_msb = 0;\n BROTLI_BOOL check_orig = BROTLI_TRUE;\n double best_dist_cost = 1e99;\n BrotliDistanceParams orig_params = params->dist;\n BrotliDistanceParams new_params = params->dist;\n HistogramDistance* tmp = BROTLI_ALLOC(m, HistogramDistance, 1);\n\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(tmp)) return;\n\n for (npostfix = 0; npostfix <= BROTLI_MAX_NPOSTFIX; npostfix++) {\n for (; ndirect_msb < 16; ndirect_msb++) {\n uint32_t ndirect = ndirect_msb << npostfix;\n BROTLI_BOOL skip;\n double dist_cost;\n BrotliInitDistanceParams(&new_params, npostfix, ndirect,\n params->large_window);\n if (npostfix == orig_params.distance_postfix_bits &&\n ndirect == orig_params.num_direct_distance_codes) {\n check_orig = BROTLI_FALSE;\n }\n skip = !ComputeDistanceCost(\n cmds, num_commands, &orig_params, &new_params, &dist_cost, tmp);\n if (skip || (dist_cost > best_dist_cost)) {\n break;\n }\n best_dist_cost = dist_cost;\n params->dist = new_params;\n }\n if (ndirect_msb > 0) ndirect_msb--;\n ndirect_msb /= 2;\n }\n if (check_orig) {\n double dist_cost;\n ComputeDistanceCost(cmds, num_commands, &orig_params, &orig_params,\n &dist_cost, tmp);\n if (dist_cost < best_dist_cost) {\n /* NB: currently unused; uncomment when more param tuning is added. */\n /* best_dist_cost = dist_cost; */\n params->dist = orig_params;\n }\n }\n BROTLI_FREE(m, tmp);\n RecomputeDistancePrefixes(cmds, num_commands, &orig_params, ¶ms->dist);\n\n BrotliSplitBlock(m, cmds, num_commands,\n ringbuffer, pos, mask, params,\n &mb->literal_split,\n &mb->command_split,\n &mb->distance_split);\n if (BROTLI_IS_OOM(m)) return;\n\n if (!params->disable_literal_context_modeling) {\n literal_context_multiplier = 1 << BROTLI_LITERAL_CONTEXT_BITS;\n literal_context_modes =\n BROTLI_ALLOC(m, ContextType, mb->literal_split.num_types);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(literal_context_modes)) return;\n for (i = 0; i < mb->literal_split.num_types; ++i) {\n literal_context_modes[i] = literal_context_mode;\n }\n }\n\n literal_histograms_size =\n mb->literal_split.num_types * literal_context_multiplier;\n literal_histograms =\n BROTLI_ALLOC(m, HistogramLiteral, literal_histograms_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(literal_histograms)) return;\n ClearHistogramsLiteral(literal_histograms, literal_histograms_size);\n\n distance_histograms_size =\n mb->distance_split.num_types << BROTLI_DISTANCE_CONTEXT_BITS;\n distance_histograms =\n BROTLI_ALLOC(m, HistogramDistance, distance_histograms_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(distance_histograms)) return;\n ClearHistogramsDistance(distance_histograms, distance_histograms_size);\n\n BROTLI_DCHECK(mb->command_histograms == 0);\n mb->command_histograms_size = mb->command_split.num_types;\n mb->command_histograms =\n BROTLI_ALLOC(m, HistogramCommand, mb->command_histograms_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->command_histograms)) return;\n ClearHistogramsCommand(mb->command_histograms, mb->command_histograms_size);\n\n BrotliBuildHistogramsWithContext(cmds, num_commands,\n &mb->literal_split, &mb->command_split, &mb->distance_split,\n ringbuffer, pos, mask, prev_byte, prev_byte2, literal_context_modes,\n literal_histograms, mb->command_histograms, distance_histograms);\n BROTLI_FREE(m, literal_context_modes);\n\n BROTLI_DCHECK(mb->literal_context_map == 0);\n mb->literal_context_map_size =\n mb->literal_split.num_types << BROTLI_LITERAL_CONTEXT_BITS;\n mb->literal_context_map =\n BROTLI_ALLOC(m, uint32_t, mb->literal_context_map_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->literal_context_map)) return;\n\n BROTLI_DCHECK(mb->literal_histograms == 0);\n mb->literal_histograms_size = mb->literal_context_map_size;\n mb->literal_histograms =\n BROTLI_ALLOC(m, HistogramLiteral, mb->literal_histograms_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->literal_histograms)) return;\n\n BrotliClusterHistogramsLiteral(m, literal_histograms, literal_histograms_size,\n kMaxNumberOfHistograms, mb->literal_histograms,\n &mb->literal_histograms_size, mb->literal_context_map);\n if (BROTLI_IS_OOM(m)) return;\n BROTLI_FREE(m, literal_histograms);\n\n if (params->disable_literal_context_modeling) {\n /* Distribute assignment to all contexts. */\n for (i = mb->literal_split.num_types; i != 0;) {\n size_t j = 0;\n i--;\n for (; j < (1 << BROTLI_LITERAL_CONTEXT_BITS); j++) {\n mb->literal_context_map[(i << BROTLI_LITERAL_CONTEXT_BITS) + j] =\n mb->literal_context_map[i];\n }\n }\n }\n\n BROTLI_DCHECK(mb->distance_context_map == 0);\n mb->distance_context_map_size =\n mb->distance_split.num_types << BROTLI_DISTANCE_CONTEXT_BITS;\n mb->distance_context_map =\n BROTLI_ALLOC(m, uint32_t, mb->distance_context_map_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->distance_context_map)) return;\n\n BROTLI_DCHECK(mb->distance_histograms == 0);\n mb->distance_histograms_size = mb->distance_context_map_size;\n mb->distance_histograms =\n BROTLI_ALLOC(m, HistogramDistance, mb->distance_histograms_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->distance_histograms)) return;\n\n BrotliClusterHistogramsDistance(m, distance_histograms,\n mb->distance_context_map_size,\n kMaxNumberOfHistograms,\n mb->distance_histograms,\n &mb->distance_histograms_size,\n mb->distance_context_map);\n if (BROTLI_IS_OOM(m)) return;\n BROTLI_FREE(m, distance_histograms);\n}\n\n#define FN(X) X ## Literal\n#include \"metablock_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Command\n#include \"metablock_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n#define FN(X) X ## Distance\n#include \"metablock_inc.h\" /* NOLINT(build/include) */\n#undef FN\n\n/* Greedy block splitter for one block category (literal, command or distance).\n Gathers histograms for all context buckets. */\ntypedef struct ContextBlockSplitter {\n /* Alphabet size of particular block category. */\n size_t alphabet_size_;\n size_t num_contexts_;\n size_t max_block_types_;\n /* We collect at least this many symbols for each block. */\n size_t min_block_size_;\n /* We merge histograms A and B if\n entropy(A+B) < entropy(A) + entropy(B) + split_threshold_,\n where A is the current histogram and B is the histogram of the last or the\n second last block type. */\n double split_threshold_;\n\n size_t num_blocks_;\n BlockSplit* split_; /* not owned */\n HistogramLiteral* histograms_; /* not owned */\n size_t* histograms_size_; /* not owned */\n\n /* The number of symbols that we want to collect before deciding on whether\n or not to merge the block with a previous one or emit a new block. */\n size_t target_block_size_;\n /* The number of symbols in the current histogram. */\n size_t block_size_;\n /* Offset of the current histogram. */\n size_t curr_histogram_ix_;\n /* Offset of the histograms of the previous two block types. */\n size_t last_histogram_ix_[2];\n /* Entropy of the previous two block types. */\n double last_entropy_[2 * BROTLI_MAX_STATIC_CONTEXTS];\n /* The number of times we merged the current block with the last one. */\n size_t merge_last_count_;\n} ContextBlockSplitter;\n\nstatic void InitContextBlockSplitter(\n MemoryManager* m, ContextBlockSplitter* self, size_t alphabet_size,\n size_t num_contexts, size_t min_block_size, double split_threshold,\n size_t num_symbols, BlockSplit* split, HistogramLiteral** histograms,\n size_t* histograms_size) {\n size_t max_num_blocks = num_symbols / min_block_size + 1;\n size_t max_num_types;\n BROTLI_DCHECK(num_contexts <= BROTLI_MAX_STATIC_CONTEXTS);\n\n self->alphabet_size_ = alphabet_size;\n self->num_contexts_ = num_contexts;\n self->max_block_types_ = BROTLI_MAX_NUMBER_OF_BLOCK_TYPES / num_contexts;\n self->min_block_size_ = min_block_size;\n self->split_threshold_ = split_threshold;\n self->num_blocks_ = 0;\n self->split_ = split;\n self->histograms_size_ = histograms_size;\n self->target_block_size_ = min_block_size;\n self->block_size_ = 0;\n self->curr_histogram_ix_ = 0;\n self->merge_last_count_ = 0;\n\n /* We have to allocate one more histogram than the maximum number of block\n types for the current histogram when the meta-block is too big. */\n max_num_types =\n BROTLI_MIN(size_t, max_num_blocks, self->max_block_types_ + 1);\n BROTLI_ENSURE_CAPACITY(m, uint8_t,\n split->types, split->types_alloc_size, max_num_blocks);\n BROTLI_ENSURE_CAPACITY(m, uint32_t,\n split->lengths, split->lengths_alloc_size, max_num_blocks);\n if (BROTLI_IS_OOM(m)) return;\n split->num_blocks = max_num_blocks;\n if (BROTLI_IS_OOM(m)) return;\n BROTLI_DCHECK(*histograms == 0);\n *histograms_size = max_num_types * num_contexts;\n *histograms = BROTLI_ALLOC(m, HistogramLiteral, *histograms_size);\n self->histograms_ = *histograms;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return;\n /* Clear only current histogram. */\n ClearHistogramsLiteral(&self->histograms_[0], num_contexts);\n self->last_histogram_ix_[0] = self->last_histogram_ix_[1] = 0;\n}\n\n/* Does either of three things:\n (1) emits the current block with a new block type;\n (2) emits the current block with the type of the second last block;\n (3) merges the current block with the last block. */\nstatic void ContextBlockSplitterFinishBlock(\n ContextBlockSplitter* self, MemoryManager* m, BROTLI_BOOL is_final) {\n BlockSplit* split = self->split_;\n const size_t num_contexts = self->num_contexts_;\n double* last_entropy = self->last_entropy_;\n HistogramLiteral* histograms = self->histograms_;\n\n if (self->block_size_ < self->min_block_size_) {\n self->block_size_ = self->min_block_size_;\n }\n if (self->num_blocks_ == 0) {\n size_t i;\n /* Create first block. */\n split->lengths[0] = (uint32_t)self->block_size_;\n split->types[0] = 0;\n\n for (i = 0; i < num_contexts; ++i) {\n last_entropy[i] =\n BrotliBitsEntropy(histograms[i].data_, self->alphabet_size_);\n last_entropy[num_contexts + i] = last_entropy[i];\n }\n ++self->num_blocks_;\n ++split->num_types;\n self->curr_histogram_ix_ += num_contexts;\n if (self->curr_histogram_ix_ < *self->histograms_size_) {\n ClearHistogramsLiteral(\n &self->histograms_[self->curr_histogram_ix_], self->num_contexts_);\n }\n self->block_size_ = 0;\n } else if (self->block_size_ > 0) {\n /* Try merging the set of histograms for the current block type with the\n respective set of histograms for the last and second last block types.\n Decide over the split based on the total reduction of entropy across\n all contexts. */\n double entropy[BROTLI_MAX_STATIC_CONTEXTS];\n HistogramLiteral* combined_histo =\n BROTLI_ALLOC(m, HistogramLiteral, 2 * num_contexts);\n double combined_entropy[2 * BROTLI_MAX_STATIC_CONTEXTS];\n double diff[2] = { 0.0 };\n size_t i;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(combined_histo)) return;\n for (i = 0; i < num_contexts; ++i) {\n size_t curr_histo_ix = self->curr_histogram_ix_ + i;\n size_t j;\n entropy[i] = BrotliBitsEntropy(histograms[curr_histo_ix].data_,\n self->alphabet_size_);\n for (j = 0; j < 2; ++j) {\n size_t jx = j * num_contexts + i;\n size_t last_histogram_ix = self->last_histogram_ix_[j] + i;\n combined_histo[jx] = histograms[curr_histo_ix];\n HistogramAddHistogramLiteral(&combined_histo[jx],\n &histograms[last_histogram_ix]);\n combined_entropy[jx] = BrotliBitsEntropy(\n &combined_histo[jx].data_[0], self->alphabet_size_);\n diff[j] += combined_entropy[jx] - entropy[i] - last_entropy[jx];\n }\n }\n\n if (split->num_types < self->max_block_types_ &&\n diff[0] > self->split_threshold_ &&\n diff[1] > self->split_threshold_) {\n /* Create new block. */\n split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;\n split->types[self->num_blocks_] = (uint8_t)split->num_types;\n self->last_histogram_ix_[1] = self->last_histogram_ix_[0];\n self->last_histogram_ix_[0] = split->num_types * num_contexts;\n for (i = 0; i < num_contexts; ++i) {\n last_entropy[num_contexts + i] = last_entropy[i];\n last_entropy[i] = entropy[i];\n }\n ++self->num_blocks_;\n ++split->num_types;\n self->curr_histogram_ix_ += num_contexts;\n if (self->curr_histogram_ix_ < *self->histograms_size_) {\n ClearHistogramsLiteral(\n &self->histograms_[self->curr_histogram_ix_], self->num_contexts_);\n }\n self->block_size_ = 0;\n self->merge_last_count_ = 0;\n self->target_block_size_ = self->min_block_size_;\n } else if (diff[1] < diff[0] - 20.0) {\n /* Combine this block with second last block. */\n split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;\n split->types[self->num_blocks_] = split->types[self->num_blocks_ - 2];\n BROTLI_SWAP(size_t, self->last_histogram_ix_, 0, 1);\n for (i = 0; i < num_contexts; ++i) {\n histograms[self->last_histogram_ix_[0] + i] =\n combined_histo[num_contexts + i];\n last_entropy[num_contexts + i] = last_entropy[i];\n last_entropy[i] = combined_entropy[num_contexts + i];\n HistogramClearLiteral(&histograms[self->curr_histogram_ix_ + i]);\n }\n ++self->num_blocks_;\n self->block_size_ = 0;\n self->merge_last_count_ = 0;\n self->target_block_size_ = self->min_block_size_;\n } else {\n /* Combine this block with last block. */\n split->lengths[self->num_blocks_ - 1] += (uint32_t)self->block_size_;\n for (i = 0; i < num_contexts; ++i) {\n histograms[self->last_histogram_ix_[0] + i] = combined_histo[i];\n last_entropy[i] = combined_entropy[i];\n if (split->num_types == 1) {\n last_entropy[num_contexts + i] = last_entropy[i];\n }\n HistogramClearLiteral(&histograms[self->curr_histogram_ix_ + i]);\n }\n self->block_size_ = 0;\n if (++self->merge_last_count_ > 1) {\n self->target_block_size_ += self->min_block_size_;\n }\n }\n BROTLI_FREE(m, combined_histo);\n }\n if (is_final) {\n *self->histograms_size_ = split->num_types * num_contexts;\n split->num_blocks = self->num_blocks_;\n }\n}\n\n/* Adds the next symbol to the current block type and context. When the\n current block reaches the target size, decides on merging the block. */\nstatic void ContextBlockSplitterAddSymbol(\n ContextBlockSplitter* self, MemoryManager* m,\n size_t symbol, size_t context) {\n HistogramAddLiteral(&self->histograms_[self->curr_histogram_ix_ + context],\n symbol);\n ++self->block_size_;\n if (self->block_size_ == self->target_block_size_) {\n ContextBlockSplitterFinishBlock(self, m, /* is_final = */ BROTLI_FALSE);\n if (BROTLI_IS_OOM(m)) return;\n }\n}\n\nstatic void MapStaticContexts(MemoryManager* m,\n size_t num_contexts,\n const uint32_t* static_context_map,\n MetaBlockSplit* mb) {\n size_t i;\n BROTLI_DCHECK(mb->literal_context_map == 0);\n mb->literal_context_map_size =\n mb->literal_split.num_types << BROTLI_LITERAL_CONTEXT_BITS;\n mb->literal_context_map =\n BROTLI_ALLOC(m, uint32_t, mb->literal_context_map_size);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(mb->literal_context_map)) return;\n\n for (i = 0; i < mb->literal_split.num_types; ++i) {\n uint32_t offset = (uint32_t)(i * num_contexts);\n size_t j;\n for (j = 0; j < (1u << BROTLI_LITERAL_CONTEXT_BITS); ++j) {\n mb->literal_context_map[(i << BROTLI_LITERAL_CONTEXT_BITS) + j] =\n offset + static_context_map[j];\n }\n }\n}\n\ntypedef struct GreedyMetablockArena {\n union {\n BlockSplitterLiteral plain;\n ContextBlockSplitter ctx;\n } lit_blocks;\n BlockSplitterCommand cmd_blocks;\n BlockSplitterDistance dist_blocks;\n} GreedyMetablockArena;\n\nstatic BROTLI_INLINE void BrotliBuildMetaBlockGreedyInternal(\n MemoryManager* m, GreedyMetablockArena* arena, const uint8_t* ringbuffer,\n size_t pos, size_t mask, uint8_t prev_byte, uint8_t prev_byte2,\n ContextLut literal_context_lut, const size_t num_contexts,\n const uint32_t* static_context_map, const Command* commands,\n size_t n_commands, MetaBlockSplit* mb) {\n size_t num_literals = 0;\n size_t i;\n for (i = 0; i < n_commands; ++i) {\n num_literals += commands[i].insert_len_;\n }\n\n if (num_contexts == 1) {\n InitBlockSplitterLiteral(m, &arena->lit_blocks.plain, 256, 512, 400.0,\n num_literals, &mb->literal_split, &mb->literal_histograms,\n &mb->literal_histograms_size);\n } else {\n InitContextBlockSplitter(m, &arena->lit_blocks.ctx, 256, num_contexts, 512,\n 400.0, num_literals, &mb->literal_split, &mb->literal_histograms,\n &mb->literal_histograms_size);\n }\n if (BROTLI_IS_OOM(m)) return;\n InitBlockSplitterCommand(m, &arena->cmd_blocks, BROTLI_NUM_COMMAND_SYMBOLS,\n 1024, 500.0, n_commands, &mb->command_split, &mb->command_histograms,\n &mb->command_histograms_size);\n if (BROTLI_IS_OOM(m)) return;\n InitBlockSplitterDistance(m, &arena->dist_blocks, 64, 512, 100.0, n_commands,\n &mb->distance_split, &mb->distance_histograms,\n &mb->distance_histograms_size);\n if (BROTLI_IS_OOM(m)) return;\n\n for (i = 0; i < n_commands; ++i) {\n const Command cmd = commands[i];\n size_t j;\n BlockSplitterAddSymbolCommand(&arena->cmd_blocks, cmd.cmd_prefix_);\n for (j = cmd.insert_len_; j != 0; --j) {\n uint8_t literal = ringbuffer[pos & mask];\n if (num_contexts == 1) {\n BlockSplitterAddSymbolLiteral(&arena->lit_blocks.plain, literal);\n } else {\n size_t context =\n BROTLI_CONTEXT(prev_byte, prev_byte2, literal_context_lut);\n ContextBlockSplitterAddSymbol(&arena->lit_blocks.ctx, m, literal,\n static_context_map[context]);\n if (BROTLI_IS_OOM(m)) return;\n }\n prev_byte2 = prev_byte;\n prev_byte = literal;\n ++pos;\n }\n pos += CommandCopyLen(&cmd);\n if (CommandCopyLen(&cmd)) {\n prev_byte2 = ringbuffer[(pos - 2) & mask];\n prev_byte = ringbuffer[(pos - 1) & mask];\n if (cmd.cmd_prefix_ >= 128) {\n BlockSplitterAddSymbolDistance(\n &arena->dist_blocks, cmd.dist_prefix_ & 0x3FF);\n }\n }\n }\n\n if (num_contexts == 1) {\n BlockSplitterFinishBlockLiteral(\n &arena->lit_blocks.plain, /* is_final = */ BROTLI_TRUE);\n } else {\n ContextBlockSplitterFinishBlock(\n &arena->lit_blocks.ctx, m, /* is_final = */ BROTLI_TRUE);\n if (BROTLI_IS_OOM(m)) return;\n }\n BlockSplitterFinishBlockCommand(\n &arena->cmd_blocks, /* is_final = */ BROTLI_TRUE);\n BlockSplitterFinishBlockDistance(\n &arena->dist_blocks, /* is_final = */ BROTLI_TRUE);\n\n if (num_contexts > 1) {\n MapStaticContexts(m, num_contexts, static_context_map, mb);\n }\n}\n\nvoid BrotliBuildMetaBlockGreedy(MemoryManager* m,\n const uint8_t* ringbuffer,\n size_t pos,\n size_t mask,\n uint8_t prev_byte,\n uint8_t prev_byte2,\n ContextLut literal_context_lut,\n size_t num_contexts,\n const uint32_t* static_context_map,\n const Command* commands,\n size_t n_commands,\n MetaBlockSplit* mb) {\n GreedyMetablockArena* arena = BROTLI_ALLOC(m, GreedyMetablockArena, 1);\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(arena)) return;\n if (num_contexts == 1) {\n BrotliBuildMetaBlockGreedyInternal(m, arena, ringbuffer, pos, mask,\n prev_byte, prev_byte2, literal_context_lut, 1, NULL, commands,\n n_commands, mb);\n } else {\n BrotliBuildMetaBlockGreedyInternal(m, arena, ringbuffer, pos, mask,\n prev_byte, prev_byte2, literal_context_lut, num_contexts,\n static_context_map, commands, n_commands, mb);\n }\n BROTLI_FREE(m, arena);\n}\n\nvoid BrotliOptimizeHistograms(uint32_t num_distance_codes,\n MetaBlockSplit* mb) {\n uint8_t good_for_rle[BROTLI_NUM_COMMAND_SYMBOLS];\n size_t i;\n for (i = 0; i < mb->literal_histograms_size; ++i) {\n BrotliOptimizeHuffmanCountsForRle(256, mb->literal_histograms[i].data_,\n good_for_rle);\n }\n for (i = 0; i < mb->command_histograms_size; ++i) {\n BrotliOptimizeHuffmanCountsForRle(BROTLI_NUM_COMMAND_SYMBOLS,\n mb->command_histograms[i].data_,\n good_for_rle);\n }\n for (i = 0; i < mb->distance_histograms_size; ++i) {\n BrotliOptimizeHuffmanCountsForRle(num_distance_codes,\n mb->distance_histograms[i].data_,\n good_for_rle);\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/metablock.h", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Algorithms for distributing the literals and commands of a metablock between\n block types and contexts. */\n\n#ifndef BROTLI_ENC_METABLOCK_H_\n#define BROTLI_ENC_METABLOCK_H_\n\n#include \"../common/context.h\"\n#include \"../common/platform.h\"\n#include \"block_splitter.h\"\n#include \"command.h\"\n#include \"histogram.h\"\n#include \"memory.h\"\n#include \"params.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define BROTLI_MAX_STATIC_CONTEXTS 13\n\ntypedef struct MetaBlockSplit {\n BlockSplit literal_split;\n BlockSplit command_split;\n BlockSplit distance_split;\n uint32_t* literal_context_map;\n size_t literal_context_map_size;\n uint32_t* distance_context_map;\n size_t distance_context_map_size;\n HistogramLiteral* literal_histograms;\n size_t literal_histograms_size;\n HistogramCommand* command_histograms;\n size_t command_histograms_size;\n HistogramDistance* distance_histograms;\n size_t distance_histograms_size;\n} MetaBlockSplit;\n\nstatic BROTLI_INLINE void InitMetaBlockSplit(MetaBlockSplit* mb) {\n BrotliInitBlockSplit(&mb->literal_split);\n BrotliInitBlockSplit(&mb->command_split);\n BrotliInitBlockSplit(&mb->distance_split);\n mb->literal_context_map = 0;\n mb->literal_context_map_size = 0;\n mb->distance_context_map = 0;\n mb->distance_context_map_size = 0;\n mb->literal_histograms = 0;\n mb->literal_histograms_size = 0;\n mb->command_histograms = 0;\n mb->command_histograms_size = 0;\n mb->distance_histograms = 0;\n mb->distance_histograms_size = 0;\n}\n\nstatic BROTLI_INLINE void DestroyMetaBlockSplit(\n MemoryManager* m, MetaBlockSplit* mb) {\n BrotliDestroyBlockSplit(m, &mb->literal_split);\n BrotliDestroyBlockSplit(m, &mb->command_split);\n BrotliDestroyBlockSplit(m, &mb->distance_split);\n BROTLI_FREE(m, mb->literal_context_map);\n BROTLI_FREE(m, mb->distance_context_map);\n BROTLI_FREE(m, mb->literal_histograms);\n BROTLI_FREE(m, mb->command_histograms);\n BROTLI_FREE(m, mb->distance_histograms);\n}\n\n/* Uses the slow shortest-path block splitter and does context clustering.\n The distance parameters are dynamically selected based on the commands\n which get recomputed under the new distance parameters. The new distance\n parameters are stored into *params. */\nBROTLI_INTERNAL void BrotliBuildMetaBlock(MemoryManager* m,\n const uint8_t* ringbuffer,\n const size_t pos,\n const size_t mask,\n BrotliEncoderParams* params,\n uint8_t prev_byte,\n uint8_t prev_byte2,\n Command* cmds,\n size_t num_commands,\n ContextType literal_context_mode,\n MetaBlockSplit* mb);\n\n/* Uses a fast greedy block splitter that tries to merge current block with the\n last or the second last block and uses a static context clustering which\n is the same for all block types. */\nBROTLI_INTERNAL void BrotliBuildMetaBlockGreedy(\n MemoryManager* m, const uint8_t* ringbuffer, size_t pos, size_t mask,\n uint8_t prev_byte, uint8_t prev_byte2, ContextLut literal_context_lut,\n size_t num_contexts, const uint32_t* static_context_map,\n const Command* commands, size_t n_commands, MetaBlockSplit* mb);\n\nBROTLI_INTERNAL void BrotliOptimizeHistograms(uint32_t num_distance_codes,\n MetaBlockSplit* mb);\n\nBROTLI_INTERNAL void BrotliInitDistanceParams(BrotliDistanceParams* params,\n uint32_t npostfix, uint32_t ndirect, BROTLI_BOOL large_window);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_METABLOCK_H_ */\n" }, { "path": "libs/brotli/enc/metablock_inc.h", "content": "/* NOLINT(build/header_guard) */\n/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* template parameters: FN */\n\n#define HistogramType FN(Histogram)\n\n/* Greedy block splitter for one block category (literal, command or distance).\n*/\ntypedef struct FN(BlockSplitter) {\n /* Alphabet size of particular block category. */\n size_t alphabet_size_;\n /* We collect at least this many symbols for each block. */\n size_t min_block_size_;\n /* We merge histograms A and B if\n entropy(A+B) < entropy(A) + entropy(B) + split_threshold_,\n where A is the current histogram and B is the histogram of the last or the\n second last block type. */\n double split_threshold_;\n\n size_t num_blocks_;\n BlockSplit* split_; /* not owned */\n HistogramType* histograms_; /* not owned */\n size_t* histograms_size_; /* not owned */\n\n /* Temporary storage for BlockSplitterFinishBlock. */\n HistogramType combined_histo[2];\n\n /* The number of symbols that we want to collect before deciding on whether\n or not to merge the block with a previous one or emit a new block. */\n size_t target_block_size_;\n /* The number of symbols in the current histogram. */\n size_t block_size_;\n /* Offset of the current histogram. */\n size_t curr_histogram_ix_;\n /* Offset of the histograms of the previous two block types. */\n size_t last_histogram_ix_[2];\n /* Entropy of the previous two block types. */\n double last_entropy_[2];\n /* The number of times we merged the current block with the last one. */\n size_t merge_last_count_;\n} FN(BlockSplitter);\n\nstatic void FN(InitBlockSplitter)(\n MemoryManager* m, FN(BlockSplitter)* self, size_t alphabet_size,\n size_t min_block_size, double split_threshold, size_t num_symbols,\n BlockSplit* split, HistogramType** histograms, size_t* histograms_size) {\n size_t max_num_blocks = num_symbols / min_block_size + 1;\n /* We have to allocate one more histogram than the maximum number of block\n types for the current histogram when the meta-block is too big. */\n size_t max_num_types =\n BROTLI_MIN(size_t, max_num_blocks, BROTLI_MAX_NUMBER_OF_BLOCK_TYPES + 1);\n self->alphabet_size_ = alphabet_size;\n self->min_block_size_ = min_block_size;\n self->split_threshold_ = split_threshold;\n self->num_blocks_ = 0;\n self->split_ = split;\n self->histograms_size_ = histograms_size;\n self->target_block_size_ = min_block_size;\n self->block_size_ = 0;\n self->curr_histogram_ix_ = 0;\n self->merge_last_count_ = 0;\n BROTLI_ENSURE_CAPACITY(m, uint8_t,\n split->types, split->types_alloc_size, max_num_blocks);\n BROTLI_ENSURE_CAPACITY(m, uint32_t,\n split->lengths, split->lengths_alloc_size, max_num_blocks);\n if (BROTLI_IS_OOM(m)) return;\n self->split_->num_blocks = max_num_blocks;\n BROTLI_DCHECK(*histograms == 0);\n *histograms_size = max_num_types;\n *histograms = BROTLI_ALLOC(m, HistogramType, *histograms_size);\n self->histograms_ = *histograms;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(*histograms)) return;\n /* Clear only current histogram. */\n FN(HistogramClear)(&self->histograms_[0]);\n self->last_histogram_ix_[0] = self->last_histogram_ix_[1] = 0;\n}\n\n/* Does either of three things:\n (1) emits the current block with a new block type;\n (2) emits the current block with the type of the second last block;\n (3) merges the current block with the last block. */\nstatic void FN(BlockSplitterFinishBlock)(\n FN(BlockSplitter)* self, BROTLI_BOOL is_final) {\n BlockSplit* split = self->split_;\n double* last_entropy = self->last_entropy_;\n HistogramType* histograms = self->histograms_;\n self->block_size_ =\n BROTLI_MAX(size_t, self->block_size_, self->min_block_size_);\n if (self->num_blocks_ == 0) {\n /* Create first block. */\n split->lengths[0] = (uint32_t)self->block_size_;\n split->types[0] = 0;\n last_entropy[0] =\n BrotliBitsEntropy(histograms[0].data_, self->alphabet_size_);\n last_entropy[1] = last_entropy[0];\n ++self->num_blocks_;\n ++split->num_types;\n ++self->curr_histogram_ix_;\n if (self->curr_histogram_ix_ < *self->histograms_size_)\n FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);\n self->block_size_ = 0;\n } else if (self->block_size_ > 0) {\n double entropy = BrotliBitsEntropy(\n histograms[self->curr_histogram_ix_].data_, self->alphabet_size_);\n double combined_entropy[2];\n double diff[2];\n size_t j;\n for (j = 0; j < 2; ++j) {\n size_t last_histogram_ix = self->last_histogram_ix_[j];\n self->combined_histo[j] = histograms[self->curr_histogram_ix_];\n FN(HistogramAddHistogram)(&self->combined_histo[j],\n &histograms[last_histogram_ix]);\n combined_entropy[j] = BrotliBitsEntropy(\n &self->combined_histo[j].data_[0], self->alphabet_size_);\n diff[j] = combined_entropy[j] - entropy - last_entropy[j];\n }\n\n if (split->num_types < BROTLI_MAX_NUMBER_OF_BLOCK_TYPES &&\n diff[0] > self->split_threshold_ &&\n diff[1] > self->split_threshold_) {\n /* Create new block. */\n split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;\n split->types[self->num_blocks_] = (uint8_t)split->num_types;\n self->last_histogram_ix_[1] = self->last_histogram_ix_[0];\n self->last_histogram_ix_[0] = (uint8_t)split->num_types;\n last_entropy[1] = last_entropy[0];\n last_entropy[0] = entropy;\n ++self->num_blocks_;\n ++split->num_types;\n ++self->curr_histogram_ix_;\n if (self->curr_histogram_ix_ < *self->histograms_size_)\n FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);\n self->block_size_ = 0;\n self->merge_last_count_ = 0;\n self->target_block_size_ = self->min_block_size_;\n } else if (diff[1] < diff[0] - 20.0) {\n /* Combine this block with second last block. */\n split->lengths[self->num_blocks_] = (uint32_t)self->block_size_;\n split->types[self->num_blocks_] = split->types[self->num_blocks_ - 2];\n BROTLI_SWAP(size_t, self->last_histogram_ix_, 0, 1);\n histograms[self->last_histogram_ix_[0]] = self->combined_histo[1];\n last_entropy[1] = last_entropy[0];\n last_entropy[0] = combined_entropy[1];\n ++self->num_blocks_;\n self->block_size_ = 0;\n FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);\n self->merge_last_count_ = 0;\n self->target_block_size_ = self->min_block_size_;\n } else {\n /* Combine this block with last block. */\n split->lengths[self->num_blocks_ - 1] += (uint32_t)self->block_size_;\n histograms[self->last_histogram_ix_[0]] = self->combined_histo[0];\n last_entropy[0] = combined_entropy[0];\n if (split->num_types == 1) {\n last_entropy[1] = last_entropy[0];\n }\n self->block_size_ = 0;\n FN(HistogramClear)(&histograms[self->curr_histogram_ix_]);\n if (++self->merge_last_count_ > 1) {\n self->target_block_size_ += self->min_block_size_;\n }\n }\n }\n if (is_final) {\n *self->histograms_size_ = split->num_types;\n split->num_blocks = self->num_blocks_;\n }\n}\n\n/* Adds the next symbol to the current histogram. When the current histogram\n reaches the target size, decides on merging the block. */\nstatic void FN(BlockSplitterAddSymbol)(FN(BlockSplitter)* self, size_t symbol) {\n FN(HistogramAdd)(&self->histograms_[self->curr_histogram_ix_], symbol);\n ++self->block_size_;\n if (self->block_size_ == self->target_block_size_) {\n FN(BlockSplitterFinishBlock)(self, /* is_final = */ BROTLI_FALSE);\n }\n}\n\n#undef HistogramType\n" }, { "path": "libs/brotli/enc/params.h", "content": "/* Copyright 2017 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Parameters for the Brotli encoder with chosen quality levels. */\n\n#ifndef BROTLI_ENC_PARAMS_H_\n#define BROTLI_ENC_PARAMS_H_\n\n#include \n#include \"encoder_dict.h\"\n\ntypedef struct BrotliHasherParams {\n int type;\n int bucket_bits;\n int block_bits;\n int num_last_distances_to_check;\n} BrotliHasherParams;\n\ntypedef struct BrotliDistanceParams {\n uint32_t distance_postfix_bits;\n uint32_t num_direct_distance_codes;\n uint32_t alphabet_size_max;\n uint32_t alphabet_size_limit;\n size_t max_distance;\n} BrotliDistanceParams;\n\n/* Encoding parameters */\ntypedef struct BrotliEncoderParams {\n BrotliEncoderMode mode;\n int quality;\n int lgwin;\n int lgblock;\n size_t stream_offset;\n size_t size_hint;\n BROTLI_BOOL disable_literal_context_modeling;\n BROTLI_BOOL large_window;\n BrotliHasherParams hasher;\n BrotliDistanceParams dist;\n /* TODO(eustas): rename to BrotliShared... */\n SharedEncoderDictionary dictionary;\n} BrotliEncoderParams;\n\n#endif /* BROTLI_ENC_PARAMS_H_ */\n" }, { "path": "libs/brotli/enc/prefix.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Functions for encoding of integers into prefix codes the amount of extra\n bits, and the actual values of the extra bits. */\n\n#ifndef BROTLI_ENC_PREFIX_H_\n#define BROTLI_ENC_PREFIX_H_\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"fast_log.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* Here distance_code is an intermediate code, i.e. one of the special codes or\n the actual distance increased by BROTLI_NUM_DISTANCE_SHORT_CODES - 1. */\nstatic BROTLI_INLINE void PrefixEncodeCopyDistance(size_t distance_code,\n size_t num_direct_codes,\n size_t postfix_bits,\n uint16_t* code,\n uint32_t* extra_bits) {\n if (distance_code < BROTLI_NUM_DISTANCE_SHORT_CODES + num_direct_codes) {\n *code = (uint16_t)distance_code;\n *extra_bits = 0;\n return;\n } else {\n size_t dist = ((size_t)1 << (postfix_bits + 2u)) +\n (distance_code - BROTLI_NUM_DISTANCE_SHORT_CODES - num_direct_codes);\n size_t bucket = Log2FloorNonZero(dist) - 1;\n size_t postfix_mask = (1u << postfix_bits) - 1;\n size_t postfix = dist & postfix_mask;\n size_t prefix = (dist >> bucket) & 1;\n size_t offset = (2 + prefix) << bucket;\n size_t nbits = bucket - postfix_bits;\n *code = (uint16_t)((nbits << 10) |\n (BROTLI_NUM_DISTANCE_SHORT_CODES + num_direct_codes +\n ((2 * (nbits - 1) + prefix) << postfix_bits) + postfix));\n *extra_bits = (uint32_t)((dist - offset) >> postfix_bits);\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_PREFIX_H_ */\n" }, { "path": "libs/brotli/enc/quality.h", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Constants and formulas that affect speed-ratio trade-offs and thus define\n quality levels. */\n\n#ifndef BROTLI_ENC_QUALITY_H_\n#define BROTLI_ENC_QUALITY_H_\n\n#include \"../common/platform.h\"\n#include \n#include \"params.h\"\n\n#define FAST_ONE_PASS_COMPRESSION_QUALITY 0\n#define FAST_TWO_PASS_COMPRESSION_QUALITY 1\n#define ZOPFLIFICATION_QUALITY 10\n#define HQ_ZOPFLIFICATION_QUALITY 11\n\n#define MAX_QUALITY_FOR_STATIC_ENTROPY_CODES 2\n#define MIN_QUALITY_FOR_BLOCK_SPLIT 4\n#define MIN_QUALITY_FOR_NONZERO_DISTANCE_PARAMS 4\n#define MIN_QUALITY_FOR_OPTIMIZE_HISTOGRAMS 4\n#define MIN_QUALITY_FOR_EXTENSIVE_REFERENCE_SEARCH 5\n#define MIN_QUALITY_FOR_CONTEXT_MODELING 5\n#define MIN_QUALITY_FOR_HQ_CONTEXT_MODELING 7\n#define MIN_QUALITY_FOR_HQ_BLOCK_SPLITTING 10\n\n/* For quality below MIN_QUALITY_FOR_BLOCK_SPLIT there is no block splitting,\n so we buffer at most this much literals and commands. */\n#define MAX_NUM_DELAYED_SYMBOLS 0x2FFF\n\n/* Returns hash-table size for quality levels 0 and 1. */\nstatic BROTLI_INLINE size_t MaxHashTableSize(int quality) {\n return quality == FAST_ONE_PASS_COMPRESSION_QUALITY ? 1 << 15 : 1 << 17;\n}\n\n/* The maximum length for which the zopflification uses distinct distances. */\n#define MAX_ZOPFLI_LEN_QUALITY_10 150\n#define MAX_ZOPFLI_LEN_QUALITY_11 325\n\n/* Do not thoroughly search when a long copy is found. */\n#define BROTLI_LONG_COPY_QUICK_STEP 16384\n\nstatic BROTLI_INLINE size_t MaxZopfliLen(const BrotliEncoderParams* params) {\n return params->quality <= 10 ?\n MAX_ZOPFLI_LEN_QUALITY_10 :\n MAX_ZOPFLI_LEN_QUALITY_11;\n}\n\n/* Number of best candidates to evaluate to expand Zopfli chain. */\nstatic BROTLI_INLINE size_t MaxZopfliCandidates(\n const BrotliEncoderParams* params) {\n return params->quality <= 10 ? 1 : 5;\n}\n\nstatic BROTLI_INLINE void SanitizeParams(BrotliEncoderParams* params) {\n params->quality = BROTLI_MIN(int, BROTLI_MAX_QUALITY,\n BROTLI_MAX(int, BROTLI_MIN_QUALITY, params->quality));\n if (params->quality <= MAX_QUALITY_FOR_STATIC_ENTROPY_CODES) {\n params->large_window = BROTLI_FALSE;\n }\n if (params->lgwin < BROTLI_MIN_WINDOW_BITS) {\n params->lgwin = BROTLI_MIN_WINDOW_BITS;\n } else {\n int max_lgwin = params->large_window ? BROTLI_LARGE_MAX_WINDOW_BITS :\n BROTLI_MAX_WINDOW_BITS;\n if (params->lgwin > max_lgwin) params->lgwin = max_lgwin;\n }\n}\n\n/* Returns optimized lg_block value. */\nstatic BROTLI_INLINE int ComputeLgBlock(const BrotliEncoderParams* params) {\n int lgblock = params->lgblock;\n if (params->quality == FAST_ONE_PASS_COMPRESSION_QUALITY ||\n params->quality == FAST_TWO_PASS_COMPRESSION_QUALITY) {\n lgblock = params->lgwin;\n } else if (params->quality < MIN_QUALITY_FOR_BLOCK_SPLIT) {\n lgblock = 14;\n } else if (lgblock == 0) {\n lgblock = 16;\n if (params->quality >= 9 && params->lgwin > lgblock) {\n lgblock = BROTLI_MIN(int, 18, params->lgwin);\n }\n } else {\n lgblock = BROTLI_MIN(int, BROTLI_MAX_INPUT_BLOCK_BITS,\n BROTLI_MAX(int, BROTLI_MIN_INPUT_BLOCK_BITS, lgblock));\n }\n return lgblock;\n}\n\n/* Returns log2 of the size of main ring buffer area.\n Allocate at least lgwin + 1 bits for the ring buffer so that the newly\n added block fits there completely and we still get lgwin bits and at least\n read_block_size_bits + 1 bits because the copy tail length needs to be\n smaller than ring-buffer size. */\nstatic BROTLI_INLINE int ComputeRbBits(const BrotliEncoderParams* params) {\n return 1 + BROTLI_MAX(int, params->lgwin, params->lgblock);\n}\n\nstatic BROTLI_INLINE size_t MaxMetablockSize(\n const BrotliEncoderParams* params) {\n int bits =\n BROTLI_MIN(int, ComputeRbBits(params), BROTLI_MAX_INPUT_BLOCK_BITS);\n return (size_t)1 << bits;\n}\n\n/* When searching for backward references and have not seen matches for a long\n time, we can skip some match lookups. Unsuccessful match lookups are very\n expensive and this kind of a heuristic speeds up compression quite a lot.\n At first 8 byte strides are taken and every second byte is put to hasher.\n After 4x more literals stride by 16 bytes, every put 4-th byte to hasher.\n Applied only to qualities 2 to 9. */\nstatic BROTLI_INLINE size_t LiteralSpreeLengthForSparseSearch(\n const BrotliEncoderParams* params) {\n return params->quality < 9 ? 64 : 512;\n}\n\n/* Quality to hasher mapping:\n\n - q02: h02 (longest_match_quickly), b16, l5\n\n - q03: h03 (longest_match_quickly), b17, l5\n\n - q04: h04 (longest_match_quickly), b17, l5\n - q04: h54 (longest_match_quickly), b20, l7 | for large files\n\n - q05: h58 (longest_match_simd ), b14, l4\n - q05: h68 (longest_match64_simd ), b15, l5 | for large files\n - q05: h40 (forgetful_chain ), b15, l4 | for small window\n\n - q06: h58 (longest_match_simd ), b14, l4\n - q06: h68 (longest_match64_simd ), b15, l5 | for large files\n - q06: h40 (forgetful_chain ), b15, l4 | for small window\n\n - q07: h58 (longest_match_simd ), b15, l4\n - q07: h68 (longest_match64_simd ), b15, l5 | for large files\n - q07: h41 (forgetful_chain ), b15, l4 | for small window\n\n - q08: h05 (longest_match ), b15, l4\n - q08: h06 (longest_match64 ), b15, l5 | for large files\n - q08: h41 (forgetful_chain ), b15, l4 | for small window\n\n - q09: h05 (longest_match ), b15, l4\n - q09: h06 (longest_match64 ), b15, l5 | for large files\n - q09: h42 (forgetful_chain ), b15, l4 | for small window\n\n - q10: t10 (to_binary_tree ), b17, l128\n\n - q11: t10 (to_binary_tree ), b17, l128\n\n Where \"q\" is quality, \"h\" is hasher type, \"b\" is bucket bits,\n \"l\" is source len. */\nstatic BROTLI_INLINE void ChooseHasher(const BrotliEncoderParams* params,\n BrotliHasherParams* hparams) {\n if (params->quality > 9) {\n hparams->type = 10;\n } else if (params->quality == 4 && params->size_hint >= (1 << 20)) {\n hparams->type = 54;\n } else if (params->quality < 5) {\n hparams->type = params->quality;\n } else if (params->lgwin <= 16) {\n hparams->type = params->quality < 7 ? 40 : params->quality < 9 ? 41 : 42;\n } else if (params->size_hint >= (1 << 20) && params->lgwin >= 19) {\n#if defined(BROTLI_MAX_SIMD_QUALITY)\n hparams->type = params->quality <= BROTLI_MAX_SIMD_QUALITY ? 68 : 6;\n#else\n hparams->type = 6;\n#endif\n hparams->block_bits = params->quality - 1;\n hparams->bucket_bits = 15;\n hparams->num_last_distances_to_check =\n params->quality < 7 ? 4 : params->quality < 9 ? 10 : 16;\n } else {\n /* TODO(eustas): often previous setting (H6) is faster and denser; consider\n adding an option to use it. */\n#if defined(BROTLI_MAX_SIMD_QUALITY)\n hparams->type = params->quality <= BROTLI_MAX_SIMD_QUALITY ? 58 : 5;\n#else\n hparams->type = 5;\n#endif\n hparams->block_bits = params->quality - 1;\n hparams->bucket_bits = params->quality < 7 ? 14 : 15;\n hparams->num_last_distances_to_check =\n params->quality < 7 ? 4 : params->quality < 9 ? 10 : 16;\n }\n\n if (params->lgwin > 24) {\n /* Different hashers for large window brotli: not for qualities <= 2,\n these are too fast for large window. Not for qualities >= 10: their\n hasher already works well with large window. So the changes are:\n H3 --> H35: for quality 3.\n H54 --> H55: for quality 4 with size hint > 1MB\n H6/H68 --> H65: for qualities 5, 6, 7, 8, 9. */\n if (hparams->type == 3) {\n hparams->type = 35;\n }\n if (hparams->type == 54) {\n hparams->type = 55;\n }\n if (hparams->type == 6 || hparams->type == 68) {\n hparams->type = 65;\n }\n }\n}\n\n#endif /* BROTLI_ENC_QUALITY_H_ */\n" }, { "path": "libs/brotli/enc/ringbuffer.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Sliding window over the input data. */\n\n#ifndef BROTLI_ENC_RINGBUFFER_H_\n#define BROTLI_ENC_RINGBUFFER_H_\n\n#include \"../common/platform.h\"\n#include \"memory.h\"\n#include \"params.h\"\n#include \"quality.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* A RingBuffer(window_bits, tail_bits) contains `1 << window_bits' bytes of\n data in a circular manner: writing a byte writes it to:\n `position() % (1 << window_bits)'.\n For convenience, the RingBuffer array contains another copy of the\n first `1 << tail_bits' bytes:\n buffer_[i] == buffer_[i + (1 << window_bits)], if i < (1 << tail_bits),\n and another copy of the last two bytes:\n buffer_[-1] == buffer_[(1 << window_bits) - 1] and\n buffer_[-2] == buffer_[(1 << window_bits) - 2]. */\ntypedef struct RingBuffer {\n /* Size of the ring-buffer is (1 << window_bits) + tail_size_. */\n const uint32_t size_;\n const uint32_t mask_;\n const uint32_t tail_size_;\n const uint32_t total_size_;\n\n uint32_t cur_size_;\n /* Position to write in the ring buffer. */\n uint32_t pos_;\n /* The actual ring buffer containing the copy of the last two bytes, the data,\n and the copy of the beginning as a tail. */\n uint8_t* data_;\n /* The start of the ring-buffer. */\n uint8_t* buffer_;\n} RingBuffer;\n\nstatic BROTLI_INLINE void RingBufferInit(RingBuffer* rb) {\n rb->cur_size_ = 0;\n rb->pos_ = 0;\n rb->data_ = 0;\n rb->buffer_ = 0;\n}\n\nstatic BROTLI_INLINE void RingBufferSetup(\n const BrotliEncoderParams* params, RingBuffer* rb) {\n int window_bits = ComputeRbBits(params);\n int tail_bits = params->lgblock;\n *(uint32_t*)&rb->size_ = 1u << window_bits;\n *(uint32_t*)&rb->mask_ = (1u << window_bits) - 1;\n *(uint32_t*)&rb->tail_size_ = 1u << tail_bits;\n *(uint32_t*)&rb->total_size_ = rb->size_ + rb->tail_size_;\n}\n\nstatic BROTLI_INLINE void RingBufferFree(MemoryManager* m, RingBuffer* rb) {\n BROTLI_FREE(m, rb->data_);\n}\n\n/* Allocates or re-allocates data_ to the given length + plus some slack\n region before and after. Fills the slack regions with zeros. */\nstatic BROTLI_INLINE void RingBufferInitBuffer(\n MemoryManager* m, const uint32_t buflen, RingBuffer* rb) {\n static const size_t kSlackForEightByteHashingEverywhere = 7;\n uint8_t* new_data = BROTLI_ALLOC(\n m, uint8_t, 2 + buflen + kSlackForEightByteHashingEverywhere);\n size_t i;\n if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(new_data)) return;\n if (rb->data_) {\n memcpy(new_data, rb->data_,\n 2 + rb->cur_size_ + kSlackForEightByteHashingEverywhere);\n BROTLI_FREE(m, rb->data_);\n }\n rb->data_ = new_data;\n rb->cur_size_ = buflen;\n rb->buffer_ = rb->data_ + 2;\n rb->buffer_[-2] = rb->buffer_[-1] = 0;\n for (i = 0; i < kSlackForEightByteHashingEverywhere; ++i) {\n rb->buffer_[rb->cur_size_ + i] = 0;\n }\n}\n\nstatic BROTLI_INLINE void RingBufferWriteTail(\n const uint8_t* bytes, size_t n, RingBuffer* rb) {\n const size_t masked_pos = rb->pos_ & rb->mask_;\n if (BROTLI_PREDICT_FALSE(masked_pos < rb->tail_size_)) {\n /* Just fill the tail buffer with the beginning data. */\n const size_t p = rb->size_ + masked_pos;\n memcpy(&rb->buffer_[p], bytes,\n BROTLI_MIN(size_t, n, rb->tail_size_ - masked_pos));\n }\n}\n\n/* Push bytes into the ring buffer. */\nstatic BROTLI_INLINE void RingBufferWrite(\n MemoryManager* m, const uint8_t* bytes, size_t n, RingBuffer* rb) {\n if (rb->pos_ == 0 && n < rb->tail_size_) {\n /* Special case for the first write: to process the first block, we don't\n need to allocate the whole ring-buffer and we don't need the tail\n either. However, we do this memory usage optimization only if the\n first write is less than the tail size, which is also the input block\n size, otherwise it is likely that other blocks will follow and we\n will need to reallocate to the full size anyway. */\n rb->pos_ = (uint32_t)n;\n RingBufferInitBuffer(m, rb->pos_, rb);\n if (BROTLI_IS_OOM(m)) return;\n memcpy(rb->buffer_, bytes, n);\n return;\n }\n if (rb->cur_size_ < rb->total_size_) {\n /* Lazily allocate the full buffer. */\n RingBufferInitBuffer(m, rb->total_size_, rb);\n if (BROTLI_IS_OOM(m)) return;\n /* Initialize the last two bytes to zero, so that we don't have to worry\n later when we copy the last two bytes to the first two positions. */\n rb->buffer_[rb->size_ - 2] = 0;\n rb->buffer_[rb->size_ - 1] = 0;\n /* Initialize tail; might be touched by \"best_len++\" optimization when\n ring buffer is \"full\". */\n rb->buffer_[rb->size_] = 241;\n }\n {\n const size_t masked_pos = rb->pos_ & rb->mask_;\n /* The length of the writes is limited so that we do not need to worry\n about a write */\n RingBufferWriteTail(bytes, n, rb);\n if (BROTLI_PREDICT_TRUE(masked_pos + n <= rb->size_)) {\n /* A single write fits. */\n memcpy(&rb->buffer_[masked_pos], bytes, n);\n } else {\n /* Split into two writes.\n Copy into the end of the buffer, including the tail buffer. */\n memcpy(&rb->buffer_[masked_pos], bytes,\n BROTLI_MIN(size_t, n, rb->total_size_ - masked_pos));\n /* Copy into the beginning of the buffer */\n memcpy(&rb->buffer_[0], bytes + (rb->size_ - masked_pos),\n n - (rb->size_ - masked_pos));\n }\n }\n {\n BROTLI_BOOL not_first_lap = (rb->pos_ & (1u << 31)) != 0;\n uint32_t rb_pos_mask = (1u << 31) - 1;\n rb->buffer_[-2] = rb->buffer_[rb->size_ - 2];\n rb->buffer_[-1] = rb->buffer_[rb->size_ - 1];\n rb->pos_ = (rb->pos_ & rb_pos_mask) + (uint32_t)(n & rb_pos_mask);\n if (not_first_lap) {\n /* Wrap, but preserve not-a-first-lap feature. */\n rb->pos_ |= 1u << 31;\n }\n }\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_RINGBUFFER_H_ */\n" }, { "path": "libs/brotli/enc/state.h", "content": "/* Copyright 2022 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Encoder state. */\n\n#ifndef BROTLI_ENC_STATE_H_\n#define BROTLI_ENC_STATE_H_\n\n#include \"../common/constants.h\"\n#include \"../common/platform.h\"\n#include \"command.h\"\n#include \"compress_fragment.h\"\n#include \"compress_fragment_two_pass.h\"\n#include \"hash.h\"\n#include \"memory.h\"\n#include \"params.h\"\n#include \"ringbuffer.h\"\n\ntypedef enum BrotliEncoderStreamState {\n /* Default state. */\n BROTLI_STREAM_PROCESSING = 0,\n /* Intermediate state; after next block is emitted, byte-padding should be\n performed before getting back to default state. */\n BROTLI_STREAM_FLUSH_REQUESTED = 1,\n /* Last metablock was produced; no more input is acceptable. */\n BROTLI_STREAM_FINISHED = 2,\n /* Flushing compressed block and writing meta-data block header. */\n BROTLI_STREAM_METADATA_HEAD = 3,\n /* Writing metadata block body. */\n BROTLI_STREAM_METADATA_BODY = 4\n} BrotliEncoderStreamState;\n\ntypedef enum BrotliEncoderFlintState {\n BROTLI_FLINT_NEEDS_2_BYTES = 2,\n BROTLI_FLINT_NEEDS_1_BYTE = 1,\n BROTLI_FLINT_WAITING_FOR_PROCESSING = 0,\n BROTLI_FLINT_WAITING_FOR_FLUSHING = -1,\n BROTLI_FLINT_DONE = -2\n} BrotliEncoderFlintState;\n\ntypedef struct BrotliEncoderStateStruct {\n BrotliEncoderParams params;\n\n MemoryManager memory_manager_;\n\n uint64_t input_pos_;\n RingBuffer ringbuffer_;\n size_t cmd_alloc_size_;\n Command* commands_;\n size_t num_commands_;\n size_t num_literals_;\n size_t last_insert_len_;\n uint64_t last_flush_pos_;\n uint64_t last_processed_pos_;\n int dist_cache_[BROTLI_NUM_DISTANCE_SHORT_CODES];\n int saved_dist_cache_[4];\n uint16_t last_bytes_;\n uint8_t last_bytes_bits_;\n /* \"Flint\" is a tiny uncompressed block emitted before the continuation\n block to unwire literal context from previous data. Despite being int8_t,\n field is actually BrotliEncoderFlintState enum. */\n int8_t flint_;\n uint8_t prev_byte_;\n uint8_t prev_byte2_;\n size_t storage_size_;\n uint8_t* storage_;\n\n Hasher hasher_;\n\n /* Hash table for FAST_ONE_PASS_COMPRESSION_QUALITY mode. */\n int small_table_[1 << 10]; /* 4KiB */\n int* large_table_; /* Allocated only when needed */\n size_t large_table_size_;\n\n BrotliOnePassArena* one_pass_arena_;\n BrotliTwoPassArena* two_pass_arena_;\n\n /* Command and literal buffers for FAST_TWO_PASS_COMPRESSION_QUALITY. */\n uint32_t* command_buf_;\n uint8_t* literal_buf_;\n\n uint64_t total_in_;\n uint8_t* next_out_;\n size_t available_out_;\n uint64_t total_out_;\n /* Temporary buffer for padding flush bits or metadata block header / body. */\n union {\n uint64_t u64[2];\n uint8_t u8[16];\n } tiny_buf_;\n uint32_t remaining_metadata_bytes_;\n BrotliEncoderStreamState stream_state_;\n\n BROTLI_BOOL is_last_block_emitted_;\n BROTLI_BOOL is_initialized_;\n} BrotliEncoderStateStruct;\n\ntypedef struct BrotliEncoderStateStruct BrotliEncoderStateInternal;\n#define BrotliEncoderState BrotliEncoderStateInternal\n\n#endif // BROTLI_ENC_STATE_H_\n" }, { "path": "libs/brotli/enc/static_dict.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"static_dict.h\"\n\n#include \"../common/dictionary.h\"\n#include \"../common/platform.h\"\n#include \"../common/transform.h\"\n#include \"encoder_dict.h\"\n#include \"find_match_length.h\"\n#include \"hash_base.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic BROTLI_INLINE void AddMatch(size_t distance, size_t len, size_t len_code,\n uint32_t* matches) {\n uint32_t match = (uint32_t)((distance << 5) + len_code);\n matches[len] = BROTLI_MIN(uint32_t, matches[len], match);\n}\n\nstatic BROTLI_INLINE size_t DictMatchLength(const BrotliDictionary* dictionary,\n const uint8_t* data,\n size_t id,\n size_t len,\n size_t maxlen) {\n const size_t offset = dictionary->offsets_by_length[len] + len * id;\n return FindMatchLengthWithLimit(&dictionary->data[offset], data,\n BROTLI_MIN(size_t, len, maxlen));\n}\n\nstatic BROTLI_INLINE BROTLI_BOOL IsMatch(const BrotliDictionary* dictionary,\n DictWord w, const uint8_t* data, size_t max_length) {\n if (w.len > max_length) {\n return BROTLI_FALSE;\n } else {\n const size_t offset = dictionary->offsets_by_length[w.len] +\n (size_t)w.len * (size_t)w.idx;\n const uint8_t* dict = &dictionary->data[offset];\n if (w.transform == 0) {\n /* Match against base dictionary word. */\n return\n TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len);\n } else if (w.transform == 10) {\n /* Match against uppercase first transform.\n Note that there are only ASCII uppercase words in the lookup table. */\n return TO_BROTLI_BOOL(dict[0] >= 'a' && dict[0] <= 'z' &&\n (dict[0] ^ 32) == data[0] &&\n FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) ==\n w.len - 1u);\n } else {\n /* Match against uppercase all transform.\n Note that there are only ASCII uppercase words in the lookup table. */\n size_t i;\n for (i = 0; i < w.len; ++i) {\n if (dict[i] >= 'a' && dict[i] <= 'z') {\n if ((dict[i] ^ 32) != data[i]) return BROTLI_FALSE;\n } else {\n if (dict[i] != data[i]) return BROTLI_FALSE;\n }\n }\n return BROTLI_TRUE;\n }\n }\n}\n\n/* Finds matches for a single static dictionary */\nstatic BROTLI_BOOL BrotliFindAllStaticDictionaryMatchesFor(\n const BrotliEncoderDictionary* dictionary, const uint8_t* data,\n size_t min_length, size_t max_length, uint32_t* matches) {\n BROTLI_BOOL has_found_match = BROTLI_FALSE;\n#if defined(BROTLI_EXPERIMENTAL)\n if (dictionary->has_words_heavy) {\n const BrotliTrieNode* node = &dictionary->trie.root;\n size_t l = 0;\n while (node && l < max_length) {\n uint8_t c;\n if (l >= min_length && node->len_) {\n AddMatch(node->idx_, l, node->len_, matches);\n has_found_match = BROTLI_TRUE;\n }\n c = data[l++];\n node = BrotliTrieSub(&dictionary->trie, node, c);\n }\n return has_found_match;\n }\n#endif /* BROTLI_EXPERIMENTAL */\n {\n size_t offset = dictionary->buckets[Hash15(data)];\n BROTLI_BOOL end = !offset;\n while (!end) {\n DictWord w = dictionary->dict_words[offset++];\n const size_t l = w.len & 0x1F;\n const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];\n const size_t id = w.idx;\n end = !!(w.len & 0x80);\n w.len = (uint8_t)l;\n if (w.transform == 0) {\n const size_t matchlen =\n DictMatchLength(dictionary->words, data, id, l, max_length);\n const uint8_t* s;\n size_t minlen;\n size_t maxlen;\n size_t len;\n /* Transform \"\" + BROTLI_TRANSFORM_IDENTITY + \"\" */\n if (matchlen == l) {\n AddMatch(id, l, l, matches);\n has_found_match = BROTLI_TRUE;\n }\n /* Transforms \"\" + BROTLI_TRANSFORM_OMIT_LAST_1 + \"\" and\n \"\" + BROTLI_TRANSFORM_OMIT_LAST_1 + \"ing \" */\n if (matchlen >= l - 1) {\n AddMatch(id + 12 * n, l - 1, l, matches);\n if (l + 2 < max_length &&\n data[l - 1] == 'i' && data[l] == 'n' && data[l + 1] == 'g' &&\n data[l + 2] == ' ') {\n AddMatch(id + 49 * n, l + 3, l, matches);\n }\n has_found_match = BROTLI_TRUE;\n }\n /* Transform \"\" + BROTLI_TRANSFORM_OMIT_LAST_# + \"\" (# = 2 .. 9) */\n minlen = min_length;\n if (l > 9) minlen = BROTLI_MAX(size_t, minlen, l - 9);\n maxlen = BROTLI_MIN(size_t, matchlen, l - 2);\n for (len = minlen; len <= maxlen; ++len) {\n size_t cut = l - len;\n size_t transform_id = (cut << 2) +\n (size_t)((dictionary->cutoffTransforms >> (cut * 6)) & 0x3F);\n AddMatch(id + transform_id * n, len, l, matches);\n has_found_match = BROTLI_TRUE;\n }\n if (matchlen < l || l + 6 >= max_length) {\n continue;\n }\n s = &data[l];\n /* Transforms \"\" + BROTLI_TRANSFORM_IDENTITY + */\n if (s[0] == ' ') {\n AddMatch(id + n, l + 1, l, matches);\n if (s[1] == 'a') {\n if (s[2] == ' ') {\n AddMatch(id + 28 * n, l + 3, l, matches);\n } else if (s[2] == 's') {\n if (s[3] == ' ') AddMatch(id + 46 * n, l + 4, l, matches);\n } else if (s[2] == 't') {\n if (s[3] == ' ') AddMatch(id + 60 * n, l + 4, l, matches);\n } else if (s[2] == 'n') {\n if (s[3] == 'd' && s[4] == ' ') {\n AddMatch(id + 10 * n, l + 5, l, matches);\n }\n }\n } else if (s[1] == 'b') {\n if (s[2] == 'y' && s[3] == ' ') {\n AddMatch(id + 38 * n, l + 4, l, matches);\n }\n } else if (s[1] == 'i') {\n if (s[2] == 'n') {\n if (s[3] == ' ') AddMatch(id + 16 * n, l + 4, l, matches);\n } else if (s[2] == 's') {\n if (s[3] == ' ') AddMatch(id + 47 * n, l + 4, l, matches);\n }\n } else if (s[1] == 'f') {\n if (s[2] == 'o') {\n if (s[3] == 'r' && s[4] == ' ') {\n AddMatch(id + 25 * n, l + 5, l, matches);\n }\n } else if (s[2] == 'r') {\n if (s[3] == 'o' && s[4] == 'm' && s[5] == ' ') {\n AddMatch(id + 37 * n, l + 6, l, matches);\n }\n }\n } else if (s[1] == 'o') {\n if (s[2] == 'f') {\n if (s[3] == ' ') AddMatch(id + 8 * n, l + 4, l, matches);\n } else if (s[2] == 'n') {\n if (s[3] == ' ') AddMatch(id + 45 * n, l + 4, l, matches);\n }\n } else if (s[1] == 'n') {\n if (s[2] == 'o' && s[3] == 't' && s[4] == ' ') {\n AddMatch(id + 80 * n, l + 5, l, matches);\n }\n } else if (s[1] == 't') {\n if (s[2] == 'h') {\n if (s[3] == 'e') {\n if (s[4] == ' ') AddMatch(id + 5 * n, l + 5, l, matches);\n } else if (s[3] == 'a') {\n if (s[4] == 't' && s[5] == ' ') {\n AddMatch(id + 29 * n, l + 6, l, matches);\n }\n }\n } else if (s[2] == 'o') {\n if (s[3] == ' ') AddMatch(id + 17 * n, l + 4, l, matches);\n }\n } else if (s[1] == 'w') {\n if (s[2] == 'i' && s[3] == 't' && s[4] == 'h' && s[5] == ' ') {\n AddMatch(id + 35 * n, l + 6, l, matches);\n }\n }\n } else if (s[0] == '\"') {\n AddMatch(id + 19 * n, l + 1, l, matches);\n if (s[1] == '>') {\n AddMatch(id + 21 * n, l + 2, l, matches);\n }\n } else if (s[0] == '.') {\n AddMatch(id + 20 * n, l + 1, l, matches);\n if (s[1] == ' ') {\n AddMatch(id + 31 * n, l + 2, l, matches);\n if (s[2] == 'T' && s[3] == 'h') {\n if (s[4] == 'e') {\n if (s[5] == ' ') AddMatch(id + 43 * n, l + 6, l, matches);\n } else if (s[4] == 'i') {\n if (s[5] == 's' && s[6] == ' ') {\n AddMatch(id + 75 * n, l + 7, l, matches);\n }\n }\n }\n }\n } else if (s[0] == ',') {\n AddMatch(id + 76 * n, l + 1, l, matches);\n if (s[1] == ' ') {\n AddMatch(id + 14 * n, l + 2, l, matches);\n }\n } else if (s[0] == '\\n') {\n AddMatch(id + 22 * n, l + 1, l, matches);\n if (s[1] == '\\t') {\n AddMatch(id + 50 * n, l + 2, l, matches);\n }\n } else if (s[0] == ']') {\n AddMatch(id + 24 * n, l + 1, l, matches);\n } else if (s[0] == '\\'') {\n AddMatch(id + 36 * n, l + 1, l, matches);\n } else if (s[0] == ':') {\n AddMatch(id + 51 * n, l + 1, l, matches);\n } else if (s[0] == '(') {\n AddMatch(id + 57 * n, l + 1, l, matches);\n } else if (s[0] == '=') {\n if (s[1] == '\"') {\n AddMatch(id + 70 * n, l + 2, l, matches);\n } else if (s[1] == '\\'') {\n AddMatch(id + 86 * n, l + 2, l, matches);\n }\n } else if (s[0] == 'a') {\n if (s[1] == 'l' && s[2] == ' ') {\n AddMatch(id + 84 * n, l + 3, l, matches);\n }\n } else if (s[0] == 'e') {\n if (s[1] == 'd') {\n if (s[2] == ' ') AddMatch(id + 53 * n, l + 3, l, matches);\n } else if (s[1] == 'r') {\n if (s[2] == ' ') AddMatch(id + 82 * n, l + 3, l, matches);\n } else if (s[1] == 's') {\n if (s[2] == 't' && s[3] == ' ') {\n AddMatch(id + 95 * n, l + 4, l, matches);\n }\n }\n } else if (s[0] == 'f') {\n if (s[1] == 'u' && s[2] == 'l' && s[3] == ' ') {\n AddMatch(id + 90 * n, l + 4, l, matches);\n }\n } else if (s[0] == 'i') {\n if (s[1] == 'v') {\n if (s[2] == 'e' && s[3] == ' ') {\n AddMatch(id + 92 * n, l + 4, l, matches);\n }\n } else if (s[1] == 'z') {\n if (s[2] == 'e' && s[3] == ' ') {\n AddMatch(id + 100 * n, l + 4, l, matches);\n }\n }\n } else if (s[0] == 'l') {\n if (s[1] == 'e') {\n if (s[2] == 's' && s[3] == 's' && s[4] == ' ') {\n AddMatch(id + 93 * n, l + 5, l, matches);\n }\n } else if (s[1] == 'y') {\n if (s[2] == ' ') AddMatch(id + 61 * n, l + 3, l, matches);\n }\n } else if (s[0] == 'o') {\n if (s[1] == 'u' && s[2] == 's' && s[3] == ' ') {\n AddMatch(id + 106 * n, l + 4, l, matches);\n }\n }\n } else {\n /* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and\n is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL)\n transform. */\n const BROTLI_BOOL is_all_caps =\n TO_BROTLI_BOOL(w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST);\n const uint8_t* s;\n if (!IsMatch(dictionary->words, w, data, max_length)) {\n continue;\n }\n /* Transform \"\" + kUppercase{First,All} + \"\" */\n AddMatch(id + (is_all_caps ? 44 : 9) * n, l, l, matches);\n has_found_match = BROTLI_TRUE;\n if (l + 1 >= max_length) {\n continue;\n }\n /* Transforms \"\" + kUppercase{First,All} + */\n s = &data[l];\n if (s[0] == ' ') {\n AddMatch(id + (is_all_caps ? 68 : 4) * n, l + 1, l, matches);\n } else if (s[0] == '\"') {\n AddMatch(id + (is_all_caps ? 87 : 66) * n, l + 1, l, matches);\n if (s[1] == '>') {\n AddMatch(id + (is_all_caps ? 97 : 69) * n, l + 2, l, matches);\n }\n } else if (s[0] == '.') {\n AddMatch(id + (is_all_caps ? 101 : 79) * n, l + 1, l, matches);\n if (s[1] == ' ') {\n AddMatch(id + (is_all_caps ? 114 : 88) * n, l + 2, l, matches);\n }\n } else if (s[0] == ',') {\n AddMatch(id + (is_all_caps ? 112 : 99) * n, l + 1, l, matches);\n if (s[1] == ' ') {\n AddMatch(id + (is_all_caps ? 107 : 58) * n, l + 2, l, matches);\n }\n } else if (s[0] == '\\'') {\n AddMatch(id + (is_all_caps ? 94 : 74) * n, l + 1, l, matches);\n } else if (s[0] == '(') {\n AddMatch(id + (is_all_caps ? 113 : 78) * n, l + 1, l, matches);\n } else if (s[0] == '=') {\n if (s[1] == '\"') {\n AddMatch(id + (is_all_caps ? 105 : 104) * n, l + 2, l, matches);\n } else if (s[1] == '\\'') {\n AddMatch(id + (is_all_caps ? 116 : 108) * n, l + 2, l, matches);\n }\n }\n }\n }\n }\n /* Transforms with prefixes \" \" and \".\" */\n if (max_length >= 5 && (data[0] == ' ' || data[0] == '.')) {\n BROTLI_BOOL is_space = TO_BROTLI_BOOL(data[0] == ' ');\n size_t offset = dictionary->buckets[Hash15(&data[1])];\n BROTLI_BOOL end = !offset;\n while (!end) {\n DictWord w = dictionary->dict_words[offset++];\n const size_t l = w.len & 0x1F;\n const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];\n const size_t id = w.idx;\n end = !!(w.len & 0x80);\n w.len = (uint8_t)l;\n if (w.transform == 0) {\n const uint8_t* s;\n if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {\n continue;\n }\n /* Transforms \" \" + BROTLI_TRANSFORM_IDENTITY + \"\" and\n \".\" + BROTLI_TRANSFORM_IDENTITY + \"\" */\n AddMatch(id + (is_space ? 6 : 32) * n, l + 1, l, matches);\n has_found_match = BROTLI_TRUE;\n if (l + 2 >= max_length) {\n continue;\n }\n /* Transforms \" \" + BROTLI_TRANSFORM_IDENTITY + and\n \".\" + BROTLI_TRANSFORM_IDENTITY + \n */\n s = &data[l + 1];\n if (s[0] == ' ') {\n AddMatch(id + (is_space ? 2 : 77) * n, l + 2, l, matches);\n } else if (s[0] == '(') {\n AddMatch(id + (is_space ? 89 : 67) * n, l + 2, l, matches);\n } else if (is_space) {\n if (s[0] == ',') {\n AddMatch(id + 103 * n, l + 2, l, matches);\n if (s[1] == ' ') {\n AddMatch(id + 33 * n, l + 3, l, matches);\n }\n } else if (s[0] == '.') {\n AddMatch(id + 71 * n, l + 2, l, matches);\n if (s[1] == ' ') {\n AddMatch(id + 52 * n, l + 3, l, matches);\n }\n } else if (s[0] == '=') {\n if (s[1] == '\"') {\n AddMatch(id + 81 * n, l + 3, l, matches);\n } else if (s[1] == '\\'') {\n AddMatch(id + 98 * n, l + 3, l, matches);\n }\n }\n }\n } else if (is_space) {\n /* Set is_all_caps=0 for BROTLI_TRANSFORM_UPPERCASE_FIRST and\n is_all_caps=1 otherwise (BROTLI_TRANSFORM_UPPERCASE_ALL)\n transform. */\n const BROTLI_BOOL is_all_caps =\n TO_BROTLI_BOOL(w.transform != BROTLI_TRANSFORM_UPPERCASE_FIRST);\n const uint8_t* s;\n if (!IsMatch(dictionary->words, w, &data[1], max_length - 1)) {\n continue;\n }\n /* Transforms \" \" + kUppercase{First,All} + \"\" */\n AddMatch(id + (is_all_caps ? 85 : 30) * n, l + 1, l, matches);\n has_found_match = BROTLI_TRUE;\n if (l + 2 >= max_length) {\n continue;\n }\n /* Transforms \" \" + kUppercase{First,All} + */\n s = &data[l + 1];\n if (s[0] == ' ') {\n AddMatch(id + (is_all_caps ? 83 : 15) * n, l + 2, l, matches);\n } else if (s[0] == ',') {\n if (!is_all_caps) {\n AddMatch(id + 109 * n, l + 2, l, matches);\n }\n if (s[1] == ' ') {\n AddMatch(id + (is_all_caps ? 111 : 65) * n, l + 3, l, matches);\n }\n } else if (s[0] == '.') {\n AddMatch(id + (is_all_caps ? 115 : 96) * n, l + 2, l, matches);\n if (s[1] == ' ') {\n AddMatch(id + (is_all_caps ? 117 : 91) * n, l + 3, l, matches);\n }\n } else if (s[0] == '=') {\n if (s[1] == '\"') {\n AddMatch(id + (is_all_caps ? 110 : 118) * n, l + 3, l, matches);\n } else if (s[1] == '\\'') {\n AddMatch(id + (is_all_caps ? 119 : 120) * n, l + 3, l, matches);\n }\n }\n }\n }\n }\n if (max_length >= 6) {\n /* Transforms with prefixes \"e \", \"s \", \", \" and \"\\xC2\\xA0\" */\n if ((data[1] == ' ' &&\n (data[0] == 'e' || data[0] == 's' || data[0] == ',')) ||\n (data[0] == 0xC2 && data[1] == 0xA0)) {\n size_t offset = dictionary->buckets[Hash15(&data[2])];\n BROTLI_BOOL end = !offset;\n while (!end) {\n DictWord w = dictionary->dict_words[offset++];\n const size_t l = w.len & 0x1F;\n const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];\n const size_t id = w.idx;\n end = !!(w.len & 0x80);\n w.len = (uint8_t)l;\n if (w.transform == 0 &&\n IsMatch(dictionary->words, w, &data[2], max_length - 2)) {\n if (data[0] == 0xC2) {\n AddMatch(id + 102 * n, l + 2, l, matches);\n has_found_match = BROTLI_TRUE;\n } else if (l + 2 < max_length && data[l + 2] == ' ') {\n size_t t = data[0] == 'e' ? 18 : (data[0] == 's' ? 7 : 13);\n AddMatch(id + t * n, l + 3, l, matches);\n has_found_match = BROTLI_TRUE;\n }\n }\n }\n }\n }\n if (max_length >= 9) {\n /* Transforms with prefixes \" the \" and \".com/\" */\n if ((data[0] == ' ' && data[1] == 't' && data[2] == 'h' &&\n data[3] == 'e' && data[4] == ' ') ||\n (data[0] == '.' && data[1] == 'c' && data[2] == 'o' &&\n data[3] == 'm' && data[4] == '/')) {\n size_t offset = dictionary->buckets[Hash15(&data[5])];\n BROTLI_BOOL end = !offset;\n while (!end) {\n DictWord w = dictionary->dict_words[offset++];\n const size_t l = w.len & 0x1F;\n const size_t n = (size_t)1 << dictionary->words->size_bits_by_length[l];\n const size_t id = w.idx;\n end = !!(w.len & 0x80);\n w.len = (uint8_t)l;\n if (w.transform == 0 &&\n IsMatch(dictionary->words, w, &data[5], max_length - 5)) {\n AddMatch(id + (data[0] == ' ' ? 41 : 72) * n, l + 5, l, matches);\n has_found_match = BROTLI_TRUE;\n if (l + 5 < max_length) {\n const uint8_t* s = &data[l + 5];\n if (data[0] == ' ') {\n if (l + 8 < max_length &&\n s[0] == ' ' && s[1] == 'o' && s[2] == 'f' && s[3] == ' ') {\n AddMatch(id + 62 * n, l + 9, l, matches);\n if (l + 12 < max_length &&\n s[4] == 't' && s[5] == 'h' && s[6] == 'e' && s[7] == ' ') {\n AddMatch(id + 73 * n, l + 13, l, matches);\n }\n }\n }\n }\n }\n }\n }\n }\n return has_found_match;\n}\n\n/* Finds matches for one or more dictionaries, if multiple are present\n in the contextual dictionary */\nBROTLI_BOOL BrotliFindAllStaticDictionaryMatches(\n const BrotliEncoderDictionary* dictionary, const uint8_t* data,\n size_t min_length, size_t max_length, uint32_t* matches) {\n BROTLI_BOOL has_found_match =\n BrotliFindAllStaticDictionaryMatchesFor(\n dictionary, data, min_length, max_length, matches);\n\n if (!!dictionary->parent && dictionary->parent->num_dictionaries > 1) {\n uint32_t matches2[BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1];\n int l;\n const BrotliEncoderDictionary* dictionary2 = dictionary->parent->dict[0];\n if (dictionary2 == dictionary) {\n dictionary2 = dictionary->parent->dict[1];\n }\n\n for (l = 0; l < BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1; l++) {\n matches2[l] = kInvalidMatch;\n }\n\n has_found_match |= BrotliFindAllStaticDictionaryMatchesFor(\n dictionary2, data, min_length, max_length, matches2);\n\n for (l = 0; l < BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1; l++) {\n if (matches2[l] != kInvalidMatch) {\n uint32_t dist = (uint32_t)(matches2[l] >> 5);\n uint32_t len_code = matches2[l] & 31;\n uint32_t skipdist = (uint32_t)((uint32_t)(1 << dictionary->words->\n size_bits_by_length[len_code]) & ~1u) *\n (uint32_t)dictionary->num_transforms;\n /* TODO(lode): check for dist overflow */\n dist += skipdist;\n AddMatch(dist, (size_t)l, len_code, matches);\n }\n }\n }\n return has_found_match;\n}\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/static_dict.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Class to model the static dictionary. */\n\n#ifndef BROTLI_ENC_STATIC_DICT_H_\n#define BROTLI_ENC_STATIC_DICT_H_\n\n#include \"../common/platform.h\"\n\n#include \"encoder_dict.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN 37\nstatic const uint32_t kInvalidMatch = 0xFFFFFFF;\n\n/* Matches data against static dictionary words, and for each length l,\n for which a match is found, updates matches[l] to be the minimum possible\n (distance << 5) + len_code.\n Returns 1 if matches have been found, otherwise 0.\n Prerequisites:\n matches array is at least BROTLI_MAX_STATIC_DICTIONARY_MATCH_LEN + 1 long\n all elements are initialized to kInvalidMatch */\nBROTLI_INTERNAL BROTLI_BOOL BrotliFindAllStaticDictionaryMatches(\n const BrotliEncoderDictionary* dictionary,\n const uint8_t* data, size_t min_length, size_t max_length,\n uint32_t* matches);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_STATIC_DICT_H_ */\n" }, { "path": "libs/brotli/enc/static_dict_lut.c", "content": "/* Copyright 2025 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Lookup table for static dictionary and transforms. */\n\n#include \"static_dict_lut.h\"\n\n#include \"../common/platform.h\" /* IWYU pragma: keep */\n#include \"../common/static_init.h\"\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\n#include \"../common/dictionary.h\"\n#include \"../common/transform.h\"\n#include \"hash_base.h\"\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\n\n/* TODO(eustas): deal with largest bucket(s). Not it contains 163 items. */\nstatic BROTLI_BOOL BROTLI_COLD DoBrotliEncoderInitStaticDictionaryLut(\n const BrotliDictionary* dict, uint16_t* buckets, DictWord* words,\n void* arena) {\n DictWord* slots = (DictWord*)arena;\n uint16_t* heads = (uint16_t*)(slots + BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS);\n uint16_t* counts = heads + BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS;\n uint16_t* prev = counts + BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS;\n size_t next_slot = 0;\n uint8_t transformed_word[24];\n uint8_t transformed_other_word[24];\n size_t l;\n size_t pos;\n size_t i;\n\n memset(counts, 0, BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS * sizeof(uint16_t));\n memset(heads, 0, BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS * sizeof(uint16_t));\n memset(prev, 0, BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS * sizeof(uint16_t));\n\n for (l = 4; l <= 24; ++l) {\n size_t n = 1u << dict->size_bits_by_length[l];\n const uint8_t* dict_words = dict->data + dict->offsets_by_length[l];\n for (i = 0; i < n; ++i) {\n const uint8_t* dict_word = dict_words + l * i;\n uint32_t key = Hash15(dict_word);\n slots[next_slot].len = (uint8_t)l;\n slots[next_slot].transform = BROTLI_TRANSFORM_IDENTITY;\n slots[next_slot].idx = (uint16_t)i;\n prev[next_slot] = heads[key];\n heads[key] = (uint16_t)next_slot;\n counts[key]++;\n ++next_slot;\n }\n for (i = 0; i < n; ++i) {\n uint32_t key;\n uint32_t prefix;\n BROTLI_BOOL found;\n size_t curr;\n const uint8_t* dict_word = dict_words + l * i;\n if (dict_word[0] < 'a' || dict_word[0] > 'z') continue;\n memcpy(transformed_word, dict_word, l);\n transformed_word[0] = transformed_word[0] - 32;\n key = Hash15(transformed_word);\n prefix = BROTLI_UNALIGNED_LOAD32LE(transformed_word) & ~0x20202020u;\n found = BROTLI_FALSE;\n curr = heads[key];\n while (curr != 0) {\n const uint8_t* other_word;\n uint32_t other_prefix;\n if (slots[curr].len != l) break;\n other_word = dict_words + l * slots[curr].idx;\n other_prefix = BROTLI_UNALIGNED_LOAD32LE(other_word) & ~0x20202020u;\n if (prefix == other_prefix) {\n if (memcmp(transformed_word, other_word, l) == 0) {\n found = BROTLI_TRUE;\n break;\n }\n }\n curr = prev[curr];\n }\n if (found) continue;\n slots[next_slot].len = (uint8_t)l;\n slots[next_slot].transform = BROTLI_TRANSFORM_UPPERCASE_FIRST;\n slots[next_slot].idx = (uint16_t)i;\n prev[next_slot] = heads[key];\n heads[key] = (uint16_t)next_slot;\n counts[key]++;\n ++next_slot;\n }\n for (i = 0; i < n; ++i) {\n const uint8_t* dict_word = dict_words + l * i;\n BROTLI_BOOL is_ascii = BROTLI_TRUE;\n BROTLI_BOOL has_lower = BROTLI_FALSE;\n size_t k;\n uint32_t prefix;\n uint32_t key;\n size_t curr;\n BROTLI_BOOL found;\n for (k = 0; k < l; ++k) {\n if (dict_word[k] >= 128) is_ascii = BROTLI_FALSE;\n if (k > 0 && dict_word[k] >= 'a' && dict_word[k] <= 'z')\n has_lower = BROTLI_TRUE;\n }\n if (!is_ascii || !has_lower) continue;\n memcpy(transformed_word, dict_word, l);\n prefix = BROTLI_UNALIGNED_LOAD32LE(transformed_word) & ~0x20202020u;\n for (k = 0; k < l; ++k) {\n if (transformed_word[k] >= 'a' && transformed_word[k] <= 'z') {\n transformed_word[k] = transformed_word[k] - 32;\n }\n }\n key = Hash15(transformed_word);\n found = BROTLI_FALSE;\n curr = heads[key];\n while (curr != 0) {\n const uint8_t* other_word;\n uint32_t other_prefix;\n if (slots[curr].len != l) break;\n other_word = dict_words + l * slots[curr].idx;\n other_prefix = BROTLI_UNALIGNED_LOAD32LE(other_word) & ~0x20202020u;\n if (prefix == other_prefix) {\n if (slots[curr].transform == BROTLI_TRANSFORM_IDENTITY) {\n if (memcmp(transformed_word, other_word, l) == 0) {\n found = BROTLI_TRUE;\n break;\n }\n } else if (slots[curr].transform ==\n BROTLI_TRANSFORM_UPPERCASE_FIRST) {\n if ((transformed_word[0] == (other_word[0] - 32)) &&\n memcmp(transformed_word + 1, other_word + 1, l - 1) == 0) {\n found = BROTLI_TRUE;\n break;\n }\n } else {\n for (k = 0; k < l; ++k) {\n if (other_word[k] >= 'a' && other_word[k] <= 'z') {\n transformed_other_word[k] = other_word[k] - 32;\n } else {\n transformed_other_word[k] = other_word[k];\n }\n }\n if (memcmp(transformed_word, transformed_other_word, l) == 0) {\n found = BROTLI_TRUE;\n break;\n }\n }\n }\n curr = prev[curr];\n }\n if (found) {\n continue;\n }\n slots[next_slot].len = (uint8_t)l;\n slots[next_slot].transform = BROTLI_TRANSFORM_UPPERCASE_ALL;\n slots[next_slot].idx = (uint16_t)i;\n prev[next_slot] = heads[key];\n heads[key] = (uint16_t)next_slot;\n counts[key]++;\n ++next_slot;\n }\n }\n\n if (next_slot != 31704) return BROTLI_FALSE;\n pos = 0;\n /* Unused; makes offsets start from 1. */\n words[pos].len = 0;\n words[pos].transform = 0;\n words[pos].idx = 0;\n pos++;\n for (i = 0; i < BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS; ++i) {\n size_t num_words = counts[i];\n size_t curr;\n if (num_words == 0) {\n buckets[i] = 0;\n continue;\n }\n buckets[i] = (uint16_t)pos;\n curr = heads[i];\n pos += num_words;\n for (size_t k = 0; k < num_words; ++k) {\n words[pos - 1 - k] = slots[curr];\n curr = prev[curr];\n }\n words[pos - 1].len |= 0x80;\n }\n return BROTLI_TRUE;\n}\n\nBROTLI_BOOL BrotliEncoderInitStaticDictionaryLut(\n const BrotliDictionary* dict, uint16_t* buckets, DictWord* words) {\n size_t arena_size =\n BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS *\n (sizeof(uint16_t) + sizeof(DictWord)) +\n BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS * 2 * sizeof(uint16_t);\n void* arena = malloc(arena_size);\n BROTLI_BOOL ok;\n if (arena == NULL) {\n return BROTLI_FALSE;\n }\n ok = DoBrotliEncoderInitStaticDictionaryLut(dict, buckets, words, arena);\n free(arena);\n return ok;\n}\n\nBROTLI_MODEL(\"small\")\nuint16_t kStaticDictionaryBuckets[BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS];\nBROTLI_MODEL(\"small\")\nDictWord kStaticDictionaryWords[BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS];\n\n#else /* BROTLI_STATIC_INIT */\n\n/* Embed kStaticDictionaryBuckets and kStaticDictionaryWords. */\n#include \"static_dict_lut_inc.h\"\n\n#endif /* BROTLI_STATIC_INIT */\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/static_dict_lut.h", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Lookup table for static dictionary and transforms. */\n\n#ifndef BROTLI_ENC_STATIC_DICT_LUT_H_\n#define BROTLI_ENC_STATIC_DICT_LUT_H_\n\n#include \"../common/dictionary.h\"\n#include \"../common/platform.h\"\n#include \"../common/static_init.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\ntypedef struct DictWord {\n /* Highest bit is used to indicate end of bucket. */\n uint8_t len;\n uint8_t transform;\n uint16_t idx;\n} DictWord;\n\n/* Buckets are Hash15 results. */\n#define BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS 32768\n#define BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS 31705\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\nBROTLI_INTERNAL BROTLI_BOOL BrotliEncoderInitStaticDictionaryLut(\n const BrotliDictionary* dictionary, uint16_t* buckets, DictWord* words);\nBROTLI_INTERNAL extern BROTLI_MODEL(\"small\") uint16_t\n kStaticDictionaryBuckets[BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS];\nBROTLI_INTERNAL extern BROTLI_MODEL(\"small\") DictWord\n kStaticDictionaryWords[BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS];\n#else\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\") uint16_t\n kStaticDictionaryBuckets[BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS];\nBROTLI_INTERNAL extern const BROTLI_MODEL(\"small\") DictWord\n kStaticDictionaryWords[BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS];\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_STATIC_DICT_LUT_H_ */\n" }, { "path": "libs/brotli/enc/static_dict_lut_inc.h", "content": "const BROTLI_MODEL(\"small\")\nuint16_t kStaticDictionaryBuckets[BROTLI_ENC_STATIC_DICT_LUT_NUM_BUCKETS] = {\n1,0,0,0,0,0,0,0,0,3,6,0,0,0,0,0,20,0,0,0,21,0,22,0,0,0,0,0,0,0,0,23,0,0,25,0,29,\n0,53,0,0,0,0,0,0,55,0,0,0,0,0,0,61,76,0,0,0,94,0,0,0,0,0,0,96,0,97,0,98,0,0,0,0,\n0,0,0,99,101,106,108,0,0,0,0,0,110,0,111,112,0,113,118,124,0,0,0,0,0,125,128,0,0\n,0,0,129,0,0,131,0,0,0,0,0,0,132,0,0,135,0,0,0,137,0,0,0,0,0,138,139,0,0,0,0,0,0\n,0,142,143,144,0,0,0,0,0,145,0,0,0,146,149,151,152,0,0,153,0,0,0,0,0,0,0,0,0,0,0\n,0,0,0,0,154,0,0,0,0,0,0,155,0,0,0,0,160,182,0,0,0,0,0,0,183,0,0,0,188,189,0,0,\n192,0,0,0,0,0,0,194,0,0,0,0,0,0,0,0,197,202,209,0,0,210,0,224,0,0,0,225,0,0,0,0,\n0,0,0,0,0,0,231,0,0,0,232,0,240,0,0,242,0,0,0,0,0,0,0,0,0,0,0,244,0,0,0,246,0,0,\n249,251,253,0,0,0,0,0,258,0,0,261,263,0,0,0,267,0,0,268,0,269,0,0,0,0,0,0,0,0,0,\n271,0,0,0,0,0,0,272,0,273,0,277,0,278,286,0,0,0,0,287,0,289,290,291,0,0,0,295,0,\n0,296,297,0,0,0,0,0,0,0,0,0,0,298,0,0,0,299,0,0,305,0,324,0,0,0,0,0,327,0,328,\n329,0,0,0,0,336,0,0,340,0,341,342,343,0,0,346,0,348,0,0,0,0,0,0,349,351,0,0,355,\n0,363,0,364,0,368,369,0,370,0,0,0,0,0,0,0,372,0,0,0,0,0,0,0,0,0,0,0,373,0,375,0,\n0,0,0,376,377,0,0,394,395,396,0,0,398,0,0,0,0,400,0,0,408,0,0,0,0,420,0,0,0,0,0,\n0,421,0,0,422,423,0,0,429,435,436,442,0,0,443,0,444,445,453,456,0,457,0,0,0,0,0,\n458,0,0,0,459,0,0,0,460,0,462,463,465,0,0,0,0,0,0,466,469,0,0,0,0,0,0,470,0,0,0,\n474,0,476,0,0,0,0,483,0,485,0,0,0,486,0,0,488,491,492,0,0,497,499,500,0,501,0,0,\n0,505,0,0,506,0,0,0,507,0,0,0,509,0,0,0,0,511,512,519,0,0,0,0,0,0,529,530,0,0,0,\n534,0,0,0,0,543,0,0,0,0,0,0,0,0,0,553,0,0,0,0,557,560,0,0,0,0,0,0,561,0,564,0,0,\n0,0,0,0,565,566,0,575,0,619,0,620,0,0,623,624,0,0,0,625,0,0,626,627,0,0,628,0,0,\n0,0,630,0,631,0,0,0,0,0,0,0,0,0,641,0,0,0,0,643,656,668,0,0,0,673,0,0,0,674,0,0,\n0,0,0,0,0,0,682,0,687,0,690,0,693,699,700,0,0,0,0,0,0,704,705,0,0,0,0,707,710,0,\n711,0,0,0,0,726,0,0,729,0,0,0,730,731,0,0,0,0,0,752,0,0,0,762,0,763,0,0,767,0,0,\n0,770,774,0,0,775,0,0,0,0,0,0,0,0,0,0,776,0,0,0,777,783,0,0,0,785,788,0,0,0,0,\n790,0,0,0,793,0,0,0,0,794,0,0,804,819,821,0,827,0,0,0,834,0,0,835,0,0,0,841,0,\n844,0,850,851,859,0,860,0,0,0,0,0,0,0,874,0,876,0,877,890,0,0,0,0,0,0,0,0,893,\n894,898,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,899,0,0,0,900,904,906,0,0,0,907,0,908,909,\n0,910,0,0,0,0,911,0,0,0,0,0,916,0,0,0,922,925,0,930,0,934,0,0,0,0,0,943,0,0,944,\n0,953,954,0,0,0,0,0,0,955,0,962,963,0,0,976,0,0,977,978,979,980,0,981,0,0,0,0,\n984,0,0,985,0,0,987,989,991,0,0,0,0,0,0,0,0,0,992,0,0,0,993,0,0,0,0,0,0,996,0,0,\n0,1000,0,0,0,0,0,1002,0,0,0,0,1005,1007,0,0,0,1009,0,0,0,1010,0,0,0,0,0,0,1011,0\n,1012,0,0,0,0,1014,1016,0,0,0,1020,0,1021,0,0,0,0,1022,0,0,0,1024,0,0,0,0,0,0,\n1025,0,0,1026,1027,0,0,0,0,0,1031,0,1033,0,0,0,0,1034,0,0,0,1037,1040,0,0,0,1042\n,1043,0,0,1053,0,1054,0,0,1057,0,0,0,1058,0,0,1060,0,0,0,0,0,0,0,1061,0,0,1062,0\n,0,0,0,1063,0,0,0,0,1064,0,0,0,0,0,1065,0,0,0,0,1066,1067,0,0,0,1069,1070,1072,0\n,0,0,0,0,0,1073,0,1075,0,0,0,0,0,0,1080,1084,0,0,0,0,1088,0,0,0,0,0,0,1094,0,\n1095,0,1107,0,0,0,1112,1114,0,1119,0,1122,0,0,1126,0,1129,0,1130,0,0,0,0,0,1132,\n0,0,0,0,0,0,1144,0,0,1145,1146,0,1148,1149,0,0,1150,1151,0,0,0,0,1152,0,1153,0,0\n,0,0,0,1154,0,1163,0,0,0,1164,0,0,0,0,0,1165,0,1167,0,1170,0,0,0,0,0,1171,1172,0\n,0,0,0,0,0,0,0,1173,1175,1177,0,1186,0,0,0,0,0,0,0,0,0,0,1195,0,0,1221,0,0,1224,\n0,0,1227,0,0,0,0,0,1228,1229,0,0,1230,0,0,0,0,0,0,0,0,0,1231,0,0,0,1233,0,0,1243\n,1244,1246,1248,0,0,0,0,1254,1255,1258,1259,0,0,0,1260,0,0,1261,0,0,0,1262,1264,\n0,0,1265,0,0,0,0,0,0,0,0,0,0,0,0,1266,0,1267,0,0,0,0,1273,1274,1276,1289,0,0,\n1291,1292,1293,0,0,1294,1295,1296,0,0,0,0,1302,0,1304,0,0,0,0,0,0,0,0,0,1311,\n1312,0,1314,0,1316,1320,1321,0,0,0,0,0,0,0,1322,1323,1324,0,1335,0,1336,0,0,0,0,\n1341,1342,0,1346,0,1357,0,0,0,1358,1360,0,0,0,0,0,0,1361,0,0,0,1362,1365,0,1366,\n0,0,0,0,0,0,0,1379,0,0,0,0,0,0,0,0,0,0,0,0,1386,0,1388,0,0,0,0,0,0,0,0,0,0,0,0,0\n,0,1395,0,0,0,0,1403,0,1405,0,0,1407,0,0,0,0,0,1408,1409,0,1410,0,0,0,1412,1413,\n1416,0,0,1429,1451,0,0,1454,0,0,0,0,0,0,0,1455,0,0,0,0,0,0,0,1456,0,0,0,0,1459,\n1460,1461,1475,0,0,0,0,0,0,1477,0,1480,0,1481,0,0,1486,0,0,1495,0,0,0,1496,0,0,\n1498,1499,1501,1520,1521,0,0,0,1526,0,0,0,0,1528,1529,0,1533,1536,0,0,0,1537,\n1538,1549,0,1550,1558,1559,1572,0,1573,0,0,0,0,0,0,0,0,0,1575,0,0,0,0,0,1579,0,\n1599,0,1603,0,1604,0,1605,0,0,0,0,0,1608,1610,0,0,0,0,1611,0,1615,0,1616,1618,0,\n1619,0,0,1622,0,0,0,0,1634,0,0,0,1635,0,0,0,1641,0,0,0,0,0,0,0,0,0,1643,0,0,0,\n1650,0,0,1652,0,0,0,0,0,1653,0,0,0,1654,0,0,0,0,1655,0,1662,0,0,1663,1664,0,0,\n1668,0,0,1669,1670,0,1672,1673,0,0,0,0,0,1674,0,0,0,1675,1676,1680,0,1682,0,0,\n1687,0,0,0,0,0,1704,0,0,1705,0,0,1721,0,0,0,0,1734,1735,0,0,0,0,1737,0,0,0,0,\n1739,0,0,1740,0,0,0,0,0,0,0,0,0,0,1741,1743,0,0,0,0,1745,0,0,0,1749,0,0,0,1751,0\n,0,0,0,0,0,1760,0,0,0,0,1765,0,0,0,0,0,1784,0,1785,1787,0,0,0,0,1788,1789,0,0,0,\n0,1790,1791,1793,0,1798,1799,0,0,0,0,1801,0,1803,1805,0,0,0,1806,1811,0,1812,\n1814,0,1821,0,0,0,0,0,1822,1833,0,0,0,0,0,0,1848,0,0,0,0,0,0,1857,0,0,0,1859,0,0\n,0,0,1861,0,0,0,0,0,0,0,1866,0,1921,1925,0,0,0,1929,1930,0,0,0,0,0,0,0,0,0,1931,\n0,0,0,0,1932,0,0,0,1934,0,0,0,0,0,0,0,0,1946,0,0,1948,0,0,0,0,1950,0,1957,0,1958\n,0,0,0,0,0,1965,1967,0,0,0,0,1968,0,1969,0,1971,1972,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n,0,1973,0,0,0,0,1975,0,0,0,0,1976,1979,0,1982,0,0,0,0,1984,1988,0,0,0,0,1990,\n2004,2008,0,0,0,2012,2013,0,0,0,0,0,0,0,0,0,0,2015,0,2016,2017,0,0,0,0,2021,0,0,\n2025,0,0,0,0,0,2029,2036,2040,0,2042,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2043,0,0,0,0,0,\n2045,0,0,0,0,0,0,0,2046,2047,0,2048,2049,0,2059,0,0,2063,0,2064,2065,0,0,2066,0,\n0,0,0,0,0,2069,0,0,0,0,2070,0,2071,0,2072,0,0,0,0,2080,2082,2083,0,0,0,0,0,2085,\n0,2086,2088,2089,2105,0,0,0,0,2107,0,0,2116,2117,0,2120,0,0,2122,0,0,0,0,0,2123,\n0,0,2125,2127,2128,0,0,0,2130,0,0,0,2137,2139,2140,2141,0,0,0,0,0,0,0,0,0,2144,\n2145,0,0,2146,2149,0,0,0,0,2150,0,0,2151,2158,0,2159,0,2160,0,0,0,0,0,0,2161,\n2162,0,0,2194,2202,0,0,0,0,0,0,2205,2217,0,2220,0,2221,0,2222,2224,0,0,0,0,2237,\n0,0,0,0,0,2238,0,2239,2241,0,0,2242,0,0,0,0,0,2243,0,0,0,0,0,0,2252,0,0,2253,0,0\n,0,2257,2258,0,0,0,2260,0,0,0,0,0,0,0,2262,0,2264,0,0,0,0,0,2269,2270,0,0,0,0,0,\n0,0,0,0,2271,0,2273,0,0,0,0,2277,0,0,0,0,2278,0,0,0,0,2279,0,2280,0,2283,0,0,0,0\n,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2287,0,0,0,0,0,0,0,2289,2290,0,0,0,0,2291,0,2292,0,\n0,0,2293,2295,2296,0,0,0,0,0,0,0,2298,0,0,0,0,0,2303,0,2305,0,0,2306,0,2307,0,0,\n0,0,0,0,0,0,0,0,0,0,2313,2314,2315,2316,0,0,2318,0,2319,0,2322,0,0,2323,0,2324,0\n,2326,0,0,0,0,0,0,0,2335,0,2336,2338,2339,0,2340,0,0,0,2355,0,2375,0,2382,2386,0\n,2387,0,0,2394,0,0,0,0,2395,0,2397,0,0,0,0,0,2398,0,0,0,0,0,0,0,2399,2402,2404,\n2408,2411,0,0,0,2413,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2415,0,0,2416,2417,2419,0,2420,\n0,0,0,0,0,2425,0,0,0,2426,0,0,0,0,0,0,0,0,0,0,0,0,2427,2428,0,2429,0,0,2430,2434\n,0,2436,0,0,0,0,0,0,2441,2442,0,2445,0,0,2446,2457,0,2459,0,0,2462,0,2464,0,2477\n,0,2478,2486,0,0,0,2491,0,0,2493,0,0,2494,0,2495,0,2513,2523,0,0,0,0,2524,0,0,0,\n0,0,0,2528,2529,2530,0,0,2531,0,2533,0,0,2534,2535,0,2536,2537,0,2538,0,2539,\n2540,0,0,0,2545,2546,0,0,0,0,0,0,0,2548,0,0,2549,0,2550,2555,0,0,0,0,0,2557,0,\n2560,0,0,0,0,0,0,0,0,0,0,0,2561,0,2576,0,0,0,0,0,0,0,0,0,2577,2578,0,0,0,2579,0,\n0,0,0,0,0,0,2580,0,0,0,0,2581,0,0,0,0,2583,0,2584,0,2588,2590,0,0,0,2591,0,0,0,0\n,2593,2594,0,2595,0,2601,2602,0,0,2603,0,2605,0,0,0,2606,2607,2611,0,2615,0,0,0,\n2617,0,0,0,0,0,0,0,0,0,0,0,0,0,2619,0,0,2620,0,0,0,2621,0,2623,0,2625,0,0,2628,\n2629,0,0,2635,2636,2637,0,0,2639,0,0,0,2642,0,0,0,0,2643,0,2644,0,2649,0,0,0,0,0\n,0,2655,2656,0,0,2657,0,0,0,0,0,2658,0,0,0,0,0,2659,0,0,0,0,2664,2685,0,2687,0,\n2688,0,0,2689,0,0,2694,0,2695,0,0,2698,0,2701,2706,0,0,0,2707,0,2709,2710,2711,0\n,0,0,2720,2730,2735,0,0,0,0,2738,2740,0,0,0,0,2747,0,0,0,0,0,0,2748,0,0,2749,0,0\n,0,0,0,2750,0,0,2752,2754,0,0,0,0,0,2758,0,0,0,0,2762,0,0,0,0,2763,0,0,0,0,0,0,0\n,2764,2767,0,0,0,0,2768,0,0,2770,0,0,0,0,0,0,0,2771,0,0,0,0,0,0,0,0,0,2772,0,0,0\n,0,0,2773,2776,0,0,2783,0,0,2784,0,2789,0,2790,0,0,0,2792,0,0,0,0,0,0,0,0,0,0,\n2793,2795,0,0,0,0,0,0,2796,0,0,0,0,0,0,2797,2799,0,0,0,0,2803,0,0,0,0,2806,0,\n2807,2808,2817,2819,0,0,0,0,0,2821,0,0,0,0,2822,2823,0,0,0,0,0,0,0,2824,0,0,2828\n,0,2834,0,0,0,0,0,0,2836,0,2838,0,0,2839,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2841,\n0,0,0,2842,0,0,0,0,0,2843,2844,0,0,0,0,2846,0,0,2847,0,2849,0,2853,0,0,0,0,0,\n2857,0,0,0,0,2858,0,2859,0,0,2860,0,2862,2868,0,0,0,0,2875,0,2876,0,0,2877,2878,\n2884,2889,2890,0,0,2891,0,0,2892,0,0,0,2906,2912,0,2913,0,0,0,0,0,0,0,0,2916,0,\n2934,0,0,0,0,0,2935,0,0,0,0,2939,0,2940,0,0,0,0,0,0,0,2941,0,0,0,2946,0,2949,0,0\n,2950,2954,2955,0,0,0,2959,2961,0,0,2962,0,2963,0,0,0,0,0,0,2964,2965,2966,2967,\n0,0,0,0,0,0,0,2969,0,0,0,0,0,2970,2975,0,2982,2983,2984,0,0,0,0,0,2989,0,0,2990,\n0,0,0,0,0,0,0,2991,0,0,0,0,0,0,0,0,2998,0,3000,3001,0,0,3002,0,0,0,3003,0,0,3012\n,0,0,3022,0,0,3024,0,0,3025,3027,0,0,0,3030,0,0,0,0,3034,3035,0,0,3036,0,3039,0,\n3049,0,0,3050,0,0,0,0,0,0,3051,0,3053,0,0,0,0,3057,0,3058,0,0,0,0,0,0,0,0,3063,0\n,0,3073,3074,3078,3079,0,3080,3086,0,0,0,0,0,0,0,0,3087,0,3092,0,3095,0,3099,0,0\n,0,3100,0,3101,3102,0,3122,0,0,0,3124,0,3125,0,0,0,0,0,0,3132,3134,0,0,3136,0,0,\n0,0,0,0,0,3147,0,0,3149,0,0,0,0,0,3150,3151,3152,0,0,0,0,3158,0,0,3160,0,0,3161,\n0,0,3162,0,3163,3166,3168,0,0,3169,3170,0,0,3171,0,0,0,0,0,0,0,3182,0,3184,0,0,\n3188,0,0,3194,0,0,0,0,0,0,3204,0,0,0,0,3209,0,0,0,0,0,0,0,0,0,0,0,3216,3217,0,0,\n0,0,0,0,0,3219,0,0,3220,3222,0,3223,0,0,0,0,3224,0,3225,3226,0,3228,3233,0,3239,\n3241,3242,0,0,3251,3252,3253,3255,0,0,0,0,0,0,0,0,3260,0,0,3261,0,0,0,3267,0,0,0\n,0,0,0,0,0,3271,0,0,0,3278,0,3282,0,0,0,3284,0,0,0,3285,3286,0,0,0,0,0,0,0,3287,\n3292,0,0,0,0,3294,3296,0,0,3299,3300,3301,0,3302,0,0,0,0,0,3304,3306,0,0,0,0,0,0\n,3308,0,0,0,0,0,0,0,0,0,3311,0,0,0,0,0,0,0,0,3312,3314,3315,0,3318,0,0,0,0,0,0,0\n,0,3319,0,0,0,0,0,3321,0,0,0,0,0,0,0,0,0,3322,0,0,3324,3325,0,0,3326,0,0,3328,\n3329,3331,0,0,3335,0,0,3337,0,3338,0,0,0,0,3343,3347,0,0,0,3348,0,0,3351,0,0,0,0\n,0,0,3354,0,0,0,0,0,0,0,0,0,0,3355,0,0,3365,3366,3367,0,0,0,0,0,0,3368,3369,0,\n3370,0,0,3373,0,0,3376,0,0,3377,0,3379,3387,0,0,0,0,0,3390,0,0,0,0,0,0,0,3402,0,\n3403,3436,3437,3439,0,0,3441,0,0,0,3442,0,0,3449,0,0,0,3450,0,0,0,0,0,0,0,3451,0\n,0,3452,0,3453,3456,0,3457,0,0,3458,0,3459,0,0,0,0,0,0,0,0,0,3460,0,0,3469,3470,\n0,0,3475,0,0,0,3480,3487,3489,0,3490,0,0,3491,3499,0,3500,0,0,3501,0,0,0,3502,0,\n3514,0,0,0,3516,3517,0,0,0,3518,0,0,0,0,3520,3521,3522,0,0,3526,3530,0,0,0,0,\n3531,0,0,0,0,3536,0,0,0,0,0,0,0,3539,3541,0,0,3542,3544,0,3547,3548,0,0,3550,0,\n3553,0,0,0,0,0,0,0,3554,0,3555,0,3558,0,3559,0,0,0,0,0,0,0,0,3563,0,3581,0,0,0,\n3599,0,0,0,3600,0,3601,0,3602,3603,0,0,3606,3608,0,3610,3611,0,0,0,0,0,0,0,0,0,\n3612,3616,3619,0,0,0,0,0,0,0,0,0,0,0,0,0,3624,3628,0,3629,3634,3635,0,0,0,0,0,0,\n3636,0,3637,0,0,3638,3651,0,0,0,0,0,0,3652,3653,0,0,0,0,3656,3657,0,0,0,0,0,3658\n,0,0,0,0,3659,0,3661,3663,3664,0,3665,0,3692,0,0,0,3694,3696,0,0,0,0,0,0,0,0,0,0\n,0,0,3698,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3700,0,0,3701,0,0,0,3708,3709,0,0,0,3711\n,3712,0,0,0,0,0,3723,0,3724,3725,0,0,3726,0,0,0,0,0,0,3728,3729,0,3734,3735,3737\n,0,0,0,3743,0,3745,0,0,3746,0,0,3747,3748,0,3757,0,3759,3766,3767,0,3768,0,0,0,0\n,3769,0,0,3771,0,3774,0,0,0,0,0,0,3775,0,0,0,0,0,0,3776,0,3777,3786,0,3788,3789,\n0,0,0,0,0,0,0,0,0,3791,0,3811,0,0,0,0,0,3814,3815,3816,3820,0,0,0,0,0,0,0,3821,0\n,0,3825,0,0,0,0,3835,0,0,3848,3849,0,0,0,0,3850,3851,3853,0,0,0,0,3859,0,3860,\n3862,0,0,0,0,0,3863,0,0,0,0,0,0,0,0,3873,0,3874,0,3875,3886,0,3887,0,0,0,0,3892,\n3913,0,3914,0,0,0,3925,3931,0,0,0,0,3934,3941,3942,0,0,0,0,3943,0,0,0,3944,0,0,0\n,0,0,3945,0,3947,0,0,0,3956,3957,0,0,0,0,0,0,0,0,0,3958,0,3959,3965,0,0,0,0,3966\n,0,0,0,3967,0,0,0,3968,3974,0,0,0,0,0,3975,3977,3978,0,0,0,0,3980,0,3985,0,0,0,0\n,0,0,0,0,3986,4011,0,0,4017,0,0,0,0,0,0,0,0,0,0,0,4018,0,0,0,0,4019,0,4023,0,0,0\n,4027,4028,0,0,0,0,0,0,0,0,4031,4034,0,0,4035,4037,4039,4040,0,0,0,0,0,4059,0,\n4060,4061,0,4062,4063,4066,0,0,4072,0,0,0,0,0,0,0,0,0,0,0,0,0,4088,0,0,0,0,0,\n4091,0,0,0,0,4094,4095,0,0,4096,0,0,0,0,0,4098,4099,0,0,0,4101,0,4104,0,0,0,4105\n,4108,0,4113,0,0,4115,4116,0,4126,0,0,4127,0,0,0,0,0,0,0,4128,4132,4133,0,4134,0\n,0,0,4137,0,0,4141,0,0,0,0,4144,4146,4147,0,0,0,0,4148,0,0,4311,0,0,0,4314,4329,\n0,4331,4332,0,4333,0,4334,0,0,0,4335,0,4336,0,0,0,4337,0,0,0,4342,4345,4346,4350\n,0,4351,4352,0,4354,4355,0,0,4364,0,0,0,0,4369,0,0,0,4373,0,4374,0,0,0,0,4377,0,\n0,0,0,4378,0,0,0,4380,0,0,0,4381,4382,0,0,0,0,0,0,0,4384,0,0,0,0,4385,0,0,0,4386\n,0,0,0,4391,4398,0,0,0,0,4407,4409,0,0,0,0,4410,0,0,4411,0,4414,4415,4418,0,4427\n,4428,4430,0,4431,0,4448,0,0,0,0,0,4449,0,0,0,4451,4452,0,4453,4454,0,4456,0,0,0\n,0,0,0,0,4459,0,4463,0,0,0,0,0,4466,0,4467,0,4469,0,0,0,0,0,0,0,0,0,0,0,0,0,4470\n,4471,0,4473,0,0,4475,0,0,0,0,4477,4478,0,0,0,4479,4481,0,4482,0,4484,0,0,0,0,0,\n0,0,4486,0,0,4488,0,0,4497,0,4508,0,0,4510,4511,0,4520,4523,0,4524,0,4525,0,4527\n,0,0,4528,0,0,0,0,4530,0,4531,0,0,4532,0,0,0,4533,0,0,0,0,0,4535,0,0,0,4536,0,0,\n0,0,0,4541,4543,4544,4545,4547,0,4548,0,0,0,0,4550,4551,0,4553,0,0,0,0,4562,0,0,\n4571,0,0,0,4574,0,0,0,4575,0,4576,0,4577,0,0,0,4581,0,0,0,0,0,4582,0,0,4586,0,0,\n0,4588,0,0,4597,0,4598,0,0,0,0,4616,4617,0,4618,0,0,0,0,4619,0,4620,0,0,4621,0,\n4624,0,0,0,0,0,4625,0,0,0,0,4657,0,4659,0,4667,0,0,0,4668,4670,0,4672,0,0,0,0,0,\n4673,4676,0,0,0,0,4687,0,0,0,0,4697,0,0,0,0,4699,0,4701,0,0,0,0,4702,0,0,4706,0,\n0,4713,0,0,0,4714,4715,4716,0,0,0,0,0,0,0,0,0,0,0,0,4717,0,0,4720,0,4721,4729,\n4735,0,0,0,4737,0,0,0,4739,0,0,0,4740,0,0,0,4741,0,0,0,0,0,4742,0,4745,4746,4747\n,0,0,0,0,0,0,0,0,4748,0,0,0,4749,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4751,\n4786,0,4787,0,4788,4796,0,0,4797,4798,0,4799,4806,4807,0,0,0,0,4809,4810,0,0,0,0\n,0,0,4811,0,0,0,0,0,4812,0,4813,0,0,4815,0,4821,4822,0,0,0,0,4823,0,0,0,0,0,0,0,\n0,0,0,4824,0,0,0,0,4826,0,0,0,4828,0,4829,0,0,0,4843,0,0,4847,0,4853,4855,4858,0\n,0,0,0,0,4859,0,4864,0,0,4879,0,0,0,0,4880,0,0,0,0,4881,0,4882,0,0,0,0,0,0,0,0,0\n,4883,0,0,0,0,4884,0,0,0,0,0,4886,4887,4888,4894,4896,0,4902,0,0,4905,0,0,4915,0\n,0,0,0,0,0,0,4916,4917,4919,4921,0,0,0,0,0,4926,0,0,0,0,4927,0,0,0,0,0,0,0,0,\n4929,0,4930,4931,0,4938,0,4952,0,4953,4957,4960,4964,0,0,0,0,0,0,0,5019,5020,\n5022,0,0,0,0,0,5023,0,0,0,5024,0,0,0,5025,0,0,0,0,5028,0,0,0,0,5029,5030,5031,0,\n5033,0,0,0,0,0,0,0,0,0,5034,5035,0,5036,0,0,5037,0,0,0,0,5038,0,0,5039,0,0,0,\n5041,5042,0,0,0,0,5044,5049,5054,0,5055,0,5057,0,0,0,5060,0,0,0,0,0,5063,0,5064,\n5065,0,5067,0,0,0,5068,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5076,0,0,0,0,0,0,\n0,5077,0,0,5078,5080,0,0,5083,0,0,0,0,0,0,0,0,5085,0,0,0,0,0,0,5098,5099,5101,\n5105,5107,0,5108,0,5109,0,0,0,0,0,0,0,5110,0,0,0,0,0,5117,5118,0,5121,0,5122,0,0\n,5130,0,0,0,5137,0,0,0,5148,0,0,0,0,0,0,0,5151,5154,0,0,0,5155,0,0,5156,5159,\n5161,0,0,0,0,5162,0,0,0,0,5163,5164,0,5166,0,0,0,0,0,0,0,0,0,0,5167,0,0,0,5172,0\n,0,0,0,0,0,5178,5179,0,0,5190,0,0,5191,5192,5194,0,0,5198,5201,0,0,0,0,0,5203,0,\n5206,5209,0,0,0,0,0,0,5213,0,5214,5216,0,0,0,0,0,5217,0,0,0,0,0,0,0,0,5218,5219,\n0,5231,0,0,5244,5249,0,5254,0,5255,0,0,5257,0,0,0,0,0,5258,0,5260,5270,0,5277,0,\n0,0,0,0,0,5280,5281,5282,5283,0,0,0,0,0,5284,0,5285,0,0,0,0,0,5287,5288,0,0,0,0,\n0,0,0,0,0,0,5289,5291,0,0,5294,0,0,5295,0,0,0,0,0,0,0,5304,0,0,5306,5307,5308,0,\n5309,0,0,5310,0,0,0,0,5311,5312,0,5313,0,0,0,0,0,5316,0,0,0,5317,0,0,0,0,0,0,0,0\n,0,5325,0,0,0,0,0,0,5326,0,5327,5329,0,5332,0,0,0,0,5338,0,0,0,0,0,0,0,0,5340,0,\n0,5341,0,0,0,5342,0,5343,5344,0,0,5345,0,0,0,0,0,0,5347,5348,0,0,0,0,0,0,0,0,0,\n5349,0,5350,0,5354,0,0,0,0,5358,0,0,5359,0,0,5361,0,0,5365,0,5367,0,5373,0,0,0,\n5379,0,0,0,5380,0,0,0,5382,0,5384,0,0,0,0,0,0,5385,0,0,0,0,5387,0,0,0,0,0,0,5388\n,5390,5393,0,0,0,0,0,0,0,0,0,0,0,5396,0,0,0,0,5397,5402,0,0,0,0,0,5403,0,0,0,\n5404,5405,0,0,0,0,0,0,0,0,0,0,0,0,5406,0,0,0,0,5410,0,0,5411,0,5415,0,0,0,0,5416\n,5434,0,0,0,0,0,0,0,0,0,0,0,5438,0,5440,0,0,0,0,0,0,5441,5442,0,0,0,5443,5444,\n5447,0,0,5448,5449,5451,0,0,0,5456,5457,0,0,0,5459,0,0,0,5461,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,5464,0,5466,0,0,5467,0,5470,0,0,5473,0,0,5474,0,0,5476,0,0,0,0,0,0,0,0\n,0,0,0,5477,0,0,0,0,0,0,0,5484,0,0,5485,5486,0,0,0,0,0,5488,0,0,0,0,0,0,0,5489,0\n,0,0,0,0,5507,0,0,0,5510,0,5511,0,0,5512,0,0,0,5513,0,5515,0,0,5516,5517,0,5518,\n0,0,5522,0,0,0,0,0,5534,5535,0,0,5536,0,5538,0,0,5543,0,5544,0,0,5545,0,5547,0,\n5557,0,0,5558,0,5560,5567,0,0,0,0,5568,0,0,0,5571,5573,0,5574,0,5575,0,0,0,0,\n5577,0,0,5598,0,0,0,0,0,0,0,0,0,5600,5609,0,0,0,0,5610,0,0,5612,0,5624,0,5625,0,\n0,0,5629,0,5641,0,5642,5643,0,0,0,0,0,0,5651,0,0,0,5652,5653,0,5661,5662,5678,0,\n5679,0,0,0,0,5685,5686,0,0,0,0,0,5690,5692,0,5703,0,0,0,0,0,5706,0,0,0,0,5707,0,\n0,0,0,0,0,5708,0,0,5709,0,5710,0,0,0,5712,0,5733,0,5734,5735,0,0,5744,5751,0,0,0\n,0,0,0,0,0,0,0,0,0,5752,0,5754,0,0,0,0,0,0,5757,5758,0,5760,5761,0,0,0,0,5763,\n5764,5765,0,5766,0,5767,5768,0,5770,0,0,0,0,5776,5780,0,0,0,0,5782,0,0,0,0,5784,\n0,0,5788,0,0,0,0,0,0,0,0,0,0,0,5797,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5799,0,0,5801,\n0,0,0,5811,0,0,0,0,0,0,5816,0,0,5827,0,0,0,0,0,0,0,0,5830,5831,0,0,5832,0,0,5833\n,0,5835,5844,5845,0,5846,0,0,0,0,0,5850,0,0,0,0,0,5852,0,5855,5857,0,0,5859,0,\n5861,0,0,5863,0,5865,0,0,0,5873,5875,0,0,0,5877,0,5879,0,0,0,5888,0,0,5889,5891,\n0,5894,0,0,0,0,0,0,5895,0,5897,0,0,0,0,0,0,5907,0,5911,0,0,5912,0,5913,5922,5924\n,0,5927,5928,0,0,0,0,5929,5930,0,5933,0,0,0,0,5949,0,0,5951,0,0,0,0,0,0,0,0,5953\n,0,0,5954,0,5959,5960,5961,0,5964,0,0,0,5976,5978,5987,5990,0,0,0,0,0,5991,0,\n5992,0,0,0,5994,5995,0,0,5996,0,0,6001,6003,0,0,0,0,6007,0,0,0,0,0,6008,0,0,6009\n,0,6010,0,0,0,6011,6015,0,6017,0,6019,0,6023,0,0,0,0,0,0,0,6025,0,0,0,0,0,0,0,0,\n0,0,6026,0,6030,0,0,6032,0,0,0,6033,6038,6040,0,0,0,6041,6045,0,0,6046,0,0,6053,\n0,0,6054,0,6055,0,0,0,0,0,0,6057,0,6063,0,0,0,6064,0,6066,6071,6072,0,0,0,0,0,0,\n6075,6076,0,0,6077,0,0,0,0,0,0,0,0,0,6078,6079,0,0,0,0,0,0,0,0,6080,0,6083,0,0,0\n,0,0,6084,0,0,6088,0,6089,0,0,6093,6105,0,0,6107,0,6110,0,0,0,6111,6125,6126,0,0\n,0,6129,0,0,0,0,6130,0,0,0,6131,6134,0,0,0,0,0,0,6142,0,0,0,0,0,6144,0,0,6146,\n6151,6153,0,6156,0,6163,0,6180,6181,0,0,0,0,0,6182,0,0,0,0,6184,6195,0,0,6206,0,\n6208,0,0,6212,6213,6214,0,6215,0,0,0,6228,0,0,0,6234,0,0,0,0,0,0,6235,6240,0,\n6242,6243,6244,0,6250,6255,0,0,0,0,0,6257,0,0,0,6258,6278,0,6284,0,0,0,6285,0,0,\n0,0,0,0,0,0,6286,0,0,0,6320,0,0,6322,6332,0,0,0,0,0,0,0,0,6334,0,0,0,0,0,0,0,\n6335,0,0,6337,0,6338,0,6339,6340,0,0,6356,6357,6369,0,0,0,6370,6371,6372,0,6373,\n0,0,0,0,0,6376,0,0,0,0,0,6382,6383,6384,0,0,0,0,6386,0,6389,6397,6400,6411,0,\n6414,0,0,0,0,0,0,0,6415,6416,0,0,0,0,0,0,6417,0,0,0,0,6418,0,0,0,0,0,0,0,6420,0,\n6421,6423,6425,0,6429,6430,0,6433,6438,0,0,0,0,0,0,0,0,0,0,6439,6440,0,0,6441,0,\n0,6444,0,0,0,0,6446,0,0,0,0,6447,6448,0,0,6450,0,0,0,6454,0,0,6455,0,6461,0,0,0,\n0,0,0,6462,0,0,6463,0,6464,0,6465,6467,0,0,0,6468,0,6479,6480,0,0,0,0,0,0,0,6481\n,0,0,6485,6487,0,0,0,0,0,0,6493,0,0,0,0,0,0,0,0,6494,6495,6496,0,0,0,0,0,6498,0,\n0,0,6507,6508,0,0,0,0,0,0,0,0,0,0,6511,6512,0,0,0,0,6513,0,0,0,6514,0,0,0,0,0,\n6516,0,0,6517,6518,0,0,0,6519,6520,6521,0,6523,0,0,0,0,6524,6528,0,6530,0,0,6532\n,0,6578,0,0,0,6583,0,6584,0,0,0,6587,0,0,0,6590,0,6591,0,0,0,0,0,6592,0,0,0,0,\n6593,6594,0,0,0,0,0,6599,6600,0,0,6601,6602,6604,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n6608,0,0,0,0,0,0,0,0,6610,6611,0,6615,0,6616,6618,6620,0,6637,0,0,0,0,6639,0,0,0\n,0,6641,0,6642,0,0,0,6647,0,6660,6663,0,6664,0,6666,6669,0,6675,6676,6677,0,0,0,\n0,0,0,0,0,0,6678,0,0,0,6679,0,6680,0,0,0,0,0,0,0,6693,0,0,0,0,0,0,0,0,0,6704,\n6705,6706,0,0,6711,6713,0,0,0,0,0,6716,0,0,0,6717,0,6719,6724,0,0,0,0,0,0,0,0,\n6725,6726,0,0,0,0,0,6728,6729,6735,0,6737,6742,0,0,6743,6750,0,6751,0,0,6752,\n6753,0,0,0,0,0,0,6754,0,0,0,0,0,6756,0,0,0,0,0,0,6763,0,0,6764,6765,0,0,0,6770,0\n,0,0,6776,6780,0,6781,0,0,0,6783,0,6784,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n6785,0,0,0,6792,0,0,0,6793,0,0,6802,0,0,0,0,0,6803,0,0,0,6804,0,0,0,6812,0,0,\n6823,0,6824,6839,0,0,0,0,6852,0,0,6854,0,6856,6857,0,0,0,0,0,0,0,0,0,6867,0,6868\n,6870,6872,0,0,0,6873,6874,0,0,0,0,0,6875,0,0,6877,0,0,0,0,0,0,0,6878,0,0,0,6879\n,0,6880,0,0,0,0,0,0,0,0,0,0,6887,0,6888,6891,6893,0,6895,0,0,0,0,0,0,0,0,6899,0,\n0,0,0,6901,0,0,0,0,6910,0,6911,0,0,6912,0,0,6913,6914,0,0,0,6915,0,0,0,6916,6919\n,0,0,0,0,0,0,6924,0,6925,0,0,0,6926,6927,6928,0,6929,0,6930,0,0,6931,6935,0,6936\n,0,0,0,0,6939,6940,6941,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6942,6948,6949,0,0,0,0,0,0\n,0,6952,6954,6963,6965,6966,0,0,6967,6968,0,0,0,0,0,0,0,0,0,6969,0,0,6970,6979,0\n,0,6980,0,0,6983,0,0,0,0,0,6984,0,0,0,0,0,0,0,6988,6990,6992,0,0,0,0,0,0,0,6995,\n0,0,0,7012,0,0,0,0,0,0,0,0,0,7019,0,0,0,0,0,0,0,0,7021,0,0,7022,7023,7028,0,7030\n,7033,0,0,0,0,0,0,7038,0,0,0,0,0,0,0,0,0,0,7039,0,0,0,0,0,7046,0,7047,0,0,0,0,0,\n0,0,0,0,0,0,7048,7052,0,0,0,0,0,7054,0,7060,0,0,0,0,7061,0,7065,0,0,0,0,7067,\n7069,0,7070,7071,7072,0,0,7078,0,7080,7081,0,7083,0,0,0,7084,7087,7088,0,0,7090,\n0,7093,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7107,0,0,7108,0,0,0,0,0,0,0,0,7110,0,7114,0\n,0,0,0,0,0,0,7115,0,7116,0,0,0,0,0,7117,0,0,7118,0,0,7124,0,7125,0,0,7126,0,0,0,\n0,7128,0,0,0,0,0,7129,0,7130,0,7132,7133,0,0,7134,0,0,7139,0,7148,7150,0,0,0,0,\n7152,0,0,0,7153,7156,7157,0,0,0,0,0,7158,0,0,0,0,0,0,0,0,0,0,7163,7165,7169,0,\n7171,0,0,0,0,0,0,0,0,0,7172,0,7173,7181,0,0,0,0,0,7182,7185,0,0,0,0,7187,0,7201,\n7204,0,0,0,0,0,7206,7207,0,0,0,0,7211,7216,0,7218,0,0,0,0,7226,7228,7230,7232,\n7233,7235,7237,0,0,0,0,7238,7241,0,7242,0,0,7247,0,0,0,7266,0,0,0,0,0,0,0,7289,0\n,0,7290,7291,0,0,7292,0,7297,0,0,0,0,0,0,0,0,0,0,7300,0,7301,0,0,0,0,0,0,0,0,0,0\n,0,0,7302,0,0,0,0,7305,0,0,0,0,7307,0,7308,0,7310,0,7335,0,0,0,0,0,0,0,7337,0,\n7343,7347,0,0,0,0,0,7348,0,7349,7350,7352,7354,0,0,0,0,7357,0,7358,7366,0,7367,\n7368,0,0,7373,0,0,0,7374,0,0,0,0,0,0,0,7376,0,0,0,7377,0,0,0,0,0,7378,0,7379,\n7380,0,0,0,0,0,7383,0,0,7386,0,0,0,0,7398,0,0,0,7399,7400,0,7401,0,0,0,0,0,0,0,\n7402,0,0,0,0,0,7405,0,0,0,0,0,7406,0,0,0,0,0,0,0,0,7421,7427,7429,0,0,0,7435,0,0\n,7436,0,0,0,7437,0,0,0,0,0,0,7438,7443,0,7446,0,7448,0,0,0,0,0,0,0,0,0,0,7456,0,\n0,0,0,0,7457,0,0,7461,0,0,0,0,0,7462,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7463,7466,7472,\n0,7476,0,0,7490,0,7491,0,0,7493,0,0,0,7498,7499,0,0,7508,0,0,0,0,0,7512,0,0,0,\n7513,7514,7516,0,0,0,0,7518,0,0,7519,7521,7522,0,0,0,7526,0,0,7529,0,0,7531,0,\n7536,0,7538,0,7539,0,0,7541,7542,7546,0,0,0,0,0,7547,0,7548,0,0,0,0,0,7550,0,0,\n7552,7553,0,0,0,0,0,0,0,0,0,0,7554,7563,0,7573,0,0,0,0,0,0,7574,7576,0,7578,7581\n,7583,0,0,0,7584,0,7587,0,0,0,0,0,7589,0,0,0,7594,0,0,7595,0,0,7600,7602,7610,0,\n0,0,0,0,7612,0,7613,7614,0,0,7615,0,0,7616,0,7620,0,7621,7622,0,7623,0,0,0,0,\n7626,0,0,0,0,7627,7629,7631,0,0,7633,0,0,0,0,0,7639,0,7640,7642,0,0,7643,0,0,0,0\n,7644,0,0,0,0,0,0,0,7645,0,0,0,0,0,7661,7662,7663,7665,0,7666,0,7667,0,7684,7688\n,7690,0,7691,0,0,0,0,0,0,7692,0,0,7700,0,7707,0,7708,0,7709,0,7721,0,0,0,7722,0,\n7724,0,0,0,0,0,0,7729,7731,0,7732,0,7733,7735,0,0,0,0,0,0,0,7739,0,0,7741,7745,0\n,7748,0,0,0,7751,0,0,0,7752,0,0,0,0,0,0,0,7753,0,0,7756,0,7757,0,7759,0,7760,0,0\n,0,0,7761,7768,0,0,7769,0,0,7770,0,0,7771,0,0,7772,0,0,7773,0,0,0,0,0,7778,7783,\n0,0,0,0,0,7784,7785,0,7790,0,0,0,0,7792,0,7798,0,0,0,0,0,7799,0,7810,0,0,7813,0,\n7814,0,7816,0,7818,7824,7825,7826,0,7828,7830,0,0,0,7840,0,7842,0,7843,0,0,0,0,\n7844,0,0,0,0,0,0,0,7846,0,0,0,0,0,7856,7857,7858,7862,0,7865,0,0,7866,0,0,7913,0\n,0,0,0,7914,0,0,7915,7917,7918,7919,0,7920,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7921,\n7922,0,7924,0,0,7925,0,0,7927,0,7930,7935,0,0,7937,0,0,0,0,0,0,7939,0,7940,0,0,0\n,0,0,7941,0,0,0,0,7945,0,0,0,0,7949,0,0,0,0,0,0,0,0,7950,0,7953,0,0,0,0,0,0,0,\n7968,0,0,0,0,7969,7972,7992,0,7993,0,0,0,0,0,0,0,0,0,0,0,7994,0,0,0,0,8007,8008,\n0,0,0,0,0,0,0,0,0,0,0,0,8010,0,0,0,8012,0,0,0,0,0,0,0,0,8018,0,8028,8029,0,0,\n8030,0,0,8032,8033,0,0,8034,8036,0,0,0,0,0,0,0,0,0,0,8037,0,0,0,8043,8052,8059,\n8060,0,0,8061,0,0,0,8062,0,8063,0,8064,0,8066,8068,0,0,0,8080,8081,0,8089,0,0,0,\n0,0,8092,0,0,0,0,0,0,8093,8110,0,0,0,0,0,0,0,8111,0,0,0,0,0,8112,8115,0,8117,0,0\n,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8120,8121,8122,8128,8129,8130,8131,0,0,8139,0,0,\n8144,0,0,0,0,8145,8146,8153,0,0,0,0,0,0,0,0,8154,0,8157,8160,8162,0,8164,8165,0,\n0,0,0,8166,8167,0,0,8179,0,0,0,8185,0,0,0,8186,0,0,8187,0,0,0,8188,0,0,0,0,0,\n8204,0,0,0,0,8210,0,0,0,0,0,8213,0,8214,0,0,8215,0,0,0,0,0,0,8218,0,0,0,0,0,0,0,\n0,0,8219,0,8221,0,0,8222,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8225,0,0,0,8233,0,0,\n8242,0,0,0,0,0,0,0,0,0,0,0,8247,0,8248,8252,0,8256,8257,0,0,8261,0,8264,8265,0,0\n,0,0,8267,0,0,0,8269,0,0,0,0,0,0,0,0,0,8270,0,0,0,8278,0,8279,8283,0,0,8285,8286\n,8289,8292,0,0,0,0,8293,8295,8299,8300,8301,0,0,0,0,0,0,8304,8307,0,0,0,0,0,0,0,\n8321,0,0,0,8322,8323,8325,8326,8327,0,0,8332,8338,0,0,8340,0,0,0,0,0,8350,0,0,\n8351,0,8354,8355,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8360,8372,0,0,0,0,0,0,0,0,8377,0,0,\n0,0,8380,0,0,0,8383,0,8384,0,0,0,0,8386,8392,0,0,8394,0,0,0,0,0,0,0,8396,8397,0,\n8398,0,8399,0,0,0,0,0,8400,0,8401,8410,8411,0,8412,8413,8422,0,0,0,0,8423,0,0,0,\n0,8424,0,0,8425,0,0,0,0,0,0,0,8441,8442,0,0,0,0,0,0,8443,0,0,8444,0,8447,0,0,0,0\n,8451,0,8458,0,8462,0,0,8468,0,8469,0,0,0,8470,0,8473,8479,8480,0,0,0,0,8481,\n8483,0,0,0,0,0,0,0,0,0,8484,0,0,8490,0,0,0,0,0,0,8491,8493,8494,0,8528,0,0,0,0,0\n,0,0,8530,0,0,0,0,0,0,0,0,8534,8538,8540,0,0,8541,0,0,8545,0,8557,0,0,8569,8570,\n0,0,8571,8574,8575,8579,0,8583,0,0,0,0,8591,0,0,0,0,0,0,0,0,8606,0,8607,0,0,0,0,\n0,0,0,0,0,8608,0,0,8609,0,0,0,8610,0,0,0,8611,0,0,8613,8617,8621,0,0,8622,0,8623\n,0,8624,8625,0,0,0,0,0,0,0,0,0,8637,8638,8639,8650,0,0,0,0,8652,8654,8655,0,0,0,\n0,0,0,0,0,0,0,8656,0,0,0,0,0,8657,0,0,0,0,0,0,0,0,0,8658,0,0,8659,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,8660,0,0,0,0,0,0,8661,8663,8664,0,0,0,0,8665,0,8669,0,\n0,0,0,0,0,0,8671,8674,0,8684,0,8686,0,0,0,8689,0,0,0,8690,0,8706,0,0,0,0,0,0,0,0\n,0,0,0,8710,0,8711,8713,8714,8724,8727,8728,8733,8736,0,8737,8739,0,0,0,0,8742,\n8743,8745,8754,0,0,0,0,8756,0,0,0,0,0,0,8757,8760,0,0,0,0,0,8762,8763,8764,0,\n8766,8769,8770,8773,0,8774,0,8779,0,0,0,0,8780,0,0,8781,0,0,8783,0,0,0,0,0,0,0,0\n,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8784,0,0,0,0,0,0,0,0,8785,0,0,0,0,8786,0,0,0,0,8788\n,8790,0,0,0,8803,0,8813,8814,0,0,0,0,0,8815,8816,0,0,0,0,8818,0,0,0,0,8822,8828,\n8829,0,8831,0,0,0,0,8833,0,0,0,8834,0,0,0,8835,0,8836,0,0,0,8837,0,0,0,0,0,0,\n8838,8839,0,0,0,0,0,0,0,0,0,0,0,8840,0,0,0,8841,0,8842,0,0,0,8846,0,0,0,0,0,0,0,\n8847,0,8848,0,0,8864,0,0,8866,0,0,8870,8872,0,0,8873,8874,0,0,0,0,0,0,8875,0,\n8876,0,0,0,0,8896,8900,0,0,0,0,8901,0,0,0,0,0,8904,0,8907,0,0,0,0,8911,8912,8913\n,0,0,0,8914,0,8915,0,0,0,0,0,0,0,0,0,0,0,0,8916,0,0,0,8929,0,0,0,0,0,0,0,0,0,0,\n8930,0,8932,0,8943,0,0,0,8945,8947,0,0,0,0,8949,0,8950,0,8954,8957,0,0,8970,0,0,\n0,0,8971,0,8996,0,0,0,0,8997,9000,0,0,0,0,9001,9002,0,9004,9009,9024,0,0,0,0,0,0\n,0,0,0,0,0,0,9027,9082,0,0,9083,9089,0,0,0,0,0,0,9090,0,0,0,9092,0,0,9093,0,9095\n,0,0,9096,9097,9101,9102,0,0,0,0,0,0,0,0,9112,0,0,0,0,0,0,9114,0,0,9120,0,9121,\n9122,0,0,0,9123,9124,0,0,9125,0,0,9126,0,9127,0,0,9129,9131,0,0,0,9132,0,0,9136,\n0,9144,0,0,9148,0,0,0,0,0,0,9149,0,9152,9163,0,0,9165,0,0,0,0,0,0,0,0,0,0,0,0,0,\n9166,0,9169,0,0,0,0,0,0,0,9170,0,0,0,0,9172,0,9174,9175,9176,0,9177,0,0,0,0,0,0,\n0,0,9186,0,9187,0,0,0,9188,9189,0,0,9190,0,0,0,0,9191,0,0,0,9193,0,0,0,0,9197,\n9198,0,0,0,9208,9211,0,0,0,0,9216,9217,0,9220,0,0,0,0,9221,9222,9223,0,9224,9225\n,0,0,9227,0,9228,9229,0,0,9230,0,9232,0,9233,0,0,0,0,0,9234,9235,0,0,9237,0,0,0,\n0,0,0,0,0,9238,9240,0,0,9241,0,0,0,0,9244,0,0,0,0,9247,0,0,0,0,0,0,0,0,0,0,9248,\n0,0,0,9249,0,0,0,0,0,9250,0,0,0,0,9251,0,0,9252,9255,0,0,0,9256,0,0,0,0,0,0,0,\n9257,0,0,9258,0,0,0,0,0,0,9259,0,0,0,0,0,9262,9263,0,0,9265,9266,0,0,0,0,0,0,0,0\n,9268,9271,0,0,0,0,0,0,0,0,0,9273,0,0,0,9276,9277,9279,0,0,0,0,0,0,0,9280,0,0,\n9293,0,0,0,0,0,9297,9301,0,0,0,0,0,0,0,0,0,0,0,9308,9309,9313,9321,9322,0,9326,\n9327,0,0,9477,0,9479,0,0,0,0,9482,0,0,0,9483,0,9484,0,0,0,0,0,0,0,0,0,9485,0,0,\n9486,0,0,0,9489,0,0,0,0,9490,9491,0,0,0,0,9493,0,9495,9496,0,0,0,0,0,0,0,0,9500,\n0,9502,0,0,0,0,0,9504,9507,0,9509,0,9511,0,0,9513,0,0,0,0,0,0,0,0,9515,0,0,0,0,0\n,0,9516,9517,0,0,0,0,9532,0,0,9533,0,0,9538,0,9539,9540,0,0,0,0,9541,0,0,0,9542,\n0,0,0,0,0,0,0,0,9544,9545,0,9546,0,0,0,0,0,0,9547,9548,0,0,0,9550,0,9557,0,9558,\n0,9561,0,9563,9570,0,9572,9574,9575,0,0,0,9577,9592,0,0,9596,0,0,0,9598,0,9600,0\n,9601,0,0,0,0,0,0,9608,0,9638,9639,0,0,0,0,0,0,0,9641,0,0,9643,9644,9645,9646,0,\n0,0,9648,0,0,0,0,0,0,0,9650,9654,0,0,0,0,0,0,0,0,9655,0,0,0,0,0,9656,0,9657,0,0,\n0,0,9658,0,0,9659,0,0,9664,0,0,9665,0,9667,9669,0,0,0,0,0,0,0,0,0,0,0,0,9671,0,\n9673,9681,0,0,0,0,9682,9683,9684,0,0,0,0,9686,9698,0,0,9700,9701,9702,0,9703,\n9717,0,0,0,0,9718,0,9726,0,0,0,0,9727,0,0,0,9728,0,9742,0,9744,0,0,0,9750,0,9754\n,9755,0,0,0,0,0,9756,0,9757,9768,0,9769,0,0,0,9770,9771,0,9773,0,9774,0,9775,0,0\n,0,9776,9777,9784,0,0,0,9786,0,9789,0,0,0,0,9793,9794,0,0,0,9808,0,0,0,0,0,9811,\n0,0,0,0,0,0,0,0,0,0,0,0,9812,0,9820,0,9823,0,9828,0,0,0,0,9830,0,0,9833,9836,0,0\n,0,9840,0,0,0,9841,0,0,9842,0,9845,0,0,0,9847,9848,0,0,9855,0,0,0,0,0,0,9856,\n9863,9865,0,0,0,0,0,0,0,0,9866,9867,9868,9873,9875,0,0,0,0,0,0,9880,0,9886,0,0,0\n,9887,0,0,9891,0,0,0,0,0,0,0,9906,9907,9908,0,0,0,9909,0,0,0,0,0,0,9910,0,0,0,0,\n9913,0,0,0,0,9914,0,0,0,0,0,9922,0,0,0,0,9923,9925,0,0,0,0,0,0,9930,0,0,0,9931,0\n,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9932,0,9939,0,0,9940,9962,9966,0,9969,9970,0,0,9974\n,0,9979,9981,9982,0,0,0,9985,0,0,0,0,0,0,9987,0,0,0,0,0,0,0,9988,9993,0,0,9994,0\n,0,0,9997,0,10004,0,0,0,0,0,10007,10019,10020,10022,0,0,0,10031,0,0,0,0,0,10032,\n0,0,10034,0,10036,0,0,0,0,10038,0,10039,10040,10041,10042,0,0,0,0,0,10043,0,0,0,\n0,0,10045,10054,0,0,0,0,10055,0,0,10057,10058,0,0,0,0,0,0,10059,0,0,0,0,0,0,0,\n10060,0,0,0,0,0,0,0,10063,0,10066,0,0,0,10070,0,10072,0,0,10076,10077,0,0,10084,\n0,10087,10090,10091,0,0,0,10094,10097,0,0,0,0,0,0,10098,0,0,0,0,0,0,10103,0,\n10104,0,10108,0,0,0,0,0,0,0,0,10120,0,0,0,10122,0,0,10125,0,0,0,0,10127,10128,0,\n0,10134,0,10135,10136,0,10137,0,0,10147,0,10149,10150,0,0,10156,0,10158,10159,\n10160,10168,0,0,10171,0,10173,0,0,0,10176,0,0,0,0,10177,0,0,0,0,10178,0,0,0,0,\n10194,0,10202,0,0,10203,10204,0,10205,10206,0,10207,0,0,0,0,10209,0,0,0,0,0,0,0,\n10213,0,0,0,0,0,0,10217,0,10229,0,10230,10231,0,0,10232,0,0,10237,10238,10244,0,\n0,0,0,0,10250,0,10252,0,0,0,0,0,0,10255,0,0,10257,0,0,0,0,0,0,10258,0,10259,0,0,\n0,0,0,0,0,0,10260,0,0,0,0,0,0,0,10284,10288,10289,0,0,0,10290,0,10296,0,0,0,0,0,\n10297,0,0,0,0,0,0,10298,0,0,0,0,10299,10303,0,0,0,0,0,10306,0,0,0,10307,0,10308,\n0,0,0,0,10311,0,0,0,0,0,0,0,10315,10317,0,0,0,10318,10319,0,10321,0,10326,0,\n10328,0,0,0,0,10329,0,0,10331,0,10332,0,0,0,0,0,0,10334,0,0,10335,10338,0,0,0,0,\n0,10339,10349,0,0,0,0,0,0,10351,0,10353,0,0,0,0,0,0,10362,0,10368,0,10369,0,0,0,\n10372,10373,0,0,0,0,0,10374,0,0,0,10375,0,10376,0,0,10386,10388,10390,0,0,0,0,0,\n0,0,10391,0,0,10392,10394,0,0,10396,0,10397,0,10403,0,0,0,0,0,0,0,0,10404,0,\n10405,10410,0,0,10411,0,10412,0,0,0,0,0,0,0,10421,10422,10423,0,0,0,0,0,0,0,0,0,\n10425,0,0,10427,0,0,10430,0,0,0,0,0,10432,0,10433,10434,0,0,0,0,10436,10437,0,\n10438,0,10439,0,10444,10446,0,0,0,0,0,10448,0,0,0,0,0,10449,0,0,0,0,0,0,0,10451,\n0,10453,0,0,0,10454,10457,0,0,10459,0,10469,0,0,0,0,0,10472,10481,0,0,0,0,0,\n10482,10483,0,10492,0,0,0,0,0,0,0,0,0,0,10499,0,0,0,10502,0,0,10510,0,10521,\n10524,0,0,10525,10526,10528,0,0,0,0,0,0,0,0,10530,0,0,0,0,10533,0,10534,0,0,0,0,\n0,0,0,0,0,0,10535,10536,0,0,10544,0,10553,10556,0,10557,10559,0,0,0,0,0,10562,\n10563,10564,0,10565,0,0,0,10566,0,10567,0,0,0,0,10575,0,0,10576,0,10578,0,0,0,0,\n0,0,0,0,0,0,10585,10586,10587,10589,0,10590,0,0,10594,0,0,0,0,0,10598,0,0,10601,\n0,0,0,10602,0,10603,0,10604,0,10605,0,0,10607,0,10626,0,10627,0,0,0,0,0,10629,\n10630,10631,0,0,0,10646,0,0,0,10647,0,10650,0,10651,0,0,0,10652,10653,10655,0,\n10658,0,0,10659,0,10667,0,0,0,0,10669,0,0,0,0,0,0,0,0,0,10670,0,0,0,10671,0,0,0,\n0,10672,10673,0,10674,0,0,0,10676,0,0,0,0,0,0,10678,0,10682,0,0,10692,0,10697,0,\n0,0,0,10698,0,0,0,10700,0,0,0,0,0,10703,0,10704,0,0,0,0,0,0,0,10705,0,10715,\n10718,10720,0,0,10722,0,0,0,0,0,0,0,0,10723,0,0,0,0,10726,0,0,0,0,0,10727,10730,\n10743,0,0,0,0,0,0,10744,0,0,10745,0,0,0,0,0,0,10748,0,0,0,0,10750,0,0,10752,\n10753,0,0,0,10756,0,0,0,0,0,0,10758,0,0,0,10759,0,10769,0,0,10772,0,0,0,0,0,0,\n10773,0,0,0,10777,0,0,10779,0,0,0,0,0,0,0,0,10780,10784,0,0,0,10789,0,0,0,10791,\n0,0,0,0,0,0,0,0,0,10795,0,0,10796,0,10808,0,10809,0,0,0,10810,0,0,0,10812,0,0,\n10814,0,0,0,0,0,0,0,0,0,10815,0,0,0,0,10816,10817,0,0,0,0,10819,0,10820,0,0,0,0,\n10821,10822,10823,0,10826,10849,0,0,0,0,10850,0,0,10852,0,10853,0,0,10856,0,0,\n10857,10858,10859,10860,0,0,0,0,0,0,10863,0,10866,10867,10872,10890,0,0,10891,\n10892,0,0,0,0,0,10893,0,0,0,10896,10899,0,0,10900,10902,0,0,0,0,0,10903,0,0,0,0,\n0,0,0,0,0,0,0,0,10905,0,10906,0,0,0,0,10908,10911,0,10912,0,0,10916,0,0,0,0,0,\n10917,0,10918,0,0,0,10923,0,0,0,0,0,10924,0,0,10928,10929,0,0,10930,0,0,0,10932,\n0,0,0,0,10939,0,0,10945,0,0,0,10947,0,0,10948,0,0,0,0,0,0,0,0,0,0,0,0,10958,0,\n10960,10962,0,0,10964,0,0,0,10966,0,0,0,0,0,0,0,0,0,0,10967,0,0,0,10968,0,0,0,\n10973,0,0,0,0,0,10975,0,0,0,10976,10978,0,0,10982,10984,10987,0,0,10988,0,10989,\n0,0,10991,0,0,0,0,10992,0,0,0,10993,0,10995,0,0,0,10996,10997,0,0,0,10998,0,\n10999,0,11001,0,0,0,0,0,0,11010,11012,0,11013,11016,11017,0,0,11019,11020,11021,\n0,0,0,0,0,0,0,0,0,0,0,0,11022,0,0,11023,11029,0,0,0,0,11031,0,0,0,11034,0,0,0,0,\n11055,0,0,0,0,0,11056,11060,0,0,0,0,0,0,11061,0,0,11064,11065,0,11066,0,11069,0,\n11085,0,0,0,0,0,11086,0,0,0,11088,0,0,0,11094,0,0,0,11095,11096,0,0,0,0,0,0,\n11097,11098,0,0,0,0,0,0,11099,0,0,11102,11108,0,0,0,11109,0,11114,11119,0,11131,\n0,0,0,11142,0,0,11143,0,11146,0,11147,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11148,0,\n11149,11152,11153,11154,0,11156,0,11157,0,0,0,11158,0,0,11159,11160,0,0,0,0,0,0,\n0,0,0,0,0,0,11163,0,0,11164,11166,0,0,0,11172,11174,0,0,0,11176,0,0,0,0,0,11182,\n11183,0,0,0,11184,11187,0,0,11188,11189,0,0,0,0,0,0,11194,0,0,0,0,0,0,0,11200,\n11202,0,0,0,0,0,0,11203,0,11204,0,0,0,0,0,11205,0,0,0,11206,0,11207,0,0,11209,0,\n11211,0,11214,0,0,11231,0,0,0,11293,11295,0,0,11296,11297,11302,0,0,0,11307,0,0,\n0,0,11309,11310,0,11311,0,0,0,11313,0,11314,0,0,0,0,11334,0,11338,0,0,0,11339,0,\n0,0,0,0,11340,0,11341,11342,0,11344,0,11345,0,0,0,11348,11349,0,0,11350,0,0,0,\n11355,0,0,0,0,0,0,11356,0,11357,11370,0,0,11371,0,11374,11376,0,0,0,11377,0,0,\n11378,11383,0,11386,11399,0,11400,11406,0,0,0,11408,0,0,11409,11412,0,0,0,0,\n11417,0,0,0,11418,0,11421,0,11426,11429,0,0,0,0,0,11430,0,11437,0,11438,0,0,0,0,\n0,11440,11453,0,0,0,0,0,0,11454,0,0,0,0,11455,0,0,11456,11460,11461,11463,0,\n11469,0,11473,0,0,0,0,11474,0,0,0,11475,0,11476,11477,11480,0,0,0,0,11481,0,0,\n11484,0,0,11487,0,0,0,0,0,0,0,0,0,0,11497,0,0,11502,0,11509,0,0,11510,11511,\n11513,0,0,0,0,0,0,0,0,0,0,11515,0,0,0,0,11516,0,11520,11521,0,0,0,0,0,0,0,0,0,0,\n0,11529,11530,11531,11534,0,0,11543,0,0,0,0,0,11547,0,11548,0,0,0,0,0,11552,\n11556,0,11557,0,0,11559,0,11560,0,0,0,0,0,0,11561,0,0,11563,11564,0,11565,0,0,0,\n0,11567,0,0,0,11569,0,11574,0,11575,0,0,0,11577,0,11578,0,0,0,11580,11581,0,0,0,\n11582,11584,0,0,0,0,0,0,0,11587,0,11588,11591,0,11595,0,0,0,0,0,0,0,0,11596,0,\n11597,0,0,0,0,11598,11601,0,0,0,11602,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11603,\n11604,0,11606,0,0,11608,0,0,0,0,11610,0,0,11611,0,0,0,0,11613,0,11622,0,0,0,\n11623,0,0,0,0,11625,0,0,11626,11627,11628,11630,0,0,0,0,0,0,11639,0,0,11646,0,\n11648,11649,0,11650,0,0,0,0,0,0,0,0,0,11651,0,0,11652,11653,11656,0,0,11677,\n11679,0,0,0,0,11680,0,0,11681,0,11685,0,0,0,0,0,0,0,0,11688,0,0,0,11716,0,11719,\n0,0,0,0,0,11721,0,0,11724,11743,0,0,0,0,0,0,0,0,11745,11748,11750,0,0,0,0,0,\n11751,0,0,0,11752,11754,0,11755,0,0,0,0,0,0,0,11759,0,0,0,0,0,0,11760,0,0,0,\n11761,0,0,0,0,0,0,11766,11767,0,11772,11773,0,11774,0,0,11775,0,11777,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,11778,11780,0,0,0,0,0,0,0,11783,0,11784,0,0,0,11785,\n0,0,0,11786,0,0,0,0,11788,0,0,11789,11791,11792,0,0,0,0,11795,11834,11835,11836,\n0,0,11837,0,0,0,11838,0,0,11846,11851,0,11852,0,11869,0,0,0,11871,0,0,0,11872,\n11874,0,0,0,0,0,0,11875,0,11876,11877,0,0,0,0,0,0,0,0,0,0,11883,0,0,0,0,0,0,0,\n11884,0,11885,0,11886,0,0,11887,0,11894,11895,11897,11909,11910,0,11912,11918,0,\n0,11920,0,11922,11924,11927,11928,0,0,0,0,11929,0,11934,0,0,0,0,0,11941,11943,\n11944,0,11945,0,0,0,0,11948,11949,0,0,0,0,11953,0,11954,0,11955,0,11956,0,0,0,0,\n0,11957,0,0,11959,0,0,0,0,0,0,0,0,11961,0,0,0,0,0,11978,0,0,0,11979,11980,11986,\n11987,0,11992,0,0,0,0,0,11993,0,0,0,11994,0,11999,12004,12005,12006,0,0,0,0,0,\n12011,0,0,12012,12014,0,0,12015,0,0,12019,12028,0,0,12029,0,0,12032,12033,0,0,0,\n0,12034,0,12041,12043,0,0,12044,0,0,0,0,0,0,0,12046,0,0,0,0,0,0,0,12054,12055,0,\n12056,0,0,0,12060,12064,0,0,0,0,0,12065,12067,12068,0,0,0,0,0,0,0,0,12074,0,0,0,\n12075,12076,0,0,0,12079,0,12081,12086,12087,0,0,12088,0,0,0,0,12089,0,12092,0,0,\n0,0,12097,0,0,0,0,0,0,0,0,12098,0,0,0,0,0,0,0,0,0,0,0,0,0,12102,12103,12104,\n12111,0,0,12114,12116,0,0,0,12118,0,0,0,12119,12120,12128,0,0,0,0,12130,0,0,0,0,\n0,0,12131,0,0,0,12132,12134,0,0,0,0,12137,0,12139,0,12141,0,0,12142,0,0,0,12144,\n0,0,0,0,0,12145,0,12148,0,12153,0,0,0,0,12154,12171,12173,0,0,0,12175,0,0,0,0,\n12178,0,0,0,0,0,0,0,12183,0,0,0,0,0,0,0,0,12184,0,0,0,12186,0,0,0,0,0,12187,\n12188,0,0,12189,0,12196,0,12197,0,0,12198,0,12201,0,0,0,0,12203,0,12209,0,0,0,0,\n12210,12211,12212,12213,0,12217,12218,0,0,0,0,0,0,0,0,0,12222,0,0,0,0,0,0,0,\n12223,0,0,12229,0,0,0,0,12233,0,0,0,0,12234,0,0,12236,12242,0,0,0,12243,0,0,0,\n12244,12253,0,12254,12256,0,12257,0,0,12275,0,0,0,0,0,12277,0,0,0,0,0,12278,0,\n12289,0,0,12290,0,12292,12293,0,0,12294,0,12295,0,0,12296,0,12297,0,12298,0,0,0,\n0,12301,0,0,0,0,0,0,0,0,0,0,0,0,0,12309,0,12338,12340,0,0,0,0,12341,0,0,0,0,0,0,\n0,0,12342,12343,0,12344,0,0,0,0,0,0,0,0,0,12345,0,0,0,0,0,0,0,0,12346,0,0,0,0,\n12348,0,0,0,0,0,0,0,0,0,0,0,0,12350,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12351,0,12355,\n12356,12357,0,0,12367,12370,12371,0,0,0,0,0,12372,12376,0,0,0,0,0,0,0,0,12379,0,\n12382,0,12383,0,0,12384,0,0,0,0,12393,0,0,12394,0,0,0,0,12398,12403,0,0,12404,0,\n0,0,0,0,0,0,0,0,0,0,0,0,12410,0,0,0,12411,0,0,0,12412,0,0,0,0,12420,0,12421,0,0,\n0,0,0,12423,0,12425,12429,0,0,0,12431,12432,0,0,0,0,0,0,0,0,0,0,0,0,12434,0,0,0,\n0,0,12435,12436,0,0,0,0,0,0,0,0,12437,0,0,0,0,0,12438,0,0,0,0,0,0,0,0,12445,0,0,\n0,12450,12451,0,0,0,0,0,0,0,0,12452,12475,0,0,12493,12494,0,0,0,12495,0,0,0,0,\n12496,12502,12509,0,0,0,0,12510,0,12512,12513,0,0,0,0,12514,0,0,0,12515,0,12520,\n0,0,0,12524,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12527,0,0,0,12528,0,0,0,12529,0,0,0,\n0,0,12530,0,12535,0,0,12536,0,12538,0,0,0,0,0,0,0,0,0,0,0,0,12540,0,12548,0,0,0,\n0,0,12550,0,0,0,12551,12552,0,0,0,12554,0,0,0,0,0,0,0,0,12555,0,0,12562,0,12565,\n0,12566,0,0,0,0,0,0,0,0,0,0,0,0,12569,0,0,0,12571,12574,0,0,0,0,0,0,0,12577,0,0,\n0,0,0,0,0,12578,12579,12603,0,12608,0,0,12611,0,12612,0,12615,0,12625,0,0,0,0,\n12627,12646,0,12648,0,0,12657,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12670,0,0,12671,0,\n12673,12677,0,0,0,0,0,0,0,0,0,0,0,12679,0,12681,0,12682,12693,0,12694,0,12697,0,\n12701,0,0,0,12703,12704,0,0,0,0,12707,12737,0,0,12739,0,0,12740,0,0,12742,12743,\n0,0,0,0,0,0,0,0,0,12745,0,12746,12747,0,12748,0,0,12759,12767,0,0,0,0,12773,0,\n12774,12778,0,0,0,0,0,0,0,12779,0,0,0,0,0,12780,12793,0,12824,0,12825,0,12836,0,\n0,0,0,12839,0,12842,0,0,0,0,0,0,0,0,0,0,0,0,12843,12845,0,12846,0,0,0,0,12847,0,\n0,12850,12852,12853,0,0,0,12854,0,0,0,12855,0,12856,0,12858,0,0,12859,0,12862,0,\n12863,0,0,12866,0,12869,12872,12873,0,0,0,0,0,0,0,0,0,12875,0,12877,0,0,12878,0,\n0,0,0,0,0,0,0,0,12884,12885,12888,0,12889,0,0,0,0,12893,0,0,0,12895,12896,12898,\n0,0,0,0,0,0,0,12902,0,12909,12910,0,12926,0,12928,0,0,0,12929,0,12930,0,0,0,0,\n12931,0,12932,12933,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12934,0,12942,0,0,0,0,12944,\n0,0,0,0,0,0,0,0,12946,0,0,12948,0,0,12949,0,0,0,0,12950,0,0,0,0,12951,0,12952,0,\n12953,0,0,0,12954,12958,12959,0,0,0,0,0,12960,12964,0,0,0,0,0,12966,0,0,0,0,0,0,\n0,0,12970,0,12971,0,0,0,0,0,0,12972,0,0,12982,0,0,0,12984,12985,0,12986,12996,\n12997,13001,13002,0,0,0,0,13004,0,0,13005,0,0,13007,13009,0,13017,0,0,0,13020,0,\n13021,0,0,0,0,0,0,0,0,0,0,13022,0,0,0,0,0,0,0,0,13024,13027,0,0,0,0,0,13028,0,0,\n13029,0,0,0,0,0,0,0,13032,0,13037,0,0,0,0,0,0,13040,0,0,13041,0,0,0,13043,13044,\n13046,0,0,0,0,13047,0,0,0,0,0,0,0,13049,13054,0,13056,0,0,13060,13061,0,0,0,0,0,\n13067,0,0,13068,0,13071,0,0,0,0,0,13077,13078,0,0,0,0,0,13079,13080,13081,0,\n13082,0,0,0,13085,0,0,0,0,0,0,0,13086,0,13087,13088,0,0,0,0,0,13094,0,13099,0,\n13100,0,0,0,13101,0,13125,13126,13128,13129,0,0,13130,0,13131,0,0,0,0,0,0,13134,\n0,0,0,0,0,0,0,0,0,0,0,13150,0,13168,0,0,0,0,0,0,0,0,0,13169,0,0,13170,0,0,0,0,\n13174,0,0,0,13176,0,0,0,0,0,13177,0,13178,13183,13187,0,0,0,13189,0,0,13190,0,0,\n13191,0,0,13206,0,0,0,13207,0,0,0,0,0,0,0,0,0,0,13212,0,0,13219,13232,0,0,0,\n13241,0,13249,13253,0,0,0,0,0,13255,13259,0,13260,13261,0,13262,0,13272,0,0,0,0,\n13276,0,0,0,0,13277,13299,0,0,13301,13302,0,0,13303,0,0,13305,0,13310,0,0,0,\n13311,0,0,0,0,13325,0,13328,0,0,0,13329,0,0,0,0,0,0,13330,0,0,13331,0,13335,0,0,\n13342,0,0,0,0,0,13343,0,13354,0,13362,0,13366,13367,13369,0,0,13371,13372,0,\n13373,13374,0,13376,0,13380,13381,13386,0,13387,13388,0,13389,13391,13395,0,0,0,\n0,0,13401,13409,0,13410,0,0,0,0,13420,0,0,0,0,0,13422,0,0,0,0,13423,0,0,0,0,\n13425,0,0,0,0,0,13427,0,0,0,13428,0,0,13430,13438,0,13439,0,13445,0,13448,13449,\n0,0,0,0,0,0,13451,0,13457,0,0,0,0,13458,13459,0,13460,0,0,0,0,13464,13465,13466,\n13470,0,13471,13472,13474,13475,0,13476,0,0,13478,13479,0,13481,0,0,0,0,13487,0,\n13490,0,13493,0,0,13494,0,0,13495,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13496,13497,0,\n13500,0,0,13516,13522,0,0,13525,13528,0,0,0,13530,13535,0,13537,13539,0,13540,0,\n13543,0,13544,0,0,0,0,0,0,13545,0,0,0,0,0,0,13547,0,0,0,13549,13555,0,0,0,13556,\n13557,0,0,0,0,0,0,0,13558,0,13563,0,0,0,0,13564,0,0,0,0,0,0,0,0,13566,0,0,0,0,0,\n0,13569,0,0,13571,0,0,0,0,13573,0,0,0,0,0,0,13578,0,0,0,0,0,0,0,0,0,0,13581,0,\n13586,0,13595,0,13600,0,0,0,0,0,0,0,0,13601,13603,0,13604,13605,13606,13607,0,0,\n13617,13618,0,0,0,0,0,0,0,13623,0,13625,13627,0,0,0,0,0,0,0,0,13629,0,0,0,13634,\n0,0,0,13638,0,0,0,0,0,0,0,0,13654,0,0,0,0,0,0,0,0,0,0,13656,0,13659,0,0,13660,0,\n0,13662,0,0,0,13663,0,13664,0,0,0,0,0,13668,0,13669,13671,0,0,13672,0,0,0,0,0,0,\n13675,13685,0,13686,0,0,0,13687,0,0,0,13692,13694,13697,0,0,0,13702,0,0,0,0,0,\n13705,0,0,0,0,13707,0,0,0,13714,0,0,0,0,0,0,0,0,0,13715,0,13716,13717,0,0,13719,\n13724,13730,13731,0,0,0,0,0,0,0,0,13732,0,0,0,0,0,0,0,13734,0,13736,0,0,13737,\n13738,13747,0,13751,0,0,13752,0,0,0,13753,0,13757,0,0,13762,13763,0,13764,13765,\n0,13766,0,0,13767,0,0,0,13768,0,0,0,0,0,0,0,13769,0,0,13772,0,13775,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,13776,13778,13787,0,0,0,13797,0,13798,0,13801,0,13804,\n13806,0,0,0,0,13816,13817,0,0,0,0,0,0,0,0,0,0,0,0,0,13834,0,13836,0,0,13838,0,0,\n13839,0,13840,0,0,0,0,13842,0,0,0,0,0,0,13843,0,0,0,0,0,0,0,0,0,13845,0,0,0,0,0,\n13858,0,0,13860,0,0,13861,0,0,13862,13863,0,13868,0,13869,13870,0,0,0,0,0,0,0,0,\n0,0,13872,0,0,0,0,13873,13878,0,0,0,0,0,0,0,0,0,0,13886,0,13888,13889,13890,0,0,\n13891,13894,0,13897,13899,13900,13904,0,0,13906,0,0,0,13909,0,0,0,13910,0,0,0,\n13911,0,0,0,0,0,13912,13917,0,0,0,0,13918,0,13919,0,0,13920,0,0,0,13921,0,0,\n13922,0,0,0,0,0,0,0,13924,0,13927,0,0,0,0,0,13932,0,13933,0,13934,0,0,13935,0,\n13944,0,0,0,13954,0,0,13955,0,0,0,0,13956,0,13957,0,13967,13969,0,0,0,0,0,0,0,0,\n0,0,0,0,13970,13990,0,13991,13994,0,13995,0,0,0,0,13996,0,0,13999,0,0,0,14018,0,\n14019,0,14021,0,0,0,0,0,0,14041,0,0,0,0,0,0,0,0,14043,0,0,0,0,14046,0,0,0,14048,\n14049,0,0,0,0,0,0,0,0,0,0,14051,0,0,14052,14056,0,14063,0,14064,14066,0,0,14067,\n0,0,0,0,0,0,0,0,0,14068,0,0,0,14072,0,14074,14075,0,14076,14079,14085,14086,\n14087,14093,0,0,0,0,14095,0,0,0,0,0,0,14096,14097,0,0,0,0,0,0,0,14098,0,14102,0,\n0,0,0,0,14103,0,0,0,14104,0,0,14105,0,0,0,14107,14108,0,0,14109,0,0,0,0,0,0,0,0,\n14117,0,0,0,0,14118,0,0,0,0,14119,0,0,14120,0,0,14121,0,14122,14127,0,14128,\n14136,0,0,14138,0,14140,0,0,0,14141,14142,0,0,0,0,14146,0,0,14149,0,14151,0,0,0,\n14152,0,0,14153,0,0,0,0,0,0,0,0,0,14154,0,14156,14157,0,0,14159,0,14161,0,0,0,0,\n14162,0,0,0,0,0,0,14163,0,0,14173,0,0,0,0,0,0,14174,0,0,14176,0,0,14178,0,0,\n14179,14181,0,0,14182,14185,14187,0,14190,0,0,14197,0,0,0,0,0,0,0,0,0,0,0,0,\n14198,0,0,0,0,0,0,14199,14200,0,0,0,14204,0,0,14208,0,0,0,0,0,0,0,0,0,0,0,14231,\n0,0,0,0,0,0,0,0,0,14234,0,0,14235,0,0,0,14240,14241,0,0,0,14246,0,0,0,14247,0,\n14250,0,0,14251,0,0,14254,0,0,14256,0,0,0,14260,0,14261,0,0,0,0,14262,14267,\n14269,0,0,14277,0,0,14278,0,14279,14282,0,0,0,14283,0,0,0,14284,14285,0,0,0,0,\n14286,0,0,0,14288,0,0,0,14289,0,14290,0,14293,14301,14302,14304,14305,0,14307,0,\n14308,14309,0,0,0,0,0,0,0,0,0,0,0,14311,14312,0,0,14317,0,0,0,0,0,0,0,14318,0,0,\n0,0,14320,0,0,0,0,14321,14322,0,0,0,0,0,14326,14329,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n14330,14331,0,0,0,0,14332,0,0,0,14333,0,0,14337,14340,0,14341,0,0,14342,0,14345,\n14346,0,0,14347,0,14362,0,0,0,0,0,14364,14365,14371,0,14373,0,0,14374,0,14379,0,\n14400,0,0,0,0,0,14401,0,0,14405,0,14406,0,14408,14409,0,0,0,14417,0,0,14424,0,0,\n0,0,0,0,0,0,0,14430,0,0,0,14431,0,0,14435,0,14440,0,0,0,0,0,0,14442,0,0,14443,0,\n0,0,0,0,14446,0,0,0,0,0,0,0,14454,0,14457,0,14460,0,0,14466,0,0,0,0,0,14467,0,0,\n0,0,0,0,14469,0,14477,0,0,0,0,0,0,14478,14482,0,0,0,14483,0,0,0,14485,14486,0,0,\n0,14487,14488,14489,14492,14493,14494,14495,14496,14497,0,14499,0,14501,0,0,0,0,\n0,0,0,0,0,0,14502,0,14507,14512,14513,14514,0,0,0,0,0,0,0,0,0,0,0,14515,14526,\n14530,0,14537,0,14544,0,14547,0,0,14548,14550,14551,0,0,14552,0,0,0,14553,0,\n14554,0,0,0,0,14556,14564,0,0,14565,14566,0,0,0,0,0,0,14568,0,0,14569,0,0,0,\n14571,14576,0,0,14577,14578,14579,0,0,14580,0,0,0,0,14582,0,0,0,0,0,0,0,0,0,0,0,\n0,14583,0,0,0,0,0,14587,0,14588,0,0,14600,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,14601,0,0,14604,14605,14611,0,14613,0,0,0,0,14615,0,0,0,0,0,0,14627,0,14628,0,\n0,0,0,14631,0,14633,14634,0,0,0,0,14635,0,0,0,0,0,0,0,0,14636,0,0,14639,14642,0,\n0,0,0,14644,0,0,0,0,14645,14646,0,14653,0,0,14654,0,14658,0,14661,0,0,0,14665,0,\n0,0,14668,0,0,0,0,0,0,0,0,0,14669,0,0,14670,0,0,0,14680,0,0,14681,0,0,0,0,0,\n14682,14683,0,0,0,0,14686,0,0,0,0,14687,14697,0,0,0,0,14699,14705,14711,0,0,0,0,\n0,0,0,0,0,0,14712,0,0,0,14713,0,0,0,0,14719,0,14720,14721,14726,0,0,0,14728,\n14729,0,0,0,0,14731,0,0,0,0,0,0,0,14733,14736,14737,0,0,14740,14742,0,0,0,14744,\n14753,0,0,0,0,14755,14758,14760,0,0,0,0,0,14761,14762,14765,14771,0,14772,0,\n14773,14774,0,0,14775,0,0,14776,0,0,0,0,14777,0,14779,0,0,14782,0,0,14785,14786,\n14788,0,0,0,0,0,14795,0,0,0,0,0,0,14798,0,14803,14804,14806,0,0,0,14809,0,0,0,0,\n0,0,14810,0,0,0,0,14811,0,14812,0,0,0,0,0,14815,0,0,0,0,0,0,0,0,14816,0,14818,0,\n0,0,0,0,0,14819,0,14820,0,14823,0,0,0,14824,0,0,14826,14827,0,0,0,0,0,0,0,0,0,0,\n0,0,14830,0,0,0,0,0,14833,0,14845,0,0,0,0,0,14846,0,0,14847,14871,0,14873,0,\n14876,0,14877,14878,14880,0,0,0,0,0,14881,0,14882,14894,0,0,0,0,14895,0,14907,0,\n14908,0,0,0,0,0,0,0,14911,0,0,0,0,14920,0,0,14931,0,14932,14934,14935,0,0,14936,\n0,14945,0,0,0,0,0,0,0,14947,0,0,14948,14949,14951,0,0,14952,0,0,0,14964,14973,0,\n0,14990,0,0,0,0,14995,0,0,14998,15001,0,0,15002,15020,0,0,0,0,0,0,15021,0,15022,\n0,0,0,0,15023,0,0,15025,15029,15033,0,0,0,15034,0,0,0,15035,0,0,0,0,0,15043,\n15044,0,0,0,15045,15046,15048,15050,0,15065,0,0,0,0,15066,0,0,15075,15082,15084,\n0,0,15085,15086,0,0,0,0,0,0,0,0,15088,0,0,0,15089,0,0,0,0,15094,0,15096,0,15097,\n0,15100,0,0,15102,0,0,0,0,0,0,0,0,15105,0,0,15106,0,15109,15113,0,0,0,15115,0,\n15118,0,0,0,0,0,0,15119,0,0,15120,0,0,0,0,0,15123,15129,0,0,0,15130,0,15131,0,0,\n15134,0,15135,0,0,0,15137,15138,0,0,0,0,0,0,15139,0,0,0,0,0,15140,0,0,15154,\n15162,0,15169,15170,0,15175,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15177,0,15178,15179,0,\n0,0,0,0,15183,0,0,0,0,0,0,0,0,0,0,0,0,15185,15187,0,15194,15195,15196,0,0,0,0,0,\n0,0,15204,0,0,0,0,15206,0,0,0,0,0,15207,0,0,0,0,0,0,0,0,0,15213,0,15214,0,0,0,0,\n0,0,0,15232,0,0,0,0,15234,0,15238,15240,0,15248,0,0,0,0,15250,15251,0,0,0,0,0,0,\n0,15252,0,0,0,15255,15262,15266,0,0,0,15267,0,0,0,15277,15279,0,0,0,15280,15281,\n15282,0,0,0,0,0,15285,0,0,0,0,15289,0,0,15291,0,0,0,0,0,0,0,15296,15297,0,0,\n15304,0,0,0,0,15306,0,0,0,0,0,0,15307,15308,0,15309,0,0,15311,0,0,15312,15313,0,\n0,0,0,0,0,0,0,0,0,0,0,15314,15317,0,0,0,15318,15319,0,0,0,0,15320,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,15321,0,0,0,0,0,15324,0,15325,15326,0,15330,0,0,0,0,15334,0,\n15335,0,15341,0,0,15342,0,0,15343,15344,0,0,0,0,15345,0,0,0,0,15347,0,0,15348,\n15349,15350,0,15356,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15357,0,15358,0,0,0,0,0,0,0,\n15359,15360,15364,0,15380,0,0,0,0,0,15392,0,0,15393,0,15395,0,0,0,0,0,0,0,0,\n15396,0,0,15397,15398,0,0,0,0,0,0,0,0,0,15399,0,15400,0,0,0,15402,0,15405,15410,\n0,0,0,0,15411,0,0,0,15412,0,15416,0,0,0,0,0,0,0,15428,0,15435,0,0,15438,0,0,0,0,\n15439,0,0,0,15440,0,0,0,15441,15449,15451,0,0,0,0,0,0,0,15452,0,0,15455,0,0,0,\n15456,0,0,15458,0,15460,15461,0,0,0,0,0,15462,15464,0,15465,0,0,15466,0,0,15467,\n0,0,0,0,0,15468,0,0,0,0,15481,0,0,15484,0,15485,15486,0,0,0,15487,0,0,0,0,0,\n15488,0,15492,15498,0,0,0,15499,0,0,0,15500,0,15501,0,0,15512,0,15522,0,0,0,\n15524,0,15525,15526,0,0,15527,0,0,15545,15546,0,15548,15552,0,15553,0,0,0,15554,\n0,15555,0,15557,15565,15573,15577,15578,0,15582,0,15583,0,0,0,0,0,0,0,0,0,0,0,0,\n0,15586,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15588,0,0,0,0,0,15589,0,0,0,0,0,0,0,15593,\n15594,0,0,0,0,15595,0,0,0,0,0,0,15596,0,0,0,15597,0,0,0,0,15600,0,0,15601,0,0,0,\n0,15602,15603,0,0,0,0,0,0,15604,0,15609,0,0,15612,0,0,15613,0,0,15615,15617,\n15618,0,0,15620,0,15636,15637,0,0,15649,0,0,0,0,0,0,0,15650,0,0,15651,0,0,0,\n15656,0,15658,0,0,0,15664,0,0,15665,0,0,15668,0,0,0,0,0,15669,0,0,15674,0,0,\n15675,0,0,0,0,15676,0,0,0,0,0,0,0,0,0,0,0,15677,0,0,0,0,15678,0,0,0,0,0,15679,0,\n0,15681,0,15686,0,0,0,0,15687,0,15688,0,0,15690,0,0,0,15697,0,15699,15700,0,0,0,\n0,0,0,0,0,0,15701,0,15702,15703,0,15704,0,15705,0,15707,0,15709,0,15712,15716,0,\n15717,0,15718,15720,0,0,0,0,0,15724,0,0,0,15725,0,15726,0,0,0,15740,0,15745,\n15746,0,0,15747,0,15748,0,0,0,0,0,15749,0,0,0,15752,0,15753,0,0,0,0,0,0,15759,0,\n0,0,15765,0,0,0,0,0,0,0,0,0,15767,0,0,0,15771,0,0,15784,0,0,0,0,15785,15790,\n15791,0,0,15792,0,0,0,15807,0,15811,0,0,0,0,0,0,0,0,0,0,0,0,15818,0,0,0,15819,0,\n0,0,0,15821,0,0,0,0,0,15822,15824,0,0,15827,0,0,15829,15831,0,15832,0,0,15833,0,\n15835,15838,15839,15843,0,0,0,0,0,0,0,0,0,0,0,15844,0,0,0,0,15845,15851,15856,0,\n0,0,0,0,0,0,15858,15860,0,15861,0,0,0,15864,0,0,0,0,15865,0,0,0,0,0,0,15866,0,\n15872,0,0,15876,0,0,0,0,15877,15878,15883,15885,0,0,15888,0,0,0,0,0,15889,15890,\n0,0,0,0,0,0,0,0,15892,0,0,0,0,0,0,0,15893,0,0,15894,0,0,0,15895,0,15896,15897,0,\n15898,15901,15902,0,15911,15915,0,15916,0,15924,15935,0,15937,0,0,0,0,0,15950,0,\n0,0,0,0,0,0,15958,0,0,0,15961,0,0,15966,0,15967,0,0,15977,0,0,15978,0,0,15981,\n15982,15983,0,0,0,0,0,0,0,15986,0,0,0,15990,0,15991,15995,15998,0,15999,0,16000,\n0,0,0,0,16008,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16009,16011,0,16013,0,0,0,0,\n0,0,0,0,16014,0,0,16015,16023,16024,16025,0,0,16026,0,16030,0,16032,0,16033,0,0,\n0,0,0,0,16035,16036,16037,0,0,0,0,0,16039,0,0,0,0,16041,0,0,0,0,0,16043,16044,0,\n0,16047,0,0,0,16048,0,0,16049,16050,16052,0,0,0,0,0,16055,0,0,0,0,0,0,0,0,16056,\n0,0,0,0,0,0,0,16058,16060,16061,0,0,16063,0,0,16064,0,0,0,16067,16068,0,0,16069,\n16078,0,0,0,16079,0,0,0,16080,0,16081,0,0,0,16088,0,0,0,0,0,0,0,0,0,0,0,16089,\n16093,0,16097,0,16103,0,16104,16105,0,0,16256,0,0,16259,0,0,0,0,0,0,0,16260,\n16261,0,0,16262,0,0,16263,0,16268,0,0,0,0,0,0,0,16269,0,0,16270,16273,0,16274,0,\n0,0,0,16275,16276,16277,16280,0,0,0,16281,16284,0,0,0,16286,0,16289,0,0,0,0,0,0,\n0,0,0,16290,0,0,0,0,16291,0,0,0,0,0,0,0,16292,0,0,0,0,0,0,0,0,16293,16295,16297,\n0,16302,0,16304,0,16305,0,16306,0,0,0,0,0,0,0,0,0,0,0,0,16307,16308,16312,0,0,0,\n0,0,0,16313,16315,0,16318,0,0,0,16321,0,0,0,0,0,0,0,16326,16333,16336,0,0,0,0,\n16337,16340,0,0,0,0,0,16345,0,0,16346,0,0,0,0,0,0,0,0,0,16347,0,0,16348,0,0,0,0,\n16349,0,0,0,16350,0,16357,0,0,0,0,16359,16360,0,0,0,0,16362,16363,16364,16365,0,\n0,16366,0,0,0,0,16367,16368,0,16369,16374,0,0,0,0,0,0,0,16376,0,0,0,0,16378,\n16379,0,16380,0,0,0,16381,16383,0,0,0,0,0,16390,0,0,0,16399,0,16402,16404,16406,\n16407,0,0,0,16409,16411,0,0,0,0,16412,0,16413,16415,16423,0,0,0,0,0,16424,0,0,0,\n16428,16434,16435,16449,0,16450,16451,0,0,0,16453,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n16454,0,0,16456,16458,0,0,16459,0,0,16460,0,0,0,0,16462,0,16463,0,0,16466,0,0,0,\n0,0,16479,0,0,16480,0,16481,16484,0,0,0,0,0,0,0,0,0,0,16485,0,0,0,0,0,0,16489,0,\n0,0,0,0,16491,0,0,16498,0,0,16503,0,16505,0,0,0,0,0,0,0,0,16506,0,0,0,16508,\n16509,0,0,0,0,0,0,0,0,16511,16513,0,0,0,16516,0,16517,0,16519,0,16529,0,0,16531,\n0,0,0,0,0,0,16534,0,0,16541,16542,0,0,0,0,0,0,0,0,0,16543,16547,16548,0,0,0,\n16551,0,16552,0,0,0,16553,0,0,16558,0,0,16562,16565,0,0,0,16570,0,0,0,16573,\n16585,0,0,0,16586,16587,16595,0,16596,0,16598,0,0,0,16600,0,0,0,0,0,0,0,0,0,0,0,\n0,0,16601,0,0,0,0,16603,0,0,0,0,0,0,0,16604,16612,0,0,0,0,16613,0,16618,0,0,0,\n16640,0,0,16641,0,0,0,0,0,0,16645,0,0,0,0,16646,0,0,0,0,0,0,16651,0,0,0,0,16653,\n16654,0,0,0,16655,0,0,16656,16667,0,0,0,0,16671,0,16672,0,0,0,16673,0,0,0,0,0,\n16676,0,16686,0,0,0,0,16689,0,16690,0,16692,0,16693,0,16694,0,16696,0,0,0,16705,\n0,0,0,0,0,0,16707,0,0,0,16709,0,0,0,0,16711,0,16712,16713,0,0,0,16715,0,0,0,0,\n16716,0,0,0,0,0,0,0,0,0,16718,16724,0,0,16726,16727,0,0,0,0,0,0,0,16728,0,16729,\n0,0,16730,0,0,0,0,0,16731,0,0,0,16732,0,0,0,0,16734,16738,0,0,0,0,0,0,0,0,16743,\n0,0,16745,0,0,0,0,0,16749,0,16752,0,0,0,0,16756,0,0,16758,0,16759,0,0,0,0,0,\n16760,0,0,0,0,0,0,0,16762,0,16769,0,16770,0,16772,0,0,0,16777,16780,0,0,0,0,0,0,\n16781,0,0,16782,0,16784,0,0,16785,16787,16792,0,0,16794,0,0,0,16798,0,0,16809,0,\n0,16814,16816,16817,0,16819,0,0,0,0,0,0,0,0,0,0,16820,0,0,16836,16839,0,0,16841,\n16851,16857,0,0,16858,16859,0,0,16860,0,0,0,0,0,0,0,0,16862,0,16863,0,0,0,0,0,0,\n0,16864,0,0,0,0,0,0,0,16876,0,16881,16882,0,16885,16886,0,16887,0,0,0,16889,\n16891,0,0,0,0,0,16894,16895,0,0,0,0,0,0,0,0,0,0,0,16897,0,16898,0,0,0,0,0,16913,\n0,0,16924,16925,16926,0,0,16927,0,0,0,16937,16938,0,0,0,16940,16941,0,0,0,16942,\n16945,0,16946,16949,16950,0,0,0,16952,16955,0,0,0,16965,0,16969,0,0,16975,0,0,\n16976,0,0,0,0,16978,0,0,16981,0,16983,16989,0,0,0,0,16990,0,0,16991,0,0,0,16993,\n0,16994,16996,17000,0,0,0,0,0,17002,17004,0,17006,0,0,17007,0,0,0,0,17008,17013,\n17014,0,0,0,0,0,0,0,0,0,17021,0,17031,0,0,0,0,0,17033,17036,0,17038,0,0,17039,0,\n17045,0,0,17046,17047,0,0,0,0,17048,0,17049,17050,0,17051,17053,0,17054,0,17055,\n0,0,0,0,0,17063,0,0,17064,0,0,0,0,0,0,0,17065,0,0,17068,0,0,0,0,0,17072,0,0,0,0,\n0,0,17073,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17074,0,17080,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,17081,17083,17084,0,0,0,17085,0,0,0,0,17092,0,0,0,0,0,0,0,\n0,0,17093,0,17095,17102,0,0,0,0,0,0,17103,0,0,17105,0,17107,0,0,0,0,17114,0,0,0,\n0,0,17115,17125,17127,0,0,17128,0,0,0,17129,17130,0,17131,0,0,0,0,0,17132,17135,\n17145,0,0,0,0,0,0,0,0,17146,0,17147,0,17148,0,0,0,0,0,0,17149,17150,0,17151,\n17153,0,17155,0,0,0,0,17163,17171,0,17174,0,0,0,0,17179,0,0,17182,17185,0,0,0,0,\n0,17186,0,0,17188,0,0,0,0,0,0,0,17189,17191,0,17194,0,0,0,0,0,0,0,0,0,17195,\n17196,17203,17204,0,0,17205,17217,0,0,0,0,0,17218,0,0,0,0,17219,0,17220,0,17221,\n0,0,17230,0,0,0,0,0,17236,0,17238,17239,0,0,0,17241,17244,0,0,17245,0,17248,0,0,\n17251,0,17252,0,0,17264,0,17266,0,0,0,17268,0,0,0,0,17271,17272,0,17273,0,17295,\n0,17302,0,17305,0,0,0,17306,0,0,0,0,0,0,0,17308,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n17309,0,17310,17313,0,0,0,0,17314,17315,0,17317,0,0,0,0,17318,0,0,0,0,0,0,0,\n17320,0,0,0,0,0,0,17334,0,17344,17348,0,0,0,17350,17351,0,0,17353,0,0,17354,0,0,\n0,0,0,0,0,0,0,17355,0,0,0,0,0,0,17356,17357,0,0,17359,0,0,0,17371,0,17372,0,0,0,\n17393,0,0,0,0,17394,0,0,0,0,0,17395,0,0,17399,0,0,0,17401,17417,0,17418,0,17419,\n0,0,0,0,0,17422,17423,0,0,0,0,0,17424,0,0,0,0,0,17428,17429,17433,0,0,0,17437,0,\n0,17441,0,0,17442,0,0,17453,0,0,0,0,0,0,0,0,17454,17456,17462,0,0,17466,0,0,\n17468,0,0,17469,0,0,0,0,17470,0,17475,0,0,0,0,0,17479,0,0,0,17483,17484,0,17485,\n0,17486,0,17491,17492,0,0,17493,0,17494,17495,0,0,0,17496,0,0,0,17497,0,0,0,\n17502,0,0,0,0,0,17503,0,17505,0,17507,0,0,0,17512,17513,17514,0,0,17515,0,0,0,\n17519,0,0,0,17522,0,0,17523,0,0,0,0,0,0,0,0,0,17527,0,0,0,17528,0,0,0,17534,0,0,\n0,0,17536,0,0,0,17539,0,17540,17543,17549,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17556,\n0,0,17558,0,17559,0,0,17560,0,0,0,17563,0,0,0,0,0,0,17564,0,0,17565,17566,0,\n17567,0,0,0,0,0,0,17569,17570,0,17575,0,0,0,0,0,0,0,0,0,0,0,17581,0,0,0,17582,\n17583,0,17586,0,0,17587,0,0,0,0,0,0,0,17588,0,0,0,0,17596,17597,0,0,17598,17600,\n0,0,0,0,0,0,17601,0,0,0,17604,0,0,17605,0,0,17607,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,17612,0,0,17618,0,17621,17622,0,0,0,0,17623,0,0,17624,0,0,17630,0,0,\n17631,17633,17634,0,0,0,0,0,0,0,17635,0,0,17636,0,0,17637,0,17638,0,17640,0,0,0,\n0,0,0,0,0,0,0,17641,0,0,0,0,0,0,0,0,0,0,17643,0,0,0,0,17645,0,0,0,0,0,0,0,0,\n17646,17662,0,0,0,0,0,0,0,0,0,17663,17664,0,17665,17666,0,0,0,17669,17671,17673,\n0,17679,0,0,0,0,0,0,0,17684,0,0,0,17686,0,17714,0,0,17720,17722,17726,0,0,17728,\n0,0,17729,0,0,0,17732,0,17733,0,17734,0,0,0,17735,0,0,0,0,17737,0,0,0,0,17739,0,\n0,0,17741,17742,0,0,0,0,17743,17744,17745,0,0,0,17749,0,17750,17751,17752,17754,\n17761,17762,0,17763,0,17766,0,17772,0,0,0,0,0,17775,0,0,0,0,0,0,0,17776,0,0,\n17777,0,0,17778,17779,0,17782,17783,0,0,0,0,0,0,0,0,0,0,17784,0,0,0,0,0,0,0,\n17821,0,0,0,17822,0,0,0,17823,17825,0,0,0,0,0,17826,17831,17832,17833,0,0,17845,\n0,0,0,17846,0,0,0,17848,17850,17854,0,17855,0,0,17859,0,0,0,0,0,0,17860,17861,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17870,17871,0,0,0,0,0,0,17872,0,0,0,17879,0,\n0,0,17881,17883,0,17884,0,17885,0,0,17886,0,0,17887,17891,17953,0,0,0,0,17954,0,\n0,17955,0,17968,0,0,17972,0,0,0,0,0,17974,0,0,0,0,17976,17978,0,0,17983,0,0,0,0,\n18003,0,0,0,0,0,18007,0,0,0,0,0,18009,0,0,0,0,0,0,0,18010,0,0,0,0,0,0,18012,0,0,\n18014,0,0,0,18015,0,0,0,18016,0,18017,0,0,0,18030,0,0,0,0,0,0,0,18031,0,0,18036,\n18037,18038,0,0,18049,18056,0,18057,18058,0,18059,0,0,0,0,0,0,0,0,18062,0,0,0,0,\n18064,0,0,0,0,0,0,0,0,18067,0,0,0,18068,0,0,18075,0,0,18078,18093,18094,0,0,0,0,\n0,0,0,0,18097,0,0,0,0,0,18098,18100,0,0,0,18108,0,18111,0,0,18112,0,18113,0,0,\n18115,18116,0,18118,0,0,0,0,18121,0,0,0,0,18123,0,0,0,0,0,0,0,0,0,18124,0,0,0,0,\n18125,18126,0,18127,0,0,18128,18135,0,0,0,0,0,0,0,0,0,18150,0,0,0,0,0,18151,\n18152,0,0,18156,18164,0,18166,18171,0,0,0,0,0,0,0,0,0,18172,18183,0,18184,0,0,0,\n0,18185,0,18187,0,0,0,0,0,18188,0,0,0,0,0,0,0,0,18189,0,0,18190,0,0,18191,18192,\n0,0,18194,18195,18196,0,0,0,18197,0,18203,0,18204,0,0,0,0,18205,0,0,0,18207,\n18208,0,0,18214,0,0,0,18215,18216,0,0,0,18220,0,0,18222,0,0,0,0,0,18223,0,18225,\n18231,0,18234,0,18235,0,0,0,0,18240,0,0,18241,18242,0,0,0,0,0,18243,18251,0,\n18253,0,18254,0,0,0,18266,0,0,0,0,0,0,18269,18270,18271,18273,18281,0,0,0,0,0,0,\n0,0,0,0,0,0,18282,0,18283,0,18284,0,0,0,0,0,0,18285,0,18287,18289,0,0,18290,0,0,\n0,0,18308,0,0,0,18310,0,0,0,0,0,0,0,0,0,0,0,0,18311,0,18312,18313,0,18315,0,0,\n18316,18320,0,18331,0,18332,0,18336,0,0,0,0,18337,0,18340,0,0,0,0,0,0,0,0,0,\n18341,0,18344,18345,0,18346,0,0,0,0,0,18348,0,18351,0,0,18356,0,0,0,0,0,0,18357,\n0,0,0,0,0,18367,0,0,0,18368,0,18369,0,18370,18371,0,0,0,18437,18444,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,18445,18450,0,0,0,0,18451,0,18452,0,0,0,18453,0,0,0,0,0,18455,0,\n0,0,18456,0,18457,0,18460,0,0,18461,0,0,0,0,0,0,0,0,18466,0,0,18467,0,0,0,0,\n18473,0,0,0,18476,0,18477,0,0,0,18478,18479,18480,0,0,0,18485,0,0,0,18486,0,0,0,\n0,0,0,18488,18490,0,0,0,0,0,0,18491,0,0,0,0,0,18495,0,0,18496,0,0,0,0,0,0,18505,\n0,18521,0,18522,18523,0,0,0,18525,18526,0,0,0,0,0,18527,0,0,0,0,18532,18533,0,\n18534,0,0,0,0,0,0,18535,18537,0,18538,0,0,0,0,0,0,18540,18541,18542,18543,0,\n18546,0,0,0,0,18553,18556,0,0,18558,0,0,18569,18571,0,0,0,18572,0,18574,0,0,0,0,\n18586,0,0,0,0,0,18588,0,0,18589,0,0,0,0,0,0,18590,0,18592,0,0,0,0,18594,0,0,0,\n18596,0,0,18597,18598,0,0,18601,0,0,0,0,18602,0,0,0,18603,18604,0,18605,0,0,0,0,\n18608,0,0,18611,0,0,0,0,0,0,0,0,0,18612,0,18616,0,0,18617,18619,0,0,0,18628,0,0,\n0,18629,0,0,18630,0,0,0,0,0,0,0,18631,0,18632,0,0,18635,18637,0,0,0,0,0,0,18641,\n18643,18648,0,18652,0,0,18653,0,18655,18656,0,0,0,18657,0,0,18666,18674,0,0,0,0,\n18677,18684,18685,0,0,18686,0,0,18690,0,0,0,0,0,0,0,18695,18696,0,0,0,0,0,0,0,0,\n0,0,18697,0,0,18700,0,0,0,0,0,0,18702,0,18708,0,0,18709,0,18710,0,0,18711,0,\n18714,0,0,18718,0,0,0,0,0,0,18719,0,0,18722,0,18726,0,0,0,0,0,0,0,0,0,0,0,0,0,\n18731,0,0,0,0,0,18739,18741,0,0,18742,0,18743,18744,18746,18748,0,18752,18753,0,\n0,18754,18763,0,18765,0,0,0,18766,0,0,0,18769,0,0,0,0,0,18773,18778,18779,18781,\n0,0,18784,18787,0,18788,0,18793,0,0,0,0,0,0,18795,0,0,18800,0,0,0,0,0,18801,\n18804,0,0,0,0,0,0,0,18806,0,0,0,18811,18815,18816,0,0,0,0,18825,0,0,18827,18829,\n0,0,18830,0,0,0,0,18831,0,0,18832,0,0,0,0,18833,0,18840,0,18841,0,18842,0,0,0,0,\n18843,0,18844,0,0,0,0,0,0,18845,18846,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n18848,0,0,0,18853,18860,0,0,18862,18866,0,0,18867,18869,0,0,18874,18881,18891,0,\n0,0,0,0,0,0,0,0,0,18892,0,0,0,0,0,0,0,0,18895,0,18896,0,0,0,18900,0,0,0,18901,0,\n18902,18915,18916,0,0,0,0,0,0,0,0,18919,0,0,0,0,0,18920,0,0,0,18921,18929,0,0,0,\n0,18930,0,0,0,0,0,0,18932,0,0,0,0,18934,18942,0,0,0,18951,18957,0,0,0,0,18958,0,\n0,0,0,18959,18960,0,0,18961,0,0,18962,0,0,0,0,18963,18964,0,0,0,18965,0,18967,0,\n0,0,0,0,0,0,0,0,18968,0,18969,0,18970,18973,18976,0,0,0,0,0,0,18977,0,0,0,18981,\n0,0,0,18990,0,18998,0,0,0,0,0,18999,19003,0,0,19005,0,0,0,19006,0,0,0,0,0,0,\n19008,19011,0,0,19018,0,0,19019,0,19024,0,19031,19032,0,19039,0,19041,19050,0,0,\n0,19051,19055,19056,0,19059,19063,19064,0,0,19088,0,0,0,19093,19094,0,0,0,0,\n19095,0,19096,0,0,0,19097,0,0,19098,0,19099,19100,0,0,19103,0,0,0,0,0,0,0,19111,\n0,0,0,0,0,0,19112,0,0,0,19116,19117,0,19121,19122,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,19123,19124,0,0,0,0,0,0,0,19125,19126,0,19128,0,0,0,0,0,0,0,0,0,0,\n19129,19130,19131,19132,0,0,19146,0,0,19147,19156,19158,0,0,0,0,0,0,0,0,19182,\n19185,0,0,19187,0,0,0,19193,0,0,0,0,0,19194,0,19197,0,0,0,0,19198,0,0,0,0,0,0,0,\n0,0,0,19202,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19203,0,19205,19210,\n0,0,0,19213,0,19218,0,0,0,19223,19229,0,0,19230,0,0,19231,19232,19233,19239,0,0,\n0,0,0,19240,0,19248,19249,0,0,0,0,19254,0,19256,19258,19259,0,0,19261,0,19266,0,\n0,0,19272,0,19278,19281,19282,0,0,0,0,0,0,0,0,0,0,0,0,19283,0,0,19284,0,0,19285,\n19287,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19288,19291,0,19292,0,0,0,0,19297,0,19298,0,0,\n0,0,19302,19303,0,0,0,0,19304,19305,0,0,0,0,19314,0,0,19315,0,0,19321,0,0,0,0,0,\n0,0,19322,0,19333,0,19334,19335,0,19336,19337,0,0,0,0,0,0,0,0,0,0,0,19346,0,0,\n19353,0,19354,19362,0,19366,19367,0,0,19369,0,19375,0,19377,19380,19388,0,0,0,0,\n0,19389,19390,0,0,0,0,19392,0,0,0,0,0,19402,0,0,0,0,0,0,0,0,19412,0,0,19413,\n19422,0,19424,0,0,0,19425,0,0,0,19428,0,0,0,0,19431,0,0,0,0,0,19432,0,0,0,0,0,\n19448,19459,0,0,19461,0,19462,19463,0,19467,19474,19482,0,0,0,0,19494,0,0,0,0,\n19501,0,0,0,0,0,0,0,0,0,0,19502,19504,0,0,0,0,0,0,0,19505,0,0,0,0,19506,19507,0,\n0,0,19508,0,0,19511,0,0,19514,0,19515,0,19516,0,19518,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,19530,0,19537,19538,0,19543,19546,0,19547,19551,0,0,0,0,0,0,19552,\n19553,0,0,0,0,0,0,0,0,0,0,0,0,19555,0,0,19556,0,0,0,0,0,0,0,0,0,0,0,0,19560,\n19561,0,0,19562,0,0,0,0,0,0,19565,19567,0,19568,0,0,0,19569,19570,0,19578,0,0,0,\n0,19580,0,0,0,0,19581,19584,0,0,0,0,0,0,0,19585,19586,0,0,0,19587,19588,0,19589,\n0,0,0,0,0,0,19592,19593,19599,0,19600,0,0,19604,0,0,19605,0,19606,19608,19610,0,\n19613,19614,0,0,0,0,0,0,19616,19617,0,0,19618,0,0,19619,0,0,0,19620,19621,19631,\n0,0,19632,19634,19636,0,19643,0,0,19644,19658,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,19659,0,0,0,0,0,0,0,0,0,0,0,19675,19677,0,0,0,0,19679,0,19683,0,19684,0,0,\n0,0,0,0,19687,0,0,0,0,0,0,0,0,19688,19689,19692,0,0,0,0,0,0,0,19695,19697,0,0,0,\n0,0,19698,19699,0,0,19700,0,19702,0,0,19703,0,0,0,0,0,0,19704,19708,0,19710,0,\n19713,0,0,0,19715,0,0,0,0,19718,0,0,0,0,0,0,0,19720,0,19722,0,0,19725,0,0,0,0,0,\n0,0,0,0,0,0,0,0,19730,0,0,0,0,0,19731,0,19734,19735,19739,0,0,19740,0,19741,0,0,\n0,19746,0,0,19747,0,19771,0,0,0,0,0,0,0,0,19772,19775,0,0,0,0,0,0,19778,0,0,0,0,\n0,19779,0,0,19780,19790,0,19791,0,0,19792,0,0,0,19793,0,0,19796,19797,0,0,0,\n19799,0,0,0,19801,0,0,0,0,19803,0,19804,0,19805,0,0,19807,0,0,0,19808,0,0,0,0,0,\n0,19809,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19816,0,19821,0,19822,19830,19831,0,0,\n0,19833,0,0,0,0,0,0,0,0,0,0,19838,0,0,0,0,19839,0,0,19843,0,0,0,0,19845,0,0,0,0,\n19847,0,0,19848,0,19849,0,0,0,0,0,0,0,19851,0,0,0,19854,0,0,0,0,0,0,0,0,0,19864,\n0,19865,0,19866,0,0,0,0,0,0,0,19868,0,0,19870,0,0,19871,0,0,19872,19873,19875,0,\n19880,19882,19884,0,0,19885,19886,19888,0,0,0,0,0,0,0,0,0,0,0,0,19890,19892,\n19893,0,0,19894,0,0,0,19895,0,19896,19902,0,0,19903,0,0,19905,0,0,0,19906,0,\n19908,0,19909,19911,0,0,0,19913,19920,0,19938,19939,19940,0,0,0,0,0,0,0,19942,0,\n19943,0,19945,0,0,0,19951,19952,19954,19960,0,19965,0,19971,0,0,0,0,0,19975,0,\n19976,0,19990,0,0,19991,0,19993,0,19995,0,0,0,19998,19999,20001,0,20003,20005,0,\n20011,20012,0,0,0,0,0,0,20014,0,20020,0,0,0,0,20021,0,0,0,0,0,20023,20024,0,0,0,\n0,0,20025,0,0,20027,0,0,20029,0,0,20032,0,0,0,0,20044,20045,0,20048,20049,0,0,\n20050,0,20052,0,0,20054,20057,0,0,0,0,0,0,0,0,0,20059,0,0,20061,0,20062,0,20064,\n0,0,20066,0,0,20067,0,0,0,0,20069,0,0,0,0,0,0,20070,20071,0,0,0,0,0,0,0,0,0,0,0,\n20072,0,0,20073,20074,0,0,0,0,0,20075,0,20078,0,0,0,0,20080,0,20081,0,0,0,0,0,0,\n20095,0,20098,0,0,0,0,0,0,0,20107,0,0,0,0,0,0,0,0,20112,0,0,0,20113,20114,0,0,0,\n20115,20123,20124,0,0,0,20131,20133,20134,0,0,0,0,20136,0,0,20137,20138,20150,0,\n20152,0,0,0,20153,0,0,20154,0,0,0,20158,0,20163,0,0,20164,0,0,0,0,0,0,0,20166,0,\n20168,0,20170,0,20175,0,0,20178,0,0,0,0,20223,0,0,0,0,20224,0,20226,0,0,20230,0,\n20231,0,0,0,0,20232,0,0,20233,20234,0,20244,0,20247,0,0,0,0,0,0,20249,0,0,0,\n20250,0,0,0,0,20251,0,20253,0,20254,0,0,0,0,20256,0,0,20264,0,0,0,0,20266,0,0,0,\n20278,0,0,20279,20282,0,0,0,0,0,20283,0,20284,0,20285,0,20287,20290,0,0,0,0,\n20292,0,0,0,0,20293,20297,0,0,0,0,0,0,20299,0,20300,20303,0,0,0,0,0,0,20307,0,0,\n20308,0,20309,0,20310,0,0,0,0,0,0,20312,0,0,0,20314,0,0,0,0,20315,20316,0,20322,\n0,0,0,0,0,0,20339,0,0,0,20342,0,0,0,0,20352,0,0,0,0,0,0,0,0,0,0,20362,0,0,20365,\n0,20375,20377,0,0,0,0,0,0,0,0,0,0,0,20378,20379,0,20380,0,0,20381,0,20382,0,\n20383,0,20388,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20390,20392,20393,0,0,20395,0,0,0,0,0,\n20396,0,0,0,0,0,0,0,0,20398,20415,0,0,0,20417,0,0,20420,0,0,20426,20428,0,20431,\n0,0,20432,0,20433,20434,20435,0,0,0,0,20440,0,0,0,0,0,20442,0,20443,0,20446,0,0,\n0,0,20448,0,20451,0,0,0,0,0,0,0,0,0,20452,20453,0,0,20454,0,0,0,0,0,0,20457,0,\n20458,0,0,0,20465,0,0,0,0,0,20469,0,0,0,20473,0,20476,0,0,0,0,0,0,0,0,20477,0,0,\n20485,0,0,20486,0,0,20487,0,20496,0,20497,0,0,20498,0,0,0,0,0,0,0,0,0,0,20499,\n20500,0,20501,0,0,0,0,0,20520,20527,0,20529,0,0,0,0,20539,0,0,20540,0,0,0,20543,\n0,0,0,20546,0,0,0,0,0,20548,0,0,20563,0,0,20564,0,20566,0,0,0,0,0,20589,0,0,0,0,\n20590,0,0,20593,20594,0,0,0,0,20595,0,20597,20598,0,0,0,20618,20620,0,0,0,0,\n20621,0,0,0,0,20627,0,0,0,0,0,20628,0,0,0,20629,0,20630,0,0,20639,0,0,0,0,0,\n20707,0,0,20709,0,0,0,20713,20714,0,0,0,0,0,20724,20725,0,0,0,0,20726,20728,\n20729,0,20733,0,20734,0,20735,20736,0,20737,0,0,20744,0,20745,0,20748,0,0,20749,\n0,0,0,0,0,0,0,0,20750,0,0,0,0,20754,0,0,0,20761,0,0,20763,0,0,0,0,0,0,0,20766,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,20767,0,0,0,0,20768,0,20769,20777,0,0,0,0,0,0,20785,0,\n0,0,20786,20795,20801,0,20802,0,20807,0,0,20808,0,0,20810,0,0,20811,0,20812,0,0,\n0,0,0,20813,0,0,20818,20820,20821,0,0,0,20822,0,20823,0,0,0,20826,0,0,0,0,0,0,0,\n20829,20830,20831,0,20832,20836,0,0,20839,0,0,20840,20842,0,20843,0,20844,0,\n20854,0,0,0,20855,0,0,0,0,20856,0,0,0,20869,0,0,20871,0,0,0,0,0,0,0,20873,0,0,0,\n0,0,20876,0,0,0,0,0,20880,0,0,20882,0,0,0,0,20883,20884,0,0,20890,0,0,0,0,0,0,0,\n0,0,20891,0,0,0,0,0,20905,0,20906,20910,0,0,20912,20915,0,0,0,0,0,20916,0,20917,\n0,20919,20920,20922,0,20927,0,20928,20929,20930,0,0,20935,0,0,20939,0,0,20941,0,\n0,0,20943,0,0,0,20946,20947,0,0,0,0,0,20950,0,20954,0,0,20955,20964,0,0,20967,0,\n0,0,0,0,20973,20975,0,0,0,20984,0,20987,20988,0,0,0,0,0,20989,0,0,0,20995,0,\n20998,0,20999,0,0,0,0,21000,21001,0,0,0,0,21008,0,21010,0,21016,0,0,0,21017,\n21018,0,0,0,0,0,21021,21026,21027,21028,0,0,21029,0,0,0,0,0,21030,0,0,0,0,0,0,0,\n0,0,0,0,0,0,21031,21032,0,0,0,0,0,21037,0,0,21038,0,0,0,0,0,0,0,0,0,21039,0,\n21041,0,21046,21047,0,0,0,21049,21053,0,0,21057,21064,21065,0,0,21066,21067,0,0,\n0,21069,0,0,0,21071,21072,0,0,21073,0,21074,0,0,21078,0,0,0,0,21079,0,0,21080,\n21081,0,0,21086,21087,0,21089,0,0,0,0,0,0,0,21091,0,21093,0,21094,0,0,0,0,0,0,0,\n0,21095,0,0,0,0,0,21096,0,21098,0,0,0,0,0,0,0,21099,0,0,21100,21101,21102,0,0,0,\n0,0,21103,0,21104,0,0,0,0,0,21105,21108,21109,0,0,21112,21113,0,0,0,0,0,0,21115,\n21122,21123,0,0,0,0,0,21125,0,0,0,0,0,0,0,0,21129,21131,0,0,21134,0,0,0,21137,\n21142,0,21143,0,0,21144,0,21145,21146,0,21152,21154,21155,21156,0,0,0,21160,0,0,\n0,0,0,0,21161,0,21164,0,21166,0,0,0,0,21170,0,0,0,0,21171,0,0,21172,0,21174,0,\n21175,0,0,0,0,0,21176,21179,21188,0,0,0,21189,0,0,21190,0,0,0,21192,0,0,21193,0,\n0,0,21198,0,21212,0,0,21213,0,0,0,0,0,0,21215,21216,0,0,21223,21225,0,21226,0,0,\n0,0,21227,21228,0,0,21229,0,0,0,0,21230,21236,0,0,0,0,0,0,0,0,0,0,0,0,0,21237,0,\n0,21238,21239,0,0,0,0,21256,0,0,0,0,0,21257,0,0,0,0,0,0,0,21259,0,0,0,21263,0,\n21272,0,21274,0,21282,0,0,0,0,0,0,0,0,21283,0,0,0,0,0,0,0,0,21294,0,0,21297,0,0,\n0,0,21298,0,0,0,21299,0,21300,21302,0,21316,0,21318,21322,21323,0,21324,0,21326,\n0,0,0,21327,21328,0,0,0,21352,0,0,21354,21361,0,0,0,0,0,0,0,0,0,0,0,0,0,21362,0,\n0,0,21363,0,0,0,0,0,0,0,0,0,21366,0,0,21367,21372,21374,0,0,0,21375,21377,0,\n21378,0,0,0,21380,0,0,0,0,0,0,0,0,0,0,21381,0,0,0,0,0,0,21382,0,21383,0,0,21384,\n0,0,21385,0,0,0,0,21389,21390,0,0,0,0,0,0,0,0,0,0,0,0,0,21397,21398,0,0,0,0,0,0,\n0,0,0,0,21399,0,21400,0,0,0,0,21402,0,0,0,21403,21404,0,21405,21406,0,0,0,21407,\n0,0,0,0,0,0,0,0,0,0,0,0,21408,0,0,0,0,21409,0,21421,0,21422,0,0,0,21425,21428,0,\n0,0,0,21429,0,0,0,0,0,21433,0,0,0,0,0,0,0,0,0,0,21434,0,21443,0,21444,21449,0,\n21452,0,21453,21454,0,0,0,21457,0,0,21458,0,0,0,21460,21461,0,0,21464,0,0,0,\n21473,21478,0,0,21479,0,0,21481,21483,0,0,0,0,0,0,0,0,21484,0,0,21485,21486,0,0,\n21488,0,0,0,0,0,0,21523,0,0,21525,0,0,0,0,0,0,0,21526,0,0,0,0,0,0,21529,21530,0,\n0,21531,0,0,21533,0,0,21539,21564,0,21567,0,0,0,0,0,0,0,0,21575,0,0,0,0,21577,0,\n0,0,0,0,21591,0,0,21604,0,0,0,0,0,0,0,0,0,21605,0,21606,0,0,21617,21618,21619,\n21620,0,0,0,0,0,0,0,0,0,0,0,0,0,21623,0,0,0,0,21631,0,21635,0,0,0,0,21639,21646,\n21653,21662,0,0,21663,21664,0,21666,0,0,21667,0,21670,21672,21673,0,21674,21683,\n0,0,0,0,0,21684,0,21694,0,0,0,0,21695,21700,0,21703,0,21704,0,0,21709,0,0,0,\n21710,0,0,0,0,0,0,0,0,21711,0,0,0,21712,0,21717,0,21730,0,0,0,21731,21733,0,0,0,\n0,21737,21741,21742,0,21747,0,0,0,21749,0,0,0,0,0,0,0,0,0,0,0,0,0,21750,0,0,0,0,\n0,21752,0,0,0,0,21753,0,0,0,0,0,0,21755,21756,0,21757,0,0,0,0,0,0,21760,0,0,\n21763,0,0,0,0,0,0,0,0,0,21764,0,0,21766,0,0,21767,0,0,0,0,0,0,0,0,0,21773,0,\n21774,0,0,21775,0,0,0,0,21776,0,0,21777,0,0,0,0,0,0,0,0,0,21780,21787,21788,\n21791,0,0,0,21797,0,0,0,0,0,21805,0,0,0,0,21806,0,21807,21809,0,21810,21811,0,\n21817,21819,21820,0,21823,0,21824,0,0,21825,0,0,21826,21832,0,0,0,0,0,21833,\n21848,21849,0,0,21867,21870,21871,21873,0,0,0,21874,0,0,0,0,0,0,0,0,0,21875,0,\n21878,0,0,0,21879,0,21881,21886,0,0,0,0,21887,0,0,21888,21894,21895,21897,0,\n21901,0,21904,0,0,21906,0,0,0,21909,21910,21911,0,0,21912,0,0,21913,21914,21915,\n0,21919,0,0,0,0,0,0,0,21921,0,0,21922,21933,21939,0,0,0,0,0,0,0,0,0,0,0,21944,0,\n0,0,0,0,21945,0,21947,0,0,0,0,0,0,0,0,0,0,21949,0,0,0,21950,0,0,0,0,0,0,0,0,0,0,\n0,0,0,21951,0,21952,0,0,0,0,0,0,0,0,0,21954,21957,0,0,0,0,21958,0,21959,0,0,0,0,\n0,0,21962,21963,0,0,0,0,0,0,0,0,21964,21965,0,0,21969,21970,0,0,0,21974,0,0,\n21980,21981,0,21982,0,0,0,0,0,21985,0,21988,0,21992,0,21999,0,0,0,0,0,0,22001,0,\n22002,0,0,0,0,0,0,22003,0,0,0,0,0,22004,0,0,0,22008,0,22009,22015,0,0,22016,0,0,\n0,22017,22019,0,0,0,0,0,0,0,0,0,22020,0,0,0,0,0,0,0,0,0,0,22021,22037,0,22039,0,\n0,0,22040,0,0,0,22048,22049,0,0,22053,22055,22056,22059,0,0,22060,22061,0,0,\n22064,0,0,0,0,22066,0,0,0,0,0,0,0,22073,0,0,0,22074,22075,0,0,0,0,0,0,0,22076,0,\n0,0,0,22077,22084,22099,0,0,0,0,0,0,0,22104,0,0,22107,0,22108,0,22109,0,22110,0,\n0,0,0,0,0,0,22111,22119,0,22120,22122,0,0,0,0,22125,0,0,0,22128,22129,0,0,0,0,0,\n0,22141,0,0,0,22142,0,0,22144,22146,0,22148,22149,22151,22154,0,0,0,22162,0,0,0,\n0,22164,22177,0,0,0,0,22179,0,22182,22183,0,0,22184,22188,0,0,0,0,0,0,0,0,22190,\n0,22194,22201,0,0,22208,0,22209,0,22212,0,0,22215,0,22223,22231,0,0,22232,0,\n22234,0,0,22235,22236,0,22237,0,22240,0,0,0,0,0,22241,0,0,0,22242,22246,22247,0,\n0,0,22259,22268,0,22269,0,0,0,0,0,0,0,22270,0,0,0,0,22271,0,22272,0,22277,0,0,0,\n0,0,22278,22280,22283,22286,0,0,22287,22289,0,0,22290,0,22293,0,0,0,0,0,0,0,0,0,\n0,22295,0,22301,22302,0,0,0,22305,0,22308,0,0,0,0,0,0,0,0,0,0,22315,0,0,0,22317,\n0,22334,0,0,0,22335,0,0,0,0,0,22336,0,22338,22344,0,22347,22349,0,22350,0,0,0,0,\n0,0,0,22357,0,0,0,0,0,22358,0,0,0,0,0,0,0,0,0,0,22359,22360,0,0,0,0,0,0,0,0,\n22361,22366,0,0,22369,0,22370,22373,0,0,0,0,0,22375,0,22377,0,0,0,0,0,22378,0,0,\n0,0,22381,0,0,0,0,22382,0,22383,0,0,0,0,0,0,0,0,0,22391,0,0,22392,22395,22396,\n22402,0,0,0,0,0,0,0,0,0,0,0,0,0,22405,0,0,22406,0,0,22408,0,0,22409,22410,0,0,0,\n0,0,0,22424,0,0,0,0,22426,0,0,0,22427,0,22428,0,22432,0,22435,22442,22443,0,0,0,\n0,22444,0,0,0,0,0,22446,0,22454,0,22455,0,0,0,22465,0,22470,0,22471,0,0,0,0,\n22472,22473,0,22487,0,0,0,22488,0,0,0,0,22489,0,0,22499,0,0,0,0,0,0,22514,0,0,\n22515,0,0,0,0,0,0,0,22516,0,0,0,22517,22520,0,0,0,22534,0,0,22535,0,0,22536,0,\n22540,22553,0,22555,0,0,0,0,22561,0,0,22562,0,0,0,0,0,0,0,0,0,0,0,22566,0,0,0,0,\n22567,22568,0,0,22575,0,22579,0,22582,22583,22585,0,0,0,0,0,22586,0,0,22587,0,0,\n22590,0,0,0,0,0,22591,0,22592,0,0,0,0,0,22593,0,22602,0,0,22604,0,0,22609,0,0,\n22618,0,0,0,0,0,0,22619,0,22624,22625,0,0,22638,0,0,0,0,0,22639,0,0,22640,0,0,0,\n0,0,0,0,22644,0,22645,22647,0,0,0,0,22652,22653,0,0,0,22654,0,22655,0,0,0,22656,\n0,0,0,0,0,0,0,0,0,0,22673,22675,22676,0,0,22678,22679,0,22691,0,0,0,0,0,0,0,\n22693,0,0,22696,0,22699,22707,22708,0,0,0,0,0,0,0,0,22718,0,22719,0,0,0,0,22723,\n0,0,0,22724,22725,0,0,0,0,0,0,0,0,0,0,0,0,0,0,22726,22728,0,0,0,0,0,0,0,0,22729,\n0,0,22731,0,0,0,0,22732,22735,22736,0,0,0,0,22739,0,22749,0,0,22751,0,0,0,0,0,0,\n0,0,0,0,0,22758,0,0,0,0,0,22760,0,0,0,0,0,22764,22765,22766,0,22768,0,0,0,0,0,\n22769,22770,0,0,0,0,0,0,22771,0,0,22772,22775,0,22776,22777,22780,0,0,22782,\n22784,0,22787,0,22789,22796,0,0,0,0,0,22798,0,0,0,0,0,0,22802,0,22803,22804,0,0,\n0,0,0,0,0,0,0,0,22805,0,0,22810,22811,22814,22816,0,22825,22826,0,22831,22833,0,\n0,0,0,0,0,0,0,0,22834,0,22836,22838,0,22839,0,0,0,0,0,22840,0,22847,0,0,0,0,0,\n22856,22857,0,22858,22859,0,0,22862,0,0,22864,0,0,0,0,22865,0,0,0,0,0,0,0,0,0,0,\n0,22866,0,22867,22868,0,0,0,0,22869,0,22871,0,22872,0,22873,22881,22882,22884,\n22885,0,0,0,0,0,0,0,22886,22887,0,22894,0,22895,0,0,0,22900,0,22901,0,0,0,0,\n22904,0,0,0,0,22905,22907,0,0,0,22915,22917,0,0,22918,0,0,0,22920,0,0,0,22929,\n22930,0,0,0,22941,22942,0,0,0,22943,0,0,0,22944,0,0,0,0,0,0,0,22946,0,22947,0,0,\n22954,0,22956,0,0,22962,0,0,0,0,0,0,0,22963,0,0,22964,0,0,0,0,0,0,0,22965,0,\n22968,0,0,0,22969,0,0,0,0,0,22970,0,22971,0,0,0,0,0,22978,0,0,22979,0,22987,0,0,\n22989,0,0,0,0,0,0,22990,0,23005,0,0,0,0,0,0,0,23006,23007,23008,0,0,23023,23024,\n23029,0,0,0,0,23030,0,0,0,0,0,23032,0,0,0,0,0,23035,0,0,0,0,23038,0,0,0,23048,0,\n23049,23052,23053,23060,23061,0,23063,0,0,0,0,23067,23068,0,0,0,23069,23073,0,0,\n0,23127,0,23128,0,0,0,0,0,23129,0,23138,23141,0,23149,0,0,23150,0,0,0,23152,0,0,\n0,0,0,0,0,0,23154,0,0,0,0,23157,23159,23160,0,0,0,0,0,0,0,0,0,0,0,0,23180,0,0,0,\n0,23181,0,0,23188,0,23189,0,0,0,0,0,0,0,0,0,0,0,0,23195,0,0,23196,23199,0,0,0,0,\n0,0,0,0,0,23202,0,23204,0,23207,0,23209,23210,0,0,0,0,0,0,23227,23229,0,0,23230,\n23234,23238,0,0,0,23245,23246,23248,0,0,0,0,23249,23254,0,0,0,23265,0,0,0,0,0,0,\n0,23268,0,23276,0,0,0,0,23277,0,23297,0,23298,0,0,0,0,23299,0,23302,0,0,23303,\n23312,0,0,23314,0,23320,0,0,0,0,23324,0,23325,0,23328,0,23334,0,0,0,23337,0,0,0,\n0,23343,23344,23346,0,23348,0,0,0,0,0,0,0,0,23353,0,0,0,0,23355,0,23356,23358,0,\n0,0,23359,23360,0,23361,0,23367,0,23369,0,0,23373,0,23378,23379,0,23382,23383,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,23387,0,0,0,0,0,0,23388,23390,0,0,23393,23398,0,0,0,\n23399,0,0,0,23400,0,0,0,0,23401,0,0,0,23415,0,0,0,0,0,0,0,0,23416,0,23422,0,\n23443,23444,0,0,0,0,23448,0,23454,0,0,0,0,0,0,23456,0,0,23458,23464,0,0,0,0,0,0,\n23465,0,0,0,23470,23471,0,0,23472,0,0,0,23473,23496,0,0,0,0,0,0,0,0,23497,0,\n23499,0,0,23502,0,0,23503,0,0,23513,0,0,23515,0,0,0,23517,0,0,0,0,23518,23519,\n23521,23524,0,23525,23528,23539,0,0,0,0,0,23541,0,0,23544,0,0,23556,0,0,23557,0,\n0,0,0,0,0,0,0,0,0,0,0,0,23559,0,23560,0,0,23561,0,0,23566,0,0,0,0,0,23568,23569,\n23570,0,0,0,0,23571,0,23574,0,0,0,0,0,0,0,0,0,0,0,23575,0,23579,0,0,23581,0,0,0,\n0,0,0,23587,0,0,0,0,0,0,0,23596,23598,0,0,0,0,23602,23606,0,0,23607,0,23608,0,0,\n0,23614,23616,0,0,0,0,0,23618,0,0,23619,0,0,0,0,23621,23626,0,23627,0,0,0,0,0,0,\n0,23629,0,23630,0,0,0,0,23634,0,23636,0,0,0,0,0,0,23638,0,0,0,0,23640,23667,0,\n23669,0,0,0,23681,0,0,0,0,0,0,0,23682,0,23683,0,0,0,0,0,23684,0,0,0,23685,23689,\n0,23693,23694,23700,0,23702,0,23709,0,0,0,0,0,0,0,23712,0,0,0,0,0,23714,0,0,\n23715,0,0,0,0,23718,0,0,23720,0,0,0,0,23722,0,0,0,23726,23729,0,23741,23746,0,\n23748,0,0,0,0,23749,0,0,0,0,0,23750,0,0,0,0,23751,0,23753,0,0,0,0,23757,23765,0,\n0,0,23770,0,0,0,0,0,0,0,23771,0,23772,23781,0,0,23796,0,0,0,0,23798,0,23799,0,0,\n0,23802,0,0,23806,0,23807,0,0,23808,0,23809,0,23819,0,0,0,23821,0,23827,0,0,0,\n23829,0,0,0,0,0,0,0,23830,0,0,0,0,0,0,23832,23833,23834,23835,0,0,0,0,23837,\n23838,0,0,0,0,0,23846,0,0,0,0,0,0,23847,0,0,0,0,0,23879,23881,0,0,23882,23883,\n23895,0,23899,0,0,0,0,23901,0,0,0,0,0,0,23902,0,0,0,0,0,23903,23905,0,23906,0,\n23907,23918,23919,23920,0,23922,0,23924,0,23927,0,23934,0,23937,23941,0,23942,\n23946,0,0,0,0,0,23955,23956,23958,0,0,0,0,0,0,23959,0,23962,23965,0,23966,0,0,0,\n0,23967,23968,0,0,23973,0,0,23974,0,0,0,0,23975,0,23976,0,0,0,0,0,0,0,0,0,0,0,0,\n0,23977,0,0,0,0,0,0,0,0,23980,0,0,23984,0,23985,0,0,23987,0,0,23988,23990,23991,\n0,0,0,0,0,0,23992,0,0,0,0,0,0,0,0,23994,0,0,0,23998,0,0,0,0,0,0,0,0,0,23999,0,0,\n24003,0,24004,0,24006,0,0,0,24007,0,0,24008,0,0,0,0,0,0,0,24009,0,0,24010,0,0,\n24011,0,0,24013,24014,0,0,24015,24016,24027,0,24028,24029,0,24030,0,0,0,0,0,\n24033,24034,0,24035,0,0,24036,0,0,24044,0,24048,24049,24063,24067,0,24068,24070,\n0,0,24071,24078,24087,0,24090,0,0,0,24095,0,24098,24101,24104,24106,0,24107,0,0,\n0,24108,0,0,0,0,24110,24111,0,24113,0,0,24115,24120,0,0,0,0,0,0,24124,0,24125,0,\n24126,0,24127,0,0,0,0,0,24135,0,0,24136,0,24137,24142,0,0,0,24146,0,0,24147,\n24149,24154,0,24163,0,0,0,24165,24166,24167,0,0,0,0,0,0,0,0,0,0,24169,24170,\n24175,0,0,0,24178,0,0,24179,0,0,24181,0,24184,24197,0,24201,24204,0,0,0,0,0,0,\n24206,24212,24220,0,0,0,24224,0,0,0,0,0,0,0,0,24226,0,24234,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,24235,0,24236,0,0,0,0,0,24239,24240,24241,0,0,24248,0,0,24249,0,\n24251,0,0,0,0,0,0,24253,0,24268,0,0,0,24269,0,24271,24272,0,0,0,0,24273,0,0,\n24274,0,0,24279,0,0,0,0,0,0,0,24280,0,24293,24294,0,0,0,0,0,0,24296,0,0,24323,0,\n0,0,24329,24330,24331,24339,0,24351,0,0,24369,24370,0,0,0,24371,0,0,0,0,24372,\n24373,24374,0,0,0,0,0,24378,0,0,0,0,24379,0,24381,0,24383,24389,0,24390,0,0,\n24394,24395,24400,0,0,0,24401,24402,0,24406,0,0,0,24411,0,0,0,24415,0,24416,0,0,\n0,0,0,24417,0,24419,0,24422,0,24423,24428,0,24435,0,0,0,24439,0,0,0,24440,24442,\n24446,0,0,0,24447,24448,24449,24452,0,0,0,0,24453,24457,0,0,24458,24459,24460,0,\n24465,0,0,0,0,0,0,0,24470,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24471,0,24473,\n24474,24475,24476,0,24478,0,0,0,0,24480,0,0,0,0,0,0,0,0,0,0,24481,0,0,0,0,0,0,0,\n0,0,0,24482,24485,0,0,0,0,24486,0,0,0,24488,0,0,0,24494,0,0,0,0,24497,0,0,24498,\n0,0,0,24499,24506,0,0,0,24507,0,0,24511,0,0,24513,24514,0,0,0,0,0,24517,0,24518,\n0,24520,0,24521,24524,24525,0,0,0,0,0,24527,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24528,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24537,24539,0,24540,0,0,0,24548,0,0,0,0,0,24549,\n24550,0,0,0,24553,24554,0,24555,0,24556,0,24558,0,0,0,0,0,24560,0,0,0,24561,0,0,\n0,0,0,24562,0,0,0,0,0,0,0,0,0,0,0,0,0,24567,0,0,0,0,0,24569,0,0,0,24574,0,24575,\n0,0,0,0,0,0,0,0,0,0,0,24577,24581,0,24584,0,0,0,0,0,24585,0,0,0,0,0,24586,0,0,\n24587,0,24588,0,0,0,0,0,0,0,0,0,0,24590,24591,0,0,0,0,24592,0,0,0,0,0,0,0,24594,\n0,0,0,0,0,0,0,24596,24597,0,0,0,0,24602,24603,0,0,0,0,24604,0,0,24605,0,24610,0,\n0,24611,0,0,0,0,24612,24615,24616,24624,0,0,0,24627,0,24638,24639,0,0,0,0,24640,\n0,0,0,24655,24656,24657,0,0,0,0,0,0,0,0,24662,0,24663,24664,0,0,0,0,0,24665,0,0,\n0,0,24667,0,0,0,0,0,0,24668,24669,0,24670,24674,0,0,0,24675,0,24678,0,0,24679,0,\n0,0,24681,0,24683,0,0,0,0,24684,0,24685,0,0,24686,0,0,24688,24689,0,0,0,0,24690,\n24691,0,0,0,0,0,0,0,24697,0,24698,0,0,0,0,0,0,0,0,24709,0,0,0,0,0,24710,0,24712,\n0,0,0,0,0,0,24713,24714,0,24715,0,24716,24718,0,24719,0,0,0,0,24720,0,0,24725,0,\n0,24738,0,24749,24750,0,0,0,24752,0,0,0,24753,0,0,0,24758,0,0,0,0,0,24762,0,\n24763,0,0,0,0,0,0,0,24764,0,0,0,0,0,24765,24767,24768,0,24772,0,0,0,0,24773,0,0,\n0,0,24777,0,0,0,0,0,24785,0,24786,24788,0,0,0,24789,0,0,0,0,24794,24798,0,24799,\n24800,0,0,0,24803,0,24804,24806,0,24807,0,0,0,24810,0,0,0,0,0,0,24827,24828,0,\n24835,0,0,0,0,0,0,24836,0,0,0,0,0,24839,0,24843,24844,0,0,0,0,0,0,0,0,0,0,24847,\n0,0,24848,0,0,0,0,0,0,24849,0,24850,24851,0,0,0,24852,0,24853,0,0,0,0,0,0,0,0,0,\n24854,0,24855,0,0,24868,0,0,0,24883,0,0,0,24884,0,24895,24897,0,0,0,0,0,24899,0,\n0,0,0,0,24900,0,24913,0,0,0,0,0,0,24914,0,0,24917,24930,24931,0,0,0,24932,0,0,\n24939,0,0,24942,0,0,0,0,0,0,0,0,0,24945,24950,0,24951,0,0,24953,0,0,0,24954,0,\n24959,0,0,0,24961,0,0,24962,0,24964,24968,24970,24972,0,0,0,0,0,24976,0,0,0,\n24977,0,24982,0,0,24983,0,0,24984,0,0,0,24993,0,0,0,24994,0,0,25001,0,0,0,25003,\n0,0,25018,0,0,25023,0,0,0,25034,0,0,25035,25036,0,25037,0,0,0,0,0,0,0,25039,0,0,\n0,0,0,25040,0,0,0,0,0,0,0,25042,0,0,25043,25045,0,0,0,0,0,0,25049,0,0,25051,0,\n25052,25053,0,0,25054,0,0,0,25055,0,0,0,0,25057,25059,0,0,25060,25064,0,25065,\n25069,25070,0,0,0,0,25072,0,25073,0,25090,0,0,25092,25093,25101,0,0,0,0,0,0,\n25105,25108,0,0,25113,0,0,25115,25116,0,0,0,0,0,0,25117,0,0,0,25120,25121,0,0,0,\n0,0,0,0,25125,0,0,0,25126,0,25130,25134,0,25139,0,25143,0,0,0,25151,0,25161,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,25163,0,0,0,0,0,0,0,25174,0,25175,0,25207,0,0,\n0,25209,0,0,0,0,25213,0,25219,0,25223,0,25225,0,0,0,25227,0,0,0,25228,0,0,0,\n25229,0,0,0,0,0,0,0,25231,25233,0,0,0,0,25237,25239,0,0,0,25243,0,0,0,25252,0,\n25257,25258,0,0,0,0,25260,25265,0,25268,0,0,25273,25324,0,25325,0,25326,0,0,0,0,\n0,0,0,0,25327,0,0,0,0,0,25328,0,0,0,0,0,0,25332,0,0,0,25333,0,0,0,25336,25337,\n25338,0,0,25343,0,25350,0,0,0,0,0,0,0,25352,0,25354,0,25375,0,25379,0,0,0,0,\n25384,0,0,0,0,0,0,0,0,0,25386,0,25388,0,25390,0,0,25399,0,0,25401,0,0,0,25402,0,\n0,0,25407,0,0,0,0,0,0,0,0,0,0,0,25413,25415,0,0,25417,0,0,0,0,0,0,0,25419,0,0,0,\n25421,0,0,0,25424,0,0,0,0,25433,0,0,0,0,0,0,0,0,0,25435,0,0,0,0,0,0,25436,0,0,0,\n25437,0,0,25440,0,0,0,0,0,0,25442,0,0,25443,0,25446,0,0,25449,0,0,0,25450,0,0,0,\n0,25452,0,25453,25454,25455,0,0,0,25456,0,25457,0,0,0,25459,0,25461,0,25468,0,0,\n0,0,0,0,0,0,25469,0,0,0,0,0,25471,0,0,0,0,0,25474,0,0,0,0,0,0,0,0,25475,0,0,0,0,\n25477,0,0,0,0,25483,0,0,0,0,0,25484,0,0,0,0,0,0,0,0,0,0,0,0,25485,0,25497,0,0,\n25498,0,25504,0,25510,0,25512,0,0,25513,25514,0,0,0,0,0,0,25517,25518,25519,0,\n25520,0,0,0,0,0,0,0,25521,0,25522,25527,25534,0,25536,0,25537,0,0,25548,25550,0,\n0,25551,0,25552,0,0,0,0,0,25554,0,25555,0,25556,25557,25568,0,0,0,25570,25571,0,\n0,0,0,0,0,25574,0,0,0,0,25579,0,0,0,25581,0,0,0,25582,0,0,0,0,0,0,0,0,0,25588,0,\n0,0,0,25589,0,0,0,0,25590,0,25591,25592,25593,0,25594,0,0,0,25596,0,25597,25615,\n0,0,0,0,0,25618,0,0,0,0,25619,25623,0,0,25629,0,0,25631,0,0,0,25635,25636,0,0,\n25649,0,0,0,0,25654,0,0,0,25661,25663,0,0,25671,0,0,25678,25698,0,25699,25702,\n25703,0,0,0,0,0,0,0,0,25704,0,0,0,0,0,25706,0,0,25710,0,25711,0,25712,0,25715,\n25716,25717,0,0,25718,25728,25732,0,0,0,25734,0,0,0,0,0,0,0,0,0,25737,0,0,25739,\n0,0,0,25740,0,25741,25745,0,25746,0,25748,25772,25778,0,0,0,0,0,25780,0,0,0,0,\n25781,0,25782,25784,25785,0,0,0,25789,0,0,0,0,0,0,25797,25801,0,0,0,25808,25809,\n0,0,25811,25814,25815,0,0,25817,0,0,0,0,0,0,0,0,25820,0,0,0,0,25832,25833,0,0,0,\n25846,0,0,0,25847,25848,0,0,0,0,0,0,0,0,0,25849,25850,0,0,25851,0,0,25852,0,\n25862,0,0,0,25863,25865,0,0,0,0,0,0,0,25867,25868,0,25869,25874,0,25875,0,25876,\n25877,0,0,0,0,25878,25902,0,0,0,0,0,0,0,25903,25904,25905,0,0,0,25908,25909,0,0,\n0,0,25910,0,0,0,0,0,0,0,25912,0,25913,0,0,0,0,0,0,0,0,25914,0,0,25916,0,0,0,0,0,\n25917,25927,0,0,0,0,25928,0,0,25930,0,0,0,25933,0,0,25938,25942,0,0,0,0,0,0,0,\n25945,0,25950,0,25956,0,0,25961,25962,0,0,25963,0,25964,25965,25966,0,0,0,0,0,\n25967,0,0,0,0,25968,0,0,0,25969,25971,0,0,0,0,0,25973,25975,0,0,0,0,0,0,0,25978,\n0,25981,0,0,0,25982,0,0,0,25984,0,0,0,0,0,0,0,25993,0,0,0,0,0,0,0,0,0,0,0,0,0,\n26002,0,0,0,26005,0,0,0,26006,26007,0,0,26014,26015,26016,0,0,0,0,0,0,26017,\n26018,26020,0,26022,26023,0,0,0,26024,26028,0,26029,26033,26034,26044,0,0,0,0,0,\n26046,0,0,26047,0,0,26049,0,26050,0,26051,0,0,0,0,0,26053,0,0,0,0,26054,26059,0,\n0,0,0,0,0,26060,0,26066,0,0,0,0,0,0,0,0,0,0,0,0,26067,0,26069,0,0,26071,0,0,0,\n26073,0,26074,26077,0,0,0,0,26078,0,0,0,26079,0,26090,0,0,26094,0,0,0,0,0,0,0,0,\n26095,0,0,0,0,0,0,0,0,0,0,0,26096,26101,0,26107,26122,0,26124,0,0,26125,0,0,0,0,\n0,0,26136,26141,26155,0,0,0,0,0,0,0,0,0,26164,26166,0,0,0,26167,0,26170,26171,0,\n0,26172,0,0,26174,0,0,0,0,0,0,0,0,0,0,0,0,0,26175,0,0,0,26176,26177,0,26321,\n26322,0,26323,0,0,26324,0,0,0,0,0,0,0,26325,0,26331,0,0,0,0,0,0,26335,0,0,0,\n26350,0,0,0,26379,0,0,26382,26383,26385,0,0,26392,26406,0,0,0,0,26411,0,0,0,0,0,\n26412,0,0,26420,0,0,26423,0,26424,26426,26432,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n26435,0,26436,0,0,0,0,0,26441,0,26444,0,0,0,26446,0,0,0,0,26447,0,0,0,0,26449,0,\n26450,26452,0,26453,26454,0,0,0,26455,0,0,0,26456,0,0,26458,0,0,26460,0,26463,0,\n0,0,0,0,0,0,0,26464,26470,0,0,0,0,0,0,0,0,0,26473,0,0,26474,0,0,0,0,0,0,0,26475,\n0,0,0,0,0,0,0,26477,0,26485,0,0,26486,0,26487,0,0,26488,26493,26494,0,0,26495,0,\n26497,26504,26506,0,0,0,0,0,26507,0,0,0,0,0,26509,0,0,26510,0,0,0,0,0,0,0,0,0,0,\n0,0,0,26512,0,26513,26515,0,0,0,26518,0,0,0,26519,0,26524,26526,0,0,0,26527,0,\n26532,0,26533,26537,26558,0,0,0,26559,0,0,0,26571,0,0,26573,0,26588,0,26593,0,0,\n0,0,0,0,26603,0,26604,0,0,0,0,0,0,0,0,0,0,26606,0,0,0,0,0,0,0,26607,26609,26611,\n26614,0,0,0,26616,26620,0,26621,0,0,0,0,0,26627,0,26629,0,0,26630,0,0,26632,\n26643,0,0,0,26644,0,0,0,0,0,0,0,0,0,26646,26647,0,0,0,26650,0,0,26656,0,0,0,0,\n26663,26670,26671,0,0,0,26685,26686,26687,0,26689,0,0,0,0,26744,0,26745,0,26747,\n26748,0,26749,26750,26751,0,0,0,0,26752,26755,0,0,0,26756,26769,0,0,0,26774,0,0,\n0,0,0,26775,0,26777,26778,0,26786,0,0,0,26787,0,0,0,0,0,0,0,0,0,0,0,0,0,26788,0,\n0,26789,0,0,0,0,0,26791,0,26792,26793,0,0,0,26794,0,26797,26798,0,0,0,26800,0,0,\n26803,0,26804,0,0,0,0,0,0,0,0,0,26805,0,0,26808,0,0,26809,0,0,0,0,0,0,0,26812,0,\n26825,0,0,0,0,0,0,0,26826,0,0,26827,26829,26834,0,0,0,0,26835,0,0,26849,0,26851,\n0,0,0,0,0,0,0,0,0,26852,0,26853,26857,0,26858,0,26859,0,0,0,0,0,0,0,26876,0,\n26878,26882,26883,0,0,0,0,26890,26894,0,0,0,0,26895,26896,0,0,0,0,0,26900,0,0,0,\n0,0,0,0,26911,26913,26914,26915,26916,26919,0,0,0,26921,26922,0,0,26925,0,0,0,\n26928,0,0,26929,26930,0,0,0,26931,0,26932,0,0,0,0,0,26933,0,0,0,0,0,0,26937,0,0,\n26943,0,0,26944,0,0,0,26946,0,0,0,0,0,0,0,26956,0,26958,0,0,26963,0,0,0,0,0,0,0,\n26965,0,26969,26970,26972,0,0,0,0,0,26973,0,26974,0,26978,0,26980,0,0,0,0,0,0,\n26982,0,26986,26987,0,26990,0,0,0,0,27003,27006,0,0,27007,27010,27012,27013,0,0,\n0,0,0,0,0,0,27014,27015,27018,0,27019,0,0,0,0,0,27025,0,0,0,27026,0,0,0,0,27029,\n27030,27031,27034,0,0,27036,27037,0,0,0,27038,27042,0,0,0,27044,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,27045,0,0,0,0,0,0,0,27046,0,0,0,0,0,0,0,27047,27049,0,27050,0,0,0,\n27051,27052,0,27055,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,27056,27058,27059,0,\n27061,0,27064,0,0,0,0,0,27069,0,0,27070,0,0,0,0,0,0,0,27072,0,0,0,0,0,0,0,0,\n27076,0,0,0,0,0,27078,0,27079,0,0,0,27081,0,0,0,0,0,0,27082,0,27083,27086,0,0,0,\n0,27087,0,0,0,0,0,27088,27090,0,27094,0,0,27095,0,27099,27102,0,0,0,27103,0,0,0,\n0,27105,0,0,0,27106,0,0,0,0,0,0,27107,0,0,0,0,27108,27117,0,0,0,0,27118,0,0,\n27124,0,27126,0,0,27130,27131,0,0,0,0,0,0,27147,0,0,0,0,27148,27149,0,0,0,0,\n27150,27151,0,27152,0,27159,0,0,0,27164,0,0,0,0,0,0,0,27175,0,27189,0,0,27191,0,\n27193,0,27195,0,27198,0,0,0,0,0,27200,0,0,0,0,27202,0,0,0,0,27203,0,0,27204,0,0,\n27206,0,27207,0,0,0,0,27209,0,0,0,27213,0,0,27216,27219,27220,27222,27223,0,\n27224,0,27225,27226,0,0,27233,0,0,0,0,27235,0,27237,0,27238,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,27239,0,27242,27243,0,27250,0,0,0,27251,0,27253,0,0,0,0,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,27254,27255,27258,0,0,0,27259,0,0,0,0,0,0,27267,0,27276,27278,\n0,0,0,0,0,0,0,0,0,27296,27297,27301,0,0,0,0,0,0,27302,0,0,0,0,0,0,27312,27313,0,\n0,0,0,0,27318,0,27320,0,27329,0,27330,27331,0,27332,0,0,0,0,27340,0,0,0,27348,0,\n0,0,0,0,0,27350,0,27351,0,0,0,0,27355,0,0,27358,27359,27361,0,0,0,27365,0,27367,\n0,27376,27378,0,0,27379,0,0,0,0,0,0,27396,0,27397,27404,0,0,0,0,0,27408,0,0,0,0,\n27453,0,0,0,27456,0,0,0,27458,0,0,0,0,0,0,0,27459,0,0,0,27460,0,0,27461,0,27465,\n27467,0,0,27469,0,27470,0,27471,0,27477,27482,0,0,0,0,0,0,27484,0,0,0,0,0,0,\n27485,0,0,0,0,0,27493,0,27494,27502,0,0,0,0,0,0,0,0,0,0,0,0,27511,27532,0,0,0,\n27533,27545,0,0,0,27546,0,0,0,0,0,0,0,0,0,0,27547,0,0,27549,27550,0,27551,0,0,0,\n0,0,0,0,27555,0,0,27571,0,27573,27574,27575,27577,0,27578,0,0,27579,27585,0,0,0,\n0,0,27586,0,0,27588,27589,0,0,0,0,27596,0,0,27600,0,0,0,0,0,0,0,0,0,0,0,27608,0,\n0,0,0,0,0,0,0,0,0,0,27610,0,0,0,27618,0,0,27620,0,0,0,27631,0,0,27632,27634,0,\n27636,27638,0,0,0,27643,0,27644,27649,0,0,0,0,0,0,0,0,0,0,0,0,0,27651,27660,0,\n27661,0,0,0,0,0,0,0,27662,0,0,27664,0,27665,0,0,0,27669,0,27671,0,0,0,27673,\n27674,0,0,0,27682,0,0,0,27711,0,27712,27713,27719,27720,0,0,27728,0,27729,0,0,0,\n0,0,0,0,0,0,27731,0,0,27732,0,27733,0,27738,0,0,0,27742,0,0,0,27743,27744,0,0,0,\n0,0,0,27745,27746,0,0,0,27747,27748,27751,27752,0,0,0,27768,27770,0,0,0,27774,\n27775,0,27776,27777,0,0,27781,0,27784,0,27786,0,0,27791,0,27792,27793,27804,0,\n27812,27813,0,0,0,0,0,0,0,0,27814,0,27825,0,27827,0,0,0,0,27828,27861,27862,0,0,\n0,27864,0,0,0,27865,27884,0,27889,0,0,0,0,0,27890,0,27891,0,0,0,27892,0,0,0,0,0,\n27897,27898,0,0,27899,0,0,0,27901,27905,0,0,27920,0,0,27921,0,27922,0,0,0,27931,\n27934,0,0,0,0,0,0,0,0,0,0,27941,0,27942,0,27945,0,27947,27954,0,0,0,0,27960,\n27963,0,0,0,0,0,0,0,0,27964,27965,0,0,0,27967,0,27969,27975,0,27976,27977,0,\n27981,0,27983,28051,28052,0,0,0,0,0,28056,0,0,0,0,0,0,28058,28059,0,0,28061,0,0,\n0,0,0,0,0,28063,0,0,0,0,0,0,28066,0,0,0,0,0,0,28069,28070,28072,0,28073,0,0,\n28074,0,0,0,0,28075,0,0,0,0,0,0,0,28078,0,0,0,0,28085,0,0,0,0,28086,0,0,0,0,0,0,\n28088,0,0,0,0,0,0,0,0,28090,0,28097,28114,28115,0,0,0,0,0,0,0,28116,0,0,0,0,0,\n28118,0,28129,0,28131,0,0,28135,0,0,0,28140,28141,0,0,0,28146,0,0,0,0,28152,0,0,\n0,0,28155,28157,28161,0,0,0,0,28166,0,28167,0,0,0,0,0,0,0,0,0,0,0,28172,0,0,0,0,\n0,0,28173,0,0,28175,0,0,0,0,0,0,0,0,0,28178,28188,0,28190,0,0,0,0,0,28191,0,\n28193,28206,0,0,28207,28209,0,28211,0,28213,0,0,0,28215,28216,28217,0,28222,0,\n28223,28225,0,0,0,28226,0,28227,28229,28232,0,0,0,0,0,0,0,0,0,28235,0,28241,0,0,\n28242,0,0,0,0,28243,0,0,0,28245,0,0,0,28248,28250,0,28251,28252,0,0,0,0,0,0,\n28253,0,0,28254,28255,0,0,28256,0,0,28258,0,0,0,0,0,28259,0,0,28260,0,0,28261,0,\n0,0,0,28262,28263,0,0,28264,0,0,0,28266,0,28268,28269,0,28270,28272,28274,0,\n28277,28278,0,0,0,28279,0,28280,28281,28283,0,28292,0,28294,0,28297,0,0,0,0,\n28299,0,0,0,0,0,28300,0,0,0,0,0,0,0,28301,0,0,0,0,0,0,0,0,0,0,0,0,0,28302,28303,\n0,0,0,0,28304,0,0,28305,0,28312,0,28313,28314,0,0,0,0,0,0,28315,0,0,0,28320,\n28321,0,0,28328,0,0,0,28329,28338,0,28339,0,0,28344,0,0,0,0,0,0,0,0,28347,0,0,0,\n0,0,0,0,0,28348,0,0,0,0,0,28411,0,28412,28413,0,28416,0,0,0,28420,0,0,0,0,0,\n28421,0,0,0,0,28423,0,0,0,28424,0,0,28428,0,0,0,0,0,28429,0,0,0,28431,28434,0,\n28458,0,0,0,0,0,0,0,0,0,0,0,28464,0,0,0,0,28465,0,28467,0,0,0,0,0,0,28471,0,0,0,\n0,28474,0,28480,0,28481,0,0,28485,0,0,0,0,28486,28488,0,0,28489,0,0,0,0,28492,0,\n0,0,28495,0,28497,0,28499,0,0,0,0,28500,0,0,28502,28503,0,0,0,28508,0,0,0,28510,\n0,0,28512,28513,28514,28521,0,28526,0,28527,28528,0,0,0,0,28529,0,0,28532,0,0,\n28537,28538,0,0,0,28539,0,28548,0,28553,28554,0,0,0,0,0,0,0,0,0,0,0,0,28560,\n28563,0,0,28564,0,0,0,0,28565,0,0,0,0,0,0,0,28566,28568,0,0,0,0,0,0,28569,0,0,0,\n28570,0,28572,28573,0,0,0,0,28575,0,0,0,0,28576,28581,28588,0,0,28589,0,0,0,\n28590,28595,0,28598,0,0,28601,0,0,28605,0,0,0,0,28614,28615,28619,0,0,0,0,0,0,\n28620,0,28626,0,0,28628,0,28631,0,28632,0,0,0,0,0,0,28635,0,0,0,28637,28638,0,0,\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28639,0,28643,0,0,28652,0,0,0,28662,0,\n28670,28671,0,0,0,0,0,0,0,0,0,28672,28673,28675,28676,0,0,0,0,0,0,0,28691,0,0,0,\n28695,0,0,0,28696,0,28697,28698,0,28705,0,28707,28708,28710,0,0,0,0,0,0,0,28711,\n28728,0,0,0,28736,0,0,0,28737,0,0,0,0,0,0,0,0,0,28738,0,28739,0,28741,0,0,28742,\n0,0,0,0,0,0,0,0,0,0,0,28745,0,0,0,0,0,0,28749,28750,28752,28754,28756,0,28757,0,\n0,0,0,28759,28760,0,0,0,0,0,0,28762,0,0,0,28764,0,0,0,0,0,0,28766,0,28767,28768,\n0,0,0,0,28769,28770,0,0,0,0,0,0,0,0,0,0,0,0,0,28771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n0,28772,0,28773,0,28782,0,0,0,0,0,0,28784,0,28785,0,28786,0,0,0,28787,0,0,0,\n28797,0,0,0,0,0,0,28799,0,0,28801,0,0,0,0,28802,0,28805,0,0,28806,0,0,28807,0,0,\n0,0,0,0,0,28808,0,0,0,0,0,28810,28812,0,0,28816,28819,0,0,28821,0,28826,0,0,0,\n28842,28852,0,0,28853,0,28854,28855,0,0,0,28857,0,0,0,28858,0,28867,28868,28869,\n0,0,0,28874,28880,28882,28890,28892,0,0,0,0,0,0,0,28895,0,0,0,28898,28899,0,0,0,\n28900,0,0,28904,0,28906,0,0,0,0,28907,0,0,0,0,0,0,28908,0,0,0,28910,0,28914,0,0,\n0,0,0,0,0,28915,28916,28919,0,0,28920,0,28921,0,0,0,0,0,0,0,0,28924,0,0,0,0,\n28926,28929,0,0,0,28930,0,28936,0,28939,0,0,0,0,28942,0,0,0,0,0,0,28956,0,0,0,\n28966,0,0,0,0,28967,0,0,0,0,0,0,0,0,0,28968,0,28971,0,28975,28976,0,28982,28983,\n0,0,28984,28989,28996,28997,28998,0,0,0,0,0,0,28999,0,0,0,0,0,29000,0,29001,0,0,\n0,29009,0,0,29011,0,0,29021,0,0,0,0,29024,0,29025,0,0,0,0,0,29026,0,0,0,29036,0,\n0,0,29037,0,0,0,0,29038,0,29045,0,29047,0,0,0,0,0,0,0,0,0,29051,0,0,0,29054,\n29056,29062,0,29070,29082,0,0,0,29083,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29084,0,0,\n0,0,29085,29088,0,0,0,0,0,0,0,29090,29097,0,0,0,29103,0,0,0,0,0,0,0,0,29105,0,0,\n0,0,0,29107,0,29109,0,0,0,29115,0,0,29120,0,0,29138,29140,0,0,0,0,0,0,0,0,0,\n29152,0,29160,29174,0,29176,0,0,29180,0,29181,0,0,0,0,0,0,0,0,29228,0,0,29229,0,\n0,29230,0,0,0,0,0,0,0,0,0,0,29234,0,0,0,29241,0,29245,0,29248,0,29250,29256,\n29280,0,29282,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29285,0,0,29286,29291,29292,0,0,0,0,\n29294,0,29295,0,0,0,0,0,29296,29297,29298,29300,0,29302,0,0,29304,29307,0,29312,\n0,0,0,29322,0,0,29323,0,0,29324,29326,29328,0,29335,0,0,0,0,0,0,0,29338,29339,0,\n0,0,0,0,29341,29343,0,0,0,0,29344,0,0,0,0,0,29345,0,0,0,0,29346,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,29347,29348,29349,0,0,29354,0,0,29355,0,0,0,0,0,0,0,0,29357,0,0,\n0,0,29364,0,29365,0,0,0,0,0,0,0,29366,0,0,29368,0,0,0,0,0,0,0,0,29378,0,29381,0,\n0,0,0,0,0,0,0,29386,0,0,0,0,0,0,29389,0,0,0,29390,0,0,29391,29397,0,29398,29412,\n29414,29418,29419,0,0,0,0,0,0,0,29420,0,0,0,0,0,0,0,29423,0,0,0,29435,0,0,0,\n29437,0,0,29439,0,29441,0,0,0,0,29443,0,29446,29450,29452,0,0,0,0,0,29456,0,0,0,\n0,0,29461,0,0,0,29464,0,0,0,0,0,0,0,0,29468,0,29473,0,0,0,29486,0,0,0,29490,0,0,\n0,29491,29492,0,0,29497,0,0,0,29498,0,29499,0,29502,29505,0,29509,0,0,0,29510,0,\n0,0,29512,0,0,0,29516,0,0,0,0,0,0,0,0,29518,0,29519,0,0,0,0,0,29520,29521,29529,\n0,0,0,0,0,0,0,0,29530,0,0,29531,29538,0,29540,0,0,0,29542,0,29543,29544,29547,0,\n0,29548,0,0,0,29549,0,0,0,29550,0,0,29552,0,0,0,0,29558,29561,0,29562,29564,0,0,\n29565,0,0,29566,0,0,0,0,0,0,0,0,0,0,29578,29584,29586,29591,0,0,0,0,29593,29594,\n0,0,29597,0,0,29613,0,29614,0,29615,0,0,0,0,29616,29617,0,0,29625,0,0,0,29632,0,\n0,0,0,0,0,0,29633,0,0,0,0,0,29634,29635,29637,0,29638,0,29641,29643,0,0,0,0,0,0,\n29644,0,29645,0,29649,0,0,0,29650,0,29653,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29656,\n29659,0,0,29660,0,0,0,29661,0,0,0,0,0,29664,0,0,0,29671,29673,0,0,0,0,0,0,0,\n29675,0,29677,29679,0,0,29684,0,0,0,0,0,29685,0,0,0,29687,0,0,0,29688,0,29689,\n29690,29700,0,29701,0,0,0,29702,0,29706,0,0,0,0,0,0,0,29720,0,29721,0,29727,0,\n29733,29734,0,29750,29761,0,29763,0,0,0,0,0,29764,0,0,29765,0,0,0,29771,0,0,0,0,\n0,0,0,0,0,0,0,0,29772,0,0,0,29773,29774,29775,0,0,0,0,0,0,0,0,0,0,0,29822,0,0,0,\n29824,0,29825,0,0,0,0,0,29827,0,0,0,0,0,0,0,0,29829,0,29832,29834,0,0,29835,0,0,\n29837,29838,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29843,0,0,0,0,29844,29845,0,0,0,\n0,0,0,0,0,0,29849,0,0,29869,29872,29890,29905,0,0,0,0,0,29907,29921,0,29922,0,0,\n29923,29926,29944,29946,0,0,0,0,0,0,0,29947,29948,0,0,0,29951,0,0,0,0,0,29953,0,\n0,29956,0,29957,0,0,29962,0,0,0,0,29971,0,0,0,29972,0,0,0,0,0,29978,0,29979,\n29992,30007,30008,30010,0,0,0,30013,0,0,0,0,30014,30016,0,0,0,0,0,0,0,0,0,0,0,\n30017,0,0,0,0,0,30023,30031,0,0,30033,0,0,0,0,0,0,0,0,0,0,30034,0,30038,0,30039,\n0,30040,0,0,0,0,0,0,30067,30068,0,0,0,30069,0,30072,0,0,0,30073,0,0,0,0,30075,0,\n0,0,0,0,0,30079,0,0,30080,0,0,0,0,0,30082,0,0,0,0,0,0,0,0,0,0,0,30084,30090,0,0,\n30091,0,0,0,0,30098,30118,0,30119,0,30121,30130,0,0,0,0,0,0,0,0,0,0,0,0,0,30131,\n30132,30133,0,0,0,0,0,0,30135,0,0,0,0,0,0,0,0,0,0,0,30136,0,0,30137,30138,0,0,0,\n30139,30146,0,0,0,0,0,30147,0,0,30148,30151,0,0,0,30168,0,30172,30173,0,0,0,0,0,\n0,0,0,30180,30181,0,30192,0,0,0,0,0,0,0,30194,30196,0,0,30199,0,0,30202,0,0,0,0,\n30203,0,0,0,0,0,0,0,0,0,0,30213,0,0,0,30216,0,0,30217,0,0,0,30218,0,0,0,0,30219,\n0,30220,0,30222,30227,0,0,0,0,0,30231,0,0,30233,30235,0,0,0,0,30238,0,30240,\n30243,30245,0,30250,30252,0,0,0,30269,0,0,30271,30272,0,0,0,30278,30280,0,0,\n30282,0,30284,0,30294,0,0,0,0,30295,30296,0,0,0,0,0,30298,30299,30302,30304,\n30306,0,0,0,0,0,0,30316,30317,0,0,0,30318,0,0,0,30319,0,30320,30322,30326,0,0,0,\n0,0,30327,0,30332,30348,30349,0,0,30356,0,0,0,0,0,0,0,0,30357,0,30358,0,30359,\n30360,0,0,30365,30366,30378,0,0,0,0,30379,0,0,30381,0,30385,0,30388,30397,0,0,0,\n30401,0,0,0,0,30403,0,0,0,0,0,30404,0,0,30405,0,30406,30408,0,30409,0,30410,0,0,\n0,30417,0,0,30418,30419,0,30420,0,30424,0,0,0,30427,30430,30432,0,0,0,0,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,0,30433,0,0,0,0,0,0,0,30436,0,30437,30438,0,30441,30442,0,0,\n0,30445,0,0,0,0,30452,30456,30457,0,0,0,30458,0,30464,0,0,0,0,0,0,30467,0,30469,\n0,0,0,0,0,30477,0,0,30484,0,0,0,0,0,30485,0,0,0,0,0,30486,30487,30497,30498,0,0,\n0,0,0,0,0,0,0,0,30505,0,30508,0,0,0,30509,30510,0,30514,30516,0,0,0,0,0,0,0,0,0,\n0,0,30523,0,30524,0,30525,0,0,0,0,30537,0,0,30538,0,0,0,0,0,30553,0,0,30555,\n30556,30558,30559,30560,0,0,30561,0,30562,0,0,0,0,0,0,0,0,30563,30570,30571,0,\n30586,30587,0,0,30590,0,0,30594,0,0,0,0,30611,30612,30623,30634,0,0,30636,30640,\n30655,30656,0,30657,0,0,30658,30669,0,30670,0,30676,30678,0,0,0,0,0,0,0,30679,0,\n0,0,0,0,0,0,0,0,0,0,30695,0,0,30698,0,0,0,0,30700,0,0,0,0,30701,0,30702,30703,0,\n0,0,0,30707,0,0,0,30709,0,0,30710,30719,30729,0,0,0,0,0,0,0,0,0,30731,0,0,30733,\n0,0,0,30734,0,0,0,0,0,30736,30737,0,0,0,30740,0,0,0,30743,0,30746,0,30747,30748,\n0,0,30751,30752,30753,0,0,0,30754,0,0,30760,0,0,0,0,0,0,0,30763,0,30764,0,0,\n30766,0,30769,30770,30771,30774,30777,0,0,30779,30780,30781,0,0,0,0,30790,0,0,0,\n30792,0,0,0,0,30810,0,0,0,0,0,0,0,30812,30819,0,0,30823,30824,0,30825,0,30827,0,\n0,0,0,0,0,30828,0,0,30830,0,0,0,30834,0,30835,0,30837,30838,0,30845,0,0,0,0,0,\n30846,30847,0,0,30849,0,30851,0,0,0,0,0,30852,30858,0,0,30859,0,30865,0,0,30866,\n0,0,30868,0,0,30869,0,0,0,30881,30883,0,0,0,0,0,30889,0,30891,0,0,0,0,30894,0,\n30895,0,30897,0,30898,0,0,0,30904,30906,0,30909,0,0,0,0,0,0,30910,0,0,0,30915,\n30933,30942,0,0,0,0,30943,0,0,30945,0,0,0,0,0,0,30946,0,0,30947,0,0,30955,30956,\n0,0,30960,0,0,30961,30962,30966,0,0,30969,30974,0,0,0,30976,0,0,30977,0,30978,\n30982,0,0,0,0,0,0,0,30994,30995,30998,0,31000,0,0,31001,0,0,31003,31005,0,0,\n31006,31011,0,0,31014,0,31016,0,0,0,0,31018,0,0,31020,31023,31024,31025,0,0,0,0,\n0,0,0,0,0,0,0,0,0,0,31027,31028,31029,0,0,0,0,0,0,31032,0,0,0,0,0,0,0,0,0,0,0,\n31036,31037,31038,0,0,0,31041,31043,31045,0,31047,0,0,0,31048,0,31049,0,0,0,\n31053,31054,31055,0,0,31063,0,0,0,0,0,31066,0,31068,31071,0,0,0,31072,31073,0,0,\n0,0,31075,0,0,31076,0,0,0,31077,31079,0,31080,0,0,0,0,0,0,0,0,0,0,31087,0,31142,\n0,31144,0,0,31145,31146,31147,0,0,0,0,0,0,0,0,0,0,0,0,0,0,31149,0,31151,31152,0,\n0,0,0,0,0,0,31162,31171,31174,31175,0,0,0,31176,0,0,0,0,0,0,0,31179,0,0,0,31186,\n0,0,0,31192,31195,0,0,31196,0,0,0,0,0,0,0,0,31198,0,0,0,0,0,31199,0,0,0,31205,0,\n0,0,0,31211,31215,0,0,0,0,31231,0,31232,0,0,0,0,0,0,0,0,0,0,31233,31236,31253,0,\n31254,0,0,0,0,0,0,31255,0,0,31257,0,0,0,0,0,0,0,0,0,31258,31259,0,0,31260,0,\n31261,0,0,0,0,0,31262,31263,0,0,31264,0,31266,0,31267,0,0,0,0,0,31281,0,31282,0,\n31284,0,0,31285,31287,31288,0,0,31290,0,0,0,31292,31295,0,31299,0,31300,0,0,0,0,\n0,31302,0,0,0,0,31303,0,0,0,0,0,0,31304,0,0,0,0,0,31305,31308,31309,31315,0,\n31317,0,0,0,0,0,31323,0,31324,0,0,0,0,0,31325,31327,0,0,31331,0,0,0,0,0,31333,0,\n0,0,0,0,31336,0,0,31337,0,0,0,0,0,0,31338,0,0,0,0,0,0,0,0,0,0,0,0,31339,0,0,0,0,\n0,0,0,31342,0,0,0,0,31345,0,0,0,0,0,0,0,0,31347,0,0,0,0,0,0,31348,0,0,31350,\n31351,0,31352,0,0,31354,0,0,0,0,31355,0,0,31356,0,0,0,0,0,0,0,0,0,0,31363,0,\n31372,0,0,31373,0,0,0,0,0,0,0,0,0,31376,0,31388,0,31389,0,31392,0,31401,0,31405,\n31407,31408,0,31409,0,0,0,0,0,0,31413,31415,0,0,0,31416,31418,0,0,0,0,0,0,31422,\n31423,0,0,31424,0,31425,31432,0,0,0,0,0,0,0,0,0,31433,0,0,0,0,0,0,0,0,31434,0,0,\n0,0,0,0,31435,0,0,0,0,31438,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,31442,0,31444,0,\n31448,0,0,31451,0,0,0,0,31452,0,31461,31465,0,0,31466,0,0,31467,0,0,31468,0,0,0,\n31469,31473,0,31476,0,0,0,0,31489,31490,0,0,0,0,0,0,0,31492,31493,31494,0,0,0,0,\n31501,31504,31505,0,0,0,0,0,0,0,0,0,31509,0,0,0,0,31510,0,0,31511,0,0,31513,0,0,\n0,0,0,0,0,0,0,31514,0,31522,31536,31539,31540,0,31541,0,0,0,0,0,0,31546,31553,\n31559,0,0,0,31560,31561,31562,0,0,31564,31567,0,31569,0,0,0,31570,0,0,0,0,31571,\n0,0,0,0,0,0,31572,31574,31580,31581,0,0,31582,31584,31585,31586,31595,0,31596,0,\n0,0,0,31597,0,31599,0,31600,31601,0,0,31603,31604,0,0,31608,31610,0,0,0,31611,0,\n31615,0,0,0,0,31616,0,0,0,0,0,0,31617,0,0,0,0,0,31618,0,0,0,0,0,0,31621,0,0,0,0,\n0,0,0,0,0,31622,31625,0,0,0,0,31627,0,31641,0,0,31642,0,0,31643,0,0,0,0,0,0,0,0,\n0,31644,0,31646,0,0,0,0,31648,0,0,0,31652,0,0,0,31657,0,0,31676,0,0,0,0,0,0,0,\n31689,31691,31692,0,31694,0,0,0,31696,0,31702,0,31703,0};\n\nconst BROTLI_MODEL(\"small\")\nDictWord kStaticDictionaryWords[BROTLI_ENC_STATIC_DICT_LUT_NUM_ITEMS] = {\n{0,0,0},{8,0,1002},{136,0,1015},{4,0,683},{4,10,325},{138,10,125},{7,11,572},{9,\n11,592},{11,11,680},{11,11,842},{11,11,924},{12,11,356},{12,11,550},{13,11,317},\n{13,11,370},{13,11,469},{13,11,471},{14,11,397},{18,11,69},{146,11,145},{134,0,\n1265},{136,11,534},{134,0,1431},{11,0,138},{140,0,40},{4,0,155},{4,10,718},{7,0,\n1689},{135,10,1216},{4,0,245},{5,0,151},{5,0,741},{6,0,1147},{7,0,498},{7,0,870}\n,{7,0,1542},{12,0,213},{14,0,36},{14,0,391},{17,0,111},{18,0,6},{18,0,46},{18,0,\n151},{19,0,36},{20,0,32},{20,0,56},{20,0,69},{20,0,102},{21,0,4},{22,0,8},{22,0,\n10},{22,0,14},{150,0,31},{4,0,624},{135,0,1752},{5,10,124},{5,10,144},{6,10,548}\n,{7,10,15},{7,10,153},{137,10,629},{6,0,503},{7,10,1531},{8,10,416},{9,0,586},{9\n,10,275},{10,10,100},{11,10,658},{11,10,979},{12,10,86},{13,0,468},{14,0,66},{14\n,10,207},{15,10,20},{15,10,25},{144,0,58},{5,0,603},{5,10,915},{6,10,1783},{7,0,\n1212},{7,10,211},{7,10,1353},{9,0,565},{9,10,83},{10,10,376},{10,10,431},{11,10,\n543},{12,10,664},{13,10,280},{13,10,428},{14,0,301},{14,10,128},{17,10,52},{145,\n10,81},{4,0,492},{133,0,451},{135,0,835},{141,0,70},{132,0,539},{7,11,748},{139,\n11,700},{7,11,1517},{11,11,597},{14,11,76},{14,11,335},{148,11,33},{6,0,113},{\n135,0,436},{4,10,338},{133,10,400},{136,0,718},{133,11,127},{133,11,418},{6,0,\n1505},{6,11,198},{7,0,520},{11,10,892},{140,11,83},{4,10,221},{5,10,659},{5,10,\n989},{7,10,697},{7,10,1211},{138,10,284},{135,0,1070},{5,11,276},{6,11,55},{135,\n11,1369},{134,0,1515},{6,11,1752},{136,11,726},{138,10,507},{4,10,188},{7,10,805\n},{143,0,78},{5,10,884},{139,10,991},{133,11,764},{134,10,1653},{6,11,309},{7,11\n,331},{138,11,550},{135,11,1861},{132,11,348},{135,11,986},{135,11,1573},{12,0,\n610},{13,0,431},{144,0,59},{9,11,799},{140,10,166},{134,0,1530},{132,0,750},{132\n,0,307},{133,0,964},{6,11,194},{7,11,133},{10,11,493},{10,11,570},{139,11,664},{\n5,11,24},{5,11,569},{6,11,3},{6,11,119},{6,11,143},{6,11,440},{7,11,295},{7,11,\n599},{7,11,1686},{7,11,1854},{8,11,424},{9,11,43},{9,11,584},{9,11,760},{10,11,\n148},{10,11,328},{11,11,159},{11,11,253},{11,11,506},{12,11,487},{12,11,531},{\n144,11,33},{136,10,760},{5,11,14},{5,11,892},{6,11,283},{7,11,234},{136,11,537},\n{135,11,1251},{4,11,126},{8,11,635},{147,11,34},{4,11,316},{135,11,1561},{6,0,\n999},{6,0,1310},{137,11,861},{4,11,64},{5,11,352},{5,11,720},{6,11,368},{139,11,\n359},{4,0,75},{5,0,180},{6,0,500},{7,0,58},{7,0,710},{8,10,770},{138,0,645},{133\n,0,649},{6,0,276},{7,0,282},{7,0,879},{7,0,924},{8,0,459},{9,0,599},{9,0,754},{\n11,0,574},{12,0,128},{12,0,494},{13,0,52},{13,0,301},{15,0,30},{143,0,132},{132,\n0,200},{4,10,89},{5,10,489},{6,10,315},{7,10,553},{7,10,1745},{138,10,243},{135,\n11,1050},{6,10,1658},{7,0,1621},{9,10,3},{10,10,154},{11,10,641},{13,10,85},{13,\n10,201},{141,10,346},{6,11,175},{137,11,289},{5,11,432},{133,11,913},{6,0,225},{\n137,0,211},{7,0,718},{8,0,687},{139,0,374},{4,10,166},{133,10,505},{6,10,1670},{\n137,0,110},{8,0,58},{9,0,724},{11,0,809},{13,0,113},{145,0,72},{6,0,345},{7,0,\n1247},{144,11,82},{5,11,931},{134,11,1698},{8,0,767},{8,0,803},{9,0,301},{137,0,\n903},{139,0,203},{134,0,1154},{7,0,1949},{136,0,674},{134,0,259},{135,0,1275},{5\n,11,774},{6,11,1637},{6,11,1686},{134,11,1751},{134,0,1231},{7,10,445},{8,10,307\n},{8,10,704},{10,10,41},{10,10,439},{11,10,237},{11,10,622},{140,10,201},{136,0,\n254},{6,11,260},{135,11,1484},{139,0,277},{135,10,1977},{4,10,189},{5,10,713},{6\n,11,573},{136,10,57},{138,10,371},{132,10,552},{134,11,344},{133,0,248},{6,11,\n240},{9,0,800},{10,0,693},{11,0,482},{11,0,734},{139,0,789},{4,0,116},{4,11,292}\n,{4,11,736},{5,0,95},{5,0,445},{5,11,871},{6,11,171},{6,11,1689},{7,0,1688},{7,\n11,1324},{7,11,1944},{8,0,29},{9,0,272},{9,11,415},{9,11,580},{11,0,509},{11,0,\n915},{14,11,230},{146,11,68},{7,0,490},{13,0,100},{143,0,75},{135,0,1641},{133,0\n,543},{7,11,209},{8,11,661},{10,11,42},{11,11,58},{12,11,58},{12,11,118},{141,11\n,32},{5,0,181},{6,11,63},{7,11,920},{136,0,41},{133,0,657},{133,11,793},{138,0,\n709},{7,0,25},{8,0,202},{138,0,536},{5,11,665},{135,10,1788},{145,10,49},{9,0,\n423},{140,0,89},{5,11,67},{6,11,62},{6,11,374},{135,11,1391},{8,0,113},{9,0,877}\n,{9,11,790},{10,0,554},{11,0,83},{12,0,136},{12,11,47},{147,0,109},{138,10,661},\n{4,0,963},{7,10,1945},{10,0,927},{142,0,442},{133,0,976},{132,0,206},{4,11,391},\n{135,11,1169},{134,0,2002},{6,0,696},{134,0,1008},{134,0,1170},{132,11,271},{7,0\n,13},{8,0,226},{10,0,537},{11,0,570},{11,0,605},{11,0,799},{11,0,804},{12,0,85},\n{12,0,516},{12,0,623},{12,11,314},{13,0,112},{13,0,361},{14,0,77},{14,0,78},{17,\n0,28},{147,0,110},{132,0,769},{134,0,1544},{4,0,551},{137,0,678},{5,10,84},{134,\n10,163},{9,0,57},{9,0,459},{10,0,425},{11,0,119},{12,0,184},{12,0,371},{13,0,358\n},{145,0,51},{4,11,253},{5,0,188},{5,0,814},{5,10,410},{5,11,544},{7,11,300},{8,\n0,10},{9,0,421},{9,0,729},{9,11,340},{10,0,609},{139,0,689},{134,0,624},{138,11,\n321},{135,0,1941},{5,10,322},{8,10,186},{9,10,262},{10,10,187},{14,10,208},{146,\n0,130},{5,11,53},{5,11,541},{6,11,94},{6,11,499},{7,11,230},{139,11,321},{133,10\n,227},{4,0,378},{4,11,920},{5,11,25},{5,11,790},{6,11,457},{135,11,853},{137,0,\n269},{132,0,528},{134,0,1146},{7,10,1395},{8,10,486},{9,10,236},{9,10,878},{10,\n10,218},{11,10,95},{19,10,17},{147,10,31},{7,10,2043},{8,10,672},{141,10,448},{\n134,0,1105},{134,0,1616},{134,11,1765},{140,11,163},{5,10,412},{133,11,822},{132\n,11,634},{6,0,656},{134,11,1730},{134,0,1940},{5,0,104},{6,0,173},{135,0,1631},{\n136,10,562},{6,11,36},{7,11,658},{8,11,454},{147,11,86},{5,0,457},{134,10,1771},\n{7,0,810},{8,0,138},{8,0,342},{9,0,84},{10,0,193},{11,0,883},{140,0,359},{7,10,\n1190},{137,0,620},{137,10,132},{7,11,975},{137,11,789},{6,0,95},{6,0,1934},{136,\n0,967},{141,11,335},{6,0,406},{10,0,409},{10,0,447},{11,0,44},{140,0,100},{4,10,\n317},{135,10,1279},{132,0,477},{134,0,1268},{5,10,63},{5,10,509},{6,0,1941},{136\n,0,944},{132,0,629},{132,11,104},{4,0,246},{133,0,375},{4,10,288},{134,0,1636},{\n135,11,1614},{8,10,89},{8,10,620},{9,0,49},{10,0,774},{11,10,628},{12,10,322},{\n143,10,124},{4,0,282},{7,0,1034},{11,0,398},{11,0,634},{12,0,1},{12,0,79},{12,0,\n544},{14,0,237},{17,0,10},{146,0,20},{132,0,824},{7,11,45},{9,11,542},{9,11,566}\n,{138,11,728},{5,0,118},{5,0,499},{6,0,476},{6,0,665},{6,0,1176},{6,0,1196},{7,0\n,600},{7,0,888},{135,0,1096},{7,0,296},{7,0,596},{8,0,560},{8,0,586},{9,0,612},{\n11,0,304},{12,0,46},{13,0,89},{14,0,112},{145,0,122},{5,0,894},{6,0,1772},{9,0,\n1009},{138,10,120},{5,11,533},{7,11,755},{138,11,780},{151,10,1},{6,0,1474},{7,\n11,87},{142,11,288},{139,0,366},{137,10,461},{7,11,988},{7,11,1939},{9,11,64},{9\n,11,502},{12,11,7},{12,11,34},{13,11,12},{13,11,234},{147,11,77},{7,0,1599},{7,0\n,1723},{8,0,79},{8,0,106},{8,0,190},{8,0,302},{8,0,383},{8,0,713},{9,0,119},{9,0\n,233},{9,0,419},{9,0,471},{10,0,181},{10,0,406},{11,0,57},{11,0,85},{11,0,120},{\n11,0,177},{11,0,296},{11,0,382},{11,0,454},{11,0,758},{11,0,999},{12,0,27},{12,0\n,98},{12,0,131},{12,0,245},{12,0,312},{12,0,446},{12,0,454},{13,0,25},{13,0,98},\n{13,0,426},{13,0,508},{14,0,70},{14,0,163},{14,0,272},{14,0,277},{14,0,370},{15,\n0,95},{15,0,138},{15,0,167},{17,0,38},{148,0,96},{135,10,1346},{10,0,200},{19,0,\n2},{151,0,22},{135,11,141},{134,10,85},{134,0,1759},{138,0,372},{145,0,16},{4,11\n,619},{136,0,943},{139,11,88},{5,11,246},{8,11,189},{9,11,355},{9,11,512},{10,11\n,124},{10,11,453},{11,11,143},{11,11,416},{11,11,859},{141,11,341},{5,0,258},{\n134,0,719},{6,0,1798},{6,0,1839},{8,0,900},{10,0,874},{10,0,886},{12,0,698},{12,\n0,732},{12,0,770},{16,0,106},{18,0,163},{18,0,170},{18,0,171},{152,0,20},{9,0,\n707},{9,11,707},{11,0,326},{11,0,339},{11,11,326},{11,11,339},{12,0,423},{12,0,\n502},{12,11,423},{12,11,502},{20,0,62},{148,11,62},{5,0,30},{7,0,495},{8,0,134},\n{9,0,788},{140,0,438},{133,11,678},{5,10,279},{6,10,235},{7,10,468},{8,10,446},{\n9,10,637},{10,10,717},{11,10,738},{140,10,514},{5,11,35},{6,11,287},{7,11,862},{\n7,11,1886},{138,11,179},{4,11,517},{7,0,1948},{135,0,2004},{5,10,17},{6,10,371},\n{137,10,528},{4,0,115},{5,0,669},{6,0,407},{8,0,311},{11,0,10},{141,0,5},{137,0,\n381},{5,0,50},{6,0,439},{7,0,780},{135,0,1040},{136,11,667},{11,11,403},{146,11,\n83},{5,0,1},{6,0,81},{138,0,520},{134,0,738},{5,0,482},{8,0,98},{9,0,172},{10,0,\n360},{10,0,700},{10,0,822},{11,0,302},{11,0,778},{12,0,50},{12,0,127},{12,0,396}\n,{13,0,62},{13,0,328},{14,0,122},{147,0,72},{9,11,157},{10,11,131},{140,11,72},{\n135,11,714},{135,11,539},{5,0,2},{6,0,512},{7,0,797},{7,0,1494},{8,0,253},{8,0,\n589},{9,0,77},{10,0,1},{10,0,129},{10,0,225},{11,0,118},{11,0,226},{11,0,251},{\n11,0,430},{11,0,701},{11,0,974},{11,0,982},{12,0,64},{12,0,260},{12,0,488},{140,\n0,690},{5,11,394},{7,11,367},{7,11,487},{7,11,857},{7,11,1713},{8,11,246},{9,11,\n537},{10,11,165},{12,11,219},{140,11,561},{136,0,557},{5,10,779},{5,10,807},{6,\n10,1655},{134,10,1676},{4,10,196},{5,10,558},{133,10,949},{11,11,827},{12,11,56}\n,{14,11,34},{143,11,148},{137,0,347},{133,0,572},{134,0,832},{4,0,12},{7,0,504},\n{7,0,522},{7,0,809},{8,0,797},{141,0,88},{4,10,752},{133,11,449},{7,11,86},{8,11\n,103},{145,11,69},{7,11,2028},{138,11,641},{5,0,528},{6,11,1},{142,11,2},{134,0,\n861},{4,10,227},{5,10,159},{5,10,409},{7,10,80},{10,0,294},{10,10,479},{12,10,\n418},{14,10,50},{14,10,249},{142,10,295},{7,10,1470},{8,10,66},{8,10,137},{8,10,\n761},{9,10,638},{11,10,80},{11,10,212},{11,10,368},{11,10,418},{12,10,8},{13,10,\n15},{16,10,61},{17,10,59},{19,10,28},{148,10,84},{7,11,1148},{148,0,109},{6,11,\n277},{7,11,1274},{7,11,1386},{7,11,1392},{12,11,129},{146,11,87},{6,11,187},{7,\n11,39},{7,11,1203},{8,11,380},{8,11,542},{14,11,117},{149,11,28},{134,0,1187},{5\n,0,266},{9,0,290},{9,0,364},{10,0,293},{11,0,606},{142,0,45},{6,11,297},{7,11,\n793},{139,11,938},{4,0,50},{6,0,594},{9,0,121},{10,0,49},{10,0,412},{139,0,834},\n{136,0,748},{7,11,464},{8,11,438},{11,11,105},{11,11,363},{12,11,231},{14,11,386\n},{15,11,102},{148,11,75},{132,0,466},{6,10,38},{7,10,1220},{8,10,185},{8,10,256\n},{9,10,22},{9,10,331},{10,10,738},{11,10,205},{11,10,540},{11,10,746},{13,0,399\n},{13,10,465},{14,0,337},{142,10,194},{9,0,378},{141,0,162},{137,0,519},{4,10,\n159},{6,10,115},{7,10,252},{7,10,257},{7,10,1928},{8,10,69},{9,10,384},{10,10,91\n},{10,10,615},{12,10,375},{14,10,235},{18,10,117},{147,10,123},{5,10,911},{5,11,\n604},{136,10,278},{132,0,667},{4,10,151},{7,10,1567},{8,0,351},{137,0,322},{134,\n0,902},{133,10,990},{5,10,194},{7,10,1662},{9,10,90},{140,0,180},{4,0,869},{134,\n0,1996},{134,0,813},{133,10,425},{137,11,761},{132,0,260},{133,10,971},{5,11,20}\n,{6,11,298},{7,11,659},{7,11,1366},{137,11,219},{4,0,39},{5,0,36},{7,0,1843},{8,\n0,407},{11,0,144},{140,0,523},{4,0,510},{10,0,587},{139,10,752},{7,0,29},{7,0,66\n},{7,0,1980},{10,0,487},{138,0,809},{9,10,662},{13,0,260},{14,0,82},{146,0,63},{\n5,10,72},{6,10,264},{7,10,21},{7,10,46},{7,10,2013},{8,10,215},{8,10,513},{10,10\n,266},{139,10,22},{134,0,570},{4,11,439},{6,0,565},{7,0,1667},{10,10,95},{11,10,\n603},{12,11,242},{13,10,443},{14,10,160},{143,10,4},{134,0,1464},{134,10,431},{5\n,10,874},{6,10,1677},{9,0,372},{15,0,2},{15,10,0},{19,0,10},{147,0,18},{132,0,\n787},{6,0,380},{7,10,939},{7,10,1172},{7,10,1671},{9,10,540},{10,10,696},{11,10,\n265},{11,10,732},{11,10,928},{11,10,937},{12,0,399},{13,10,438},{149,0,19},{137,\n0,200},{132,11,233},{132,0,516},{134,11,577},{132,0,844},{11,0,887},{14,0,365},{\n142,0,375},{132,11,482},{8,0,821},{140,0,44},{7,0,1655},{136,0,305},{5,10,682},{\n135,10,1887},{135,11,346},{132,10,696},{4,0,10},{7,0,917},{139,0,786},{5,11,795}\n,{6,11,1741},{8,11,417},{137,11,782},{4,0,1016},{134,0,2031},{4,10,726},{5,0,684\n},{133,10,630},{6,0,1021},{134,0,1480},{8,10,802},{136,10,838},{134,0,27},{134,0\n,395},{135,11,622},{7,11,625},{135,11,1750},{4,11,203},{135,11,1936},{6,10,118},\n{7,10,215},{7,10,1521},{140,10,11},{132,0,813},{136,0,511},{7,10,615},{138,10,\n251},{135,10,1044},{145,0,56},{133,10,225},{6,0,342},{6,0,496},{8,0,275},{137,0,\n206},{4,0,909},{133,0,940},{132,0,891},{7,11,311},{9,11,308},{140,11,255},{4,10,\n370},{5,10,756},{135,10,1326},{4,0,687},{134,0,1596},{134,0,1342},{6,10,1662},{7\n,10,48},{8,10,771},{10,10,116},{13,10,104},{14,10,105},{14,10,184},{15,10,168},{\n19,10,92},{148,10,68},{138,10,209},{4,11,400},{5,11,267},{135,11,232},{151,11,12\n},{6,0,41},{141,0,160},{141,11,314},{134,0,1718},{136,0,778},{142,11,261},{134,0\n,1610},{133,0,115},{132,0,294},{4,10,120},{142,0,314},{132,0,983},{5,0,193},{140\n,0,178},{138,10,429},{5,10,820},{135,10,931},{5,11,732},{6,0,994},{6,0,1051},{6,\n0,1439},{135,0,174},{4,11,100},{7,11,679},{8,11,313},{138,10,199},{6,10,151},{6,\n10,1675},{7,10,383},{151,10,10},{6,0,1796},{8,0,848},{8,0,867},{8,0,907},{10,0,\n855},{140,0,703},{140,0,221},{4,0,122},{5,0,796},{5,0,952},{6,0,1660},{6,0,1671}\n,{8,0,567},{9,0,687},{9,0,742},{10,0,686},{11,0,682},{11,0,909},{140,0,281},{5,\n11,362},{5,11,443},{6,11,318},{7,11,1019},{139,11,623},{5,11,463},{136,11,296},{\n6,10,1624},{11,0,583},{12,10,422},{13,0,262},{142,10,360},{5,0,179},{7,0,1095},{\n135,0,1213},{4,10,43},{4,11,454},{5,10,344},{133,10,357},{4,0,66},{7,0,722},{135\n,0,904},{134,0,773},{5,10,888},{135,0,352},{5,11,48},{5,11,404},{6,11,557},{7,11\n,458},{8,11,597},{10,11,455},{10,11,606},{11,11,49},{11,11,548},{12,11,476},{13,\n11,18},{141,11,450},{134,11,418},{132,10,711},{5,11,442},{135,11,1984},{141,0,35\n},{137,0,152},{134,0,1197},{135,11,1093},{137,11,203},{137,10,440},{10,0,592},{\n10,0,753},{12,0,317},{12,0,355},{12,0,465},{12,0,469},{12,0,560},{12,0,578},{141\n,0,243},{133,0,564},{134,0,797},{5,10,958},{133,10,987},{5,11,55},{7,11,376},{\n140,11,161},{133,11,450},{134,0,556},{134,0,819},{11,10,276},{142,10,293},{7,0,\n544},{138,0,61},{4,10,65},{5,10,479},{5,10,1004},{7,10,1913},{8,0,719},{8,10,317\n},{9,10,302},{10,10,612},{141,10,22},{4,0,5},{4,10,261},{4,11,213},{5,0,498},{7,\n10,510},{7,11,223},{8,0,637},{8,11,80},{137,0,521},{4,10,291},{5,0,927},{7,0,101\n},{7,11,381},{7,11,806},{7,11,820},{8,11,354},{8,11,437},{8,11,787},{9,10,515},{\n9,11,657},{10,11,58},{10,11,339},{10,11,749},{11,11,914},{12,10,152},{12,10,443}\n,{12,11,162},{13,10,392},{13,11,75},{14,10,357},{14,11,106},{14,11,198},{14,11,\n320},{14,11,413},{146,11,43},{6,0,1153},{7,0,1441},{136,11,747},{4,0,893},{5,0,\n780},{133,0,893},{138,11,654},{133,11,692},{133,0,238},{134,11,191},{4,10,130},{\n135,10,843},{5,10,42},{5,10,879},{6,0,1296},{7,10,245},{7,10,324},{7,10,1532},{\n11,10,463},{11,10,472},{13,10,363},{144,10,52},{134,0,1729},{6,0,1999},{136,0,\n969},{4,10,134},{133,10,372},{4,0,60},{7,0,941},{7,0,1800},{8,0,314},{9,0,700},{\n139,0,487},{134,0,1144},{6,11,162},{7,11,1960},{136,11,831},{132,11,706},{135,0,\n1147},{138,11,426},{138,11,89},{7,0,1853},{138,0,437},{136,0,419},{135,10,1634},\n{133,0,828},{4,10,644},{5,0,806},{7,0,176},{7,0,178},{7,0,1240},{135,0,1976},{\n135,11,1877},{5,11,420},{135,11,1449},{4,0,51},{5,0,39},{6,0,4},{7,0,591},{7,0,\n849},{7,0,951},{7,0,1613},{7,0,1760},{7,0,1988},{9,0,434},{10,0,754},{11,0,25},{\n139,0,37},{10,11,57},{138,11,277},{135,10,540},{132,11,204},{135,0,159},{139,11,\n231},{133,0,902},{7,0,928},{7,11,366},{9,11,287},{12,11,199},{12,11,556},{140,11\n,577},{6,10,623},{136,10,789},{4,10,908},{5,10,359},{5,10,508},{6,10,1723},{7,10\n,343},{7,10,1996},{135,10,2026},{134,0,270},{4,10,341},{135,10,480},{5,11,356},{\n135,11,224},{11,11,588},{11,11,864},{11,11,968},{143,11,160},{132,0,556},{137,0,\n801},{132,0,416},{142,0,372},{5,0,152},{5,0,197},{7,0,340},{7,0,867},{10,0,548},\n{10,0,581},{11,0,6},{12,0,3},{12,0,19},{14,0,110},{142,0,289},{139,0,369},{7,11,\n630},{9,11,567},{11,11,150},{11,11,444},{141,11,119},{134,11,539},{7,10,1995},{8\n,10,299},{11,10,890},{140,10,674},{7,0,34},{7,0,190},{8,0,28},{8,0,141},{8,0,444\n},{8,0,811},{9,0,468},{11,0,334},{12,0,24},{12,0,386},{140,0,576},{133,0,757},{7\n,0,1553},{136,0,898},{133,0,721},{136,0,1012},{4,0,789},{5,0,647},{135,0,1102},{\n132,0,898},{4,10,238},{5,10,503},{6,10,179},{7,10,2003},{8,10,381},{8,10,473},{9\n,10,149},{10,0,183},{10,10,788},{15,10,45},{15,10,86},{20,10,110},{150,10,57},{4\n,10,121},{5,10,156},{5,10,349},{9,0,136},{10,10,605},{14,10,342},{147,0,107},{4,\n11,235},{135,11,255},{4,11,194},{5,11,584},{6,11,384},{7,11,583},{10,11,761},{11\n,11,760},{139,11,851},{6,10,80},{6,10,1694},{7,10,173},{7,10,1974},{9,10,547},{\n10,10,730},{14,10,18},{150,10,39},{4,10,923},{134,10,1711},{5,0,277},{141,0,247}\n,{132,0,435},{133,11,562},{134,0,1311},{5,11,191},{137,11,271},{132,10,595},{7,\n11,1537},{14,11,96},{143,11,73},{5,0,437},{6,10,459},{7,0,502},{7,0,519},{7,0,\n1122},{7,0,1751},{7,10,1753},{7,10,1805},{8,10,658},{9,10,1},{11,10,959},{13,10,\n446},{142,0,211},{4,11,470},{5,11,473},{6,0,814},{6,11,153},{7,11,1503},{7,11,\n1923},{10,11,701},{11,11,132},{11,11,168},{11,11,227},{11,11,320},{11,11,436},{\n11,11,525},{11,11,855},{12,11,41},{12,11,286},{13,11,103},{13,11,284},{14,11,255\n},{14,11,262},{15,11,117},{143,11,127},{5,0,265},{6,0,212},{135,0,28},{138,0,750\n},{133,11,327},{6,11,552},{7,11,1754},{137,11,604},{134,0,2012},{132,0,702},{5,\n11,80},{6,11,405},{7,11,403},{7,11,1502},{7,11,1626},{8,11,456},{9,11,487},{9,11\n,853},{9,11,889},{10,11,309},{11,11,721},{11,11,994},{12,11,430},{141,11,165},{5\n,0,808},{135,0,2045},{5,0,166},{8,0,739},{140,0,511},{134,10,490},{4,11,453},{5,\n11,887},{6,11,535},{8,11,6},{136,11,543},{4,0,119},{5,0,170},{5,0,447},{7,0,1708\n},{7,0,1889},{9,0,357},{9,0,719},{12,0,486},{140,0,596},{137,0,500},{7,10,250},{\n136,10,507},{132,10,158},{6,0,809},{134,0,1500},{4,10,140},{7,10,362},{8,10,209}\n,{9,0,327},{9,10,10},{9,10,503},{9,10,614},{10,10,689},{11,0,350},{11,0,831},{11\n,10,327},{11,10,725},{12,10,252},{12,10,583},{13,0,352},{13,10,192},{14,10,269},\n{14,10,356},{148,10,50},{135,11,741},{4,0,450},{7,0,1158},{19,10,1},{19,10,26},{\n150,10,9},{6,0,597},{135,0,1318},{134,0,1602},{6,10,228},{7,10,1341},{9,10,408},\n{138,10,343},{7,0,1375},{7,0,1466},{138,0,331},{132,0,754},{132,10,557},{5,11,\n101},{6,11,88},{6,11,543},{7,11,1677},{9,11,100},{10,11,677},{14,11,169},{14,11,\n302},{14,11,313},{15,11,48},{143,11,84},{134,0,1368},{4,11,310},{9,11,795},{10,\n11,733},{11,11,451},{12,11,249},{14,11,115},{14,11,286},{143,11,100},{132,10,548\n},{7,10,197},{8,10,142},{8,10,325},{9,10,150},{9,10,596},{10,0,557},{10,10,353},\n{11,10,74},{11,10,315},{12,10,662},{12,10,681},{14,10,423},{143,10,141},{133,11,\n587},{5,0,850},{136,0,799},{10,0,908},{12,0,701},{12,0,757},{142,0,466},{4,0,62}\n,{5,0,275},{6,10,399},{6,10,579},{7,10,692},{7,10,846},{7,10,1015},{7,10,1799},{\n8,10,403},{9,10,394},{10,10,133},{12,10,4},{12,10,297},{12,10,452},{16,10,81},{\n18,0,19},{18,10,25},{21,10,14},{22,10,12},{151,10,18},{7,10,1546},{11,10,299},{\n12,0,459},{142,10,407},{132,10,177},{132,11,498},{7,11,217},{8,11,140},{138,11,\n610},{5,10,411},{135,10,653},{134,0,1802},{7,10,439},{10,10,727},{11,10,260},{\n139,10,684},{133,11,905},{11,11,580},{142,11,201},{134,0,1397},{5,10,208},{7,10,\n753},{135,10,1528},{7,0,238},{7,0,2033},{8,0,120},{8,0,188},{8,0,659},{9,0,598},\n{10,0,466},{12,0,342},{12,0,588},{13,0,503},{14,0,246},{143,0,92},{135,11,1041},\n{4,11,456},{7,11,105},{7,11,358},{7,11,1637},{8,11,643},{139,11,483},{6,0,1318},\n{134,0,1324},{4,0,201},{5,10,242},{7,0,1744},{8,0,602},{11,0,247},{11,0,826},{\n145,0,65},{8,0,164},{146,0,62},{133,10,953},{139,10,802},{133,0,615},{7,11,1566}\n,{8,11,269},{9,11,212},{9,11,718},{14,11,15},{14,11,132},{142,11,227},{133,10,\n290},{132,10,380},{5,10,52},{7,10,277},{9,10,368},{139,10,791},{135,0,1243},{133\n,11,539},{11,11,919},{141,11,409},{136,0,968},{133,11,470},{134,0,882},{132,0,\n907},{5,0,100},{10,0,329},{12,0,416},{149,0,29},{10,10,138},{139,10,476},{5,10,\n725},{5,10,727},{6,11,91},{7,10,1811},{135,11,435},{4,11,16},{5,11,316},{5,11,\n842},{6,11,370},{6,11,1778},{8,11,166},{11,11,812},{12,11,206},{12,11,351},{14,\n11,418},{16,11,15},{16,11,34},{18,11,3},{19,11,3},{19,11,7},{20,11,4},{149,11,21\n},{132,0,176},{5,0,636},{5,0,998},{7,0,9},{7,0,1508},{8,0,26},{9,0,317},{9,0,358\n},{10,0,210},{10,0,292},{10,0,533},{11,0,555},{12,0,526},{12,0,607},{13,0,263},{\n13,0,459},{142,0,271},{4,10,38},{6,0,256},{7,10,307},{7,10,999},{7,10,1481},{7,\n10,1732},{7,10,1738},{8,0,265},{9,10,414},{11,10,316},{12,10,52},{13,10,420},{\n147,10,100},{135,10,1296},{4,11,611},{133,11,606},{4,0,643},{142,11,21},{133,11,\n715},{133,10,723},{6,0,610},{135,11,597},{10,0,127},{141,0,27},{6,0,1995},{6,0,\n2001},{8,0,119},{136,0,973},{4,11,149},{138,11,368},{4,11,154},{5,10,109},{6,10,\n1784},{7,10,1895},{7,11,1134},{8,11,105},{12,0,522},{12,10,296},{140,10,302},{4,\n11,31},{6,11,429},{7,11,962},{9,11,458},{139,11,691},{4,11,312},{5,10,216},{7,10\n,1879},{9,10,141},{9,10,270},{9,10,679},{10,0,553},{10,10,159},{11,0,876},{11,10\n,197},{12,10,538},{12,10,559},{13,0,193},{13,0,423},{14,0,166},{14,10,144},{14,\n10,167},{15,10,67},{147,0,84},{134,0,1582},{7,0,1578},{135,11,1578},{137,10,81},\n{132,11,236},{134,10,391},{134,0,795},{7,10,322},{136,10,249},{5,11,836},{5,11,\n857},{6,11,1680},{7,11,59},{147,11,53},{135,0,432},{10,11,68},{139,11,494},{4,11\n,81},{139,11,867},{7,0,126},{136,0,84},{142,11,280},{5,11,282},{8,11,650},{9,11,\n295},{9,11,907},{138,11,443},{136,0,790},{5,10,632},{138,10,526},{6,0,64},{12,0,\n377},{13,0,309},{14,0,141},{14,0,429},{14,11,141},{142,11,429},{134,0,1529},{6,0\n,321},{7,0,1857},{7,10,948},{7,10,1042},{8,10,235},{8,10,461},{9,0,530},{9,10,\n453},{10,10,354},{17,10,77},{147,0,99},{7,0,1104},{11,0,269},{11,0,539},{11,0,\n627},{11,0,706},{11,0,975},{12,0,248},{12,0,434},{12,0,600},{12,0,622},{13,0,297\n},{13,0,485},{14,0,69},{14,0,409},{143,0,108},{4,10,362},{7,10,52},{7,10,303},{\n10,11,70},{12,11,26},{14,11,17},{14,11,178},{15,11,34},{149,11,12},{11,0,977},{\n141,0,507},{9,0,34},{139,0,484},{5,10,196},{6,10,486},{7,10,212},{8,10,309},{136\n,10,346},{6,0,1700},{7,0,26},{7,0,293},{7,0,382},{7,0,1026},{7,0,1087},{7,0,2027\n},{7,10,1912},{8,0,24},{8,0,114},{8,0,252},{8,0,727},{8,0,729},{9,0,30},{9,0,199\n},{9,0,231},{9,0,251},{9,0,334},{9,0,361},{9,0,712},{10,0,55},{10,0,60},{10,0,\n232},{10,0,332},{10,0,384},{10,0,396},{10,0,504},{10,0,542},{10,0,652},{11,0,20}\n,{11,0,48},{11,0,207},{11,0,291},{11,0,298},{11,0,342},{11,0,365},{11,0,394},{11\n,0,620},{11,0,705},{11,0,1017},{12,0,123},{12,0,340},{12,0,406},{12,0,643},{13,0\n,61},{13,0,269},{13,0,311},{13,0,319},{13,0,486},{14,0,234},{15,0,62},{15,0,85},\n{16,0,71},{18,0,119},{148,0,105},{4,11,71},{5,11,376},{7,11,119},{138,11,665},{4\n,10,686},{8,11,55},{10,0,918},{138,0,926},{138,10,625},{136,10,706},{132,11,479}\n,{4,10,30},{133,10,43},{6,0,379},{7,0,270},{7,11,607},{8,0,176},{8,0,183},{8,11,\n99},{9,0,432},{9,0,661},{12,0,247},{12,0,617},{18,0,125},{152,11,4},{5,0,792},{\n133,0,900},{4,11,612},{133,11,561},{4,10,220},{4,11,41},{5,11,74},{7,10,1535},{7\n,11,1627},{11,11,871},{140,11,619},{135,0,1920},{7,11,94},{11,11,329},{11,11,965\n},{12,11,241},{14,11,354},{15,11,22},{148,11,63},{9,11,209},{137,11,300},{134,0,\n771},{135,0,1979},{4,0,901},{133,0,776},{142,0,254},{133,11,98},{9,11,16},{141,\n11,386},{133,11,984},{4,11,182},{6,11,205},{135,11,220},{7,10,1725},{7,10,1774},\n{138,10,393},{5,10,263},{134,10,414},{4,11,42},{9,11,205},{9,11,786},{138,11,659\n},{14,0,140},{148,0,41},{6,10,178},{6,10,1750},{6,11,289},{7,11,1670},{8,0,440},\n{9,10,690},{10,0,359},{10,10,155},{10,10,373},{11,10,698},{12,11,57},{13,10,155}\n,{20,10,93},{151,11,4},{4,0,37},{5,0,334},{7,0,1253},{151,11,25},{4,0,508},{4,11\n,635},{5,10,97},{137,10,393},{139,11,533},{4,0,640},{133,0,513},{134,10,1639},{\n132,11,371},{4,11,272},{7,11,836},{7,11,1651},{145,11,89},{5,11,825},{6,11,444},\n{6,11,1640},{136,11,308},{4,10,191},{7,10,934},{8,10,647},{145,10,97},{12,0,246}\n,{15,0,162},{19,0,64},{20,0,8},{20,0,95},{22,0,24},{152,0,17},{4,0,533},{5,10,\n165},{9,10,346},{138,10,655},{5,11,737},{139,10,885},{133,10,877},{8,10,128},{\n139,10,179},{137,11,307},{140,0,752},{133,0,920},{135,0,1048},{5,0,153},{6,0,580\n},{6,10,1663},{7,10,132},{7,10,1154},{7,10,1415},{7,10,1507},{12,10,493},{15,10,\n105},{151,10,15},{5,10,459},{7,10,1073},{8,10,241},{136,10,334},{138,0,391},{135\n,0,1952},{133,11,525},{8,11,641},{11,11,388},{140,11,580},{142,0,126},{134,0,640\n},{132,0,483},{6,10,324},{6,10,520},{7,0,1616},{7,10,338},{7,10,1729},{8,10,228}\n,{9,0,69},{139,10,750},{5,11,493},{134,11,528},{135,0,734},{4,11,174},{135,11,\n911},{138,0,480},{9,0,495},{146,0,104},{135,10,705},{4,10,73},{6,10,612},{7,10,\n927},{7,10,1330},{7,10,1822},{8,10,217},{9,0,472},{9,10,765},{9,10,766},{10,10,\n408},{11,10,51},{11,10,793},{12,10,266},{15,10,158},{20,10,89},{150,10,32},{7,11\n,548},{137,11,58},{4,11,32},{5,11,215},{6,11,269},{7,11,1782},{7,11,1892},{10,11\n,16},{11,11,822},{11,11,954},{141,11,481},{132,0,874},{5,10,389},{8,10,636},{137\n,0,229},{7,11,1749},{136,11,477},{134,0,948},{5,11,308},{135,11,1088},{4,0,748},\n{139,0,1009},{136,10,21},{6,0,555},{135,0,485},{5,11,126},{8,11,297},{9,11,366},\n{9,11,445},{12,11,53},{12,11,374},{141,11,492},{7,11,1551},{139,11,361},{136,0,\n193},{136,0,472},{8,0,653},{13,0,93},{147,0,14},{132,0,984},{132,11,175},{4,11,\n685},{5,0,172},{134,0,1971},{149,11,8},{133,11,797},{5,10,189},{7,10,442},{7,10,\n443},{8,10,281},{12,10,174},{13,0,83},{141,10,261},{134,0,1568},{133,11,565},{\n139,0,384},{133,0,260},{6,10,2},{7,0,758},{7,0,880},{7,0,1359},{7,10,1262},{7,10\n,1737},{8,10,22},{8,10,270},{8,10,612},{9,0,164},{9,0,167},{9,10,312},{9,10,436}\n,{10,0,156},{10,0,588},{10,10,311},{10,10,623},{11,10,72},{11,10,330},{11,10,455\n},{12,0,101},{12,10,321},{12,10,504},{12,10,530},{12,10,543},{13,10,17},{13,10,\n156},{13,10,334},{14,0,48},{15,0,70},{17,10,60},{148,10,64},{4,11,252},{7,11,\n1068},{10,11,434},{11,11,228},{11,11,426},{13,11,231},{18,11,106},{148,11,87},{7\n,10,354},{10,10,410},{139,10,815},{6,0,367},{7,10,670},{7,10,1327},{8,10,411},{8\n,10,435},{9,10,653},{9,10,740},{10,10,385},{11,10,222},{11,10,324},{11,10,829},{\n140,10,611},{6,10,166},{7,0,1174},{135,10,374},{146,0,121},{132,0,828},{5,11,231\n},{138,11,509},{7,11,601},{9,11,277},{9,11,674},{10,11,178},{10,11,257},{10,11,\n418},{11,11,531},{11,11,544},{11,11,585},{12,11,113},{12,11,475},{13,11,99},{142\n,11,428},{134,0,1541},{135,11,1779},{5,0,343},{134,10,398},{135,10,50},{135,11,\n1683},{4,0,440},{7,0,57},{8,0,167},{8,0,375},{9,0,82},{9,0,561},{9,0,744},{9,11,\n744},{138,0,620},{134,0,926},{6,10,517},{7,10,1159},{10,10,621},{139,10,192},{\n137,0,827},{8,0,194},{136,0,756},{10,10,223},{139,10,645},{7,10,64},{136,10,245}\n,{4,11,399},{5,11,119},{5,11,494},{7,11,751},{137,11,556},{132,0,808},{135,0,22}\n,{7,10,1763},{140,10,310},{5,0,639},{6,11,584},{7,0,1249},{139,0,896},{134,0,\n1614},{135,0,860},{135,11,1121},{5,10,129},{6,10,61},{135,10,947},{4,0,102},{7,0\n,815},{7,0,1699},{139,0,964},{13,10,505},{141,10,506},{139,10,1000},{132,11,679}\n,{132,0,899},{132,0,569},{5,11,694},{137,11,714},{136,0,795},{6,0,2045},{139,11,\n7},{6,0,52},{9,0,104},{9,0,559},{12,0,308},{147,0,87},{4,0,301},{132,0,604},{133\n,10,637},{136,0,779},{5,11,143},{5,11,769},{6,11,1760},{7,11,682},{7,11,1992},{\n136,11,736},{137,10,590},{147,0,32},{137,11,527},{5,10,280},{135,10,1226},{134,0\n,494},{6,0,677},{6,0,682},{134,0,1044},{133,10,281},{135,10,1064},{5,11,860},{\n135,0,508},{6,11,422},{7,11,0},{7,11,1544},{9,11,577},{11,11,990},{12,11,141},{\n12,11,453},{13,11,47},{141,11,266},{134,0,1014},{5,11,515},{137,11,131},{134,0,\n957},{132,11,646},{6,0,310},{7,0,1849},{8,0,72},{8,0,272},{8,0,431},{9,0,12},{9,\n0,376},{10,0,563},{10,0,630},{10,0,796},{10,0,810},{11,0,367},{11,0,599},{11,0,\n686},{140,0,672},{4,11,396},{7,0,570},{7,10,120},{7,11,728},{8,10,489},{9,10,319\n},{9,11,117},{10,10,820},{11,10,1004},{12,10,379},{12,10,679},{13,10,117},{13,10\n,412},{13,11,202},{14,10,25},{15,10,52},{15,10,161},{16,10,47},{20,11,51},{149,\n10,2},{6,11,121},{6,11,124},{6,11,357},{7,11,1138},{7,11,1295},{8,11,162},{139,\n11,655},{4,10,937},{5,10,801},{8,0,449},{136,11,449},{139,11,958},{6,0,181},{7,0\n,537},{8,0,64},{9,0,127},{10,0,496},{12,0,510},{141,0,384},{138,11,253},{4,0,244\n},{135,0,233},{133,11,237},{132,10,365},{6,0,1650},{10,0,702},{139,0,245},{5,10,\n7},{139,10,774},{13,0,463},{13,11,463},{20,0,49},{148,11,49},{4,10,734},{5,10,\n662},{134,10,430},{4,10,746},{135,10,1090},{5,10,360},{136,10,237},{137,0,338},{\n143,11,10},{7,11,571},{138,11,366},{134,0,1279},{9,11,513},{10,11,22},{10,11,39}\n,{12,11,122},{140,11,187},{133,0,896},{146,0,178},{134,0,695},{137,0,808},{134,\n11,587},{7,11,107},{7,11,838},{8,11,550},{138,11,401},{7,0,1117},{136,0,539},{4,\n10,277},{5,10,608},{6,10,493},{7,10,457},{140,10,384},{133,11,768},{7,10,27},{7,\n10,316},{140,0,257},{140,0,1003},{4,0,207},{5,0,586},{5,0,676},{5,10,552},{6,0,\n448},{8,0,244},{11,0,1},{13,0,3},{16,0,54},{17,0,4},{146,0,13},{4,10,401},{137,\n10,264},{5,0,516},{7,0,1883},{135,11,1883},{4,11,894},{140,0,960},{5,0,4},{5,0,\n810},{6,0,13},{6,0,538},{6,0,1690},{6,0,1726},{7,0,499},{7,0,1819},{8,0,148},{8,\n0,696},{8,0,791},{12,0,125},{143,0,9},{135,0,1268},{9,10,543},{10,10,524},{11,0,\n30},{12,10,524},{14,0,315},{16,10,18},{20,10,26},{148,10,65},{4,10,205},{5,10,\n623},{6,0,748},{7,10,104},{136,10,519},{11,0,542},{139,0,852},{140,0,6},{132,0,\n848},{7,0,1385},{7,10,579},{9,10,41},{9,10,244},{9,10,669},{10,10,5},{11,0,582},\n{11,0,650},{11,0,901},{11,0,949},{11,10,861},{11,10,951},{11,10,980},{12,0,232},\n{12,0,236},{13,0,413},{13,0,501},{146,0,116},{4,0,945},{6,0,1811},{6,0,1845},{6,\n0,1853},{6,0,1858},{8,0,862},{12,0,782},{12,0,788},{18,0,160},{148,0,117},{132,\n10,717},{4,0,925},{5,0,803},{8,0,698},{138,0,828},{134,0,1416},{132,0,610},{139,\n0,992},{6,0,878},{134,0,1477},{135,0,1847},{138,11,531},{137,11,539},{134,11,272\n},{133,0,383},{134,0,1404},{132,10,489},{4,11,9},{5,11,128},{7,11,368},{11,11,\n480},{148,11,3},{136,0,986},{9,0,660},{138,0,347},{135,10,892},{136,11,682},{7,0\n,572},{9,0,592},{11,0,680},{12,0,356},{140,0,550},{7,0,1411},{138,11,527},{4,11,\n2},{7,11,545},{135,11,894},{137,10,473},{7,10,819},{7,11,481},{9,10,26},{9,10,\n392},{9,11,792},{10,10,152},{10,10,226},{11,0,64},{12,10,276},{12,10,426},{12,10\n,589},{13,10,460},{15,10,97},{19,10,48},{148,10,104},{135,10,51},{136,11,445},{\n136,11,646},{135,0,606},{132,10,674},{6,0,1829},{134,0,1830},{132,10,770},{5,10,\n79},{7,10,1027},{7,10,1477},{139,10,52},{5,11,530},{142,11,113},{134,10,1666},{7\n,0,748},{139,0,700},{134,10,195},{133,10,789},{4,10,251},{4,10,688},{7,10,513},{\n7,10,1284},{9,0,87},{138,0,365},{136,11,111},{133,0,127},{6,0,198},{140,0,83},{\n133,11,556},{133,10,889},{4,10,160},{5,10,330},{7,10,1434},{136,10,174},{5,0,276\n},{6,0,55},{7,0,1369},{138,0,864},{8,11,16},{140,11,568},{6,0,1752},{136,0,726},\n{135,0,1066},{133,0,764},{6,11,186},{137,11,426},{11,0,683},{139,11,683},{6,0,\n309},{7,0,331},{138,0,550},{133,10,374},{6,0,1212},{6,0,1852},{7,0,1062},{8,0,\n874},{8,0,882},{138,0,936},{132,11,585},{134,0,1364},{5,10,731},{135,0,986},{6,0\n,723},{6,0,1408},{138,0,381},{135,0,1573},{134,0,1025},{4,10,626},{5,10,642},{6,\n10,425},{10,10,202},{139,10,141},{4,11,93},{5,11,252},{6,11,229},{7,11,291},{9,\n11,550},{139,11,644},{137,11,749},{137,11,162},{132,11,381},{135,0,1559},{6,0,\n194},{7,0,133},{10,0,493},{10,0,570},{139,0,664},{5,0,24},{5,0,569},{6,0,3},{6,0\n,119},{6,0,143},{6,0,440},{7,0,295},{7,0,599},{7,0,1686},{7,0,1854},{8,0,424},{9\n,0,43},{9,0,584},{9,0,760},{10,0,148},{10,0,328},{11,0,159},{11,0,253},{11,0,506\n},{12,0,487},{140,0,531},{6,0,661},{134,0,1517},{136,10,835},{151,10,17},{5,0,14\n},{5,0,892},{6,0,283},{7,0,234},{136,0,537},{139,0,541},{4,0,126},{8,0,635},{147\n,0,34},{4,0,316},{4,0,495},{135,0,1561},{4,11,187},{5,11,184},{5,11,690},{7,11,\n1869},{138,11,756},{139,11,783},{4,0,998},{137,0,861},{136,0,1009},{139,11,292},\n{5,11,21},{6,11,77},{6,11,157},{7,11,974},{7,11,1301},{7,11,1339},{7,11,1490},{7\n,11,1873},{137,11,628},{7,11,1283},{9,11,227},{9,11,499},{10,11,341},{11,11,325}\n,{11,11,408},{14,11,180},{15,11,144},{18,11,47},{147,11,49},{4,0,64},{5,0,352},{\n5,0,720},{6,0,368},{139,0,359},{5,10,384},{8,10,455},{140,10,48},{5,10,264},{134\n,10,184},{7,0,1577},{10,0,304},{10,0,549},{12,0,365},{13,0,220},{13,0,240},{142,\n0,33},{134,0,1107},{134,0,929},{135,0,1142},{6,0,175},{137,0,289},{5,0,432},{133\n,0,913},{5,10,633},{6,0,279},{7,0,219},{135,10,1323},{7,0,785},{7,10,359},{8,10,\n243},{140,10,175},{139,0,595},{132,10,105},{8,11,398},{9,11,681},{139,11,632},{\n140,0,80},{5,0,931},{134,0,1698},{142,11,241},{134,11,20},{134,0,1323},{11,0,526\n},{11,0,939},{141,0,290},{5,0,774},{6,0,780},{6,0,1637},{6,0,1686},{6,0,1751},{8\n,0,559},{141,0,109},{141,0,127},{7,0,1167},{7,11,709},{11,0,934},{13,0,391},{145\n,0,76},{135,0,963},{6,0,260},{135,0,1484},{134,0,573},{4,10,758},{139,11,941},{\n135,10,1649},{145,11,36},{4,0,292},{137,0,580},{4,0,736},{5,0,871},{6,0,1689},{\n135,0,1944},{7,11,945},{11,11,713},{139,11,744},{134,0,1164},{135,11,937},{6,0,\n1922},{7,11,1652},{9,0,982},{15,0,173},{15,0,178},{15,0,200},{18,0,189},{18,0,\n207},{149,0,47},{7,0,1695},{139,10,128},{6,0,63},{135,0,920},{133,0,793},{143,11\n,134},{133,10,918},{5,0,67},{6,0,62},{6,0,374},{135,0,1391},{4,11,579},{5,11,226\n},{5,11,323},{7,11,960},{9,0,790},{140,0,47},{10,11,784},{141,11,191},{4,0,391},\n{135,0,1169},{137,0,443},{13,11,232},{146,11,35},{132,10,340},{132,0,271},{137,\n11,313},{5,11,973},{137,11,659},{134,0,1140},{6,11,135},{135,11,1176},{4,0,253},\n{5,0,544},{7,0,300},{137,0,340},{5,10,985},{7,0,897},{7,10,509},{145,10,96},{138\n,11,735},{135,10,1919},{138,0,890},{5,0,818},{134,0,1122},{5,0,53},{5,0,541},{6,\n0,94},{6,0,499},{7,0,230},{139,0,321},{4,0,920},{5,0,25},{5,0,790},{6,0,457},{7,\n0,853},{8,0,788},{142,11,31},{132,10,247},{135,11,314},{132,0,468},{6,10,337},{7\n,0,243},{7,10,494},{8,10,27},{8,10,599},{138,10,153},{4,10,184},{5,10,390},{7,10\n,618},{7,10,1456},{139,10,710},{134,0,870},{134,0,1238},{134,0,1765},{10,0,853},\n{10,0,943},{14,0,437},{14,0,439},{14,0,443},{14,0,446},{14,0,452},{14,0,469},{14\n,0,471},{14,0,473},{16,0,93},{16,0,102},{16,0,110},{148,0,121},{4,0,605},{7,0,\n518},{7,0,1282},{7,0,1918},{10,0,180},{139,0,218},{133,0,822},{4,0,634},{11,0,\n916},{142,0,419},{6,11,281},{7,11,6},{8,11,282},{8,11,480},{8,11,499},{9,11,198}\n,{10,11,143},{10,11,169},{10,11,211},{10,11,417},{10,11,574},{11,11,147},{11,11,\n395},{12,11,75},{12,11,407},{12,11,608},{13,11,500},{142,11,251},{134,0,898},{6,\n0,36},{7,0,658},{8,0,454},{150,11,48},{133,11,674},{135,11,1776},{4,11,419},{10,\n10,227},{11,10,497},{11,10,709},{140,10,415},{6,10,360},{7,10,1664},{136,10,478}\n,{137,0,806},{12,11,508},{14,11,102},{14,11,226},{144,11,57},{135,11,1123},{4,11\n,138},{7,11,1012},{7,11,1280},{137,11,76},{5,11,29},{140,11,638},{136,10,699},{\n134,0,1326},{132,0,104},{135,11,735},{132,10,739},{134,0,1331},{7,0,260},{135,11\n,260},{135,11,1063},{7,0,45},{9,0,542},{9,0,566},{9,10,869},{138,0,728},{4,10,67\n},{5,10,422},{7,10,1037},{7,10,1289},{7,10,1555},{9,10,741},{145,10,108},{139,0,\n263},{134,0,1516},{14,0,146},{15,0,42},{16,0,23},{17,0,86},{146,0,17},{138,0,468\n},{136,0,1005},{4,11,17},{5,11,23},{7,11,995},{11,11,383},{11,11,437},{12,11,460\n},{140,11,532},{7,0,87},{142,0,288},{138,10,96},{135,11,626},{144,10,26},{7,0,\n988},{7,0,1939},{9,0,64},{9,0,502},{12,0,22},{12,0,34},{13,0,12},{13,0,234},{147\n,0,77},{8,10,203},{11,10,823},{11,10,846},{12,10,482},{13,0,133},{13,10,277},{13\n,10,302},{13,10,464},{14,10,205},{142,10,221},{4,10,449},{133,10,718},{135,0,141\n},{6,0,1842},{136,0,872},{8,11,70},{12,11,171},{141,11,272},{4,10,355},{6,10,311\n},{9,10,256},{138,10,404},{132,0,619},{137,0,261},{10,10,758},{10,11,233},{139,\n11,76},{5,0,246},{8,0,189},{9,0,355},{9,0,512},{10,0,124},{10,0,453},{11,0,143},\n{11,0,416},{11,0,859},{141,0,341},{134,11,442},{133,10,827},{5,10,64},{140,10,\n581},{4,10,442},{7,10,1047},{7,10,1352},{135,10,1643},{134,11,1709},{5,0,678},{5\n,10,977},{6,0,305},{7,0,775},{135,0,1065},{11,11,69},{12,11,105},{12,11,117},{13\n,11,213},{14,11,13},{14,11,62},{14,11,177},{14,11,421},{15,11,19},{146,11,141},{\n137,11,309},{5,0,35},{7,0,862},{7,0,1886},{138,0,179},{136,0,285},{132,0,517},{7\n,11,976},{9,11,146},{10,11,206},{10,11,596},{13,11,218},{142,11,153},{132,10,254\n},{4,10,275},{6,0,214},{7,10,1219},{12,0,540},{140,10,376},{8,0,667},{11,0,403},\n{146,0,83},{10,11,648},{11,11,671},{12,0,74},{143,11,46},{135,0,125},{134,10,\n1753},{133,0,761},{4,11,518},{6,0,912},{6,10,369},{6,10,502},{7,10,1036},{7,11,\n1136},{8,10,348},{9,10,452},{10,10,26},{11,10,224},{11,10,387},{11,10,772},{12,\n10,95},{12,10,629},{13,10,195},{13,10,207},{13,10,241},{14,10,260},{14,10,270},{\n143,10,140},{10,0,131},{140,0,72},{132,10,269},{5,10,480},{7,10,532},{7,10,1197}\n,{7,10,1358},{8,10,291},{11,10,349},{142,10,396},{8,11,689},{137,11,863},{8,0,\n333},{138,0,182},{4,11,18},{7,11,145},{7,11,444},{7,11,1278},{8,11,49},{8,11,400\n},{9,11,71},{9,11,250},{10,11,459},{12,11,160},{144,11,24},{14,11,35},{142,11,\n191},{135,11,1864},{135,0,1338},{148,10,15},{14,0,94},{15,0,65},{16,0,4},{16,0,\n77},{16,0,80},{145,0,5},{12,11,82},{143,11,36},{133,11,1010},{133,0,449},{133,0,\n646},{7,0,86},{7,10,657},{136,0,103},{7,0,2028},{138,0,641},{136,10,533},{134,0,\n1},{139,11,970},{5,11,87},{7,11,313},{7,11,1103},{10,11,112},{10,11,582},{11,11,\n389},{11,11,813},{12,11,385},{13,11,286},{14,11,124},{146,11,108},{4,11,267},{\n134,0,869},{6,0,277},{7,0,1274},{7,0,1386},{146,0,87},{6,0,187},{7,0,39},{7,0,\n1203},{8,0,380},{14,0,117},{149,0,28},{4,10,211},{4,10,332},{5,10,335},{6,10,238\n},{7,10,269},{7,10,811},{7,10,1797},{8,10,836},{9,10,507},{141,10,242},{4,0,785}\n,{5,0,368},{6,0,297},{7,0,793},{139,0,938},{7,0,464},{8,0,558},{11,0,105},{12,0,\n231},{14,0,386},{15,0,102},{148,0,75},{133,10,1009},{8,0,877},{140,0,731},{139,\n11,289},{10,11,249},{139,11,209},{132,11,561},{134,0,1608},{132,11,760},{134,0,\n1429},{9,11,154},{140,11,485},{5,10,228},{6,10,203},{7,10,156},{8,10,347},{137,\n10,265},{7,0,1010},{11,0,733},{11,0,759},{13,0,34},{14,0,427},{146,0,45},{7,10,\n1131},{135,10,1468},{136,11,255},{7,0,1656},{9,0,369},{10,0,338},{10,0,490},{11,\n0,154},{11,0,545},{11,0,775},{13,0,77},{141,0,274},{133,11,621},{134,0,1038},{4,\n11,368},{135,11,641},{6,0,2010},{8,0,979},{8,0,985},{10,0,951},{138,0,1011},{134\n,0,1005},{5,10,291},{5,10,318},{7,10,765},{9,10,389},{12,10,548},{147,0,121},{5,\n0,20},{6,0,298},{7,0,659},{137,0,219},{7,0,1440},{11,0,854},{11,0,872},{11,0,921\n},{12,0,551},{13,0,472},{142,0,367},{5,0,490},{6,0,615},{6,0,620},{135,0,683},{6\n,0,1070},{134,0,1597},{139,0,522},{132,0,439},{136,0,669},{6,0,766},{6,0,1143},{\n6,0,1245},{10,10,525},{139,10,82},{9,11,92},{147,11,91},{6,0,668},{134,0,1218},{\n6,11,525},{9,11,876},{140,11,284},{132,0,233},{136,0,547},{132,10,422},{5,10,355\n},{145,10,0},{6,11,300},{135,11,1515},{4,0,482},{137,10,905},{4,0,886},{5,11,594\n},{135,0,346},{133,10,865},{5,10,914},{134,10,1625},{135,0,334},{5,0,795},{5,10,\n234},{134,0,1741},{135,10,1383},{6,11,1641},{136,11,820},{135,0,371},{7,11,1313}\n,{138,11,660},{135,10,1312},{135,0,622},{7,0,625},{135,0,1750},{135,0,339},{4,0,\n203},{135,0,1936},{15,0,29},{15,11,29},{16,0,38},{144,11,38},{5,0,338},{135,0,\n1256},{135,10,1493},{6,10,421},{7,10,61},{7,10,1540},{10,0,130},{138,10,501},{6,\n11,389},{7,11,149},{9,11,142},{138,11,94},{137,10,341},{11,0,678},{12,0,307},{\n142,10,98},{6,11,8},{7,11,1881},{136,11,91},{135,0,2044},{6,0,770},{6,0,802},{6,\n0,812},{6,10,102},{7,0,311},{7,10,72},{9,0,308},{12,0,255},{15,10,142},{147,10,\n67},{151,10,30},{135,10,823},{135,0,1266},{135,11,1746},{135,10,1870},{4,0,400},\n{5,0,267},{135,0,232},{7,11,24},{11,11,542},{139,11,852},{135,11,1739},{4,11,503\n},{135,11,1661},{5,11,130},{7,11,1314},{9,11,610},{10,11,718},{11,11,601},{11,11\n,819},{11,11,946},{140,11,536},{10,11,149},{11,11,280},{142,11,336},{7,0,739},{7\n,11,1946},{8,10,48},{8,10,88},{8,10,582},{8,10,681},{9,10,373},{9,10,864},{11,0,\n690},{11,10,157},{11,10,843},{148,10,27},{134,0,990},{4,10,88},{5,10,137},{5,10,\n174},{5,10,777},{6,10,1664},{6,10,1725},{7,10,77},{7,10,426},{7,10,1317},{7,10,\n1355},{8,10,126},{8,10,563},{9,10,523},{9,10,750},{10,10,310},{10,10,836},{11,10\n,42},{11,10,318},{11,10,731},{12,10,68},{12,10,92},{12,10,507},{12,10,692},{13,\n10,81},{13,10,238},{13,10,374},{14,10,436},{18,10,138},{19,10,78},{19,10,111},{\n20,10,55},{20,10,77},{148,10,92},{141,10,418},{4,10,938},{135,0,1831},{6,0,776},\n{134,0,915},{138,10,351},{5,11,348},{6,10,1668},{6,11,522},{7,10,1499},{8,10,117\n},{9,10,314},{138,10,174},{135,10,707},{132,0,613},{133,10,403},{132,11,392},{5,\n11,433},{9,11,633},{139,11,629},{133,0,763},{132,0,878},{132,0,977},{132,0,100},\n{4,10,44},{5,10,311},{6,0,463},{7,10,639},{7,10,762},{7,10,1827},{9,10,8},{9,10,\n462},{148,10,83},{134,11,234},{4,10,346},{7,10,115},{9,10,180},{9,10,456},{138,\n10,363},{5,0,362},{5,0,443},{6,0,318},{7,0,1019},{139,0,623},{5,0,463},{7,11,140\n},{7,11,1950},{8,0,296},{8,11,680},{11,11,817},{147,11,88},{7,11,1222},{138,11,\n386},{142,0,137},{132,0,454},{6,11,5},{7,0,1914},{7,10,1051},{9,10,545},{11,11,\n249},{12,11,313},{16,11,66},{145,11,26},{135,0,1527},{145,0,58},{148,11,59},{5,0\n,48},{5,0,404},{6,0,557},{7,0,458},{8,0,597},{10,0,455},{10,0,606},{11,0,49},{11\n,0,548},{12,0,476},{13,0,18},{141,0,450},{5,11,963},{134,11,1773},{133,0,729},{\n138,11,586},{5,0,442},{135,0,1984},{134,0,449},{144,0,40},{4,0,853},{7,11,180},{\n8,11,509},{136,11,792},{6,10,185},{7,10,1899},{9,10,875},{139,10,673},{134,11,\n524},{4,10,327},{5,10,478},{7,10,1332},{8,10,753},{140,0,227},{5,10,1020},{5,10,\n1022},{134,0,1491},{4,10,103},{133,10,401},{132,11,931},{4,10,499},{135,10,1421}\n,{5,0,55},{7,0,376},{140,0,161},{133,0,450},{6,0,1174},{134,0,1562},{7,11,1837},\n{10,0,62},{141,0,400},{140,0,207},{135,0,869},{4,11,773},{5,11,618},{137,11,756}\n,{132,10,96},{4,0,213},{7,0,223},{7,10,968},{136,0,80},{4,11,90},{5,11,337},{5,\n11,545},{7,11,754},{9,11,186},{10,11,72},{10,11,782},{11,11,513},{11,11,577},{11\n,11,610},{11,11,889},{11,11,961},{12,11,354},{12,11,362},{12,11,461},{12,11,595}\n,{13,11,79},{143,11,121},{7,0,381},{7,0,806},{7,0,820},{8,0,354},{8,0,437},{8,0,\n787},{9,0,657},{10,0,58},{10,0,339},{10,0,749},{11,0,914},{12,0,162},{13,0,75},{\n14,0,106},{14,0,198},{14,0,320},{14,0,413},{146,0,43},{136,0,747},{136,0,954},{\n134,0,1073},{135,0,556},{7,11,151},{9,11,329},{139,11,254},{5,0,692},{134,0,1395\n},{6,10,563},{137,10,224},{134,0,191},{132,0,804},{9,11,187},{10,11,36},{17,11,\n44},{146,11,64},{7,11,165},{7,11,919},{136,11,517},{4,11,506},{5,11,295},{7,11,\n1680},{15,11,14},{144,11,5},{4,0,706},{6,0,162},{7,0,1960},{136,0,831},{135,11,\n1376},{7,11,987},{9,11,688},{10,11,522},{11,11,788},{140,11,566},{150,0,35},{138\n,0,426},{135,0,1235},{135,11,1741},{7,11,389},{7,11,700},{7,11,940},{8,11,514},{\n9,11,116},{9,11,535},{10,11,118},{11,11,107},{11,11,148},{11,11,922},{12,11,254}\n,{12,11,421},{142,11,238},{134,0,1234},{132,11,743},{4,10,910},{5,10,832},{135,\n11,1335},{141,0,96},{135,11,185},{146,0,149},{4,0,204},{137,0,902},{4,11,784},{\n133,11,745},{136,0,833},{136,0,949},{5,11,81},{7,0,366},{7,11,146},{7,11,1342},{\n7,11,1446},{8,11,53},{8,11,561},{8,11,694},{8,11,754},{9,0,287},{9,11,97},{9,11,\n115},{9,11,894},{10,11,462},{10,11,813},{11,11,230},{11,11,657},{11,11,699},{11,\n11,748},{12,0,199},{12,0,556},{12,0,577},{12,11,119},{12,11,200},{12,11,283},{14\n,11,273},{145,11,15},{5,11,408},{137,11,747},{9,11,498},{140,11,181},{6,0,2020},\n{136,0,992},{5,0,356},{135,0,224},{134,0,784},{7,0,630},{8,10,528},{9,0,567},{9,\n10,348},{11,0,150},{11,0,444},{141,0,119},{134,0,539},{4,10,20},{133,10,616},{\n142,0,27},{7,11,30},{8,11,86},{8,11,315},{8,11,700},{9,11,576},{9,11,858},{11,11\n,310},{11,11,888},{11,11,904},{12,11,361},{141,11,248},{138,11,839},{134,0,755},\n{134,0,1063},{7,10,1091},{135,10,1765},{134,11,428},{7,11,524},{8,11,169},{8,11,\n234},{9,11,480},{138,11,646},{139,0,814},{7,11,1462},{139,11,659},{4,10,26},{5,\n10,429},{6,10,245},{7,10,704},{7,10,1379},{135,10,1474},{7,11,1205},{138,11,637}\n,{139,11,803},{132,10,621},{136,0,987},{4,11,266},{8,11,4},{9,11,39},{10,11,166}\n,{11,11,918},{12,11,635},{20,11,10},{22,11,27},{150,11,43},{4,0,235},{135,0,255}\n,{4,0,194},{5,0,584},{6,0,384},{7,0,583},{10,0,761},{11,0,760},{139,0,851},{133,\n10,542},{134,0,1086},{133,10,868},{8,0,1016},{136,0,1018},{7,0,1396},{7,11,1396}\n,{136,10,433},{135,10,1495},{138,10,215},{141,10,124},{7,11,157},{8,11,279},{9,\n11,759},{16,11,31},{16,11,39},{16,11,75},{18,11,24},{20,11,42},{152,11,1},{5,0,\n562},{134,11,604},{134,0,913},{5,0,191},{137,0,271},{4,0,470},{6,0,153},{7,0,\n1503},{7,0,1923},{10,0,701},{11,0,132},{11,0,227},{11,0,320},{11,0,436},{11,0,\n525},{11,0,855},{11,0,873},{12,0,41},{12,0,286},{13,0,103},{13,0,284},{14,0,255}\n,{14,0,262},{15,0,117},{143,0,127},{7,0,475},{12,0,45},{147,10,112},{132,11,567}\n,{137,11,859},{6,0,713},{6,0,969},{6,0,1290},{134,0,1551},{133,0,327},{6,0,552},\n{6,0,1292},{7,0,1754},{137,0,604},{4,0,223},{5,11,762},{6,0,359},{7,11,1880},{9,\n11,680},{11,0,3},{11,11,798},{13,0,108},{14,0,89},{144,0,22},{5,0,80},{6,0,405},\n{7,0,403},{7,0,1502},{8,0,456},{9,0,487},{9,0,853},{9,0,889},{10,0,309},{11,0,\n721},{11,0,994},{12,0,430},{141,0,165},{133,11,298},{132,10,647},{134,0,2016},{\n18,10,10},{146,11,10},{4,0,453},{5,0,887},{6,0,535},{8,0,6},{8,0,543},{136,0,826\n},{136,0,975},{10,0,961},{138,0,962},{138,10,220},{6,0,1891},{6,0,1893},{9,0,916\n},{9,0,965},{9,0,972},{12,0,801},{12,0,859},{12,0,883},{15,0,226},{149,0,51},{\n132,10,109},{135,11,267},{7,11,92},{7,11,182},{8,11,453},{9,11,204},{11,11,950},\n{12,11,94},{12,11,644},{16,11,20},{16,11,70},{16,11,90},{147,11,55},{134,10,1746\n},{6,11,71},{7,11,845},{7,11,1308},{8,11,160},{137,11,318},{5,0,101},{6,0,88},{7\n,0,263},{7,0,628},{7,0,1677},{7,11,237},{8,0,349},{8,11,664},{9,0,100},{9,11,42}\n,{9,11,266},{9,11,380},{9,11,645},{10,0,677},{10,11,177},{10,11,276},{14,0,169},\n{14,0,302},{14,0,313},{15,0,48},{143,0,84},{138,11,69},{4,0,310},{7,0,708},{7,0,\n996},{9,0,795},{10,0,390},{10,0,733},{11,0,451},{12,0,249},{14,0,115},{14,0,286}\n,{143,0,100},{4,10,40},{5,0,587},{10,10,67},{11,10,117},{11,10,768},{139,10,935}\n,{6,0,1942},{7,0,512},{136,0,983},{7,10,992},{8,10,301},{9,10,722},{12,10,63},{\n13,10,29},{14,10,161},{143,10,18},{136,11,76},{139,10,923},{134,0,645},{134,0,\n851},{4,0,498},{132,11,293},{7,0,217},{8,0,140},{10,0,610},{14,11,352},{17,11,53\n},{18,11,146},{18,11,152},{19,11,11},{150,11,54},{134,0,1448},{138,11,841},{133,\n0,905},{4,11,605},{7,11,518},{7,11,1282},{7,11,1918},{10,11,180},{139,11,218},{\n139,11,917},{135,10,825},{140,10,328},{4,0,456},{7,0,105},{7,0,358},{7,0,1637},{\n8,0,643},{139,0,483},{134,0,792},{6,11,96},{135,11,1426},{137,11,691},{4,11,651}\n,{133,11,289},{7,11,688},{8,11,35},{9,11,511},{10,11,767},{147,11,118},{150,0,56\n},{5,0,243},{5,0,535},{6,10,204},{10,10,320},{10,10,583},{13,10,502},{14,10,72},\n{14,10,274},{14,10,312},{14,10,344},{15,10,159},{16,10,62},{16,10,69},{17,10,30}\n,{18,10,42},{18,10,53},{18,10,84},{18,10,140},{19,10,68},{19,10,85},{20,10,5},{\n20,10,45},{20,10,101},{22,10,7},{150,10,20},{4,10,558},{6,10,390},{7,10,162},{7,\n10,689},{9,10,360},{138,10,653},{146,11,23},{135,0,1748},{5,10,856},{6,10,1672},\n{6,10,1757},{134,10,1781},{4,11,704},{5,0,539},{5,0,754},{134,0,876},{135,11,\n1078},{5,10,92},{10,10,736},{140,10,102},{5,10,590},{9,10,213},{145,0,91},{134,0\n,1565},{6,0,91},{135,0,435},{4,0,939},{140,0,792},{134,0,1399},{4,0,16},{4,11,\n720},{5,0,316},{5,0,842},{5,11,306},{6,0,370},{6,0,1778},{8,0,166},{11,0,812},{\n12,0,206},{12,0,351},{14,0,418},{16,0,15},{16,0,34},{18,0,3},{19,0,3},{19,0,7},{\n20,0,4},{149,0,21},{144,0,95},{133,11,431},{132,11,234},{135,0,551},{4,0,999},{6\n,0,1966},{134,0,2042},{7,0,619},{10,0,547},{11,0,122},{12,0,601},{15,0,7},{148,0\n,20},{5,11,464},{6,11,236},{7,11,276},{7,11,696},{7,11,914},{7,11,1108},{7,11,\n1448},{9,11,15},{9,11,564},{10,11,14},{12,11,565},{13,11,449},{14,11,53},{15,11,\n13},{16,11,64},{145,11,41},{6,0,884},{6,0,1019},{134,0,1150},{6,11,1767},{12,11,\n194},{145,11,107},{136,10,503},{133,11,840},{6,10,466},{135,0,671},{132,0,888},{\n4,0,149},{138,0,368},{4,0,154},{7,0,1134},{136,0,105},{135,0,983},{9,11,642},{11\n,11,236},{142,11,193},{4,0,31},{6,0,429},{7,0,962},{9,0,458},{139,0,691},{6,0,\n643},{134,0,1102},{132,0,312},{4,11,68},{5,11,634},{6,11,386},{7,11,794},{8,11,\n273},{9,11,563},{10,11,105},{10,11,171},{11,11,94},{139,11,354},{133,0,740},{135\n,0,1642},{4,11,95},{7,11,416},{8,11,211},{139,11,830},{132,0,236},{138,10,241},{\n7,11,731},{13,11,20},{143,11,11},{5,0,836},{5,0,857},{6,0,1680},{135,0,59},{10,0\n,68},{11,0,494},{152,11,6},{4,0,81},{139,0,867},{135,0,795},{133,11,689},{4,0,\n1001},{5,0,282},{6,0,1932},{6,0,1977},{6,0,1987},{6,0,1992},{8,0,650},{8,0,919},\n{8,0,920},{8,0,923},{8,0,926},{8,0,927},{8,0,931},{8,0,939},{8,0,947},{8,0,956},\n{8,0,997},{9,0,907},{10,0,950},{10,0,953},{10,0,954},{10,0,956},{10,0,958},{10,0\n,959},{10,0,964},{10,0,970},{10,0,972},{10,0,973},{10,0,975},{10,0,976},{10,0,\n980},{10,0,981},{10,0,984},{10,0,988},{10,0,990},{10,0,995},{10,0,999},{10,0,\n1002},{10,0,1003},{10,0,1005},{10,0,1006},{10,0,1008},{10,0,1009},{10,0,1012},{\n10,0,1014},{10,0,1015},{10,0,1019},{10,0,1020},{10,0,1022},{12,0,959},{12,0,961}\n,{12,0,962},{12,0,963},{12,0,964},{12,0,965},{12,0,967},{12,0,968},{12,0,969},{\n12,0,970},{12,0,971},{12,0,972},{12,0,973},{12,0,974},{12,0,975},{12,0,976},{12,\n0,977},{12,0,979},{12,0,981},{12,0,982},{12,0,983},{12,0,984},{12,0,985},{12,0,\n986},{12,0,987},{12,0,989},{12,0,990},{12,0,992},{12,0,993},{12,0,995},{12,0,998\n},{12,0,999},{12,0,1000},{12,0,1001},{12,0,1002},{12,0,1004},{12,0,1005},{12,0,\n1006},{12,0,1007},{12,0,1008},{12,0,1009},{12,0,1010},{12,0,1011},{12,0,1012},{\n12,0,1014},{12,0,1015},{12,0,1016},{12,0,1017},{12,0,1018},{12,0,1019},{12,0,\n1022},{12,0,1023},{14,0,475},{14,0,477},{14,0,478},{14,0,479},{14,0,480},{14,0,\n482},{14,0,483},{14,0,484},{14,0,485},{14,0,486},{14,0,487},{14,0,488},{14,0,489\n},{14,0,490},{14,0,491},{14,0,492},{14,0,493},{14,0,494},{14,0,495},{14,0,496},{\n14,0,497},{14,0,498},{14,0,499},{14,0,500},{14,0,501},{14,0,502},{14,0,503},{14,\n0,504},{14,0,506},{14,0,507},{14,0,508},{14,0,509},{14,0,510},{14,0,511},{16,0,\n113},{16,0,114},{16,0,115},{16,0,117},{16,0,118},{16,0,119},{16,0,121},{16,0,122\n},{16,0,123},{16,0,124},{16,0,125},{16,0,126},{16,0,127},{18,0,242},{18,0,243},{\n18,0,244},{18,0,245},{18,0,248},{18,0,249},{18,0,250},{18,0,251},{18,0,252},{18,\n0,253},{18,0,254},{18,0,255},{20,0,125},{20,0,126},{148,0,127},{7,11,1717},{7,11\n,1769},{138,11,546},{7,11,1127},{7,11,1572},{10,11,297},{10,11,422},{11,11,764},\n{11,11,810},{12,11,264},{13,11,102},{13,11,300},{13,11,484},{14,11,147},{14,11,\n229},{17,11,71},{18,11,118},{147,11,120},{6,0,1148},{134,0,1586},{132,0,775},{\n135,10,954},{133,11,864},{133,11,928},{138,11,189},{135,10,1958},{6,10,549},{8,\n10,34},{8,10,283},{9,10,165},{138,10,475},{5,10,652},{5,10,701},{135,10,449},{\n135,11,695},{4,10,655},{7,10,850},{17,10,75},{146,10,137},{140,11,682},{133,11,\n523},{8,0,970},{136,10,670},{136,11,555},{7,11,76},{8,11,44},{9,11,884},{10,11,\n580},{11,11,399},{11,11,894},{15,11,122},{18,11,144},{147,11,61},{6,10,159},{6,\n10,364},{7,10,516},{7,10,1439},{137,10,518},{4,0,71},{5,0,376},{7,0,119},{138,0,\n665},{141,10,151},{11,0,827},{14,0,34},{143,0,148},{133,11,518},{4,0,479},{135,\n11,1787},{135,11,1852},{135,10,993},{7,0,607},{136,0,99},{134,0,1960},{132,0,793\n},{4,0,41},{5,0,74},{7,0,1627},{11,0,871},{140,0,619},{7,0,94},{11,0,329},{11,0,\n965},{12,0,241},{14,0,354},{15,0,22},{148,0,63},{7,10,501},{9,10,111},{10,10,141\n},{11,10,332},{13,10,43},{13,10,429},{14,10,130},{14,10,415},{145,10,102},{9,0,\n209},{137,0,300},{134,0,1497},{138,11,255},{4,11,934},{5,11,138},{136,11,610},{\n133,0,98},{6,0,1316},{10,11,804},{138,11,832},{8,11,96},{9,11,36},{10,11,607},{\n11,11,423},{11,11,442},{12,11,309},{14,11,199},{15,11,90},{145,11,110},{132,0,\n463},{5,10,149},{136,10,233},{133,10,935},{4,11,652},{8,11,320},{9,11,13},{9,11,\n398},{9,11,727},{10,11,75},{10,11,184},{10,11,230},{10,11,564},{10,11,569},{11,\n11,973},{12,11,70},{12,11,189},{13,11,57},{13,11,257},{22,11,6},{150,11,16},{142\n,0,291},{12,10,582},{146,10,131},{136,10,801},{133,0,984},{145,11,116},{4,11,692\n},{133,11,321},{4,0,182},{6,0,205},{135,0,220},{4,0,42},{9,0,205},{9,0,786},{138\n,0,659},{6,0,801},{11,11,130},{140,11,609},{132,0,635},{5,11,345},{135,11,1016},\n{139,0,533},{132,0,371},{4,0,272},{135,0,836},{6,0,1282},{135,11,1100},{5,0,825}\n,{134,0,1640},{135,11,1325},{133,11,673},{4,11,287},{133,11,1018},{135,0,357},{6\n,0,467},{137,0,879},{7,0,317},{135,0,569},{6,0,924},{134,0,1588},{5,10,406},{5,\n11,34},{10,11,724},{12,11,444},{13,11,354},{18,11,32},{23,11,24},{23,11,31},{152\n,11,5},{6,0,1795},{6,0,1835},{6,0,1836},{6,0,1856},{8,0,844},{8,0,849},{8,0,854}\n,{8,0,870},{8,0,887},{10,0,852},{138,0,942},{6,10,69},{135,10,117},{137,0,307},{\n4,0,944},{6,0,1799},{6,0,1825},{10,0,848},{10,0,875},{10,0,895},{10,0,899},{10,0\n,902},{140,0,773},{11,0,43},{13,0,72},{141,0,142},{135,10,1830},{134,11,382},{4,\n10,432},{135,10,824},{132,11,329},{7,0,1820},{139,11,124},{133,10,826},{133,0,\n525},{132,11,906},{7,11,1940},{136,11,366},{138,11,10},{4,11,123},{4,11,649},{5,\n11,605},{7,11,1509},{136,11,36},{6,0,110},{135,0,1681},{133,0,493},{133,11,767},\n{4,0,174},{135,0,911},{138,11,786},{8,0,417},{137,0,782},{133,10,1000},{7,0,733}\n,{137,0,583},{4,10,297},{6,10,529},{7,10,152},{7,10,713},{7,10,1845},{8,10,710},\n{8,10,717},{12,10,639},{140,10,685},{4,0,32},{5,0,215},{6,0,269},{7,0,1782},{7,0\n,1892},{10,0,16},{11,0,822},{11,0,954},{141,0,481},{4,11,273},{5,11,658},{133,11\n,995},{136,0,477},{134,11,72},{135,11,1345},{4,10,520},{5,0,308},{7,0,1088},{135\n,10,575},{133,11,589},{5,0,126},{8,0,297},{9,0,366},{140,0,374},{7,0,1551},{139,\n0,361},{5,11,117},{6,11,514},{6,11,541},{7,11,1164},{7,11,1436},{8,11,220},{8,11\n,648},{10,11,688},{139,11,560},{133,11,686},{4,0,946},{6,0,1807},{8,0,871},{10,0\n,854},{10,0,870},{10,0,888},{10,0,897},{10,0,920},{12,0,722},{12,0,761},{12,0,\n763},{12,0,764},{14,0,454},{14,0,465},{16,0,107},{18,0,167},{18,0,168},{146,0,\n172},{132,0,175},{135,0,1307},{132,0,685},{135,11,1834},{133,0,797},{6,0,745},{6\n,0,858},{134,0,963},{133,0,565},{5,10,397},{6,10,154},{7,10,676},{7,11,196},{8,\n10,443},{8,10,609},{9,10,24},{9,10,325},{10,10,35},{10,11,765},{11,10,535},{11,\n10,672},{11,10,1018},{11,11,347},{11,11,552},{11,11,576},{11,11,790},{12,10,637}\n,{12,11,263},{13,11,246},{13,11,270},{13,11,395},{14,11,74},{14,11,176},{14,11,\n190},{14,11,398},{14,11,412},{15,11,32},{15,11,63},{16,10,30},{16,11,88},{147,11\n,105},{13,11,84},{141,11,122},{4,0,252},{7,0,1068},{10,0,434},{11,0,228},{11,0,\n426},{13,0,231},{18,0,106},{148,0,87},{137,0,826},{4,11,589},{139,11,282},{5,11,\n381},{135,11,1792},{132,0,791},{5,0,231},{5,10,981},{138,0,509},{7,0,601},{9,0,\n277},{9,0,674},{10,0,178},{10,0,418},{10,0,571},{11,0,531},{12,0,113},{12,0,475}\n,{13,0,99},{142,0,428},{4,10,56},{7,10,1791},{7,11,616},{8,10,607},{8,10,651},{\n10,11,413},{11,10,465},{11,10,835},{12,10,337},{141,10,480},{7,0,1591},{144,0,43\n},{9,10,158},{138,10,411},{135,0,1683},{8,0,289},{11,0,45},{12,0,278},{140,0,537\n},{6,11,120},{7,11,1188},{7,11,1710},{8,11,286},{9,11,667},{11,11,592},{139,11,\n730},{136,10,617},{135,0,1120},{135,11,1146},{139,10,563},{4,10,369},{4,11,352},\n{135,11,687},{143,11,38},{4,0,399},{5,0,119},{5,0,494},{7,0,751},{9,0,556},{14,\n11,179},{15,11,151},{150,11,11},{4,11,192},{5,11,49},{6,11,200},{6,11,293},{6,11\n,1696},{135,11,488},{4,0,398},{133,0,660},{6,10,622},{135,0,1030},{135,11,595},{\n141,0,168},{132,11,147},{7,0,973},{10,10,624},{142,10,279},{132,10,363},{132,0,\n642},{133,11,934},{134,0,1615},{7,11,505},{135,11,523},{7,0,594},{7,0,851},{7,0,\n1858},{9,0,411},{9,0,574},{9,0,666},{9,0,737},{10,0,346},{10,0,712},{11,0,246},{\n11,0,432},{11,0,517},{11,0,647},{11,0,679},{11,0,727},{12,0,304},{12,0,305},{12,\n0,323},{12,0,483},{12,0,572},{12,0,593},{12,0,602},{13,0,95},{13,0,101},{13,0,\n171},{13,0,315},{13,0,378},{13,0,425},{13,0,475},{14,0,63},{14,0,380},{14,0,384}\n,{15,0,133},{18,0,112},{148,0,72},{135,0,1093},{132,0,679},{8,0,913},{10,0,903},\n{10,0,915},{10,11,438},{12,0,648},{12,0,649},{14,0,455},{144,0,112},{137,0,203},\n{134,10,292},{134,0,1492},{5,10,177},{6,10,616},{7,0,1374},{7,10,827},{8,0,540},\n{9,10,525},{138,10,656},{135,0,1486},{9,0,714},{138,10,31},{136,0,825},{134,0,\n1511},{132,11,637},{134,0,952},{4,10,161},{133,10,631},{5,0,143},{5,0,769},{6,0,\n1760},{7,0,682},{7,0,1992},{136,0,736},{132,0,700},{134,0,1540},{132,11,777},{9,\n11,867},{138,11,837},{7,0,1557},{135,10,1684},{133,0,860},{6,0,422},{7,0,0},{7,0\n,1544},{9,0,605},{9,10,469},{9,10,709},{11,0,990},{12,0,235},{12,0,453},{12,10,\n512},{13,0,47},{13,0,266},{14,10,65},{145,10,12},{10,10,229},{11,0,807},{11,10,\n73},{139,10,376},{6,11,170},{7,11,1080},{8,11,395},{8,11,487},{11,11,125},{141,\n11,147},{5,0,515},{137,0,131},{7,0,1605},{11,0,962},{146,0,139},{132,0,646},{4,0\n,396},{7,0,728},{9,0,117},{13,0,202},{148,0,51},{4,11,535},{6,0,121},{6,0,124},{\n6,0,357},{6,10,558},{7,0,1138},{7,0,1295},{7,10,651},{8,0,162},{8,0,508},{8,11,\n618},{9,10,0},{10,10,34},{11,0,655},{139,10,1008},{135,11,1245},{138,0,357},{150\n,11,23},{133,0,237},{135,0,1784},{7,10,1832},{138,10,374},{132,0,713},{132,11,46\n},{5,11,811},{6,0,1536},{6,11,1679},{6,11,1714},{7,11,2032},{138,0,348},{11,11,\n182},{142,11,195},{6,0,523},{7,0,738},{7,10,771},{7,10,1731},{9,10,405},{138,10,\n421},{7,11,1458},{9,11,407},{139,11,15},{6,11,34},{7,11,69},{7,11,640},{7,11,\n1089},{8,11,708},{8,11,721},{9,11,363},{9,11,643},{10,11,628},{148,11,98},{133,0\n,434},{135,0,1877},{7,0,571},{138,0,366},{5,10,881},{133,10,885},{9,0,513},{10,0\n,25},{10,0,39},{12,0,122},{140,0,187},{132,0,580},{5,10,142},{134,10,546},{132,\n11,462},{137,0,873},{5,10,466},{11,10,571},{12,10,198},{13,10,283},{14,10,186},{\n15,10,21},{143,10,103},{4,10,185},{5,10,257},{5,10,839},{5,10,936},{7,0,171},{9,\n10,399},{10,10,258},{10,10,395},{10,10,734},{11,10,1014},{12,10,23},{13,10,350},\n{14,10,150},{147,10,6},{134,0,625},{7,0,107},{7,0,838},{8,0,550},{138,0,401},{5,\n11,73},{6,11,23},{134,11,338},{4,0,943},{6,0,1850},{12,0,713},{142,0,434},{7,10,\n404},{7,10,1377},{7,10,1430},{7,10,2017},{8,10,149},{8,10,239},{8,10,512},{8,10,\n793},{8,10,818},{9,10,474},{9,10,595},{10,10,122},{10,10,565},{10,10,649},{10,10\n,783},{11,0,588},{11,0,864},{11,0,936},{11,0,968},{11,10,239},{11,10,295},{11,10\n,447},{11,10,528},{11,10,639},{11,10,800},{12,0,73},{12,0,343},{12,0,394},{12,10\n,25},{12,10,157},{12,10,316},{12,10,390},{12,10,391},{12,10,395},{12,10,478},{12\n,10,503},{12,10,592},{12,10,680},{13,0,275},{13,10,50},{13,10,53},{13,10,132},{\n13,10,198},{13,10,322},{13,10,415},{13,10,511},{14,0,257},{14,10,71},{14,10,395}\n,{15,0,160},{15,10,71},{15,10,136},{17,10,123},{18,10,93},{147,10,58},{133,0,768\n},{11,0,103},{142,0,0},{136,10,712},{132,0,799},{132,0,894},{7,11,725},{8,11,498\n},{139,11,268},{135,11,1798},{135,11,773},{141,11,360},{4,10,377},{152,10,13},{\n135,0,1673},{132,11,583},{134,0,1052},{133,11,220},{140,11,69},{132,11,544},{4,\n10,180},{135,10,1906},{134,0,272},{4,0,441},{134,0,1421},{4,0,9},{5,0,128},{7,0,\n368},{11,0,480},{148,0,3},{5,11,176},{6,11,437},{6,11,564},{11,11,181},{141,11,\n183},{132,10,491},{7,0,1182},{141,11,67},{4,10,171},{6,0,1346},{138,10,234},{4,\n10,586},{7,10,1186},{138,10,631},{136,0,682},{134,0,1004},{15,0,24},{143,11,24},\n{134,0,968},{4,0,2},{6,0,742},{6,0,793},{7,0,545},{7,0,894},{9,10,931},{10,10,\n334},{148,10,71},{136,11,600},{133,10,765},{9,0,769},{140,0,185},{4,11,790},{5,\n11,273},{134,11,394},{7,0,474},{137,0,578},{4,11,135},{6,11,127},{7,11,1185},{7,\n11,1511},{8,11,613},{11,11,5},{12,11,133},{12,11,495},{12,11,586},{14,11,385},{\n15,11,118},{17,11,20},{146,11,98},{133,10,424},{5,0,530},{142,0,113},{6,11,230},\n{7,11,961},{7,11,1085},{136,11,462},{7,11,1954},{137,11,636},{136,10,714},{149,\n11,6},{135,10,685},{9,10,420},{10,10,269},{10,10,285},{10,10,576},{11,10,397},{\n13,10,175},{145,10,90},{132,10,429},{5,0,556},{5,11,162},{136,11,68},{132,11,654\n},{4,11,156},{7,11,998},{7,11,1045},{7,11,1860},{9,11,48},{9,11,692},{11,11,419}\n,{139,11,602},{6,0,1317},{7,11,1276},{8,0,16},{8,11,474},{9,0,825},{9,11,652},{\n140,0,568},{7,10,18},{7,10,699},{7,10,1966},{8,10,752},{9,10,273},{9,10,412},{9,\n10,703},{10,10,71},{10,10,427},{10,10,508},{146,0,97},{7,11,1454},{10,0,703},{\n138,11,703},{4,10,53},{5,10,186},{135,10,752},{134,0,892},{134,0,1571},{8,10,575\n},{10,10,289},{139,10,319},{6,0,186},{137,0,426},{134,0,1101},{132,10,675},{132,\n0,585},{6,0,1870},{137,0,937},{152,11,10},{9,11,197},{10,11,300},{12,11,473},{13\n,11,90},{141,11,405},{4,0,93},{5,0,252},{6,0,229},{7,0,291},{9,0,550},{139,0,644\n},{137,0,749},{6,10,209},{8,10,468},{9,0,162},{9,10,210},{11,10,36},{12,10,28},{\n12,10,630},{13,10,21},{13,10,349},{14,10,7},{145,10,13},{132,0,381},{132,11,606}\n,{4,10,342},{135,10,1179},{7,11,1587},{7,11,1707},{10,11,528},{139,11,504},{12,\n11,39},{13,11,265},{141,11,439},{4,10,928},{133,10,910},{7,10,1838},{7,11,1978},\n{136,11,676},{6,0,762},{6,0,796},{134,0,956},{4,10,318},{4,10,496},{7,10,856},{\n139,10,654},{137,11,242},{4,11,361},{133,11,315},{132,11,461},{132,11,472},{132,\n0,857},{5,0,21},{6,0,77},{6,0,157},{7,0,974},{7,0,1301},{7,0,1339},{7,0,1490},{7\n,0,1873},{7,10,915},{8,10,247},{9,0,628},{147,10,0},{4,10,202},{5,10,382},{6,10,\n454},{7,10,936},{7,10,1803},{8,10,758},{9,10,375},{9,10,895},{10,10,743},{10,10,\n792},{11,10,978},{11,10,1012},{142,10,109},{7,11,617},{10,11,498},{11,11,501},{\n12,11,16},{140,11,150},{7,10,1150},{7,10,1425},{7,10,1453},{10,11,747},{140,10,\n513},{133,11,155},{11,0,919},{141,0,409},{138,10,791},{10,0,633},{139,11,729},{7\n,11,163},{8,11,319},{9,11,402},{10,11,24},{10,11,681},{11,11,200},{11,11,567},{\n12,11,253},{12,11,410},{142,11,219},{5,11,475},{7,11,1780},{9,11,230},{11,11,297\n},{11,11,558},{14,11,322},{147,11,76},{6,10,445},{7,0,332},{137,10,909},{135,11,\n1956},{136,11,274},{134,10,578},{135,0,1489},{135,11,1848},{5,11,944},{134,11,\n1769},{132,11,144},{136,10,766},{4,0,832},{135,10,541},{8,0,398},{9,0,681},{139,\n0,632},{136,0,645},{9,0,791},{10,0,93},{16,0,13},{17,0,23},{18,0,135},{19,0,12},\n{20,0,1},{20,0,12},{148,0,14},{6,11,247},{137,11,555},{134,0,20},{132,0,800},{\n135,0,1841},{139,10,983},{137,10,768},{132,10,584},{141,11,51},{4,11,620},{6,0,\n1993},{138,11,280},{136,0,769},{7,11,1810},{11,0,290},{11,0,665},{11,11,866},{12\n,11,103},{13,11,495},{17,11,67},{147,11,74},{134,0,1426},{139,0,60},{4,10,326},{\n135,10,1770},{4,10,226},{7,0,1874},{137,0,641},{5,10,426},{6,0,644},{8,10,30},{9\n,10,2},{11,10,549},{147,10,122},{5,11,428},{138,11,442},{135,11,1871},{135,0,\n1757},{147,10,117},{135,0,937},{135,0,1652},{6,0,654},{134,0,1476},{133,11,99},{\n135,0,527},{132,10,345},{4,10,385},{4,11,397},{7,10,265},{135,10,587},{4,0,579},\n{5,0,226},{5,0,323},{135,0,960},{134,0,1486},{8,11,502},{144,11,9},{4,10,347},{5\n,10,423},{5,10,996},{135,10,1329},{7,11,727},{146,11,73},{4,11,485},{7,10,1259},\n{7,11,353},{7,11,1523},{9,10,125},{139,10,65},{5,10,136},{6,0,325},{6,11,366},{7\n,11,1384},{7,11,1601},{136,10,644},{138,11,160},{6,0,1345},{137,11,282},{18,0,91\n},{147,0,70},{136,0,404},{4,11,157},{133,11,471},{133,0,973},{6,0,135},{135,0,\n1176},{8,11,116},{11,11,551},{142,11,159},{4,0,549},{4,10,433},{133,10,719},{136\n,0,976},{5,11,160},{7,11,363},{7,11,589},{10,11,170},{141,11,55},{144,0,21},{144\n,0,51},{135,0,314},{135,10,1363},{4,11,108},{7,11,405},{10,11,491},{139,11,498},\n{146,0,4},{4,10,555},{8,10,536},{10,10,288},{139,10,1005},{135,11,1005},{6,0,281\n},{7,0,6},{8,0,282},{8,0,480},{8,0,499},{9,0,198},{10,0,143},{10,0,169},{10,0,\n211},{10,0,417},{10,0,574},{11,0,147},{11,0,395},{12,0,75},{12,0,407},{12,0,608}\n,{13,0,500},{142,0,251},{6,0,1093},{6,0,1405},{9,10,370},{138,10,90},{4,11,926},\n{133,11,983},{135,0,1776},{134,0,1528},{132,0,419},{132,11,538},{6,11,294},{7,11\n,1267},{136,11,624},{135,11,1772},{138,11,301},{4,10,257},{135,10,2031},{4,0,138\n},{7,0,1012},{7,0,1280},{7,10,1768},{137,0,76},{132,11,757},{5,0,29},{140,0,638}\n,{7,11,655},{135,11,1844},{6,11,257},{7,0,1418},{135,11,1522},{8,11,469},{138,11\n,47},{142,11,278},{6,10,83},{6,10,1733},{135,10,1389},{11,11,204},{11,11,243},{\n140,11,293},{135,11,1875},{6,0,1710},{135,0,2038},{137,11,299},{4,0,17},{5,0,23}\n,{7,0,995},{11,0,383},{11,0,437},{12,0,460},{140,0,532},{133,0,862},{137,10,696}\n,{6,0,592},{138,0,946},{138,11,599},{7,10,1718},{9,10,95},{9,10,274},{10,10,279}\n,{10,10,317},{10,10,420},{11,10,303},{11,10,808},{12,10,134},{12,10,367},{13,10,\n149},{13,10,347},{14,10,349},{14,10,406},{18,10,22},{18,10,89},{18,10,122},{147,\n10,47},{8,0,70},{12,0,171},{141,0,272},{133,10,26},{132,10,550},{137,0,812},{10,\n0,233},{139,0,76},{134,0,988},{134,0,442},{136,10,822},{4,10,902},{5,10,809},{6,\n10,122},{135,0,896},{5,11,150},{7,11,106},{8,11,603},{9,11,593},{9,11,634},{10,\n11,44},{10,11,173},{11,11,462},{11,11,515},{13,11,216},{13,11,288},{142,11,400},\n{136,0,483},{135,10,262},{5,10,620},{134,0,1709},{4,10,34},{5,10,574},{7,10,279}\n,{7,10,1624},{136,10,601},{137,10,170},{147,0,119},{12,11,108},{141,11,291},{11,\n0,69},{12,0,105},{12,0,117},{13,0,213},{14,0,13},{14,0,62},{14,0,177},{14,0,421}\n,{15,0,19},{146,0,141},{137,0,309},{11,11,278},{142,11,73},{7,0,608},{7,0,976},{\n9,0,146},{10,0,206},{10,0,596},{13,0,218},{142,0,153},{133,10,332},{6,10,261},{8\n,10,182},{139,10,943},{4,11,493},{144,11,55},{134,10,1721},{132,0,768},{4,10,933\n},{133,10,880},{7,11,555},{7,11,1316},{7,11,1412},{7,11,1839},{9,11,192},{9,11,\n589},{11,11,241},{11,11,676},{11,11,811},{11,11,891},{12,11,140},{12,11,346},{12\n,11,479},{13,11,30},{13,11,49},{13,11,381},{14,11,188},{15,11,150},{16,11,76},{\n18,11,30},{148,11,52},{4,0,518},{135,0,1136},{6,11,568},{7,11,112},{7,11,1804},{\n8,11,362},{8,11,410},{8,11,830},{9,11,514},{11,11,649},{142,11,157},{135,11,673}\n,{8,0,689},{137,0,863},{4,0,18},{4,11,625},{7,0,145},{7,0,444},{7,0,1278},{8,0,\n49},{8,0,400},{9,0,71},{9,0,250},{10,0,459},{12,0,160},{144,0,24},{140,0,1020},{\n4,0,997},{6,0,1946},{6,0,1984},{134,0,1998},{6,11,16},{6,11,158},{7,11,43},{7,11\n,129},{7,11,181},{8,11,276},{8,11,377},{10,11,523},{11,11,816},{12,11,455},{13,\n11,303},{142,11,135},{133,10,812},{134,0,658},{4,11,1},{7,11,1143},{7,11,1463},{\n8,11,61},{9,11,207},{9,11,390},{9,11,467},{139,11,836},{150,11,26},{140,0,106},{\n4,10,137},{6,0,1827},{7,10,1178},{7,10,1520},{7,11,1319},{10,0,931},{18,0,166},{\n148,0,114},{133,0,1010},{4,11,723},{5,11,895},{7,11,1031},{8,11,199},{8,11,340},\n{9,11,153},{9,11,215},{10,11,21},{10,11,59},{10,11,80},{10,11,224},{11,11,229},{\n11,11,652},{12,11,192},{13,11,146},{142,11,91},{132,11,295},{6,11,619},{7,11,898\n},{7,11,1092},{8,11,485},{18,11,28},{147,11,116},{137,11,51},{6,10,1661},{7,10,\n1975},{7,10,2009},{135,10,2011},{5,11,309},{140,11,211},{5,0,87},{7,0,313},{7,0,\n1103},{10,0,208},{10,0,582},{11,0,389},{11,0,813},{12,0,385},{13,0,286},{14,0,\n124},{146,0,108},{5,11,125},{8,11,77},{138,11,15},{132,0,267},{133,0,703},{137,\n11,155},{133,11,439},{11,11,164},{140,11,76},{5,10,89},{7,10,1915},{9,0,496},{9,\n10,185},{9,10,235},{10,10,64},{10,10,270},{10,10,403},{10,10,469},{10,10,529},{\n10,10,590},{11,10,140},{11,10,860},{13,10,1},{13,10,422},{14,10,341},{14,10,364}\n,{17,10,93},{18,10,113},{19,10,97},{147,10,113},{133,10,695},{135,0,1121},{5,10,\n6},{6,10,183},{7,10,680},{7,10,978},{7,10,1013},{7,10,1055},{12,10,230},{13,10,\n172},{146,10,29},{4,11,8},{7,11,1152},{7,11,1153},{7,11,1715},{9,11,374},{10,11,\n478},{139,11,648},{135,11,1099},{6,10,29},{139,10,63},{4,0,561},{10,0,249},{139,\n0,209},{132,0,760},{7,11,799},{138,11,511},{136,11,87},{9,0,154},{140,0,485},{\n136,0,255},{132,0,323},{140,0,419},{132,10,311},{134,10,1740},{4,0,368},{135,0,\n641},{7,10,170},{8,10,90},{8,10,177},{8,10,415},{11,10,714},{142,10,281},{4,11,\n69},{5,11,122},{9,11,656},{138,11,464},{5,11,849},{134,11,1633},{8,0,522},{142,0\n,328},{11,10,91},{13,10,129},{15,10,101},{145,10,125},{4,10,494},{6,10,74},{7,0,\n562},{7,10,44},{8,0,551},{11,11,499},{12,10,17},{15,10,5},{148,10,11},{4,10,276}\n,{133,10,296},{9,0,92},{147,0,91},{4,10,7},{5,10,90},{5,10,158},{6,10,542},{7,10\n,221},{7,10,1574},{9,10,490},{10,10,540},{11,10,443},{139,10,757},{6,0,525},{6,0\n,1976},{8,0,806},{9,0,876},{140,0,284},{5,11,859},{7,10,588},{7,11,1160},{8,11,\n107},{9,10,175},{9,11,291},{9,11,439},{10,10,530},{10,11,663},{11,11,609},{140,\n11,197},{7,11,168},{13,11,196},{141,11,237},{139,0,958},{133,0,594},{135,10,580}\n,{7,10,88},{136,10,627},{5,10,872},{6,0,479},{6,0,562},{6,10,57},{7,0,1060},{7,\n10,471},{9,10,447},{9,10,454},{141,0,6},{136,11,413},{145,11,19},{4,11,117},{6,\n11,372},{7,11,1905},{142,11,323},{4,11,722},{139,11,471},{5,10,31},{6,10,614},{\n145,0,61},{8,10,330},{140,10,477},{7,10,1200},{138,10,460},{6,10,424},{135,10,\n1866},{6,0,1641},{136,0,820},{6,0,1556},{134,0,1618},{9,11,5},{12,11,216},{12,11\n,294},{12,11,298},{12,11,400},{12,11,518},{13,11,229},{143,11,139},{15,11,155},{\n144,11,79},{4,0,302},{135,0,1766},{5,10,13},{134,10,142},{6,0,148},{7,0,1313},{7\n,10,116},{8,10,322},{8,10,755},{9,10,548},{10,10,714},{11,10,884},{141,10,324},{\n137,0,676},{9,11,88},{139,11,270},{5,11,12},{7,11,375},{137,11,438},{134,0,1674}\n,{7,10,1472},{135,10,1554},{7,10,1071},{7,10,1541},{7,10,1767},{7,10,1806},{11,0\n,178},{11,10,162},{11,10,242},{12,10,605},{15,10,26},{144,10,44},{6,0,389},{7,0,\n149},{9,0,142},{138,0,94},{140,11,71},{145,10,115},{6,0,8},{7,0,1881},{8,0,91},{\n11,11,966},{12,11,287},{13,11,342},{13,11,402},{15,11,110},{143,11,163},{4,11,\n258},{136,11,639},{6,11,22},{7,11,903},{138,11,577},{133,11,681},{135,10,1111},{\n135,11,1286},{8,10,1},{9,0,112},{138,10,326},{5,10,488},{6,10,527},{7,10,489},{7\n,10,1636},{8,10,121},{8,10,144},{8,10,359},{9,10,193},{9,10,241},{9,10,336},{9,\n10,882},{11,10,266},{11,10,372},{11,10,944},{12,10,401},{140,10,641},{4,11,664},\n{133,11,804},{6,0,747},{134,0,1015},{135,0,1746},{9,10,31},{10,10,244},{10,10,\n699},{12,10,149},{141,10,497},{133,10,377},{135,0,24},{5,11,32},{6,0,1352},{145,\n10,101},{7,0,1530},{10,0,158},{13,0,13},{13,0,137},{13,0,258},{14,0,111},{14,0,\n225},{14,0,253},{14,0,304},{14,0,339},{14,0,417},{146,0,33},{4,0,503},{135,0,\n1661},{5,0,130},{6,0,845},{7,0,1314},{9,0,610},{10,0,718},{11,0,601},{11,0,819},\n{11,0,946},{140,0,536},{10,0,149},{11,0,280},{142,0,336},{134,0,1401},{135,0,\n1946},{8,0,663},{144,0,8},{134,0,1607},{135,10,2023},{4,11,289},{7,11,629},{7,11\n,1698},{7,11,1711},{140,11,215},{6,11,450},{136,11,109},{10,0,882},{10,0,883},{\n10,0,914},{138,0,928},{133,10,843},{136,11,705},{132,10,554},{133,10,536},{5,0,\n417},{9,10,79},{11,10,625},{145,10,7},{7,11,1238},{142,11,37},{4,0,392},{135,0,\n1597},{4,10,424},{5,0,433},{9,0,633},{139,0,629},{7,10,336},{136,10,785},{134,11\n,355},{6,0,234},{7,0,769},{9,0,18},{138,0,358},{4,10,896},{134,10,1777},{138,11,\n323},{7,0,140},{7,0,1950},{8,0,680},{11,0,817},{147,0,88},{7,0,1222},{138,0,386}\n,{139,11,908},{11,0,249},{12,0,313},{16,0,66},{145,0,26},{134,0,5},{7,10,750},{9\n,10,223},{11,10,27},{11,10,466},{12,10,624},{14,10,265},{146,10,61},{134,11,26},\n{134,0,1216},{5,0,963},{134,0,1773},{4,11,414},{5,11,467},{9,11,654},{10,11,451}\n,{12,11,59},{141,11,375},{135,11,17},{4,10,603},{133,10,661},{4,10,11},{6,10,128\n},{7,10,231},{7,10,1533},{138,10,725},{135,11,955},{7,0,180},{8,0,509},{136,0,\n792},{132,10,476},{132,0,1002},{133,11,538},{135,10,1807},{132,0,931},{7,0,943},\n{11,0,614},{140,0,747},{135,0,1837},{9,10,20},{10,10,324},{10,10,807},{139,10,\n488},{134,0,641},{6,11,280},{10,11,502},{11,11,344},{140,11,38},{5,11,45},{7,11,\n1161},{11,11,448},{11,11,880},{13,11,139},{13,11,407},{15,11,16},{17,11,95},{18,\n11,66},{18,11,88},{18,11,123},{149,11,7},{9,0,280},{138,0,134},{22,0,22},{23,0,5\n},{151,0,29},{136,11,777},{4,0,90},{4,11,410},{5,0,545},{7,0,754},{7,11,521},{9,\n0,186},{10,0,72},{10,0,782},{11,0,577},{11,0,610},{11,0,960},{12,0,354},{12,0,\n362},{140,0,595},{135,11,1778},{5,10,112},{6,10,103},{134,10,150},{138,10,356},{\n132,0,742},{7,0,151},{9,0,329},{139,0,254},{8,0,853},{8,0,881},{8,0,911},{8,0,\n912},{10,0,872},{12,0,741},{12,0,742},{152,0,18},{4,11,573},{136,11,655},{6,0,\n921},{134,0,934},{9,0,187},{10,0,36},{11,0,1016},{17,0,44},{146,0,64},{7,0,833},\n{136,0,517},{4,0,506},{5,0,295},{135,0,1680},{4,10,708},{8,10,15},{9,10,50},{9,\n10,386},{11,10,18},{11,10,529},{140,10,228},{4,10,563},{7,0,251},{7,0,1701},{7,\n10,592},{7,10,637},{7,10,770},{8,0,436},{8,10,463},{9,10,60},{9,10,335},{9,10,\n904},{10,10,73},{11,10,434},{12,10,585},{13,10,331},{18,10,110},{148,10,60},{132\n,10,502},{136,0,584},{6,10,347},{138,10,161},{7,0,987},{7,11,899},{9,0,688},{10,\n0,522},{11,0,788},{12,0,137},{12,0,566},{14,0,9},{14,0,24},{14,0,64},{142,11,325\n},{4,0,214},{5,0,500},{5,10,102},{6,10,284},{7,10,1079},{7,10,1423},{7,10,1702},\n{8,10,470},{9,10,554},{9,10,723},{139,10,333},{7,10,246},{135,10,840},{6,10,10},\n{8,10,571},{9,10,739},{143,10,91},{133,10,626},{146,0,195},{134,0,1775},{7,0,389\n},{7,0,700},{7,0,940},{8,0,514},{9,0,116},{9,0,535},{10,0,118},{11,0,107},{11,0,\n148},{11,0,922},{12,0,254},{12,0,421},{142,0,238},{5,10,18},{6,10,526},{13,10,24\n},{13,10,110},{19,10,5},{147,10,44},{132,0,743},{4,10,309},{5,10,462},{7,10,970}\n,{7,10,1097},{139,0,292},{22,10,30},{150,10,33},{139,11,338},{135,11,1598},{7,0,\n1283},{9,0,227},{11,0,325},{11,0,408},{14,0,180},{146,0,47},{4,0,953},{6,0,1805}\n,{6,0,1814},{6,0,1862},{140,0,774},{6,11,611},{135,11,1733},{135,11,1464},{5,0,\n81},{7,0,146},{7,0,1342},{8,0,53},{8,0,561},{8,0,694},{8,0,754},{9,0,115},{9,0,\n179},{9,0,894},{10,0,462},{10,0,813},{11,0,230},{11,0,657},{11,0,699},{11,0,748}\n,{12,0,119},{12,0,200},{12,0,283},{142,0,273},{5,0,408},{6,0,789},{6,0,877},{6,0\n,1253},{6,0,1413},{137,0,747},{134,10,1704},{135,11,663},{6,0,1910},{6,0,1915},{\n6,0,1923},{9,0,913},{9,0,928},{9,0,950},{9,0,954},{9,0,978},{9,0,993},{12,0,812}\n,{12,0,819},{12,0,831},{12,0,833},{12,0,838},{12,0,909},{12,0,928},{12,0,931},{\n12,0,950},{15,0,186},{15,0,187},{15,0,195},{15,0,196},{15,0,209},{15,0,215},{15,\n0,236},{15,0,241},{15,0,249},{15,0,253},{18,0,180},{18,0,221},{18,0,224},{18,0,\n227},{18,0,229},{149,0,60},{7,0,1826},{135,0,1938},{5,10,86},{7,10,743},{9,10,85\n},{10,10,281},{10,10,432},{11,0,490},{12,10,251},{13,10,118},{14,10,378},{146,0,\n143},{5,10,524},{133,10,744},{141,11,442},{10,10,107},{140,10,436},{135,11,503},\n{134,0,1162},{132,10,927},{7,0,30},{8,0,86},{8,0,315},{8,0,700},{9,0,576},{9,0,\n858},{10,0,414},{11,0,310},{11,0,888},{11,0,904},{12,0,361},{12,10,670},{13,0,\n248},{13,0,371},{14,0,142},{146,10,94},{134,0,721},{4,11,113},{5,11,163},{5,11,\n735},{7,10,1149},{7,11,1009},{9,10,156},{9,11,9},{9,11,771},{12,11,90},{13,11,\n138},{13,11,410},{143,11,128},{138,0,839},{133,10,778},{137,0,617},{133,10,502},\n{8,10,196},{10,10,283},{139,10,406},{6,0,428},{7,0,524},{8,0,169},{8,0,234},{9,0\n,480},{138,0,646},{133,10,855},{134,0,1648},{7,0,1205},{138,0,637},{4,11,935},{5\n,11,823},{135,0,1596},{5,11,269},{7,11,434},{7,11,891},{8,11,339},{9,11,702},{11\n,11,594},{11,11,718},{145,11,100},{7,11,878},{9,11,485},{141,11,264},{4,0,266},{\n6,11,1713},{8,0,4},{9,0,39},{10,0,166},{11,0,918},{12,0,635},{20,0,10},{22,0,27}\n,{22,0,43},{150,0,52},{7,10,1400},{9,10,446},{138,10,45},{135,11,900},{132,0,862\n},{134,0,1554},{135,11,1033},{19,0,16},{147,11,16},{135,11,1208},{7,0,157},{136,\n0,279},{6,0,604},{136,0,391},{13,10,455},{15,10,99},{15,10,129},{144,10,68},{135\n,10,172},{7,0,945},{11,0,713},{139,0,744},{4,0,973},{10,0,877},{10,0,937},{10,0,\n938},{140,0,711},{139,0,1022},{132,10,568},{142,11,143},{4,0,567},{4,10,732},{\n137,0,859},{7,0,1846},{136,0,628},{136,10,733},{133,0,762},{4,10,428},{135,10,\n1789},{7,10,2015},{10,0,784},{12,10,665},{141,0,191},{133,0,298},{7,0,633},{7,0,\n905},{7,0,909},{7,0,1538},{9,0,767},{140,0,636},{138,10,806},{132,0,795},{139,0,\n301},{135,0,1970},{5,11,625},{135,11,1617},{135,11,275},{7,11,37},{8,11,425},{8,\n11,693},{9,11,720},{10,11,380},{10,11,638},{11,11,273},{11,11,307},{11,11,473},{\n12,11,61},{143,11,43},{135,11,198},{134,0,1236},{7,0,369},{12,0,644},{12,0,645},\n{144,0,90},{19,0,15},{149,0,27},{6,0,71},{6,10,1623},{6,10,1681},{7,0,845},{8,0,\n160},{137,0,318},{134,0,1447},{134,0,1255},{138,0,735},{4,11,168},{136,0,76},{6,\n10,1748},{8,10,715},{9,10,802},{10,10,46},{10,10,819},{13,10,308},{14,10,351},{\n14,10,363},{146,10,67},{135,11,91},{4,10,63},{5,10,347},{134,0,474},{133,10,749}\n,{138,0,841},{133,10,366},{4,11,225},{134,0,836},{135,0,1622},{135,10,89},{140,0\n,735},{134,0,1601},{138,11,145},{6,0,1390},{137,0,804},{142,0,394},{6,11,15},{7,\n11,70},{10,11,240},{147,11,93},{6,0,96},{135,0,1426},{4,0,651},{133,0,289},{7,10\n,977},{7,11,956},{7,11,1157},{7,11,1506},{7,11,1606},{7,11,1615},{7,11,1619},{7,\n11,1736},{7,11,1775},{8,11,590},{9,11,324},{9,11,736},{9,11,774},{9,11,776},{9,\n11,784},{10,11,567},{10,11,708},{11,11,518},{11,11,613},{11,11,695},{11,11,716},\n{11,11,739},{11,11,770},{11,11,771},{11,11,848},{11,11,857},{11,11,931},{11,11,\n947},{12,11,326},{12,11,387},{12,11,484},{12,11,528},{12,11,552},{12,11,613},{13\n,11,189},{13,11,256},{13,11,340},{13,11,432},{13,11,436},{13,11,440},{13,11,454}\n,{14,11,174},{14,11,220},{14,11,284},{14,11,390},{145,11,121},{7,0,688},{8,0,35}\n,{9,0,511},{10,0,767},{147,0,118},{134,0,667},{4,0,513},{5,10,824},{133,10,941},\n{7,10,440},{8,10,230},{139,10,106},{134,0,2034},{135,11,1399},{143,11,66},{135,\n11,1529},{4,11,145},{6,11,176},{7,11,395},{9,11,562},{144,11,28},{132,11,501},{\n132,0,704},{134,0,1524},{6,11,464},{135,0,1078},{6,11,509},{10,11,82},{20,11,91}\n,{151,11,13},{4,0,720},{133,0,306},{133,0,431},{4,10,914},{5,10,800},{5,10,852},\n{135,0,1196},{135,11,1189},{10,0,54},{141,10,115},{7,10,564},{142,10,168},{4,10,\n918},{5,0,464},{5,10,876},{6,0,236},{7,0,696},{7,0,914},{7,0,1108},{7,0,1448},{9\n,0,15},{9,0,564},{10,0,14},{12,0,565},{13,0,449},{14,0,53},{15,0,13},{16,0,64},{\n145,0,41},{6,0,1418},{134,10,1764},{4,10,92},{133,10,274},{134,0,907},{4,11,114}\n,{8,10,501},{9,11,492},{13,11,462},{142,11,215},{4,11,77},{5,11,361},{6,11,139},\n{6,11,401},{6,11,404},{7,11,413},{7,11,715},{7,11,1716},{11,11,279},{12,11,179},\n{12,11,258},{13,11,244},{142,11,358},{6,0,1767},{12,0,194},{145,0,107},{134,11,\n1717},{5,10,743},{142,11,329},{4,10,49},{7,10,280},{135,10,1633},{5,0,840},{7,11\n,1061},{8,11,82},{11,11,250},{12,11,420},{141,11,184},{135,11,724},{134,0,900},{\n136,10,47},{134,0,1436},{144,11,0},{5,10,272},{5,10,908},{5,10,942},{6,0,675},{7\n,0,1008},{7,0,1560},{8,10,197},{9,0,642},{9,10,47},{11,0,236},{11,10,538},{11,10\n,742},{142,0,193},{4,0,68},{5,0,628},{5,0,634},{6,0,386},{7,0,794},{8,0,273},{9,\n0,563},{10,0,105},{10,0,171},{11,0,94},{139,0,354},{135,10,1911},{137,10,891},{4\n,0,95},{6,0,1297},{6,0,1604},{7,0,416},{139,0,830},{6,11,513},{135,11,1052},{7,0\n,731},{13,0,20},{143,0,11},{137,11,899},{10,0,850},{140,0,697},{4,0,662},{7,11,\n1417},{12,11,382},{17,11,48},{152,11,12},{133,0,736},{132,0,861},{4,10,407},{132\n,10,560},{141,10,490},{6,11,545},{7,11,565},{7,11,1669},{10,11,114},{11,11,642},\n{140,11,618},{6,0,871},{134,0,1000},{5,0,864},{5,11,5},{10,0,648},{11,0,671},{\n143,0,46},{133,0,928},{4,10,475},{11,0,90},{11,10,35},{13,0,7},{13,10,71},{13,10\n,177},{142,10,422},{136,0,332},{135,11,192},{134,0,1055},{136,11,763},{11,0,986}\n,{140,0,682},{7,0,76},{8,0,44},{9,0,884},{10,0,580},{11,0,399},{11,0,894},{143,0\n,122},{135,11,1237},{135,10,636},{6,10,222},{7,10,1620},{8,10,409},{9,10,693},{\n139,0,300},{4,11,87},{5,11,250},{10,11,601},{13,11,298},{13,11,353},{141,11,376}\n,{5,0,518},{10,0,340},{11,0,175},{149,0,16},{140,0,771},{6,0,1108},{137,0,831},{\n132,0,836},{135,0,1852},{4,0,957},{6,0,1804},{8,0,842},{8,0,843},{8,0,851},{8,0,\n855},{140,0,767},{135,11,814},{4,11,57},{7,11,1195},{7,11,1438},{7,11,1548},{7,\n11,1835},{7,11,1904},{9,11,757},{10,11,604},{139,11,519},{133,10,882},{138,0,246\n},{4,0,934},{5,0,202},{7,11,1897},{8,0,610},{12,11,290},{13,11,80},{13,11,437},{\n145,11,74},{8,0,96},{9,0,36},{10,0,607},{10,0,804},{10,0,832},{11,0,423},{11,0,\n442},{12,0,309},{14,0,199},{15,0,90},{145,0,110},{132,10,426},{6,10,58},{7,0,654\n},{7,10,745},{7,10,1969},{8,0,240},{8,10,675},{9,10,479},{9,10,731},{10,10,330},\n{10,10,593},{10,10,817},{11,10,32},{11,10,133},{11,10,221},{145,10,68},{9,0,13},\n{9,0,398},{9,0,727},{10,0,75},{10,0,184},{10,0,230},{10,0,564},{10,0,569},{11,0,\n973},{12,0,70},{12,0,189},{13,0,57},{141,0,257},{4,11,209},{135,11,902},{7,0,391\n},{137,10,538},{134,0,403},{6,11,303},{7,11,335},{7,11,1437},{7,11,1668},{8,11,\n553},{8,11,652},{8,11,656},{9,11,558},{11,11,743},{149,11,18},{132,11,559},{11,0\n,75},{142,0,267},{6,0,815},{141,11,2},{141,0,366},{137,0,631},{133,11,1017},{5,0\n,345},{135,0,1016},{133,11,709},{134,11,1745},{133,10,566},{6,10,48},{7,0,952},{\n9,10,139},{10,10,399},{11,10,469},{12,10,634},{141,10,223},{133,0,673},{7,11,8},\n{8,11,206},{137,0,850},{6,0,662},{149,0,35},{4,0,287},{133,0,1018},{6,10,114},{7\n,10,1224},{7,10,1556},{136,10,3},{8,10,576},{137,10,267},{4,0,884},{5,0,34},{10,\n0,724},{12,0,444},{13,0,354},{18,0,32},{23,0,24},{23,0,31},{152,0,5},{133,10,933\n},{132,11,776},{138,0,151},{136,0,427},{134,0,382},{132,0,329},{9,0,846},{10,0,\n827},{138,11,33},{7,11,1297},{9,0,279},{10,0,407},{14,0,84},{150,0,18},{136,11,\n406},{132,0,906},{136,0,366},{134,0,843},{134,0,1443},{135,0,1372},{138,0,992},{\n4,0,123},{5,0,605},{7,0,1509},{136,0,36},{132,0,649},{8,11,175},{10,11,168},{138\n,11,573},{133,0,767},{134,0,1018},{135,11,1305},{12,10,30},{13,10,148},{14,10,87\n},{14,10,182},{16,10,42},{148,10,70},{134,11,607},{4,0,273},{5,0,658},{133,0,995\n},{6,0,72},{139,11,174},{7,10,56},{7,10,1989},{8,10,337},{8,10,738},{9,10,600},{\n10,0,483},{12,0,368},{13,10,447},{142,10,92},{5,11,784},{138,10,666},{135,0,1345\n},{139,11,882},{134,0,1293},{133,0,589},{134,0,1988},{5,0,117},{6,0,514},{6,0,\n541},{7,0,1164},{7,0,1436},{8,0,220},{8,0,648},{10,0,688},{139,0,560},{136,0,379\n},{5,0,686},{7,10,866},{135,10,1163},{132,10,328},{9,11,14},{9,11,441},{10,11,\n306},{139,11,9},{4,10,101},{135,10,1171},{5,10,833},{136,10,744},{5,11,161},{7,\n11,839},{135,11,887},{7,0,196},{10,0,765},{11,0,347},{11,0,552},{11,0,790},{12,0\n,263},{13,0,246},{13,0,270},{13,0,395},{14,0,176},{14,0,190},{14,0,398},{14,0,\n412},{15,0,32},{15,0,63},{16,0,88},{147,0,105},{6,10,9},{6,10,397},{7,10,53},{7,\n10,1742},{10,10,632},{11,10,828},{140,10,146},{5,0,381},{135,0,1792},{134,0,1452\n},{135,11,429},{8,0,367},{10,0,760},{14,0,79},{20,0,17},{152,0,0},{7,0,616},{138\n,0,413},{11,10,417},{12,10,223},{140,10,265},{7,11,1611},{13,11,14},{15,11,44},{\n19,11,13},{148,11,76},{135,0,1229},{6,0,120},{7,0,1188},{7,0,1710},{8,0,286},{9,\n0,667},{11,0,592},{139,0,730},{135,11,1814},{135,0,1146},{4,10,186},{5,10,157},{\n8,10,168},{138,10,6},{4,0,352},{135,0,687},{4,0,192},{5,0,49},{6,0,200},{6,0,293\n},{6,0,1696},{135,0,1151},{133,10,875},{5,10,773},{5,10,991},{6,10,1635},{134,10\n,1788},{7,10,111},{136,10,581},{6,0,935},{134,0,1151},{134,0,1050},{132,0,650},{\n132,0,147},{11,0,194},{11,11,194},{12,0,62},{12,0,88},{12,11,62},{140,11,88},{6,\n0,339},{135,0,923},{134,10,1747},{7,11,643},{136,11,236},{133,0,934},{7,10,1364}\n,{7,10,1907},{141,10,158},{132,10,659},{4,10,404},{135,10,675},{7,11,581},{9,11,\n644},{137,11,699},{13,0,211},{14,0,133},{14,0,204},{15,0,64},{15,0,69},{15,0,114\n},{16,0,10},{19,0,23},{19,0,35},{19,0,39},{19,0,51},{19,0,71},{19,0,75},{152,0,\n15},{133,10,391},{5,11,54},{135,11,1513},{5,10,540},{6,10,1697},{7,0,222},{136,0\n,341},{134,10,78},{132,11,744},{136,0,293},{137,11,701},{7,11,930},{10,11,402},{\n10,11,476},{13,11,452},{18,11,55},{147,11,104},{132,0,637},{133,10,460},{8,11,50\n},{137,11,624},{132,11,572},{134,0,1159},{4,10,199},{139,10,34},{134,0,847},{134\n,10,388},{6,11,43},{7,11,38},{8,11,248},{9,11,504},{138,11,513},{4,10,511},{6,10\n,608},{9,0,683},{9,10,333},{10,10,602},{11,10,441},{11,10,723},{11,10,976},{140,\n10,357},{9,0,867},{138,0,837},{6,0,944},{135,11,326},{135,0,1809},{5,10,938},{7,\n11,783},{136,10,707},{133,11,766},{133,11,363},{6,0,170},{7,0,1080},{8,0,395},{8\n,0,487},{141,0,147},{6,11,258},{140,11,409},{4,0,535},{5,11,249},{8,0,618},{148,\n11,82},{6,0,1379},{149,11,15},{135,0,1625},{150,0,23},{5,11,393},{6,11,378},{7,\n11,1981},{9,11,32},{9,11,591},{10,11,685},{10,11,741},{142,11,382},{133,11,788},\n{7,11,1968},{10,11,19},{139,11,911},{7,11,1401},{135,11,1476},{4,11,61},{5,11,58\n},{5,11,171},{5,11,635},{5,11,683},{5,11,700},{6,11,291},{6,11,566},{7,11,1650},\n{11,11,523},{12,11,273},{12,11,303},{15,11,39},{143,11,111},{6,10,469},{7,10,\n1709},{138,10,515},{4,0,778},{134,11,589},{132,0,46},{5,0,811},{6,0,1679},{6,0,\n1714},{135,0,2032},{7,0,1458},{9,0,407},{11,0,15},{12,0,651},{149,0,37},{4,10,\n500},{135,0,938},{6,0,34},{7,0,69},{7,0,1089},{7,0,1281},{8,0,708},{8,0,721},{9,\n0,363},{148,0,98},{10,11,231},{147,11,124},{7,11,726},{152,11,9},{5,10,68},{134,\n10,383},{136,11,583},{4,11,917},{133,11,1005},{11,10,216},{139,10,340},{135,11,\n1675},{8,0,441},{10,0,314},{143,0,3},{132,11,919},{4,10,337},{6,10,353},{7,10,\n1934},{8,10,488},{137,10,429},{7,0,889},{7,10,1795},{8,10,259},{9,10,135},{9,10,\n177},{9,10,860},{10,10,825},{11,10,115},{11,10,370},{11,10,405},{11,10,604},{12,\n10,10},{12,10,667},{12,10,669},{13,10,76},{14,10,310},{15,10,76},{15,10,147},{\n148,10,23},{4,10,15},{4,11,255},{5,10,22},{5,11,302},{6,10,244},{6,11,132},{7,10\n,40},{7,10,200},{7,10,906},{7,10,1199},{7,11,128},{7,11,283},{7,11,1299},{9,10,\n616},{10,10,716},{10,11,52},{10,11,514},{11,10,635},{11,10,801},{11,11,925},{12,\n10,458},{13,11,92},{142,11,309},{132,0,462},{137,11,173},{135,10,1735},{5,10,598\n},{7,10,791},{8,0,525},{8,10,108},{137,10,123},{5,0,73},{6,0,23},{134,0,338},{\n132,0,676},{132,10,683},{7,0,725},{8,0,498},{139,0,268},{12,0,21},{151,0,7},{135\n,0,773},{4,10,155},{135,10,1689},{4,0,164},{5,0,730},{5,10,151},{5,10,741},{6,11\n,210},{7,10,498},{7,10,870},{7,10,1542},{12,10,213},{14,10,36},{14,10,391},{17,\n10,111},{18,10,6},{18,10,46},{18,10,151},{19,10,36},{20,10,32},{20,10,56},{20,10\n,69},{20,10,102},{21,10,4},{22,10,8},{22,10,10},{22,10,14},{150,10,31},{4,10,624\n},{135,10,1752},{4,0,583},{6,11,588},{9,0,936},{15,0,214},{18,0,199},{152,0,26},\n{4,11,284},{6,11,223},{7,0,1462},{139,0,659},{133,0,220},{139,0,803},{132,0,544}\n,{4,10,492},{133,10,451},{16,0,98},{148,0,119},{4,11,218},{7,11,526},{143,11,137\n},{135,10,835},{4,11,270},{5,11,192},{6,11,332},{7,11,1322},{13,10,70},{13,11,9}\n,{14,11,104},{142,11,311},{132,10,539},{140,11,661},{5,0,176},{6,0,437},{6,0,564\n},{11,0,181},{141,0,183},{135,0,1192},{6,10,113},{135,10,436},{136,10,718},{135,\n10,520},{135,0,1878},{140,11,196},{7,11,379},{8,11,481},{137,11,377},{5,11,1003}\n,{6,11,149},{137,11,746},{8,11,262},{9,11,627},{10,11,18},{11,11,214},{11,11,404\n},{11,11,457},{11,11,780},{11,11,849},{11,11,913},{13,11,330},{13,11,401},{142,\n11,200},{149,0,26},{136,11,304},{132,11,142},{135,0,944},{4,0,790},{5,0,273},{\n134,0,394},{134,0,855},{4,0,135},{6,0,127},{7,0,1185},{7,0,1511},{8,0,613},{11,0\n,5},{12,0,336},{12,0,495},{12,0,586},{12,0,660},{12,0,668},{14,0,385},{15,0,118}\n,{17,0,20},{146,0,98},{6,0,230},{9,0,752},{12,10,610},{13,10,431},{16,10,59},{\n146,0,109},{7,0,1954},{135,11,925},{4,11,471},{5,11,51},{6,11,602},{8,11,484},{\n10,11,195},{140,11,159},{132,10,307},{136,11,688},{132,11,697},{7,11,812},{7,11,\n1261},{7,11,1360},{9,11,632},{140,11,352},{5,0,162},{5,10,964},{136,0,68},{4,0,\n654},{136,11,212},{4,0,156},{7,0,998},{7,0,1045},{7,0,1860},{9,0,48},{9,0,692},{\n11,0,419},{139,0,602},{133,11,221},{4,11,373},{5,11,283},{6,11,480},{135,11,609}\n,{142,11,216},{132,0,240},{6,11,192},{9,11,793},{145,11,55},{4,10,75},{5,10,180}\n,{6,10,500},{7,10,58},{7,10,710},{138,10,645},{4,11,132},{5,10,649},{5,11,69},{\n135,11,1242},{6,10,276},{7,10,282},{7,10,879},{7,10,924},{8,10,459},{9,10,599},{\n9,10,754},{11,10,574},{12,10,128},{12,10,494},{13,10,52},{13,10,301},{15,10,30},\n{143,10,132},{132,10,200},{4,11,111},{135,11,302},{9,0,197},{10,0,300},{12,0,473\n},{13,0,90},{141,0,405},{132,11,767},{6,11,42},{7,11,1416},{7,11,1590},{7,11,\n2005},{8,11,131},{8,11,466},{9,11,672},{13,11,252},{148,11,103},{8,0,958},{8,0,\n999},{10,0,963},{138,0,1001},{135,10,1621},{135,0,858},{4,0,606},{137,11,444},{6\n,11,44},{136,11,368},{139,11,172},{4,11,570},{133,11,120},{139,11,624},{6,10,225\n},{7,0,1978},{8,0,676},{137,10,211},{7,0,972},{8,10,687},{139,0,102},{6,11,227},\n{135,11,1589},{8,10,58},{9,10,724},{11,10,809},{13,10,113},{145,10,72},{4,0,361}\n,{133,0,315},{132,0,461},{6,10,345},{135,10,1247},{132,0,472},{8,10,767},{8,10,\n803},{9,10,301},{137,10,903},{135,11,1333},{135,11,477},{7,10,1949},{136,10,674}\n,{6,0,905},{138,0,747},{133,0,155},{134,10,259},{7,0,163},{8,0,319},{9,0,402},{\n10,0,24},{10,0,681},{11,0,200},{12,0,253},{12,0,410},{142,0,219},{5,0,475},{6,11\n,1667},{7,0,1780},{7,11,2036},{9,0,230},{10,11,600},{11,0,297},{11,0,558},{14,0,\n322},{147,0,76},{136,10,254},{6,0,848},{135,0,1956},{6,11,511},{140,11,132},{5,\n11,568},{6,11,138},{135,11,1293},{6,0,631},{137,0,838},{149,0,36},{4,11,565},{8,\n11,23},{136,11,827},{5,0,944},{134,0,1769},{4,0,144},{4,11,922},{5,11,1023},{6,0\n,842},{134,0,1400},{133,10,248},{9,10,800},{10,10,693},{11,10,482},{11,10,734},{\n139,10,789},{7,11,1002},{139,11,145},{4,10,116},{5,10,95},{5,10,445},{7,10,1688}\n,{8,10,29},{9,10,272},{11,10,509},{139,10,915},{14,0,369},{146,0,72},{135,10,\n1641},{132,11,740},{133,10,543},{140,11,116},{5,10,181},{6,0,247},{8,10,41},{137\n,0,555},{133,10,657},{136,0,996},{138,10,709},{7,0,189},{8,10,202},{138,10,536},\n{136,11,402},{4,11,716},{141,11,31},{10,0,280},{138,0,797},{9,10,423},{140,10,89\n},{8,10,113},{9,10,877},{10,10,554},{11,10,83},{12,10,136},{147,10,109},{133,10,\n976},{4,10,206},{135,0,746},{136,0,526},{139,0,345},{136,0,1017},{8,11,152},{9,\n11,53},{9,11,268},{9,11,901},{10,11,518},{10,11,829},{11,11,188},{13,11,74},{14,\n11,46},{15,11,17},{15,11,33},{17,11,40},{18,11,36},{19,11,20},{22,11,1},{152,11,\n2},{133,11,736},{136,11,532},{5,0,428},{138,0,651},{135,11,681},{135,0,1162},{7,\n0,327},{8,10,226},{10,10,537},{11,10,570},{11,10,605},{11,10,799},{11,10,804},{\n12,10,85},{12,10,516},{12,10,623},{12,11,677},{13,0,230},{13,10,361},{14,10,77},\n{14,10,78},{17,0,113},{147,10,110},{4,0,792},{4,10,769},{7,0,1717},{138,0,546},{\n4,11,684},{136,11,384},{132,10,551},{134,0,1203},{9,10,57},{9,10,459},{10,10,425\n},{11,10,119},{12,10,184},{12,10,371},{13,10,358},{145,10,51},{5,0,672},{5,10,\n814},{8,10,10},{9,10,421},{9,10,729},{10,10,609},{139,10,689},{138,0,189},{134,\n10,624},{7,11,110},{7,11,188},{8,11,290},{8,11,591},{9,11,382},{9,11,649},{11,11\n,71},{11,11,155},{11,11,313},{12,11,5},{13,11,325},{142,11,287},{133,0,99},{6,0,\n1053},{135,0,298},{7,11,360},{7,11,425},{9,11,66},{9,11,278},{138,11,644},{4,0,\n397},{136,0,555},{137,10,269},{132,10,528},{4,11,900},{133,11,861},{5,11,254},{6\n,0,1157},{7,11,985},{136,11,73},{7,11,1959},{136,11,683},{12,0,398},{20,0,39},{\n21,0,11},{150,0,41},{4,0,485},{7,0,353},{135,0,1523},{6,0,366},{7,0,1384},{135,0\n,1601},{138,0,787},{137,0,282},{5,10,104},{6,10,173},{135,10,1631},{139,11,146},\n{4,0,157},{133,0,471},{134,0,941},{132,11,725},{7,0,1336},{8,10,138},{8,10,342},\n{9,10,84},{10,10,193},{11,10,883},{140,10,359},{134,11,196},{136,0,116},{133,11,\n831},{134,0,787},{134,10,95},{6,10,406},{10,10,409},{10,10,447},{11,10,44},{140,\n10,100},{5,0,160},{7,0,363},{7,0,589},{10,0,170},{141,0,55},{134,0,1815},{132,0,\n866},{4,11,321},{6,0,889},{6,0,1067},{6,0,1183},{134,11,569},{5,11,848},{134,11,\n66},{4,11,36},{6,10,1636},{7,11,1387},{10,11,205},{11,11,755},{141,11,271},{132,\n0,689},{4,10,282},{7,10,1034},{9,0,820},{11,10,398},{11,10,634},{12,10,1},{12,10\n,79},{12,10,544},{14,10,237},{17,10,10},{146,10,20},{4,0,108},{7,0,804},{139,0,\n498},{132,11,887},{6,0,1119},{135,11,620},{6,11,165},{138,11,388},{5,0,244},{5,\n10,499},{6,10,476},{7,10,600},{7,10,888},{135,10,1096},{140,0,609},{135,0,1005},\n{4,0,412},{133,0,581},{4,11,719},{135,11,155},{7,10,296},{7,10,596},{8,10,560},{\n8,10,586},{9,10,612},{11,10,304},{12,10,46},{13,10,89},{14,10,112},{145,10,122},\n{4,0,895},{133,0,772},{142,11,307},{135,0,1898},{4,0,926},{133,0,983},{4,11,353}\n,{6,11,146},{6,11,1789},{7,11,288},{7,11,990},{7,11,1348},{9,11,665},{9,11,898},\n{11,11,893},{142,11,212},{132,0,538},{133,11,532},{6,0,294},{7,0,1267},{8,0,624}\n,{141,0,496},{4,11,45},{7,0,1325},{135,11,1257},{138,0,301},{7,10,1599},{7,10,\n1723},{8,10,79},{8,10,106},{8,10,190},{8,10,302},{8,10,383},{8,10,713},{9,0,298}\n,{9,10,119},{9,10,233},{9,10,419},{9,10,471},{10,10,181},{10,10,406},{11,10,57},\n{11,10,85},{11,10,120},{11,10,177},{11,10,296},{11,10,382},{11,10,454},{11,10,\n758},{11,10,999},{12,0,291},{12,10,27},{12,10,131},{12,10,245},{12,10,312},{12,\n10,446},{12,10,454},{13,0,276},{13,10,98},{13,10,426},{13,10,508},{14,0,6},{14,\n10,163},{14,10,272},{14,10,277},{14,10,370},{15,10,95},{15,10,138},{15,10,167},{\n17,0,18},{17,10,38},{20,10,96},{149,0,32},{132,0,757},{134,0,1263},{4,0,820},{\n134,10,1759},{133,0,722},{136,11,816},{138,10,372},{145,10,16},{134,0,1039},{4,0\n,991},{134,0,2028},{133,10,258},{7,0,1875},{139,0,124},{6,11,559},{6,11,1691},{\n135,11,586},{5,0,324},{7,0,881},{8,10,134},{9,10,788},{140,10,438},{7,11,1823},{\n139,11,693},{6,0,1348},{134,0,1545},{134,0,911},{132,0,954},{7,10,1948},{7,10,\n2004},{8,0,329},{136,0,414},{5,0,517},{6,10,439},{7,10,780},{135,10,1040},{132,0\n,816},{5,10,1},{6,10,81},{138,10,520},{5,10,482},{8,10,98},{9,0,713},{10,0,222},\n{10,10,700},{10,10,822},{11,10,302},{11,10,778},{12,10,50},{12,10,127},{12,10,\n396},{13,10,62},{13,10,328},{14,10,122},{147,10,72},{137,0,33},{5,10,2},{7,10,\n1494},{136,10,589},{6,10,512},{7,10,797},{8,10,253},{9,10,77},{10,10,1},{10,10,\n129},{10,10,225},{10,11,108},{11,10,118},{11,10,226},{11,10,251},{11,10,430},{11\n,10,701},{11,10,974},{11,10,982},{11,11,116},{12,10,64},{12,10,260},{12,10,488},\n{140,10,690},{134,11,456},{133,11,925},{5,0,150},{7,0,106},{7,0,774},{8,0,603},{\n9,0,593},{9,0,634},{10,0,44},{10,0,173},{11,0,462},{11,0,515},{13,0,216},{13,0,\n288},{142,0,400},{137,10,347},{5,0,748},{134,0,553},{12,0,108},{141,0,291},{4,10\n,12},{7,0,420},{7,10,522},{7,10,809},{8,10,797},{141,10,88},{6,11,193},{7,11,240\n},{7,11,1682},{10,11,51},{10,11,640},{11,11,410},{13,11,82},{14,11,247},{14,11,\n331},{142,11,377},{133,10,528},{135,0,1777},{4,0,493},{144,0,55},{136,11,633},{\n139,0,81},{6,0,980},{136,0,321},{148,10,109},{5,10,266},{9,10,290},{9,10,364},{\n10,10,293},{11,10,606},{142,10,45},{6,0,568},{7,0,112},{7,0,1804},{8,0,362},{8,0\n,410},{8,0,830},{9,0,514},{11,0,649},{142,0,157},{4,0,74},{6,0,510},{6,10,594},{\n9,10,121},{10,10,49},{10,10,412},{139,10,834},{134,0,838},{136,10,748},{132,10,\n466},{132,0,625},{135,11,1443},{4,11,237},{135,11,514},{9,10,378},{141,10,162},{\n6,0,16},{6,0,158},{7,0,43},{7,0,129},{7,0,181},{8,0,276},{8,0,377},{10,0,523},{\n11,0,816},{12,0,455},{13,0,303},{142,0,135},{135,0,281},{4,0,1},{7,0,1143},{7,0,\n1463},{8,0,61},{9,0,207},{9,0,390},{9,0,467},{139,0,836},{6,11,392},{7,11,65},{\n135,11,2019},{132,10,667},{4,0,723},{5,0,895},{7,0,1031},{8,0,199},{8,0,340},{9,\n0,153},{9,0,215},{10,0,21},{10,0,59},{10,0,80},{10,0,224},{10,0,838},{11,0,229},\n{11,0,652},{12,0,192},{13,0,146},{142,0,91},{132,0,295},{137,0,51},{9,11,222},{\n10,11,43},{139,11,900},{5,0,309},{140,0,211},{5,0,125},{8,0,77},{138,0,15},{136,\n11,604},{138,0,789},{4,10,39},{5,0,173},{7,10,1843},{8,10,407},{11,10,144},{140,\n10,523},{138,11,265},{133,0,439},{132,10,510},{7,0,648},{7,0,874},{7,10,1980},{\n10,10,487},{10,10,809},{11,0,164},{12,0,76},{146,0,9},{12,0,111},{13,10,260},{14\n,0,294},{18,10,63},{147,0,45},{133,11,549},{134,10,570},{4,0,8},{7,0,1152},{7,0,\n1153},{7,0,1715},{9,0,374},{10,0,478},{139,0,648},{135,0,1099},{5,0,575},{6,0,\n354},{135,0,701},{7,11,36},{8,11,201},{136,11,605},{4,10,787},{136,11,156},{6,0,\n518},{149,11,13},{140,11,224},{134,0,702},{132,10,516},{5,11,724},{10,11,305},{\n11,11,151},{12,11,33},{12,11,121},{12,11,381},{17,11,3},{17,11,27},{17,11,78},{\n18,11,18},{19,11,54},{149,11,5},{4,11,523},{5,11,638},{8,0,87},{11,10,887},{14,\n10,365},{142,10,375},{138,0,438},{136,10,821},{135,11,1908},{6,11,242},{7,11,227\n},{7,11,1581},{8,11,104},{9,11,113},{9,11,220},{9,11,427},{10,11,74},{10,11,239}\n,{11,11,579},{11,11,1023},{13,11,4},{13,11,204},{13,11,316},{18,11,95},{148,11,\n86},{4,0,69},{5,0,122},{5,0,849},{6,0,1633},{9,0,656},{138,0,464},{4,10,10},{7,0\n,1802},{139,10,786},{135,11,861},{139,0,499},{7,0,476},{7,0,1592},{138,0,87},{\n133,10,684},{4,0,840},{134,10,27},{142,0,283},{6,0,1620},{7,11,1328},{136,11,494\n},{5,0,859},{7,0,1160},{8,0,107},{9,0,291},{9,0,439},{10,0,663},{11,0,609},{140,\n0,197},{7,11,1306},{8,11,505},{9,11,482},{10,11,126},{11,11,225},{12,11,347},{12\n,11,449},{13,11,19},{142,11,218},{5,11,268},{10,11,764},{12,11,120},{13,11,39},{\n145,11,127},{145,10,56},{7,11,1672},{10,11,472},{11,11,189},{143,11,51},{6,10,\n342},{6,10,496},{8,10,275},{137,10,206},{133,0,600},{4,0,117},{6,0,372},{7,0,\n1905},{142,0,323},{4,10,909},{5,10,940},{135,11,1471},{132,10,891},{4,0,722},{\n139,0,471},{4,11,384},{135,11,1022},{132,10,687},{9,0,5},{12,0,216},{12,0,294},{\n12,0,298},{12,0,400},{12,0,518},{13,0,229},{143,0,139},{135,11,1703},{7,11,1602}\n,{10,11,698},{12,11,212},{141,11,307},{6,10,41},{141,10,160},{135,11,1077},{9,11\n,159},{11,11,28},{140,11,603},{4,0,514},{7,0,1304},{138,0,477},{134,0,1774},{9,0\n,88},{139,0,270},{5,0,12},{6,10,1718},{7,0,375},{137,0,438},{132,11,515},{136,10\n,778},{8,11,632},{8,11,697},{137,11,854},{6,0,362},{6,0,997},{146,0,51},{7,0,816\n},{7,0,1241},{9,0,283},{9,0,520},{10,0,213},{10,0,307},{10,0,463},{10,0,671},{10\n,0,746},{11,0,401},{11,0,794},{12,0,517},{18,0,107},{147,0,115},{133,10,115},{\n150,11,28},{4,11,136},{133,11,551},{142,10,314},{132,0,258},{6,0,22},{7,0,903},{\n7,0,1963},{8,0,639},{138,0,577},{5,0,681},{5,10,193},{8,0,782},{12,10,178},{13,0\n,130},{145,0,84},{9,11,17},{138,11,291},{7,11,1287},{9,11,44},{10,11,552},{10,11\n,642},{11,11,839},{12,11,274},{12,11,275},{12,11,372},{13,11,91},{142,11,125},{\n135,10,174},{4,0,664},{5,0,804},{139,0,1013},{134,0,942},{6,0,1349},{6,0,1353},{\n6,0,1450},{7,11,1518},{139,11,694},{4,10,122},{5,10,796},{5,10,952},{6,10,1660},\n{6,10,1671},{8,10,567},{9,10,687},{9,10,742},{10,10,686},{11,0,356},{11,10,682},\n{140,10,281},{5,0,32},{6,11,147},{7,11,886},{9,11,753},{138,11,268},{5,10,179},{\n7,10,1095},{135,10,1213},{4,10,66},{7,10,722},{135,10,904},{135,10,352},{9,11,\n245},{138,11,137},{4,0,289},{5,11,414},{7,0,629},{7,0,1698},{7,0,1711},{140,0,\n215},{6,0,1975},{135,11,1762},{6,0,450},{136,0,109},{141,10,35},{134,11,599},{\n136,0,705},{133,0,664},{134,11,1749},{11,11,402},{12,11,109},{12,11,431},{13,11,\n179},{13,11,206},{14,11,175},{14,11,217},{16,11,3},{148,11,53},{135,0,1238},{134\n,11,1627},{132,11,488},{10,10,592},{10,10,753},{12,10,317},{12,10,355},{12,10,\n465},{12,10,469},{12,10,560},{12,10,578},{141,0,318},{133,10,564},{132,11,83},{\n140,11,676},{6,0,1872},{6,0,1906},{6,0,1907},{9,0,934},{9,0,956},{9,0,960},{9,0,\n996},{12,0,794},{12,0,876},{12,0,880},{12,0,918},{15,0,230},{18,0,234},{18,0,238\n},{21,0,38},{149,0,62},{134,10,556},{134,11,278},{137,0,103},{7,10,544},{8,10,\n719},{138,10,61},{4,10,5},{5,10,498},{8,10,637},{137,10,521},{7,0,777},{12,0,229\n},{12,0,239},{12,11,229},{12,11,239},{15,0,12},{143,11,12},{6,0,26},{7,11,388},{\n7,11,644},{139,11,781},{7,11,229},{8,11,59},{9,11,190},{9,11,257},{10,11,378},{\n140,11,191},{133,10,927},{135,10,1441},{4,10,893},{5,10,780},{133,10,893},{4,0,\n414},{5,0,467},{9,0,654},{10,0,451},{12,0,59},{141,0,375},{142,0,173},{135,0,17}\n,{5,10,238},{135,0,1350},{135,0,955},{4,0,960},{10,0,887},{12,0,753},{18,0,161},\n{18,0,162},{152,0,19},{136,11,344},{6,10,1729},{137,11,288},{132,11,660},{4,0,\n217},{4,10,60},{5,0,710},{7,0,760},{7,0,1926},{7,10,1800},{8,10,314},{9,0,428},{\n9,0,708},{9,10,700},{10,0,254},{10,0,296},{10,0,720},{11,0,109},{11,0,255},{11,\n10,487},{12,0,165},{12,0,315},{13,0,107},{13,0,203},{14,0,54},{14,0,99},{14,0,\n114},{14,0,388},{16,0,85},{17,0,9},{17,0,33},{20,0,25},{20,0,28},{20,0,29},{21,0\n,9},{21,0,10},{21,0,34},{150,0,17},{7,11,1035},{138,11,737},{7,11,690},{9,11,217\n},{9,11,587},{140,11,521},{6,0,919},{7,11,706},{7,11,1058},{138,11,538},{7,10,\n1853},{138,10,437},{136,10,419},{6,0,280},{10,0,502},{11,0,344},{140,0,38},{5,0,\n45},{7,0,1161},{11,0,448},{11,0,880},{13,0,139},{13,0,407},{15,0,16},{17,0,95},{\n18,0,66},{18,0,88},{18,0,123},{149,0,7},{11,11,92},{11,11,196},{11,11,409},{11,\n11,450},{11,11,666},{11,11,777},{12,11,262},{13,11,385},{13,11,393},{15,11,115},\n{16,11,45},{145,11,82},{136,0,777},{134,11,1744},{4,0,410},{5,10,828},{135,0,521\n},{134,0,673},{7,0,1110},{7,0,1778},{7,10,176},{135,10,178},{5,10,806},{7,10,\n1976},{7,11,268},{136,11,569},{4,11,733},{9,11,194},{10,11,92},{11,11,198},{12,\n11,84},{12,11,87},{13,11,128},{144,11,74},{4,10,51},{5,0,341},{6,10,4},{7,0,1129\n},{7,10,591},{7,10,849},{7,10,951},{7,10,1613},{7,10,1760},{7,10,1988},{9,10,434\n},{10,10,754},{11,0,414},{11,10,25},{139,10,37},{133,10,902},{135,10,928},{135,0\n,787},{132,0,436},{134,10,270},{7,0,1587},{135,0,1707},{6,0,377},{7,0,1025},{9,0\n,613},{145,0,104},{7,11,982},{7,11,1361},{10,11,32},{143,11,56},{139,0,96},{132,\n0,451},{132,10,416},{142,10,372},{5,10,152},{5,10,197},{7,10,340},{7,10,867},{7,\n11,306},{10,10,548},{10,10,581},{11,10,6},{12,10,3},{12,10,19},{14,10,110},{142,\n10,289},{134,0,680},{134,11,609},{7,0,483},{7,10,190},{8,10,28},{8,10,141},{8,10\n,444},{8,10,811},{9,10,468},{11,10,334},{12,10,24},{12,10,386},{140,10,576},{5,\n10,757},{138,0,916},{5,10,721},{135,10,1553},{133,11,178},{134,0,937},{132,10,\n898},{133,0,739},{147,0,82},{135,0,663},{146,0,128},{5,10,277},{141,10,247},{134\n,0,1087},{132,10,435},{6,11,381},{7,11,645},{7,11,694},{136,11,546},{7,0,503},{\n135,0,1885},{6,0,1965},{8,0,925},{138,0,955},{4,0,113},{5,0,163},{5,0,735},{7,0,\n1009},{9,0,9},{9,0,771},{12,0,90},{13,0,138},{13,0,410},{143,0,128},{4,0,324},{\n138,0,104},{5,10,265},{6,10,212},{135,0,460},{133,11,105},{7,11,261},{7,11,1107}\n,{7,11,1115},{7,11,1354},{7,11,1588},{7,11,1705},{7,11,1902},{9,11,465},{10,11,\n248},{10,11,349},{10,11,647},{11,11,527},{11,11,660},{11,11,669},{12,11,529},{\n141,11,305},{5,11,438},{9,11,694},{12,11,627},{141,11,210},{152,11,11},{4,0,935}\n,{133,0,823},{132,10,702},{5,0,269},{5,10,808},{7,0,434},{7,0,891},{7,10,2045},{\n8,0,339},{9,0,702},{11,0,594},{11,0,718},{145,0,100},{7,0,1014},{9,0,485},{141,0\n,264},{134,0,1713},{7,0,1810},{11,0,866},{12,0,103},{12,11,233},{141,0,495},{4,0\n,423},{10,0,949},{138,0,1013},{135,0,900},{8,11,25},{138,11,826},{5,10,166},{8,\n10,739},{140,10,511},{134,0,2018},{7,11,1270},{139,11,612},{4,10,119},{5,10,170}\n,{5,10,447},{7,10,1708},{7,10,1889},{9,10,357},{9,10,719},{12,10,486},{140,10,\n596},{12,0,574},{140,11,574},{132,11,308},{6,0,964},{6,0,1206},{134,0,1302},{4,\n10,450},{135,10,1158},{135,11,150},{136,11,649},{14,0,213},{148,0,38},{9,11,45},\n{9,11,311},{141,11,42},{134,11,521},{7,10,1375},{7,10,1466},{138,10,331},{132,10\n,754},{5,11,339},{7,11,1442},{14,11,3},{15,11,41},{147,11,66},{136,11,378},{134,\n0,1022},{5,10,850},{136,10,799},{142,0,143},{135,0,2029},{134,11,1628},{8,0,523}\n,{150,0,34},{5,0,625},{135,0,1617},{7,0,275},{7,10,238},{7,10,2033},{8,10,120},{\n8,10,188},{8,10,659},{9,10,598},{10,10,466},{12,10,342},{12,10,588},{13,10,503},\n{14,10,246},{143,10,92},{7,0,37},{8,0,425},{8,0,693},{9,0,720},{10,0,380},{10,0,\n638},{11,0,273},{11,0,473},{12,0,61},{143,0,43},{135,11,829},{135,0,1943},{132,0\n,765},{5,11,486},{135,11,1349},{7,11,1635},{8,11,17},{10,11,217},{138,11,295},{4\n,10,201},{7,10,1744},{8,10,602},{11,10,247},{11,10,826},{145,10,65},{138,11,558}\n,{11,0,551},{142,0,159},{8,10,164},{146,10,62},{139,11,176},{132,0,168},{136,0,\n1010},{134,0,1994},{135,0,91},{138,0,532},{135,10,1243},{135,0,1884},{132,10,907\n},{5,10,100},{10,10,329},{12,10,416},{149,10,29},{134,11,447},{132,10,176},{5,10\n,636},{5,10,998},{7,10,9},{7,10,1508},{8,10,26},{9,10,317},{9,10,358},{10,10,210\n},{10,10,292},{10,10,533},{11,10,555},{12,10,526},{12,10,607},{13,10,263},{13,10\n,459},{142,10,271},{4,11,609},{135,11,756},{6,0,15},{7,0,70},{10,0,240},{147,0,\n93},{4,11,930},{133,11,947},{134,0,1227},{134,0,1534},{133,11,939},{133,11,962},\n{5,11,651},{8,11,170},{9,11,61},{9,11,63},{10,11,23},{10,11,37},{10,11,834},{11,\n11,4},{11,11,187},{11,11,281},{11,11,503},{11,11,677},{12,11,96},{12,11,130},{12\n,11,244},{14,11,5},{14,11,40},{14,11,162},{14,11,202},{146,11,133},{4,11,406},{5\n,11,579},{12,11,492},{150,11,15},{139,0,392},{6,10,610},{10,10,127},{141,10,27},\n{7,0,655},{7,0,1844},{136,10,119},{4,0,145},{6,0,176},{7,0,395},{137,0,562},{132\n,0,501},{140,11,145},{136,0,1019},{134,0,509},{139,0,267},{6,11,17},{7,11,16},{7\n,11,1001},{7,11,1982},{9,11,886},{10,11,489},{10,11,800},{11,11,782},{12,11,320}\n,{13,11,467},{14,11,145},{14,11,387},{143,11,119},{145,11,17},{5,11,458},{134,0,\n1099},{7,11,1983},{8,11,0},{8,11,171},{9,11,120},{9,11,732},{10,11,473},{11,11,\n656},{11,11,998},{18,11,0},{18,11,2},{147,11,21},{12,11,427},{146,11,38},{10,0,\n948},{138,0,968},{7,10,126},{136,10,84},{136,10,790},{4,0,114},{9,0,492},{13,0,\n462},{142,0,215},{6,10,64},{12,10,377},{141,10,309},{4,0,77},{5,0,361},{6,0,139}\n,{6,0,401},{6,0,404},{7,0,413},{7,0,715},{7,0,1716},{11,0,279},{12,0,179},{12,0,\n258},{13,0,244},{142,0,358},{134,0,1717},{7,0,772},{7,0,1061},{7,0,1647},{7,10,\n1104},{8,0,82},{11,0,250},{11,0,607},{11,10,269},{11,10,539},{11,10,627},{11,10,\n706},{11,10,975},{12,0,311},{12,0,420},{12,10,248},{12,10,434},{12,10,600},{12,\n10,622},{13,0,184},{13,0,367},{13,10,297},{13,10,485},{14,10,69},{14,10,409},{\n143,10,108},{135,0,724},{4,11,512},{4,11,519},{133,11,342},{134,0,1133},{145,11,\n29},{11,10,977},{141,10,507},{6,0,841},{6,0,1042},{6,0,1194},{10,0,993},{140,0,\n1021},{6,11,31},{7,11,491},{7,11,530},{8,11,592},{9,10,34},{11,10,484},{11,11,53\n},{11,11,779},{12,11,167},{12,11,411},{14,11,14},{14,11,136},{15,11,72},{16,11,\n17},{144,11,72},{4,0,1021},{5,11,907},{134,0,2037},{6,10,1700},{7,0,373},{7,10,\n293},{7,10,382},{7,10,1026},{7,10,1087},{7,10,2027},{8,0,335},{8,0,596},{8,10,\n252},{8,10,727},{8,10,729},{9,0,488},{9,10,30},{9,10,199},{9,10,231},{9,10,251},\n{9,10,334},{9,10,361},{9,10,712},{10,10,55},{10,10,60},{10,10,232},{10,10,332},{\n10,10,384},{10,10,396},{10,10,504},{10,10,542},{10,10,652},{11,10,20},{11,10,48}\n,{11,10,207},{11,10,291},{11,10,298},{11,10,342},{11,10,365},{11,10,394},{11,10,\n620},{11,10,705},{11,10,1017},{12,10,123},{12,10,340},{12,10,406},{12,10,643},{\n13,10,61},{13,10,269},{13,10,311},{13,10,319},{13,10,486},{14,10,234},{15,10,62}\n,{15,10,85},{16,10,71},{18,10,119},{148,10,105},{150,0,37},{4,11,208},{5,11,106}\n,{6,11,531},{8,11,408},{9,11,188},{138,11,572},{132,0,564},{6,0,513},{135,0,1052\n},{132,0,825},{9,0,899},{140,11,441},{134,0,778},{133,11,379},{7,0,1417},{12,0,\n382},{17,0,48},{152,0,12},{132,11,241},{6,10,379},{7,0,1116},{7,10,270},{8,10,\n176},{8,10,183},{9,10,432},{9,10,661},{12,10,247},{12,10,617},{146,10,125},{5,10\n,792},{133,10,900},{6,0,545},{7,0,565},{7,0,1669},{10,0,114},{11,0,642},{140,0,\n618},{133,0,5},{138,11,7},{132,11,259},{135,0,192},{134,0,701},{136,0,763},{135,\n10,1979},{4,10,901},{133,10,776},{10,0,755},{147,0,29},{133,0,759},{4,11,173},{5\n,11,312},{5,11,512},{135,11,1285},{7,11,1603},{7,11,1691},{9,11,464},{11,11,195}\n,{12,11,279},{12,11,448},{14,11,11},{147,11,102},{7,0,370},{7,0,1007},{7,0,1177}\n,{135,0,1565},{135,0,1237},{4,0,87},{5,0,250},{141,0,298},{4,11,452},{5,11,583},\n{5,11,817},{6,11,433},{7,11,593},{7,11,720},{7,11,1378},{8,11,161},{9,11,284},{\n10,11,313},{139,11,886},{4,11,547},{135,11,1409},{136,11,722},{4,10,37},{5,10,\n334},{135,10,1253},{132,10,508},{12,0,107},{146,0,31},{8,11,420},{139,11,193},{\n135,0,814},{135,11,409},{140,0,991},{4,0,57},{7,0,1195},{7,0,1438},{7,0,1548},{7\n,0,1835},{7,0,1904},{9,0,757},{10,0,604},{139,0,519},{132,0,540},{138,11,308},{\n132,10,533},{136,0,608},{144,11,65},{4,0,1014},{134,0,2029},{4,0,209},{5,11,1002\n},{7,0,902},{136,11,745},{134,0,2030},{6,0,303},{7,0,335},{7,0,1437},{7,0,1668},\n{8,0,553},{8,0,652},{8,0,656},{9,0,558},{11,0,743},{149,0,18},{5,11,575},{6,11,\n354},{135,11,701},{4,11,239},{6,11,477},{7,11,1607},{11,11,68},{139,11,617},{132\n,0,559},{8,0,527},{18,0,60},{147,0,24},{133,10,920},{138,0,511},{133,0,1017},{\n133,0,675},{138,10,391},{7,10,1952},{139,0,156},{138,11,369},{132,11,367},{133,0\n,709},{6,0,698},{134,0,887},{142,10,126},{134,0,1745},{132,10,483},{13,11,299},{\n142,11,75},{133,0,714},{7,0,8},{136,0,206},{138,10,480},{4,11,694},{9,10,495},{\n146,10,104},{7,11,1248},{11,11,621},{139,11,702},{140,11,687},{132,0,776},{139,\n10,1009},{135,0,1272},{134,0,1059},{8,10,653},{13,10,93},{147,10,14},{135,11,213\n},{136,0,406},{133,10,172},{132,0,947},{8,0,175},{10,0,168},{138,0,573},{132,0,\n870},{6,0,1567},{151,11,28},{134,11,472},{5,10,260},{136,11,132},{4,11,751},{11,\n11,390},{140,11,32},{4,11,409},{133,11,78},{6,11,473},{12,0,554},{145,11,105},{\n133,0,784},{8,0,908},{136,11,306},{139,0,882},{6,0,358},{7,0,1393},{7,11,1759},{\n8,0,396},{8,11,396},{10,0,263},{10,11,263},{14,0,154},{14,11,154},{16,0,48},{16,\n11,48},{17,0,8},{145,11,8},{13,11,163},{13,11,180},{18,11,78},{148,11,35},{14,0,\n32},{18,0,85},{20,0,2},{152,0,16},{7,0,228},{8,10,167},{8,10,375},{9,10,82},{9,\n10,561},{10,0,770},{138,10,620},{132,0,845},{9,0,14},{9,0,441},{10,0,306},{139,0\n,9},{8,10,194},{8,10,756},{11,0,966},{12,0,287},{13,0,342},{13,0,402},{15,0,110}\n,{143,0,163},{134,0,1578},{4,0,967},{6,0,1820},{6,0,1847},{140,0,716},{136,0,594\n},{7,0,1428},{7,0,1640},{7,0,1867},{7,11,883},{9,0,169},{9,0,182},{9,0,367},{9,0\n,478},{9,0,506},{9,0,551},{9,0,557},{9,0,648},{9,0,697},{9,0,705},{9,0,725},{9,0\n,787},{9,0,794},{10,0,198},{10,0,214},{10,0,267},{10,0,275},{10,0,456},{10,0,551\n},{10,0,561},{10,0,613},{10,0,627},{10,0,668},{10,0,675},{10,0,691},{10,0,695},{\n10,0,707},{10,0,715},{11,0,183},{11,0,201},{11,0,244},{11,0,262},{11,0,352},{11,\n0,439},{11,0,493},{11,0,572},{11,0,591},{11,0,608},{11,0,611},{11,0,646},{11,0,\n674},{11,0,711},{11,0,751},{11,0,761},{11,0,776},{11,0,785},{11,0,850},{11,0,853\n},{11,0,862},{11,0,865},{11,0,868},{11,0,875},{11,0,898},{11,0,902},{11,0,903},{\n11,0,910},{11,0,932},{11,0,942},{11,0,957},{11,0,967},{11,0,972},{12,0,148},{12,\n0,195},{12,0,220},{12,0,237},{12,0,318},{12,0,339},{12,0,393},{12,0,445},{12,0,\n450},{12,0,474},{12,0,505},{12,0,509},{12,0,533},{12,0,591},{12,0,594},{12,0,597\n},{12,0,621},{12,0,633},{12,0,642},{13,0,59},{13,0,60},{13,0,145},{13,0,239},{13\n,0,250},{13,0,329},{13,0,344},{13,0,365},{13,0,372},{13,0,387},{13,0,403},{13,0,\n414},{13,0,456},{13,0,470},{13,0,478},{13,0,483},{13,0,489},{14,0,55},{14,0,57},\n{14,0,81},{14,0,90},{14,0,148},{14,0,239},{14,0,266},{14,0,321},{14,0,326},{14,0\n,327},{14,0,330},{14,0,347},{14,0,355},{14,0,401},{14,0,404},{14,0,411},{14,0,\n414},{14,0,416},{14,0,420},{15,0,61},{15,0,74},{15,0,87},{15,0,88},{15,0,94},{15\n,0,96},{15,0,116},{15,0,149},{15,0,154},{16,0,50},{16,0,63},{16,0,73},{17,0,2},{\n17,0,66},{17,0,92},{17,0,103},{17,0,112},{17,0,120},{18,0,50},{18,0,54},{18,0,82\n},{18,0,86},{18,0,90},{18,0,111},{18,0,115},{18,0,156},{19,0,40},{19,0,79},{20,0\n,78},{149,0,22},{5,0,161},{135,0,839},{4,0,782},{13,11,293},{142,11,56},{133,11,\n617},{139,11,50},{135,10,22},{145,0,64},{5,10,639},{7,10,1249},{139,10,896},{138\n,0,998},{135,11,2042},{4,11,546},{142,11,233},{6,0,1043},{134,0,1574},{134,0,\n1496},{4,10,102},{7,10,815},{7,10,1699},{139,10,964},{12,0,781},{142,0,461},{4,\n11,313},{133,11,577},{6,0,639},{6,0,1114},{137,0,817},{8,11,184},{141,11,433},{7\n,0,1814},{135,11,935},{10,0,997},{140,0,958},{4,0,812},{137,11,625},{132,10,899}\n,{136,10,795},{5,11,886},{6,11,46},{6,11,1790},{7,11,14},{7,11,732},{7,11,1654},\n{8,11,95},{8,11,327},{8,11,616},{10,11,598},{10,11,769},{11,11,134},{11,11,747},\n{12,11,378},{142,11,97},{136,0,139},{6,10,52},{9,10,104},{9,10,559},{12,10,308},\n{147,10,87},{133,11,1021},{132,10,604},{132,10,301},{136,10,779},{7,0,643},{136,\n0,236},{132,11,153},{134,0,1172},{147,10,32},{133,11,798},{4,11,587},{134,0,1338\n},{6,11,598},{7,11,42},{8,11,695},{10,11,212},{11,11,158},{14,11,196},{145,11,85\n},{135,10,508},{5,11,957},{5,11,1008},{135,11,249},{4,11,129},{135,11,465},{5,0,\n54},{7,11,470},{7,11,1057},{7,11,1201},{9,11,755},{11,11,906},{140,11,527},{7,11\n,908},{146,11,7},{5,11,148},{136,11,450},{144,11,1},{4,0,256},{135,0,1488},{6,10\n,310},{7,10,1849},{8,10,72},{8,10,272},{8,10,431},{9,0,351},{9,10,12},{10,10,563\n},{10,10,630},{10,10,796},{10,10,810},{11,10,367},{11,10,599},{11,10,686},{140,\n10,672},{6,0,1885},{6,0,1898},{6,0,1899},{140,0,955},{4,0,714},{133,0,469},{6,0,\n1270},{134,0,1456},{132,0,744},{6,0,313},{7,10,537},{8,10,64},{9,10,127},{10,10,\n496},{12,10,510},{141,10,384},{4,10,244},{4,11,217},{5,11,710},{7,10,233},{7,11,\n1926},{9,11,428},{9,11,708},{10,11,254},{10,11,296},{10,11,720},{11,11,109},{11,\n11,255},{12,11,165},{12,11,315},{13,11,107},{13,11,203},{14,11,54},{14,11,99},{\n14,11,114},{14,11,388},{16,11,85},{17,11,9},{17,11,33},{20,11,25},{20,11,28},{20\n,11,29},{21,11,9},{21,11,10},{21,11,34},{150,11,17},{138,0,402},{7,0,969},{146,0\n,55},{8,0,50},{137,0,624},{134,0,1355},{132,0,572},{134,10,1650},{10,10,702},{\n139,10,245},{10,0,847},{142,0,445},{6,0,43},{7,0,38},{8,0,248},{138,0,513},{133,\n0,369},{137,10,338},{133,0,766},{133,0,363},{133,10,896},{8,11,392},{11,11,54},{\n13,11,173},{13,11,294},{148,11,7},{134,0,678},{7,11,1230},{136,11,531},{6,0,258}\n,{140,0,409},{5,0,249},{148,0,82},{7,10,1117},{136,10,539},{5,0,393},{6,0,378},{\n7,0,1981},{9,0,32},{9,0,591},{10,0,685},{10,0,741},{142,0,382},{133,0,788},{134,\n0,1281},{134,0,1295},{7,0,1968},{141,0,509},{4,0,61},{5,0,58},{5,0,171},{5,0,683\n},{6,0,291},{6,0,566},{7,0,1650},{11,0,523},{12,0,273},{12,0,303},{15,0,39},{143\n,0,111},{6,0,706},{134,0,1283},{134,0,589},{135,11,1433},{133,11,435},{5,10,4},{\n5,10,810},{6,10,13},{6,10,538},{6,10,1690},{6,10,1726},{7,0,1059},{7,10,1819},{8\n,10,148},{8,10,696},{8,10,791},{12,10,125},{13,0,54},{143,10,9},{135,10,1268},{5\n,11,85},{6,11,419},{7,11,134},{7,11,305},{7,11,361},{7,11,1337},{8,11,71},{140,\n11,519},{137,0,824},{140,11,688},{5,11,691},{7,10,1385},{7,11,345},{9,11,94},{11\n,10,582},{11,10,650},{11,10,901},{11,10,949},{12,10,232},{12,10,236},{12,11,169}\n,{13,10,413},{13,10,501},{146,10,116},{4,0,917},{133,0,1005},{5,11,183},{6,11,\n582},{7,0,1598},{9,11,344},{10,11,679},{140,11,435},{4,10,925},{5,10,803},{8,10,\n698},{138,10,828},{132,0,919},{135,11,511},{139,10,992},{4,0,255},{5,0,302},{6,0\n,132},{7,0,128},{7,0,283},{7,0,1299},{10,0,52},{10,0,514},{11,0,925},{13,0,92},{\n142,0,309},{134,0,1369},{135,10,1847},{134,0,328},{7,11,1993},{136,11,684},{133,\n10,383},{137,0,173},{134,11,583},{134,0,1411},{5,11,704},{8,11,357},{10,11,745},\n{14,11,426},{17,11,94},{19,0,65},{147,11,57},{9,10,660},{138,10,347},{4,11,179},\n{5,11,198},{133,11,697},{7,11,347},{7,11,971},{8,11,181},{138,11,711},{141,0,442\n},{7,10,572},{9,10,592},{11,0,842},{11,0,924},{11,10,680},{12,10,356},{12,10,550\n},{13,0,317},{13,0,370},{13,0,469},{13,0,471},{14,0,397},{18,0,69},{146,0,145},{\n14,11,19},{14,11,28},{144,11,29},{136,0,534},{4,11,243},{5,11,203},{7,11,19},{7,\n11,71},{7,11,113},{10,11,405},{11,11,357},{142,11,240},{6,0,210},{10,0,845},{138\n,0,862},{7,11,1351},{9,11,581},{10,11,639},{11,11,453},{140,11,584},{7,11,1450},\n{139,11,99},{10,0,892},{12,0,719},{144,0,105},{4,0,284},{6,0,223},{134,11,492},{\n5,11,134},{6,11,408},{6,11,495},{135,11,1593},{136,0,529},{137,0,807},{4,0,218},\n{7,0,526},{143,0,137},{6,0,1444},{142,11,4},{132,11,665},{4,0,270},{4,11,248},{5\n,0,192},{6,0,332},{7,0,1322},{7,11,137},{137,11,349},{140,0,661},{7,0,1517},{7,\n10,748},{11,0,597},{11,10,700},{14,0,76},{14,0,335},{148,0,33},{5,11,371},{135,\n11,563},{146,11,57},{133,10,127},{133,0,418},{4,11,374},{7,11,547},{7,11,1700},{\n7,11,1833},{139,11,858},{6,10,198},{140,10,83},{7,11,1812},{13,11,259},{13,11,\n356},{14,11,242},{147,11,114},{5,10,276},{6,10,55},{7,0,379},{7,10,1369},{8,0,\n481},{137,0,377},{138,11,286},{5,0,1003},{6,0,149},{6,10,1752},{136,10,726},{6,\n11,1647},{7,11,1552},{7,11,2010},{8,0,262},{9,0,627},{9,11,494},{9,11,509},{10,0\n,18},{11,0,214},{11,0,404},{11,0,457},{11,0,780},{11,0,913},{13,0,401},{142,0,\n200},{135,0,742},{136,0,304},{132,0,142},{133,10,764},{6,10,309},{7,10,331},{138\n,10,550},{135,10,1062},{6,11,123},{7,10,986},{7,11,214},{9,11,728},{10,11,157},{\n11,11,346},{11,11,662},{143,11,106},{135,10,1573},{7,0,925},{137,0,799},{4,0,471\n},{5,0,51},{6,0,602},{8,0,484},{138,0,195},{136,0,688},{132,0,697},{6,0,1169},{6\n,0,1241},{6,10,194},{7,10,133},{10,10,493},{10,10,570},{139,10,664},{140,0,751},\n{5,10,24},{5,10,569},{6,10,3},{6,10,119},{6,10,143},{6,10,440},{7,0,929},{7,10,\n599},{7,10,1686},{7,10,1854},{8,10,424},{9,10,43},{9,10,584},{9,10,760},{10,0,\n452},{10,10,328},{11,0,878},{11,10,159},{11,10,253},{12,10,487},{12,10,531},{144\n,0,33},{4,11,707},{13,11,106},{18,11,49},{147,11,41},{5,0,221},{5,11,588},{134,\n11,393},{134,0,1437},{6,11,211},{7,11,1690},{11,11,486},{140,11,369},{5,10,14},{\n5,10,892},{6,10,283},{7,10,234},{136,10,537},{4,0,988},{136,0,955},{135,0,1251},\n{4,10,126},{8,10,635},{147,10,34},{4,10,316},{135,10,1561},{137,10,861},{4,10,64\n},{5,10,352},{5,10,720},{6,10,368},{139,10,359},{134,0,192},{4,0,132},{5,0,69},{\n135,0,1242},{7,10,1577},{10,10,304},{10,10,549},{12,10,365},{13,10,220},{13,10,\n240},{142,10,33},{4,0,111},{6,11,219},{135,0,865},{5,11,582},{6,11,1646},{7,11,\n99},{7,11,1962},{7,11,1986},{8,11,515},{8,11,773},{9,11,23},{9,11,491},{12,11,\n620},{14,11,52},{145,11,50},{132,0,767},{7,11,568},{148,11,21},{5,11,851},{6,0,\n42},{7,0,1416},{7,0,2005},{8,0,131},{8,0,466},{9,0,672},{13,0,252},{148,0,103},{\n135,0,1050},{6,10,175},{137,10,289},{5,10,432},{133,10,913},{6,0,44},{136,0,368}\n,{135,11,784},{132,0,570},{133,0,120},{139,10,595},{140,0,29},{6,0,227},{135,0,\n1589},{4,11,98},{7,11,1365},{9,11,422},{9,11,670},{10,11,775},{11,11,210},{13,11\n,26},{13,11,457},{141,11,476},{140,10,80},{5,10,931},{134,10,1698},{133,0,522},{\n134,0,1120},{135,0,1529},{12,0,739},{14,0,448},{142,0,467},{11,10,526},{11,10,\n939},{141,10,290},{5,10,774},{6,10,1637},{6,10,1686},{134,10,1751},{6,0,1667},{\n135,0,2036},{7,10,1167},{11,10,934},{13,10,391},{145,10,76},{137,11,147},{6,10,\n260},{7,10,1484},{11,11,821},{12,11,110},{12,11,153},{18,11,41},{150,11,19},{6,0\n,511},{6,10,573},{140,0,132},{5,0,568},{6,0,138},{135,0,1293},{132,0,1020},{8,0,\n258},{9,0,208},{137,0,359},{4,0,565},{8,0,23},{136,0,827},{134,0,344},{4,0,922},\n{5,0,1023},{13,11,477},{14,11,120},{148,11,61},{134,0,240},{5,11,209},{6,11,30},\n{11,11,56},{139,11,305},{4,10,292},{4,10,736},{5,10,871},{6,0,171},{6,10,1689},{\n7,0,1002},{7,0,1324},{7,10,1944},{9,0,415},{9,10,580},{14,0,230},{146,0,68},{9,\n11,635},{139,11,559},{4,11,150},{5,11,303},{134,11,327},{6,10,63},{135,10,920},{\n133,10,793},{8,11,192},{10,11,78},{10,11,555},{11,11,308},{13,11,359},{147,11,95\n},{135,11,786},{135,11,1712},{136,0,402},{6,0,754},{6,11,1638},{7,11,79},{7,11,\n496},{9,11,138},{10,11,336},{11,11,12},{12,11,412},{12,11,440},{142,11,305},{4,0\n,716},{141,0,31},{133,0,982},{5,10,67},{6,10,62},{6,10,374},{7,10,1391},{8,0,691\n},{136,0,731},{9,10,790},{140,10,47},{139,11,556},{151,11,1},{7,11,204},{7,11,\n415},{8,11,42},{10,11,85},{11,11,33},{11,11,564},{12,11,571},{149,11,1},{7,11,\n610},{7,11,1501},{136,0,888},{4,10,391},{135,10,1169},{5,0,847},{9,0,840},{138,0\n,803},{137,0,823},{134,0,785},{8,0,152},{9,0,53},{9,0,268},{9,0,901},{10,0,518},\n{10,0,829},{11,0,188},{13,0,74},{14,0,46},{15,0,17},{15,0,33},{17,0,40},{18,0,36\n},{19,0,20},{22,0,1},{152,0,2},{4,11,3},{5,11,247},{5,11,644},{7,11,744},{7,11,\n1207},{7,11,1225},{7,11,1909},{146,11,147},{136,0,532},{135,0,681},{132,10,271},\n{140,0,314},{140,0,677},{4,0,684},{136,0,384},{5,11,285},{9,11,67},{13,11,473},{\n143,11,82},{4,10,253},{5,10,544},{7,10,300},{137,10,340},{7,0,110},{7,0,447},{8,\n0,290},{8,0,591},{9,0,382},{9,0,649},{11,0,71},{11,0,155},{11,0,313},{12,0,5},{\n13,0,325},{142,0,287},{134,0,1818},{136,0,1007},{138,0,321},{7,0,360},{7,0,425},\n{9,0,66},{9,0,278},{138,0,644},{133,10,818},{5,0,385},{5,10,541},{6,10,94},{6,10\n,499},{7,10,230},{139,10,321},{4,10,920},{5,10,25},{5,10,790},{6,10,457},{7,10,\n853},{136,10,788},{4,0,900},{133,0,861},{5,0,254},{7,0,985},{136,0,73},{7,0,1959\n},{136,0,683},{134,10,1765},{133,10,822},{132,10,634},{4,11,29},{6,11,532},{7,11\n,1628},{7,11,1648},{9,11,303},{9,11,350},{10,11,433},{11,11,97},{11,11,557},{11,\n11,745},{12,11,289},{12,11,335},{12,11,348},{12,11,606},{13,11,116},{13,11,233},\n{13,11,466},{14,11,181},{14,11,209},{14,11,232},{14,11,236},{14,11,300},{16,11,\n41},{148,11,97},{6,10,36},{7,10,658},{8,10,454},{147,0,86},{135,11,1692},{132,0,\n725},{5,11,501},{7,11,1704},{9,11,553},{11,11,520},{12,11,557},{141,11,249},{134\n,0,196},{133,0,831},{136,0,723},{7,0,1897},{13,0,80},{13,0,437},{145,0,74},{4,0,\n992},{6,0,627},{136,0,994},{135,11,1294},{132,10,104},{5,0,848},{6,0,66},{136,0,\n764},{4,0,36},{7,0,1387},{10,0,205},{139,0,755},{6,0,1046},{134,0,1485},{134,0,\n950},{132,0,887},{14,0,450},{148,0,111},{7,0,620},{7,0,831},{9,10,542},{9,10,566\n},{138,10,728},{6,0,165},{138,0,388},{139,10,263},{4,0,719},{135,0,155},{138,10,\n468},{6,11,453},{144,11,36},{134,11,129},{5,0,533},{7,0,755},{138,0,780},{134,0,\n1465},{4,0,353},{6,0,146},{6,0,1789},{7,0,427},{7,0,990},{7,0,1348},{9,0,665},{9\n,0,898},{11,0,893},{142,0,212},{7,10,87},{142,10,288},{4,0,45},{135,0,1257},{7,\n10,988},{7,10,1939},{9,10,64},{9,10,502},{12,0,7},{12,10,34},{13,10,12},{13,10,\n234},{147,10,77},{4,0,607},{5,11,60},{6,11,504},{7,11,614},{7,11,1155},{140,11,0\n},{135,10,141},{8,11,198},{11,11,29},{140,11,534},{140,0,65},{136,0,816},{132,10\n,619},{139,0,88},{5,10,246},{8,10,189},{9,10,355},{9,10,512},{10,10,124},{10,10,\n453},{11,10,143},{11,10,416},{11,10,859},{141,10,341},{4,11,379},{135,11,1397},{\n4,0,600},{137,0,621},{133,0,367},{134,0,561},{6,0,559},{134,0,1691},{6,0,585},{\n134,11,585},{135,11,1228},{4,11,118},{5,10,678},{6,11,274},{6,11,361},{7,11,75},\n{141,11,441},{135,11,1818},{137,11,841},{5,0,573},{6,0,287},{7,10,862},{7,10,\n1886},{138,10,179},{132,10,517},{140,11,693},{5,11,314},{6,11,221},{7,11,419},{\n10,11,650},{11,11,396},{12,11,156},{13,11,369},{14,11,333},{145,11,47},{140,10,\n540},{136,10,667},{11,10,403},{146,10,83},{5,10,761},{134,0,672},{9,0,157},{10,\n10,131},{140,10,72},{6,11,460},{135,0,714},{134,0,456},{133,0,925},{5,11,682},{\n135,11,1887},{136,11,510},{136,11,475},{133,11,1016},{7,11,602},{8,11,179},{9,0,\n19},{10,11,781},{140,11,126},{6,11,329},{138,11,111},{6,0,822},{134,0,1473},{144\n,11,86},{11,0,113},{139,11,113},{5,11,821},{134,11,1687},{133,10,449},{7,0,463},\n{8,10,103},{145,0,69},{7,10,2028},{138,10,641},{6,0,193},{7,0,240},{7,0,1682},{\n10,0,51},{10,0,640},{11,0,410},{13,0,82},{14,0,247},{14,0,331},{142,0,377},{6,0,\n471},{11,0,411},{142,0,2},{5,11,71},{7,11,1407},{9,11,388},{9,11,704},{10,11,261\n},{10,11,619},{11,11,547},{11,11,619},{143,11,157},{136,0,633},{135,0,1148},{6,0\n,554},{7,0,1392},{7,10,1274},{7,10,1386},{7,11,2008},{9,11,337},{10,11,517},{12,\n0,129},{146,10,87},{6,10,187},{7,0,803},{7,10,1203},{8,0,542},{8,10,380},{14,10,\n117},{149,10,28},{6,10,297},{7,10,793},{139,10,938},{7,10,464},{8,0,438},{11,0,\n363},{11,10,105},{12,10,231},{14,10,386},{15,10,102},{148,10,75},{5,11,16},{6,11\n,86},{6,11,603},{7,11,292},{7,11,561},{8,11,257},{8,11,382},{9,11,721},{9,11,778\n},{11,11,581},{140,11,466},{4,11,486},{5,11,491},{134,0,717},{132,0,875},{132,11\n,72},{6,11,265},{135,11,847},{4,0,237},{135,0,514},{6,0,392},{7,0,65},{135,0,\n2019},{140,11,261},{135,11,922},{137,11,404},{7,10,1010},{11,10,733},{11,10,759}\n,{12,0,563},{13,10,34},{14,0,101},{18,0,129},{146,10,45},{7,10,1656},{9,10,369},\n{10,10,338},{10,10,490},{11,10,154},{11,10,545},{11,10,775},{13,10,77},{141,10,\n274},{4,0,444},{10,0,146},{140,0,9},{139,11,163},{7,0,1260},{135,0,1790},{9,0,\n222},{10,0,43},{139,0,900},{137,11,234},{138,0,971},{137,0,761},{134,0,699},{136\n,11,434},{5,10,20},{6,0,1116},{6,10,298},{6,11,197},{7,0,1366},{7,10,659},{8,11,\n205},{137,10,219},{132,11,490},{11,11,820},{150,11,51},{7,10,1440},{11,10,854},{\n11,10,872},{11,10,921},{12,10,551},{13,10,472},{142,10,367},{140,11,13},{132,0,\n829},{4,10,439},{140,0,242},{136,10,669},{6,0,593},{6,11,452},{7,11,312},{138,11\n,219},{4,11,333},{9,11,176},{12,11,353},{141,11,187},{7,0,36},{8,0,201},{136,0,\n605},{140,0,224},{132,10,233},{134,0,1430},{134,0,1806},{4,0,523},{133,0,638},{6\n,0,1889},{9,0,958},{9,0,971},{9,0,976},{12,0,796},{12,0,799},{12,0,808},{12,0,\n835},{12,0,836},{12,0,914},{12,0,946},{15,0,216},{15,0,232},{18,0,183},{18,0,187\n},{18,0,194},{18,0,212},{18,0,232},{149,0,49},{132,10,482},{6,0,827},{134,0,1434\n},{135,10,346},{134,0,2043},{6,0,242},{7,0,227},{7,0,1581},{8,0,104},{9,0,113},{\n9,0,220},{9,0,427},{10,0,136},{10,0,239},{11,0,579},{11,0,1023},{13,0,4},{13,0,\n204},{13,0,316},{148,0,86},{134,11,1685},{7,0,148},{8,0,284},{141,0,63},{142,0,\n10},{135,11,584},{134,0,1249},{7,0,861},{135,10,334},{5,10,795},{6,10,1741},{137\n,11,70},{132,0,807},{7,11,135},{8,11,7},{8,11,62},{9,11,243},{10,11,658},{10,11,\n697},{11,11,456},{139,11,756},{9,11,395},{138,11,79},{137,11,108},{147,0,94},{\n136,0,494},{135,11,631},{135,10,622},{7,0,1510},{135,10,1750},{4,10,203},{135,10\n,1936},{7,11,406},{7,11,459},{8,11,606},{139,11,726},{7,0,1306},{8,0,505},{9,0,\n482},{10,0,126},{11,0,225},{12,0,347},{12,0,449},{13,0,19},{14,0,218},{142,0,435\n},{5,0,268},{10,0,764},{12,0,120},{13,0,39},{145,0,127},{142,11,68},{11,10,678},\n{140,10,307},{12,11,268},{12,11,640},{142,11,119},{135,10,2044},{133,11,612},{4,\n11,372},{7,11,482},{8,11,158},{9,11,602},{9,11,615},{10,11,245},{10,11,678},{10,\n11,744},{11,11,248},{139,11,806},{7,10,311},{9,10,308},{140,10,255},{4,0,384},{\n135,0,1022},{5,11,854},{135,11,1991},{135,10,1266},{4,10,400},{5,10,267},{135,10\n,232},{135,0,1703},{9,0,159},{11,0,661},{140,0,603},{4,0,964},{9,11,106},{9,11,\n163},{9,11,296},{10,11,167},{10,11,172},{10,11,777},{11,11,16},{14,0,438},{14,0,\n444},{14,0,456},{22,0,60},{150,0,63},{136,0,583},{132,0,515},{8,0,632},{8,0,697}\n,{137,0,854},{5,11,195},{135,11,1685},{6,0,1123},{134,0,1365},{134,11,328},{7,11\n,1997},{8,11,730},{139,11,1006},{4,0,136},{133,0,551},{134,0,1782},{7,0,1287},{9\n,0,44},{10,0,552},{10,0,642},{11,0,839},{12,0,274},{12,0,275},{12,0,372},{13,0,\n91},{142,0,125},{5,11,751},{11,11,797},{140,11,203},{133,0,732},{4,10,100},{7,0,\n679},{7,11,821},{136,0,313},{10,0,361},{142,0,316},{134,0,595},{6,0,147},{7,0,\n886},{9,0,753},{138,0,268},{5,10,362},{5,10,443},{6,10,318},{7,10,1019},{139,10,\n623},{5,10,463},{136,10,296},{4,10,454},{5,11,950},{5,11,994},{134,11,351},{138,\n0,137},{5,10,48},{5,10,404},{6,10,557},{7,10,458},{8,10,597},{10,10,455},{10,10,\n606},{11,10,49},{11,10,548},{12,10,476},{13,10,18},{141,10,450},{133,0,414},{135\n,0,1762},{5,11,421},{135,11,47},{5,10,442},{135,10,1984},{134,0,599},{134,0,1749\n},{134,0,1627},{4,0,488},{132,11,350},{137,11,751},{132,0,83},{140,0,676},{133,\n11,967},{5,10,55},{7,0,1639},{140,10,161},{4,11,473},{7,11,623},{8,11,808},{9,11\n,871},{9,11,893},{11,11,38},{11,11,431},{12,11,112},{12,11,217},{12,11,243},{12,\n11,562},{12,11,683},{13,11,141},{13,11,197},{13,11,227},{13,11,406},{13,11,487},\n{14,11,156},{14,11,203},{14,11,224},{14,11,256},{18,11,58},{150,11,0},{133,10,\n450},{7,11,736},{139,11,264},{134,0,278},{4,11,222},{7,11,286},{136,11,629},{135\n,10,869},{140,0,97},{144,0,14},{134,0,1085},{4,10,213},{7,10,223},{136,10,80},{7\n,0,388},{7,0,644},{139,0,781},{132,0,849},{7,0,229},{8,0,59},{9,0,190},{10,0,378\n},{140,0,191},{7,10,381},{7,10,806},{7,10,820},{8,10,354},{8,10,437},{8,10,787},\n{9,10,657},{10,10,58},{10,10,339},{10,10,749},{11,10,914},{12,10,162},{13,10,75}\n,{14,10,106},{14,10,198},{14,10,320},{14,10,413},{146,10,43},{141,11,306},{136,\n10,747},{134,0,1115},{8,11,146},{16,0,94},{144,0,108},{6,0,700},{6,0,817},{134,0\n,1002},{133,10,692},{4,11,465},{135,11,1663},{134,10,191},{6,0,1414},{135,11,913\n},{132,0,660},{7,0,1035},{138,0,737},{6,10,162},{7,10,1960},{136,10,831},{132,10\n,706},{7,0,690},{9,0,217},{9,0,587},{140,0,521},{138,10,426},{135,10,1235},{6,11\n,82},{7,11,138},{7,11,517},{9,11,673},{139,11,238},{138,0,272},{5,11,495},{7,11,\n834},{9,11,733},{139,11,378},{134,0,1744},{132,0,1011},{7,11,828},{142,11,116},{\n4,0,733},{5,11,559},{9,0,194},{10,0,92},{11,0,198},{12,0,84},{141,0,128},{6,11,\n21},{6,11,1737},{7,11,1444},{8,11,224},{10,0,57},{138,0,277},{4,10,204},{137,10,\n902},{136,10,833},{7,10,366},{9,10,287},{11,0,348},{12,0,99},{12,10,199},{12,10,\n556},{12,10,577},{18,0,1},{18,0,11},{147,0,4},{6,0,1981},{136,0,936},{21,0,33},{\n150,0,40},{5,11,519},{138,11,204},{5,10,356},{135,10,224},{134,0,775},{135,0,306\n},{7,10,630},{9,10,567},{11,10,150},{11,10,444},{141,10,119},{5,0,979},{134,10,\n539},{133,0,611},{4,11,402},{135,11,1679},{5,0,178},{7,11,2},{8,11,323},{136,11,\n479},{5,11,59},{135,11,672},{4,0,1010},{6,0,1969},{138,11,237},{133,11,412},{146\n,11,34},{7,11,1740},{146,11,48},{134,0,664},{139,10,814},{4,11,85},{135,11,549},\n{133,11,94},{133,11,457},{132,0,390},{134,0,1510},{4,10,235},{135,10,255},{4,10,\n194},{5,10,584},{6,10,384},{6,11,11},{7,10,583},{7,11,187},{10,10,761},{11,10,\n760},{139,10,851},{4,11,522},{139,11,802},{135,0,493},{10,11,776},{13,11,345},{\n142,11,425},{146,0,37},{4,11,52},{135,11,661},{134,0,724},{134,0,829},{133,11,\n520},{133,10,562},{4,11,281},{5,11,38},{7,11,194},{7,11,668},{7,11,1893},{137,11\n,397},{5,10,191},{137,10,271},{7,0,1537},{14,0,96},{143,0,73},{4,10,470},{5,0,\n473},{6,10,153},{7,10,1503},{7,10,1923},{10,10,701},{11,0,168},{11,10,132},{11,\n10,227},{11,10,320},{11,10,436},{11,10,525},{11,10,855},{12,10,41},{12,10,286},{\n13,10,103},{13,10,284},{14,10,255},{14,10,262},{15,10,117},{143,10,127},{133,0,\n105},{5,0,438},{9,0,694},{12,0,627},{141,0,210},{133,10,327},{6,10,552},{7,10,\n1754},{137,10,604},{134,0,1256},{152,0,11},{5,11,448},{11,11,98},{139,11,524},{5\n,10,80},{6,10,405},{7,0,1626},{7,10,403},{7,10,1502},{8,10,456},{9,10,487},{9,10\n,853},{9,10,889},{10,10,309},{11,10,721},{11,10,994},{12,10,430},{13,10,165},{14\n,11,16},{146,11,44},{132,0,779},{8,0,25},{138,0,826},{4,10,453},{5,10,887},{6,10\n,535},{8,10,6},{8,10,543},{136,10,826},{137,11,461},{140,11,632},{132,0,308},{\n135,0,741},{132,0,671},{7,0,150},{8,0,649},{136,0,1020},{6,11,336},{8,11,552},{9\n,0,99},{9,11,285},{10,11,99},{139,11,568},{134,0,521},{5,0,339},{14,0,3},{15,0,\n41},{15,0,166},{147,0,66},{6,11,423},{7,11,665},{7,11,1210},{9,11,218},{141,11,\n222},{5,10,101},{5,11,256},{6,0,543},{6,10,88},{7,10,1677},{9,10,100},{10,10,677\n},{14,10,169},{14,10,302},{14,10,313},{15,10,48},{143,10,84},{4,10,310},{7,10,\n708},{7,10,996},{9,10,795},{10,10,390},{10,10,733},{11,10,451},{12,10,249},{14,\n10,115},{14,10,286},{143,10,100},{133,10,587},{13,11,417},{14,11,129},{143,11,15\n},{134,0,1358},{136,11,554},{132,10,498},{7,10,217},{8,10,140},{138,10,610},{135\n,11,989},{135,11,634},{6,0,155},{140,0,234},{135,11,462},{132,11,618},{134,0,\n1628},{132,0,766},{4,11,339},{5,10,905},{135,11,259},{135,0,829},{4,11,759},{141\n,11,169},{4,10,456},{7,0,1445},{7,10,358},{7,10,1637},{8,10,643},{139,10,483},{5\n,0,486},{135,0,1349},{5,11,688},{135,11,712},{7,0,1635},{8,0,17},{10,0,217},{10,\n0,295},{12,0,2},{140,11,2},{138,0,558},{150,10,56},{4,11,278},{5,11,465},{135,11\n,1367},{136,11,482},{133,10,535},{6,0,1362},{6,0,1461},{10,11,274},{10,11,625},{\n139,11,530},{5,0,599},{5,11,336},{6,11,341},{6,11,478},{6,11,1763},{136,11,386},\n{7,10,1748},{137,11,151},{134,0,1376},{133,10,539},{135,11,73},{135,11,1971},{\n139,11,283},{9,0,93},{139,0,474},{6,10,91},{135,10,435},{5,11,396},{6,0,447},{\n134,11,501},{4,10,16},{5,10,316},{5,10,842},{6,10,370},{6,10,1778},{8,10,166},{\n11,10,812},{12,10,206},{12,10,351},{14,10,418},{16,10,15},{16,10,34},{18,10,3},{\n19,10,3},{19,10,7},{20,10,4},{149,10,21},{7,0,577},{7,0,1432},{9,0,475},{9,0,505\n},{9,0,526},{9,0,609},{9,0,689},{9,0,726},{9,0,735},{9,0,738},{10,0,556},{10,0,\n674},{10,0,684},{11,0,89},{11,0,202},{11,0,272},{11,0,380},{11,0,415},{11,0,505}\n,{11,0,537},{11,0,550},{11,0,562},{11,0,640},{11,0,667},{11,0,688},{11,0,847},{\n11,0,927},{11,0,930},{11,0,940},{12,0,144},{12,0,325},{12,0,329},{12,0,389},{12,\n0,403},{12,0,451},{12,0,515},{12,0,604},{12,0,616},{12,0,626},{13,0,66},{13,0,\n131},{13,0,167},{13,0,236},{13,0,368},{13,0,411},{13,0,434},{13,0,453},{13,0,461\n},{13,0,474},{14,0,59},{14,0,60},{14,0,139},{14,0,152},{14,0,276},{14,0,353},{14\n,0,402},{15,0,28},{15,0,81},{15,0,123},{15,0,152},{18,0,136},{148,0,88},{4,11,\n929},{133,11,799},{136,11,46},{142,0,307},{4,0,609},{7,0,756},{9,0,544},{11,0,\n413},{144,0,25},{7,10,619},{10,0,687},{10,10,547},{11,10,122},{140,10,601},{4,0,\n930},{133,0,947},{133,0,939},{142,0,21},{4,11,892},{133,11,770},{133,0,962},{5,0\n,651},{8,0,170},{9,0,61},{9,0,63},{10,0,23},{10,0,37},{10,0,834},{11,0,4},{11,0,\n187},{11,0,281},{11,0,503},{11,0,677},{12,0,96},{12,0,130},{12,0,244},{14,0,5},{\n14,0,40},{14,0,162},{14,0,202},{146,0,133},{4,0,406},{5,0,579},{12,0,492},{150,0\n,15},{135,11,158},{135,0,597},{132,0,981},{132,10,888},{4,10,149},{138,10,368},{\n132,0,545},{4,10,154},{7,10,1134},{136,10,105},{135,11,2001},{134,0,1558},{4,10,\n31},{6,10,429},{7,10,962},{9,10,458},{139,10,691},{132,10,312},{135,10,1642},{6,\n0,17},{6,0,1304},{7,0,16},{7,0,1001},{9,0,886},{10,0,489},{10,0,800},{11,0,782},\n{12,0,320},{13,0,467},{14,0,145},{14,0,387},{143,0,119},{135,0,1982},{7,11,1461}\n,{12,11,91},{145,0,17},{4,10,236},{132,11,602},{138,0,907},{136,0,110},{5,10,836\n},{5,10,857},{6,10,1680},{7,0,272},{147,0,53},{5,0,458},{7,11,1218},{136,11,303}\n,{7,0,1983},{8,0,0},{8,0,171},{9,0,120},{9,0,732},{10,0,473},{10,10,68},{11,0,\n656},{11,0,998},{11,10,494},{18,0,0},{18,0,2},{147,0,21},{137,11,662},{4,11,13},\n{5,11,567},{7,11,1498},{9,11,124},{11,11,521},{140,11,405},{4,10,81},{139,10,867\n},{135,11,1006},{7,11,800},{7,11,1783},{138,11,12},{5,10,282},{8,10,650},{9,0,\n295},{9,10,907},{138,0,443},{132,11,735},{4,10,775},{4,11,170},{135,11,323},{6,0\n,1844},{10,0,924},{11,11,844},{12,11,104},{140,11,625},{5,11,304},{7,11,1403},{\n140,11,498},{134,0,1232},{4,0,519},{10,0,70},{12,0,26},{14,0,17},{14,0,178},{15,\n0,34},{149,0,12},{132,0,993},{4,11,148},{133,11,742},{6,0,31},{7,0,491},{7,0,530\n},{8,0,592},{11,0,53},{11,0,779},{12,0,167},{12,0,411},{14,0,14},{14,0,136},{15,\n0,72},{16,0,17},{144,0,72},{133,0,907},{134,0,733},{133,11,111},{4,10,71},{5,10,\n376},{7,10,119},{138,10,665},{136,0,55},{8,0,430},{136,11,430},{4,0,208},{5,0,\n106},{6,0,531},{8,0,408},{9,0,188},{138,0,572},{11,10,827},{12,0,56},{14,10,34},\n{143,10,148},{134,0,1693},{133,11,444},{132,10,479},{140,0,441},{9,0,449},{10,0,\n192},{138,0,740},{134,0,928},{4,0,241},{7,10,607},{136,10,99},{8,11,123},{15,11,\n6},{144,11,7},{6,11,285},{8,11,654},{11,11,749},{12,11,190},{12,11,327},{13,11,\n120},{13,11,121},{13,11,327},{15,11,47},{146,11,40},{4,10,41},{5,10,74},{7,10,\n1627},{11,10,871},{140,10,619},{7,0,1525},{11,10,329},{11,10,965},{12,10,241},{\n14,10,354},{15,10,22},{148,10,63},{132,0,259},{135,11,183},{9,10,209},{137,10,\n300},{5,11,937},{135,11,100},{133,10,98},{4,0,173},{5,0,312},{5,0,512},{135,0,\n1285},{141,0,185},{7,0,1603},{7,0,1691},{9,0,464},{11,0,195},{12,0,279},{12,0,\n448},{14,0,11},{147,0,102},{135,0,1113},{133,10,984},{4,0,452},{5,0,583},{135,0,\n720},{4,0,547},{5,0,817},{6,0,433},{7,0,593},{7,0,1378},{8,0,161},{9,0,284},{10,\n0,313},{139,0,886},{4,10,182},{6,10,205},{7,10,220},{136,0,722},{150,0,13},{4,10\n,42},{9,10,205},{9,10,786},{138,10,659},{6,0,289},{7,0,1670},{12,0,57},{151,0,4}\n,{132,10,635},{14,0,43},{146,0,21},{139,10,533},{135,0,1694},{8,0,420},{139,0,\n193},{135,0,409},{132,10,371},{4,10,272},{135,10,836},{5,10,825},{134,10,1640},{\n5,11,251},{5,11,956},{8,11,268},{9,11,214},{146,11,142},{138,0,308},{6,0,1863},{\n141,11,37},{137,10,879},{7,10,317},{135,10,569},{132,11,294},{134,0,790},{5,0,\n1002},{136,0,745},{5,11,346},{5,11,711},{136,11,390},{135,0,289},{5,0,504},{9,10\n,307},{139,0,68},{4,0,239},{6,0,477},{7,0,1607},{139,0,617},{149,0,13},{133,0,\n609},{133,11,624},{5,11,783},{7,11,1998},{135,11,2047},{133,10,525},{132,0,367},\n{132,11,594},{5,10,493},{134,0,528},{4,10,174},{135,10,911},{8,10,417},{137,10,\n782},{132,0,694},{7,0,548},{137,0,58},{4,10,32},{5,10,215},{6,10,269},{7,10,1782\n},{7,10,1892},{10,10,16},{11,10,822},{11,10,954},{141,10,481},{140,0,687},{7,0,\n1749},{136,10,477},{132,11,569},{133,10,308},{135,10,1088},{4,0,661},{138,0,1004\n},{5,11,37},{6,11,39},{6,11,451},{7,11,218},{7,11,667},{7,11,1166},{7,11,1687},{\n8,11,662},{144,11,2},{5,10,126},{8,10,297},{9,0,445},{9,10,366},{12,0,53},{12,10\n,374},{141,0,492},{7,10,1551},{139,10,361},{148,0,74},{134,11,508},{135,0,213},{\n132,10,175},{132,10,685},{6,0,760},{6,0,834},{134,0,1248},{7,11,453},{7,11,635},\n{7,11,796},{8,11,331},{9,11,328},{9,11,330},{9,11,865},{10,11,119},{10,11,235},{\n11,11,111},{11,11,129},{11,11,240},{12,11,31},{12,11,66},{12,11,222},{12,11,269}\n,{12,11,599},{12,11,689},{13,11,186},{13,11,364},{142,11,345},{7,0,1672},{139,0,\n189},{133,10,797},{133,10,565},{6,0,1548},{6,11,98},{7,11,585},{135,11,702},{9,0\n,968},{15,0,192},{149,0,56},{4,10,252},{6,11,37},{7,10,1068},{7,11,299},{7,11,\n1666},{8,11,195},{8,11,316},{9,11,178},{9,11,276},{9,11,339},{9,11,536},{10,10,\n434},{10,11,102},{10,11,362},{10,11,785},{11,10,228},{11,10,426},{11,11,55},{11,\n11,149},{11,11,773},{13,10,231},{13,11,416},{13,11,419},{14,11,38},{14,11,41},{\n14,11,210},{18,10,106},{148,10,87},{4,0,751},{11,0,390},{140,0,32},{4,0,409},{\n133,0,78},{11,11,458},{12,11,15},{140,11,432},{5,10,231},{7,0,1602},{7,10,601},{\n9,10,277},{9,10,674},{10,0,257},{10,0,698},{10,10,178},{10,10,418},{10,10,509},{\n11,0,544},{11,0,585},{11,10,531},{12,0,212},{12,10,113},{12,10,475},{13,0,307},{\n13,10,99},{142,10,428},{6,0,473},{145,0,105},{5,11,645},{6,0,1949},{143,0,156},{\n7,10,1591},{144,10,43},{135,0,1779},{135,10,1683},{4,11,290},{135,11,1356},{134,\n0,763},{6,11,70},{7,11,1292},{10,11,762},{139,11,288},{142,0,29},{140,11,428},{7\n,0,883},{7,11,131},{7,11,422},{8,11,210},{140,11,573},{134,0,488},{4,10,399},{5,\n10,119},{5,10,494},{7,10,751},{137,10,556},{133,0,617},{132,11,936},{139,0,50},{\n7,0,1518},{139,0,694},{137,0,785},{4,0,546},{135,0,2042},{7,11,716},{13,11,97},{\n141,11,251},{132,11,653},{145,0,22},{134,0,1016},{4,0,313},{133,0,577},{136,11,\n657},{8,0,184},{141,0,433},{135,0,935},{6,0,720},{9,0,114},{146,11,80},{7,10,594\n},{7,10,851},{7,10,1858},{9,10,411},{9,10,574},{9,10,666},{9,10,737},{10,10,346}\n,{10,10,712},{11,10,246},{11,10,432},{11,10,517},{11,10,647},{11,10,679},{11,10,\n727},{12,0,186},{12,0,292},{12,10,304},{12,10,305},{12,10,323},{12,10,483},{12,\n10,572},{12,10,593},{12,10,602},{13,10,95},{13,10,101},{13,10,171},{13,10,315},{\n13,10,378},{13,10,425},{13,10,475},{14,0,100},{14,10,63},{14,10,380},{14,10,384}\n,{15,10,133},{18,0,70},{18,10,112},{148,10,72},{135,10,1093},{135,11,1836},{132,\n10,679},{137,10,203},{11,0,402},{12,0,109},{12,0,431},{13,0,179},{13,0,206},{14,\n0,217},{16,0,3},{148,0,53},{7,11,1368},{8,11,232},{8,11,361},{10,11,682},{138,11\n,742},{137,10,714},{5,0,886},{6,0,46},{6,0,1790},{7,0,14},{7,0,732},{7,0,1654},{\n8,0,95},{8,0,327},{8,0,616},{9,0,892},{9,11,534},{10,0,598},{10,0,769},{11,0,134\n},{11,0,747},{12,0,378},{142,0,97},{4,0,969},{136,10,825},{137,11,27},{6,0,727},\n{142,11,12},{133,0,1021},{134,0,1190},{134,11,1657},{5,10,143},{5,10,769},{6,10,\n1760},{7,10,682},{7,10,1992},{136,10,736},{132,0,153},{135,11,127},{133,0,798},{\n132,0,587},{6,0,598},{7,0,42},{8,0,695},{10,0,212},{11,0,158},{14,0,196},{145,0,\n85},{133,10,860},{6,0,1929},{134,0,1933},{5,0,957},{5,0,1008},{6,10,422},{7,10,0\n},{7,10,1544},{8,11,364},{9,0,577},{11,10,990},{12,0,141},{12,10,453},{13,10,47}\n,{141,10,266},{134,0,1319},{4,0,129},{135,0,465},{7,0,470},{7,0,1057},{7,0,1201}\n,{9,0,755},{11,0,906},{140,0,527},{7,0,908},{146,0,7},{5,0,148},{136,0,450},{5,\n10,515},{137,10,131},{7,10,1605},{11,10,962},{146,10,139},{132,10,646},{134,0,\n1166},{4,10,396},{7,10,728},{9,10,117},{13,10,202},{148,10,51},{6,10,121},{6,10,\n124},{6,10,357},{7,10,1138},{7,10,1295},{8,10,162},{139,10,655},{14,0,374},{142,\n11,374},{138,0,253},{139,0,1003},{5,11,909},{9,11,849},{138,11,805},{133,10,237}\n,{7,11,525},{7,11,1579},{8,11,497},{136,11,573},{137,0,46},{132,0,879},{134,0,\n806},{135,0,1868},{6,0,1837},{134,0,1846},{6,0,730},{134,0,881},{7,0,965},{7,0,\n1460},{7,0,1604},{7,11,193},{7,11,397},{7,11,1105},{8,11,124},{8,11,619},{9,11,\n305},{10,11,264},{11,11,40},{12,11,349},{13,11,134},{13,11,295},{14,11,155},{15,\n11,120},{146,11,105},{136,0,506},{143,0,10},{4,11,262},{7,10,571},{7,10,1877},{7\n,11,342},{10,10,366},{141,11,23},{133,11,641},{9,10,513},{10,0,22},{10,10,39},{\n12,10,122},{140,10,187},{135,11,1431},{150,11,49},{4,11,99},{6,11,250},{6,11,346\n},{8,11,127},{138,11,81},{6,0,2014},{8,0,928},{10,0,960},{10,0,979},{140,0,996},\n{134,0,296},{132,11,915},{5,11,75},{9,11,517},{10,11,470},{12,11,155},{141,11,\n224},{137,10,873},{4,0,854},{140,11,18},{134,0,587},{7,10,107},{7,10,838},{8,10,\n550},{138,10,401},{11,0,636},{11,10,588},{11,10,864},{11,10,968},{15,0,145},{15,\n10,160},{17,0,34},{19,0,50},{151,0,20},{135,11,216},{7,0,982},{10,0,32},{143,0,\n56},{133,10,768},{133,11,954},{6,11,304},{7,11,1114},{8,11,418},{10,11,345},{11,\n11,341},{11,11,675},{141,11,40},{9,11,410},{139,11,425},{136,0,941},{4,10,894},{\n133,0,435},{5,0,85},{6,0,419},{7,0,134},{7,0,305},{7,0,361},{7,0,1337},{8,0,71},\n{140,0,519},{140,0,688},{135,0,740},{5,0,691},{7,0,345},{9,0,94},{140,0,169},{5,\n0,183},{6,0,582},{10,0,679},{140,0,435},{134,11,14},{6,0,945},{135,0,511},{134,\n11,1708},{5,11,113},{6,11,243},{7,11,1865},{11,11,161},{16,11,37},{145,11,99},{\n132,11,274},{137,0,539},{6,10,272},{7,0,1993},{136,0,684},{6,0,659},{134,0,982},\n{4,10,9},{5,10,128},{7,10,368},{11,10,480},{148,10,3},{134,0,583},{132,0,803},{\n133,0,704},{4,0,179},{5,0,198},{133,0,697},{7,0,347},{7,0,971},{7,11,166},{8,0,\n181},{138,0,711},{136,10,682},{4,10,2},{7,10,545},{7,10,894},{136,11,521},{135,0\n,481},{132,0,243},{5,0,203},{7,0,19},{7,0,71},{7,0,113},{10,0,405},{11,0,357},{\n142,0,240},{5,11,725},{5,11,727},{135,11,1811},{6,0,826},{137,11,304},{7,0,1450}\n,{139,0,99},{133,11,654},{134,0,492},{5,0,134},{6,0,408},{6,0,495},{6,11,273},{7\n,0,1593},{10,11,188},{13,11,377},{146,11,77},{9,10,769},{140,10,185},{135,11,410\n},{142,0,4},{4,0,665},{134,11,1785},{4,0,248},{7,0,137},{137,0,349},{5,10,530},{\n142,10,113},{7,0,1270},{139,0,612},{132,11,780},{5,0,371},{135,0,563},{135,0,826\n},{6,0,1535},{23,0,21},{151,0,23},{4,0,374},{7,0,547},{7,0,1700},{7,0,1833},{139\n,0,858},{133,10,556},{7,11,612},{8,11,545},{8,11,568},{8,11,642},{9,11,717},{10,\n11,541},{10,11,763},{11,11,449},{12,11,489},{13,11,153},{13,11,296},{14,11,138},\n{14,11,392},{15,11,50},{16,11,6},{16,11,12},{148,11,9},{9,0,311},{141,0,42},{8,\n10,16},{140,10,568},{6,0,1968},{6,0,2027},{138,0,991},{6,0,1647},{7,0,1552},{7,0\n,2010},{9,0,494},{137,0,509},{133,11,948},{6,10,186},{137,10,426},{134,0,769},{\n134,0,642},{132,10,585},{6,0,123},{7,0,214},{9,0,728},{10,0,157},{11,0,346},{11,\n0,662},{143,0,106},{142,11,381},{135,0,1435},{4,11,532},{5,11,706},{135,11,662},\n{5,11,837},{134,11,1651},{4,10,93},{5,10,252},{6,10,229},{7,10,291},{9,10,550},{\n139,10,644},{148,0,79},{137,10,749},{134,0,1425},{137,10,162},{4,11,362},{7,11,\n52},{7,11,303},{140,11,166},{132,10,381},{4,11,330},{7,11,933},{7,11,2012},{136,\n11,292},{135,11,767},{4,0,707},{5,0,588},{6,0,393},{13,0,106},{18,0,49},{147,0,\n41},{6,0,211},{7,0,1690},{11,0,486},{140,0,369},{137,11,883},{4,11,703},{135,11,\n207},{4,0,187},{5,0,184},{5,0,690},{7,0,1869},{10,0,756},{139,0,783},{132,11,571\n},{134,0,1382},{5,0,175},{6,10,77},{6,10,157},{7,10,974},{7,10,1301},{7,10,1339}\n,{7,10,1490},{7,10,1873},{137,10,628},{134,0,1493},{5,11,873},{133,11,960},{134,\n0,1007},{12,11,93},{12,11,501},{13,11,362},{14,11,151},{15,11,40},{15,11,59},{16\n,11,46},{17,11,25},{18,11,14},{18,11,134},{19,11,25},{19,11,69},{20,11,16},{20,\n11,19},{20,11,66},{21,11,23},{21,11,25},{150,11,42},{11,10,919},{141,10,409},{\n134,0,219},{5,0,582},{6,0,1646},{7,0,99},{7,0,1962},{7,0,1986},{8,0,515},{8,0,\n773},{9,0,23},{9,0,491},{12,0,620},{142,0,93},{133,0,851},{5,11,33},{134,11,470}\n,{135,11,1291},{134,0,1278},{135,11,1882},{135,10,1489},{132,0,1000},{138,0,982}\n,{8,0,762},{8,0,812},{137,0,910},{6,11,47},{7,11,90},{7,11,664},{7,11,830},{7,11\n,1380},{7,11,2025},{8,11,448},{136,11,828},{4,0,98},{4,0,940},{6,0,1819},{6,0,\n1834},{6,0,1841},{7,0,1365},{8,0,859},{8,0,897},{8,0,918},{8,10,398},{9,0,422},{\n9,0,670},{9,10,681},{10,0,775},{10,0,894},{10,0,909},{10,0,910},{10,0,935},{11,0\n,210},{11,10,632},{12,0,750},{12,0,755},{13,0,26},{13,0,457},{13,0,476},{16,0,\n100},{16,0,109},{18,0,173},{146,0,175},{9,11,417},{137,11,493},{136,10,645},{138\n,0,906},{134,0,1730},{134,10,20},{133,11,1019},{134,0,1185},{8,10,769},{138,0,40\n},{6,11,208},{137,0,147},{140,0,650},{5,0,209},{6,0,30},{11,0,56},{139,0,305},{\n132,0,553},{138,11,344},{6,11,68},{7,11,398},{7,11,448},{7,11,1629},{7,11,1813},\n{8,11,387},{8,11,442},{9,11,710},{10,11,282},{138,11,722},{5,0,597},{14,0,20},{\n142,11,20},{135,0,1614},{135,10,1757},{4,0,150},{5,0,303},{6,0,327},{135,10,937}\n,{7,10,1652},{16,0,49},{144,11,49},{8,0,192},{10,0,78},{141,0,359},{135,0,786},{\n143,0,134},{6,0,1638},{7,0,79},{7,0,496},{9,0,138},{10,0,336},{11,0,12},{12,0,\n412},{12,0,440},{142,0,305},{136,11,491},{4,10,579},{5,10,226},{5,10,323},{135,\n10,960},{7,0,204},{7,0,415},{8,0,42},{10,0,85},{139,0,564},{132,0,614},{4,11,403\n},{5,11,441},{7,11,450},{11,11,101},{12,11,193},{141,11,430},{135,11,1927},{135,\n11,1330},{4,0,3},{5,0,247},{5,0,644},{7,0,744},{7,0,1207},{7,0,1225},{7,0,1909},\n{146,0,147},{136,0,942},{4,0,1019},{134,0,2023},{5,10,973},{133,11,679},{5,0,285\n},{9,0,67},{13,0,473},{143,0,82},{7,11,328},{137,11,326},{151,0,8},{6,10,135},{\n135,10,1176},{135,11,1128},{134,0,1309},{135,11,1796},{135,10,314},{4,11,574},{7\n,11,350},{7,11,1024},{8,11,338},{9,11,677},{10,11,808},{139,11,508},{7,11,818},{\n17,11,14},{17,11,45},{18,11,75},{148,11,18},{146,10,4},{135,11,1081},{4,0,29},{6\n,0,532},{7,0,1628},{7,0,1648},{9,0,350},{10,0,433},{11,0,97},{11,0,557},{11,0,\n745},{12,0,289},{12,0,335},{12,0,348},{12,0,606},{13,0,116},{13,0,233},{13,0,466\n},{14,0,181},{14,0,209},{14,0,232},{14,0,236},{14,0,300},{16,0,41},{148,0,97},{6\n,10,281},{7,0,318},{8,10,282},{8,10,480},{8,10,499},{9,10,198},{10,10,143},{10,\n10,169},{10,10,211},{10,10,417},{10,10,574},{11,10,147},{11,10,395},{12,10,75},{\n12,10,407},{12,10,608},{13,10,500},{142,10,251},{135,11,1676},{135,11,2037},{135\n,0,1692},{5,0,501},{7,0,1704},{9,0,553},{11,0,520},{12,0,557},{141,0,249},{6,0,\n1527},{14,0,324},{14,11,324},{15,0,55},{15,0,80},{15,11,55},{143,11,80},{135,10,\n1776},{8,0,988},{137,11,297},{132,10,419},{142,0,223},{139,11,234},{7,0,1123},{\n12,0,508},{14,0,102},{14,0,226},{144,0,57},{4,10,138},{7,10,1012},{7,10,1280},{\n137,10,76},{5,10,29},{7,0,1764},{140,10,638},{134,0,2015},{134,0,1599},{138,11,\n56},{6,11,306},{7,11,1140},{7,11,1340},{8,11,133},{138,11,449},{139,11,1011},{6,\n10,1710},{135,10,2038},{7,11,1763},{140,11,310},{4,10,17},{5,10,23},{6,0,129},{7\n,10,995},{11,10,383},{11,10,437},{12,10,460},{140,10,532},{5,11,329},{136,11,260\n},{133,10,862},{132,0,534},{6,0,811},{135,0,626},{132,11,657},{4,0,25},{5,0,60},\n{6,0,504},{7,0,614},{7,0,1155},{12,0,0},{152,11,7},{7,0,1248},{11,0,621},{139,0,\n702},{137,0,321},{8,10,70},{12,10,171},{141,10,272},{10,10,233},{139,10,76},{4,0\n,379},{6,10,442},{135,0,1397},{5,11,66},{7,11,1896},{136,11,288},{134,11,1643},{\n134,10,1709},{4,11,21},{5,11,91},{5,11,570},{5,11,648},{5,11,750},{5,11,781},{6,\n11,54},{6,11,112},{6,11,402},{6,11,1732},{7,11,315},{7,11,749},{7,11,1347},{7,11\n,1900},{9,11,78},{9,11,508},{10,11,611},{11,11,510},{11,11,728},{13,11,36},{14,\n11,39},{16,11,83},{17,11,124},{148,11,30},{4,0,118},{6,0,274},{6,0,361},{7,0,75}\n,{141,0,441},{10,11,322},{10,11,719},{139,11,407},{147,10,119},{12,11,549},{14,\n11,67},{147,11,60},{11,10,69},{12,10,105},{12,10,117},{13,10,213},{14,10,13},{14\n,10,62},{14,10,177},{14,10,421},{15,10,19},{146,10,141},{9,0,841},{137,10,309},{\n7,10,608},{7,10,976},{8,11,125},{8,11,369},{8,11,524},{9,10,146},{10,10,206},{10\n,10,596},{10,11,486},{11,11,13},{11,11,381},{11,11,736},{11,11,766},{11,11,845},\n{13,10,218},{13,11,114},{13,11,292},{14,10,153},{142,11,47},{7,11,759},{140,0,\n693},{5,0,314},{6,0,221},{7,0,419},{10,0,650},{11,0,396},{12,0,156},{13,0,369},{\n14,0,333},{145,0,47},{6,11,1684},{6,11,1731},{7,11,356},{7,11,1932},{8,11,54},{8\n,11,221},{9,11,225},{9,11,356},{10,11,77},{10,11,446},{10,11,731},{12,11,404},{\n141,11,491},{132,11,375},{4,10,518},{135,10,1136},{4,0,913},{4,11,411},{11,11,\n643},{140,11,115},{4,11,80},{133,11,44},{8,10,689},{137,10,863},{138,0,880},{4,\n10,18},{7,10,145},{7,10,444},{7,10,1278},{8,10,49},{8,10,400},{9,10,71},{9,10,\n250},{10,10,459},{12,10,160},{144,10,24},{136,0,475},{5,0,1016},{5,11,299},{135,\n11,1083},{7,0,602},{8,0,179},{10,0,781},{140,0,126},{6,0,329},{138,0,111},{135,0\n,1864},{4,11,219},{7,11,1761},{137,11,86},{6,0,1888},{6,0,1892},{6,0,1901},{6,0,\n1904},{9,0,953},{9,0,985},{9,0,991},{9,0,1001},{12,0,818},{12,0,846},{12,0,847},\n{12,0,861},{12,0,862},{12,0,873},{12,0,875},{12,0,877},{12,0,879},{12,0,881},{12\n,0,884},{12,0,903},{12,0,915},{12,0,926},{12,0,939},{15,0,182},{15,0,219},{15,0,\n255},{18,0,191},{18,0,209},{18,0,211},{149,0,41},{5,11,328},{135,11,918},{137,0,\n780},{12,0,82},{143,0,36},{133,10,1010},{5,0,821},{134,0,1687},{133,11,514},{132\n,0,956},{134,0,1180},{5,10,87},{7,10,313},{7,10,1103},{10,0,112},{10,10,582},{11\n,10,389},{11,10,813},{12,10,385},{13,10,286},{14,10,124},{146,10,108},{5,0,71},{\n7,0,1407},{9,0,704},{10,0,261},{10,0,619},{11,0,547},{11,0,619},{143,0,157},{4,0\n,531},{5,0,455},{5,11,301},{6,11,571},{14,11,49},{146,11,102},{132,10,267},{6,0,\n385},{7,0,2008},{9,0,337},{138,0,517},{133,11,726},{133,11,364},{4,11,76},{7,11,\n1550},{9,11,306},{9,11,430},{9,11,663},{10,11,683},{11,11,427},{11,11,753},{12,\n11,334},{12,11,442},{14,11,258},{14,11,366},{143,11,131},{6,0,1865},{6,0,1879},{\n6,0,1881},{6,0,1894},{6,0,1908},{9,0,915},{9,0,926},{9,0,940},{9,0,943},{9,0,966\n},{9,0,980},{9,0,989},{9,0,1005},{9,0,1010},{12,0,813},{12,0,817},{12,0,840},{12\n,0,843},{12,0,855},{12,0,864},{12,0,871},{12,0,872},{12,0,899},{12,0,905},{12,0,\n924},{15,0,171},{15,0,181},{15,0,224},{15,0,235},{15,0,251},{146,0,184},{137,11,\n52},{5,0,16},{6,0,86},{6,0,603},{7,0,292},{7,0,561},{8,0,257},{8,0,382},{9,0,721\n},{9,0,778},{11,0,581},{140,0,466},{4,0,486},{5,0,491},{135,10,1121},{4,0,72},{6\n,0,265},{135,0,1300},{135,11,1183},{10,10,249},{139,10,209},{132,10,561},{137,11\n,519},{4,10,760},{4,11,656},{135,11,779},{9,10,154},{140,10,485},{135,11,1793},{\n135,11,144},{136,10,255},{133,0,621},{4,10,368},{135,10,641},{135,11,1373},{7,11\n,554},{7,11,605},{141,11,10},{137,0,234},{5,0,815},{6,0,1688},{134,0,1755},{5,11\n,838},{5,11,841},{134,11,1649},{7,0,1987},{7,0,2040},{136,0,743},{133,11,1012},{\n6,0,197},{136,0,205},{6,0,314},{134,11,314},{144,11,53},{6,11,251},{7,11,365},{7\n,11,1357},{7,11,1497},{8,11,154},{141,11,281},{133,11,340},{6,0,452},{7,0,312},{\n138,0,219},{138,0,589},{4,0,333},{9,0,176},{12,0,353},{141,0,187},{9,10,92},{147\n,10,91},{134,0,1110},{11,0,47},{139,11,495},{6,10,525},{8,10,806},{9,10,876},{\n140,10,284},{8,11,261},{9,11,144},{9,11,466},{10,11,370},{12,11,470},{13,11,144}\n,{142,11,348},{137,11,897},{6,11,248},{8,0,863},{8,0,864},{8,0,868},{8,0,884},{9\n,11,546},{10,0,866},{10,0,868},{10,0,873},{10,0,911},{10,0,912},{10,0,944},{10,\n11,535},{11,11,681},{12,0,727},{141,11,135},{6,0,300},{135,0,1515},{134,0,1237},\n{139,10,958},{133,10,594},{140,11,250},{134,0,1685},{134,11,567},{7,0,135},{8,0,\n7},{8,0,62},{9,0,243},{10,0,658},{10,0,697},{11,0,456},{139,0,756},{9,0,395},{\n138,0,79},{6,10,1641},{136,10,820},{4,10,302},{135,10,1766},{134,11,174},{135,10\n,1313},{135,0,631},{134,10,1674},{134,11,395},{138,0,835},{7,0,406},{7,0,459},{8\n,0,606},{139,0,726},{134,11,617},{134,0,979},{6,10,389},{7,10,149},{9,10,142},{\n138,10,94},{5,11,878},{133,11,972},{6,10,8},{7,10,1881},{8,10,91},{136,11,511},{\n133,0,612},{132,11,351},{4,0,372},{7,0,482},{8,0,158},{9,0,602},{9,0,615},{10,0,\n245},{10,0,678},{10,0,744},{11,0,248},{139,0,806},{5,0,854},{135,0,1991},{132,11\n,286},{135,11,344},{7,11,438},{7,11,627},{7,11,1516},{8,11,40},{9,11,56},{9,11,\n294},{10,11,30},{10,11,259},{11,11,969},{146,11,148},{135,0,1492},{5,11,259},{7,\n11,414},{7,11,854},{142,11,107},{135,10,1746},{6,0,833},{134,0,998},{135,10,24},\n{6,0,750},{135,0,1739},{4,10,503},{135,10,1661},{5,10,130},{7,10,1314},{9,10,610\n},{10,10,718},{11,10,601},{11,10,819},{11,10,946},{140,10,536},{10,10,149},{11,\n10,280},{142,10,336},{132,11,738},{135,10,1946},{5,0,195},{135,0,1685},{7,0,1997\n},{8,0,730},{139,0,1006},{151,11,17},{133,11,866},{14,0,463},{14,0,470},{150,0,\n61},{4,10,392},{5,0,751},{7,10,1597},{8,0,266},{139,0,578},{5,10,433},{9,10,633}\n,{139,10,629},{135,0,821},{6,0,715},{134,0,1325},{133,11,116},{4,11,457},{134,0,\n868},{134,0,959},{6,10,234},{138,11,199},{7,0,1053},{7,10,1950},{8,10,680},{11,\n10,817},{147,10,88},{7,10,1222},{138,10,386},{5,0,950},{5,0,994},{6,0,351},{134,\n0,1124},{134,0,1081},{6,10,5},{7,0,1595},{11,10,249},{12,10,313},{16,10,66},{145\n,10,26},{148,0,59},{5,11,527},{6,11,189},{135,11,859},{5,10,963},{6,10,1773},{11\n,11,104},{11,11,554},{15,11,60},{143,11,125},{135,0,47},{137,0,684},{134,11,116}\n,{134,0,1606},{134,0,777},{7,0,1020},{8,10,509},{136,10,792},{135,0,1094},{132,0\n,350},{133,11,487},{4,11,86},{5,11,667},{5,11,753},{6,11,316},{6,11,455},{135,11\n,946},{7,0,1812},{13,0,259},{13,0,356},{14,0,242},{147,0,114},{132,10,931},{133,\n0,967},{4,0,473},{7,0,623},{8,0,808},{9,0,871},{9,0,893},{11,0,38},{11,0,431},{\n12,0,112},{12,0,217},{12,0,243},{12,0,562},{12,0,663},{12,0,683},{13,0,141},{13,\n0,197},{13,0,227},{13,0,406},{13,0,487},{14,0,156},{14,0,203},{14,0,224},{14,0,\n256},{18,0,58},{150,0,0},{138,0,286},{7,10,943},{139,10,614},{135,10,1837},{150,\n11,45},{132,0,798},{4,0,222},{7,0,286},{136,0,629},{4,11,79},{7,11,1773},{10,11,\n450},{11,11,589},{13,11,332},{13,11,493},{14,11,183},{14,11,334},{14,11,362},{14\n,11,368},{14,11,376},{14,11,379},{19,11,90},{19,11,103},{19,11,127},{148,11,90},\n{4,10,90},{5,0,337},{5,10,545},{7,10,754},{9,10,186},{10,10,72},{10,10,782},{11,\n0,513},{11,0,889},{11,0,961},{11,10,577},{11,10,610},{12,0,461},{12,10,354},{12,\n10,362},{12,10,595},{13,0,79},{143,0,121},{141,0,306},{136,0,146},{7,0,1646},{9,\n10,329},{11,10,254},{141,11,124},{4,0,465},{135,0,1663},{132,0,525},{133,11,663}\n,{9,10,187},{10,0,299},{11,10,1016},{17,10,44},{146,0,74},{4,10,506},{7,0,165},{\n7,0,919},{136,10,517},{5,10,295},{135,10,1680},{133,11,846},{134,0,1064},{5,11,\n378},{7,11,1402},{7,11,1414},{8,11,465},{9,11,286},{10,11,185},{10,11,562},{10,\n11,635},{11,11,31},{11,11,393},{12,11,456},{13,11,312},{18,11,65},{18,11,96},{\n147,11,89},{132,0,596},{7,10,987},{9,10,688},{10,10,522},{11,10,788},{140,10,566\n},{4,11,648},{6,0,82},{6,10,1775},{7,0,138},{7,0,517},{7,0,1741},{139,0,238},{7,\n0,1233},{7,10,700},{7,10,940},{8,10,514},{9,10,116},{9,10,535},{10,10,118},{11,\n10,107},{11,10,148},{11,10,922},{12,10,254},{12,10,421},{142,10,238},{4,0,962},{\n6,0,1824},{8,0,894},{12,0,708},{12,0,725},{14,0,451},{20,0,94},{22,0,59},{150,0,\n62},{5,11,945},{6,11,1656},{6,11,1787},{7,11,167},{8,11,824},{9,11,391},{10,11,\n375},{139,11,185},{5,0,495},{7,0,834},{9,0,733},{139,0,378},{4,10,743},{135,11,\n1273},{6,0,1204},{7,11,1645},{8,11,352},{137,11,249},{139,10,292},{133,0,559},{\n132,11,152},{7,10,1283},{9,0,499},{9,10,227},{10,0,341},{11,10,325},{11,10,408},\n{14,10,180},{15,0,144},{18,10,47},{147,0,49},{6,0,21},{6,0,1737},{7,0,1444},{136\n,0,224},{133,11,1006},{5,10,81},{7,0,1446},{7,10,146},{7,10,1342},{8,10,53},{8,\n10,561},{8,10,694},{8,10,754},{9,0,97},{9,10,115},{9,10,894},{10,10,462},{10,10,\n813},{11,10,230},{11,10,657},{11,10,699},{11,10,748},{12,10,119},{12,10,200},{12\n,10,283},{14,10,273},{145,0,15},{5,10,408},{137,10,747},{135,11,431},{135,11,832\n},{6,0,729},{134,0,953},{4,0,727},{5,11,351},{7,11,264},{8,0,565},{136,11,565},{\n134,0,1948},{5,0,519},{5,11,40},{7,11,598},{7,11,1638},{8,11,78},{9,11,166},{9,\n11,640},{9,11,685},{9,11,773},{11,11,215},{13,11,65},{14,11,172},{14,11,317},{\n145,11,6},{8,11,60},{9,11,343},{139,11,769},{137,11,455},{134,0,1193},{140,0,790\n},{7,11,1951},{8,11,765},{8,11,772},{140,11,671},{7,11,108},{8,11,219},{8,11,388\n},{9,11,639},{9,11,775},{11,11,275},{140,11,464},{132,11,468},{7,10,30},{8,10,86\n},{8,10,315},{8,10,700},{9,10,576},{9,10,858},{11,10,310},{11,10,888},{11,10,904\n},{12,10,361},{141,10,248},{5,11,15},{6,11,56},{7,11,1758},{8,11,500},{9,11,730}\n,{11,11,331},{13,11,150},{142,11,282},{4,0,402},{7,0,2},{8,0,323},{136,0,479},{\n138,10,839},{11,0,580},{142,0,201},{5,0,59},{135,0,672},{137,10,617},{146,0,34},\n{134,11,1886},{4,0,961},{136,0,896},{5,11,205},{6,0,1285},{6,11,438},{137,11,711\n},{134,10,428},{7,10,524},{8,10,169},{8,10,234},{9,10,480},{138,10,646},{148,0,\n46},{141,0,479},{133,11,534},{6,0,2019},{134,10,1648},{4,0,85},{7,0,549},{7,10,\n1205},{138,10,637},{4,0,663},{5,0,94},{7,11,235},{7,11,1475},{15,11,68},{146,11,\n120},{6,11,443},{9,11,237},{9,11,571},{9,11,695},{10,11,139},{11,11,715},{12,11,\n417},{141,11,421},{132,0,783},{4,0,682},{8,0,65},{9,10,39},{10,10,166},{11,10,\n918},{12,10,635},{20,10,10},{22,10,27},{22,10,43},{150,10,52},{6,0,11},{135,0,\n187},{132,0,522},{4,0,52},{135,0,661},{4,0,383},{133,0,520},{135,11,546},{11,0,\n343},{142,0,127},{4,11,578},{7,10,157},{7,11,624},{7,11,916},{8,10,279},{10,11,\n256},{11,11,87},{139,11,703},{134,10,604},{4,0,281},{5,0,38},{7,0,194},{7,0,668}\n,{7,0,1893},{137,0,397},{7,10,945},{11,10,713},{139,10,744},{139,10,1022},{9,0,\n635},{139,0,559},{5,11,923},{7,11,490},{12,11,553},{13,11,100},{14,11,118},{143,\n11,75},{132,0,975},{132,10,567},{137,10,859},{7,10,1846},{7,11,1846},{8,10,628},\n{136,11,628},{148,0,116},{138,11,750},{14,0,51},{14,11,51},{15,11,7},{148,11,20}\n,{132,0,858},{134,0,1075},{4,11,924},{133,10,762},{136,0,535},{133,0,448},{10,10\n,784},{141,10,191},{133,10,298},{7,0,610},{135,0,1501},{7,10,633},{7,10,905},{7,\n10,909},{7,10,1538},{9,10,767},{140,10,636},{4,11,265},{7,11,807},{135,11,950},{\n5,11,93},{12,11,267},{144,11,26},{136,0,191},{139,10,301},{135,10,1970},{135,0,\n267},{4,0,319},{5,0,699},{138,0,673},{6,0,336},{7,0,92},{7,0,182},{8,0,453},{8,0\n,552},{9,0,204},{9,0,285},{10,0,99},{11,0,568},{11,0,950},{12,0,94},{12,10,644},\n{16,0,20},{16,0,70},{16,10,90},{147,0,55},{6,0,551},{7,0,1308},{7,10,845},{7,11,\n994},{8,10,160},{137,10,318},{19,11,1},{19,11,26},{150,11,9},{7,0,1406},{9,0,218\n},{141,0,222},{5,0,256},{138,0,69},{5,11,233},{5,11,320},{6,11,140},{7,11,330},{\n136,11,295},{6,0,1980},{136,0,952},{4,0,833},{137,11,678},{133,11,978},{4,11,905\n},{6,11,1701},{137,11,843},{138,10,735},{136,10,76},{17,0,39},{148,0,36},{18,0,\n81},{146,11,81},{14,0,352},{17,0,53},{18,0,146},{18,0,152},{19,0,11},{150,0,54},\n{135,0,634},{138,10,841},{132,0,618},{4,0,339},{4,11,275},{7,0,259},{12,11,376},\n{145,0,73},{132,11,509},{7,11,273},{139,11,377},{4,0,759},{9,10,804},{141,0,169}\n,{6,10,96},{135,10,1426},{4,10,651},{133,10,289},{7,0,1075},{8,10,35},{9,10,511}\n,{10,10,767},{147,10,118},{6,0,649},{6,0,670},{136,0,482},{5,0,336},{6,0,341},{6\n,0,478},{6,0,1763},{136,0,386},{5,11,802},{7,11,2021},{8,11,805},{14,11,94},{15,\n11,65},{16,11,4},{16,11,77},{16,11,80},{145,11,5},{5,11,167},{5,11,899},{6,0,\n1035},{6,11,410},{137,11,777},{134,11,1705},{5,0,924},{133,0,969},{132,10,704},{\n135,0,73},{135,11,10},{135,10,1078},{5,11,11},{6,11,117},{6,11,485},{7,11,1133},\n{9,11,582},{9,11,594},{11,11,21},{11,11,818},{12,11,535},{141,11,86},{135,0,1971\n},{4,11,264},{7,11,1067},{8,11,204},{8,11,385},{139,11,953},{6,0,1458},{135,0,\n1344},{5,0,396},{134,0,501},{4,10,720},{133,10,306},{4,0,929},{5,0,799},{5,10,\n431},{8,0,46},{136,0,740},{7,11,646},{7,11,1730},{11,11,446},{141,11,178},{5,10,\n464},{6,10,236},{7,0,276},{7,10,696},{7,10,914},{7,10,1108},{7,10,1448},{9,10,15\n},{9,10,564},{10,10,14},{12,10,565},{13,10,449},{14,10,53},{15,10,13},{16,10,64}\n,{145,10,41},{4,0,892},{133,0,770},{6,10,1767},{12,10,194},{145,10,107},{135,0,\n158},{5,10,840},{138,11,608},{134,0,1432},{138,11,250},{8,11,794},{9,11,400},{10\n,11,298},{142,11,228},{151,0,25},{7,11,1131},{135,11,1468},{135,0,2001},{9,10,\n642},{11,10,236},{142,10,193},{4,10,68},{5,10,634},{6,10,386},{7,10,794},{8,10,\n273},{9,10,563},{10,10,105},{10,10,171},{11,10,94},{139,10,354},{136,11,724},{\n132,0,478},{11,11,512},{13,11,205},{19,11,30},{22,11,36},{151,11,19},{7,0,1461},\n{140,0,91},{6,11,190},{7,11,768},{135,11,1170},{4,0,602},{4,10,95},{7,10,416},{8\n,0,211},{139,10,830},{7,10,731},{13,10,20},{143,10,11},{6,0,1068},{135,0,1872},{\n4,0,13},{5,0,567},{7,0,1498},{7,11,1023},{9,0,124},{11,0,521},{140,0,405},{135,0\n,1006},{132,0,735},{138,0,812},{4,0,170},{135,0,323},{6,11,137},{9,11,75},{9,11,\n253},{10,11,194},{138,11,444},{5,0,304},{5,10,864},{7,0,1403},{10,10,648},{11,10\n,671},{143,10,46},{135,11,1180},{133,10,928},{4,0,148},{133,0,742},{11,10,986},{\n140,10,682},{133,0,523},{135,11,1743},{7,0,730},{8,10,44},{9,10,884},{10,10,580}\n,{11,10,399},{11,10,894},{15,10,122},{18,0,144},{147,0,61},{5,11,760},{7,11,542}\n,{8,11,135},{136,11,496},{136,0,981},{133,0,111},{10,0,132},{11,0,191},{11,0,358\n},{139,0,460},{7,11,319},{7,11,355},{7,11,763},{10,11,389},{145,11,43},{134,0,\n890},{134,0,1420},{136,11,557},{133,10,518},{133,0,444},{135,0,1787},{135,10,\n1852},{8,0,123},{15,0,6},{144,0,7},{6,0,2041},{10,11,38},{139,11,784},{136,0,932\n},{5,0,937},{135,0,100},{4,11,58},{5,11,286},{6,0,995},{6,11,319},{7,11,402},{7,\n11,1254},{7,11,1903},{8,11,356},{140,11,408},{4,11,389},{9,11,181},{9,11,255},{\n10,11,8},{10,11,29},{10,11,816},{11,11,311},{11,11,561},{12,11,67},{141,11,181},\n{138,0,255},{4,10,934},{5,0,138},{136,10,610},{4,0,965},{10,0,863},{138,0,898},{\n10,10,804},{138,10,832},{8,10,96},{9,10,36},{10,10,607},{11,10,423},{11,10,442},\n{12,0,631},{12,10,309},{14,10,199},{15,10,90},{145,10,110},{134,0,1394},{4,0,652\n},{8,0,320},{9,10,13},{9,10,398},{9,10,727},{10,10,75},{10,10,184},{10,10,230},{\n10,10,564},{10,10,569},{11,10,973},{12,10,70},{12,10,189},{13,10,57},{13,10,257}\n,{22,0,6},{150,0,16},{6,0,897},{134,0,1333},{4,0,692},{133,0,321},{133,11,373},{\n135,0,922},{5,0,619},{133,0,698},{137,10,631},{5,10,345},{135,10,1016},{9,0,957}\n,{9,0,1018},{12,0,828},{12,0,844},{12,0,897},{12,0,901},{12,0,943},{15,0,180},{\n18,0,197},{18,0,200},{18,0,213},{18,0,214},{146,0,226},{5,0,917},{134,0,1659},{\n135,0,1100},{134,0,1173},{134,0,1930},{5,0,251},{5,0,956},{8,0,268},{9,0,214},{\n146,0,142},{133,10,673},{137,10,850},{4,10,287},{133,10,1018},{132,11,672},{5,0,\n346},{5,0,711},{8,0,390},{11,11,752},{139,11,885},{5,10,34},{10,10,724},{12,10,\n444},{13,10,354},{18,10,32},{23,10,24},{23,10,31},{152,10,5},{4,11,710},{134,11,\n606},{134,0,744},{134,10,382},{133,11,145},{4,10,329},{7,11,884},{140,11,124},{4\n,11,467},{5,11,405},{134,11,544},{9,10,846},{138,10,827},{133,0,624},{9,11,372},\n{15,11,2},{19,11,10},{147,11,18},{4,11,387},{135,11,1288},{5,0,783},{7,0,1998},{\n135,0,2047},{132,10,906},{136,10,366},{135,11,550},{4,10,123},{4,10,649},{5,10,\n605},{7,10,1509},{136,10,36},{134,0,1125},{132,0,594},{133,10,767},{135,11,1227}\n,{136,11,467},{4,11,576},{135,11,1263},{4,0,268},{7,0,1534},{135,11,1534},{4,10,\n273},{5,10,658},{5,10,995},{5,11,919},{134,11,1673},{133,0,563},{134,10,72},{135\n,10,1345},{4,11,82},{5,11,333},{5,11,904},{6,11,207},{7,11,325},{7,11,1726},{8,\n11,101},{10,11,778},{139,11,220},{5,0,37},{5,10,589},{6,0,39},{6,0,451},{7,0,218\n},{7,0,667},{7,0,1166},{7,0,1687},{8,0,662},{144,0,2},{134,0,1332},{133,11,903},\n{134,0,508},{5,10,117},{6,10,514},{6,10,541},{7,10,1164},{7,10,1436},{8,10,220},\n{8,10,648},{10,10,688},{11,10,560},{140,11,147},{6,11,555},{135,11,485},{133,10,\n686},{7,0,453},{7,0,635},{7,0,796},{8,0,331},{9,0,330},{9,0,865},{10,0,119},{10,\n0,235},{11,0,111},{11,0,129},{11,0,240},{12,0,31},{12,0,66},{12,0,222},{12,0,269\n},{12,0,599},{12,0,684},{12,0,689},{12,0,691},{142,0,345},{135,0,1834},{4,11,705\n},{7,11,615},{138,11,251},{136,11,345},{137,0,527},{6,0,98},{7,0,702},{135,0,991\n},{7,10,196},{10,10,765},{11,0,576},{11,10,347},{11,10,552},{11,10,790},{12,10,\n263},{13,10,246},{13,10,270},{13,10,395},{14,0,74},{14,10,176},{14,10,190},{14,\n10,398},{14,10,412},{15,10,32},{15,10,63},{16,10,88},{147,10,105},{134,11,90},{\n13,0,84},{141,0,122},{6,0,37},{7,0,299},{7,0,1666},{8,0,195},{8,0,316},{9,0,178}\n,{9,0,276},{9,0,339},{9,0,536},{10,0,102},{10,0,362},{10,0,785},{11,0,55},{11,0,\n149},{11,0,773},{13,0,416},{13,0,419},{14,0,38},{14,0,41},{142,0,210},{5,10,381}\n,{135,10,1792},{7,11,813},{12,11,497},{141,11,56},{7,10,616},{138,10,413},{133,0\n,645},{6,11,125},{135,11,1277},{132,0,290},{6,0,70},{7,0,1292},{10,0,762},{139,0\n,288},{6,10,120},{7,10,1188},{7,10,1710},{8,10,286},{9,10,667},{11,10,592},{139,\n10,730},{135,11,1784},{7,0,1315},{135,11,1315},{134,0,1955},{135,10,1146},{7,0,\n131},{7,0,422},{8,0,210},{140,0,573},{4,10,352},{135,10,687},{139,0,797},{143,0,\n38},{14,0,179},{15,0,151},{150,0,11},{4,10,192},{5,10,49},{6,10,200},{6,10,293},\n{6,10,1696},{135,0,488},{132,0,936},{135,11,703},{6,11,160},{7,11,1106},{9,11,\n770},{10,11,618},{11,11,112},{140,11,413},{5,0,453},{134,0,441},{135,0,595},{132\n,10,650},{132,10,147},{6,0,991},{6,0,1182},{12,11,271},{145,11,109},{133,10,934}\n,{140,11,221},{132,0,653},{7,0,505},{135,0,523},{134,0,903},{135,11,479},{7,11,\n304},{9,11,646},{9,11,862},{10,11,262},{11,11,696},{12,11,208},{15,11,79},{147,\n11,108},{146,0,80},{135,11,981},{142,0,432},{132,0,314},{137,11,152},{7,0,1368},\n{8,0,232},{8,0,361},{10,0,682},{138,0,742},{135,11,1586},{4,11,434},{9,0,534},{\n11,11,663},{12,11,210},{13,11,166},{13,11,310},{14,11,373},{147,11,43},{7,11,\n1091},{135,11,1765},{6,11,550},{135,11,652},{137,0,27},{142,0,12},{4,10,637},{5,\n11,553},{7,11,766},{138,11,824},{7,11,737},{8,11,298},{136,11,452},{7,0,736},{\n139,0,264},{134,0,1657},{133,11,292},{138,11,135},{6,0,844},{134,0,1117},{135,0,\n127},{9,10,867},{138,10,837},{6,0,1184},{134,0,1208},{134,0,1294},{136,0,364},{6\n,0,1415},{6,10,170},{7,0,1334},{7,11,393},{8,10,395},{8,10,487},{10,11,603},{11,\n0,125},{11,11,206},{141,10,147},{137,11,748},{4,11,912},{137,11,232},{4,10,535},\n{136,10,618},{137,0,792},{7,11,1973},{136,11,716},{135,11,98},{5,0,909},{9,0,849\n},{138,0,805},{4,0,630},{132,0,699},{5,11,733},{14,11,103},{150,10,23},{12,11,\n158},{18,11,8},{19,11,62},{20,11,6},{22,11,4},{23,11,2},{151,11,9},{132,0,968},{\n132,10,778},{132,10,46},{5,10,811},{6,10,1679},{6,10,1714},{135,10,2032},{6,0,\n1446},{7,10,1458},{9,10,407},{139,10,15},{6,10,34},{7,0,206},{7,0,397},{7,0,621}\n,{7,0,640},{7,10,1089},{8,0,124},{8,0,619},{8,10,708},{8,10,721},{9,0,305},{9,0,\n643},{9,10,363},{10,0,264},{10,0,628},{11,0,40},{12,0,349},{13,0,134},{13,0,295}\n,{14,0,155},{15,0,120},{18,0,105},{148,10,98},{4,0,262},{5,0,641},{135,0,342},{\n137,11,72},{4,0,99},{6,0,250},{6,0,346},{8,0,127},{138,0,81},{132,0,915},{5,0,75\n},{9,0,517},{10,0,470},{12,0,155},{141,0,224},{132,10,462},{11,11,600},{11,11,\n670},{141,11,245},{142,0,83},{5,10,73},{6,10,23},{134,10,338},{6,0,1031},{139,11\n,923},{7,11,164},{7,11,1571},{9,11,107},{140,11,225},{134,0,1470},{133,0,954},{6\n,0,304},{8,0,418},{10,0,345},{11,0,341},{139,0,675},{9,0,410},{139,0,425},{4,11,\n27},{5,11,484},{5,11,510},{6,11,434},{7,11,1000},{7,11,1098},{8,11,2},{136,11,\n200},{134,0,734},{140,11,257},{7,10,725},{8,10,498},{139,10,268},{134,0,1822},{\n135,0,1798},{135,10,773},{132,11,460},{4,11,932},{133,11,891},{134,0,14},{132,10\n,583},{7,10,1462},{8,11,625},{139,10,659},{5,0,113},{5,10,220},{6,0,243},{6,0,\n1708},{7,0,1865},{11,0,161},{16,0,37},{145,0,99},{134,11,76},{5,11,461},{135,11,\n1925},{140,0,69},{8,11,92},{137,11,221},{139,10,803},{132,10,544},{4,0,274},{134\n,0,922},{132,0,541},{5,0,627},{6,10,437},{6,10,564},{11,10,181},{141,10,183},{\n135,10,1192},{4,11,763},{135,0,166},{133,11,253},{134,0,849},{9,11,73},{10,11,\n110},{14,11,185},{145,11,119},{5,11,212},{12,11,35},{141,11,382},{133,0,717},{\n137,0,304},{136,0,600},{133,0,654},{6,0,273},{10,0,188},{13,0,377},{146,0,77},{4\n,10,790},{5,10,273},{134,10,394},{132,0,543},{135,0,410},{11,0,98},{11,0,524},{\n141,0,87},{132,0,941},{135,11,1175},{4,0,250},{6,10,127},{7,0,1612},{7,10,1511},\n{8,10,613},{11,0,186},{12,0,133},{12,10,495},{12,10,586},{12,10,660},{12,10,668}\n,{14,10,385},{15,10,118},{17,10,20},{146,10,98},{5,11,816},{134,0,1785},{134,0,\n1339},{6,10,230},{7,0,961},{7,0,1085},{7,0,1727},{7,11,1727},{136,0,462},{7,10,\n1954},{137,0,636},{132,0,780},{5,11,869},{5,11,968},{6,11,1626},{8,11,734},{136,\n11,784},{4,11,542},{6,11,1716},{6,11,1727},{7,11,1082},{7,11,1545},{8,11,56},{8,\n11,118},{8,11,412},{8,11,564},{9,11,888},{9,11,908},{10,11,50},{10,11,423},{11,\n11,685},{11,11,697},{11,11,933},{12,11,299},{13,11,126},{13,11,136},{13,11,170},\n{141,11,190},{134,11,226},{4,11,232},{9,11,202},{10,11,474},{140,11,433},{137,11\n,500},{5,0,529},{136,10,68},{132,10,654},{4,10,156},{7,10,998},{7,10,1045},{7,10\n,1860},{9,10,48},{9,10,692},{11,10,419},{139,10,602},{6,11,108},{7,0,1276},{7,11\n,1003},{7,11,1181},{8,0,474},{8,11,343},{137,0,652},{7,11,1264},{7,11,1678},{11,\n11,945},{12,11,341},{12,11,471},{140,11,569},{134,11,1712},{5,0,948},{12,0,468},\n{19,0,96},{148,0,24},{4,11,133},{7,11,711},{7,11,1298},{7,11,1585},{135,11,1929}\n,{6,0,753},{140,0,657},{139,0,941},{6,11,99},{7,11,1808},{145,11,57},{6,11,574},\n{7,11,428},{7,11,1250},{10,11,669},{11,11,485},{11,11,840},{12,11,300},{142,11,\n250},{4,0,532},{5,0,706},{135,0,662},{5,0,837},{6,0,1651},{139,0,985},{7,0,1861}\n,{9,10,197},{10,10,300},{12,10,473},{13,10,90},{141,10,405},{137,11,252},{6,11,\n323},{135,11,1564},{4,0,330},{4,0,863},{7,0,933},{7,0,2012},{7,11,461},{8,0,292}\n,{8,11,775},{138,11,435},{132,10,606},{4,11,655},{7,11,850},{17,11,75},{146,11,\n137},{135,0,767},{7,10,1978},{136,10,676},{132,0,641},{135,11,1559},{134,0,1233}\n,{137,0,242},{4,10,361},{5,10,315},{145,0,114},{137,0,883},{132,10,461},{138,0,\n274},{134,0,2008},{134,0,1794},{4,0,703},{135,0,207},{4,10,472},{140,0,285},{132\n,0,571},{5,0,873},{5,0,960},{8,0,823},{8,11,577},{137,0,881},{7,0,617},{10,0,498\n},{11,0,501},{12,0,16},{140,0,150},{138,10,747},{132,0,431},{133,10,155},{7,10,\n163},{8,10,319},{9,10,402},{10,10,24},{10,10,681},{11,0,283},{11,0,567},{11,10,\n200},{12,10,253},{12,10,410},{142,10,219},{4,11,413},{5,11,677},{8,11,432},{140,\n11,280},{5,10,475},{7,10,1780},{9,0,401},{11,10,297},{11,10,558},{14,10,322},{\n147,10,76},{6,0,781},{9,0,134},{10,0,2},{10,0,27},{10,0,333},{11,0,722},{143,0,1\n},{5,0,33},{6,0,470},{139,0,424},{135,0,2006},{7,10,1956},{140,0,783},{136,0,274\n},{135,0,1882},{132,0,794},{135,0,1848},{5,10,944},{134,10,1769},{6,0,47},{7,0,\n90},{7,0,664},{7,0,830},{7,0,1380},{7,0,2025},{8,0,448},{136,0,828},{132,10,144}\n,{134,0,1199},{4,11,395},{139,11,762},{135,11,1504},{9,0,417},{137,0,493},{9,11,\n174},{10,11,164},{11,11,440},{11,11,841},{143,11,98},{134,11,426},{139,11,1002},\n{134,0,295},{134,0,816},{6,10,247},{137,10,555},{133,0,1019},{4,0,620},{5,11,476\n},{10,10,280},{138,10,797},{139,0,464},{5,11,76},{6,11,458},{6,11,497},{7,11,764\n},{7,11,868},{9,11,658},{10,11,594},{11,11,173},{11,11,566},{12,11,20},{12,11,\n338},{141,11,200},{134,0,208},{4,11,526},{7,11,1029},{135,11,1054},{132,11,636},\n{6,11,233},{7,11,660},{7,11,1124},{17,11,31},{19,11,22},{151,11,14},{5,10,428},{\n138,0,442},{10,0,930},{140,0,778},{6,0,68},{7,0,448},{7,0,1629},{7,0,1769},{7,0,\n1813},{7,10,1717},{8,0,442},{8,0,516},{9,0,710},{10,0,282},{10,0,722},{138,10,\n546},{134,0,1128},{11,0,844},{12,0,104},{140,0,625},{4,11,432},{135,11,824},{138\n,10,189},{133,0,787},{133,10,99},{4,11,279},{7,11,301},{137,11,362},{4,10,397},{\n8,0,491},{136,10,555},{4,11,178},{133,11,399},{134,0,711},{144,0,9},{4,0,403},{5\n,0,441},{7,0,450},{10,0,840},{11,0,101},{12,0,193},{141,0,430},{135,11,1246},{12\n,10,398},{20,10,39},{21,10,11},{150,10,41},{4,10,485},{7,10,353},{135,10,1523},{\n6,10,366},{7,10,1384},{7,10,1601},{135,11,1912},{7,0,396},{7,11,396},{138,0,160}\n,{137,10,282},{134,11,1692},{4,10,157},{5,10,471},{6,11,202},{10,11,448},{11,11,\n208},{12,11,360},{17,11,117},{17,11,118},{18,11,27},{148,11,67},{133,0,679},{137\n,0,326},{136,10,116},{7,11,872},{10,11,516},{139,11,167},{132,11,224},{5,11,546}\n,{7,11,35},{8,11,11},{8,11,12},{9,11,315},{9,11,533},{10,11,802},{11,11,166},{12\n,11,525},{142,11,243},{7,0,1128},{135,11,1920},{5,11,241},{8,11,242},{9,11,451},\n{10,11,667},{11,11,598},{140,11,429},{5,10,160},{6,0,737},{7,10,363},{7,10,589},\n{10,10,170},{141,10,55},{135,0,1796},{142,11,254},{4,0,574},{7,0,350},{7,0,1024}\n,{8,0,338},{9,0,677},{138,0,808},{134,0,1096},{137,11,516},{4,10,108},{4,11,366}\n,{7,0,405},{10,0,491},{139,10,498},{11,11,337},{142,11,303},{134,11,1736},{7,0,\n1081},{140,11,364},{7,10,1005},{140,10,609},{4,10,895},{5,10,772},{135,0,1676},{\n135,0,2037},{6,0,1207},{11,11,916},{142,11,419},{14,11,140},{148,11,41},{6,11,\n331},{136,11,623},{4,10,926},{5,10,983},{9,0,944},{9,0,969},{9,0,1022},{12,0,913\n},{12,0,936},{15,0,177},{143,0,193},{5,0,354},{135,11,506},{8,0,598},{9,0,664},{\n138,0,441},{4,11,640},{133,11,513},{137,0,297},{132,10,538},{6,10,294},{7,10,\n1267},{136,10,624},{7,0,1772},{7,11,1888},{8,11,289},{11,11,45},{12,11,278},{140\n,11,537},{135,10,1325},{138,0,751},{141,0,37},{134,0,1828},{132,10,757},{132,11,\n394},{6,0,257},{135,0,1522},{4,0,582},{7,11,1931},{137,0,191},{7,11,574},{7,11,\n1719},{137,11,145},{132,11,658},{4,11,369},{138,0,790},{9,11,781},{10,11,144},{\n11,11,385},{13,11,161},{13,11,228},{13,11,268},{148,11,107},{8,0,469},{8,11,374}\n,{138,0,47},{6,0,306},{7,0,1140},{7,0,1340},{8,0,133},{138,0,449},{139,0,1011},{\n7,10,1875},{139,10,124},{4,11,344},{6,11,498},{139,11,323},{137,0,299},{132,0,\n837},{133,11,906},{5,0,329},{8,0,260},{138,0,10},{134,0,1320},{4,0,657},{146,0,\n158},{135,0,1191},{152,0,7},{6,0,1939},{8,0,974},{138,0,996},{135,0,1665},{11,11\n,126},{139,11,287},{143,0,8},{14,11,149},{14,11,399},{143,11,57},{5,0,66},{7,0,\n1896},{136,0,288},{5,10,150},{7,0,175},{8,10,603},{9,10,593},{9,10,634},{10,0,\n494},{10,10,173},{11,10,462},{11,10,515},{13,10,216},{13,10,288},{142,10,400},{\n134,0,1643},{136,11,21},{4,0,21},{5,0,91},{5,0,648},{5,0,750},{5,0,781},{6,0,54}\n,{6,0,112},{6,0,402},{6,0,1732},{7,0,315},{7,0,749},{7,0,1427},{7,0,1900},{9,0,\n78},{9,0,508},{10,0,611},{10,0,811},{11,0,510},{11,0,728},{13,0,36},{14,0,39},{\n16,0,83},{17,0,124},{148,0,30},{4,0,668},{136,0,570},{10,0,322},{10,0,719},{139,\n0,407},{135,11,1381},{136,11,193},{12,10,108},{141,10,291},{132,11,616},{136,11,\n692},{8,0,125},{8,0,369},{8,0,524},{10,0,486},{11,0,13},{11,0,381},{11,0,736},{\n11,0,766},{11,0,845},{13,0,114},{13,0,292},{142,0,47},{134,0,1247},{6,0,1684},{6\n,0,1731},{7,0,356},{8,0,54},{8,0,221},{9,0,225},{9,0,356},{10,0,77},{10,0,446},{\n10,0,731},{12,0,404},{141,0,491},{135,10,1777},{4,10,493},{4,11,305},{144,10,55}\n,{4,0,951},{6,0,1809},{6,0,1849},{8,0,846},{8,0,866},{8,0,899},{10,0,896},{12,0,\n694},{142,0,468},{5,11,214},{7,11,603},{8,11,611},{9,11,686},{10,11,88},{11,11,\n459},{11,11,496},{12,11,463},{12,11,590},{13,11,0},{142,11,214},{132,0,411},{4,0\n,80},{133,0,44},{140,11,74},{143,0,31},{6,10,568},{7,0,669},{7,10,1804},{8,10,\n362},{8,10,410},{8,10,830},{9,10,514},{11,10,649},{142,10,157},{6,11,1703},{135,\n0,673},{132,10,625},{134,0,1303},{5,0,299},{135,0,1083},{138,0,704},{6,0,275},{6\n,10,158},{7,0,408},{7,10,129},{7,10,181},{8,10,276},{8,10,377},{10,10,523},{11,\n10,816},{12,10,455},{13,10,303},{142,10,135},{4,0,219},{7,0,367},{7,0,1713},{7,0\n,1761},{9,0,86},{9,0,537},{10,0,165},{12,0,219},{140,0,561},{4,10,1},{4,11,737},\n{6,11,317},{7,10,1143},{7,10,1463},{8,0,216},{9,10,207},{9,10,390},{9,10,467},{\n10,11,98},{11,10,836},{11,11,294},{12,11,60},{12,11,437},{13,11,64},{13,11,380},\n{142,11,430},{6,11,1758},{8,11,520},{9,11,345},{9,11,403},{142,11,350},{5,11,47}\n,{10,11,242},{138,11,579},{5,11,139},{7,11,1168},{138,11,539},{135,0,1319},{4,10\n,295},{4,10,723},{5,10,895},{7,10,1031},{8,10,199},{8,10,340},{9,10,153},{9,10,\n215},{10,10,21},{10,10,59},{10,10,80},{10,10,224},{10,10,838},{11,10,229},{11,10\n,652},{12,10,192},{13,10,146},{142,10,91},{140,0,428},{137,10,51},{133,0,514},{5\n,10,309},{140,10,211},{5,10,125},{6,0,1010},{8,10,77},{138,10,15},{4,0,55},{5,0,\n301},{6,0,571},{142,0,49},{146,0,102},{136,11,370},{4,11,107},{7,11,613},{8,11,\n358},{8,11,439},{8,11,504},{9,11,501},{10,11,383},{139,11,477},{132,11,229},{133\n,0,364},{133,10,439},{4,11,903},{135,11,1816},{11,0,379},{140,10,76},{4,0,76},{4\n,0,971},{7,0,1550},{9,0,306},{9,0,430},{9,0,663},{10,0,683},{10,0,921},{11,0,427\n},{11,0,753},{12,0,334},{12,0,442},{14,0,258},{14,0,366},{143,0,131},{137,0,52},\n{4,11,47},{6,11,373},{7,11,452},{7,11,543},{7,11,1714},{7,11,1856},{9,11,6},{11,\n11,257},{139,11,391},{4,10,8},{7,10,1152},{7,10,1153},{7,10,1715},{9,10,374},{10\n,10,478},{139,10,648},{4,11,785},{133,11,368},{135,10,1099},{135,11,860},{5,11,\n980},{134,11,1754},{134,0,1258},{6,0,1058},{6,0,1359},{7,11,536},{7,11,1331},{\n136,11,143},{4,0,656},{135,0,779},{136,10,87},{5,11,19},{6,11,533},{146,11,126},\n{7,0,144},{138,10,438},{5,11,395},{5,11,951},{134,11,1776},{135,0,1373},{7,0,554\n},{7,0,605},{141,0,10},{4,10,69},{5,10,122},{9,10,656},{138,10,464},{5,10,849},{\n134,10,1633},{5,0,838},{5,0,841},{134,0,1649},{133,0,1012},{139,10,499},{7,10,\n476},{7,10,1592},{138,10,87},{6,0,251},{7,0,365},{7,0,1357},{7,0,1497},{8,0,154}\n,{141,0,281},{132,11,441},{132,11,695},{7,11,497},{9,11,387},{147,11,81},{133,0,\n340},{14,10,283},{142,11,283},{134,0,810},{135,11,1894},{139,0,495},{5,11,284},{\n6,11,49},{6,11,350},{7,11,1},{7,11,377},{7,11,1693},{8,11,18},{8,11,678},{9,11,\n161},{9,11,585},{9,11,671},{9,11,839},{11,11,912},{141,11,427},{5,10,859},{7,10,\n1160},{8,10,107},{9,10,291},{9,10,439},{10,10,663},{11,10,609},{140,10,197},{8,0\n,261},{9,0,144},{9,0,466},{10,0,370},{12,0,470},{13,0,144},{142,0,348},{137,0,\n897},{6,0,248},{9,0,546},{10,0,535},{11,0,681},{141,0,135},{4,0,358},{135,0,1496\n},{134,0,567},{136,0,445},{4,10,117},{6,10,372},{7,10,1905},{142,10,323},{4,10,\n722},{139,10,471},{6,0,697},{134,0,996},{7,11,2007},{9,11,101},{9,11,450},{10,11\n,66},{10,11,842},{11,11,536},{140,11,587},{132,0,577},{134,0,1336},{9,10,5},{12,\n10,216},{12,10,294},{12,10,298},{12,10,400},{12,10,518},{13,10,229},{143,10,139}\n,{6,0,174},{138,0,917},{134,10,1774},{5,10,12},{7,10,375},{9,10,88},{9,10,438},{\n11,10,270},{139,11,62},{134,11,1766},{6,11,0},{7,10,816},{7,10,1241},{7,11,84},{\n9,10,283},{9,10,520},{10,10,213},{10,10,307},{10,10,463},{10,10,671},{10,10,746}\n,{11,10,401},{11,10,794},{11,11,895},{12,10,517},{17,11,11},{18,10,107},{147,10,\n115},{5,0,878},{133,0,972},{6,11,1665},{7,11,256},{7,11,1388},{138,11,499},{4,10\n,258},{136,10,639},{4,11,22},{5,11,10},{6,10,22},{7,10,903},{7,10,1963},{7,11,\n848},{8,11,97},{138,10,577},{5,10,681},{136,10,782},{133,11,481},{132,0,351},{4,\n10,664},{5,10,804},{139,10,1013},{6,11,134},{7,11,437},{7,11,959},{9,11,37},{14,\n11,285},{14,11,371},{144,11,60},{7,11,486},{8,11,155},{11,11,93},{140,11,164},{\n132,0,286},{7,0,438},{7,0,627},{7,0,1516},{8,0,40},{9,0,56},{9,0,294},{10,0,30},\n{11,0,969},{11,0,995},{146,0,148},{5,11,591},{135,11,337},{134,0,1950},{133,10,\n32},{138,11,500},{5,11,380},{5,11,650},{136,11,310},{4,11,364},{7,11,1156},{7,11\n,1187},{137,11,409},{4,0,738},{134,11,482},{4,11,781},{6,11,487},{7,11,926},{8,\n11,263},{139,11,500},{135,11,418},{4,10,289},{6,0,2047},{7,10,629},{7,10,1698},{\n7,10,1711},{10,0,969},{140,10,215},{6,10,450},{136,10,109},{134,0,818},{136,10,\n705},{133,0,866},{4,11,94},{135,11,1265},{132,11,417},{134,0,1467},{135,10,1238}\n,{4,0,972},{6,0,1851},{134,0,1857},{134,0,355},{133,0,116},{132,0,457},{135,11,\n1411},{4,11,408},{4,11,741},{135,11,500},{134,10,26},{142,11,137},{5,0,527},{6,0\n,189},{7,0,859},{136,0,267},{11,0,104},{11,0,554},{15,0,60},{143,0,125},{134,0,\n1613},{4,10,414},{5,10,467},{9,10,654},{10,10,451},{12,10,59},{141,10,375},{135,\n10,17},{134,0,116},{135,11,541},{135,10,955},{6,11,73},{135,11,177},{133,11,576}\n,{134,0,886},{133,0,487},{4,0,86},{5,0,667},{5,0,753},{6,0,316},{6,0,455},{135,0\n,946},{142,11,231},{150,0,45},{134,0,863},{134,0,1953},{6,10,280},{10,10,502},{\n11,10,344},{140,10,38},{4,0,79},{7,0,1773},{10,0,450},{11,0,589},{13,0,332},{13,\n0,493},{14,0,183},{14,0,334},{14,0,362},{14,0,368},{14,0,376},{14,0,379},{19,0,\n90},{19,0,103},{19,0,127},{148,0,90},{5,10,45},{7,10,1161},{11,10,448},{11,10,\n880},{13,10,139},{13,10,407},{15,10,16},{17,10,95},{18,10,66},{18,10,88},{18,10,\n123},{149,10,7},{136,10,777},{4,10,410},{135,10,521},{135,10,1778},{135,11,538},\n{142,0,381},{133,11,413},{134,0,1142},{6,0,1189},{136,11,495},{5,0,663},{6,0,\n1962},{134,0,2003},{7,11,54},{8,11,312},{10,11,191},{10,11,614},{140,11,567},{\n132,10,436},{133,0,846},{7,10,1587},{7,10,1707},{10,0,528},{139,0,504},{5,0,378}\n,{8,0,465},{9,0,286},{10,0,185},{10,0,562},{10,0,635},{11,0,31},{11,0,393},{13,0\n,312},{18,0,65},{18,0,96},{147,0,89},{6,11,468},{7,0,899},{7,11,567},{7,11,1478}\n,{8,11,530},{14,0,325},{142,11,290},{7,0,1880},{9,0,680},{139,0,798},{134,0,1770\n},{132,0,648},{150,11,35},{5,0,945},{6,0,1656},{6,0,1787},{7,0,167},{8,0,824},{9\n,0,391},{10,0,375},{139,0,185},{6,11,484},{135,11,822},{134,0,2046},{7,0,1645},{\n8,0,352},{137,0,249},{132,0,152},{6,0,611},{135,0,1733},{6,11,1724},{135,11,2022\n},{133,0,1006},{141,11,96},{5,0,420},{135,0,1449},{146,11,149},{135,0,832},{135,\n10,663},{133,0,351},{5,0,40},{7,0,598},{7,0,1638},{8,0,78},{9,0,166},{9,0,640},{\n9,0,685},{9,0,773},{11,0,215},{13,0,65},{14,0,172},{14,0,317},{145,0,6},{8,0,60}\n,{9,0,343},{139,0,769},{134,0,1354},{132,0,724},{137,0,745},{132,11,474},{7,0,\n1951},{8,0,765},{8,0,772},{140,0,671},{7,0,108},{8,0,219},{8,0,388},{9,0,775},{\n11,0,275},{140,0,464},{137,0,639},{135,10,503},{133,11,366},{5,0,15},{5,11,305},\n{6,0,56},{7,0,1758},{8,0,500},{9,0,730},{9,11,560},{11,0,331},{13,0,150},{13,11,\n208},{142,0,282},{4,10,113},{5,10,163},{5,10,735},{7,10,1009},{9,10,9},{9,10,771\n},{12,10,90},{13,10,138},{13,10,410},{143,10,128},{4,10,324},{138,10,104},{135,\n11,466},{142,11,27},{134,0,1886},{4,11,480},{5,0,205},{6,0,438},{6,11,167},{6,11\n,302},{6,11,1642},{7,11,130},{7,11,656},{7,11,837},{7,11,1547},{7,11,1657},{8,11\n,429},{9,0,711},{9,11,228},{10,11,643},{13,11,289},{13,11,343},{147,11,101},{134\n,0,865},{6,0,2025},{136,0,965},{7,11,278},{10,11,739},{11,11,708},{141,11,348},{\n133,0,534},{135,11,1922},{137,0,691},{4,10,935},{133,10,823},{6,0,443},{9,0,237}\n,{9,0,571},{9,0,695},{10,0,139},{11,0,715},{12,0,417},{141,0,421},{5,10,269},{7,\n10,434},{7,10,891},{8,10,339},{9,10,702},{11,10,594},{11,10,718},{145,10,100},{6\n,0,1555},{7,0,878},{9,10,485},{141,10,264},{134,10,1713},{7,10,1810},{11,10,866}\n,{12,10,103},{141,10,495},{135,10,900},{6,0,1410},{9,11,316},{139,11,256},{4,0,\n995},{135,0,1033},{132,0,578},{10,0,881},{12,0,740},{12,0,743},{140,0,759},{132,\n0,822},{133,0,923},{142,10,143},{135,11,1696},{6,11,363},{7,11,1955},{136,11,725\n},{132,0,924},{133,0,665},{135,10,2029},{135,0,1901},{4,0,265},{6,0,1092},{6,0,\n1417},{7,0,807},{135,0,950},{5,0,93},{12,0,267},{141,0,498},{135,0,1451},{5,11,\n813},{135,11,2046},{5,10,625},{135,10,1617},{135,0,747},{6,0,788},{137,0,828},{5\n,11,712},{7,0,184},{7,11,1855},{8,10,425},{8,10,693},{9,10,720},{10,10,380},{10,\n10,638},{11,0,307},{11,0,400},{11,10,473},{11,11,17},{12,10,61},{13,11,321},{15,\n0,130},{144,11,67},{135,0,198},{6,11,320},{7,11,781},{7,11,1921},{9,11,55},{10,\n11,186},{10,11,273},{10,11,664},{10,11,801},{11,11,996},{11,11,997},{13,11,157},\n{142,11,170},{136,11,271},{135,0,994},{7,11,103},{7,11,863},{11,11,184},{14,11,\n299},{145,11,62},{11,10,551},{142,10,159},{5,0,233},{5,0,320},{6,0,140},{8,0,295\n},{8,0,615},{136,11,615},{133,0,978},{4,0,905},{6,0,1701},{137,0,843},{132,10,\n168},{4,0,974},{8,0,850},{12,0,709},{12,0,768},{140,0,786},{135,10,91},{152,0,6}\n,{138,10,532},{135,10,1884},{132,0,509},{6,0,1307},{135,0,273},{5,11,77},{7,11,\n1455},{10,11,843},{19,11,73},{150,11,5},{132,11,458},{135,11,1420},{6,11,109},{\n138,11,382},{6,0,201},{6,11,330},{7,10,70},{7,11,1084},{10,10,240},{11,11,142},{\n147,10,93},{7,0,1041},{140,11,328},{133,11,354},{134,0,1040},{133,0,693},{134,0,\n774},{139,0,234},{132,0,336},{7,0,1399},{139,10,392},{20,0,22},{148,11,22},{5,0,\n802},{7,0,2021},{136,0,805},{5,0,167},{5,0,899},{6,0,410},{137,0,777},{137,0,789\n},{134,0,1705},{7,10,655},{135,10,1844},{4,10,145},{6,10,176},{7,10,395},{137,10\n,562},{132,10,501},{135,0,10},{5,0,11},{6,0,117},{6,0,485},{6,10,509},{7,0,1133}\n,{9,0,582},{9,0,594},{10,0,82},{11,0,21},{11,0,818},{12,0,535},{13,0,86},{20,0,\n91},{151,0,13},{4,0,264},{7,0,1067},{8,0,204},{8,0,385},{139,0,953},{139,11,737}\n,{138,0,56},{134,0,1917},{133,0,470},{10,11,657},{14,11,297},{142,11,361},{135,\n11,412},{7,0,1198},{7,11,1198},{8,11,556},{14,11,123},{14,11,192},{143,11,27},{7\n,11,1985},{14,11,146},{15,11,42},{16,11,23},{17,11,86},{146,11,17},{8,11,122},{\n139,0,1015},{4,10,114},{9,10,492},{13,10,462},{142,10,215},{4,10,77},{5,10,361},\n{6,10,139},{6,10,401},{6,10,404},{7,10,413},{7,10,715},{7,10,1716},{11,10,279},{\n12,10,179},{12,10,258},{13,10,244},{142,10,358},{134,10,1717},{7,10,1061},{8,10,\n82},{11,10,250},{12,10,420},{141,10,184},{133,0,715},{135,10,724},{9,0,919},{9,0\n,922},{9,0,927},{9,0,933},{9,0,962},{9,0,1000},{9,0,1002},{9,0,1021},{12,0,890},\n{12,0,907},{12,0,930},{15,0,207},{15,0,228},{15,0,238},{149,0,61},{8,0,794},{9,0\n,400},{10,0,298},{142,0,228},{5,11,430},{5,11,932},{6,11,131},{7,11,417},{9,11,\n522},{11,11,314},{141,11,390},{132,0,867},{4,11,507},{136,0,724},{137,11,261},{4\n,11,343},{133,11,511},{6,0,190},{7,0,768},{135,0,1170},{6,10,513},{135,10,1052},\n{7,11,455},{138,11,591},{134,0,1066},{137,10,899},{14,0,67},{147,0,60},{4,0,948}\n,{18,0,174},{146,0,176},{135,0,1023},{7,10,1417},{12,10,382},{17,10,48},{152,10,\n12},{134,11,575},{132,0,764},{6,10,545},{7,10,565},{7,10,1669},{10,10,114},{11,\n10,642},{140,10,618},{6,0,137},{9,0,75},{9,0,253},{10,0,194},{138,0,444},{4,0,\n756},{133,10,5},{7,10,192},{136,0,1008},{132,0,842},{8,10,763},{11,0,643},{140,0\n,115},{139,0,67},{133,10,759},{4,0,821},{5,0,760},{7,0,542},{7,11,580},{8,0,135}\n,{136,0,496},{7,10,370},{7,10,1007},{7,10,1177},{135,10,1565},{135,10,1237},{140\n,0,736},{7,0,319},{7,0,355},{7,0,763},{10,0,389},{145,0,43},{8,11,333},{138,11,\n182},{4,10,87},{5,10,250},{141,10,298},{138,0,786},{134,0,2044},{8,11,330},{140,\n11,477},{135,11,1338},{132,11,125},{134,0,1030},{134,0,1083},{132,11,721},{135,\n10,814},{7,11,776},{8,11,145},{147,11,56},{134,0,1226},{4,10,57},{7,10,1195},{7,\n10,1438},{7,10,1548},{7,10,1835},{7,10,1904},{9,10,757},{10,10,604},{139,10,519}\n,{7,11,792},{8,11,147},{10,11,821},{139,11,1021},{137,11,797},{4,0,58},{5,0,286}\n,{6,0,319},{7,0,402},{7,0,1254},{7,0,1903},{8,0,356},{140,0,408},{4,0,389},{4,0,\n815},{9,0,181},{9,0,255},{10,0,8},{10,0,29},{10,0,816},{11,0,311},{11,0,561},{12\n,0,67},{141,0,181},{7,11,1472},{135,11,1554},{7,11,1071},{7,11,1541},{7,11,1767}\n,{7,11,1806},{7,11,1999},{9,11,248},{10,11,400},{11,11,162},{11,11,178},{11,11,\n242},{12,11,605},{15,11,26},{144,11,44},{5,11,168},{5,11,930},{8,11,74},{9,11,\n623},{12,11,500},{12,11,579},{13,11,41},{143,11,93},{6,11,220},{7,11,1101},{141,\n11,105},{4,10,209},{5,0,474},{7,0,507},{7,10,902},{135,11,507},{132,0,427},{6,0,\n413},{7,10,335},{7,10,1437},{7,10,1668},{8,10,553},{8,10,652},{8,10,656},{9,10,\n558},{11,10,743},{149,10,18},{132,0,730},{6,11,19},{7,11,1413},{139,11,428},{133\n,0,373},{132,10,559},{7,11,96},{8,11,401},{137,11,896},{5,10,1017},{7,0,799},{7,\n0,1972},{138,10,511},{135,0,1793},{7,11,1961},{7,11,1965},{8,11,702},{136,11,750\n},{8,11,150},{8,11,737},{140,11,366},{132,0,322},{133,10,709},{8,11,800},{9,11,\n148},{9,11,872},{9,11,890},{11,11,309},{11,11,1001},{13,11,267},{141,11,323},{\n134,10,1745},{7,0,290},{136,10,206},{7,0,1651},{145,0,89},{139,0,2},{132,0,672},\n{6,0,1860},{8,0,905},{10,0,844},{10,0,846},{10,0,858},{12,0,699},{12,0,746},{140\n,0,772},{135,11,424},{133,11,547},{133,0,737},{5,11,490},{6,11,615},{6,11,620},{\n135,11,683},{6,0,746},{134,0,1612},{132,10,776},{9,11,385},{149,11,17},{133,0,\n145},{135,10,1272},{7,0,884},{140,0,124},{4,0,387},{135,0,1288},{5,11,133},{136,\n10,406},{136,11,187},{6,0,679},{8,11,8},{138,11,0},{135,0,550},{135,11,798},{136\n,11,685},{7,11,1086},{145,11,46},{8,10,175},{10,10,168},{138,10,573},{135,0,1305\n},{4,0,576},{135,0,1263},{6,0,686},{134,0,1563},{134,0,607},{5,0,919},{134,0,\n1673},{148,0,37},{8,11,774},{10,11,670},{140,11,51},{133,10,784},{139,10,882},{4\n,0,82},{5,0,333},{5,0,904},{6,0,207},{7,0,325},{7,0,1726},{8,0,101},{10,0,778},{\n139,0,220},{135,11,371},{132,0,958},{133,0,903},{4,11,127},{5,11,350},{6,11,356}\n,{8,11,426},{9,11,572},{10,11,247},{139,11,312},{140,0,147},{6,11,59},{7,11,885}\n,{9,11,603},{141,11,397},{9,10,14},{9,10,441},{10,0,367},{139,10,9},{11,10,966},\n{12,10,287},{13,10,342},{13,10,402},{15,10,110},{143,10,163},{134,0,690},{132,0,\n705},{7,10,1428},{7,10,1640},{7,10,1867},{9,0,651},{9,10,169},{9,10,182},{9,10,\n367},{9,10,478},{9,10,506},{9,10,551},{9,10,557},{9,10,648},{9,10,697},{9,10,705\n},{9,10,725},{9,10,787},{9,10,794},{10,10,198},{10,10,214},{10,10,267},{10,10,\n275},{10,10,456},{10,10,551},{10,10,561},{10,10,613},{10,10,627},{10,10,668},{10\n,10,675},{10,10,691},{10,10,695},{10,10,707},{10,10,715},{11,0,971},{11,10,183},\n{11,10,201},{11,10,262},{11,10,352},{11,10,439},{11,10,493},{11,10,572},{11,10,\n591},{11,10,608},{11,10,611},{11,10,646},{11,10,674},{11,10,711},{11,10,751},{11\n,10,761},{11,10,776},{11,10,785},{11,10,850},{11,10,853},{11,10,862},{11,10,865}\n,{11,10,868},{11,10,875},{11,10,898},{11,10,902},{11,10,903},{11,10,910},{11,10,\n932},{11,10,942},{11,10,957},{11,10,967},{11,10,972},{12,10,148},{12,10,195},{12\n,10,220},{12,10,237},{12,10,318},{12,10,339},{12,10,393},{12,10,445},{12,10,450}\n,{12,10,474},{12,10,505},{12,10,509},{12,10,533},{12,10,591},{12,10,594},{12,10,\n597},{12,10,621},{12,10,633},{12,10,642},{13,0,273},{13,10,59},{13,10,60},{13,10\n,145},{13,10,239},{13,10,250},{13,10,329},{13,10,344},{13,10,365},{13,10,372},{\n13,10,387},{13,10,403},{13,10,414},{13,10,456},{13,10,470},{13,10,478},{13,10,\n483},{13,10,489},{14,10,55},{14,10,57},{14,10,81},{14,10,90},{14,10,148},{14,10,\n239},{14,10,266},{14,10,321},{14,10,326},{14,10,327},{14,10,330},{14,10,347},{14\n,10,355},{14,10,401},{14,10,404},{14,10,411},{14,10,414},{14,10,416},{14,10,420}\n,{15,10,61},{15,10,74},{15,10,87},{15,10,88},{15,10,94},{15,10,96},{15,10,116},{\n15,10,149},{15,10,154},{16,10,50},{16,10,63},{16,10,73},{17,10,2},{17,10,66},{17\n,10,92},{17,10,103},{17,10,112},{17,10,120},{18,10,50},{18,10,54},{18,10,82},{18\n,10,86},{18,10,90},{18,10,111},{18,10,115},{18,10,156},{19,10,40},{19,10,79},{20\n,10,78},{149,10,22},{5,10,161},{7,0,887},{135,10,839},{142,11,98},{134,0,90},{\n138,11,356},{135,11,441},{6,11,111},{7,11,4},{8,11,163},{8,11,776},{138,11,566},\n{134,0,908},{134,0,1261},{7,0,813},{12,0,497},{141,0,56},{134,0,1235},{135,0,429\n},{135,11,1994},{138,0,904},{6,0,125},{7,0,1277},{137,0,772},{151,0,12},{4,0,841\n},{5,0,386},{133,11,386},{5,11,297},{135,11,1038},{6,0,860},{6,0,1069},{135,11,\n309},{136,0,946},{135,10,1814},{141,11,418},{136,11,363},{10,0,768},{139,0,787},\n{22,11,30},{150,11,33},{6,0,160},{7,0,1106},{9,0,770},{11,0,112},{140,0,413},{11\n,11,216},{139,11,340},{136,10,139},{135,11,1390},{135,11,808},{132,11,280},{7,10\n,643},{8,10,236},{12,0,271},{145,0,109},{140,11,54},{4,11,421},{133,11,548},{11,\n0,719},{12,0,36},{141,0,337},{7,0,581},{9,0,644},{137,0,699},{11,11,511},{13,11,\n394},{14,11,298},{14,11,318},{146,11,103},{7,0,304},{9,0,646},{9,0,862},{11,0,\n696},{12,0,208},{15,0,79},{147,0,108},{4,0,631},{7,0,1126},{135,0,1536},{135,11,\n1527},{8,0,880},{10,0,869},{138,0,913},{5,10,54},{6,11,254},{7,0,1513},{9,11,109\n},{138,11,103},{135,0,981},{133,11,729},{132,10,744},{132,0,434},{134,0,550},{6,\n11,1630},{7,0,930},{10,0,476},{10,10,402},{13,0,452},{18,10,55},{147,0,104},{5,0\n,553},{138,0,824},{136,0,452},{8,0,151},{137,10,624},{132,10,572},{132,0,772},{\n133,11,671},{133,0,292},{138,0,135},{132,11,889},{140,11,207},{6,10,43},{7,10,38\n},{8,10,248},{9,0,504},{138,10,513},{6,0,1089},{135,11,1910},{4,11,627},{133,11,\n775},{135,0,783},{133,10,766},{133,10,363},{7,0,387},{135,11,387},{7,0,393},{7,\n11,202},{10,0,603},{11,0,206},{11,11,362},{11,11,948},{140,11,388},{6,11,507},{7\n,11,451},{8,11,389},{12,11,490},{13,11,16},{13,11,215},{13,11,351},{18,11,132},{\n147,11,125},{4,0,912},{7,11,841},{137,0,232},{6,10,258},{140,10,409},{5,10,249},\n{148,10,82},{136,11,566},{6,0,977},{135,11,1214},{7,0,1973},{136,0,716},{135,0,\n98},{133,0,733},{5,11,912},{134,11,1695},{5,10,393},{6,10,378},{7,10,1981},{9,10\n,32},{9,10,591},{10,10,685},{10,10,741},{142,10,382},{133,10,788},{7,10,1968},{\n10,0,19},{11,0,911},{141,10,509},{5,0,668},{5,11,236},{6,11,572},{8,11,492},{11,\n11,618},{144,11,56},{135,11,1789},{4,0,360},{5,0,635},{5,0,700},{5,10,58},{5,10,\n171},{5,10,683},{6,10,291},{6,10,566},{7,10,1650},{11,10,523},{12,10,273},{12,10\n,303},{15,10,39},{143,10,111},{133,0,901},{134,10,589},{5,11,190},{136,11,318},{\n140,0,656},{7,0,726},{152,0,9},{4,10,917},{133,10,1005},{135,10,1598},{134,11,\n491},{4,10,919},{133,11,434},{137,0,72},{6,0,1269},{6,0,1566},{134,0,1621},{4,10\n,255},{5,10,302},{6,10,132},{7,10,128},{7,10,283},{7,10,1299},{9,0,463},{10,0,\n595},{10,10,52},{10,10,514},{11,10,925},{13,10,92},{142,10,309},{135,0,1454},{\n134,0,1287},{9,10,173},{11,0,600},{141,0,245},{136,0,989},{7,0,164},{7,0,1571},{\n9,0,107},{140,0,225},{6,0,1061},{141,10,442},{4,0,27},{5,0,484},{5,0,510},{6,0,\n434},{7,0,1000},{7,0,1098},{136,0,2},{7,11,85},{7,11,247},{8,11,585},{10,11,163}\n,{138,11,316},{11,11,103},{142,11,0},{134,0,1127},{4,0,460},{134,0,852},{134,10,\n210},{4,0,932},{133,0,891},{6,0,588},{147,11,83},{4,10,284},{6,10,223},{136,0,\n625},{134,0,76},{8,0,92},{137,0,221},{4,11,124},{10,11,457},{11,11,121},{11,11,\n169},{11,11,422},{11,11,870},{12,11,214},{13,11,389},{14,11,187},{143,11,77},{9,\n11,618},{138,11,482},{4,10,218},{7,10,526},{143,10,137},{4,10,270},{5,10,192},{6\n,10,332},{7,10,1322},{13,0,9},{14,0,104},{142,0,311},{140,10,661},{135,11,1193},\n{6,11,107},{7,11,638},{7,11,1632},{137,11,396},{132,0,763},{4,0,622},{5,11,370},\n{134,11,1756},{133,0,253},{135,0,546},{5,11,204},{9,0,73},{10,0,110},{14,0,185},\n{145,0,119},{7,0,624},{7,0,916},{10,0,256},{139,0,87},{7,10,379},{8,10,481},{137\n,10,377},{5,0,212},{5,11,970},{6,11,1706},{12,0,35},{141,0,382},{5,10,1003},{6,\n10,149},{137,0,746},{8,10,262},{9,10,627},{10,0,150},{11,0,849},{11,10,214},{11,\n10,404},{11,10,457},{11,10,780},{11,10,913},{13,0,330},{13,10,401},{142,10,200},\n{134,0,1466},{135,11,3},{4,11,35},{5,11,121},{5,11,483},{5,11,685},{6,0,1299},{6\n,11,489},{7,11,1204},{136,11,394},{135,10,742},{4,10,142},{136,10,304},{4,11,921\n},{133,11,1007},{134,0,1518},{6,0,1229},{135,0,1175},{133,0,816},{4,10,471},{4,\n11,712},{5,10,51},{6,10,602},{7,10,925},{8,10,484},{10,10,195},{140,0,159},{134,\n11,1629},{5,0,869},{5,0,968},{6,0,1626},{8,0,734},{136,0,784},{4,0,542},{6,0,\n1716},{6,0,1727},{7,0,1082},{7,0,1545},{8,0,56},{8,0,118},{8,0,412},{8,0,564},{8\n,10,688},{9,0,888},{9,0,908},{10,0,50},{10,0,423},{11,0,685},{11,0,697},{11,0,\n933},{12,0,299},{13,0,126},{13,0,136},{13,0,170},{141,0,190},{132,10,697},{4,0,\n232},{9,0,202},{10,0,474},{140,0,433},{136,0,212},{6,0,108},{7,0,1003},{7,0,1181\n},{8,0,111},{136,0,343},{5,10,221},{135,11,1255},{133,11,485},{134,0,1712},{142,\n0,216},{4,11,285},{5,0,643},{5,11,317},{6,0,516},{6,11,301},{7,11,7},{8,11,153},\n{10,11,766},{11,11,468},{12,11,467},{141,11,143},{4,0,133},{7,0,711},{7,0,1298},\n{135,0,1585},{134,0,650},{135,11,512},{6,0,99},{7,0,1808},{145,0,57},{6,0,246},{\n6,0,574},{7,0,428},{9,0,793},{10,0,669},{11,0,485},{11,0,840},{12,0,300},{14,0,\n250},{145,0,55},{4,10,132},{5,10,69},{135,10,1242},{136,0,1023},{4,10,111},{135,\n0,302},{135,0,1871},{132,0,728},{4,10,767},{137,0,252},{6,0,461},{7,0,1590},{7,\n10,1416},{7,10,2005},{8,10,131},{8,10,466},{9,10,672},{13,10,252},{148,10,103},{\n6,0,323},{135,0,1564},{7,0,461},{136,0,775},{6,10,44},{136,10,368},{139,0,172},{\n132,0,464},{4,10,570},{133,10,120},{137,11,269},{6,10,227},{135,10,1589},{6,11,\n1719},{6,11,1735},{7,11,2016},{7,11,2020},{8,11,837},{137,11,852},{7,0,727},{146\n,0,73},{132,0,1023},{135,11,852},{135,10,1529},{136,0,577},{138,11,568},{134,0,\n1037},{8,11,67},{138,11,419},{4,0,413},{5,0,677},{8,0,432},{140,0,280},{6,10,\n1667},{7,10,2036},{7,11,967},{10,0,600},{141,11,11},{6,10,511},{140,10,132},{5,\n10,568},{6,0,799},{6,10,138},{135,10,1293},{4,10,565},{8,0,159},{136,10,827},{7,\n0,646},{7,0,1730},{11,0,446},{141,0,178},{4,10,922},{133,10,1023},{135,11,11},{\n132,0,395},{7,10,1002},{139,0,145},{9,0,174},{10,0,164},{11,0,440},{11,0,514},{\n11,0,841},{15,0,98},{149,0,20},{134,0,426},{10,0,608},{139,0,1002},{7,11,320},{8\n,11,51},{12,11,481},{12,11,570},{148,11,106},{4,11,445},{9,0,977},{137,0,983},{\n138,0,250},{139,0,100},{6,0,1982},{136,10,402},{133,11,239},{4,10,716},{141,10,\n31},{5,0,476},{7,11,83},{7,11,1990},{8,11,130},{139,11,720},{8,10,691},{136,10,\n731},{5,11,123},{6,11,530},{7,11,348},{135,11,1419},{5,0,76},{6,0,458},{6,0,497}\n,{7,0,868},{9,0,658},{10,0,594},{11,0,173},{11,0,566},{12,0,20},{12,0,338},{141,\n0,200},{9,11,139},{10,11,399},{11,11,469},{12,11,634},{141,11,223},{9,10,840},{\n138,10,803},{133,10,847},{11,11,223},{140,11,168},{132,11,210},{8,0,447},{9,10,\n53},{9,10,268},{9,10,901},{10,10,518},{10,10,829},{11,10,188},{13,10,74},{14,10,\n46},{15,10,17},{15,10,33},{17,10,40},{18,10,36},{19,10,20},{22,10,1},{152,10,2},\n{4,0,526},{7,0,1029},{135,0,1054},{19,11,59},{150,11,2},{4,0,636},{6,0,1875},{6,\n0,1920},{8,10,532},{9,0,999},{12,0,807},{12,0,825},{15,0,179},{15,0,190},{146,0,\n182},{6,0,1699},{7,0,660},{7,0,1124},{17,0,31},{19,0,22},{151,0,14},{135,10,681}\n,{132,11,430},{140,10,677},{4,10,684},{136,10,384},{132,11,756},{133,11,213},{7,\n0,188},{7,10,110},{8,10,290},{8,10,591},{9,10,382},{9,10,649},{11,10,71},{11,10,\n155},{11,10,313},{12,10,5},{13,10,325},{142,10,287},{7,10,360},{7,10,425},{9,10,\n66},{9,10,278},{138,10,644},{142,11,164},{4,0,279},{7,0,301},{137,0,362},{134,11\n,586},{135,0,1743},{4,0,178},{133,0,399},{4,10,900},{133,10,861},{5,10,254},{7,\n10,985},{136,10,73},{133,11,108},{7,10,1959},{136,10,683},{133,11,219},{4,11,193\n},{5,11,916},{7,11,364},{10,11,398},{10,11,726},{11,11,317},{11,11,626},{12,11,\n142},{12,11,288},{12,11,678},{13,11,313},{15,11,113},{18,11,114},{21,11,30},{150\n,11,53},{6,11,241},{7,11,907},{8,11,832},{9,11,342},{10,11,729},{11,11,284},{11,\n11,445},{11,11,651},{11,11,863},{13,11,398},{146,11,99},{132,0,872},{134,0,831},\n{134,0,1692},{6,0,202},{6,0,1006},{9,0,832},{9,11,734},{10,0,636},{11,0,208},{12\n,0,360},{17,0,118},{18,0,27},{148,0,67},{132,10,725},{7,11,993},{138,11,666},{\n134,0,1954},{134,10,196},{7,0,872},{10,0,516},{139,0,167},{133,10,831},{4,11,562\n},{9,11,254},{139,11,879},{137,0,313},{4,0,224},{132,11,786},{8,10,723},{11,0,24\n},{140,0,170},{5,0,546},{7,0,35},{8,0,11},{8,0,12},{9,0,315},{9,0,533},{10,0,802\n},{11,0,166},{12,0,525},{142,0,243},{7,0,1937},{13,10,80},{13,10,437},{145,10,74\n},{5,0,241},{8,0,242},{9,0,451},{10,0,667},{11,0,598},{140,0,429},{150,0,46},{6,\n0,1273},{137,0,830},{5,10,848},{6,10,66},{136,10,764},{6,0,825},{134,0,993},{4,0\n,1006},{4,10,36},{7,10,1387},{10,0,327},{11,10,755},{141,0,271},{134,0,1023},{\n135,0,1580},{4,0,366},{137,0,516},{132,10,887},{6,0,1736},{135,0,1891},{6,11,216\n},{7,11,901},{7,11,1343},{136,11,493},{6,10,165},{138,10,388},{7,11,341},{139,11\n,219},{4,10,719},{135,10,155},{134,0,1935},{132,0,826},{6,0,331},{6,0,1605},{8,0\n,623},{11,0,139},{139,0,171},{135,11,1734},{10,11,115},{11,11,420},{12,11,154},{\n13,11,404},{14,11,346},{15,11,54},{143,11,112},{4,10,353},{6,10,146},{6,10,1789}\n,{7,0,288},{7,10,990},{7,10,1348},{9,10,665},{9,10,898},{11,10,893},{142,10,212}\n,{6,0,916},{134,0,1592},{4,10,45},{7,0,1888},{135,10,1257},{5,11,1011},{136,11,\n701},{139,11,596},{4,11,54},{5,11,666},{7,11,1039},{7,11,1130},{9,11,195},{138,\n11,302},{134,0,1471},{134,0,1570},{132,0,394},{140,10,65},{136,10,816},{135,0,\n1931},{7,0,574},{135,0,1719},{134,11,467},{132,0,658},{6,11,1669},{9,0,781},{10,\n0,144},{11,0,385},{13,0,161},{13,0,228},{13,0,268},{148,0,107},{136,0,374},{135,\n0,735},{4,0,344},{6,0,498},{139,0,323},{6,10,559},{6,10,1691},{7,0,586},{135,0,\n1063},{137,0,155},{133,0,906},{7,11,122},{9,11,259},{10,11,84},{11,11,470},{12,\n11,541},{141,11,379},{134,0,1139},{10,0,108},{139,0,116},{134,10,456},{133,10,\n925},{5,11,82},{5,11,131},{7,11,1755},{8,11,31},{9,11,168},{9,11,764},{139,11,\n869},{134,11,605},{5,11,278},{137,11,68},{4,11,163},{5,11,201},{5,11,307},{5,11,\n310},{6,11,335},{7,11,284},{136,11,165},{135,11,1660},{6,11,33},{135,11,1244},{4\n,0,616},{136,11,483},{4,11,199},{8,0,857},{8,0,902},{8,0,910},{10,0,879},{11,11,\n34},{140,0,726},{136,0,692},{6,10,193},{7,10,240},{7,10,1682},{10,10,51},{10,10,\n640},{11,10,410},{13,10,82},{14,10,247},{14,10,331},{142,10,377},{6,0,823},{134,\n0,983},{139,10,411},{132,0,305},{136,10,633},{138,11,203},{134,0,681},{6,11,326}\n,{7,11,677},{137,11,425},{5,0,214},{7,0,603},{8,0,611},{9,0,686},{10,0,88},{11,0\n,459},{11,0,496},{12,0,463},{12,0,590},{141,0,0},{136,0,1004},{142,0,23},{134,0,\n1703},{147,11,8},{145,11,56},{135,0,1443},{4,10,237},{135,10,514},{6,0,714},{145\n,0,19},{5,11,358},{7,11,473},{7,11,1184},{10,11,662},{13,11,212},{13,11,304},{13\n,11,333},{145,11,98},{4,0,737},{10,0,98},{11,0,294},{12,0,60},{12,0,437},{13,0,\n64},{13,0,380},{142,0,430},{6,10,392},{7,10,65},{135,10,2019},{6,0,1758},{8,0,\n520},{9,0,345},{9,0,403},{142,0,350},{5,0,47},{10,0,242},{138,0,579},{5,0,139},{\n7,0,1168},{138,0,539},{134,0,1459},{13,0,388},{141,11,388},{134,0,253},{7,10,\n1260},{135,10,1790},{9,10,222},{10,0,252},{139,10,900},{140,0,745},{133,11,946},\n{4,0,107},{7,0,613},{8,0,439},{8,0,504},{9,0,501},{10,0,383},{139,0,477},{135,11\n,1485},{132,0,871},{7,11,411},{7,11,590},{8,11,631},{9,11,323},{10,11,355},{11,\n11,491},{12,11,143},{12,11,402},{13,11,73},{14,11,408},{15,11,107},{146,11,71},{\n132,0,229},{132,0,903},{140,0,71},{133,0,549},{4,0,47},{6,0,373},{7,0,452},{7,0,\n543},{7,0,1828},{7,0,1856},{9,0,6},{11,0,257},{139,0,391},{7,11,1467},{8,11,328}\n,{10,11,544},{11,11,955},{13,11,320},{145,11,83},{5,0,980},{134,0,1754},{136,0,\n865},{5,0,705},{137,0,606},{7,0,161},{8,10,201},{136,10,605},{143,11,35},{5,11,\n835},{6,11,483},{140,10,224},{7,0,536},{7,0,1331},{136,0,143},{134,0,1388},{5,0,\n724},{10,0,305},{11,0,151},{12,0,33},{12,0,121},{12,0,381},{17,0,3},{17,0,27},{\n17,0,78},{18,0,18},{19,0,54},{149,0,5},{4,10,523},{133,10,638},{5,0,19},{134,0,\n533},{5,0,395},{5,0,951},{134,0,1776},{135,0,1908},{132,0,846},{6,10,242},{7,10,\n227},{7,10,1581},{8,10,104},{9,10,113},{9,10,220},{9,10,427},{10,0,74},{10,10,\n239},{11,0,663},{11,10,579},{11,10,1023},{12,0,210},{13,0,166},{13,0,310},{13,10\n,4},{13,10,204},{13,10,316},{14,0,373},{18,0,95},{19,0,43},{148,10,86},{9,11,716\n},{11,11,108},{13,11,123},{14,11,252},{19,11,38},{21,11,3},{151,11,11},{8,0,372}\n,{9,0,122},{138,0,175},{132,11,677},{7,11,1374},{136,11,540},{135,10,861},{132,0\n,695},{7,0,497},{9,0,387},{147,0,81},{136,0,937},{134,0,718},{7,0,1328},{136,10,\n494},{132,11,331},{5,11,747},{134,0,1581},{5,0,284},{6,0,49},{6,0,350},{7,0,1},{\n7,0,377},{7,0,1693},{8,0,18},{8,0,678},{9,0,161},{9,0,585},{9,0,671},{9,0,839},{\n11,0,912},{141,0,427},{7,10,1306},{8,10,505},{9,10,482},{10,10,126},{11,10,225},\n{12,10,347},{12,10,449},{13,10,19},{14,10,218},{142,10,435},{10,10,764},{12,10,\n120},{13,10,39},{145,10,127},{4,0,597},{133,10,268},{134,0,1094},{4,0,1008},{134\n,0,1973},{132,0,811},{139,0,908},{135,0,1471},{133,11,326},{4,10,384},{135,10,\n1022},{4,11,691},{7,0,1935},{7,11,1935},{8,0,324},{8,11,324},{9,11,35},{10,11,\n680},{11,11,364},{12,0,42},{12,11,42},{13,11,357},{146,11,16},{135,0,2014},{6,11\n,32},{7,0,2007},{7,11,385},{7,11,757},{7,11,1916},{8,11,37},{8,11,94},{8,11,711}\n,{9,0,101},{9,0,450},{9,11,541},{10,0,66},{10,0,842},{10,11,162},{10,11,795},{11\n,0,536},{11,11,989},{11,11,1010},{12,0,587},{12,11,14},{142,11,308},{139,0,586},\n{135,10,1703},{7,0,1077},{9,10,159},{11,0,28},{140,10,603},{6,0,1221},{136,10,\n583},{6,11,152},{6,11,349},{6,11,1682},{7,11,1252},{8,11,112},{9,11,435},{9,11,\n668},{10,11,290},{10,11,319},{10,11,815},{11,11,180},{11,11,837},{12,11,240},{13\n,11,152},{13,11,219},{142,11,158},{139,0,62},{132,10,515},{8,10,632},{8,10,697},\n{137,10,854},{134,0,1766},{132,11,581},{6,11,126},{7,11,573},{8,11,397},{142,11,\n44},{150,0,28},{4,10,136},{5,10,551},{11,0,670},{150,0,25},{6,0,1665},{7,0,256},\n{7,0,1388},{138,0,499},{4,0,22},{5,0,10},{7,0,1576},{136,0,97},{134,10,1782},{5,\n0,481},{7,10,1287},{9,10,44},{10,10,552},{10,10,642},{11,10,839},{12,10,274},{12\n,10,275},{12,10,372},{13,10,91},{142,10,125},{133,11,926},{7,11,1232},{137,11,\n531},{6,0,134},{7,0,437},{7,0,1824},{9,0,37},{14,0,285},{142,0,371},{7,0,486},{8\n,0,155},{11,0,93},{140,0,164},{6,0,1391},{134,0,1442},{133,11,670},{133,0,591},{\n6,10,147},{7,10,886},{7,11,1957},{9,10,753},{138,10,268},{5,0,380},{5,0,650},{7,\n0,1173},{136,0,310},{4,0,364},{7,0,1156},{7,0,1187},{137,0,409},{135,11,1621},{\n134,0,482},{133,11,506},{4,0,781},{6,0,487},{7,0,926},{8,0,263},{139,0,500},{138\n,10,137},{135,11,242},{139,11,96},{133,10,414},{135,10,1762},{134,0,804},{5,11,\n834},{7,11,1202},{8,11,14},{9,11,481},{137,11,880},{134,10,599},{4,0,94},{135,0,\n1265},{4,0,415},{132,0,417},{5,0,348},{6,0,522},{6,10,1749},{7,11,1526},{138,11,\n465},{134,10,1627},{132,0,1012},{132,10,488},{4,11,357},{6,11,172},{7,11,143},{\n137,11,413},{4,10,83},{4,11,590},{146,11,76},{140,10,676},{7,11,287},{8,11,355},\n{9,11,293},{137,11,743},{134,10,278},{5,11,169},{6,0,1803},{7,11,333},{8,11,45},\n{18,0,165},{152,0,21},{12,10,97},{140,11,97},{4,0,408},{4,0,741},{135,0,500},{\n132,11,198},{7,10,388},{7,10,644},{139,10,781},{4,11,24},{5,11,140},{5,11,185},{\n7,11,1500},{11,11,565},{139,11,838},{6,0,1321},{7,10,229},{8,10,59},{9,0,257},{9\n,10,190},{10,10,378},{140,10,191},{4,11,334},{133,11,593},{135,11,1885},{134,0,\n1138},{4,0,249},{6,0,73},{135,0,177},{133,0,576},{142,0,231},{137,0,288},{132,10\n,660},{7,10,1035},{138,10,737},{135,0,1487},{6,0,989},{7,10,690},{9,0,433},{9,10\n,587},{140,10,521},{7,0,1264},{7,0,1678},{11,0,945},{12,0,341},{12,0,471},{140,0\n,569},{132,11,709},{133,11,897},{5,11,224},{13,11,174},{146,11,52},{135,11,1840}\n,{134,10,1744},{4,10,733},{9,10,194},{10,10,92},{11,10,198},{12,0,87},{12,10,84}\n,{13,10,128},{144,0,74},{140,0,779},{135,0,538},{4,11,608},{133,11,497},{133,0,\n413},{7,11,1375},{7,11,1466},{138,11,331},{136,0,495},{6,11,540},{136,11,136},{7\n,0,54},{8,0,312},{10,0,191},{10,0,614},{140,0,567},{5,11,999},{6,0,468},{7,0,567\n},{7,0,1478},{8,0,530},{142,0,290},{4,11,299},{7,10,306},{135,11,1004},{142,11,\n296},{134,0,1484},{133,10,979},{6,0,609},{9,0,815},{12,11,137},{14,11,9},{14,11,\n24},{142,11,64},{133,11,456},{6,0,484},{135,0,822},{133,10,178},{136,11,180},{\n132,11,755},{137,0,900},{135,0,1335},{6,0,1724},{135,0,2022},{135,11,1139},{4,10\n,390},{133,0,640},{6,0,1831},{138,11,633},{135,11,566},{4,11,890},{5,11,805},{5,\n11,819},{5,11,961},{6,11,396},{6,11,1631},{6,11,1678},{7,11,1967},{7,11,2041},{9\n,11,630},{11,11,8},{11,11,1019},{12,11,176},{13,11,225},{14,11,292},{149,11,24},\n{132,0,474},{134,0,1103},{135,0,1504},{134,0,1576},{6,0,961},{6,0,1034},{140,0,\n655},{11,11,514},{149,11,20},{5,0,305},{135,11,1815},{7,11,1505},{10,11,190},{10\n,11,634},{11,11,792},{12,11,358},{140,11,447},{5,11,0},{6,11,536},{7,11,604},{13\n,11,445},{145,11,126},{5,10,105},{135,0,1236},{4,0,480},{6,0,217},{6,0,302},{6,0\n,1642},{6,11,232},{6,11,412},{7,0,130},{7,0,837},{7,0,1321},{7,0,1547},{7,0,1657\n},{7,11,1074},{8,0,429},{8,11,9},{8,11,157},{8,11,786},{9,0,228},{9,11,196},{9,\n11,352},{9,11,457},{10,11,337},{11,11,232},{11,11,877},{12,11,480},{12,11,546},{\n13,0,289},{13,0,343},{147,0,101},{5,10,438},{7,11,958},{9,10,694},{12,10,627},{\n13,10,210},{141,11,38},{4,11,382},{136,11,579},{7,0,278},{10,0,739},{11,0,708},{\n141,0,348},{4,11,212},{135,11,1206},{135,11,1898},{6,0,708},{6,0,1344},{152,10,\n11},{137,11,768},{134,0,1840},{140,0,233},{8,10,25},{138,10,826},{5,11,655},{134\n,0,2017},{6,0,1488},{139,11,290},{132,10,308},{134,0,1590},{134,0,1800},{134,0,\n1259},{6,11,231},{7,11,95},{8,11,423},{144,0,28},{133,11,300},{135,10,150},{136,\n10,649},{7,11,1874},{137,11,641},{6,11,237},{7,11,611},{8,11,100},{9,11,416},{11\n,11,335},{12,11,173},{146,11,101},{137,0,45},{134,10,521},{14,11,26},{17,0,36},{\n146,11,150},{5,10,339},{7,0,1442},{14,0,22},{15,10,41},{15,10,166},{147,10,66},{\n6,11,581},{7,11,1119},{136,0,378},{134,0,1507},{147,11,117},{139,0,39},{134,0,\n1054},{6,0,363},{7,0,1955},{136,0,725},{134,0,2036},{133,11,199},{6,0,1871},{9,0\n,935},{9,0,961},{9,0,1004},{9,0,1016},{12,0,805},{12,0,852},{12,0,853},{12,0,869\n},{12,0,882},{12,0,896},{12,0,906},{12,0,917},{12,0,940},{15,0,170},{15,0,176},{\n15,0,188},{15,0,201},{15,0,205},{15,0,212},{15,0,234},{15,0,244},{18,0,181},{18,\n0,193},{18,0,196},{18,0,201},{18,0,202},{18,0,210},{18,0,217},{18,0,235},{18,0,\n236},{18,0,237},{21,0,54},{21,0,55},{21,0,58},{21,0,59},{152,0,22},{134,10,1628}\n,{137,0,805},{5,0,813},{135,0,2046},{142,11,42},{5,0,712},{6,0,1240},{11,0,17},{\n13,0,321},{144,0,67},{132,0,617},{135,10,829},{6,0,320},{7,0,781},{7,0,1921},{9,\n0,55},{10,0,186},{10,0,273},{10,0,664},{10,0,801},{11,0,996},{11,0,997},{13,0,\n157},{142,0,170},{136,0,271},{5,10,486},{135,10,1349},{18,11,91},{147,11,70},{7,\n10,1635},{8,10,17},{10,0,445},{138,10,295},{136,11,404},{7,0,103},{7,0,863},{11,\n0,184},{145,0,62},{138,10,558},{137,0,659},{6,11,312},{6,11,1715},{10,11,584},{\n11,11,546},{11,11,692},{12,11,259},{12,11,295},{13,11,46},{141,11,154},{134,0,\n676},{132,11,588},{4,11,231},{5,11,61},{6,11,104},{7,11,729},{7,11,964},{7,11,\n1658},{140,11,414},{6,11,263},{138,11,757},{11,0,337},{142,0,303},{135,11,1363},\n{132,11,320},{140,0,506},{134,10,447},{5,0,77},{7,0,1455},{10,0,843},{147,0,73},\n{7,10,577},{7,10,1432},{9,10,475},{9,10,505},{9,10,526},{9,10,609},{9,10,689},{9\n,10,726},{9,10,735},{9,10,738},{10,10,556},{10,10,674},{10,10,684},{11,10,89},{\n11,10,202},{11,10,272},{11,10,380},{11,10,415},{11,10,505},{11,10,537},{11,10,\n550},{11,10,562},{11,10,640},{11,10,667},{11,10,688},{11,10,847},{11,10,927},{11\n,10,930},{11,10,940},{12,10,144},{12,10,325},{12,10,329},{12,10,389},{12,10,403}\n,{12,10,451},{12,10,515},{12,10,604},{12,10,616},{12,10,626},{13,10,66},{13,10,\n131},{13,10,167},{13,10,236},{13,10,368},{13,10,411},{13,10,434},{13,10,453},{13\n,10,461},{13,10,474},{14,10,59},{14,10,60},{14,10,139},{14,10,152},{14,10,276},{\n14,10,353},{14,10,402},{15,10,28},{15,10,81},{15,10,123},{15,10,152},{18,10,136}\n,{148,10,88},{132,0,458},{135,0,1420},{4,10,609},{4,11,405},{6,0,109},{7,10,756}\n,{7,11,817},{9,10,544},{10,0,382},{11,10,413},{14,10,307},{14,11,58},{16,10,25},\n{17,11,37},{146,11,124},{5,11,974},{6,0,330},{7,0,1084},{139,0,142},{4,10,930},{\n133,10,947},{5,10,939},{142,11,394},{16,0,91},{145,0,87},{5,10,962},{5,11,235},{\n7,11,1239},{11,11,131},{140,11,370},{5,10,651},{8,10,170},{9,10,61},{9,10,63},{\n10,10,23},{10,10,37},{10,10,834},{11,0,492},{11,10,4},{11,10,281},{11,10,503},{\n11,10,677},{12,10,96},{12,10,130},{12,10,244},{14,10,5},{14,10,40},{14,10,162},{\n14,10,202},{146,10,133},{4,10,406},{5,10,579},{12,10,492},{150,10,15},{9,11,137}\n,{138,11,221},{134,0,1239},{11,0,211},{140,0,145},{7,11,390},{138,11,140},{135,\n11,1418},{135,11,1144},{134,0,1049},{6,10,17},{7,0,321},{7,10,1001},{7,10,1982},\n{9,10,886},{10,10,489},{10,10,800},{11,10,782},{12,10,320},{13,10,467},{14,10,\n145},{14,10,387},{143,10,119},{145,10,17},{5,11,407},{11,11,489},{19,11,37},{20,\n11,73},{150,11,38},{133,10,458},{135,0,1985},{7,10,1983},{8,10,0},{8,10,171},{9,\n10,120},{9,10,732},{10,10,473},{11,10,656},{11,10,998},{18,10,0},{18,10,2},{147,\n10,21},{5,11,325},{7,11,1483},{8,11,5},{8,11,227},{9,11,105},{10,11,585},{140,11\n,614},{136,0,122},{132,0,234},{135,11,1196},{6,0,976},{6,0,1098},{134,0,1441},{7\n,0,253},{136,0,549},{6,11,621},{13,11,504},{144,11,19},{132,10,519},{5,0,430},{5\n,0,932},{6,0,131},{7,0,417},{9,0,522},{11,0,314},{141,0,390},{14,0,149},{14,0,\n399},{143,0,57},{5,10,907},{6,10,31},{6,11,218},{7,10,491},{7,10,530},{8,10,592}\n,{11,10,53},{11,10,779},{12,10,167},{12,10,411},{14,10,14},{14,10,136},{15,10,72\n},{16,10,17},{144,10,72},{140,11,330},{7,11,454},{7,11,782},{136,11,768},{132,0,\n507},{10,11,676},{140,11,462},{4,10,208},{5,10,106},{6,0,630},{6,10,531},{8,10,\n408},{9,0,811},{9,10,188},{138,10,572},{4,0,343},{5,0,511},{134,10,1693},{134,11\n,164},{132,0,448},{7,0,455},{138,0,591},{135,0,1381},{12,10,441},{150,11,50},{9,\n10,449},{10,10,192},{138,10,740},{4,10,241},{134,0,575},{134,0,1175},{134,0,653}\n,{134,0,1761},{134,0,1198},{132,10,259},{6,11,343},{7,11,195},{9,11,226},{10,11,\n197},{10,11,575},{11,11,502},{139,11,899},{7,0,1127},{7,0,1572},{10,0,297},{10,0\n,422},{11,0,764},{11,0,810},{12,0,264},{13,0,102},{13,0,300},{13,0,484},{14,0,\n147},{14,0,229},{17,0,71},{18,0,118},{147,0,120},{135,11,666},{132,0,678},{4,10,\n173},{5,10,312},{5,10,512},{135,10,1285},{7,10,1603},{7,10,1691},{9,10,464},{11,\n10,195},{12,10,279},{12,10,448},{14,10,11},{147,10,102},{16,0,99},{146,0,164},{7\n,11,1125},{9,11,143},{11,11,61},{14,11,405},{150,11,21},{137,11,260},{4,10,452},\n{5,10,583},{5,10,817},{6,10,433},{7,10,593},{7,10,720},{7,10,1378},{8,10,161},{9\n,10,284},{10,10,313},{139,10,886},{132,10,547},{136,10,722},{14,0,35},{142,0,191\n},{141,0,45},{138,0,121},{132,0,125},{134,0,1622},{133,11,959},{8,10,420},{139,\n10,193},{132,0,721},{135,10,409},{136,0,145},{7,0,792},{8,0,147},{8,11,173},{10,\n0,821},{11,0,970},{139,0,1021},{134,11,266},{132,0,715},{7,0,1999},{138,10,308},\n{133,0,531},{5,0,168},{5,0,930},{8,0,74},{9,0,623},{12,0,500},{140,0,579},{144,0\n,65},{138,11,246},{6,0,220},{7,0,1101},{13,0,105},{142,11,314},{5,10,1002},{136,\n10,745},{134,0,960},{20,0,0},{148,11,0},{4,0,1005},{4,10,239},{6,10,477},{7,10,\n1607},{11,10,68},{139,10,617},{6,0,19},{7,0,1413},{139,0,428},{149,10,13},{7,0,\n96},{8,0,401},{8,0,703},{8,11,300},{137,0,896},{134,0,1595},{145,0,116},{136,0,\n1021},{7,0,1961},{7,0,1965},{7,0,2030},{8,0,150},{8,0,702},{8,0,737},{8,0,750},{\n140,0,366},{11,11,75},{142,11,267},{132,10,367},{5,11,427},{5,11,734},{7,11,478}\n,{8,0,800},{8,11,52},{9,0,148},{9,0,872},{9,0,890},{11,0,309},{11,0,1001},{13,0,\n267},{141,0,323},{7,11,239},{11,11,217},{142,11,165},{132,11,323},{140,11,419},{\n13,0,299},{142,0,75},{6,11,87},{6,11,1734},{7,11,20},{7,11,1056},{8,11,732},{9,\n11,406},{9,11,911},{138,11,694},{134,0,1383},{132,10,694},{133,11,613},{137,0,\n779},{4,0,598},{140,10,687},{6,0,970},{135,0,424},{133,0,547},{7,11,32},{7,11,\n984},{8,11,85},{8,11,709},{9,11,579},{9,11,847},{9,11,856},{10,11,799},{11,11,\n258},{11,11,1007},{12,11,331},{12,11,615},{13,11,188},{13,11,435},{14,11,8},{15,\n11,165},{16,11,27},{148,11,40},{6,0,1222},{134,0,1385},{132,0,876},{138,11,151},\n{135,10,213},{4,11,167},{135,11,82},{133,0,133},{6,11,24},{7,11,74},{7,11,678},{\n137,11,258},{5,11,62},{6,11,534},{7,11,684},{7,11,1043},{7,11,1072},{8,11,280},{\n8,11,541},{8,11,686},{10,11,519},{11,11,252},{140,11,282},{136,0,187},{8,0,8},{\n10,0,0},{10,0,818},{139,0,988},{132,11,359},{7,10,1672},{11,0,429},{143,0,51},{\n136,0,685},{5,11,211},{7,11,88},{136,11,627},{134,0,472},{136,0,132},{6,11,145},\n{141,11,336},{4,10,751},{11,10,390},{140,10,32},{4,10,409},{4,11,263},{5,10,78},\n{6,0,938},{134,0,1060},{137,0,874},{4,11,916},{6,10,473},{7,10,1602},{8,0,774},{\n10,0,670},{10,10,698},{12,0,51},{12,10,212},{13,10,307},{145,10,105},{146,0,92},\n{143,10,156},{132,0,830},{137,0,701},{4,11,599},{6,11,1634},{7,11,5},{7,11,55},{\n7,11,67},{7,11,97},{7,11,691},{7,11,979},{7,11,1697},{8,11,207},{8,11,214},{8,11\n,231},{8,11,294},{8,11,336},{8,11,428},{8,11,451},{8,11,460},{8,11,471},{8,11,\n622},{8,11,626},{8,11,679},{8,11,759},{8,11,829},{9,11,11},{9,11,246},{9,11,484}\n,{9,11,573},{9,11,706},{9,11,762},{9,11,798},{9,11,855},{9,11,870},{9,11,912},{\n10,11,303},{10,11,335},{10,11,424},{10,11,461},{10,11,543},{10,11,759},{10,11,\n814},{11,11,59},{11,11,199},{11,11,235},{11,11,475},{11,11,590},{11,11,929},{11,\n11,963},{12,11,114},{12,11,182},{12,11,226},{12,11,332},{12,11,439},{12,11,575},\n{12,11,598},{13,11,8},{13,11,125},{13,11,194},{13,11,287},{14,11,197},{14,11,383\n},{15,11,53},{17,11,63},{19,11,46},{19,11,98},{19,11,106},{148,11,85},{4,0,127},\n{5,0,350},{6,0,356},{8,0,426},{9,0,572},{10,0,247},{139,0,312},{134,0,1215},{6,0\n,59},{7,11,1853},{9,0,603},{10,11,437},{141,0,397},{134,0,1762},{147,11,126},{\n135,10,883},{13,0,293},{142,0,56},{133,10,617},{139,10,50},{5,11,187},{7,10,1518\n},{139,10,694},{135,0,441},{6,0,111},{7,0,4},{8,0,163},{8,0,776},{138,0,566},{\n132,0,806},{4,11,215},{9,11,38},{10,11,3},{11,11,23},{11,11,127},{139,11,796},{4\n,10,546},{7,10,2042},{142,0,233},{135,0,1994},{134,0,1739},{135,11,1530},{136,0,\n393},{5,0,297},{7,0,1038},{14,0,359},{19,0,52},{148,0,47},{135,0,309},{4,10,313}\n,{133,10,577},{8,10,184},{141,10,433},{135,10,935},{12,10,186},{12,10,292},{14,\n10,100},{146,10,70},{136,0,363},{11,10,402},{12,10,109},{12,10,431},{13,10,179},\n{13,10,206},{14,0,175},{14,10,217},{16,10,3},{148,10,53},{5,10,886},{6,10,46},{6\n,10,1790},{7,10,14},{7,10,732},{7,10,1654},{8,10,95},{8,10,327},{8,10,616},{9,10\n,892},{10,10,598},{10,10,769},{11,10,134},{11,10,747},{12,10,378},{142,10,97},{\n136,0,666},{135,0,1675},{6,0,655},{134,0,1600},{135,0,808},{133,10,1021},{4,11,\n28},{5,11,440},{7,11,248},{11,11,833},{140,11,344},{134,11,1654},{132,0,280},{\n140,0,54},{4,0,421},{133,0,548},{132,10,153},{6,11,339},{135,11,923},{133,11,853\n},{133,10,798},{132,10,587},{6,11,249},{7,11,1234},{139,11,573},{6,10,598},{7,10\n,42},{8,10,695},{10,10,212},{11,10,158},{14,10,196},{145,10,85},{5,10,957},{5,10\n,1008},{135,0,249},{4,10,129},{135,10,465},{6,0,254},{7,0,842},{7,0,1659},{7,10,\n908},{7,10,1201},{9,0,109},{9,10,755},{10,0,103},{11,10,906},{12,10,527},{146,10\n,7},{5,0,262},{136,10,450},{144,0,1},{10,11,201},{142,11,319},{7,11,49},{7,11,\n392},{8,11,20},{8,11,172},{8,11,690},{9,11,383},{9,11,845},{10,11,48},{11,11,293\n},{11,11,832},{11,11,920},{141,11,221},{5,11,858},{133,11,992},{134,0,805},{139,\n10,1003},{6,0,1630},{134,11,307},{7,11,1512},{135,11,1794},{6,11,268},{137,11,62\n},{135,10,1868},{133,0,671},{4,0,989},{8,0,972},{136,0,998},{132,11,423},{132,0,\n889},{135,0,1382},{135,0,1910},{7,10,965},{7,10,1460},{135,10,1604},{4,0,627},{5\n,0,775},{138,11,106},{134,11,348},{7,0,202},{11,0,362},{11,0,948},{140,0,388},{\n138,11,771},{6,11,613},{136,11,223},{6,0,560},{7,0,451},{8,0,389},{12,0,490},{13\n,0,16},{13,0,215},{13,0,351},{18,0,132},{147,0,125},{135,0,841},{136,0,566},{136\n,0,938},{132,11,670},{5,0,912},{6,0,1695},{140,11,55},{9,11,40},{139,11,136},{7,\n0,1361},{7,10,982},{10,10,32},{143,10,56},{11,11,259},{140,11,270},{5,0,236},{6,\n0,572},{8,0,492},{11,0,618},{144,0,56},{8,11,572},{9,11,310},{9,11,682},{137,11,\n698},{134,0,1854},{5,0,190},{136,0,318},{133,10,435},{135,0,1376},{4,11,296},{6,\n11,352},{7,11,401},{7,11,1410},{7,11,1594},{7,11,1674},{8,11,63},{8,11,660},{137\n,11,74},{5,10,85},{6,10,419},{7,0,349},{7,10,305},{7,10,361},{7,10,1337},{8,10,\n71},{140,10,519},{4,11,139},{4,11,388},{140,11,188},{6,0,1972},{6,0,2013},{8,0,\n951},{10,0,947},{10,0,974},{10,0,1018},{142,0,476},{140,10,688},{135,10,740},{5,\n10,691},{7,10,345},{9,10,94},{140,10,169},{5,10,183},{6,10,582},{9,0,344},{10,10\n,679},{140,10,435},{135,10,511},{132,0,850},{8,11,441},{10,11,314},{143,11,3},{7\n,10,1993},{136,10,684},{4,11,747},{6,10,583},{6,11,290},{7,11,649},{7,11,1479},{\n135,11,1583},{133,11,232},{133,10,704},{134,0,910},{4,10,179},{5,10,198},{133,10\n,697},{7,10,347},{7,10,971},{8,10,181},{138,10,711},{136,11,525},{14,0,19},{14,0\n,28},{144,0,29},{7,0,85},{7,0,247},{8,0,585},{138,0,163},{4,0,487},{7,11,472},{7\n,11,1801},{10,11,748},{141,11,458},{4,10,243},{5,10,203},{7,10,19},{7,10,71},{7,\n10,113},{10,10,405},{11,10,357},{142,10,240},{7,10,1450},{139,10,99},{132,11,425\n},{138,0,145},{147,0,83},{6,10,492},{137,11,247},{4,0,1013},{134,0,2033},{5,10,\n134},{6,10,408},{6,10,495},{135,10,1593},{135,0,1922},{134,11,1768},{4,0,124},{\n10,0,457},{11,0,121},{11,0,169},{11,0,870},{11,0,874},{12,0,214},{14,0,187},{143\n,0,77},{5,0,557},{135,0,1457},{139,0,66},{5,11,943},{6,11,1779},{142,10,4},{4,10\n,248},{4,10,665},{7,10,137},{137,10,349},{5,11,245},{6,11,576},{7,0,1193},{7,11,\n582},{136,11,225},{144,0,82},{7,10,1270},{139,10,612},{5,0,454},{10,0,352},{138,\n11,352},{5,10,371},{7,10,563},{146,0,57},{135,0,1333},{6,0,107},{6,11,610},{7,0,\n638},{7,0,1632},{137,0,396},{5,0,370},{134,0,1756},{4,10,374},{7,10,547},{7,10,\n1700},{7,10,1833},{139,10,858},{133,0,204},{6,0,1305},{9,10,311},{141,10,42},{5,\n0,970},{134,0,1706},{6,10,1647},{7,10,1552},{7,10,2010},{9,10,494},{137,10,509},\n{13,11,455},{15,11,99},{15,11,129},{144,11,68},{135,0,3},{4,0,35},{5,0,121},{5,0\n,483},{5,0,685},{6,0,489},{6,0,782},{6,0,1032},{7,0,1204},{136,0,394},{4,0,921},\n{133,0,1007},{8,11,360},{138,11,63},{135,0,1696},{134,0,1519},{132,11,443},{135,\n11,944},{6,10,123},{7,10,214},{9,10,728},{10,10,157},{11,10,346},{11,10,662},{\n143,10,106},{137,0,981},{135,10,1435},{134,0,1072},{132,0,712},{134,0,1629},{134\n,0,728},{4,11,298},{137,11,483},{5,11,164},{6,0,1177},{6,0,1271},{7,11,121},{142\n,11,189},{4,10,707},{5,10,588},{6,10,393},{7,0,1608},{13,10,106},{18,10,49},{147\n,10,41},{23,0,16},{151,11,16},{6,10,211},{7,10,1690},{11,10,486},{140,10,369},{\n133,0,485},{19,11,15},{149,11,27},{4,11,172},{9,11,611},{10,11,436},{12,11,673},\n{141,11,255},{5,11,844},{10,11,484},{11,11,754},{12,11,457},{14,11,171},{14,11,\n389},{146,11,153},{4,0,285},{5,0,27},{5,0,317},{6,0,301},{7,0,7},{8,0,153},{10,0\n,766},{11,0,468},{12,0,467},{141,0,143},{134,0,1462},{9,11,263},{10,11,147},{138\n,11,492},{133,11,537},{6,0,1945},{6,0,1986},{6,0,1991},{134,0,2038},{134,10,219}\n,{137,11,842},{5,10,582},{6,10,1646},{7,10,99},{7,10,1962},{7,10,1986},{8,10,515\n},{8,10,773},{9,10,23},{9,10,491},{12,10,620},{14,0,52},{14,10,93},{145,0,50},{\n138,11,97},{5,10,851},{20,0,21},{148,0,44},{136,0,819},{139,0,917},{5,11,230},{5\n,11,392},{6,11,420},{8,10,762},{8,10,812},{9,10,910},{9,11,568},{140,11,612},{\n135,0,784},{15,0,135},{143,11,135},{10,0,454},{140,0,324},{4,11,0},{5,11,41},{7,\n11,1459},{7,11,1469},{7,11,1618},{7,11,1859},{9,11,549},{139,11,905},{4,10,98},{\n7,10,1365},{9,10,422},{9,10,670},{10,10,775},{11,10,210},{13,10,26},{13,10,457},\n{141,10,476},{6,0,1719},{6,0,1735},{7,0,2016},{7,0,2020},{8,0,837},{137,0,852},{\n133,11,696},{135,0,852},{132,0,952},{134,10,1730},{132,11,771},{138,0,568},{137,\n0,448},{139,0,146},{8,0,67},{138,0,419},{133,11,921},{137,10,147},{134,0,1826},{\n10,0,657},{14,0,297},{142,0,361},{6,0,666},{6,0,767},{134,0,1542},{139,0,729},{6\n,11,180},{7,11,1137},{8,11,751},{139,11,805},{4,11,183},{7,11,271},{11,11,824},{\n11,11,952},{13,11,278},{13,11,339},{13,11,482},{14,11,424},{148,11,99},{4,0,669}\n,{5,11,477},{5,11,596},{6,11,505},{7,11,1221},{11,11,907},{12,11,209},{141,11,\n214},{135,11,1215},{5,0,402},{6,10,30},{11,10,56},{139,10,305},{7,11,564},{142,\n11,168},{139,0,152},{7,0,912},{135,10,1614},{4,10,150},{5,10,303},{134,10,327},{\n7,0,320},{8,0,51},{9,0,868},{10,0,833},{12,0,481},{12,0,570},{148,0,106},{132,0,\n445},{7,11,274},{11,11,263},{11,11,479},{11,11,507},{140,11,277},{6,11,1645},{8,\n10,192},{10,0,555},{10,10,78},{11,0,308},{13,10,359},{147,0,95},{135,10,786},{6,\n11,92},{6,11,188},{7,11,1269},{7,11,1524},{7,11,1876},{10,11,228},{139,11,1020},\n{4,11,459},{133,11,966},{6,10,1638},{7,10,79},{7,10,496},{9,10,138},{10,10,336},\n{11,0,386},{12,10,412},{12,10,440},{142,10,305},{133,0,239},{7,0,83},{7,0,1990},\n{8,0,130},{139,0,720},{138,11,709},{4,0,143},{5,0,550},{133,0,752},{5,0,123},{6,\n0,530},{7,0,348},{135,0,1419},{135,0,2024},{6,11,18},{7,11,179},{7,11,721},{7,11\n,932},{8,11,548},{8,11,757},{9,11,54},{9,11,65},{9,11,532},{9,11,844},{10,11,113\n},{10,11,117},{10,11,236},{10,11,315},{10,11,430},{10,11,798},{11,11,153},{11,11\n,351},{11,11,375},{12,11,78},{12,11,151},{12,11,392},{14,11,248},{143,11,23},{7,\n10,204},{7,10,415},{8,10,42},{10,10,85},{139,10,564},{134,0,958},{133,11,965},{\n132,0,210},{135,11,1429},{138,11,480},{134,11,182},{139,11,345},{10,11,65},{10,\n11,488},{138,11,497},{4,10,3},{5,10,247},{5,10,644},{7,10,744},{7,10,1207},{7,10\n,1225},{7,10,1909},{146,10,147},{132,0,430},{5,10,285},{9,10,67},{13,10,473},{\n143,10,82},{144,11,16},{7,11,1162},{9,11,588},{10,11,260},{151,10,8},{133,0,213}\n,{138,0,7},{135,0,801},{134,11,1786},{135,11,308},{6,0,936},{134,0,1289},{133,0,\n108},{132,0,885},{133,0,219},{139,0,587},{4,0,193},{5,0,916},{6,0,1041},{7,0,364\n},{10,0,398},{10,0,726},{11,0,317},{11,0,626},{12,0,142},{12,0,288},{12,0,678},{\n13,0,313},{15,0,113},{146,0,114},{135,0,1165},{6,0,241},{9,0,342},{10,0,729},{11\n,0,284},{11,0,445},{11,0,651},{11,0,863},{13,0,398},{146,0,99},{7,0,907},{136,0,\n832},{4,10,29},{6,10,532},{7,10,1628},{7,10,1648},{9,0,303},{9,10,350},{10,10,\n433},{11,10,97},{11,10,557},{11,10,745},{12,10,289},{12,10,335},{12,10,348},{12,\n10,606},{13,10,116},{13,10,233},{13,10,466},{14,10,181},{14,10,209},{14,10,232},\n{14,10,236},{14,10,300},{16,10,41},{148,10,97},{7,10,1692},{7,11,423},{136,11,\n588},{6,0,931},{134,0,1454},{5,10,501},{7,10,1704},{9,10,553},{11,10,520},{12,10\n,557},{141,10,249},{136,11,287},{4,0,562},{9,0,254},{139,0,879},{132,0,786},{14,\n11,32},{18,11,85},{20,11,2},{152,11,16},{135,0,1294},{7,11,723},{135,11,1135},{6\n,0,216},{6,11,403},{7,0,901},{7,0,1343},{136,0,493},{7,11,719},{8,11,809},{136,\n11,834},{5,11,210},{6,11,213},{7,11,60},{10,11,364},{139,11,135},{5,11,607},{7,0\n,341},{8,11,326},{8,11,490},{139,0,219},{4,11,701},{5,11,472},{5,11,639},{7,11,\n1249},{9,11,758},{139,11,896},{135,11,380},{135,11,1947},{139,0,130},{135,0,1734\n},{10,0,115},{11,0,420},{12,0,154},{13,0,404},{14,0,346},{143,0,54},{134,10,129}\n,{4,11,386},{7,11,41},{8,11,405},{9,11,497},{11,11,110},{11,11,360},{15,11,37},{\n144,11,84},{141,11,282},{5,11,46},{7,11,1452},{7,11,1480},{8,11,634},{140,11,472\n},{4,11,524},{136,11,810},{10,11,238},{141,11,33},{133,0,604},{5,0,1011},{136,0,\n701},{8,0,856},{8,0,858},{8,0,879},{12,0,702},{142,0,447},{4,0,54},{5,0,666},{7,\n0,1039},{7,0,1130},{9,0,195},{138,0,302},{4,10,25},{5,10,60},{6,10,504},{7,10,\n614},{7,10,1155},{140,10,0},{7,10,1248},{11,10,621},{139,10,702},{133,11,997},{\n137,10,321},{134,0,1669},{134,0,1791},{4,10,379},{135,10,1397},{138,11,372},{5,\n11,782},{5,11,829},{134,11,1738},{135,0,1228},{4,10,118},{6,10,274},{6,10,361},{\n7,10,75},{141,10,441},{132,0,623},{9,11,279},{10,11,407},{14,11,84},{150,11,18},\n{137,10,841},{135,0,798},{140,10,693},{5,10,314},{6,10,221},{7,10,419},{10,10,\n650},{11,10,396},{12,10,156},{13,10,369},{14,10,333},{145,10,47},{135,11,1372},{\n7,0,122},{9,0,259},{10,0,84},{11,0,470},{12,0,541},{141,0,379},{134,0,837},{4,11\n,78},{5,11,96},{5,11,182},{7,11,1724},{7,11,1825},{8,0,1013},{10,11,394},{10,11,\n471},{11,11,532},{14,11,340},{145,11,88},{134,0,577},{135,11,1964},{132,10,913},\n{134,0,460},{8,0,891},{10,0,901},{10,0,919},{10,0,932},{12,0,715},{12,0,728},{12\n,0,777},{14,0,457},{144,0,103},{5,0,82},{5,0,131},{7,0,1755},{8,0,31},{9,0,168},\n{9,0,764},{139,0,869},{136,10,475},{5,10,1016},{6,0,605},{9,11,601},{9,11,619},{\n10,11,505},{10,11,732},{11,11,355},{140,11,139},{7,10,602},{8,10,179},{10,10,781\n},{140,10,126},{134,0,1246},{6,10,329},{138,10,111},{6,11,215},{7,11,1028},{7,11\n,1473},{7,11,1721},{9,11,424},{138,11,779},{5,0,278},{137,0,68},{6,0,932},{6,0,\n1084},{144,0,86},{4,0,163},{5,0,201},{5,0,307},{5,0,310},{6,0,335},{7,0,284},{7,\n0,1660},{136,0,165},{136,0,781},{134,0,707},{6,0,33},{135,0,1244},{5,10,821},{6,\n10,1687},{6,11,67},{7,11,258},{7,11,1630},{9,11,354},{9,11,675},{10,11,830},{14,\n11,80},{145,11,80},{6,11,141},{7,11,225},{9,11,59},{9,11,607},{10,11,312},{11,11\n,687},{12,11,555},{13,11,373},{13,11,494},{148,11,58},{134,0,1113},{5,10,71},{7,\n10,1407},{9,0,388},{9,10,704},{10,10,261},{10,10,619},{11,10,547},{11,10,619},{\n143,10,157},{7,0,1953},{136,0,720},{138,0,203},{7,10,2008},{9,10,337},{138,10,\n517},{6,0,326},{7,0,677},{137,0,425},{139,11,81},{7,0,1316},{7,0,1412},{7,0,1839\n},{9,0,589},{11,0,241},{11,0,676},{11,0,811},{11,0,891},{12,0,140},{12,0,346},{\n12,0,479},{13,0,140},{13,0,381},{14,0,188},{18,0,30},{148,0,108},{5,0,416},{6,10\n,86},{6,10,603},{7,10,292},{7,10,561},{8,10,257},{8,10,382},{9,10,721},{9,10,778\n},{11,10,581},{140,10,466},{4,10,486},{133,10,491},{134,0,1300},{132,10,72},{6,\n10,265},{7,0,847},{7,11,430},{139,11,46},{5,11,602},{6,11,106},{7,11,1786},{7,11\n,1821},{7,11,2018},{9,11,418},{137,11,763},{5,0,358},{7,0,535},{7,0,1184},{10,0,\n662},{13,0,212},{13,0,304},{13,0,333},{145,0,98},{5,11,65},{6,11,416},{7,11,1720\n},{7,11,1924},{8,11,677},{10,11,109},{11,11,14},{11,11,70},{11,11,569},{11,11,\n735},{15,11,153},{148,11,80},{6,0,1823},{8,0,839},{8,0,852},{8,0,903},{10,0,940}\n,{12,0,707},{140,0,775},{135,11,1229},{6,0,1522},{140,0,654},{136,11,595},{139,0\n,163},{141,0,314},{132,0,978},{4,0,601},{6,0,2035},{137,10,234},{5,10,815},{6,10\n,1688},{134,10,1755},{133,0,946},{136,0,434},{6,10,197},{136,10,205},{7,0,411},{\n7,0,590},{8,0,631},{9,0,323},{10,0,355},{11,0,491},{12,0,143},{12,0,402},{13,0,\n73},{14,0,408},{15,0,107},{146,0,71},{7,0,1467},{8,0,328},{10,0,544},{11,0,955},\n{12,0,13},{13,0,320},{145,0,83},{142,0,410},{11,0,511},{13,0,394},{14,0,298},{14\n,0,318},{146,0,103},{6,10,452},{7,10,312},{138,10,219},{138,10,589},{4,10,333},{\n9,10,176},{12,10,353},{141,10,187},{135,11,329},{132,11,469},{5,0,835},{134,0,\n483},{134,11,1743},{5,11,929},{6,11,340},{8,11,376},{136,11,807},{134,10,1685},{\n132,0,677},{5,11,218},{7,11,1610},{138,11,83},{5,11,571},{135,11,1842},{132,11,\n455},{137,0,70},{135,0,1405},{7,10,135},{8,10,7},{8,10,62},{9,10,243},{10,10,658\n},{10,10,697},{11,10,456},{139,10,756},{9,10,395},{138,10,79},{137,0,108},{6,11,\n161},{7,11,372},{137,11,597},{132,11,349},{132,0,777},{132,0,331},{135,10,631},{\n133,0,747},{6,11,432},{6,11,608},{139,11,322},{138,10,835},{5,11,468},{7,11,1809\n},{10,11,325},{11,11,856},{12,11,345},{143,11,104},{133,11,223},{7,10,406},{7,10\n,459},{8,10,606},{139,10,726},{132,11,566},{142,0,68},{4,11,59},{135,11,1394},{6\n,11,436},{139,11,481},{4,11,48},{5,11,271},{135,11,953},{139,11,170},{5,11,610},\n{136,11,457},{133,11,755},{135,11,1217},{133,10,612},{132,11,197},{132,0,505},{4\n,10,372},{7,10,482},{8,10,158},{9,10,602},{9,10,615},{10,10,245},{10,10,678},{10\n,10,744},{11,10,248},{139,10,806},{133,0,326},{5,10,854},{135,10,1991},{4,0,691}\n,{146,0,16},{6,0,628},{9,0,35},{10,0,680},{10,0,793},{11,0,364},{13,0,357},{143,\n0,164},{138,0,654},{6,0,32},{7,0,385},{7,0,757},{7,0,1916},{8,0,37},{8,0,94},{8,\n0,711},{9,0,541},{10,0,162},{10,0,795},{11,0,989},{11,0,1010},{12,0,14},{142,0,\n308},{133,11,217},{6,0,152},{6,0,349},{6,0,1682},{7,0,1252},{8,0,112},{9,0,435},\n{9,0,668},{10,0,290},{10,0,319},{10,0,815},{11,0,180},{11,0,837},{12,0,240},{13,\n0,152},{13,0,219},{142,0,158},{4,0,581},{134,0,726},{5,10,195},{135,10,1685},{6,\n0,126},{7,0,573},{8,0,397},{142,0,44},{138,0,89},{7,10,1997},{8,10,730},{139,10,\n1006},{134,0,1531},{134,0,1167},{5,0,926},{5,10,751},{140,0,203},{4,11,165},{7,\n11,1398},{135,11,1829},{7,0,1232},{137,0,531},{135,10,821},{134,0,943},{133,0,\n670},{4,0,880},{139,0,231},{134,0,1617},{135,0,1957},{5,11,9},{7,11,297},{7,11,\n966},{140,11,306},{6,0,975},{134,0,985},{5,10,950},{5,10,994},{134,10,351},{12,\n11,21},{151,11,7},{5,11,146},{6,11,411},{138,11,721},{7,0,242},{135,0,1942},{6,\n11,177},{135,11,467},{5,0,421},{7,10,47},{137,10,684},{5,0,834},{7,0,1202},{8,0,\n14},{9,0,481},{137,0,880},{138,0,465},{4,10,350},{6,0,688},{137,0,834},{132,0,\n855},{4,0,357},{6,0,172},{7,0,143},{137,0,413},{133,11,200},{132,0,590},{7,10,\n1812},{13,10,259},{13,10,356},{14,10,242},{147,10,114},{133,10,967},{4,10,473},{\n7,10,623},{8,10,808},{9,10,871},{9,10,893},{11,0,114},{11,10,431},{12,10,112},{\n12,10,217},{12,10,243},{12,10,562},{12,10,663},{12,10,683},{13,10,141},{13,10,\n197},{13,10,227},{13,10,406},{13,10,487},{14,10,156},{14,10,203},{14,10,224},{14\n,10,256},{18,10,58},{150,10,0},{138,10,286},{4,10,222},{7,10,286},{136,10,629},{\n5,0,169},{7,0,333},{136,0,45},{134,11,481},{132,0,198},{4,0,24},{4,11,84},{5,0,\n140},{5,0,185},{7,0,1500},{7,11,1482},{10,11,76},{10,11,142},{11,0,565},{139,0,\n838},{133,0,585},{141,10,306},{133,11,1015},{4,11,315},{5,11,507},{135,11,1370},\n{136,10,146},{6,0,691},{134,0,1503},{4,0,334},{133,0,593},{4,10,465},{135,10,\n1663},{142,11,173},{135,0,913},{6,11,1722},{140,0,116},{134,0,1360},{132,0,802},\n{8,11,222},{8,11,476},{9,11,238},{11,11,516},{11,11,575},{15,11,109},{146,11,100\n},{6,0,308},{7,10,138},{7,10,517},{9,0,673},{139,10,238},{132,0,709},{6,0,1876},\n{6,0,1895},{9,0,994},{9,0,1006},{12,0,829},{12,0,888},{12,0,891},{146,0,185},{\n148,10,94},{4,0,228},{133,0,897},{5,10,495},{7,0,1840},{7,10,834},{9,10,733},{\n139,10,378},{133,10,559},{6,10,21},{6,10,1737},{7,10,1444},{136,10,224},{4,0,608\n},{133,0,497},{6,11,40},{135,11,1781},{134,0,1573},{135,0,2039},{6,0,540},{136,0\n,136},{4,0,897},{5,0,786},{133,10,519},{6,0,1878},{6,0,1884},{9,0,938},{9,0,948}\n,{9,0,955},{9,0,973},{9,0,1012},{12,0,895},{12,0,927},{143,0,254},{134,0,1469},{\n133,0,999},{4,0,299},{135,0,1004},{4,0,745},{133,0,578},{136,11,574},{133,0,456}\n,{134,0,1457},{4,10,402},{135,0,1679},{7,0,693},{8,0,180},{8,10,323},{8,10,479},\n{140,0,163},{11,10,580},{142,10,201},{5,10,59},{135,10,672},{132,11,354},{146,10\n,34},{4,0,755},{135,11,1558},{7,0,1740},{146,0,48},{4,10,85},{135,10,549},{139,0\n,338},{133,10,94},{134,0,1091},{135,11,469},{5,11,830},{12,0,695},{12,0,704},{14\n,11,338},{20,0,113},{148,11,81},{135,0,1464},{6,10,11},{135,10,187},{135,0,975},\n{4,10,522},{141,0,335},{134,0,1979},{5,11,496},{135,11,203},{4,10,52},{135,10,\n661},{7,0,1566},{8,0,269},{9,0,212},{9,0,718},{14,0,15},{14,0,132},{142,0,227},{\n4,0,890},{4,10,383},{5,0,805},{5,0,819},{5,0,961},{5,10,520},{6,0,396},{6,0,1631\n},{6,0,1678},{7,0,1967},{7,0,2041},{9,0,630},{11,0,8},{11,0,1019},{12,0,176},{13\n,0,225},{14,0,292},{149,0,24},{134,11,547},{135,11,1748},{5,11,88},{137,11,239},\n{146,11,128},{7,11,650},{135,11,1310},{4,10,281},{5,10,38},{7,10,194},{7,10,668}\n,{7,10,1893},{137,10,397},{135,0,1815},{9,10,635},{139,10,559},{7,0,1505},{10,0,\n190},{10,0,634},{11,0,792},{12,0,358},{140,0,447},{5,0,0},{6,0,536},{7,0,604},{\n13,0,445},{145,0,126},{7,11,1076},{9,11,80},{11,11,78},{11,11,421},{11,11,534},{\n140,11,545},{8,0,966},{10,0,1023},{14,11,369},{146,11,72},{135,11,1641},{6,0,232\n},{6,0,412},{7,0,1074},{8,0,9},{8,0,157},{8,0,786},{9,0,196},{9,0,352},{9,0,457}\n,{10,0,337},{11,0,232},{11,0,877},{12,0,480},{140,0,546},{135,0,958},{4,0,382},{\n136,0,579},{4,0,212},{135,0,1206},{4,11,497},{5,11,657},{135,11,1584},{132,0,681\n},{8,0,971},{138,0,965},{5,10,448},{136,10,535},{14,0,16},{146,0,44},{11,0,584},\n{11,0,616},{11,11,584},{11,11,616},{14,0,275},{142,11,275},{136,11,13},{7,10,610\n},{135,10,1501},{7,11,642},{8,11,250},{11,11,123},{11,11,137},{13,11,48},{142,11\n,95},{133,0,655},{17,0,67},{147,0,74},{134,0,751},{134,0,1967},{6,0,231},{136,0,\n423},{5,0,300},{138,0,1016},{4,10,319},{5,10,699},{138,10,673},{6,0,237},{6,10,\n336},{7,0,611},{8,0,100},{8,10,552},{9,0,416},{9,10,285},{10,10,99},{11,0,335},{\n11,10,568},{12,0,173},{146,0,101},{134,0,1370},{7,10,1406},{9,10,218},{141,10,\n222},{133,10,256},{135,0,1208},{14,11,213},{148,11,38},{6,0,1219},{135,11,1642},\n{13,0,417},{14,0,129},{143,0,15},{10,11,545},{140,11,301},{17,10,39},{148,10,36}\n,{133,0,199},{4,11,904},{133,11,794},{12,0,427},{146,0,38},{134,0,949},{7,10,634\n},{136,0,665},{132,10,618},{135,10,259},{132,10,339},{133,11,761},{141,10,169},{\n132,10,759},{5,0,688},{7,0,539},{135,0,712},{7,11,386},{138,11,713},{134,0,1186}\n,{6,11,7},{6,11,35},{7,11,147},{7,11,1069},{7,11,1568},{7,11,1575},{7,11,1917},{\n8,11,43},{8,11,208},{9,11,128},{9,11,866},{10,11,20},{11,11,981},{147,11,33},{7,\n11,893},{8,10,482},{141,11,424},{6,0,312},{6,0,1715},{10,0,584},{11,0,546},{11,0\n,692},{12,0,259},{12,0,295},{13,0,46},{141,0,154},{5,10,336},{6,10,341},{6,10,\n478},{6,10,1763},{136,10,386},{137,0,151},{132,0,588},{152,0,4},{6,11,322},{9,11\n,552},{11,11,274},{13,11,209},{13,11,499},{14,11,85},{15,11,126},{145,11,70},{\n135,10,73},{4,0,231},{5,0,61},{6,0,104},{7,0,729},{7,0,964},{7,0,1658},{140,0,\n414},{6,0,263},{138,0,757},{135,10,1971},{4,0,612},{133,0,561},{132,0,320},{135,\n10,1344},{8,11,83},{8,11,817},{9,11,28},{9,11,29},{9,11,885},{10,11,387},{11,11,\n633},{11,11,740},{13,11,235},{13,11,254},{15,11,143},{143,11,146},{5,10,396},{\n134,10,501},{140,11,49},{132,0,225},{4,10,929},{5,10,799},{8,10,46},{136,10,740}\n,{4,0,405},{7,0,817},{14,0,58},{17,0,37},{146,0,124},{133,0,974},{4,11,412},{133\n,11,581},{4,10,892},{133,10,770},{4,0,996},{134,0,2026},{4,0,527},{5,0,235},{7,0\n,1239},{11,0,131},{140,0,370},{7,11,421},{9,0,16},{141,0,386},{7,0,956},{7,0,\n1157},{7,0,1506},{7,0,1606},{7,0,1615},{7,0,1619},{7,0,1736},{7,0,1775},{8,0,590\n},{9,0,324},{9,0,736},{9,0,774},{9,0,776},{9,0,784},{10,0,567},{10,0,708},{11,0,\n518},{11,0,613},{11,0,695},{11,0,716},{11,0,739},{11,0,770},{11,0,771},{11,0,848\n},{11,0,857},{11,0,931},{11,0,947},{12,0,326},{12,0,387},{12,0,484},{12,0,528},{\n12,0,552},{12,0,613},{13,0,189},{13,0,256},{13,0,340},{13,0,432},{13,0,436},{13,\n0,440},{13,0,454},{14,0,174},{14,0,220},{14,0,284},{14,0,390},{145,0,121},{135,\n10,158},{9,0,137},{138,0,221},{4,11,110},{10,11,415},{10,11,597},{142,11,206},{\n141,11,496},{135,11,205},{151,10,25},{135,11,778},{7,10,2001},{7,11,1656},{9,11,\n369},{10,11,338},{10,11,490},{11,11,154},{11,11,545},{11,11,775},{13,11,77},{141\n,11,274},{4,11,444},{10,11,146},{140,11,9},{7,0,390},{138,0,140},{135,0,1144},{\n134,0,464},{7,10,1461},{140,10,91},{132,10,602},{4,11,283},{135,11,1194},{5,0,\n407},{11,0,204},{11,0,243},{11,0,489},{12,0,293},{19,0,37},{20,0,73},{150,0,38},\n{7,0,1218},{136,0,303},{4,10,13},{5,0,325},{5,10,567},{7,10,1498},{8,0,5},{8,0,\n227},{9,0,105},{9,10,124},{10,0,585},{11,10,521},{12,0,614},{140,10,405},{135,10\n,1006},{6,11,1720},{7,0,800},{138,0,12},{135,0,1783},{132,10,735},{138,10,812},{\n4,10,170},{135,10,323},{6,0,621},{13,0,504},{144,0,89},{5,10,304},{135,10,1403},\n{137,11,216},{6,0,920},{6,0,1104},{9,11,183},{139,11,286},{4,0,376},{133,10,742}\n,{134,0,218},{8,0,641},{11,0,388},{140,0,580},{7,0,454},{7,0,782},{8,0,768},{140\n,0,686},{137,11,33},{133,10,111},{144,0,0},{10,0,676},{140,0,462},{6,0,164},{136\n,11,735},{133,10,444},{150,0,50},{7,11,1862},{12,11,491},{12,11,520},{13,11,383}\n,{14,11,244},{146,11,12},{5,11,132},{9,11,486},{9,11,715},{10,11,458},{11,11,373\n},{11,11,668},{11,11,795},{11,11,897},{12,11,272},{12,11,424},{12,11,539},{12,11\n,558},{14,11,245},{14,11,263},{14,11,264},{14,11,393},{142,11,403},{8,10,123},{\n15,10,6},{144,10,7},{6,0,285},{8,0,654},{11,0,749},{12,0,190},{12,0,327},{13,0,\n120},{13,0,121},{13,0,327},{15,0,47},{146,0,40},{5,11,8},{6,11,89},{6,11,400},{7\n,11,1569},{7,11,1623},{7,11,1850},{8,11,218},{8,11,422},{9,11,570},{138,11,626},\n{6,11,387},{7,11,882},{141,11,111},{6,0,343},{6,11,224},{7,0,195},{7,11,877},{9,\n0,226},{9,11,647},{10,0,197},{10,0,575},{11,0,502},{139,0,899},{5,10,937},{135,\n10,100},{135,11,790},{150,0,29},{147,0,8},{134,0,1812},{149,0,8},{135,11,394},{7\n,0,1125},{9,0,143},{11,0,61},{14,0,405},{150,0,21},{10,11,755},{147,11,29},{9,11\n,378},{141,11,162},{135,10,922},{5,10,619},{133,10,698},{134,0,1327},{6,0,1598},\n{137,0,575},{9,11,569},{12,11,12},{12,11,81},{12,11,319},{13,11,69},{14,11,259},\n{16,11,87},{17,11,1},{17,11,21},{17,11,24},{18,11,15},{18,11,56},{18,11,59},{18,\n11,127},{18,11,154},{19,11,19},{148,11,31},{6,0,895},{135,11,1231},{5,0,959},{7,\n11,124},{136,11,38},{5,11,261},{7,11,78},{7,11,199},{8,11,815},{9,11,126},{138,\n11,342},{5,10,917},{134,10,1659},{5,11,595},{7,0,1759},{135,11,1863},{136,0,173}\n,{134,0,266},{142,0,261},{132,11,628},{5,10,251},{5,10,956},{8,10,268},{9,10,214\n},{146,10,142},{7,11,266},{136,11,804},{135,11,208},{6,11,79},{7,11,1021},{135,\n11,1519},{11,11,704},{141,11,396},{5,10,346},{5,10,711},{136,10,390},{136,11,741\n},{134,11,376},{134,0,1427},{6,0,1033},{6,0,1217},{136,0,300},{133,10,624},{6,11\n,100},{7,11,244},{7,11,632},{7,11,1609},{8,11,178},{8,11,638},{141,11,58},{5,10,\n783},{6,0,584},{7,10,1998},{135,10,2047},{5,0,427},{5,0,734},{7,0,478},{136,0,52\n},{7,0,239},{11,0,217},{142,0,165},{134,0,1129},{6,0,168},{6,0,1734},{7,0,20},{7\n,0,1056},{8,0,732},{9,0,406},{9,0,911},{138,0,694},{132,10,594},{133,11,791},{7,\n11,686},{8,11,33},{8,11,238},{10,11,616},{11,11,467},{11,11,881},{13,11,217},{13\n,11,253},{142,11,268},{137,11,476},{134,0,418},{133,0,613},{132,0,632},{132,11,\n447},{7,0,32},{7,0,984},{8,0,85},{8,0,709},{9,0,579},{9,0,847},{9,0,856},{10,0,\n799},{11,0,258},{11,0,1007},{12,0,331},{12,0,615},{13,0,188},{13,0,435},{14,0,8}\n,{15,0,165},{16,0,27},{16,11,35},{148,0,40},{4,11,128},{5,11,415},{6,11,462},{7,\n11,294},{7,11,578},{10,11,710},{139,11,86},{5,0,694},{136,0,909},{5,10,37},{6,10\n,39},{6,10,451},{7,0,1109},{7,10,218},{7,10,1166},{7,10,1687},{8,10,662},{11,0,7\n},{144,10,2},{136,11,587},{6,11,427},{7,11,1018},{138,11,692},{4,11,195},{6,10,\n508},{135,11,802},{4,0,167},{135,0,82},{5,0,62},{6,0,24},{6,0,534},{7,0,74},{7,0\n,678},{7,0,684},{7,0,1043},{7,0,1072},{8,0,280},{8,0,541},{8,0,686},{9,0,258},{\n10,0,519},{11,0,252},{140,0,282},{138,0,33},{4,0,359},{133,11,738},{7,0,980},{7,\n10,635},{7,10,796},{8,10,331},{9,0,328},{9,10,330},{9,10,865},{10,10,119},{10,10\n,235},{11,10,111},{11,10,129},{11,10,240},{12,10,31},{12,10,66},{12,10,222},{12,\n10,269},{12,10,599},{12,10,684},{12,10,689},{12,10,691},{13,0,186},{13,0,364},{\n142,10,345},{137,10,527},{6,0,596},{7,0,585},{135,10,702},{134,11,1683},{133,0,\n211},{6,0,145},{141,0,336},{134,0,1130},{6,10,37},{7,0,873},{7,10,1666},{8,10,\n195},{8,10,316},{9,10,178},{9,10,276},{9,10,339},{9,10,536},{10,10,102},{10,10,\n362},{10,10,785},{11,10,55},{11,10,149},{11,10,773},{13,10,416},{13,10,419},{14,\n10,38},{14,10,41},{142,10,210},{8,0,840},{136,0,841},{132,0,263},{5,11,3},{8,11,\n578},{9,11,118},{10,11,705},{12,11,383},{141,11,279},{132,0,916},{133,11,229},{\n133,10,645},{8,11,102},{10,11,578},{10,11,672},{12,11,496},{13,11,408},{14,11,\n121},{15,0,155},{16,0,79},{145,11,106},{4,0,599},{5,0,592},{6,0,1634},{7,0,5},{7\n,0,55},{7,0,67},{7,0,97},{7,0,691},{7,0,979},{7,0,1600},{7,0,1697},{8,0,207},{8,\n0,214},{8,0,231},{8,0,294},{8,0,336},{8,0,428},{8,0,471},{8,0,622},{8,0,626},{8,\n0,679},{8,0,759},{8,0,829},{9,0,11},{9,0,246},{9,0,484},{9,0,573},{9,0,706},{9,0\n,762},{9,0,798},{9,0,855},{9,0,870},{9,0,912},{10,0,303},{10,0,335},{10,0,424},{\n10,0,461},{10,0,543},{10,0,759},{10,0,814},{11,0,59},{11,0,199},{11,0,235},{11,0\n,590},{11,0,631},{11,0,929},{11,0,963},{11,0,987},{12,0,114},{12,0,182},{12,0,\n226},{12,0,332},{12,0,439},{12,0,575},{12,0,598},{12,0,675},{13,0,8},{13,0,125},\n{13,0,194},{13,0,287},{14,0,197},{14,0,383},{15,0,53},{17,0,63},{19,0,46},{19,0,\n98},{19,0,106},{148,0,85},{4,10,290},{135,0,1356},{6,10,70},{7,10,1292},{10,10,\n762},{139,10,288},{150,11,55},{4,0,593},{8,11,115},{8,11,350},{9,11,489},{10,11,\n128},{11,11,306},{12,11,373},{14,11,30},{17,11,79},{147,11,80},{135,11,1235},{\n134,0,1392},{4,11,230},{133,11,702},{147,0,126},{7,10,131},{7,10,422},{8,10,210}\n,{140,10,573},{134,0,1179},{139,11,435},{139,10,797},{134,11,1728},{4,0,162},{18\n,11,26},{19,11,42},{20,11,43},{21,11,0},{23,11,27},{152,11,14},{132,10,936},{5,\n10,453},{6,0,765},{134,10,441},{133,0,187},{135,0,1286},{6,0,635},{6,0,904},{6,0\n,1210},{134,0,1489},{4,0,215},{8,0,890},{9,0,38},{10,0,923},{11,0,23},{11,0,127}\n,{139,0,796},{6,0,1165},{134,0,1306},{7,0,716},{13,0,97},{141,0,251},{132,10,653\n},{136,0,657},{146,10,80},{5,11,622},{7,11,1032},{11,11,26},{11,11,213},{11,11,\n707},{12,11,380},{13,11,226},{141,11,355},{5,11,70},{6,0,299},{6,11,334},{9,11,\n171},{11,11,637},{12,11,202},{14,11,222},{145,11,42},{142,0,134},{4,11,23},{5,11\n,313},{5,11,1014},{6,11,50},{6,11,51},{7,11,142},{7,11,384},{9,11,783},{139,11,\n741},{4,11,141},{7,11,559},{8,11,640},{9,11,460},{12,11,183},{141,11,488},{136,\n11,614},{7,10,1368},{8,10,232},{8,10,361},{10,10,682},{138,10,742},{137,10,534},\n{6,0,1082},{140,0,658},{137,10,27},{135,0,2002},{142,10,12},{4,0,28},{5,0,440},{\n7,0,248},{11,0,833},{140,0,344},{7,10,736},{139,10,264},{134,10,1657},{134,0,\n1654},{138,0,531},{5,11,222},{9,11,140},{138,11,534},{6,0,634},{6,0,798},{134,0,\n840},{138,11,503},{135,10,127},{133,0,853},{5,11,154},{7,11,1491},{10,11,379},{\n138,11,485},{6,0,249},{7,0,1234},{139,0,573},{133,11,716},{7,11,1570},{140,11,\n542},{136,10,364},{138,0,527},{4,11,91},{5,11,388},{5,11,845},{6,11,206},{6,11,\n252},{6,11,365},{7,11,136},{7,11,531},{8,11,264},{136,11,621},{134,0,1419},{135,\n11,1441},{7,0,49},{7,0,392},{8,0,20},{8,0,172},{8,0,690},{9,0,383},{9,0,845},{10\n,0,48},{11,0,293},{11,0,832},{11,0,920},{11,0,984},{141,0,221},{5,0,858},{133,0,\n992},{5,0,728},{137,10,792},{5,10,909},{9,10,849},{138,10,805},{7,0,525},{7,0,\n1579},{8,0,497},{136,0,573},{6,0,268},{137,0,62},{135,11,576},{134,0,1201},{5,11\n,771},{5,11,863},{5,11,898},{6,11,1632},{6,11,1644},{134,11,1780},{133,11,331},{\n7,0,193},{7,0,1105},{7,10,397},{8,10,124},{8,10,619},{9,10,305},{10,0,495},{11,\n10,40},{12,10,349},{13,10,134},{13,10,295},{14,10,155},{15,10,120},{146,10,105},\n{138,0,106},{5,11,107},{6,0,859},{7,11,201},{136,11,518},{6,11,446},{135,11,1817\n},{4,10,262},{7,10,342},{141,0,23},{133,10,641},{137,11,851},{6,0,925},{137,0,\n813},{132,11,504},{6,0,613},{136,0,223},{4,10,99},{6,10,250},{6,10,346},{8,10,\n127},{138,10,81},{136,0,953},{132,10,915},{139,11,892},{5,10,75},{9,10,517},{10,\n10,470},{12,10,155},{141,10,224},{4,0,666},{7,0,1017},{7,11,996},{138,11,390},{5\n,11,883},{133,11,975},{14,10,83},{142,11,83},{4,0,670},{5,11,922},{134,11,1707},\n{135,0,216},{7,11,787},{9,0,40},{139,0,136},{5,10,954},{5,11,993},{7,11,515},{\n137,11,91},{139,0,259},{6,10,304},{7,0,1114},{8,10,418},{9,0,310},{9,0,682},{10,\n0,440},{11,10,341},{11,10,675},{141,0,40},{9,10,410},{11,10,425},{142,0,296},{10\n,11,377},{12,11,363},{13,11,68},{13,11,94},{14,11,108},{142,11,306},{7,0,1401},{\n135,0,1476},{4,0,296},{6,0,475},{7,0,401},{7,0,1410},{7,0,1594},{7,0,1674},{8,0,\n63},{8,0,660},{137,0,74},{4,0,139},{4,0,388},{140,0,188},{132,0,797},{132,11,766\n},{5,11,103},{7,11,921},{8,11,580},{8,11,593},{8,11,630},{138,11,28},{4,11,911},\n{5,11,867},{133,11,1013},{134,10,14},{134,0,1572},{134,10,1708},{5,10,113},{6,10\n,243},{7,10,1865},{11,10,161},{16,10,37},{17,10,99},{149,0,39},{7,11,1563},{141,\n11,182},{5,11,135},{6,11,519},{7,11,1722},{10,11,271},{11,11,261},{145,11,54},{\n132,10,274},{134,0,1594},{4,11,300},{5,11,436},{135,11,484},{4,0,747},{6,0,290},\n{7,0,649},{7,0,1479},{135,0,1583},{133,11,535},{147,11,82},{133,0,232},{137,0,\n887},{135,10,166},{136,0,521},{4,0,14},{7,0,472},{7,0,1801},{10,0,748},{141,0,\n458},{134,0,741},{134,0,992},{9,10,304},{144,0,111},{4,0,425},{5,11,387},{7,11,\n557},{12,11,547},{142,11,86},{135,11,1747},{5,10,654},{135,11,1489},{4,11,6},{5,\n11,708},{7,0,789},{136,11,75},{6,10,273},{10,10,188},{13,10,377},{146,10,77},{4,\n11,303},{6,0,1593},{7,11,619},{10,11,547},{10,11,687},{11,11,122},{140,11,601},{\n134,0,1768},{135,10,410},{138,11,772},{11,0,233},{139,10,524},{5,0,943},{134,0,\n1779},{134,10,1785},{136,11,529},{132,0,955},{5,0,245},{6,0,576},{7,0,582},{136,\n0,225},{132,10,780},{142,0,241},{134,0,1943},{4,11,106},{7,11,310},{7,11,1785},{\n10,11,690},{139,11,717},{134,0,1284},{5,11,890},{133,11,988},{6,11,626},{142,11,\n431},{10,11,706},{145,11,32},{137,11,332},{132,11,698},{135,0,709},{5,10,948},{\n138,11,17},{136,0,554},{134,0,1564},{139,10,941},{132,0,443},{134,0,909},{134,11\n,84},{142,0,280},{4,10,532},{5,10,706},{135,10,662},{132,0,729},{5,10,837},{6,10\n,1651},{139,10,985},{135,10,1861},{4,0,348},{152,11,3},{5,11,986},{6,11,130},{7,\n11,1582},{8,11,458},{10,11,101},{10,11,318},{138,11,823},{134,0,758},{4,0,298},{\n137,0,848},{4,10,330},{7,10,933},{7,10,2012},{136,10,292},{7,11,1644},{137,11,\n129},{6,0,1422},{7,10,767},{137,0,829},{5,0,164},{7,0,121},{142,0,189},{7,0,812}\n,{7,0,1261},{7,0,1360},{9,0,632},{140,0,352},{135,11,1788},{139,0,556},{135,11,\n997},{145,10,114},{4,0,172},{9,0,611},{9,10,883},{10,0,436},{12,0,673},{141,0,\n255},{10,10,274},{139,0,530},{133,0,844},{134,0,984},{4,10,703},{7,10,207},{13,0\n,232},{146,0,35},{132,10,571},{9,0,263},{10,0,147},{138,0,492},{7,11,1756},{137,\n11,98},{5,10,873},{5,10,960},{8,10,823},{137,10,881},{133,0,537},{132,0,859},{7,\n11,1046},{139,11,160},{137,0,842},{139,10,283},{5,10,33},{6,10,470},{139,10,424}\n,{6,11,45},{7,11,433},{8,11,129},{9,11,21},{10,11,392},{11,11,79},{12,11,499},{\n13,11,199},{141,11,451},{135,0,1291},{135,10,1882},{7,11,558},{136,11,353},{134,\n0,1482},{5,0,230},{5,0,392},{6,0,420},{9,0,568},{140,0,612},{6,0,262},{7,10,90},\n{7,10,664},{7,10,830},{7,10,1380},{7,10,2025},{8,10,448},{8,10,828},{8,11,81},{9\n,11,189},{9,11,201},{11,11,478},{11,11,712},{141,11,338},{142,0,31},{5,11,353},{\n151,11,26},{132,0,753},{4,0,0},{5,0,41},{7,0,1459},{7,0,1469},{7,0,1859},{9,0,\n549},{139,0,905},{9,10,417},{137,10,493},{135,11,1113},{133,0,696},{141,11,448},\n{134,10,295},{132,0,834},{4,0,771},{5,10,1019},{6,11,25},{7,11,855},{7,11,1258},\n{144,11,32},{134,0,1076},{133,0,921},{133,0,674},{4,11,4},{7,11,1118},{7,11,1320\n},{7,11,1706},{8,11,277},{9,11,622},{10,11,9},{11,11,724},{12,11,350},{12,11,397\n},{13,11,28},{13,11,159},{15,11,89},{18,11,5},{19,11,9},{20,11,34},{150,11,47},{\n134,10,208},{6,0,444},{136,0,308},{6,0,180},{7,0,1137},{8,0,751},{139,0,805},{4,\n0,183},{7,0,271},{11,0,824},{11,0,952},{13,0,278},{13,0,339},{13,0,482},{14,0,\n424},{148,0,99},{7,11,317},{135,11,569},{4,0,19},{5,0,477},{5,0,596},{6,0,505},{\n7,0,1221},{11,0,907},{12,0,209},{141,0,214},{135,0,1215},{6,0,271},{7,0,398},{7,\n10,448},{7,10,1629},{7,10,1813},{8,0,387},{8,10,442},{9,10,710},{10,0,344},{10,\n10,282},{138,10,722},{11,10,844},{12,10,104},{140,10,625},{134,11,255},{133,10,\n787},{134,0,1645},{11,11,956},{151,11,3},{6,0,92},{6,0,188},{7,0,209},{7,0,1269}\n,{7,0,1524},{7,0,1876},{8,0,661},{10,0,42},{10,0,228},{11,0,58},{11,0,1020},{12,\n0,58},{12,0,118},{141,0,32},{4,0,459},{133,0,966},{4,11,536},{7,11,1141},{10,11,\n723},{139,11,371},{140,0,330},{134,0,1557},{7,11,285},{135,11,876},{136,10,491},\n{135,11,560},{6,0,18},{7,0,179},{7,0,932},{8,0,548},{8,0,757},{9,0,54},{9,0,65},\n{9,0,532},{9,0,844},{10,0,113},{10,0,117},{10,0,315},{10,0,560},{10,0,622},{10,0\n,798},{11,0,153},{11,0,351},{11,0,375},{12,0,78},{12,0,151},{12,0,392},{12,0,666\n},{14,0,248},{143,0,23},{4,11,690},{134,0,1742},{4,10,403},{5,10,441},{7,10,450}\n,{10,10,840},{11,10,101},{12,10,193},{141,10,430},{133,0,965},{134,0,182},{10,0,\n65},{10,0,488},{138,0,497},{135,11,1346},{6,0,973},{6,0,1158},{10,11,200},{19,11\n,2},{151,11,22},{4,11,190},{133,11,554},{133,10,679},{7,0,328},{137,10,326},{133\n,11,1001},{9,0,588},{138,0,260},{133,11,446},{135,10,1128},{135,10,1796},{147,11\n,119},{134,0,1786},{6,0,1328},{6,0,1985},{8,0,962},{138,0,1017},{135,0,308},{4,\n10,574},{7,10,350},{7,10,1024},{8,10,338},{9,10,677},{10,10,808},{139,0,508},{\n138,11,752},{135,10,1081},{137,11,96},{7,10,1676},{135,10,2037},{136,0,588},{132\n,11,304},{133,0,614},{140,0,793},{136,0,287},{137,10,297},{141,10,37},{6,11,53},\n{6,11,199},{7,11,1408},{8,11,32},{8,11,93},{9,11,437},{10,11,397},{10,11,629},{\n11,11,593},{11,11,763},{13,11,326},{145,11,35},{134,11,105},{9,11,320},{10,11,\n506},{138,11,794},{5,11,114},{5,11,255},{141,11,285},{140,0,290},{7,11,2035},{8,\n11,19},{9,11,89},{138,11,831},{134,0,1136},{6,10,306},{7,0,719},{7,10,1140},{7,\n10,1340},{8,0,796},{8,0,809},{8,0,834},{8,10,133},{138,10,449},{139,10,1011},{5,\n0,210},{6,0,213},{7,0,60},{10,0,364},{139,0,135},{5,0,607},{8,0,326},{136,0,490}\n,{138,11,176},{132,0,701},{5,0,472},{7,0,380},{137,0,758},{135,0,1947},{6,0,1079\n},{138,0,278},{138,11,391},{5,10,329},{8,10,260},{139,11,156},{4,0,386},{7,0,41}\n,{8,0,405},{8,0,728},{9,0,497},{11,0,110},{11,0,360},{15,0,37},{144,0,84},{5,0,\n46},{7,0,1452},{7,0,1480},{8,0,634},{140,0,472},{136,0,961},{4,0,524},{136,0,810\n},{10,0,238},{141,0,33},{132,10,657},{152,10,7},{133,0,532},{5,0,997},{135,10,\n1665},{7,11,594},{7,11,851},{7,11,1858},{9,11,411},{9,11,574},{9,11,666},{9,11,\n737},{10,11,346},{10,11,712},{11,11,246},{11,11,432},{11,11,517},{11,11,647},{11\n,11,679},{11,11,727},{12,11,304},{12,11,305},{12,11,323},{12,11,483},{12,11,572}\n,{12,11,593},{12,11,602},{13,11,95},{13,11,101},{13,11,171},{13,11,315},{13,11,\n378},{13,11,425},{13,11,475},{14,11,63},{14,11,380},{14,11,384},{15,11,133},{18,\n11,112},{148,11,72},{5,11,955},{136,11,814},{134,0,1301},{5,10,66},{7,10,1896},{\n136,10,288},{133,11,56},{134,10,1643},{6,0,1298},{148,11,100},{5,0,782},{5,0,829\n},{6,0,671},{6,0,1156},{6,0,1738},{137,11,621},{4,0,306},{5,0,570},{5,10,91},{5,\n10,648},{5,10,750},{5,10,781},{6,10,54},{6,10,112},{6,10,402},{6,10,1732},{7,0,\n1347},{7,10,315},{7,10,749},{7,10,1900},{9,10,78},{9,10,508},{10,10,611},{10,10,\n811},{11,10,510},{11,10,728},{13,10,36},{14,10,39},{16,10,83},{17,10,124},{148,\n10,30},{8,10,570},{9,11,477},{141,11,78},{4,11,639},{10,10,322},{10,10,719},{10,\n11,4},{11,10,407},{11,11,638},{12,11,177},{148,11,57},{7,0,1823},{139,0,693},{5,\n11,758},{7,0,759},{8,10,125},{8,10,369},{8,10,524},{10,10,486},{11,10,13},{11,10\n,381},{11,10,736},{11,10,766},{11,10,845},{13,10,114},{13,10,292},{142,10,47},{6\n,10,1684},{6,10,1731},{7,0,1932},{7,10,356},{8,10,54},{8,10,221},{9,10,225},{9,\n10,356},{10,10,77},{10,10,446},{10,10,731},{12,10,404},{141,10,491},{135,11,552}\n,{135,11,1112},{4,0,78},{5,0,96},{5,0,182},{6,0,1257},{7,0,1724},{7,0,1825},{10,\n0,394},{10,0,471},{11,0,532},{14,0,340},{145,0,88},{139,11,328},{135,0,1964},{\n132,10,411},{4,10,80},{5,10,44},{137,11,133},{5,11,110},{6,11,169},{6,11,1702},{\n7,11,400},{8,11,538},{9,11,184},{9,11,524},{140,11,218},{4,0,521},{5,10,299},{7,\n10,1083},{140,11,554},{6,11,133},{9,11,353},{12,11,628},{146,11,79},{6,0,215},{7\n,0,584},{7,0,1028},{7,0,1473},{7,0,1721},{9,0,424},{138,0,779},{7,0,857},{7,0,\n1209},{7,10,1713},{9,10,537},{10,10,165},{12,10,219},{140,10,561},{4,10,219},{6,\n11,93},{7,10,1761},{7,11,1422},{7,11,1851},{8,11,673},{9,10,86},{9,11,529},{140,\n11,43},{137,11,371},{136,0,671},{5,0,328},{135,0,918},{132,0,529},{9,11,25},{10,\n11,467},{138,11,559},{4,11,335},{135,11,942},{134,0,716},{134,0,1509},{6,0,67},{\n7,0,258},{7,0,1630},{9,0,354},{9,0,675},{10,0,830},{12,10,428},{14,0,80},{145,0,\n80},{134,0,1112},{6,0,141},{7,0,225},{9,0,59},{9,0,607},{10,0,312},{11,0,687},{\n12,0,555},{13,0,373},{13,0,494},{148,0,58},{133,10,514},{8,11,39},{10,11,773},{\n11,11,84},{12,11,205},{142,11,1},{5,11,601},{5,11,870},{136,0,783},{136,11,594},\n{4,10,55},{5,10,301},{6,10,571},{14,10,49},{146,10,102},{132,11,181},{134,11,\n1652},{133,10,364},{4,11,97},{5,11,147},{6,11,286},{7,11,1362},{141,11,176},{4,\n10,76},{7,10,1550},{9,10,306},{9,10,430},{9,10,663},{10,10,683},{11,10,427},{11,\n10,753},{12,10,334},{12,10,442},{14,10,258},{14,10,366},{143,10,131},{137,10,52}\n,{6,0,955},{134,0,1498},{6,11,375},{7,11,169},{7,11,254},{136,11,780},{7,0,430},\n{11,0,46},{14,0,343},{142,11,343},{135,0,1183},{5,0,602},{7,0,2018},{7,11,1447},\n{9,0,418},{137,0,803},{7,11,1044},{136,0,677},{139,11,285},{4,10,656},{135,10,\n779},{135,10,144},{5,11,629},{135,11,1549},{135,10,1373},{138,11,209},{7,10,554}\n,{7,10,605},{141,10,10},{5,10,838},{5,10,841},{134,10,1649},{133,10,1012},{6,0,\n1357},{134,0,1380},{144,0,53},{6,0,590},{7,10,365},{7,10,1357},{7,10,1497},{8,10\n,154},{141,10,281},{133,10,340},{132,11,420},{135,0,329},{147,11,32},{4,0,469},{\n10,11,429},{139,10,495},{8,10,261},{9,10,144},{9,10,466},{10,10,370},{12,10,470}\n,{13,10,144},{142,10,348},{142,0,460},{4,11,325},{9,10,897},{138,11,125},{6,0,\n1743},{6,10,248},{9,10,546},{10,10,535},{11,10,681},{141,10,135},{4,0,990},{5,0,\n929},{6,0,340},{8,0,376},{8,0,807},{8,0,963},{8,0,980},{138,0,1007},{134,0,1603}\n,{140,0,250},{4,11,714},{133,11,469},{134,10,567},{136,10,445},{5,0,218},{7,0,\n1610},{8,0,646},{10,0,83},{11,11,138},{140,11,40},{7,0,1512},{135,0,1794},{135,\n11,1216},{4,11,718},{11,0,0},{144,0,78},{133,0,571},{132,0,455},{134,0,1012},{5,\n11,124},{5,11,144},{6,11,548},{7,11,15},{7,11,153},{137,11,629},{142,11,10},{6,\n11,75},{7,11,1531},{8,11,416},{9,11,240},{9,11,275},{10,11,100},{11,11,658},{11,\n11,979},{12,11,86},{13,11,468},{14,11,66},{14,11,207},{15,11,20},{15,11,25},{144\n,11,58},{132,10,577},{5,11,141},{5,11,915},{6,11,1783},{7,11,211},{7,11,698},{7,\n11,1353},{9,11,83},{9,11,281},{10,11,376},{10,11,431},{11,11,543},{12,11,664},{\n13,11,280},{13,11,428},{14,11,61},{14,11,128},{17,11,52},{145,11,81},{6,0,161},{\n7,0,372},{137,0,597},{132,0,349},{10,11,702},{139,11,245},{134,0,524},{134,10,\n174},{6,0,432},{9,0,751},{139,0,322},{147,11,94},{4,11,338},{133,11,400},{5,0,\n468},{10,0,325},{11,0,856},{12,0,345},{143,0,104},{133,0,223},{132,0,566},{4,11,\n221},{5,11,659},{5,11,989},{7,11,697},{7,11,1211},{138,11,284},{135,11,1070},{4,\n0,59},{135,0,1394},{5,10,878},{5,10,972},{6,0,436},{139,0,481},{4,0,48},{5,0,271\n},{135,0,953},{5,0,610},{136,0,457},{4,0,773},{5,0,618},{137,0,756},{133,0,755},\n{135,0,1217},{138,11,507},{132,10,351},{132,0,197},{143,11,78},{4,11,188},{7,11,\n805},{11,11,276},{142,11,293},{5,11,884},{139,11,991},{132,10,286},{7,10,438},{7\n,10,627},{7,10,1516},{8,10,40},{9,10,56},{9,10,294},{10,0,259},{10,0,428},{11,10\n,969},{11,10,995},{146,10,148},{4,0,356},{5,0,217},{5,0,492},{5,0,656},{8,0,544}\n,{136,11,544},{5,0,259},{6,0,1230},{7,0,414},{7,0,854},{142,0,107},{132,0,1007},\n{15,0,14},{144,0,5},{4,10,738},{134,0,1580},{132,11,596},{132,0,673},{133,10,866\n},{6,0,1843},{135,11,1847},{4,0,165},{7,0,1398},{135,0,1829},{135,11,1634},{147,\n11,65},{6,0,885},{6,0,1009},{137,0,809},{133,10,116},{132,10,457},{136,11,770},{\n9,0,498},{10,11,361},{12,0,181},{142,11,316},{134,11,595},{5,0,9},{7,0,297},{7,0\n,966},{140,0,306},{4,11,89},{5,11,489},{6,11,315},{7,11,553},{7,11,1745},{138,11\n,243},{134,0,1487},{132,0,437},{5,0,146},{6,0,411},{138,0,721},{5,10,527},{6,10,\n189},{135,10,859},{11,10,104},{11,10,554},{15,10,60},{143,10,125},{6,11,1658},{9\n,11,3},{10,11,154},{11,11,641},{13,11,85},{13,11,201},{141,11,346},{6,0,177},{\n135,0,467},{134,0,1377},{134,10,116},{136,11,645},{4,11,166},{5,11,505},{6,11,\n1670},{137,11,110},{133,10,487},{4,10,86},{5,10,667},{5,10,753},{6,10,316},{6,10\n,455},{135,10,946},{133,0,200},{132,0,959},{6,0,1928},{134,0,1957},{139,11,203},\n{150,10,45},{4,10,79},{7,10,1773},{10,10,450},{11,10,589},{13,10,332},{13,10,493\n},{14,10,183},{14,10,334},{14,10,362},{14,10,368},{14,10,376},{14,10,379},{19,10\n,90},{19,10,103},{19,10,127},{148,10,90},{6,0,1435},{135,11,1275},{134,0,481},{7\n,11,445},{8,11,307},{8,11,704},{10,11,41},{10,11,439},{11,11,237},{11,11,622},{\n140,11,201},{135,11,869},{4,0,84},{7,0,1482},{10,0,76},{138,0,142},{11,11,277},{\n144,11,14},{135,11,1977},{4,11,189},{5,11,713},{136,11,57},{133,0,1015},{138,11,\n371},{4,0,315},{5,0,507},{135,0,1370},{4,11,552},{142,10,381},{9,0,759},{16,0,31\n},{16,0,39},{16,0,75},{18,0,24},{20,0,42},{152,0,1},{134,0,712},{134,0,1722},{\n133,10,663},{133,10,846},{8,0,222},{8,0,476},{9,0,238},{11,0,516},{11,0,575},{15\n,0,109},{146,0,100},{5,10,378},{7,0,1402},{7,0,1414},{8,10,465},{9,10,286},{10,\n10,185},{10,10,562},{10,10,635},{11,10,31},{11,10,393},{12,0,456},{13,10,312},{\n18,10,65},{18,10,96},{147,10,89},{4,0,986},{6,0,1958},{6,0,2032},{8,0,934},{138,\n0,985},{7,10,1880},{9,10,680},{139,10,798},{134,10,1770},{145,11,49},{132,11,614\n},{132,10,648},{5,10,945},{6,10,1656},{6,10,1787},{7,10,167},{8,10,824},{9,10,\n391},{10,10,375},{139,10,185},{138,11,661},{7,0,1273},{135,11,1945},{7,0,706},{7\n,0,1058},{138,0,538},{7,10,1645},{8,10,352},{137,10,249},{132,10,152},{11,0,92},\n{11,0,196},{11,0,409},{11,0,450},{11,0,666},{11,0,777},{12,0,262},{13,0,385},{13\n,0,393},{15,0,115},{16,0,45},{145,0,82},{133,10,1006},{6,0,40},{135,0,1781},{9,\n11,614},{139,11,327},{5,10,420},{135,10,1449},{135,0,431},{7,10,832},{138,0,97},\n{6,0,423},{7,0,665},{135,0,1210},{7,0,237},{8,0,664},{9,0,42},{9,0,266},{9,0,380\n},{9,0,645},{10,0,177},{138,0,276},{5,10,351},{135,0,264},{5,10,40},{7,10,598},{\n7,10,1638},{8,0,213},{9,10,166},{9,10,640},{9,10,685},{9,10,773},{11,10,215},{13\n,10,65},{14,10,172},{14,10,317},{145,10,6},{5,11,84},{134,11,163},{8,10,60},{9,\n10,343},{139,10,769},{137,0,455},{133,11,410},{8,0,906},{12,0,700},{12,0,706},{\n140,0,729},{21,11,33},{150,11,40},{7,10,1951},{8,10,765},{8,10,772},{140,10,671}\n,{7,10,108},{8,10,219},{8,10,388},{9,10,639},{9,10,775},{11,10,275},{140,10,464}\n,{5,11,322},{7,11,1941},{8,11,186},{9,11,262},{10,11,187},{14,11,208},{146,11,\n130},{139,0,624},{5,11,227},{8,0,574},{140,11,29},{7,11,1546},{11,11,299},{142,\n11,407},{5,10,15},{6,10,56},{7,10,1758},{8,10,500},{9,10,730},{11,10,331},{13,10\n,150},{142,10,282},{7,11,1395},{8,11,486},{9,11,236},{9,11,878},{10,11,218},{11,\n11,95},{19,11,17},{147,11,31},{135,11,2043},{4,0,354},{146,11,4},{140,11,80},{\n135,0,1558},{134,10,1886},{5,10,205},{6,10,438},{137,10,711},{133,11,522},{133,\n10,534},{7,0,235},{7,0,1475},{15,0,68},{146,0,120},{137,10,691},{4,0,942},{6,0,\n1813},{8,0,917},{10,0,884},{12,0,696},{12,0,717},{12,0,723},{12,0,738},{12,0,749\n},{12,0,780},{16,0,97},{146,0,169},{6,10,443},{8,11,562},{9,10,237},{9,10,571},{\n9,10,695},{10,10,139},{11,10,715},{12,10,417},{141,10,421},{135,0,957},{133,0,\n830},{134,11,1771},{146,0,23},{5,0,496},{6,0,694},{7,0,203},{7,11,1190},{137,11,\n620},{137,11,132},{6,0,547},{134,0,1549},{8,11,258},{9,11,208},{137,11,359},{4,0\n,864},{5,0,88},{137,0,239},{135,11,493},{4,11,317},{135,11,1279},{132,11,477},{4\n,10,578},{5,11,63},{133,11,509},{7,0,650},{135,0,1310},{7,0,1076},{9,0,80},{11,0\n,78},{11,0,421},{11,0,534},{140,0,545},{132,11,288},{5,10,923},{12,0,553},{142,0\n,118},{7,0,274},{11,0,479},{139,0,507},{8,11,89},{8,11,620},{9,11,49},{10,11,774\n},{11,11,628},{12,11,322},{143,11,124},{4,0,497},{135,0,1584},{4,10,924},{7,0,\n261},{7,0,1115},{7,0,1354},{7,0,1404},{7,0,1588},{7,0,1705},{7,0,1902},{9,0,465}\n,{10,0,248},{10,0,349},{10,0,647},{11,0,527},{11,0,660},{11,0,669},{12,0,529},{\n141,0,305},{133,10,665},{136,0,13},{6,0,791},{138,11,120},{7,0,642},{8,0,250},{\n11,0,123},{11,0,137},{13,0,48},{142,0,95},{4,10,265},{7,10,807},{135,10,950},{5,\n10,93},{140,10,267},{135,0,1429},{4,0,949},{10,0,885},{10,0,891},{10,0,900},{10,\n0,939},{12,0,760},{142,0,449},{139,11,366},{132,0,818},{134,11,85},{135,10,994},\n{5,10,233},{5,10,320},{6,10,140},{7,0,330},{136,10,295},{4,0,1004},{8,0,982},{\n136,0,993},{133,10,978},{4,10,905},{6,10,1701},{137,10,843},{10,0,545},{140,0,\n301},{6,0,947},{134,0,1062},{134,0,1188},{4,0,904},{5,0,794},{152,10,6},{134,0,\n1372},{135,11,608},{5,11,279},{6,11,235},{7,11,468},{8,11,446},{9,11,637},{10,11\n,717},{11,11,738},{140,11,514},{132,10,509},{5,11,17},{6,11,371},{137,11,528},{\n132,0,693},{4,11,115},{5,11,669},{6,11,407},{8,11,311},{11,11,10},{141,11,5},{7,\n10,273},{9,11,381},{139,0,377},{135,0,695},{7,0,386},{138,0,713},{135,10,1041},{\n134,0,1291},{6,0,7},{6,0,35},{7,0,147},{7,0,1069},{7,0,1568},{7,0,1575},{7,0,\n1917},{8,0,43},{8,0,208},{9,0,128},{9,0,866},{10,0,20},{11,0,981},{147,0,33},{7,\n0,893},{141,0,424},{139,10,234},{150,11,56},{5,11,779},{5,11,807},{6,11,1655},{\n134,11,1676},{5,10,802},{7,10,2021},{136,10,805},{4,11,196},{5,10,167},{5,10,899\n},{5,11,558},{5,11,949},{6,10,410},{137,10,777},{137,10,789},{134,10,1705},{8,0,\n904},{140,0,787},{6,0,322},{9,0,552},{11,0,274},{13,0,209},{13,0,499},{14,0,85},\n{15,0,126},{145,0,70},{135,10,10},{5,10,11},{6,10,117},{6,10,485},{7,10,1133},{9\n,10,582},{9,10,594},{11,10,21},{11,10,818},{12,10,535},{141,10,86},{4,10,264},{7\n,10,1067},{8,10,204},{8,10,385},{139,10,953},{132,11,752},{138,10,56},{133,10,\n470},{6,0,1808},{8,0,83},{8,0,742},{8,0,817},{9,0,28},{9,0,29},{9,0,885},{10,0,\n387},{11,0,633},{11,0,740},{13,0,235},{13,0,254},{15,0,143},{143,0,146},{140,0,\n49},{134,0,1832},{4,11,227},{5,11,159},{5,11,409},{7,11,80},{10,11,294},{10,11,\n479},{12,11,418},{14,11,50},{14,11,249},{142,11,295},{7,11,1470},{8,11,66},{8,11\n,137},{8,11,761},{9,11,638},{11,11,80},{11,11,212},{11,11,368},{11,11,418},{12,\n11,8},{13,11,15},{16,11,61},{17,11,59},{19,11,28},{148,11,84},{139,10,1015},{138\n,11,468},{135,0,421},{6,0,415},{7,0,1049},{137,0,442},{6,11,38},{7,11,1220},{8,\n11,185},{8,11,256},{9,11,22},{9,11,331},{10,11,738},{11,11,205},{11,11,540},{11,\n11,746},{13,11,399},{13,11,465},{14,11,88},{142,11,194},{139,0,289},{133,10,715}\n,{4,0,110},{10,0,415},{10,0,597},{142,0,206},{4,11,159},{6,11,115},{7,11,252},{7\n,11,257},{7,11,1928},{8,11,69},{9,11,384},{10,11,91},{10,11,615},{12,11,375},{14\n,11,235},{18,11,117},{147,11,123},{5,11,911},{136,11,278},{7,0,205},{7,0,2000},{\n8,10,794},{9,10,400},{10,10,298},{142,10,228},{135,11,1774},{4,11,151},{7,11,\n1567},{8,11,351},{137,11,322},{136,10,724},{133,11,990},{7,0,1539},{7,11,1539},{\n11,0,512},{13,0,205},{19,0,30},{22,0,36},{151,0,19},{5,11,194},{7,11,1662},{9,11\n,90},{140,11,180},{6,10,190},{7,10,768},{135,10,1170},{134,0,1340},{4,0,283},{\n135,0,1194},{133,11,425},{133,11,971},{12,0,549},{14,10,67},{147,10,60},{135,10,\n1023},{134,0,1720},{138,11,587},{5,11,72},{6,11,264},{7,11,21},{7,11,46},{7,11,\n2013},{8,11,215},{8,11,513},{10,11,266},{139,11,22},{5,0,319},{135,0,534},{6,10,\n137},{9,10,75},{9,10,253},{10,10,194},{138,10,444},{6,11,239},{7,0,1180},{7,11,\n118},{10,11,95},{11,11,603},{13,11,443},{14,11,160},{15,11,4},{148,0,112},{134,\n11,431},{5,11,874},{6,11,1677},{11,10,643},{12,10,115},{143,11,0},{134,0,967},{6\n,11,65},{7,11,939},{7,11,1172},{7,11,1671},{9,11,540},{10,11,696},{11,11,265},{\n11,11,732},{11,11,928},{11,11,937},{12,11,399},{13,11,438},{149,11,19},{137,11,\n200},{135,0,1940},{5,10,760},{7,10,542},{8,10,135},{136,10,496},{140,11,44},{7,\n11,1655},{136,11,305},{7,10,319},{7,10,355},{7,10,763},{10,10,389},{145,10,43},{\n136,0,735},{138,10,786},{137,11,19},{132,11,696},{5,0,132},{9,0,486},{9,0,715},{\n10,0,458},{11,0,373},{11,0,668},{11,0,795},{11,0,897},{12,0,272},{12,0,424},{12,\n0,539},{12,0,558},{14,0,245},{14,0,263},{14,0,264},{14,0,393},{142,0,403},{10,0,\n38},{139,0,784},{132,0,838},{4,11,302},{135,11,1766},{133,0,379},{4,11,726},{5,0\n,8},{5,11,630},{6,0,89},{6,0,400},{7,0,1569},{7,0,1623},{7,0,1850},{8,0,218},{8,\n0,422},{9,0,570},{138,0,626},{4,0,1017},{138,0,660},{6,0,387},{7,0,882},{141,0,\n111},{6,0,224},{7,0,877},{137,0,647},{4,10,58},{5,10,286},{6,10,319},{7,10,402},\n{7,10,1254},{7,10,1903},{8,10,356},{140,10,408},{135,0,790},{4,10,389},{9,0,510}\n,{9,10,181},{10,0,53},{10,10,29},{10,10,816},{11,10,311},{11,10,561},{12,10,67},\n{141,10,181},{142,0,458},{6,11,118},{7,11,215},{7,11,1521},{140,11,11},{134,0,\n954},{135,0,394},{134,0,1367},{5,10,373},{133,11,225},{132,0,882},{7,0,1409},{\n135,10,1972},{135,10,1793},{4,11,370},{5,11,756},{135,11,1326},{150,11,13},{7,11\n,354},{10,11,410},{139,11,815},{6,11,1662},{7,11,48},{8,11,771},{10,11,116},{13,\n11,104},{14,11,105},{14,11,184},{15,11,168},{19,11,92},{148,11,68},{7,0,124},{\n136,0,38},{5,0,261},{7,0,78},{7,0,199},{8,0,815},{9,0,126},{10,0,342},{140,0,647\n},{4,0,628},{140,0,724},{7,0,266},{7,10,1651},{8,0,804},{145,10,89},{135,0,208},\n{134,0,1178},{6,0,79},{135,0,1519},{132,10,672},{133,10,737},{136,0,741},{132,11\n,120},{4,0,710},{6,0,376},{134,0,606},{134,0,1347},{134,0,1494},{6,0,850},{6,0,\n1553},{137,0,821},{5,10,145},{134,11,593},{7,0,1311},{140,0,135},{4,0,467},{5,0,\n405},{134,0,544},{5,11,820},{135,11,931},{6,0,100},{7,0,244},{7,0,632},{7,0,1609\n},{8,0,178},{8,0,638},{141,0,58},{4,10,387},{135,10,1288},{6,11,151},{6,11,1675}\n,{7,11,383},{151,11,10},{132,0,481},{135,10,550},{134,0,1378},{6,11,1624},{11,11\n,11},{12,11,422},{13,11,262},{142,11,360},{133,0,791},{4,11,43},{5,11,344},{133,\n11,357},{7,0,1227},{140,0,978},{7,0,686},{8,0,33},{8,0,238},{10,0,616},{11,0,467\n},{11,0,881},{13,0,217},{13,0,253},{142,0,268},{137,0,857},{7,11,148},{8,0,467},\n{8,0,1006},{8,11,284},{141,11,63},{4,10,576},{135,10,1263},{133,11,888},{5,10,\n919},{134,10,1673},{20,10,37},{148,11,37},{132,0,447},{132,11,711},{4,0,128},{5,\n0,415},{6,0,462},{7,0,294},{7,0,578},{10,0,710},{139,0,86},{4,10,82},{5,10,333},\n{5,10,904},{6,10,207},{7,10,325},{7,10,1726},{8,10,101},{10,10,778},{139,10,220}\n,{136,0,587},{137,11,440},{133,10,903},{6,0,427},{7,0,1018},{138,0,692},{4,0,195\n},{135,0,802},{140,10,147},{134,0,1546},{134,0,684},{132,10,705},{136,0,345},{11\n,11,678},{140,11,307},{133,0,365},{134,0,1683},{4,11,65},{5,11,479},{5,11,1004},\n{7,11,1913},{8,11,317},{9,11,302},{10,11,612},{141,11,22},{138,0,472},{4,11,261}\n,{135,11,510},{134,10,90},{142,0,433},{151,0,28},{4,11,291},{7,11,101},{9,11,515\n},{12,11,152},{12,11,443},{13,11,392},{142,11,357},{140,0,997},{5,0,3},{8,0,578}\n,{9,0,118},{10,0,705},{141,0,279},{135,11,1266},{7,10,813},{12,10,497},{141,10,\n56},{133,0,229},{6,10,125},{135,10,1277},{8,0,102},{10,0,578},{10,0,672},{12,0,\n496},{13,0,408},{14,0,121},{17,0,106},{151,10,12},{6,0,866},{134,0,1080},{136,0,\n1022},{4,11,130},{135,11,843},{5,11,42},{5,11,879},{7,11,245},{7,11,324},{7,11,\n1532},{11,11,463},{11,11,472},{13,11,363},{144,11,52},{150,0,55},{4,11,134},{5,\n11,372},{8,0,115},{8,0,350},{9,0,489},{10,0,128},{11,0,306},{12,0,373},{14,0,30}\n,{17,0,79},{147,0,80},{134,0,657},{134,0,933},{135,11,1147},{4,0,230},{133,0,702\n},{134,0,1728},{4,0,484},{18,0,26},{19,0,42},{20,0,43},{21,0,0},{23,0,27},{152,0\n,14},{7,0,185},{135,0,703},{6,0,417},{7,10,1106},{9,10,770},{10,0,618},{11,10,\n112},{140,10,413},{134,0,803},{132,11,644},{134,0,1262},{7,11,540},{12,10,271},{\n145,10,109},{135,11,123},{132,0,633},{134,11,623},{4,11,908},{5,11,359},{5,11,\n508},{6,11,1723},{7,11,343},{7,11,1996},{135,11,2026},{135,0,479},{7,10,304},{9,\n10,646},{9,10,862},{10,0,262},{11,10,696},{12,10,208},{15,10,79},{147,10,108},{4\n,11,341},{135,11,480},{134,0,830},{5,0,70},{5,0,622},{6,0,334},{7,0,1032},{9,0,\n171},{11,0,26},{11,0,213},{11,0,637},{11,0,707},{12,0,202},{12,0,380},{13,0,226}\n,{13,0,355},{14,0,222},{145,0,42},{135,10,981},{143,0,217},{137,11,114},{4,0,23}\n,{4,0,141},{5,0,313},{5,0,1014},{6,0,50},{6,0,51},{7,0,142},{7,0,384},{7,0,559},\n{8,0,640},{9,0,460},{9,0,783},{11,0,741},{12,0,183},{141,0,488},{141,0,360},{7,0\n,1586},{7,11,1995},{8,11,299},{11,11,890},{140,11,674},{132,10,434},{6,10,550},{\n135,0,652},{5,10,553},{7,0,766},{138,10,824},{7,0,737},{8,0,298},{136,10,452},{4\n,11,238},{5,11,503},{6,11,179},{7,11,2003},{8,11,381},{8,11,473},{9,11,149},{10,\n11,183},{15,11,45},{143,11,86},{133,10,292},{5,0,222},{9,0,655},{138,0,534},{138\n,10,135},{4,11,121},{5,11,156},{5,11,349},{9,11,136},{10,11,605},{14,11,342},{\n147,11,107},{137,0,906},{6,0,1013},{134,0,1250},{6,0,1956},{6,0,2009},{8,0,991},\n{144,0,120},{135,11,1192},{138,0,503},{5,0,154},{7,0,1491},{10,0,379},{138,0,485\n},{6,0,1867},{6,0,1914},{6,0,1925},{9,0,917},{9,0,925},{9,0,932},{9,0,951},{9,0,\n1007},{9,0,1013},{12,0,806},{12,0,810},{12,0,814},{12,0,816},{12,0,824},{12,0,\n832},{12,0,837},{12,0,863},{12,0,868},{12,0,870},{12,0,889},{12,0,892},{12,0,900\n},{12,0,902},{12,0,908},{12,0,933},{12,0,942},{12,0,949},{12,0,954},{15,0,175},{\n15,0,203},{15,0,213},{15,0,218},{15,0,225},{15,0,231},{15,0,239},{15,0,248},{15,\n0,252},{18,0,190},{18,0,204},{18,0,215},{18,0,216},{18,0,222},{18,0,225},{18,0,\n230},{18,0,239},{18,0,241},{21,0,42},{21,0,43},{21,0,44},{21,0,45},{21,0,46},{21\n,0,53},{24,0,27},{152,0,31},{133,0,716},{135,0,844},{4,0,91},{5,0,388},{5,0,845}\n,{6,0,206},{6,0,252},{6,0,365},{7,0,136},{7,0,531},{136,0,621},{7,10,393},{10,10\n,603},{139,10,206},{6,11,80},{6,11,1694},{7,11,173},{7,11,1974},{9,11,547},{10,\n11,730},{14,11,18},{150,11,39},{137,0,748},{4,11,923},{134,11,1711},{4,10,912},{\n137,10,232},{7,10,98},{7,10,1973},{136,10,716},{5,10,733},{142,0,103},{132,11,\n595},{5,11,240},{6,11,459},{7,11,12},{7,11,114},{7,11,502},{7,11,1751},{7,11,\n1753},{7,11,1805},{8,11,658},{9,11,1},{11,11,959},{12,0,158},{13,11,446},{14,11,\n211},{18,0,8},{19,0,62},{20,0,6},{22,0,4},{23,0,2},{151,0,9},{135,0,576},{5,0,\n771},{5,0,863},{5,0,898},{6,0,648},{6,0,1632},{6,0,1644},{134,0,1780},{133,0,331\n},{7,11,633},{7,11,905},{7,11,909},{7,11,1538},{9,11,767},{140,11,636},{140,0,\n632},{5,0,107},{7,0,201},{136,0,518},{6,0,446},{6,11,490},{135,0,1817},{9,0,851}\n,{141,0,510},{7,11,250},{8,11,506},{136,11,507},{4,0,504},{137,10,72},{132,11,\n158},{4,11,140},{7,11,362},{8,11,209},{9,11,10},{9,11,160},{9,11,503},{10,11,689\n},{11,11,350},{11,11,553},{11,11,725},{12,11,252},{12,11,583},{13,11,192},{13,11\n,352},{14,11,269},{14,11,356},{148,11,50},{6,11,597},{135,11,1318},{135,10,1454}\n,{5,0,883},{5,0,975},{8,0,392},{148,0,7},{6,11,228},{7,11,1341},{9,11,408},{138,\n11,343},{11,10,600},{11,11,348},{12,11,99},{13,10,245},{18,11,1},{18,11,11},{147\n,11,4},{134,11,296},{5,0,922},{134,0,1707},{132,11,557},{4,11,548},{7,10,164},{7\n,10,1571},{9,10,107},{140,10,225},{7,11,197},{8,11,142},{8,11,325},{9,11,150},{9\n,11,596},{10,11,350},{10,11,353},{11,11,74},{11,11,315},{14,11,423},{143,11,141}\n,{5,0,993},{7,0,515},{137,0,91},{4,0,131},{5,10,484},{5,10,510},{6,10,434},{7,10\n,1000},{7,10,1098},{8,0,200},{136,10,2},{152,0,10},{4,11,62},{5,11,83},{6,11,399\n},{6,11,579},{7,11,692},{7,11,846},{7,11,1015},{7,11,1799},{8,11,403},{9,11,394}\n,{10,11,133},{12,11,4},{12,11,297},{12,11,452},{16,11,81},{18,11,19},{18,11,25},\n{21,11,14},{22,11,12},{151,11,18},{140,11,459},{132,11,177},{7,0,1433},{9,0,365}\n,{137,11,365},{132,10,460},{5,0,103},{5,11,411},{6,0,2004},{7,0,921},{7,11,653},\n{8,0,580},{8,0,593},{8,0,630},{138,0,28},{4,10,932},{133,10,891},{4,0,911},{5,0,\n867},{5,0,1013},{7,0,2034},{8,0,798},{136,0,813},{7,11,439},{10,11,727},{11,11,\n260},{139,11,684},{136,10,625},{5,11,208},{7,11,753},{135,11,1528},{5,0,461},{6,\n10,76},{7,0,1925},{12,0,39},{13,0,265},{141,0,439},{6,0,853},{8,10,92},{137,10,\n221},{5,0,135},{6,0,519},{7,0,1722},{10,0,271},{11,0,261},{145,0,54},{139,11,814\n},{14,0,338},{148,0,81},{4,0,300},{133,0,436},{5,0,419},{5,0,687},{7,0,864},{7,\n11,864},{137,0,470},{5,11,242},{137,0,836},{134,0,1937},{4,10,763},{133,11,953},\n{132,10,622},{132,0,393},{133,10,253},{7,10,546},{8,0,357},{10,0,745},{14,0,426}\n,{17,0,94},{147,0,57},{5,11,615},{146,11,37},{9,10,73},{10,10,110},{14,10,185},{\n145,10,119},{7,10,624},{7,10,916},{10,10,256},{11,0,703},{139,10,87},{133,11,290\n},{5,10,212},{12,10,35},{141,10,382},{132,11,380},{5,11,52},{7,11,277},{9,11,368\n},{139,11,791},{133,0,387},{10,11,138},{139,11,476},{4,0,6},{5,0,708},{136,0,75}\n,{7,0,1351},{9,0,581},{10,0,639},{11,0,453},{140,0,584},{132,0,303},{138,0,772},\n{135,10,1175},{4,0,749},{5,10,816},{6,11,256},{7,11,307},{7,11,999},{7,11,1481},\n{7,11,1732},{7,11,1738},{8,11,265},{9,11,414},{11,11,316},{12,11,52},{13,11,420}\n,{147,11,100},{135,11,1296},{5,10,869},{5,10,968},{6,0,1065},{6,10,1626},{8,10,\n734},{136,10,784},{4,10,542},{6,10,1716},{6,10,1727},{7,10,1082},{7,10,1545},{8,\n10,56},{8,10,118},{8,10,412},{8,10,564},{9,10,888},{9,10,908},{10,10,50},{10,10,\n423},{11,10,685},{11,10,697},{11,10,933},{12,10,299},{13,10,126},{13,10,136},{13\n,10,170},{141,10,190},{134,0,226},{4,0,106},{5,11,723},{7,0,310},{139,0,717},{4,\n10,232},{5,0,890},{5,0,988},{9,10,202},{10,10,474},{140,10,433},{6,0,626},{142,0\n,431},{10,0,706},{150,0,44},{6,10,108},{7,10,1003},{7,10,1181},{8,10,111},{8,10,\n343},{141,0,51},{132,0,698},{5,11,109},{6,11,1784},{7,11,1895},{12,11,296},{140,\n11,302},{134,0,828},{134,10,1712},{138,0,17},{4,10,133},{5,11,216},{7,0,1929},{7\n,10,711},{7,10,1298},{7,10,1585},{7,11,1879},{9,11,141},{9,11,270},{9,11,679},{\n10,11,159},{10,11,553},{11,11,197},{11,11,438},{12,11,538},{12,11,559},{13,11,\n193},{13,11,423},{14,11,144},{14,11,166},{14,11,167},{15,11,67},{147,11,84},{141\n,11,127},{7,11,1872},{137,11,81},{6,10,99},{7,10,1808},{145,10,57},{134,11,391},\n{5,0,689},{6,0,84},{6,10,574},{7,0,1250},{7,10,428},{10,10,669},{11,10,485},{11,\n10,840},{12,10,300},{142,10,250},{7,11,322},{136,11,249},{7,11,432},{135,11,1649\n},{135,10,1871},{137,10,252},{6,11,155},{140,11,234},{7,0,871},{19,0,27},{147,11\n,27},{140,0,498},{5,0,986},{6,0,130},{138,0,823},{6,0,1793},{6,10,323},{7,0,1582\n},{7,10,1564},{8,0,458},{10,0,101},{10,0,318},{10,0,945},{12,0,734},{16,0,104},{\n146,0,177},{5,11,632},{138,11,526},{7,10,461},{8,10,775},{138,0,435},{6,11,144},\n{7,11,948},{7,11,1042},{7,11,1857},{8,11,235},{8,11,461},{9,11,453},{9,11,530},{\n10,11,354},{17,11,77},{19,11,99},{148,11,79},{138,0,966},{7,0,1644},{137,0,129},\n{135,0,997},{136,0,502},{5,11,196},{6,11,486},{7,11,212},{8,11,309},{136,11,346}\n,{7,10,727},{146,10,73},{132,0,823},{132,11,686},{135,0,1927},{4,0,762},{7,0,\n1756},{137,0,98},{136,10,577},{4,11,30},{5,11,43},{24,0,8},{152,11,8},{7,0,1046}\n,{139,0,160},{4,10,413},{5,10,677},{7,0,492},{7,11,492},{8,10,432},{140,10,280},\n{6,0,45},{7,0,433},{8,0,129},{9,0,21},{10,0,392},{11,0,79},{12,0,499},{13,0,199}\n,{141,0,451},{7,0,558},{136,0,353},{4,11,220},{7,11,1535},{9,11,93},{139,11,474}\n,{7,10,646},{7,10,1730},{11,10,446},{141,10,178},{133,0,785},{134,0,1145},{8,0,\n81},{9,0,189},{9,0,201},{11,0,478},{11,0,712},{141,0,338},{5,0,353},{151,0,26},{\n4,10,395},{139,0,762},{134,0,2024},{4,0,611},{133,0,606},{9,10,174},{10,10,164},\n{11,10,440},{11,10,841},{143,10,98},{134,10,426},{10,10,608},{139,10,1002},{138,\n10,250},{6,0,25},{7,0,855},{7,0,1258},{144,0,32},{7,11,1725},{138,11,393},{5,11,\n263},{134,11,414},{5,10,476},{134,0,2011},{4,0,4},{6,11,178},{6,11,1750},{7,0,\n1118},{7,0,1320},{7,0,1706},{8,0,277},{8,11,251},{9,0,622},{9,11,690},{10,0,9},{\n10,11,155},{10,11,196},{10,11,373},{11,0,724},{11,11,698},{12,0,350},{12,0,397},\n{13,0,28},{13,0,159},{13,11,155},{15,0,89},{18,0,5},{19,0,9},{20,0,34},{20,11,93\n},{150,0,47},{5,11,97},{137,11,393},{5,10,76},{6,10,458},{6,10,497},{7,0,764},{7\n,10,868},{9,10,658},{10,10,594},{11,0,461},{11,10,566},{12,0,172},{12,10,338},{\n141,10,200},{134,0,1449},{138,11,40},{134,11,1639},{134,0,1445},{4,10,526},{6,0,\n1168},{7,10,1029},{135,10,1054},{4,11,191},{7,11,934},{8,11,647},{145,11,97},{\n132,10,636},{6,0,233},{7,10,660},{7,10,1124},{17,10,31},{19,10,22},{151,10,14},{\n6,10,1699},{136,11,110},{12,11,246},{15,11,162},{19,11,64},{20,11,8},{20,11,95},\n{22,11,24},{152,11,17},{5,11,165},{9,11,346},{138,11,655},{5,11,319},{135,11,534\n},{134,0,255},{8,11,128},{9,0,216},{139,11,179},{9,0,183},{139,0,286},{11,0,956}\n,{151,0,3},{4,0,536},{7,0,1141},{10,0,723},{139,0,371},{4,10,279},{7,10,301},{\n137,10,362},{5,11,57},{6,11,101},{6,11,1663},{7,0,285},{7,11,132},{7,11,1048},{7\n,11,1154},{7,11,1415},{7,11,1507},{12,11,493},{15,11,105},{151,11,15},{5,11,459}\n,{7,10,1743},{7,11,1073},{8,11,241},{136,11,334},{4,10,178},{133,10,399},{135,0,\n560},{132,0,690},{135,0,1246},{18,0,157},{147,0,63},{10,0,599},{11,0,33},{12,0,\n571},{149,0,1},{6,11,324},{6,11,520},{7,11,338},{7,11,1616},{7,11,1729},{8,11,\n228},{9,11,69},{139,11,750},{7,0,1862},{12,0,491},{12,0,520},{13,0,383},{142,0,\n244},{135,11,734},{134,10,1692},{6,10,202},{7,11,705},{10,0,448},{11,0,630},{12,\n10,360},{17,0,117},{17,10,118},{18,10,27},{148,10,67},{4,11,73},{6,11,612},{7,11\n,927},{7,11,1822},{8,11,217},{9,11,472},{9,11,765},{9,11,766},{10,11,408},{11,11\n,51},{11,11,793},{12,11,266},{15,11,158},{20,11,89},{150,11,32},{4,0,190},{133,0\n,554},{133,0,1001},{5,11,389},{8,11,636},{137,11,229},{5,0,446},{7,10,872},{10,\n10,516},{139,10,167},{137,10,313},{132,10,224},{134,0,1313},{5,10,546},{7,10,35}\n,{8,10,11},{8,10,12},{9,10,315},{9,10,533},{10,10,802},{11,10,166},{12,10,525},{\n142,10,243},{6,0,636},{137,0,837},{5,10,241},{8,10,242},{9,10,451},{10,10,667},{\n11,10,598},{140,10,429},{22,10,46},{150,11,46},{136,11,472},{11,0,278},{142,0,73\n},{141,11,185},{132,0,868},{134,0,972},{4,10,366},{137,10,516},{138,0,1010},{5,\n11,189},{6,10,1736},{7,11,442},{7,11,443},{8,11,281},{12,11,174},{13,11,83},{141\n,11,261},{139,11,384},{6,11,2},{7,11,191},{7,11,446},{7,11,758},{7,11,1262},{7,\n11,1737},{8,11,22},{8,11,270},{8,11,612},{9,11,4},{9,11,167},{9,11,312},{9,11,\n436},{10,11,156},{10,11,216},{10,11,311},{10,11,623},{11,11,72},{11,11,330},{11,\n11,455},{12,11,101},{12,11,321},{12,11,504},{12,11,530},{12,11,543},{13,11,17},{\n13,11,156},{13,11,334},{14,11,48},{15,11,70},{17,11,60},{148,11,64},{6,10,331},{\n136,10,623},{135,0,1231},{132,0,304},{6,11,60},{7,11,670},{7,11,1327},{8,11,411}\n,{8,11,435},{9,11,653},{9,11,740},{10,11,385},{11,11,222},{11,11,324},{11,11,829\n},{140,11,611},{6,11,166},{7,0,506},{7,11,374},{135,11,1174},{14,11,43},{146,11,\n21},{135,11,1694},{135,10,1888},{5,11,206},{134,11,398},{135,11,50},{150,0,26},{\n6,0,53},{6,0,199},{7,0,1408},{8,0,32},{8,0,93},{10,0,397},{10,0,629},{11,0,593},\n{11,0,763},{13,0,326},{145,0,35},{134,0,105},{132,10,394},{4,0,843},{138,0,794},\n{11,0,704},{141,0,396},{5,0,114},{5,0,255},{141,0,285},{6,0,619},{7,0,898},{7,0,\n1092},{7,10,1931},{8,0,485},{18,0,28},{147,0,116},{7,10,574},{7,10,1719},{137,0,\n145},{7,0,2035},{8,0,19},{9,0,89},{138,0,831},{132,10,658},{6,11,517},{7,11,1159\n},{10,11,621},{139,11,192},{7,0,1933},{7,11,1933},{9,10,781},{10,10,144},{11,10,\n385},{13,10,161},{13,10,228},{13,10,268},{148,10,107},{136,10,374},{10,11,223},{\n139,11,645},{135,0,1728},{7,11,64},{7,11,289},{136,11,245},{4,10,344},{6,10,498}\n,{139,10,323},{136,0,746},{135,10,1063},{137,10,155},{4,0,987},{6,0,1964},{6,0,\n1974},{6,0,1990},{136,0,995},{133,11,609},{133,10,906},{134,0,1550},{134,0,874},\n{5,11,129},{6,11,61},{135,11,947},{4,0,1018},{6,0,1938},{6,0,2021},{134,0,2039},\n{132,0,814},{11,0,126},{139,0,287},{134,0,1264},{5,0,955},{136,0,814},{141,11,\n506},{132,11,314},{6,0,981},{139,11,1000},{5,0,56},{8,0,892},{8,0,915},{140,0,\n776},{148,0,100},{10,0,4},{10,0,13},{11,0,638},{148,0,57},{148,11,74},{4,10,616}\n,{133,0,738},{133,11,637},{136,10,692},{133,0,758},{132,10,305},{137,11,590},{5,\n11,280},{135,11,1226},{134,11,494},{135,0,1112},{133,11,281},{5,10,214},{7,10,\n603},{8,10,611},{9,10,686},{10,10,88},{11,10,459},{11,10,496},{12,10,463},{12,10\n,590},{13,0,44},{142,0,214},{139,0,328},{135,11,1064},{137,0,133},{7,0,168},{13,\n0,196},{141,0,237},{134,10,1703},{134,0,1152},{135,0,1245},{5,0,110},{6,0,169},{\n6,0,1702},{7,0,400},{8,0,538},{9,0,184},{9,0,524},{140,0,218},{6,0,1816},{10,0,\n871},{12,0,769},{140,0,785},{132,11,630},{7,11,33},{7,11,120},{8,11,489},{9,11,\n319},{10,11,820},{11,11,1004},{12,11,379},{13,11,117},{13,11,412},{14,11,25},{15\n,11,52},{15,11,161},{16,11,47},{149,11,2},{6,0,133},{8,0,413},{9,0,353},{139,0,\n993},{145,10,19},{4,11,937},{133,11,801},{134,0,978},{6,0,93},{6,0,1508},{7,0,\n1422},{7,0,1851},{8,0,673},{9,0,529},{140,0,43},{4,10,737},{6,0,317},{10,0,512},\n{11,10,294},{12,10,60},{12,10,437},{13,10,64},{13,10,380},{142,10,430},{7,11,\n1591},{9,0,371},{144,11,43},{6,10,1758},{8,10,520},{9,10,345},{9,10,403},{142,10\n,350},{5,0,526},{10,10,242},{138,10,579},{9,0,25},{10,0,467},{138,0,559},{5,10,\n139},{7,10,1168},{138,10,539},{4,0,335},{135,0,942},{140,0,754},{132,11,365},{11\n,0,182},{142,0,195},{142,11,29},{5,11,7},{139,11,774},{4,11,746},{135,11,1090},{\n8,0,39},{10,0,773},{11,0,84},{12,0,205},{142,0,1},{5,0,601},{5,0,870},{5,11,360}\n,{136,11,237},{132,0,181},{136,0,370},{134,0,1652},{4,10,107},{7,10,613},{8,0,\n358},{8,10,439},{8,10,504},{9,10,501},{10,10,383},{139,10,477},{132,10,229},{137\n,11,785},{4,0,97},{5,0,147},{6,0,286},{7,0,1362},{141,0,176},{4,10,903},{6,0,537\n},{7,0,788},{135,0,1816},{140,10,71},{6,0,743},{134,0,1223},{6,0,375},{7,0,169},\n{7,0,254},{7,11,1493},{136,0,780},{4,10,47},{6,10,373},{7,0,1714},{7,10,452},{7,\n10,543},{7,10,1856},{9,10,6},{11,10,257},{139,10,391},{6,0,896},{136,0,1003},{\n135,0,1447},{137,11,341},{5,10,980},{134,10,1754},{145,11,22},{4,11,277},{5,11,\n608},{6,11,493},{7,11,457},{140,11,384},{7,10,536},{7,10,1331},{136,10,143},{140\n,0,744},{7,11,27},{135,11,316},{5,10,19},{6,10,533},{146,0,126},{4,0,788},{5,11,\n552},{5,11,586},{5,11,676},{6,11,448},{8,11,244},{11,0,41},{11,11,1},{11,11,41},\n{13,11,3},{16,11,54},{17,11,4},{146,11,13},{4,0,985},{4,11,401},{6,0,1801},{137,\n11,264},{5,10,395},{5,10,951},{134,10,1776},{5,0,629},{135,0,1549},{11,10,663},{\n12,10,210},{13,10,166},{13,10,310},{14,10,373},{147,10,43},{9,11,543},{10,11,524\n},{11,11,30},{12,11,524},{14,11,315},{16,11,18},{20,11,26},{148,11,65},{4,11,205\n},{5,11,623},{7,11,104},{136,11,519},{5,0,293},{134,0,601},{7,11,579},{9,11,41},\n{9,11,244},{9,11,669},{10,11,5},{11,11,861},{11,11,951},{139,11,980},{132,11,717\n},{132,10,695},{7,10,497},{9,10,387},{147,10,81},{132,0,420},{142,0,37},{6,0,\n1134},{6,0,1900},{12,0,830},{12,0,878},{12,0,894},{15,0,221},{143,0,245},{132,11\n,489},{7,0,1570},{140,0,542},{8,0,933},{136,0,957},{5,10,284},{6,0,1371},{6,10,\n49},{6,10,350},{7,0,31},{7,10,377},{7,10,1693},{8,0,373},{8,10,678},{9,10,161},{\n9,10,585},{9,10,671},{9,10,839},{11,10,912},{141,10,427},{135,11,892},{4,0,325},\n{138,0,125},{139,11,47},{132,10,597},{138,0,323},{6,0,1547},{7,11,1605},{9,11,\n473},{11,11,962},{146,11,139},{139,10,908},{7,11,819},{9,11,26},{9,11,392},{10,\n11,152},{10,11,226},{11,11,19},{12,11,276},{12,11,426},{12,11,589},{13,11,460},{\n15,11,97},{19,11,48},{148,11,104},{135,11,51},{4,0,718},{135,0,1216},{6,0,1896},\n{6,0,1905},{6,0,1912},{7,11,761},{7,11,1051},{9,0,947},{9,0,974},{9,11,545},{12,\n0,809},{12,0,850},{12,0,858},{12,0,874},{12,0,887},{12,0,904},{12,0,929},{12,0,\n948},{12,0,952},{15,0,198},{15,0,206},{15,0,220},{15,0,227},{15,0,247},{18,0,188\n},{21,0,48},{21,0,50},{24,0,25},{152,0,29},{5,0,124},{5,0,144},{6,0,548},{7,0,15\n},{7,0,153},{137,0,629},{135,11,606},{135,10,2014},{7,10,2007},{9,10,101},{9,10,\n450},{9,11,46},{10,10,66},{10,10,842},{11,10,536},{140,10,587},{6,0,75},{7,0,\n1531},{8,0,416},{9,0,240},{9,0,275},{10,0,100},{11,0,658},{11,0,979},{12,0,86},{\n14,0,207},{15,0,20},{143,0,25},{5,0,141},{5,0,915},{6,0,1783},{7,0,211},{7,0,698\n},{7,0,1353},{9,0,83},{9,0,281},{10,0,376},{10,0,431},{11,0,543},{12,0,664},{13,\n0,280},{13,0,428},{14,0,61},{14,0,128},{17,0,52},{145,0,81},{132,11,674},{135,0,\n533},{149,0,6},{132,11,770},{133,0,538},{5,11,79},{7,11,1027},{7,11,1477},{139,\n11,52},{139,10,62},{4,0,338},{133,0,400},{5,11,789},{134,11,195},{4,11,251},{4,\n11,688},{7,11,513},{7,11,1284},{9,11,87},{138,11,365},{134,10,1766},{6,0,0},{7,0\n,84},{11,0,895},{145,0,11},{139,0,892},{4,0,221},{5,0,659},{7,0,697},{7,0,1211},\n{138,0,284},{133,0,989},{133,11,889},{4,11,160},{5,11,330},{7,11,1434},{136,11,\n174},{6,10,1665},{7,10,256},{7,10,1388},{10,10,499},{139,10,670},{4,10,22},{5,10\n,10},{7,0,848},{136,10,97},{138,0,507},{133,10,481},{4,0,188},{135,0,805},{5,0,\n884},{6,0,732},{139,0,991},{135,11,968},{11,11,636},{15,11,145},{17,11,34},{19,\n11,50},{151,11,20},{6,10,134},{7,0,959},{7,10,437},{9,10,37},{14,10,285},{14,10,\n371},{144,0,60},{7,10,486},{8,10,155},{11,10,93},{140,10,164},{134,0,1653},{5,10\n,591},{135,0,337},{5,11,374},{6,0,1989},{8,0,922},{136,0,978},{132,0,638},{138,0\n,500},{133,11,731},{5,10,380},{5,10,650},{136,10,310},{138,11,381},{4,10,364},{7\n,10,1156},{7,10,1187},{137,10,409},{137,11,224},{140,0,166},{134,10,482},{4,11,\n626},{5,11,642},{6,11,425},{10,11,202},{139,11,141},{4,10,781},{6,10,487},{7,10,\n926},{8,10,263},{139,10,500},{135,0,418},{4,10,94},{135,10,1265},{136,0,760},{\n132,10,417},{136,11,835},{5,10,348},{134,10,522},{6,0,1277},{134,0,1538},{139,11\n,541},{135,11,1597},{5,11,384},{8,11,455},{140,11,48},{136,0,770},{5,11,264},{\n134,11,184},{4,0,89},{5,0,489},{6,0,315},{7,0,553},{7,0,1745},{138,0,243},{4,10,\n408},{4,10,741},{135,10,500},{134,0,1396},{133,0,560},{6,0,1658},{9,0,3},{10,0,\n154},{11,0,641},{13,0,85},{13,0,201},{141,0,346},{135,11,1595},{5,11,633},{6,11,\n28},{7,11,219},{135,11,1323},{9,11,769},{140,11,185},{135,11,785},{7,11,359},{8,\n11,243},{140,11,175},{138,0,586},{6,10,73},{135,0,1271},{132,11,105},{4,0,166},{\n5,0,505},{134,0,1670},{133,10,576},{4,11,324},{138,11,104},{142,10,231},{6,0,637\n},{7,10,1264},{7,10,1678},{11,10,945},{12,10,341},{12,10,471},{12,10,569},{23,11\n,21},{151,11,23},{8,11,559},{141,11,109},{134,0,1947},{7,0,445},{8,0,307},{8,0,\n704},{10,0,41},{10,0,439},{11,0,237},{11,0,622},{140,0,201},{135,11,963},{135,0,\n1977},{4,0,189},{5,0,713},{136,0,57},{138,0,371},{135,10,538},{132,0,552},{5,10,\n413},{134,0,883},{4,11,758},{134,0,923},{138,11,215},{136,10,495},{7,10,54},{8,\n10,312},{10,10,191},{10,10,614},{140,10,567},{7,11,351},{139,11,128},{6,10,468},\n{7,0,875},{7,10,1478},{8,10,530},{142,10,290},{135,0,1788},{5,11,918},{145,0,49}\n,{12,11,398},{20,11,39},{21,11,11},{150,11,41},{6,10,484},{7,10,822},{138,0,661}\n,{135,0,1945},{134,0,794},{137,10,900},{135,10,1335},{6,10,1724},{135,10,2022},{\n132,11,340},{134,0,1135},{4,0,784},{133,0,745},{5,0,84},{134,0,163},{133,0,410},\n{4,0,976},{5,11,985},{7,11,509},{7,11,529},{145,11,96},{132,10,474},{134,0,703},\n{135,11,1919},{5,0,322},{8,0,186},{9,0,262},{10,0,187},{142,0,208},{135,10,1504}\n,{133,0,227},{5,10,305},{9,0,560},{141,0,208},{132,11,247},{7,0,1395},{8,0,486},\n{9,0,236},{9,0,878},{10,0,218},{11,0,95},{19,0,17},{147,0,31},{7,0,2043},{8,0,\n672},{141,0,448},{4,11,184},{5,11,390},{6,11,337},{7,11,23},{7,11,494},{7,11,618\n},{7,11,1456},{8,11,27},{8,11,599},{10,11,153},{139,11,710},{135,0,466},{135,10,\n1236},{4,10,480},{6,0,167},{6,10,302},{6,10,1642},{7,0,186},{7,0,656},{7,10,837}\n,{7,10,1547},{7,10,1657},{8,10,429},{9,10,228},{10,0,643},{13,10,289},{13,10,343\n},{147,10,101},{134,0,1428},{134,0,1440},{5,0,412},{7,10,278},{10,10,739},{11,10\n,708},{141,10,348},{134,0,1118},{136,0,562},{148,11,46},{9,0,316},{139,0,256},{\n134,0,1771},{135,0,1190},{137,0,132},{10,11,227},{11,11,497},{11,11,709},{140,11\n,415},{143,0,66},{6,11,360},{7,11,1664},{136,11,478},{144,10,28},{4,0,317},{135,\n0,1279},{5,0,63},{133,0,509},{136,11,699},{145,10,36},{134,0,1475},{11,11,343},{\n142,11,127},{132,11,739},{132,0,288},{135,11,1757},{8,0,89},{8,0,620},{9,0,608},\n{11,0,628},{12,0,322},{143,0,124},{134,0,1225},{4,11,67},{5,11,422},{6,10,363},{\n7,0,1189},{7,10,1955},{7,11,1037},{7,11,1289},{7,11,1555},{8,10,725},{9,11,741},\n{145,11,108},{134,0,1468},{6,0,689},{134,0,1451},{138,0,120},{151,0,1},{137,10,\n805},{142,0,329},{5,10,813},{135,10,2046},{135,0,226},{138,11,96},{5,10,712},{7,\n0,1855},{11,10,17},{13,10,321},{144,10,67},{6,10,320},{7,10,781},{7,10,1921},{9,\n0,461},{9,10,55},{10,10,186},{10,10,273},{10,10,664},{10,10,801},{11,10,996},{11\n,10,997},{13,10,157},{142,10,170},{8,10,271},{8,11,203},{11,11,823},{11,11,846},\n{12,11,482},{13,11,133},{13,11,277},{13,11,302},{13,11,464},{14,11,205},{142,11,\n221},{135,0,1346},{4,11,449},{133,11,718},{134,0,85},{7,10,103},{7,10,863},{11,\n10,184},{14,0,299},{145,10,62},{4,11,355},{6,11,311},{9,11,256},{138,11,404},{\n137,10,659},{138,11,758},{133,11,827},{5,11,64},{140,11,581},{134,0,1171},{4,11,\n442},{7,11,1047},{7,11,1352},{135,11,1643},{132,0,980},{5,11,977},{6,11,288},{7,\n11,528},{135,11,1065},{5,0,279},{6,0,235},{7,0,468},{8,0,446},{9,0,637},{10,0,\n717},{11,0,738},{140,0,514},{132,0,293},{11,10,337},{142,10,303},{136,11,285},{4\n,11,254},{5,0,17},{6,0,371},{9,0,528},{140,0,364},{5,10,77},{7,10,1455},{10,10,\n843},{147,10,73},{150,0,5},{132,10,458},{6,11,12},{7,11,1219},{145,11,73},{135,\n10,1420},{6,10,109},{138,10,382},{135,11,125},{6,10,330},{7,10,1084},{139,10,142\n},{6,11,369},{6,11,502},{7,11,1036},{8,11,348},{9,11,452},{10,11,26},{11,11,224}\n,{11,11,387},{11,11,772},{12,11,95},{12,11,629},{13,11,195},{13,11,207},{13,11,\n241},{14,11,260},{14,11,270},{143,11,140},{132,11,269},{5,11,480},{7,11,532},{7,\n11,1197},{7,11,1358},{8,11,291},{11,11,349},{142,11,396},{150,0,48},{10,0,601},{\n13,0,353},{141,0,376},{5,0,779},{5,0,807},{6,0,1655},{134,0,1676},{142,11,223},{\n4,0,196},{5,0,558},{133,0,949},{148,11,15},{135,11,1764},{134,0,1322},{132,0,752\n},{139,0,737},{135,11,657},{136,11,533},{135,0,412},{4,0,227},{5,0,159},{5,0,409\n},{7,0,80},{8,0,556},{10,0,479},{12,0,418},{14,0,50},{14,0,123},{14,0,192},{14,0\n,249},{14,0,295},{143,0,27},{7,0,1470},{8,0,66},{8,0,137},{8,0,761},{9,0,638},{\n11,0,80},{11,0,212},{11,0,368},{11,0,418},{12,0,8},{13,0,15},{16,0,61},{17,0,59}\n,{19,0,28},{148,0,84},{135,10,1985},{4,11,211},{4,11,332},{5,11,335},{6,11,238},\n{7,11,269},{7,11,811},{7,11,1797},{8,10,122},{8,11,836},{9,11,507},{141,11,242},\n{6,0,683},{134,0,1252},{4,0,873},{132,10,234},{134,0,835},{6,0,38},{7,0,1220},{8\n,0,185},{8,0,256},{9,0,22},{9,0,331},{10,0,738},{11,0,205},{11,0,540},{11,0,746}\n,{13,0,465},{14,0,88},{142,0,194},{138,0,986},{5,11,1009},{12,11,582},{146,11,\n131},{4,0,159},{6,0,115},{7,0,252},{7,0,257},{7,0,1928},{8,0,69},{9,0,384},{10,0\n,91},{10,0,615},{12,0,375},{14,0,235},{18,0,117},{147,0,123},{133,0,911},{136,0,\n278},{5,10,430},{5,10,932},{6,10,131},{7,10,417},{9,10,522},{11,10,314},{141,10,\n390},{14,10,149},{14,10,399},{143,10,57},{4,0,151},{7,0,1567},{136,0,749},{5,11,\n228},{6,11,203},{7,11,156},{8,11,347},{137,11,265},{132,10,507},{10,0,989},{140,\n0,956},{133,0,990},{5,0,194},{6,0,927},{7,0,1662},{9,0,90},{140,0,564},{4,10,343\n},{133,10,511},{133,0,425},{7,10,455},{138,10,591},{4,0,774},{7,11,476},{7,11,\n1592},{138,11,87},{5,0,971},{135,10,1381},{5,11,318},{147,11,121},{5,11,291},{7,\n11,765},{9,11,389},{140,11,548},{134,10,575},{4,0,827},{12,0,646},{12,0,705},{12\n,0,712},{140,0,714},{139,0,752},{137,0,662},{5,0,72},{6,0,264},{7,0,21},{7,0,46}\n,{7,0,2013},{8,0,215},{8,0,513},{10,0,266},{139,0,22},{139,11,522},{6,0,239},{7,\n0,118},{10,0,95},{11,0,603},{13,0,443},{14,0,160},{143,0,4},{6,0,431},{134,0,669\n},{7,10,1127},{7,10,1572},{10,10,297},{10,10,422},{11,10,764},{11,10,810},{12,10\n,264},{13,10,102},{13,10,300},{13,10,484},{14,10,147},{14,10,229},{17,10,71},{18\n,10,118},{147,10,120},{5,0,874},{6,0,1677},{10,11,525},{11,11,82},{143,0,0},{6,0\n,65},{7,0,939},{7,0,1172},{7,0,1671},{9,0,540},{10,0,696},{11,0,265},{11,0,732},\n{11,0,928},{11,0,937},{141,0,438},{134,0,1350},{136,11,547},{132,11,422},{5,11,\n355},{145,11,0},{137,11,905},{5,0,682},{135,0,1887},{132,0,809},{4,0,696},{133,\n11,865},{6,0,1074},{6,0,1472},{14,10,35},{142,10,191},{5,11,914},{134,11,1625},{\n133,11,234},{135,11,1383},{137,11,780},{132,10,125},{4,0,726},{133,0,630},{8,0,\n802},{136,0,838},{132,10,721},{6,0,1337},{7,0,776},{8,10,145},{147,0,56},{132,0,\n970},{7,10,792},{8,10,147},{10,10,821},{139,10,1021},{139,10,970},{8,0,940},{137\n,0,797},{135,11,1312},{7,10,1999},{7,11,816},{7,11,1241},{9,0,248},{9,11,283},{9\n,11,520},{10,0,400},{10,11,213},{10,11,307},{10,11,463},{10,11,671},{10,11,746},\n{11,11,401},{11,11,794},{12,11,517},{18,11,107},{147,11,115},{6,0,1951},{134,0,\n2040},{135,11,339},{5,10,168},{5,10,930},{8,10,74},{9,10,623},{12,10,500},{12,10\n,579},{13,0,41},{143,0,93},{6,0,118},{7,0,215},{7,0,1521},{140,0,11},{6,10,220},\n{7,10,1101},{141,10,105},{6,11,421},{7,11,61},{7,11,1540},{10,11,11},{138,11,501\n},{7,0,615},{138,0,251},{140,11,631},{135,0,1044},{6,10,19},{7,10,1413},{139,10,\n428},{133,0,225},{7,10,96},{8,10,401},{8,10,703},{137,10,896},{145,10,116},{6,11\n,102},{7,11,72},{15,11,142},{147,11,67},{7,10,1961},{7,10,1965},{8,10,702},{136,\n10,750},{7,10,2030},{8,10,150},{8,10,737},{12,10,366},{151,11,30},{4,0,370},{5,0\n,756},{7,0,1326},{135,11,823},{8,10,800},{9,10,148},{9,10,872},{9,10,890},{11,10\n,309},{11,10,1001},{13,10,267},{141,10,323},{6,0,1662},{7,0,48},{8,0,771},{10,0,\n116},{13,0,104},{14,0,105},{14,0,184},{15,0,168},{19,0,92},{148,0,68},{7,11,1870\n},{138,0,209},{7,11,68},{8,11,48},{8,11,88},{8,11,582},{8,11,681},{9,11,373},{9,\n11,864},{11,11,157},{11,11,336},{11,11,843},{148,11,27},{134,0,930},{4,11,88},{5\n,11,137},{5,11,174},{5,11,777},{6,11,1664},{6,11,1725},{7,11,77},{7,11,426},{7,\n11,1317},{7,11,1355},{8,11,126},{8,11,563},{9,11,523},{9,11,750},{10,11,310},{10\n,11,836},{11,11,42},{11,11,318},{11,11,731},{12,11,68},{12,11,92},{12,11,507},{\n12,11,692},{13,11,81},{13,11,238},{13,11,374},{18,11,138},{19,11,78},{19,11,111}\n,{20,11,55},{20,11,77},{148,11,92},{4,11,938},{135,11,1831},{5,10,547},{7,10,424\n},{8,11,617},{138,11,351},{6,0,1286},{6,11,1668},{7,11,1499},{8,11,117},{9,11,\n314},{138,11,174},{6,0,759},{6,0,894},{7,11,707},{139,11,563},{4,0,120},{135,0,\n1894},{9,0,385},{149,0,17},{138,0,429},{133,11,403},{5,0,820},{135,0,931},{5,10,\n133},{138,0,199},{6,0,151},{6,0,1675},{7,0,383},{151,0,10},{6,0,761},{136,10,187\n},{8,0,365},{10,10,0},{10,10,818},{139,10,988},{4,11,44},{5,11,311},{6,11,156},{\n7,11,639},{7,11,762},{7,11,1827},{9,11,8},{9,11,462},{148,11,83},{4,11,346},{7,\n11,115},{9,11,180},{9,11,456},{138,11,363},{136,10,685},{7,0,1086},{145,0,46},{6\n,0,1624},{11,0,11},{12,0,422},{13,0,444},{142,0,360},{6,0,1020},{6,0,1260},{134,\n0,1589},{4,0,43},{5,0,344},{5,0,357},{14,0,472},{150,0,58},{6,0,1864},{6,0,1866}\n,{6,0,1868},{6,0,1869},{6,0,1874},{6,0,1877},{6,0,1903},{6,0,1911},{9,0,920},{9,\n0,921},{9,0,924},{9,0,946},{9,0,959},{9,0,963},{9,0,970},{9,0,997},{9,0,1008},{9\n,0,1017},{12,0,795},{12,0,797},{12,0,798},{12,0,800},{12,0,803},{12,0,811},{12,0\n,820},{12,0,821},{12,0,839},{12,0,841},{12,0,848},{12,0,911},{12,0,921},{12,0,\n922},{12,0,925},{12,0,937},{12,0,944},{12,0,945},{12,0,953},{15,0,184},{15,0,191\n},{15,0,199},{15,0,237},{15,0,240},{15,0,243},{15,0,246},{18,0,203},{21,0,40},{\n21,0,52},{21,0,57},{24,0,23},{24,0,28},{152,0,30},{134,0,725},{145,11,58},{133,0\n,888},{137,10,874},{4,0,711},{8,10,774},{10,10,670},{140,10,51},{144,11,40},{6,\n11,185},{7,11,1899},{139,11,673},{137,10,701},{137,0,440},{4,11,327},{5,11,478},\n{7,11,1332},{8,11,753},{140,11,227},{4,10,127},{5,10,350},{6,10,356},{8,10,426},\n{9,10,572},{10,10,247},{139,10,312},{5,11,1020},{133,11,1022},{4,11,103},{133,11\n,401},{6,0,1913},{6,0,1926},{6,0,1959},{9,0,914},{9,0,939},{9,0,952},{9,0,979},{\n9,0,990},{9,0,998},{9,0,1003},{9,0,1023},{12,0,827},{12,0,834},{12,0,845},{12,0,\n912},{12,0,935},{12,0,951},{15,0,172},{15,0,174},{18,0,198},{149,0,63},{4,11,499\n},{5,0,958},{5,0,987},{135,11,1421},{6,10,59},{6,10,1762},{7,0,885},{9,10,603},{\n141,10,397},{10,11,62},{141,11,164},{4,0,847},{135,0,326},{11,0,276},{142,0,293}\n,{4,0,65},{4,11,96},{5,0,479},{5,0,1004},{7,0,1913},{8,0,317},{9,0,302},{10,0,\n612},{141,0,22},{4,0,261},{135,0,510},{135,0,1514},{6,10,111},{7,10,4},{8,10,163\n},{8,10,776},{138,10,566},{4,0,291},{9,0,515},{12,0,152},{12,0,443},{13,0,392},{\n142,0,357},{7,11,399},{135,11,1492},{4,0,589},{139,0,282},{6,11,563},{135,10,\n1994},{5,10,297},{135,10,1038},{4,0,130},{7,0,843},{135,0,1562},{5,0,42},{5,0,\n879},{7,0,245},{7,0,324},{7,0,1532},{11,0,463},{11,0,472},{13,0,363},{144,0,52},\n{4,0,134},{133,0,372},{133,0,680},{136,10,363},{6,0,1997},{8,0,935},{136,0,977},\n{4,0,810},{135,0,1634},{135,10,1675},{4,11,910},{5,11,832},{135,0,1390},{7,10,\n808},{8,11,266},{139,11,578},{132,0,644},{4,0,982},{138,0,867},{132,10,280},{135\n,0,540},{140,10,54},{135,0,123},{134,0,1978},{4,10,421},{133,10,548},{6,0,623},{\n136,0,789},{4,0,908},{5,0,359},{5,0,508},{6,0,1723},{7,0,343},{7,0,1996},{135,0,\n2026},{134,0,1220},{4,0,341},{135,0,480},{6,10,254},{9,10,109},{138,10,103},{134\n,0,888},{8,11,528},{137,11,348},{4,11,20},{5,11,616},{7,0,1995},{8,0,299},{11,0,\n890},{140,0,674},{135,11,1094},{134,10,1630},{4,0,238},{5,0,503},{6,0,179},{7,0,\n2003},{8,0,381},{8,0,473},{9,0,149},{10,0,788},{15,0,45},{15,0,86},{20,0,110},{\n150,0,57},{133,10,671},{4,11,26},{5,11,429},{6,11,245},{7,11,704},{7,11,1379},{\n135,11,1474},{4,0,121},{5,0,156},{5,0,349},{9,0,431},{10,0,605},{142,0,342},{7,\n11,943},{139,11,614},{132,10,889},{132,11,621},{7,10,1382},{7,10,1910},{135,11,\n1382},{132,10,627},{133,10,775},{133,11,542},{133,11,868},{136,11,433},{6,0,1373\n},{7,0,1011},{11,10,362},{11,10,948},{140,10,388},{6,0,80},{7,0,173},{7,11,1495}\n,{9,0,547},{10,0,730},{14,0,18},{150,0,39},{6,0,1694},{135,0,1974},{140,0,196},{\n4,0,923},{6,0,507},{6,0,1711},{7,10,451},{8,10,389},{12,10,490},{13,10,16},{13,\n10,215},{13,10,351},{18,10,132},{147,10,125},{6,0,646},{134,0,1047},{135,10,841}\n,{136,10,566},{6,0,1611},{135,0,1214},{139,0,926},{132,11,525},{132,0,595},{5,0,\n240},{6,0,459},{7,0,12},{7,0,114},{7,0,949},{7,0,1753},{7,0,1805},{8,0,658},{9,0\n,1},{11,0,959},{141,0,446},{5,10,912},{134,10,1695},{132,0,446},{7,11,62},{12,11\n,45},{147,11,112},{5,10,236},{6,10,572},{8,10,492},{11,10,618},{144,10,56},{5,10\n,190},{136,10,318},{135,10,1376},{4,11,223},{6,11,359},{11,11,3},{13,11,108},{14\n,11,89},{144,11,22},{132,11,647},{134,0,490},{134,0,491},{134,0,1584},{135,11,\n685},{138,11,220},{7,0,250},{136,0,507},{132,0,158},{4,0,140},{7,0,362},{8,0,209\n},{9,0,10},{9,0,160},{9,0,503},{9,0,614},{10,0,689},{11,0,327},{11,0,553},{11,0,\n725},{11,0,767},{12,0,252},{12,0,583},{13,0,192},{14,0,269},{14,0,356},{148,0,50\n},{19,0,1},{19,0,26},{150,0,9},{132,11,109},{6,0,228},{7,0,1341},{9,0,408},{138,\n0,343},{4,0,373},{5,0,283},{6,0,480},{7,0,609},{10,0,860},{138,0,878},{6,0,779},\n{134,0,1209},{4,0,557},{7,11,263},{7,11,628},{136,11,349},{132,0,548},{7,0,197},\n{8,0,142},{8,0,325},{9,0,150},{9,0,596},{10,0,350},{10,0,353},{11,0,74},{11,0,\n315},{12,0,662},{12,0,681},{14,0,423},{143,0,141},{4,11,40},{10,11,67},{11,11,\n117},{11,11,768},{139,11,935},{7,11,992},{8,11,301},{9,11,722},{12,11,63},{13,11\n,29},{14,11,161},{143,11,18},{6,0,1490},{138,11,532},{5,0,580},{7,0,378},{7,0,\n674},{7,0,1424},{15,0,83},{15,11,83},{16,0,11},{144,11,11},{6,0,1057},{6,0,1335}\n,{7,10,85},{7,10,247},{8,10,585},{10,0,316},{138,10,163},{4,0,169},{5,0,83},{6,0\n,399},{6,0,579},{6,0,1513},{7,0,692},{7,0,846},{7,0,1015},{7,0,1799},{8,0,403},{\n9,0,394},{10,0,133},{12,0,4},{12,0,297},{12,0,452},{16,0,81},{18,0,25},{21,0,14}\n,{22,0,12},{151,0,18},{134,0,1106},{7,0,1546},{11,0,299},{142,0,407},{134,0,1192\n},{132,0,177},{5,0,411},{135,0,653},{7,0,439},{10,0,727},{11,0,260},{139,0,684},\n{138,10,145},{147,10,83},{5,0,208},{7,0,753},{135,0,1528},{137,11,617},{135,10,\n1922},{135,11,825},{4,10,124},{10,10,457},{11,0,422},{11,10,121},{11,10,169},{11\n,10,870},{12,10,214},{13,0,389},{14,10,187},{143,10,77},{11,0,615},{11,11,615},{\n15,0,58},{143,11,58},{9,0,618},{138,0,482},{6,0,1952},{6,0,1970},{142,0,505},{7,\n10,1193},{135,11,1838},{133,0,242},{135,10,1333},{6,10,107},{7,10,638},{7,10,\n1632},{137,10,396},{133,0,953},{5,10,370},{134,10,1756},{5,11,28},{6,11,204},{10\n,11,320},{10,11,583},{13,11,502},{14,11,72},{14,11,274},{14,11,312},{14,11,344},\n{15,11,159},{16,11,62},{16,11,69},{17,11,30},{18,11,42},{18,11,53},{18,11,84},{\n18,11,140},{19,11,68},{19,11,85},{20,11,5},{20,11,45},{20,11,101},{22,11,7},{150\n,11,20},{4,11,558},{6,11,390},{7,11,162},{7,11,689},{9,11,360},{138,11,653},{11,\n0,802},{141,0,67},{133,10,204},{133,0,290},{5,10,970},{134,10,1706},{132,0,380},\n{5,0,52},{7,0,277},{9,0,368},{139,0,791},{5,11,856},{6,11,1672},{6,11,1757},{6,\n11,1781},{7,11,1150},{7,11,1425},{7,11,1453},{140,11,513},{5,11,92},{7,10,3},{10\n,11,736},{140,11,102},{4,0,112},{5,0,653},{5,10,483},{5,10,685},{6,10,489},{7,10\n,1204},{136,10,394},{132,10,921},{5,10,1007},{134,0,1028},{5,11,590},{9,11,213},\n{145,11,91},{135,10,1696},{10,0,138},{139,0,476},{5,0,725},{5,0,727},{135,0,1811\n},{4,0,979},{6,0,1821},{6,0,1838},{8,0,876},{8,0,883},{8,0,889},{8,0,893},{8,0,\n895},{10,0,934},{12,0,720},{14,0,459},{148,0,123},{135,11,551},{4,0,38},{6,0,435\n},{7,0,307},{7,0,999},{7,0,1481},{7,0,1732},{7,0,1738},{8,0,371},{9,0,414},{11,0\n,316},{12,0,52},{13,0,420},{147,0,100},{135,0,1296},{132,10,712},{134,10,1629},{\n133,0,723},{134,0,651},{136,11,191},{9,11,791},{10,11,93},{11,11,301},{16,11,13}\n,{17,11,23},{18,11,135},{19,11,12},{20,11,1},{20,11,12},{148,11,14},{136,11,503}\n,{6,11,466},{135,11,671},{6,0,1200},{134,0,1330},{135,0,1255},{134,0,986},{5,0,\n109},{6,0,1784},{7,0,1895},{12,0,296},{140,0,302},{135,11,983},{133,10,485},{134\n,0,660},{134,0,800},{4,10,285},{5,0,216},{5,0,294},{5,10,317},{6,0,591},{6,10,\n301},{7,0,1879},{7,10,7},{8,10,153},{9,0,141},{9,0,270},{9,0,679},{10,0,159},{10\n,10,766},{11,0,197},{11,0,438},{11,10,468},{12,0,538},{12,0,559},{12,10,467},{13\n,10,143},{14,0,144},{14,0,167},{143,0,67},{136,0,945},{134,0,1090},{137,0,81},{\n12,11,468},{19,11,96},{148,11,24},{134,0,391},{138,11,241},{7,0,322},{136,0,249}\n,{134,0,1412},{135,11,795},{5,0,632},{138,0,526},{136,10,819},{6,0,144},{7,0,948\n},{7,0,1042},{7,11,954},{8,0,235},{8,0,461},{9,0,453},{9,0,796},{10,0,354},{145,\n0,77},{139,10,917},{6,0,940},{134,0,1228},{4,0,362},{7,0,52},{135,0,303},{6,11,\n549},{8,11,34},{8,11,283},{9,11,165},{138,11,475},{7,11,370},{7,11,1007},{7,11,\n1177},{135,11,1565},{5,11,652},{5,11,701},{135,11,449},{5,0,196},{6,0,486},{7,0,\n212},{8,0,309},{136,0,346},{6,10,1719},{6,10,1735},{7,10,2016},{7,10,2020},{8,10\n,837},{137,10,852},{6,11,159},{6,11,364},{7,11,516},{7,11,1439},{137,11,518},{\n135,0,1912},{135,0,1290},{132,0,686},{141,11,151},{138,0,625},{136,0,706},{138,\n10,568},{139,0,412},{4,0,30},{133,0,43},{8,10,67},{138,10,419},{7,0,967},{141,0,\n11},{12,0,758},{14,0,441},{142,0,462},{10,10,657},{14,10,297},{142,10,361},{139,\n10,729},{4,0,220},{135,0,1535},{7,11,501},{9,11,111},{10,11,141},{11,11,332},{13\n,11,43},{13,11,429},{14,11,130},{14,11,415},{145,11,102},{4,0,950},{6,0,1859},{7\n,0,11},{8,0,873},{12,0,710},{12,0,718},{12,0,748},{12,0,765},{148,0,124},{5,11,\n149},{5,11,935},{136,11,233},{142,11,291},{134,0,1579},{7,0,890},{8,10,51},{9,10\n,868},{10,10,833},{12,10,481},{12,10,570},{148,10,106},{141,0,2},{132,10,445},{\n136,11,801},{135,0,1774},{7,0,1725},{138,0,393},{5,0,263},{134,0,414},{132,11,\n322},{133,10,239},{7,0,456},{7,10,1990},{8,10,130},{139,10,720},{137,0,818},{5,\n10,123},{6,10,530},{7,10,348},{135,10,1419},{135,10,2024},{6,0,178},{6,0,1750},{\n8,0,251},{9,0,690},{10,0,155},{10,0,196},{10,0,373},{11,0,698},{13,0,155},{148,0\n,93},{5,0,97},{137,0,393},{134,0,674},{11,0,223},{140,0,168},{132,10,210},{139,\n11,464},{6,0,1639},{146,0,159},{139,11,2},{7,0,934},{8,0,647},{17,0,97},{19,0,59\n},{150,0,2},{132,0,191},{4,10,430},{5,0,165},{7,11,357},{9,0,346},{10,0,655},{\n139,0,885},{133,0,877},{5,10,213},{133,11,406},{8,0,128},{139,0,179},{6,11,69},{\n135,11,117},{135,0,1297},{11,11,43},{13,11,72},{141,11,142},{135,11,1830},{142,0\n,164},{5,0,57},{6,0,101},{6,0,586},{6,0,1663},{7,0,132},{7,0,1154},{7,0,1415},{7\n,0,1507},{12,0,493},{15,0,105},{151,0,15},{5,0,459},{7,0,1073},{8,0,241},{136,0,\n334},{133,11,826},{133,10,108},{5,10,219},{10,11,132},{11,11,191},{11,11,358},{\n139,11,460},{6,0,324},{6,0,520},{7,0,338},{7,0,1729},{8,0,228},{139,0,750},{4,10\n,193},{5,10,916},{7,10,364},{10,10,398},{10,10,726},{11,10,317},{11,10,626},{12,\n10,142},{12,10,288},{12,10,678},{13,10,313},{15,10,113},{18,10,114},{21,0,30},{\n150,0,53},{6,11,110},{135,11,1681},{135,0,910},{6,10,241},{7,10,907},{8,10,832},\n{9,10,342},{10,10,729},{11,10,284},{11,10,445},{11,10,651},{11,10,863},{13,10,\n398},{146,10,99},{5,11,1000},{7,0,705},{7,11,733},{9,0,734},{137,11,583},{4,0,73\n},{6,0,612},{7,0,927},{7,0,1822},{8,0,217},{9,0,765},{9,0,766},{10,0,408},{11,0,\n51},{11,0,793},{12,0,266},{15,0,158},{20,0,89},{150,0,32},{4,11,297},{6,11,529},\n{7,0,1330},{7,11,152},{7,11,713},{7,11,1845},{8,11,710},{8,11,717},{140,11,639},\n{5,0,389},{136,0,636},{134,0,1409},{4,10,562},{9,10,254},{139,10,879},{134,0,893\n},{132,10,786},{4,11,520},{135,11,575},{136,0,21},{140,0,721},{136,0,959},{7,11,\n1428},{7,11,1640},{9,11,169},{9,11,182},{9,11,367},{9,11,478},{9,11,506},{9,11,\n551},{9,11,648},{9,11,651},{9,11,697},{9,11,705},{9,11,725},{9,11,787},{9,11,794\n},{10,11,198},{10,11,214},{10,11,267},{10,11,275},{10,11,456},{10,11,551},{10,11\n,561},{10,11,613},{10,11,627},{10,11,668},{10,11,675},{10,11,691},{10,11,695},{\n10,11,707},{10,11,715},{11,11,183},{11,11,201},{11,11,244},{11,11,262},{11,11,\n352},{11,11,439},{11,11,493},{11,11,572},{11,11,591},{11,11,608},{11,11,611},{11\n,11,646},{11,11,674},{11,11,711},{11,11,751},{11,11,761},{11,11,776},{11,11,785}\n,{11,11,850},{11,11,853},{11,11,862},{11,11,865},{11,11,868},{11,11,898},{11,11,\n902},{11,11,903},{11,11,910},{11,11,932},{11,11,942},{11,11,957},{11,11,967},{11\n,11,972},{12,11,148},{12,11,195},{12,11,220},{12,11,237},{12,11,318},{12,11,339}\n,{12,11,393},{12,11,445},{12,11,450},{12,11,474},{12,11,509},{12,11,533},{12,11,\n591},{12,11,594},{12,11,597},{12,11,621},{12,11,633},{12,11,642},{13,11,59},{13,\n11,60},{13,11,145},{13,11,239},{13,11,250},{13,11,273},{13,11,329},{13,11,344},{\n13,11,365},{13,11,372},{13,11,387},{13,11,403},{13,11,414},{13,11,456},{13,11,\n478},{13,11,483},{13,11,489},{14,11,55},{14,11,57},{14,11,81},{14,11,90},{14,11,\n148},{14,11,239},{14,11,266},{14,11,321},{14,11,326},{14,11,327},{14,11,330},{14\n,11,347},{14,11,355},{14,11,401},{14,11,411},{14,11,414},{14,11,416},{14,11,420}\n,{15,11,61},{15,11,74},{15,11,87},{15,11,88},{15,11,94},{15,11,96},{15,11,116},{\n15,11,149},{15,11,154},{16,11,50},{16,11,63},{16,11,73},{17,11,2},{17,11,66},{17\n,11,92},{17,11,103},{17,11,112},{18,11,50},{18,11,54},{18,11,82},{18,11,86},{18,\n11,90},{18,11,111},{18,11,115},{18,11,156},{19,11,40},{19,11,79},{20,11,78},{149\n,11,22},{137,11,170},{134,0,1433},{135,11,1307},{139,11,411},{5,0,189},{7,0,442}\n,{7,0,443},{8,0,281},{12,0,174},{141,0,261},{6,10,216},{7,10,901},{7,10,1343},{\n136,10,493},{5,11,397},{6,11,154},{7,10,341},{7,11,676},{8,11,443},{8,11,609},{9\n,11,24},{9,11,325},{10,11,35},{11,10,219},{11,11,535},{11,11,672},{11,11,1018},{\n12,11,637},{144,11,30},{6,0,2},{7,0,191},{7,0,446},{7,0,1262},{7,0,1737},{8,0,22\n},{8,0,270},{8,0,612},{9,0,4},{9,0,312},{9,0,436},{9,0,626},{10,0,216},{10,0,311\n},{10,0,521},{10,0,623},{11,0,72},{11,0,330},{11,0,455},{12,0,321},{12,0,504},{\n12,0,530},{12,0,543},{13,0,17},{13,0,156},{13,0,334},{14,0,131},{17,0,60},{148,0\n,64},{7,0,354},{10,0,410},{139,0,815},{139,10,130},{7,10,1734},{137,11,631},{10,\n10,115},{11,10,420},{12,0,425},{13,10,404},{14,10,346},{15,0,112},{143,10,54},{6\n,0,60},{6,0,166},{7,0,374},{7,0,670},{7,0,1327},{8,0,411},{8,0,435},{9,0,653},{9\n,0,740},{10,0,385},{11,0,222},{11,0,324},{11,0,829},{140,0,611},{7,0,1611},{13,0\n,14},{15,0,44},{19,0,13},{148,0,76},{133,11,981},{4,11,56},{7,11,1791},{8,11,607\n},{8,11,651},{11,11,465},{11,11,835},{12,11,337},{141,11,480},{5,10,1011},{6,0,\n1478},{136,10,701},{139,0,596},{5,0,206},{134,0,398},{4,10,54},{5,10,666},{7,10,\n1039},{7,10,1130},{9,10,195},{138,10,302},{7,0,50},{9,11,158},{138,11,411},{135,\n11,1120},{6,0,517},{6,10,1669},{7,0,1159},{10,0,621},{139,0,192},{4,0,592},{6,0,\n600},{135,0,1653},{10,0,223},{139,0,645},{136,11,139},{7,0,64},{136,0,245},{142,\n0,278},{6,11,622},{135,11,1030},{136,0,604},{134,0,1502},{138,0,265},{141,11,168\n},{7,0,1763},{140,0,310},{7,10,798},{139,11,719},{7,11,160},{10,11,624},{142,11,\n279},{132,11,363},{7,10,122},{9,10,259},{10,10,84},{11,10,470},{12,10,541},{141,\n10,379},{5,0,129},{6,0,61},{135,0,947},{134,0,1356},{135,11,1191},{13,0,505},{\n141,0,506},{5,10,82},{5,10,131},{7,10,1755},{8,10,31},{9,10,168},{9,10,764},{11,\n0,1000},{139,10,869},{134,0,966},{134,10,605},{134,11,292},{5,11,177},{6,11,616}\n,{7,11,827},{9,11,525},{138,11,656},{135,11,1486},{138,11,31},{5,10,278},{137,10\n,68},{4,10,163},{5,10,201},{5,10,307},{5,10,310},{6,10,335},{7,10,284},{136,10,\n165},{6,0,839},{135,10,1660},{136,10,781},{6,10,33},{135,10,1244},{133,0,637},{4\n,11,161},{133,11,631},{137,0,590},{7,10,1953},{136,10,720},{5,0,280},{7,0,1226},\n{138,10,203},{134,0,1386},{5,0,281},{6,0,1026},{6,10,326},{7,10,677},{137,10,425\n},{7,11,1557},{135,11,1684},{135,0,1064},{9,11,469},{9,11,709},{12,11,512},{14,\n11,65},{145,11,12},{134,0,917},{10,11,229},{11,11,73},{11,11,376},{139,11,433},{\n7,0,555},{7,10,1316},{7,10,1412},{7,10,1839},{9,0,192},{9,10,589},{11,10,241},{\n11,10,676},{11,10,811},{11,10,891},{12,10,140},{12,10,346},{12,10,479},{13,0,30}\n,{13,0,49},{13,10,381},{14,10,188},{15,0,150},{16,0,76},{18,10,30},{148,0,52},{\n149,0,15},{6,0,1882},{6,0,1883},{6,0,1897},{9,0,945},{9,0,1014},{9,0,1020},{12,0\n,823},{12,0,842},{12,0,866},{12,0,934},{15,0,242},{146,0,208},{6,0,965},{134,0,\n1499},{7,0,33},{7,0,120},{8,0,489},{9,0,319},{10,0,820},{11,0,1004},{12,0,379},{\n12,0,679},{13,0,117},{13,0,412},{14,0,25},{15,0,52},{15,0,161},{16,0,47},{149,0,\n2},{6,11,558},{7,11,651},{8,11,421},{9,11,0},{138,11,34},{4,0,937},{5,0,801},{5,\n10,358},{7,0,473},{7,10,1184},{10,10,662},{13,10,212},{13,10,304},{13,10,333},{\n145,10,98},{132,0,877},{6,0,693},{134,0,824},{132,0,365},{7,11,1832},{138,11,374\n},{5,0,7},{139,0,774},{4,0,734},{5,0,662},{134,0,430},{4,0,746},{135,0,1090},{5,\n0,360},{8,0,237},{10,0,231},{147,0,124},{138,11,348},{6,11,6},{7,11,81},{7,11,\n771},{7,11,1731},{9,11,405},{138,11,421},{6,0,740},{137,0,822},{133,10,946},{7,0\n,1485},{136,0,929},{7,10,411},{8,10,631},{9,10,323},{10,10,355},{11,10,491},{12,\n10,143},{12,10,402},{13,10,73},{14,10,408},{15,10,107},{146,10,71},{135,10,590},\n{5,11,881},{133,11,885},{150,11,25},{4,0,852},{5,11,142},{134,11,546},{7,10,1467\n},{8,10,328},{10,10,544},{11,10,955},{13,10,320},{145,10,83},{9,0,17},{10,0,291}\n,{11,10,511},{13,10,394},{14,10,298},{14,10,318},{146,10,103},{5,11,466},{11,11,\n571},{12,11,198},{13,11,283},{14,11,186},{15,11,21},{143,11,103},{134,0,1001},{4\n,11,185},{5,11,257},{5,11,839},{5,11,936},{7,11,171},{9,11,399},{10,11,258},{10,\n11,395},{10,11,734},{11,11,1014},{12,11,23},{13,11,350},{14,11,150},{147,11,6},{\n143,0,35},{132,0,831},{5,10,835},{134,10,483},{4,0,277},{5,0,608},{6,0,493},{7,0\n,457},{7,11,404},{7,11,1377},{7,11,1430},{7,11,2017},{8,11,149},{8,11,239},{8,11\n,512},{8,11,793},{8,11,818},{9,11,474},{9,11,595},{10,11,122},{10,11,565},{10,11\n,649},{10,11,783},{11,11,239},{11,11,295},{11,11,447},{11,11,528},{11,11,639},{\n11,11,800},{11,11,936},{12,0,384},{12,11,25},{12,11,73},{12,11,77},{12,11,157},{\n12,11,316},{12,11,390},{12,11,391},{12,11,394},{12,11,395},{12,11,478},{12,11,\n503},{12,11,592},{12,11,680},{13,11,50},{13,11,53},{13,11,132},{13,11,198},{13,\n11,275},{13,11,322},{13,11,415},{14,11,71},{14,11,257},{14,11,395},{15,11,71},{\n15,11,136},{17,11,123},{18,11,93},{147,11,58},{134,0,1351},{7,0,27},{135,0,316},\n{136,11,712},{136,0,984},{133,0,552},{137,0,264},{132,0,401},{6,0,710},{6,0,1111\n},{134,0,1343},{134,0,1211},{9,0,543},{10,0,524},{11,0,108},{11,0,653},{12,0,524\n},{13,0,123},{14,0,252},{16,0,18},{19,0,38},{20,0,26},{20,0,65},{21,0,3},{151,0,\n11},{4,0,205},{5,0,623},{7,0,104},{8,0,519},{137,0,716},{132,10,677},{4,11,377},\n{152,11,13},{135,11,1673},{7,0,579},{9,0,41},{9,0,244},{9,0,669},{10,0,5},{11,0,\n861},{11,0,951},{139,0,980},{132,0,717},{136,0,1011},{132,0,805},{4,11,180},{135\n,11,1906},{132,10,777},{132,10,331},{132,0,489},{4,11,491},{5,10,747},{134,0,\n1024},{135,11,1182},{4,11,171},{138,11,234},{4,11,586},{7,11,1186},{138,11,631},\n{135,0,892},{135,11,336},{9,11,931},{10,11,334},{148,11,71},{137,0,473},{6,0,864\n},{11,11,926},{140,0,659},{7,0,819},{9,0,26},{9,0,392},{10,0,152},{10,0,226},{11\n,0,19},{12,0,276},{12,0,426},{12,0,589},{13,0,460},{15,0,97},{19,0,48},{148,0,\n104},{135,0,51},{133,10,326},{4,10,691},{146,10,16},{9,0,130},{10,10,680},{10,10\n,793},{11,0,765},{141,10,357},{133,11,765},{6,10,32},{7,10,385},{7,10,757},{7,10\n,1916},{8,0,229},{8,10,94},{8,10,711},{9,10,541},{10,10,162},{10,10,795},{11,10,\n989},{11,10,1010},{12,10,14},{142,10,308},{7,11,474},{137,11,578},{132,0,674},{\n132,0,770},{5,0,79},{7,0,1027},{7,0,1477},{139,0,52},{133,11,424},{134,0,1666},{\n6,0,409},{6,10,349},{6,10,1682},{7,10,1252},{8,10,112},{8,11,714},{9,10,435},{9,\n10,668},{10,10,290},{10,10,319},{10,10,815},{11,10,180},{11,10,837},{12,10,240},\n{13,10,152},{13,10,219},{142,10,158},{5,0,789},{134,0,195},{4,0,251},{4,0,688},{\n7,0,513},{135,0,1284},{132,10,581},{9,11,420},{10,11,269},{10,11,285},{10,11,576\n},{11,11,397},{13,11,175},{145,11,90},{6,10,126},{7,10,573},{8,10,397},{142,10,\n44},{132,11,429},{133,0,889},{4,0,160},{5,0,330},{7,0,1434},{136,0,174},{7,11,18\n},{7,11,699},{7,11,1966},{8,11,752},{9,11,273},{9,11,412},{9,11,703},{10,11,71},\n{10,11,427},{10,11,508},{146,11,97},{6,0,872},{134,0,899},{133,10,926},{134,0,\n1126},{134,0,918},{4,11,53},{5,11,186},{135,11,752},{7,0,268},{136,0,569},{134,0\n,1224},{6,0,1361},{7,10,1232},{137,10,531},{8,11,575},{10,11,289},{139,11,319},{\n133,10,670},{132,11,675},{133,0,374},{135,10,1957},{133,0,731},{11,0,190},{11,11\n,190},{15,0,49},{143,11,49},{4,0,626},{5,0,506},{5,0,642},{6,0,425},{10,0,202},{\n139,0,141},{137,0,444},{7,10,242},{135,10,1942},{6,11,209},{8,11,468},{9,11,210}\n,{11,11,36},{12,11,28},{12,11,630},{13,11,21},{13,11,349},{14,11,7},{145,11,13},\n{4,11,342},{135,11,1179},{5,10,834},{7,10,1202},{8,10,14},{9,10,481},{137,10,880\n},{4,11,928},{133,11,910},{4,11,318},{4,11,496},{7,11,856},{139,11,654},{136,0,\n835},{7,0,1526},{138,10,465},{151,0,17},{135,0,477},{4,10,357},{6,10,172},{7,10,\n143},{137,10,413},{6,0,1374},{138,0,994},{4,10,590},{146,0,76},{7,0,287},{8,0,\n355},{9,0,293},{137,0,743},{134,0,1389},{7,11,915},{8,11,247},{147,11,0},{4,11,\n202},{5,11,382},{6,11,454},{7,11,936},{7,11,1803},{8,11,758},{9,11,375},{9,11,\n895},{10,11,743},{10,11,792},{11,11,978},{11,11,1012},{142,11,109},{5,0,384},{8,\n0,455},{140,0,48},{132,11,390},{5,10,169},{7,10,333},{136,10,45},{5,0,264},{134,\n0,184},{138,11,791},{133,11,717},{132,10,198},{6,11,445},{7,11,332},{137,11,909}\n,{136,0,1001},{4,10,24},{5,10,140},{5,10,185},{7,10,1500},{11,10,565},{139,10,\n838},{134,11,578},{5,0,633},{6,0,28},{135,0,1323},{132,0,851},{136,11,267},{7,0,\n359},{8,0,243},{140,0,175},{4,10,334},{133,10,593},{141,11,87},{136,11,766},{10,\n0,287},{10,11,287},{12,0,138},{140,11,138},{4,0,105},{132,0,740},{140,10,116},{\n134,0,857},{135,11,1841},{6,0,1402},{137,0,819},{132,11,584},{132,10,709},{133,\n10,897},{5,0,224},{13,0,174},{146,0,52},{135,10,1840},{4,10,608},{133,10,497},{\n139,11,60},{4,0,758},{135,0,1649},{4,11,226},{4,11,326},{135,11,1770},{5,11,426}\n,{8,11,30},{9,11,2},{11,11,549},{147,11,122},{135,10,2039},{6,10,540},{136,10,\n136},{4,0,573},{4,10,897},{5,10,786},{136,0,655},{7,0,351},{139,0,128},{133,10,\n999},{4,10,299},{135,10,1004},{133,0,918},{132,11,345},{4,11,385},{7,11,265},{\n135,11,587},{133,10,456},{136,10,180},{6,0,687},{134,0,1537},{4,11,347},{5,11,\n423},{5,11,996},{135,11,1329},{132,10,755},{7,11,1259},{9,11,125},{11,11,65},{\n140,11,285},{5,11,136},{6,11,136},{136,11,644},{134,0,1525},{4,0,1009},{135,0,\n1139},{139,10,338},{132,0,340},{135,10,1464},{8,0,847},{10,0,861},{10,0,876},{10\n,0,889},{10,0,922},{10,0,929},{10,0,933},{12,0,784},{140,0,791},{139,0,176},{9,\n11,134},{10,11,2},{10,11,27},{10,11,333},{11,11,722},{143,11,1},{4,11,433},{133,\n11,719},{5,0,985},{7,0,509},{7,0,529},{145,0,96},{132,0,615},{4,10,890},{5,10,\n805},{5,10,819},{5,10,961},{6,10,396},{6,10,1631},{6,10,1678},{7,10,1967},{7,10,\n2041},{9,10,630},{11,10,8},{11,10,1019},{12,10,176},{13,10,225},{14,10,292},{149\n,10,24},{135,0,1919},{134,0,1131},{144,11,21},{144,11,51},{135,10,1815},{4,0,247\n},{7,10,1505},{10,10,190},{10,10,634},{11,10,792},{12,10,358},{140,10,447},{5,10\n,0},{6,10,536},{7,10,604},{13,10,445},{145,10,126},{4,0,184},{5,0,390},{6,0,337}\n,{7,0,23},{7,0,494},{7,0,618},{7,0,1456},{8,0,27},{8,0,599},{10,0,153},{139,0,\n710},{6,10,232},{6,10,412},{7,10,1074},{8,10,9},{8,10,157},{8,10,786},{9,10,196}\n,{9,10,352},{9,10,457},{10,10,337},{11,10,232},{11,10,877},{12,10,480},{140,10,\n546},{7,10,958},{141,0,38},{4,10,382},{136,10,579},{4,10,212},{135,10,1206},{4,\n11,555},{8,11,536},{138,11,288},{11,11,139},{139,11,171},{9,11,370},{138,11,90},\n{132,0,1015},{134,0,1088},{5,10,655},{135,11,977},{134,0,1585},{17,10,67},{147,\n10,74},{10,0,227},{11,0,497},{11,0,709},{140,0,415},{6,0,360},{7,0,1664},{136,0,\n478},{6,10,231},{7,0,95},{136,10,423},{140,11,65},{4,11,257},{135,11,2031},{135,\n11,1768},{133,10,300},{139,11,211},{136,0,699},{6,10,237},{7,10,611},{8,10,100},\n{9,10,416},{11,10,335},{12,10,173},{146,10,101},{14,0,26},{146,0,150},{6,0,581},\n{135,0,1119},{135,10,1208},{132,0,739},{6,11,83},{6,11,1733},{135,11,1389},{137,\n0,869},{4,0,67},{5,0,422},{7,0,1037},{7,0,1289},{7,0,1555},{9,0,741},{145,0,108}\n,{133,10,199},{12,10,427},{146,10,38},{136,0,464},{142,0,42},{8,11,501},{9,11,\n696},{138,0,96},{134,11,592},{4,0,512},{4,0,966},{5,0,342},{6,0,1855},{8,0,869},\n{8,0,875},{8,0,901},{144,0,26},{8,0,203},{11,0,823},{11,0,846},{12,0,482},{13,0,\n277},{13,0,302},{13,0,464},{14,0,205},{142,0,221},{4,0,449},{133,0,718},{7,11,\n1718},{9,11,95},{9,11,274},{10,11,279},{10,11,317},{10,11,420},{11,11,303},{11,\n11,808},{12,11,134},{12,11,367},{13,11,149},{13,11,347},{14,11,349},{14,11,406},\n{18,11,22},{18,11,89},{18,11,122},{147,11,47},{133,11,26},{4,0,355},{6,0,311},{9\n,0,256},{138,0,404},{132,11,550},{6,10,312},{6,10,1715},{10,0,758},{10,10,584},{\n11,10,546},{11,10,692},{12,10,259},{12,10,295},{13,10,46},{141,10,154},{136,11,\n822},{4,11,902},{5,0,827},{5,11,809},{6,11,122},{135,11,896},{5,0,64},{140,0,581\n},{4,0,442},{6,0,739},{7,0,1047},{7,0,1352},{7,0,1643},{7,11,1911},{9,11,449},{\n10,11,192},{138,11,740},{135,11,262},{132,10,588},{133,11,620},{4,11,34},{5,0,\n977},{5,11,574},{6,0,288},{7,0,528},{7,11,279},{7,11,1624},{136,11,601},{4,10,\n231},{5,10,61},{6,0,1375},{6,10,104},{7,10,729},{7,10,964},{7,10,1658},{140,10,\n414},{6,10,263},{138,10,757},{132,10,320},{4,0,254},{5,11,332},{7,0,1309},{135,\n11,1309},{6,11,261},{8,11,182},{139,11,943},{132,10,225},{6,0,12},{135,0,1219},{\n4,0,275},{6,11,1721},{12,0,376},{141,11,490},{4,11,933},{133,11,880},{4,10,405},\n{6,0,951},{6,0,1109},{6,0,1181},{7,0,154},{7,10,817},{14,10,58},{17,10,37},{146,\n10,124},{5,10,974},{134,0,1520},{134,0,1753},{6,0,369},{6,0,502},{7,0,1036},{8,0\n,348},{9,0,452},{10,0,26},{11,0,224},{11,0,387},{11,0,772},{12,0,95},{12,0,629},\n{13,0,195},{13,0,207},{13,0,241},{14,0,260},{14,0,270},{143,0,140},{132,0,269},{\n5,0,480},{7,0,532},{7,0,1197},{7,0,1358},{8,0,291},{11,0,349},{142,0,396},{5,10,\n235},{7,10,1239},{11,10,131},{140,10,370},{7,10,956},{7,10,1157},{7,10,1506},{7,\n10,1606},{7,10,1615},{7,10,1619},{7,10,1736},{7,10,1775},{8,10,590},{9,10,324},{\n9,10,736},{9,10,774},{9,10,776},{9,10,784},{10,10,567},{10,10,708},{11,10,518},{\n11,10,613},{11,10,695},{11,10,716},{11,10,739},{11,10,770},{11,10,771},{11,10,\n848},{11,10,857},{11,10,931},{11,10,947},{12,10,326},{12,10,387},{12,10,484},{12\n,10,528},{12,10,552},{12,10,613},{13,10,189},{13,10,256},{13,10,340},{13,10,432}\n,{13,10,436},{13,10,440},{13,10,454},{14,10,174},{14,10,220},{14,10,284},{14,10,\n390},{145,10,121},{8,11,598},{9,11,664},{138,11,441},{9,10,137},{138,10,221},{\n133,11,812},{148,0,15},{134,0,1341},{4,11,137},{6,0,1017},{7,11,1178},{135,11,\n1520},{7,10,390},{138,10,140},{7,11,1260},{135,11,1790},{137,11,191},{135,10,\n1144},{6,0,1810},{7,0,657},{8,0,886},{10,0,857},{14,0,440},{144,0,96},{6,11,1661\n},{7,11,1975},{7,11,2009},{7,11,2011},{136,0,533},{6,0,1453},{134,10,464},{132,\n11,715},{5,10,407},{11,10,204},{11,10,243},{11,10,489},{12,10,293},{19,10,37},{\n20,10,73},{150,10,38},{133,11,703},{4,0,211},{5,10,325},{7,0,1483},{8,10,5},{8,\n10,227},{9,10,105},{10,10,585},{140,10,614},{4,0,332},{5,0,335},{6,0,238},{7,0,\n269},{7,0,811},{7,0,1797},{8,0,836},{9,0,507},{141,0,242},{5,11,89},{7,11,1915},\n{9,11,185},{9,11,235},{9,11,496},{10,11,64},{10,11,270},{10,11,403},{10,11,469},\n{10,11,529},{10,11,590},{11,11,140},{11,11,860},{13,11,1},{13,11,422},{14,11,341\n},{14,11,364},{17,11,93},{18,11,113},{19,11,97},{147,11,113},{133,11,695},{5,11,\n6},{6,10,621},{6,11,183},{7,11,680},{7,11,978},{7,11,1013},{7,11,1055},{12,11,\n230},{13,10,504},{13,11,172},{16,0,19},{146,11,29},{136,0,156},{133,0,1009},{6,\n11,29},{139,11,63},{134,0,820},{134,10,218},{7,10,454},{7,10,782},{8,10,768},{\n140,10,686},{5,0,228},{6,0,203},{7,0,156},{8,0,347},{9,0,265},{15,11,8},{18,0,39\n},{18,11,39},{20,0,54},{20,11,54},{21,0,31},{21,11,31},{22,0,3},{22,11,3},{23,0,\n0},{151,11,0},{7,0,1131},{135,0,1468},{144,10,0},{134,0,1276},{10,10,676},{140,\n10,462},{132,11,311},{134,11,1740},{7,11,170},{8,11,90},{8,11,177},{8,11,415},{\n11,11,714},{142,11,281},{134,10,164},{6,0,1792},{138,0,849},{150,10,50},{5,0,291\n},{5,0,318},{7,0,765},{8,11,522},{9,0,389},{12,0,548},{142,11,328},{11,11,91},{\n13,11,129},{15,11,101},{145,11,125},{4,11,494},{6,11,74},{7,11,44},{7,11,407},{8\n,11,551},{12,11,17},{15,11,5},{148,11,11},{4,11,276},{133,11,296},{6,10,343},{7,\n10,195},{7,11,1777},{9,10,226},{10,10,197},{10,10,575},{11,10,502},{139,10,899},\n{10,0,525},{139,0,82},{4,11,7},{5,11,90},{5,11,158},{6,11,542},{7,11,221},{7,11,\n1574},{9,11,490},{10,11,540},{11,11,443},{11,11,757},{142,0,453},{135,0,666},{22\n,10,29},{150,11,29},{4,0,422},{147,10,8},{5,0,355},{145,0,0},{6,0,1873},{7,11,\n588},{9,0,918},{9,11,175},{138,11,530},{143,11,31},{7,10,1125},{9,10,143},{11,0,\n165},{14,10,405},{150,10,21},{9,0,260},{137,0,905},{5,11,872},{6,11,57},{6,11,\n479},{6,11,562},{7,11,471},{7,11,1060},{9,11,447},{9,11,454},{141,11,6},{138,11,\n704},{133,0,865},{5,0,914},{134,0,1625},{133,0,234},{5,11,31},{6,11,614},{7,0,\n1383},{145,11,61},{7,11,1200},{138,11,460},{6,11,424},{135,11,1866},{136,0,306},\n{5,10,959},{12,11,30},{13,11,148},{14,11,87},{14,11,182},{16,11,42},{18,11,92},{\n148,11,70},{6,0,1919},{6,0,1921},{9,0,923},{9,0,930},{9,0,941},{9,0,949},{9,0,\n987},{9,0,988},{9,0,992},{12,0,802},{12,0,815},{12,0,856},{12,0,885},{12,0,893},\n{12,0,898},{12,0,919},{12,0,920},{12,0,941},{12,0,947},{15,0,183},{15,0,185},{15\n,0,189},{15,0,197},{15,0,202},{15,0,233},{15,11,156},{18,0,218},{18,0,219},{146,\n0,233},{135,10,1759},{136,10,173},{5,11,13},{6,11,142},{13,0,163},{13,0,180},{18\n,0,78},{148,0,35},{134,10,266},{6,11,97},{7,11,116},{8,11,322},{8,11,755},{9,11,\n548},{10,11,714},{11,11,884},{141,11,324},{135,0,1312},{9,0,814},{137,11,676},{\n133,0,707},{135,0,1493},{6,0,421},{7,0,61},{7,0,1540},{10,0,11},{138,0,501},{7,\n11,866},{7,11,1163},{12,0,733},{140,0,766},{137,0,341},{142,0,98},{145,11,115},{\n135,11,1111},{136,10,300},{136,0,1014},{8,11,1},{9,11,112},{138,11,326},{132,11,\n730},{5,11,488},{6,11,527},{7,11,489},{7,11,1636},{8,11,121},{8,11,144},{8,11,\n359},{9,11,193},{9,11,241},{9,11,336},{9,11,882},{11,11,266},{11,11,372},{11,11,\n944},{12,11,401},{140,11,641},{6,0,971},{134,0,1121},{6,0,102},{7,0,72},{15,0,\n142},{147,0,67},{151,0,30},{135,0,823},{134,0,1045},{5,10,427},{5,10,734},{7,10,\n478},{136,10,52},{7,0,1930},{11,10,217},{142,10,165},{6,0,1512},{135,0,1870},{9,\n11,31},{10,11,244},{10,11,699},{12,11,149},{141,11,497},{133,11,377},{145,11,101\n},{10,11,158},{13,11,13},{13,11,137},{13,11,258},{14,11,111},{14,11,225},{14,11,\n253},{14,11,304},{14,11,339},{14,11,417},{146,11,33},{6,0,87},{6,10,1734},{7,10,\n20},{7,10,1056},{8,10,732},{9,10,406},{9,10,911},{138,10,694},{134,0,1243},{137,\n0,245},{7,0,68},{8,0,48},{8,0,88},{8,0,582},{8,0,681},{9,0,373},{9,0,864},{11,0,\n157},{11,0,336},{11,0,843},{148,0,27},{8,11,663},{144,11,8},{133,10,613},{4,0,88\n},{5,0,137},{5,0,174},{5,0,777},{6,0,1664},{6,0,1725},{7,0,77},{7,0,426},{7,0,\n1317},{7,0,1355},{8,0,126},{8,0,563},{9,0,523},{9,0,750},{10,0,310},{10,0,836},{\n11,0,42},{11,0,318},{11,0,731},{12,0,68},{12,0,92},{12,0,507},{12,0,692},{13,0,\n81},{13,0,238},{13,0,374},{14,0,436},{18,0,138},{19,0,78},{19,0,111},{20,0,55},{\n20,0,77},{148,0,92},{141,0,418},{4,0,938},{137,0,625},{138,0,351},{5,11,843},{7,\n10,32},{7,10,984},{8,10,85},{8,10,709},{9,10,579},{9,10,847},{9,10,856},{10,10,\n799},{11,10,258},{11,10,1007},{12,10,331},{12,10,615},{13,10,188},{13,10,435},{\n14,10,8},{15,10,165},{16,10,27},{148,10,40},{6,0,1668},{7,0,1499},{8,0,117},{9,0\n,314},{138,0,174},{135,0,707},{132,11,554},{133,11,536},{5,0,403},{5,11,207},{9,\n11,79},{11,11,625},{145,11,7},{132,11,424},{136,11,785},{4,10,167},{135,10,82},{\n9,0,7},{9,11,7},{23,0,6},{151,11,6},{5,10,62},{6,0,282},{6,10,534},{7,10,74},{7,\n10,678},{7,10,684},{7,10,1043},{7,10,1072},{8,10,280},{8,10,541},{8,10,686},{9,\n10,258},{10,10,519},{11,10,252},{140,10,282},{138,10,33},{132,10,359},{4,0,44},{\n5,0,311},{6,0,156},{7,0,639},{7,0,762},{7,0,1827},{9,0,8},{9,0,462},{148,0,83},{\n7,11,769},{9,11,18},{138,11,358},{4,0,346},{4,11,896},{6,11,1777},{7,0,115},{9,0\n,180},{9,0,456},{138,0,363},{133,10,211},{7,0,761},{7,0,1051},{137,0,545},{6,10,\n145},{141,10,336},{7,11,750},{9,11,223},{11,11,27},{11,11,466},{12,11,624},{14,\n11,265},{146,11,61},{6,0,752},{6,0,768},{6,0,1195},{6,0,1254},{6,0,1619},{137,0,\n835},{6,0,1936},{8,0,930},{136,0,960},{132,10,263},{132,11,249},{4,10,916},{140,\n0,653},{4,11,603},{133,11,661},{4,11,11},{6,11,128},{7,11,231},{7,11,1533},{8,0,\n344},{138,11,725},{134,0,1483},{134,0,875},{6,0,185},{7,0,1899},{9,0,875},{139,0\n,673},{15,10,155},{144,10,79},{4,10,599},{6,10,1634},{7,0,93},{7,0,210},{7,0,\n1223},{7,10,67},{7,10,691},{7,10,979},{7,10,1697},{8,0,451},{8,0,460},{8,10,207}\n,{8,10,214},{8,10,231},{8,10,294},{8,10,336},{8,10,428},{8,10,471},{8,10,622},{8\n,10,626},{8,10,679},{8,10,759},{8,10,829},{9,10,11},{9,10,246},{9,10,484},{9,10,\n573},{9,10,706},{9,10,762},{9,10,798},{9,10,855},{9,10,870},{9,10,912},{10,10,\n303},{10,10,335},{10,10,424},{10,10,461},{10,10,543},{10,10,759},{10,10,814},{11\n,0,353},{11,0,475},{11,10,59},{11,10,235},{11,10,590},{11,10,929},{11,10,963},{\n11,10,987},{12,10,114},{12,10,182},{12,10,226},{12,10,332},{12,10,439},{12,10,\n575},{12,10,598},{12,10,675},{13,10,8},{13,10,125},{13,10,194},{13,10,287},{14,\n10,197},{14,10,383},{15,10,53},{17,10,63},{19,10,46},{19,10,98},{19,10,106},{148\n,10,85},{132,11,476},{4,0,327},{5,0,478},{7,0,1332},{136,0,753},{5,0,1020},{133,\n0,1022},{135,11,1807},{4,0,103},{133,0,401},{4,0,499},{135,0,1421},{10,0,207},{\n13,0,164},{147,10,126},{9,11,20},{10,11,324},{139,11,488},{132,0,96},{9,11,280},\n{138,11,134},{135,0,968},{133,10,187},{135,10,1286},{5,11,112},{6,11,103},{134,\n11,150},{4,10,215},{8,0,914},{9,10,38},{10,0,3},{11,10,23},{11,10,127},{139,10,\n796},{135,0,399},{6,0,563},{137,0,224},{6,0,704},{134,0,1214},{4,11,708},{8,11,\n15},{9,11,50},{9,11,386},{11,11,18},{11,11,529},{140,11,228},{4,11,563},{7,11,\n109},{7,11,592},{7,11,637},{7,11,770},{7,11,1701},{8,11,436},{8,11,463},{9,11,60\n},{9,11,335},{9,11,904},{10,11,73},{11,11,434},{12,11,585},{13,11,331},{18,11,\n110},{148,11,60},{134,0,1559},{132,11,502},{6,11,347},{138,11,161},{4,11,33},{5,\n11,102},{5,11,500},{6,11,284},{7,11,1079},{7,11,1423},{7,11,1702},{8,11,470},{9,\n11,554},{9,11,723},{139,11,333},{7,11,246},{135,11,840},{6,11,10},{8,11,571},{9,\n11,739},{143,11,91},{5,11,626},{8,0,861},{10,0,905},{12,0,730},{140,0,789},{134,\n0,946},{5,0,746},{12,0,333},{12,11,333},{14,0,332},{142,11,332},{5,11,18},{6,11,\n526},{13,11,24},{13,11,110},{19,11,5},{147,11,44},{4,0,910},{5,0,832},{135,10,\n2002},{10,11,768},{139,11,787},{4,11,309},{5,11,462},{7,11,970},{135,11,1097},{4\n,10,28},{5,10,440},{7,10,248},{11,10,833},{140,10,344},{134,10,1654},{6,0,632},{\n6,0,652},{6,0,1272},{6,0,1384},{134,0,1560},{134,11,1704},{5,10,853},{134,0,1393\n},{6,10,249},{7,10,1234},{139,10,573},{5,11,86},{7,11,743},{9,11,85},{10,11,281}\n,{10,11,432},{11,11,490},{12,11,251},{13,11,118},{14,11,378},{146,11,143},{5,11,\n524},{133,11,744},{134,0,1514},{10,0,201},{142,0,319},{7,0,717},{7,10,392},{8,10\n,20},{8,10,172},{8,10,690},{9,10,383},{9,10,845},{10,0,510},{11,10,293},{11,10,\n832},{11,10,920},{11,10,984},{141,10,221},{134,0,1381},{5,10,858},{133,10,992},{\n8,0,528},{137,0,348},{10,11,107},{140,11,436},{4,0,20},{133,0,616},{134,0,1251},\n{132,11,927},{10,11,123},{12,11,670},{13,11,371},{14,11,142},{146,11,94},{134,0,\n1163},{7,11,1149},{137,11,156},{134,0,307},{133,11,778},{7,0,1091},{135,0,1765},\n{5,11,502},{6,10,268},{137,10,62},{8,11,196},{10,11,283},{139,11,406},{4,0,26},{\n5,0,429},{6,0,245},{7,0,704},{7,0,1379},{135,0,1474},{133,11,855},{132,0,881},{4\n,0,621},{135,11,1596},{7,11,1400},{9,11,446},{138,11,45},{6,0,736},{138,10,106},\n{133,0,542},{134,0,348},{133,0,868},{136,0,433},{135,0,1495},{138,0,771},{6,10,\n613},{136,10,223},{138,0,215},{141,0,124},{136,11,391},{135,11,172},{132,10,670}\n,{140,0,55},{9,10,40},{139,10,136},{7,0,62},{147,0,112},{132,0,856},{132,11,568}\n,{11,10,259},{140,0,270},{8,0,572},{137,0,698},{4,11,732},{9,10,310},{137,10,682\n},{142,10,296},{134,0,939},{136,11,733},{135,11,1435},{7,10,1401},{135,10,1476},\n{4,10,296},{6,0,352},{7,10,401},{7,10,1410},{7,10,1594},{7,10,1674},{8,10,63},{8\n,10,660},{137,10,74},{4,11,428},{133,11,668},{4,10,139},{4,10,388},{140,10,188},\n{7,11,2015},{140,11,665},{132,0,647},{146,0,10},{138,0,220},{142,0,464},{132,0,\n109},{134,0,1746},{4,10,747},{6,0,515},{6,11,1623},{6,11,1681},{7,10,649},{7,10,\n1479},{135,10,1583},{133,10,232},{135,0,566},{137,10,887},{4,0,40},{10,0,67},{11\n,0,117},{11,0,768},{139,0,935},{132,0,801},{7,0,992},{8,0,301},{9,0,722},{12,0,\n63},{13,0,29},{14,0,161},{143,0,18},{139,0,923},{6,11,1748},{8,11,715},{9,11,802\n},{10,11,46},{10,11,819},{13,11,308},{14,11,351},{14,11,363},{146,11,67},{137,11\n,745},{4,10,14},{7,0,1145},{7,10,1801},{10,10,748},{141,10,458},{4,11,63},{5,11,\n347},{134,11,474},{135,0,568},{4,10,425},{7,11,577},{7,11,1432},{9,11,475},{9,11\n,505},{9,11,526},{9,11,609},{9,11,689},{9,11,726},{9,11,735},{9,11,738},{10,11,\n556},{10,11,674},{10,11,684},{11,11,89},{11,11,202},{11,11,272},{11,11,380},{11,\n11,415},{11,11,505},{11,11,537},{11,11,550},{11,11,562},{11,11,640},{11,11,667},\n{11,11,688},{11,11,847},{11,11,927},{11,11,930},{11,11,940},{12,11,144},{12,11,\n325},{12,11,329},{12,11,389},{12,11,403},{12,11,451},{12,11,515},{12,11,604},{12\n,11,616},{12,11,626},{13,11,66},{13,11,131},{13,11,167},{13,11,236},{13,11,368},\n{13,11,411},{13,11,434},{13,11,453},{13,11,461},{13,11,474},{14,11,59},{14,11,60\n},{14,11,139},{14,11,152},{14,11,276},{14,11,353},{14,11,402},{15,11,28},{15,11,\n81},{15,11,123},{15,11,152},{18,11,136},{148,11,88},{137,0,247},{135,11,1622},{9\n,11,544},{11,11,413},{144,11,25},{4,0,645},{6,10,1768},{7,0,825},{135,11,89},{\n140,0,328},{5,10,943},{134,10,1779},{134,0,1363},{5,10,245},{6,10,576},{7,10,582\n},{136,10,225},{134,0,1280},{5,11,824},{133,11,941},{7,11,440},{8,11,230},{139,\n11,106},{5,0,28},{6,0,204},{10,0,320},{10,0,583},{13,0,502},{14,0,72},{14,0,274}\n,{14,0,312},{14,0,344},{15,0,159},{16,0,62},{16,0,69},{17,0,30},{18,0,42},{18,0,\n53},{18,0,84},{18,0,140},{19,0,68},{19,0,85},{20,0,5},{20,0,45},{20,0,101},{22,0\n,7},{150,0,20},{4,0,558},{6,0,390},{7,0,162},{7,0,689},{9,0,360},{138,0,653},{\n134,0,764},{6,0,862},{137,0,833},{5,0,856},{6,0,1672},{6,0,1757},{134,0,1781},{5\n,0,92},{10,0,736},{140,0,102},{6,0,1927},{6,0,1944},{8,0,924},{8,0,948},{10,0,\n967},{138,0,978},{134,0,1479},{5,0,590},{8,0,360},{9,0,213},{138,0,63},{134,0,\n1521},{6,0,709},{134,0,891},{132,10,443},{13,0,477},{14,0,120},{148,0,61},{4,11,\n914},{5,11,800},{133,11,852},{10,11,54},{141,11,115},{4,11,918},{133,11,876},{\n139,11,152},{4,11,92},{133,11,274},{135,11,1901},{9,11,800},{10,11,693},{11,11,\n482},{11,11,734},{139,11,789},{4,10,298},{137,0,483},{6,0,1213},{141,11,498},{\n135,11,1451},{133,11,743},{4,0,1022},{10,0,1000},{12,0,957},{12,0,980},{12,0,\n1013},{14,0,481},{144,0,116},{4,11,49},{7,11,280},{7,11,1633},{8,0,503},{145,0,\n29},{135,0,1712},{134,0,466},{136,11,47},{5,10,164},{7,10,121},{142,10,189},{7,\n10,812},{7,10,1261},{7,10,1360},{9,10,632},{140,10,352},{139,10,556},{132,0,731}\n,{5,11,272},{5,11,908},{5,11,942},{7,11,1008},{7,11,1560},{8,11,197},{9,11,47},{\n11,11,538},{139,11,742},{4,10,172},{9,10,611},{10,10,436},{12,10,673},{141,10,\n255},{133,10,844},{10,0,484},{11,0,754},{12,0,457},{14,0,171},{14,0,389},{146,0,\n153},{9,10,263},{10,10,147},{138,10,492},{137,11,891},{138,0,241},{133,10,537},{\n6,0,2005},{136,0,964},{137,10,842},{151,11,8},{4,11,407},{132,11,560},{135,11,\n1884},{6,0,1100},{134,0,1242},{135,0,954},{5,10,230},{5,10,392},{6,10,420},{9,10\n,568},{140,10,612},{4,11,475},{11,11,35},{11,11,90},{13,11,7},{13,11,71},{13,11,\n177},{142,11,422},{136,11,332},{135,0,1958},{6,0,549},{8,0,34},{8,0,283},{9,0,\n165},{138,0,475},{10,0,952},{12,0,966},{140,0,994},{5,0,652},{5,0,701},{135,0,\n449},{4,0,655},{7,0,850},{17,0,75},{146,0,137},{4,0,146},{5,10,41},{7,0,1618},{7\n,10,1459},{7,10,1469},{7,10,1859},{8,0,670},{9,10,549},{139,10,905},{133,10,696}\n,{6,0,159},{6,0,364},{7,0,516},{137,0,518},{135,0,1439},{6,11,222},{7,11,636},{7\n,11,1620},{8,11,409},{9,11,693},{139,11,77},{13,0,151},{141,11,45},{4,10,771},{4\n,11,336},{134,0,1027},{139,11,392},{10,11,121},{11,11,175},{149,11,16},{8,0,950}\n,{138,0,983},{133,10,921},{135,0,993},{6,10,180},{7,10,1137},{8,10,751},{139,10,\n805},{7,0,501},{9,0,111},{10,0,141},{11,0,332},{13,0,43},{13,0,429},{14,0,130},{\n14,0,415},{145,0,102},{4,10,183},{5,11,882},{7,10,271},{11,10,824},{11,10,952},{\n13,10,278},{13,10,339},{13,10,482},{14,10,424},{148,10,99},{4,10,19},{5,10,477},\n{5,10,596},{6,10,505},{7,10,1221},{11,10,907},{12,10,209},{141,10,214},{135,10,\n1215},{133,0,452},{132,11,426},{5,0,149},{136,0,233},{133,0,935},{6,11,58},{7,11\n,654},{7,11,745},{7,11,1969},{8,11,240},{8,11,675},{9,11,479},{9,11,731},{10,11,\n330},{10,11,593},{10,11,817},{11,11,32},{11,11,133},{11,11,221},{145,11,68},{7,\n11,102},{9,11,538},{12,0,582},{146,0,131},{136,0,801},{134,10,1645},{132,0,70},{\n6,10,92},{6,10,188},{7,10,1269},{7,10,1524},{7,10,1876},{10,10,228},{139,10,1020\n},{4,10,459},{133,10,966},{138,0,369},{12,10,330},{144,0,36},{141,11,366},{6,10,\n18},{7,0,721},{7,10,932},{8,10,757},{9,10,54},{9,10,65},{9,10,844},{10,0,236},{\n10,10,113},{10,10,315},{10,10,798},{11,10,153},{12,0,204},{12,10,151},{12,10,392\n},{12,10,666},{142,10,248},{7,0,241},{8,10,548},{9,10,532},{10,0,430},{10,10,117\n},{11,10,351},{11,10,375},{143,10,23},{134,10,1742},{133,10,965},{133,11,566},{6\n,11,48},{135,11,63},{134,10,182},{10,10,65},{10,10,488},{138,10,497},{6,11,114},\n{7,11,1224},{7,11,1556},{136,11,3},{134,0,1817},{8,11,576},{137,11,267},{6,0,\n1078},{144,0,16},{9,10,588},{138,10,260},{138,0,1021},{5,0,406},{134,0,2022},{\n133,11,933},{6,0,69},{135,0,117},{7,0,1830},{136,11,427},{4,0,432},{135,0,824},{\n134,10,1786},{133,0,826},{139,11,67},{133,11,759},{135,10,308},{137,0,816},{133,\n0,1000},{4,0,297},{6,0,529},{7,0,152},{7,0,713},{7,0,1845},{8,0,710},{8,0,717},{\n12,0,639},{140,0,685},{7,0,423},{136,10,588},{136,10,287},{136,0,510},{134,0,\n1048},{6,0,618},{7,11,56},{7,11,1989},{8,11,337},{8,11,738},{9,11,600},{10,11,\n483},{12,11,37},{13,11,447},{142,11,92},{4,0,520},{135,0,575},{8,0,990},{138,0,\n977},{135,11,774},{9,11,347},{11,11,24},{140,11,170},{136,11,379},{140,10,290},{\n132,11,328},{4,0,321},{134,0,569},{4,11,101},{135,11,1171},{5,11,833},{7,0,723},\n{7,0,1135},{136,11,744},{7,10,719},{8,10,809},{136,10,834},{8,0,921},{136,10,796\n},{5,10,210},{6,10,213},{7,10,60},{10,10,364},{139,10,135},{5,0,397},{5,10,607},\n{6,0,154},{7,0,676},{8,0,443},{8,0,609},{8,10,326},{8,10,490},{9,0,24},{9,0,325}\n,{10,0,35},{11,0,535},{11,0,672},{11,0,1018},{12,0,637},{144,0,30},{4,10,701},{5\n,10,472},{6,11,9},{6,11,397},{7,11,53},{7,11,1742},{9,10,758},{10,11,632},{11,11\n,828},{140,11,146},{135,10,380},{135,10,1947},{148,11,109},{10,10,278},{138,11,\n278},{134,0,856},{4,10,386},{7,0,139},{8,10,405},{8,10,728},{9,10,497},{11,10,\n110},{11,10,360},{15,10,37},{144,10,84},{141,0,282},{133,0,981},{5,0,288},{7,10,\n1452},{7,10,1480},{8,10,634},{140,10,472},{7,0,1890},{8,11,367},{10,11,760},{14,\n11,79},{20,11,17},{152,11,0},{4,10,524},{136,10,810},{4,0,56},{7,0,1791},{8,0,\n607},{8,0,651},{11,0,465},{11,0,835},{12,0,337},{141,0,480},{10,10,238},{141,10,\n33},{11,11,417},{12,11,223},{140,11,265},{9,0,158},{10,0,411},{140,0,261},{133,\n10,532},{133,10,997},{12,11,186},{12,11,292},{14,11,100},{146,11,70},{6,0,1403},\n{136,0,617},{134,0,1205},{139,0,563},{4,0,242},{134,0,333},{4,11,186},{5,11,157}\n,{8,11,168},{138,11,6},{132,0,369},{133,11,875},{5,10,782},{5,10,829},{134,10,\n1738},{134,0,622},{135,11,1272},{6,0,1407},{7,11,111},{136,11,581},{7,10,1823},{\n139,10,693},{7,0,160},{10,0,624},{142,0,279},{132,0,363},{10,11,589},{12,11,111}\n,{13,11,260},{14,11,82},{18,11,63},{147,11,45},{7,11,1364},{7,11,1907},{141,11,\n158},{4,11,404},{4,11,659},{135,11,675},{13,11,211},{14,11,133},{14,11,204},{15,\n11,64},{15,11,69},{15,11,114},{16,11,10},{19,11,23},{19,11,35},{19,11,39},{19,11\n,51},{19,11,71},{19,11,75},{152,11,15},{4,10,78},{5,10,96},{5,10,182},{7,10,1724\n},{7,10,1825},{10,10,394},{10,10,471},{11,10,532},{14,10,340},{145,10,88},{135,\n10,1964},{133,11,391},{11,11,887},{14,11,365},{142,11,375},{5,11,540},{6,11,1697\n},{7,11,222},{136,11,341},{134,11,78},{9,0,601},{9,0,619},{10,0,505},{10,0,732},\n{11,0,355},{140,0,139},{134,0,292},{139,0,174},{5,0,177},{6,0,616},{7,0,827},{9,\n0,525},{138,0,656},{6,10,215},{7,10,1028},{7,10,1473},{7,10,1721},{9,10,424},{10\n,0,31},{138,10,779},{135,10,584},{136,11,293},{134,0,685},{135,11,1868},{133,11,\n460},{6,10,67},{7,0,647},{7,10,1630},{9,10,354},{9,10,675},{10,10,830},{14,10,80\n},{145,10,80},{4,0,161},{133,0,631},{6,10,141},{7,10,225},{9,10,59},{9,10,607},{\n10,10,312},{11,10,687},{12,10,555},{13,10,373},{13,10,494},{148,10,58},{7,11,965\n},{7,11,1460},{135,11,1604},{136,10,783},{134,11,388},{4,11,511},{6,0,722},{6,0,\n1267},{9,11,333},{9,11,379},{10,11,602},{11,11,441},{11,11,723},{11,11,976},{140\n,11,357},{134,0,1797},{135,0,1684},{5,11,938},{8,11,707},{9,0,469},{9,0,709},{12\n,0,512},{14,0,65},{145,0,12},{7,0,1230},{136,0,531},{10,0,229},{11,0,73},{11,0,\n376},{139,0,433},{12,0,268},{12,0,640},{142,0,119},{7,10,430},{139,10,46},{6,0,\n558},{7,0,651},{8,0,421},{9,0,0},{10,0,34},{139,0,1008},{5,10,602},{6,0,106},{7,\n0,1786},{7,0,1821},{7,10,2018},{9,0,102},{9,0,763},{137,10,418},{5,0,65},{6,0,\n416},{7,0,1720},{7,0,1924},{8,10,677},{10,0,109},{11,0,14},{11,0,70},{11,0,569},\n{11,0,735},{15,0,153},{148,0,80},{135,11,1625},{137,11,772},{136,0,595},{6,11,\n469},{7,11,1709},{138,11,515},{7,0,1832},{138,0,374},{9,0,106},{9,0,163},{9,0,\n296},{10,0,167},{10,0,172},{10,0,777},{139,0,16},{6,0,6},{7,0,81},{7,0,771},{7,0\n,1731},{9,0,405},{138,0,421},{4,11,500},{135,11,938},{5,11,68},{134,11,383},{5,0\n,881},{133,0,885},{6,0,854},{6,0,1132},{6,0,1495},{6,0,1526},{6,0,1533},{134,0,\n1577},{4,11,337},{6,11,353},{7,11,1934},{8,11,488},{137,11,429},{7,11,236},{7,11\n,1795},{8,11,259},{9,11,135},{9,11,177},{10,11,825},{11,11,115},{11,11,370},{11,\n11,405},{11,11,604},{12,11,10},{12,11,667},{12,11,669},{13,11,76},{14,11,310},{\n15,11,76},{15,11,147},{148,11,23},{5,0,142},{134,0,546},{4,11,15},{5,11,22},{6,\n11,244},{7,11,40},{7,11,200},{7,11,906},{7,11,1199},{9,11,616},{10,11,716},{11,\n11,635},{11,11,801},{140,11,458},{5,0,466},{7,10,329},{11,0,571},{12,0,198},{13,\n0,283},{14,0,186},{15,0,21},{143,0,103},{4,0,185},{5,0,257},{5,0,839},{5,0,936},\n{7,11,1735},{9,0,399},{10,0,258},{10,0,395},{10,0,734},{11,0,1014},{12,0,23},{13\n,0,350},{14,0,150},{147,0,6},{12,11,36},{141,11,337},{5,11,598},{7,11,791},{8,11\n,108},{137,11,123},{132,10,469},{7,0,404},{7,0,1377},{7,0,1430},{7,0,2017},{8,0,\n149},{8,0,239},{8,0,512},{8,0,793},{8,0,818},{9,0,474},{9,0,595},{10,0,122},{10,\n0,565},{10,0,649},{10,0,783},{11,0,239},{11,0,295},{11,0,447},{11,0,528},{11,0,\n639},{11,0,800},{12,0,25},{12,0,77},{12,0,157},{12,0,256},{12,0,316},{12,0,390},\n{12,0,391},{12,0,395},{12,0,478},{12,0,503},{12,0,592},{12,0,680},{13,0,50},{13,\n0,53},{13,0,132},{13,0,198},{13,0,322},{13,0,415},{13,0,511},{14,0,71},{14,0,395\n},{15,0,71},{15,0,136},{17,0,123},{18,0,93},{147,0,58},{136,0,712},{134,10,1743}\n,{5,10,929},{6,10,340},{8,10,376},{136,10,807},{6,0,1848},{8,0,860},{10,0,856},{\n10,0,859},{10,0,925},{10,0,941},{140,0,762},{6,0,629},{6,0,906},{9,0,810},{140,0\n,652},{5,10,218},{7,10,1610},{138,10,83},{7,10,1512},{135,10,1794},{4,0,377},{4,\n11,155},{7,11,1689},{11,10,0},{16,10,78},{152,0,13},{4,11,164},{5,11,151},{5,11,\n730},{5,11,741},{7,11,498},{7,11,870},{7,11,1542},{12,11,213},{14,11,36},{14,11,\n391},{17,11,111},{18,11,6},{18,11,46},{18,11,151},{19,11,36},{20,11,32},{20,11,\n56},{20,11,69},{20,11,102},{21,11,4},{22,11,8},{22,11,10},{22,11,14},{150,11,31}\n,{5,10,571},{135,0,1842},{4,10,455},{4,11,624},{135,11,1752},{134,0,1501},{4,11,\n492},{5,11,451},{6,10,161},{7,10,372},{137,10,597},{132,10,349},{4,0,180},{135,0\n,1906},{135,11,835},{141,11,70},{132,0,491},{137,10,751},{6,10,432},{139,10,322}\n,{4,0,171},{138,0,234},{6,11,113},{135,11,436},{4,0,586},{7,0,1186},{138,0,631},\n{5,10,468},{10,10,325},{11,10,856},{12,10,345},{143,10,104},{5,10,223},{10,11,\n592},{10,11,753},{12,11,317},{12,11,355},{12,11,465},{12,11,469},{12,11,560},{12\n,11,578},{141,11,243},{132,10,566},{135,11,520},{4,10,59},{135,10,1394},{6,10,\n436},{139,10,481},{4,10,48},{5,10,271},{7,10,953},{7,11,1878},{9,0,931},{10,0,\n334},{148,0,71},{5,10,610},{8,10,457},{139,0,170},{133,10,755},{6,0,1587},{135,\n10,1217},{4,10,197},{149,11,26},{133,11,585},{137,11,521},{133,0,765},{133,10,\n217},{139,11,586},{133,0,424},{9,11,752},{12,11,610},{13,11,431},{16,11,59},{146\n,11,109},{136,0,714},{4,11,307},{135,0,685},{9,0,420},{10,0,269},{10,0,285},{10,\n0,576},{11,0,397},{13,0,175},{145,0,90},{132,0,429},{133,11,964},{9,11,463},{138\n,11,595},{7,0,18},{7,0,699},{7,0,1966},{8,0,752},{9,0,273},{9,0,412},{9,0,703},{\n10,0,71},{10,0,427},{138,0,508},{4,10,165},{7,10,1398},{135,10,1829},{4,0,53},{5\n,0,186},{7,0,752},{7,0,828},{142,0,116},{8,0,575},{10,0,289},{139,0,319},{132,0,\n675},{134,0,1424},{4,11,75},{5,11,180},{6,11,500},{7,11,58},{7,11,710},{138,11,\n645},{133,11,649},{6,11,276},{7,11,282},{7,11,879},{7,11,924},{8,11,459},{9,11,\n599},{9,11,754},{11,11,574},{12,11,128},{12,11,494},{13,11,52},{13,11,301},{15,\n11,30},{143,11,132},{6,0,647},{134,0,1095},{5,10,9},{7,10,297},{7,10,966},{140,\n10,306},{132,11,200},{134,0,1334},{5,10,146},{6,10,411},{138,10,721},{6,0,209},{\n6,0,1141},{6,0,1288},{8,0,468},{9,0,210},{11,0,36},{12,0,28},{12,0,630},{13,0,21\n},{13,0,349},{14,0,7},{145,0,13},{6,10,177},{135,10,467},{4,0,342},{135,0,1179},\n{10,11,454},{140,11,324},{4,0,928},{133,0,910},{6,11,225},{7,0,1838},{137,11,211\n},{16,0,101},{20,0,115},{20,0,118},{148,0,122},{4,0,496},{135,0,856},{4,0,318},{\n7,11,718},{11,0,654},{139,11,102},{8,11,58},{9,11,724},{11,11,809},{13,11,113},{\n145,11,72},{5,10,200},{6,11,345},{135,11,1247},{8,11,767},{8,11,803},{9,11,301},\n{137,11,903},{7,0,915},{7,11,1949},{8,0,247},{8,11,674},{147,0,0},{4,0,202},{5,0\n,382},{6,0,454},{7,0,936},{7,0,1803},{8,0,758},{9,0,375},{9,0,895},{10,0,743},{\n10,0,792},{11,0,978},{11,0,1012},{142,0,109},{7,0,1150},{7,0,1425},{7,0,1453},{\n140,0,513},{134,11,259},{138,0,791},{11,0,821},{12,0,110},{12,0,153},{18,0,41},{\n150,0,19},{134,10,481},{132,0,796},{6,0,445},{8,11,254},{137,0,909},{10,0,776},{\n13,0,345},{142,0,425},{4,10,84},{7,10,1482},{10,10,76},{138,10,142},{135,11,742}\n,{5,10,1015},{134,0,578},{4,10,315},{5,10,507},{6,0,1387},{135,10,1370},{4,0,438\n},{133,0,555},{136,0,766},{133,11,248},{134,10,1722},{4,11,116},{5,11,95},{5,11,\n445},{7,11,1688},{8,11,29},{9,11,272},{11,11,509},{139,11,915},{135,0,541},{133,\n11,543},{8,10,222},{8,10,476},{9,10,238},{11,10,516},{11,10,575},{15,10,109},{\n146,10,100},{6,0,880},{134,0,1191},{5,11,181},{136,11,41},{134,0,1506},{132,11,\n681},{7,11,25},{8,11,202},{138,11,536},{139,0,983},{137,0,768},{132,0,584},{9,11\n,423},{140,11,89},{8,11,113},{9,11,877},{10,11,554},{11,11,83},{12,11,136},{147,\n11,109},{7,10,706},{7,10,1058},{138,10,538},{133,11,976},{4,11,206},{135,11,746}\n,{136,11,526},{140,0,737},{11,10,92},{11,10,196},{11,10,409},{11,10,450},{11,10,\n666},{11,10,777},{12,10,262},{13,10,385},{13,10,393},{15,10,115},{16,10,45},{145\n,10,82},{4,0,226},{4,0,326},{4,11,319},{5,11,699},{7,0,1770},{138,11,673},{6,10,\n40},{135,10,1781},{5,0,426},{8,0,30},{9,0,2},{11,0,549},{147,0,122},{6,0,1161},{\n134,0,1329},{138,10,97},{6,10,423},{7,10,665},{135,10,1210},{7,11,13},{8,11,226}\n,{10,11,537},{11,11,570},{11,11,605},{11,11,799},{11,11,804},{12,11,85},{12,11,\n516},{12,11,623},{13,11,112},{13,11,361},{14,11,77},{14,11,78},{17,11,28},{147,\n11,110},{132,11,769},{132,11,551},{132,11,728},{147,0,117},{9,11,57},{9,11,459},\n{10,11,425},{11,11,119},{12,11,184},{12,11,371},{13,11,358},{145,11,51},{5,11,\n188},{5,11,814},{8,11,10},{9,11,421},{9,11,729},{10,11,609},{139,11,689},{134,11\n,624},{135,11,298},{135,0,462},{4,0,345},{139,10,624},{136,10,574},{4,0,385},{7,\n0,265},{135,0,587},{4,11,528},{134,0,808},{133,0,398},{132,10,354},{4,0,347},{5,\n0,423},{5,0,996},{135,0,1329},{135,10,1558},{7,0,1259},{9,0,125},{139,0,65},{5,0\n,136},{6,0,136},{136,0,644},{5,11,104},{6,11,173},{135,11,1631},{135,0,469},{133\n,10,830},{4,0,278},{5,0,465},{135,0,1367},{7,11,810},{8,11,138},{8,11,342},{9,11\n,84},{10,11,193},{11,11,883},{140,11,359},{5,10,496},{135,10,203},{4,0,433},{133\n,0,719},{6,10,547},{134,11,95},{5,10,88},{137,10,239},{6,11,406},{10,11,409},{10\n,11,447},{11,11,44},{140,11,100},{134,0,1423},{7,10,650},{135,10,1310},{134,0,\n749},{135,11,1243},{135,0,1363},{6,0,381},{7,0,645},{7,0,694},{7,10,1076},{8,0,\n546},{9,10,80},{11,10,78},{11,10,421},{11,10,534},{140,10,545},{134,11,1636},{\n135,11,1344},{7,10,274},{11,10,479},{11,10,507},{140,0,277},{4,11,282},{6,0,705}\n,{6,0,783},{6,0,1275},{6,0,1481},{7,11,1034},{11,11,398},{11,11,634},{12,11,1},{\n12,11,79},{12,11,544},{14,11,237},{17,11,10},{146,11,20},{134,0,453},{4,0,555},{\n4,10,497},{7,10,1584},{8,0,536},{10,0,288},{139,0,1005},{5,11,118},{5,11,499},{6\n,11,476},{7,11,600},{7,11,888},{135,11,1096},{138,0,987},{7,0,1107},{7,10,261},{\n7,10,1115},{7,10,1354},{7,10,1588},{7,10,1705},{7,10,1902},{9,10,465},{10,10,248\n},{10,10,349},{10,10,647},{11,10,527},{11,10,660},{11,10,669},{12,10,529},{141,\n10,305},{7,11,296},{7,11,596},{8,11,560},{8,11,586},{9,11,612},{11,11,100},{11,\n11,304},{12,11,46},{13,11,89},{14,11,112},{145,11,122},{9,0,370},{138,0,90},{136\n,10,13},{132,0,860},{7,10,642},{8,10,250},{11,10,123},{11,10,137},{13,10,48},{\n142,10,95},{135,10,1429},{137,11,321},{132,0,257},{135,0,2031},{7,0,1768},{7,11,\n1599},{7,11,1723},{8,11,79},{8,11,106},{8,11,190},{8,11,302},{8,11,383},{9,11,\n119},{9,11,233},{9,11,298},{9,11,419},{9,11,471},{10,11,181},{10,11,406},{11,11,\n57},{11,11,85},{11,11,120},{11,11,177},{11,11,296},{11,11,382},{11,11,454},{11,\n11,758},{11,11,999},{12,11,27},{12,11,98},{12,11,131},{12,11,245},{12,11,312},{\n12,11,446},{12,11,454},{13,11,25},{13,11,98},{13,11,426},{13,11,508},{14,11,6},{\n14,11,163},{14,11,272},{14,11,277},{14,11,370},{15,11,95},{15,11,138},{15,11,167\n},{17,11,18},{17,11,38},{20,11,96},{149,11,32},{5,11,722},{134,11,1759},{145,11,\n16},{6,0,1071},{134,0,1561},{10,10,545},{140,10,301},{6,0,83},{6,0,1733},{135,0,\n1389},{4,0,835},{135,0,1818},{133,11,258},{4,10,904},{133,10,794},{134,0,2006},{\n5,11,30},{7,11,495},{8,11,134},{9,11,788},{140,11,438},{135,11,2004},{137,0,696}\n,{5,11,50},{6,11,439},{7,11,780},{135,11,1040},{7,11,772},{7,11,1104},{7,11,1647\n},{11,11,269},{11,11,539},{11,11,607},{11,11,627},{11,11,706},{11,11,975},{12,11\n,248},{12,11,311},{12,11,434},{12,11,600},{12,11,622},{13,11,297},{13,11,367},{\n13,11,485},{14,11,69},{14,11,409},{143,11,108},{5,11,1},{6,11,81},{138,11,520},{\n7,0,1718},{9,0,95},{9,0,274},{10,0,279},{10,0,317},{10,0,420},{11,0,303},{11,0,\n808},{12,0,134},{12,0,367},{13,0,149},{13,0,347},{14,0,349},{14,0,406},{18,0,22}\n,{18,0,89},{18,0,122},{147,0,47},{5,11,482},{8,11,98},{9,11,172},{10,11,222},{10\n,11,700},{10,11,822},{11,11,302},{11,11,778},{12,11,50},{12,11,127},{12,11,396},\n{13,11,62},{13,11,328},{14,11,122},{147,11,72},{7,10,386},{138,10,713},{6,10,7},\n{6,10,35},{7,10,147},{7,10,1069},{7,10,1568},{7,10,1575},{7,10,1917},{8,10,43},{\n8,10,208},{9,10,128},{9,10,866},{10,10,20},{11,10,981},{147,10,33},{133,0,26},{\n132,0,550},{5,11,2},{7,11,1494},{136,11,589},{6,11,512},{7,11,797},{8,11,253},{9\n,11,77},{10,11,1},{10,11,129},{10,11,225},{11,11,118},{11,11,226},{11,11,251},{\n11,11,430},{11,11,701},{11,11,974},{11,11,982},{12,11,64},{12,11,260},{12,11,488\n},{140,11,690},{7,10,893},{141,10,424},{134,0,901},{136,0,822},{4,0,902},{5,0,\n809},{134,0,122},{6,0,807},{134,0,1366},{5,11,748},{6,11,553},{135,0,262},{133,0\n,620},{4,0,34},{5,0,574},{7,0,279},{7,0,1624},{136,0,601},{6,10,322},{9,0,170},{\n9,10,552},{11,10,274},{13,10,209},{13,10,499},{14,10,85},{15,10,126},{145,10,70}\n,{132,0,537},{4,11,12},{7,11,420},{7,11,522},{7,11,809},{8,11,797},{141,11,88},{\n133,0,332},{8,10,83},{8,10,742},{8,10,817},{9,10,28},{9,10,29},{9,10,885},{10,10\n,387},{11,10,633},{11,10,740},{13,10,235},{13,10,254},{15,10,143},{143,10,146},{\n6,0,1909},{9,0,964},{12,0,822},{12,0,854},{12,0,865},{12,0,910},{12,0,938},{15,0\n,169},{15,0,208},{15,0,211},{18,0,205},{18,0,206},{18,0,220},{18,0,223},{152,0,\n24},{140,10,49},{5,11,528},{135,11,1580},{6,0,261},{8,0,182},{139,0,943},{134,0,\n1721},{4,0,933},{133,0,880},{136,11,321},{5,11,266},{9,11,290},{9,11,364},{10,11\n,293},{11,11,606},{142,11,45},{4,11,50},{6,0,1609},{6,11,510},{6,11,594},{9,11,\n121},{10,11,49},{10,11,412},{139,11,834},{7,0,895},{136,11,748},{132,11,466},{4,\n10,110},{10,10,415},{10,10,597},{142,10,206},{133,0,812},{135,11,281},{6,0,1890}\n,{6,0,1902},{6,0,1916},{7,10,205},{7,10,2000},{9,0,929},{9,0,942},{9,0,975},{9,0\n,984},{9,0,986},{9,0,1011},{9,0,1019},{12,0,804},{12,0,851},{12,0,867},{12,0,916\n},{12,0,923},{15,0,194},{15,0,204},{15,0,210},{15,0,222},{15,0,223},{15,0,229},{\n15,0,250},{18,0,179},{18,0,186},{146,0,192},{132,11,667},{135,0,778},{4,0,137},{\n7,0,1178},{135,0,1520},{134,0,1314},{4,11,242},{134,11,333},{6,0,1661},{7,0,1975\n},{7,0,2009},{135,0,2011},{134,0,1591},{4,10,283},{135,10,1194},{11,0,820},{150,\n0,51},{4,11,39},{5,11,36},{7,11,1843},{8,11,407},{11,11,144},{140,11,523},{134,\n10,1720},{4,11,510},{7,11,29},{7,11,66},{7,11,1980},{10,11,487},{10,11,809},{146\n,11,9},{5,0,89},{7,0,1915},{9,0,185},{9,0,235},{10,0,64},{10,0,270},{10,0,403},{\n10,0,469},{10,0,529},{10,0,590},{11,0,140},{11,0,860},{13,0,1},{13,0,422},{14,0,\n341},{14,0,364},{17,0,93},{18,0,113},{19,0,97},{147,0,113},{133,0,695},{6,0,987}\n,{134,0,1160},{5,0,6},{6,0,183},{7,0,680},{7,0,978},{7,0,1013},{7,0,1055},{12,0,\n230},{13,0,172},{146,0,29},{134,11,570},{132,11,787},{134,11,518},{6,0,29},{139,\n0,63},{132,11,516},{136,11,821},{132,0,311},{134,0,1740},{7,0,170},{8,0,90},{8,0\n,177},{8,0,415},{8,10,735},{11,0,714},{142,0,281},{134,0,1961},{135,11,1405},{4,\n11,10},{7,11,917},{139,11,786},{5,10,132},{9,10,486},{9,10,715},{10,10,458},{11,\n10,373},{11,10,668},{11,10,795},{11,10,897},{12,10,272},{12,10,424},{12,10,539},\n{12,10,558},{14,10,245},{14,10,263},{14,10,264},{14,10,393},{142,10,403},{11,0,\n91},{13,0,129},{15,0,101},{145,0,125},{135,0,1132},{4,0,494},{6,0,74},{7,0,44},{\n7,0,407},{12,0,17},{15,0,5},{148,0,11},{133,10,379},{5,0,270},{5,11,684},{6,10,\n89},{6,10,400},{7,10,1569},{7,10,1623},{7,10,1850},{8,10,218},{8,10,422},{9,10,\n570},{138,10,626},{4,0,276},{133,0,296},{6,0,1523},{134,11,27},{6,10,387},{7,10,\n882},{141,10,111},{6,10,224},{7,10,877},{137,10,647},{135,10,790},{4,0,7},{5,0,\n90},{5,0,158},{6,0,542},{7,0,221},{7,0,1574},{9,0,490},{10,0,540},{11,0,443},{\n139,0,757},{7,0,588},{9,0,175},{138,0,530},{135,10,394},{142,11,23},{134,0,786},\n{135,0,580},{7,0,88},{136,0,627},{5,0,872},{6,0,57},{7,0,471},{9,0,447},{137,0,\n454},{6,11,342},{6,11,496},{8,11,275},{137,11,206},{4,11,909},{133,11,940},{4,11\n,891},{134,0,735},{7,10,1409},{8,0,845},{136,0,916},{5,0,31},{134,0,614},{11,0,\n458},{12,0,15},{140,0,432},{8,0,330},{140,0,477},{4,0,530},{4,11,687},{5,0,521},\n{7,0,1200},{138,0,460},{6,0,424},{135,0,1866},{9,0,569},{12,0,12},{12,0,81},{12,\n0,319},{13,0,69},{14,0,259},{16,0,87},{17,0,1},{17,0,21},{17,0,24},{18,0,15},{18\n,0,56},{18,0,59},{18,0,127},{18,0,154},{19,0,19},{148,0,31},{7,0,1302},{136,10,\n38},{134,11,253},{5,10,261},{7,10,78},{7,10,199},{8,10,815},{9,10,126},{138,10,\n342},{5,0,595},{135,0,1863},{6,11,41},{141,11,160},{5,0,13},{134,0,142},{6,0,97}\n,{7,0,116},{7,11,1304},{8,0,322},{8,0,755},{9,0,548},{10,0,714},{10,11,477},{11,\n0,884},{141,0,324},{132,10,628},{134,11,1718},{7,10,266},{136,10,804},{135,10,\n208},{6,10,79},{7,0,1021},{135,10,1519},{7,0,1472},{135,0,1554},{6,11,362},{146,\n11,51},{7,0,1071},{7,0,1541},{7,0,1767},{7,0,1806},{11,0,162},{11,0,242},{11,0,\n452},{12,0,605},{15,0,26},{144,0,44},{136,10,741},{133,11,115},{145,0,115},{134,\n10,376},{6,0,1406},{134,0,1543},{5,11,193},{12,11,178},{13,11,130},{145,11,84},{\n135,0,1111},{5,11,705},{8,0,1},{9,0,650},{9,11,606},{138,0,326},{5,0,488},{6,0,\n527},{7,0,489},{7,0,1636},{8,0,121},{8,0,144},{8,0,359},{9,0,193},{9,0,241},{9,0\n,336},{9,0,882},{11,0,266},{11,0,372},{11,0,944},{12,0,401},{140,0,641},{135,11,\n174},{6,0,267},{7,10,244},{7,10,632},{7,10,1609},{8,10,178},{8,10,638},{141,10,\n58},{134,0,1983},{134,0,1155},{134,0,1575},{134,0,1438},{9,0,31},{10,0,244},{10,\n0,699},{12,0,149},{141,0,497},{133,0,377},{4,11,122},{5,11,796},{5,11,952},{6,11\n,1660},{6,11,1671},{8,11,567},{9,11,687},{9,11,742},{10,11,686},{11,11,356},{11,\n11,682},{140,11,281},{145,0,101},{11,11,0},{144,11,78},{5,10,791},{5,11,179},{7,\n11,1095},{135,11,1213},{8,11,372},{9,11,122},{138,11,175},{7,10,686},{8,10,33},{\n8,10,238},{10,10,616},{11,10,467},{11,10,881},{13,10,217},{13,10,253},{142,10,\n268},{4,11,66},{7,11,722},{7,11,904},{137,0,476},{7,11,352},{137,11,684},{135,0,\n2023},{135,0,1836},{132,10,447},{5,0,843},{144,0,35},{137,11,779},{141,11,35},{4\n,10,128},{5,10,415},{6,10,462},{7,10,294},{7,10,578},{10,10,710},{139,10,86},{\n132,0,554},{133,0,536},{136,10,587},{5,0,207},{9,0,79},{11,0,625},{145,0,7},{6,\n10,427},{7,0,1371},{138,10,692},{4,0,424},{4,10,195},{135,10,802},{5,11,564},{\n136,0,785},{135,0,336},{4,0,896},{6,0,1777},{134,11,556},{137,11,103},{134,10,\n1683},{7,11,544},{8,11,719},{138,11,61},{138,10,472},{4,11,5},{5,11,498},{136,11\n,637},{7,0,750},{9,0,223},{11,0,27},{11,0,466},{12,0,624},{14,0,265},{146,0,61},\n{12,0,238},{12,11,238},{18,0,155},{146,11,155},{151,10,28},{133,11,927},{5,10,3}\n,{8,10,578},{9,10,118},{10,10,705},{12,0,383},{141,10,279},{4,11,893},{5,11,780}\n,{133,11,893},{4,0,603},{133,0,661},{4,0,11},{5,10,229},{5,11,238},{6,0,128},{7,\n0,231},{7,0,1533},{7,11,1350},{138,0,725},{8,10,102},{10,10,578},{10,10,672},{12\n,10,496},{13,10,408},{14,10,121},{145,10,106},{132,0,476},{134,0,1552},{134,11,\n1729},{8,10,115},{8,10,350},{9,10,489},{10,10,128},{11,10,306},{12,10,373},{14,\n10,30},{17,10,79},{19,10,80},{150,10,55},{135,0,1807},{4,0,680},{4,11,60},{7,11,\n760},{7,11,1800},{8,11,314},{9,11,700},{139,11,487},{4,10,230},{5,10,702},{148,\n11,94},{132,11,228},{139,0,435},{9,0,20},{10,0,324},{10,0,807},{139,0,488},{6,10\n,1728},{136,11,419},{4,10,484},{18,10,26},{19,10,42},{20,10,43},{21,10,0},{23,10\n,27},{152,10,14},{135,0,1431},{133,11,828},{5,0,112},{6,0,103},{6,0,150},{7,0,\n1303},{7,11,176},{7,11,178},{7,11,1110},{9,0,292},{10,0,481},{10,11,481},{20,0,\n13},{148,11,13},{138,0,356},{4,11,51},{5,11,39},{6,11,4},{7,11,591},{7,11,849},{\n7,11,951},{7,11,1129},{7,11,1613},{7,11,1760},{7,11,1988},{9,11,434},{10,11,754}\n,{11,11,25},{11,11,37},{139,11,414},{6,0,1963},{134,0,2000},{132,10,633},{5,11,\n902},{134,0,1244},{135,11,928},{140,0,18},{138,0,204},{135,11,1173},{134,0,867},\n{4,0,708},{8,0,15},{9,0,50},{9,0,386},{11,0,18},{11,0,529},{140,0,228},{134,11,\n270},{4,0,563},{7,0,109},{7,0,592},{7,0,637},{7,0,770},{8,0,463},{9,0,60},{9,0,\n335},{9,0,904},{10,0,73},{11,0,434},{12,0,585},{13,0,331},{18,0,110},{148,0,60},\n{132,0,502},{14,11,359},{19,11,52},{148,11,47},{6,11,377},{7,11,1025},{9,11,613}\n,{145,11,104},{5,10,70},{5,10,622},{6,0,347},{6,10,334},{7,10,1032},{9,10,171},{\n10,0,161},{11,10,26},{11,10,213},{11,10,637},{11,10,707},{12,10,202},{12,10,380}\n,{13,10,226},{13,10,355},{14,10,222},{145,10,42},{132,11,416},{4,0,33},{5,0,102}\n,{6,0,284},{7,0,1079},{7,0,1423},{7,0,1702},{8,0,470},{9,0,554},{9,0,723},{11,0,\n333},{142,11,372},{5,11,152},{5,11,197},{7,11,340},{7,11,867},{10,11,548},{10,11\n,581},{11,11,6},{12,11,3},{12,11,19},{14,11,110},{142,11,289},{7,0,246},{135,0,\n840},{6,0,10},{8,0,571},{9,0,739},{143,0,91},{4,10,23},{4,10,141},{5,10,313},{5,\n10,1014},{6,0,465},{6,10,50},{7,0,1465},{7,10,142},{7,10,559},{8,10,640},{9,10,\n460},{9,10,783},{11,10,741},{12,10,183},{141,10,488},{133,0,626},{136,0,614},{\n138,0,237},{7,11,34},{7,11,190},{8,11,28},{8,11,141},{8,11,444},{8,11,811},{9,11\n,468},{11,11,334},{12,11,24},{12,11,386},{140,11,576},{133,11,757},{5,0,18},{6,0\n,526},{13,0,24},{13,0,110},{19,0,5},{147,0,44},{6,0,506},{134,11,506},{135,11,\n1553},{4,0,309},{5,0,462},{7,0,970},{7,0,1097},{7,11,1385},{11,11,582},{11,11,\n650},{11,11,901},{11,11,949},{12,11,232},{12,11,236},{13,11,413},{13,11,501},{18\n,11,116},{22,0,30},{150,0,33},{5,10,222},{9,0,140},{138,10,534},{6,0,1056},{137,\n10,906},{134,0,1704},{138,10,503},{134,0,1036},{5,10,154},{7,10,1491},{10,10,379\n},{138,10,485},{4,11,383},{133,10,716},{134,0,1315},{5,0,86},{7,0,743},{9,0,85},\n{10,0,281},{10,0,432},{11,0,825},{12,0,251},{13,0,118},{142,0,378},{4,10,91},{5,\n10,388},{5,10,845},{6,10,206},{6,10,252},{6,10,365},{7,10,136},{7,10,531},{8,0,\n264},{136,10,621},{5,0,524},{133,0,744},{5,11,277},{141,11,247},{132,11,435},{10\n,0,107},{140,0,436},{132,0,927},{10,0,123},{12,0,670},{146,0,94},{7,0,1149},{9,0\n,156},{138,0,957},{5,11,265},{6,11,212},{135,11,28},{133,0,778},{133,0,502},{8,0\n,196},{10,0,283},{139,0,406},{135,10,576},{136,11,535},{134,0,1312},{5,10,771},{\n5,10,863},{5,10,898},{6,10,1632},{6,10,1644},{134,10,1780},{5,0,855},{5,10,331},\n{135,11,1487},{132,11,702},{5,11,808},{135,11,2045},{7,0,1400},{9,0,446},{138,0,\n45},{140,10,632},{132,0,1003},{5,11,166},{8,11,739},{140,11,511},{5,10,107},{7,\n10,201},{136,10,518},{6,10,446},{135,10,1817},{134,0,1532},{134,0,1097},{4,11,\n119},{5,11,170},{5,11,447},{7,11,1708},{7,11,1889},{9,11,357},{9,11,719},{12,11,\n486},{140,11,596},{9,10,851},{141,10,510},{4,10,504},{7,0,612},{8,0,545},{8,0,\n568},{8,0,642},{9,0,717},{10,0,541},{10,0,763},{11,0,449},{12,0,489},{13,0,153},\n{13,0,296},{14,0,138},{14,0,392},{15,0,50},{16,0,6},{16,0,12},{148,0,9},{4,11,\n450},{135,11,1158},{5,10,883},{5,10,975},{8,10,392},{11,0,54},{13,0,173},{13,0,\n294},{148,10,7},{13,0,455},{15,0,99},{15,0,129},{144,0,68},{135,0,172},{132,11,\n754},{5,10,922},{134,10,1707},{134,0,1029},{17,11,39},{148,11,36},{4,0,568},{5,\n10,993},{7,10,515},{137,10,91},{132,0,732},{10,0,617},{138,11,617},{134,0,974},{\n7,0,989},{10,0,377},{12,0,363},{13,0,68},{13,0,94},{14,0,108},{142,0,306},{136,0\n,733},{132,0,428},{7,0,1789},{135,11,1062},{7,0,2015},{140,0,665},{135,10,1433},\n{5,0,287},{7,10,921},{8,10,580},{8,10,593},{8,10,630},{138,10,28},{138,0,806},{4\n,10,911},{5,10,867},{5,10,1013},{7,10,2034},{8,10,798},{136,10,813},{134,0,1539}\n,{8,11,523},{150,11,34},{135,11,740},{7,11,238},{7,11,2033},{8,11,120},{8,11,188\n},{8,11,659},{9,11,598},{10,11,466},{12,11,342},{12,11,588},{13,11,503},{14,11,\n246},{143,11,92},{7,0,1563},{141,0,182},{5,10,135},{6,10,519},{7,10,1722},{10,10\n,271},{11,10,261},{145,10,54},{14,10,338},{148,10,81},{4,10,300},{5,10,436},{135\n,0,484},{145,11,114},{6,0,1623},{134,0,1681},{133,11,640},{4,11,201},{7,11,1744}\n,{8,11,602},{11,11,247},{11,11,826},{145,11,65},{8,11,164},{146,11,62},{6,0,1833\n},{6,0,1861},{136,0,878},{134,0,1569},{8,10,357},{10,10,745},{14,10,426},{17,10,\n94},{147,10,57},{12,0,93},{12,0,501},{13,0,362},{14,0,151},{15,0,40},{15,0,59},{\n16,0,46},{17,0,25},{18,0,14},{18,0,134},{19,0,25},{19,0,69},{20,0,16},{20,0,19},\n{20,0,66},{21,0,23},{21,0,25},{150,0,42},{6,0,1748},{8,0,715},{9,0,802},{10,0,46\n},{10,0,819},{13,0,308},{14,0,351},{14,0,363},{146,0,67},{132,0,994},{4,0,63},{\n133,0,347},{132,0,591},{133,0,749},{7,11,1577},{10,11,304},{10,11,549},{11,11,\n424},{12,11,365},{13,11,220},{13,11,240},{142,11,33},{133,0,366},{5,10,387},{7,0\n,557},{12,0,547},{142,0,86},{135,0,1747},{132,11,907},{5,11,100},{10,11,329},{12\n,11,416},{149,11,29},{4,10,6},{5,10,708},{136,10,75},{7,10,1351},{9,10,581},{10,\n10,639},{11,10,453},{140,10,584},{4,10,303},{135,0,89},{138,10,772},{132,11,176}\n,{5,11,636},{5,11,998},{8,11,26},{137,11,358},{7,11,9},{7,11,1508},{9,11,317},{\n10,11,210},{10,11,292},{10,11,533},{11,11,555},{12,11,526},{12,11,607},{13,11,\n263},{13,11,459},{142,11,271},{134,0,1463},{6,0,772},{6,0,1137},{139,11,595},{7,\n0,977},{139,11,66},{138,0,893},{20,0,48},{148,11,48},{5,0,824},{133,0,941},{134,\n11,295},{4,10,106},{7,0,1543},{7,0,1785},{10,0,690},{139,10,717},{7,0,440},{8,0,\n230},{139,0,106},{5,10,890},{133,10,988},{6,10,626},{142,10,431},{10,11,127},{\n141,11,27},{10,10,706},{17,0,32},{150,10,44},{132,0,216},{137,0,332},{4,10,698},\n{136,11,119},{139,11,267},{138,10,17},{11,11,526},{11,11,939},{141,11,290},{7,11\n,1167},{11,11,934},{13,11,391},{145,11,76},{139,11,39},{134,10,84},{4,0,914},{5,\n0,800},{133,0,852},{10,0,416},{141,0,115},{7,0,564},{142,0,168},{4,0,918},{133,0\n,876},{134,0,1764},{152,0,3},{4,0,92},{5,0,274},{7,11,126},{136,11,84},{140,10,\n498},{136,11,790},{5,10,986},{6,10,130},{7,10,1582},{8,0,501},{8,10,458},{10,10,\n101},{10,10,318},{138,10,823},{6,11,64},{12,11,377},{141,11,309},{5,0,743},{138,\n0,851},{4,0,49},{7,0,280},{135,0,1633},{134,0,879},{136,0,47},{7,10,1644},{137,\n10,129},{132,0,865},{134,0,1202},{9,11,34},{139,11,484},{135,10,997},{5,0,272},{\n5,0,908},{5,0,942},{8,0,197},{9,0,47},{11,0,538},{139,0,742},{6,11,1700},{7,11,\n26},{7,11,293},{7,11,382},{7,11,1026},{7,11,1087},{7,11,2027},{8,11,24},{8,11,\n114},{8,11,252},{8,11,727},{8,11,729},{9,11,30},{9,11,199},{9,11,231},{9,11,251}\n,{9,11,334},{9,11,361},{9,11,488},{9,11,712},{10,11,55},{10,11,60},{10,11,232},{\n10,11,332},{10,11,384},{10,11,396},{10,11,504},{10,11,542},{10,11,652},{11,11,20\n},{11,11,48},{11,11,207},{11,11,291},{11,11,298},{11,11,342},{11,11,365},{11,11,\n394},{11,11,620},{11,11,705},{11,11,1017},{12,11,123},{12,11,340},{12,11,406},{\n12,11,643},{13,11,61},{13,11,269},{13,11,311},{13,11,319},{13,11,486},{14,11,234\n},{15,11,62},{15,11,85},{16,11,71},{18,11,119},{148,11,105},{6,0,1455},{150,11,\n37},{135,10,1927},{135,0,1911},{137,0,891},{7,10,1756},{137,10,98},{7,10,1046},{\n139,10,160},{132,0,761},{6,11,379},{7,11,270},{7,11,1116},{8,11,176},{8,11,183},\n{9,11,432},{9,11,661},{12,11,247},{12,11,617},{146,11,125},{6,10,45},{7,10,433},\n{8,10,129},{9,10,21},{10,10,392},{11,10,79},{12,10,499},{13,10,199},{141,10,451}\n,{4,0,407},{5,11,792},{133,11,900},{132,0,560},{135,0,183},{7,10,558},{8,10,353}\n,{141,0,490},{4,0,475},{5,10,785},{6,0,731},{11,0,35},{13,0,71},{13,0,177},{142,\n0,422},{8,10,81},{9,10,189},{9,10,201},{11,10,478},{11,10,712},{141,10,338},{4,0\n,418},{4,0,819},{133,10,353},{151,10,26},{4,11,901},{133,11,776},{132,0,575},{7,\n0,818},{16,0,92},{17,0,14},{17,0,45},{18,0,75},{148,0,18},{6,0,222},{7,0,636},{7\n,0,1620},{8,0,409},{9,0,693},{139,0,77},{6,10,25},{7,10,855},{7,10,1258},{144,10\n,32},{6,0,1880},{6,0,1887},{6,0,1918},{6,0,1924},{9,0,967},{9,0,995},{9,0,1015},\n{12,0,826},{12,0,849},{12,0,857},{12,0,860},{12,0,886},{12,0,932},{18,0,228},{18\n,0,231},{146,0,240},{134,0,633},{134,0,1308},{4,11,37},{5,11,334},{135,11,1253},\n{4,10,4},{7,10,1118},{7,10,1320},{7,10,1706},{8,10,277},{9,10,622},{10,0,86},{11\n,10,724},{12,10,350},{12,10,397},{13,10,28},{13,10,159},{15,10,89},{18,10,5},{19\n,10,9},{20,10,34},{150,10,47},{132,11,508},{137,11,448},{12,11,107},{146,11,31},\n{132,0,817},{134,0,663},{133,0,882},{134,0,914},{132,11,540},{132,11,533},{136,\n11,608},{8,0,885},{138,0,865},{132,0,426},{6,0,58},{7,0,745},{7,0,1969},{8,0,399\n},{8,0,675},{9,0,479},{9,0,731},{10,0,330},{10,0,593},{10,0,817},{11,0,32},{11,0\n,133},{11,0,221},{145,0,68},{134,10,255},{7,0,102},{137,0,538},{137,10,216},{7,\n11,253},{136,11,549},{135,11,912},{9,10,183},{139,10,286},{11,10,956},{151,10,3}\n,{8,11,527},{18,11,60},{147,11,24},{4,10,536},{7,10,1141},{10,10,723},{139,10,\n371},{133,11,920},{7,0,876},{135,10,285},{135,10,560},{132,10,690},{142,11,126},\n{11,10,33},{12,10,571},{149,10,1},{133,0,566},{4,11,483},{9,0,139},{10,0,399},{\n11,0,469},{12,0,634},{141,0,223},{6,0,48},{135,0,63},{7,10,1862},{12,10,491},{12\n,10,520},{13,10,383},{14,10,244},{146,0,12},{135,11,1665},{132,11,448},{9,11,495\n},{146,11,104},{6,0,114},{7,0,1224},{7,0,1556},{136,0,3},{4,10,190},{133,10,554}\n,{5,10,1001},{8,0,576},{137,0,267},{133,10,446},{133,0,933},{139,11,1009},{8,11,\n653},{13,11,93},{147,11,14},{6,0,692},{6,0,821},{134,0,1077},{5,11,172},{135,11,\n801},{138,0,752},{4,0,375},{134,0,638},{134,0,1011},{140,11,540},{5,11,260},{137\n,0,96},{139,11,587},{135,10,1231},{4,10,304},{12,0,30},{13,0,148},{14,0,87},{14,\n0,182},{16,0,42},{148,0,70},{6,0,1398},{7,0,56},{7,0,1989},{8,0,337},{8,0,738},{\n9,0,600},{12,0,37},{13,0,447},{142,0,92},{138,0,666},{5,0,394},{7,0,487},{136,0,\n246},{6,10,53},{6,10,199},{7,10,1408},{8,10,32},{8,10,93},{9,0,437},{10,10,397},\n{10,10,629},{11,10,593},{11,10,763},{13,10,326},{145,10,35},{134,10,105},{9,0,\n320},{10,0,506},{138,10,794},{7,11,57},{8,11,167},{8,11,375},{9,11,82},{9,11,561\n},{10,11,620},{10,11,770},{11,10,704},{141,10,396},{5,10,114},{5,10,255},{6,0,\n1003},{141,10,285},{7,0,866},{135,0,1163},{133,11,531},{132,0,328},{7,10,2035},{\n8,10,19},{9,10,89},{138,10,831},{8,11,194},{136,11,756},{136,0,1000},{5,11,453},\n{134,11,441},{4,0,101},{5,0,833},{7,0,1171},{136,0,744},{133,0,726},{136,10,746}\n,{138,0,176},{6,0,9},{6,0,397},{7,0,53},{7,0,1742},{10,0,632},{11,0,828},{140,0,\n146},{135,11,22},{145,11,64},{132,0,839},{11,0,417},{12,0,223},{140,0,265},{4,11\n,102},{7,11,815},{7,11,1699},{139,11,964},{5,10,955},{136,10,814},{6,0,1931},{6,\n0,2007},{18,0,246},{146,0,247},{8,0,198},{11,0,29},{140,0,534},{135,0,1771},{6,0\n,846},{7,11,1010},{11,11,733},{11,11,759},{12,11,563},{13,11,34},{14,11,101},{18\n,11,45},{146,11,129},{4,0,186},{5,0,157},{8,0,168},{138,0,6},{132,11,899},{133,\n10,56},{148,10,100},{133,0,875},{5,0,773},{5,0,991},{6,0,1635},{134,0,1788},{6,0\n,1274},{9,0,477},{141,0,78},{4,0,639},{6,11,52},{7,0,111},{8,0,581},{9,11,104},{\n9,11,559},{10,10,4},{10,10,13},{11,10,638},{12,0,177},{12,11,308},{19,11,87},{\n148,10,57},{132,11,604},{4,11,301},{133,10,738},{133,10,758},{134,0,1747},{7,11,\n1440},{11,11,854},{11,11,872},{11,11,921},{12,11,551},{13,11,472},{142,11,367},{\n7,0,1364},{7,0,1907},{141,0,158},{134,0,873},{4,0,404},{4,0,659},{7,0,552},{135,\n0,675},{135,10,1112},{139,10,328},{7,11,508},{137,10,133},{133,0,391},{5,10,110}\n,{6,10,169},{6,10,1702},{7,10,400},{8,10,538},{9,10,184},{9,10,524},{140,10,218}\n,{6,11,310},{7,11,1849},{8,11,72},{8,11,272},{8,11,431},{9,11,12},{9,11,351},{10\n,11,563},{10,11,630},{10,11,810},{11,11,367},{11,11,599},{11,11,686},{140,11,672\n},{5,0,540},{6,0,1697},{136,0,668},{132,0,883},{134,0,78},{6,10,133},{9,10,353},\n{11,10,993},{12,0,628},{146,0,79},{6,11,181},{7,11,537},{8,11,64},{9,11,127},{10\n,11,496},{12,11,510},{141,11,384},{6,10,93},{7,10,1422},{7,10,1851},{8,10,673},{\n9,10,529},{140,10,43},{137,10,371},{134,0,1460},{134,0,962},{4,11,244},{135,11,\n233},{9,10,25},{10,10,467},{138,10,559},{4,10,335},{135,10,942},{133,0,460},{135\n,11,334},{134,11,1650},{4,0,199},{139,0,34},{5,10,601},{8,10,39},{10,10,773},{11\n,10,84},{12,10,205},{142,10,1},{133,10,870},{134,0,388},{14,0,474},{148,0,120},{\n133,11,369},{139,0,271},{4,0,511},{4,10,181},{9,0,333},{9,0,379},{10,0,602},{11,\n0,441},{11,0,723},{11,0,976},{140,0,357},{134,0,608},{134,10,1652},{9,11,338},{\n150,0,49},{140,0,988},{134,0,617},{5,0,938},{136,0,707},{132,10,97},{5,10,147},{\n6,10,286},{7,10,1362},{141,10,176},{6,0,756},{134,0,1149},{133,11,896},{6,10,375\n},{7,10,169},{7,10,254},{136,10,780},{134,0,1583},{135,10,1447},{139,0,285},{7,\n11,1117},{8,11,393},{136,11,539},{135,0,344},{6,0,469},{7,0,1709},{138,0,515},{5\n,10,629},{135,10,1549},{5,11,4},{5,11,810},{6,11,13},{6,11,538},{6,11,1690},{6,\n11,1726},{7,11,499},{7,11,1819},{8,11,148},{8,11,696},{8,11,791},{12,11,125},{13\n,11,54},{143,11,9},{135,11,1268},{137,0,404},{132,0,500},{5,0,68},{134,0,383},{\n11,0,216},{139,0,340},{4,11,925},{5,11,803},{8,11,698},{138,11,828},{4,0,337},{6\n,0,353},{7,0,1934},{8,0,488},{137,0,429},{7,0,236},{7,0,1795},{8,0,259},{9,0,135\n},{9,0,177},{9,0,860},{10,0,825},{11,0,115},{11,0,370},{11,0,405},{11,0,604},{12\n,0,10},{12,0,667},{12,0,669},{13,0,76},{14,0,310},{15,0,76},{15,0,147},{148,0,23\n},{4,0,15},{4,0,490},{5,0,22},{6,0,244},{7,0,40},{7,0,200},{7,0,906},{7,0,1199},\n{9,0,616},{10,0,716},{11,0,635},{11,0,801},{140,0,458},{4,10,420},{140,0,756},{\n134,0,1504},{5,11,383},{134,0,757},{6,0,1266},{135,0,1735},{5,0,598},{7,0,791},{\n7,10,1570},{8,0,108},{9,0,123},{140,10,542},{142,11,410},{9,11,660},{138,11,347}\n};\n" }, { "path": "libs/brotli/enc/static_init.c", "content": "/* Copyright 2025 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n#include \"static_init.h\"\n\n#include \"../common/platform.h\"\n#include \"../common/static_init.h\"\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\n#include \"../common/dictionary.h\"\n#include \"dictionary_hash.h\"\n#include \"static_dict_lut.h\"\n#endif\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#if (BROTLI_STATIC_INIT != BROTLI_STATIC_INIT_NONE)\nstatic BROTLI_BOOL DoBrotliEncoderStaticInit(void) {\n const BrotliDictionary* dict = BrotliGetDictionary();\n BROTLI_BOOL ok = BrotliEncoderInitStaticDictionaryLut(\n dict, kStaticDictionaryBuckets, kStaticDictionaryWords);\n if (!ok) return BROTLI_FALSE;\n ok = BrotliEncoderInitDictionaryHash(dict, kStaticDictionaryHashWords,\n kStaticDictionaryHashLengths);\n if (!ok) return BROTLI_FALSE;\n return BROTLI_TRUE;\n}\n#endif /* BROTLI_STATIC_INIT_NONE */\n\n#if (BROTLI_STATIC_INIT == BROTLI_STATIC_INIT_EARLY)\nstatic BROTLI_BOOL kEarlyInitOk;\nstatic __attribute__((constructor)) void BrotliEncoderStaticInitEarly(void) {\n kEarlyInitOk = DoBrotliEncoderStaticInit();\n}\n#elif (BROTLI_STATIC_INIT == BROTLI_STATIC_INIT_LAZY)\nstatic BROTLI_BOOL kLazyInitOk;\nvoid BrotliEncoderLazyStaticInitInner(void) {\n kLazyInitOk = DoBrotliEncoderStaticInit();\n}\n#endif /* BROTLI_STATIC_INIT_EARLY */\n\nBROTLI_BOOL BrotliEncoderEnsureStaticInit(void) {\n#if (BROTLI_STATIC_INIT == BROTLI_STATIC_INIT_NONE)\n return BROTLI_TRUE;\n#elif (BROTLI_STATIC_INIT == BROTLI_STATIC_INIT_EARLY)\n return kEarlyInitOk;\n#else\n return kLazyInitOk;\n#endif\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/static_init.h", "content": "/* Copyright 2025 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Central point for static initialization. */\n\n#ifndef THIRD_PARTY_BROTLI_ENC_STATIC_INIT_H_\n#define THIRD_PARTY_BROTLI_ENC_STATIC_INIT_H_\n\n#include \"../common/platform.h\"\n#include \"../common/static_init.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#if (BROTLI_STATIC_INIT == BROTLI_STATIC_INIT_LAZY)\nBROTLI_INTERNAL void BrotliEncoderLazyStaticInitInner(void);\nBROTLI_INTERNAL void BrotliEncoderLazyStaticInit(void);\n#endif /* BROTLI_STATIC_INIT */\n\nBROTLI_INTERNAL BROTLI_BOOL BrotliEncoderEnsureStaticInit(void);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif // THIRD_PARTY_BROTLI_ENC_STATIC_INIT_H_\n" }, { "path": "libs/brotli/enc/utf8_util.c", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Heuristics for deciding about the UTF8-ness of strings. */\n\n#include \"utf8_util.h\"\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic size_t BrotliParseAsUTF8(\n int* symbol, const uint8_t* input, size_t size) {\n /* ASCII */\n if ((input[0] & 0x80) == 0) {\n *symbol = input[0];\n if (*symbol > 0) {\n return 1;\n }\n }\n /* 2-byte UTF8 */\n if (size > 1u &&\n (input[0] & 0xE0) == 0xC0 &&\n (input[1] & 0xC0) == 0x80) {\n *symbol = (((input[0] & 0x1F) << 6) |\n (input[1] & 0x3F));\n if (*symbol > 0x7F) {\n return 2;\n }\n }\n /* 3-byte UFT8 */\n if (size > 2u &&\n (input[0] & 0xF0) == 0xE0 &&\n (input[1] & 0xC0) == 0x80 &&\n (input[2] & 0xC0) == 0x80) {\n *symbol = (((input[0] & 0x0F) << 12) |\n ((input[1] & 0x3F) << 6) |\n (input[2] & 0x3F));\n if (*symbol > 0x7FF) {\n return 3;\n }\n }\n /* 4-byte UFT8 */\n if (size > 3u &&\n (input[0] & 0xF8) == 0xF0 &&\n (input[1] & 0xC0) == 0x80 &&\n (input[2] & 0xC0) == 0x80 &&\n (input[3] & 0xC0) == 0x80) {\n *symbol = (((input[0] & 0x07) << 18) |\n ((input[1] & 0x3F) << 12) |\n ((input[2] & 0x3F) << 6) |\n (input[3] & 0x3F));\n if (*symbol > 0xFFFF && *symbol <= 0x10FFFF) {\n return 4;\n }\n }\n /* Not UTF8, emit a special symbol above the UTF8-code space */\n *symbol = 0x110000 | input[0];\n return 1;\n}\n\n/* Returns 1 if at least min_fraction of the data is UTF8-encoded.*/\nBROTLI_BOOL BrotliIsMostlyUTF8(\n const uint8_t* data, const size_t pos, const size_t mask,\n const size_t length, const double min_fraction) {\n size_t size_utf8 = 0;\n size_t i = 0;\n while (i < length) {\n int symbol;\n size_t bytes_read =\n BrotliParseAsUTF8(&symbol, &data[(pos + i) & mask], length - i);\n i += bytes_read;\n if (symbol < 0x110000) size_utf8 += bytes_read;\n }\n return TO_BROTLI_BOOL((double)size_utf8 > min_fraction * (double)length);\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n" }, { "path": "libs/brotli/enc/utf8_util.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Heuristics for deciding about the UTF8-ness of strings. */\n\n#ifndef BROTLI_ENC_UTF8_UTIL_H_\n#define BROTLI_ENC_UTF8_UTIL_H_\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\nstatic const double kMinUTF8Ratio = 0.75;\n\n/* Returns 1 if at least min_fraction of the bytes between pos and\n pos + length in the (data, mask) ring-buffer is UTF8-encoded, otherwise\n returns 0. */\nBROTLI_INTERNAL BROTLI_BOOL BrotliIsMostlyUTF8(\n const uint8_t* data, const size_t pos, const size_t mask,\n const size_t length, const double min_fraction);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_UTF8_UTIL_H_ */\n" }, { "path": "libs/brotli/enc/write_bits.h", "content": "/* Copyright 2010 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Write bits into a byte array. */\n\n#ifndef BROTLI_ENC_WRITE_BITS_H_\n#define BROTLI_ENC_WRITE_BITS_H_\n\n#include \"../common/platform.h\"\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/* This function writes bits into bytes in increasing addresses, and within\n a byte least-significant-bit first.\n\n The function can write up to 56 bits in one go with WriteBits\n Example: let's assume that 3 bits (Rs below) have been written already:\n\n BYTE-0 BYTE+1 BYTE+2\n\n 0000 0RRR 0000 0000 0000 0000\n\n Now, we could write 5 or less bits in MSB by just shifting by 3\n and OR'ing to BYTE-0.\n\n For n bits, we take the last 5 bits, OR that with high bits in BYTE-0,\n and locate the rest in BYTE+1, BYTE+2, etc. */\nstatic BROTLI_INLINE void BrotliWriteBits(size_t n_bits,\n uint64_t bits,\n size_t* BROTLI_RESTRICT pos,\n uint8_t* BROTLI_RESTRICT array) {\n BROTLI_LOG((\"WriteBits %2d 0x%08x%08x %10d\\n\", (int)n_bits,\n (uint32_t)(bits >> 32), (uint32_t)(bits & 0xFFFFFFFF),\n (int)*pos));\n BROTLI_DCHECK((bits >> n_bits) == 0);\n BROTLI_DCHECK(n_bits <= 56);\n#if defined(BROTLI_LITTLE_ENDIAN)\n /* This branch of the code can write up to 56 bits at a time,\n 7 bits are lost by being perhaps already in *p and at least\n 1 bit is needed to initialize the bit-stream ahead (i.e. if 7\n bits are in *p and we write 57 bits, then the next write will\n access a byte that was never initialized). */\n {\n uint8_t* p = &array[*pos >> 3];\n uint64_t v = (uint64_t)(*p); /* Zero-extend 8 to 64 bits. */\n v |= bits << (*pos & 7);\n BROTLI_UNALIGNED_STORE64LE(p, v); /* Set some bits. */\n *pos += n_bits;\n }\n#else\n /* implicit & 0xFF is assumed for uint8_t arithmetics */\n {\n uint8_t* array_pos = &array[*pos >> 3];\n const size_t bits_reserved_in_first_byte = (*pos & 7);\n size_t bits_left_to_write;\n bits <<= bits_reserved_in_first_byte;\n *array_pos++ |= (uint8_t)bits;\n for (bits_left_to_write = n_bits + bits_reserved_in_first_byte;\n bits_left_to_write >= 9;\n bits_left_to_write -= 8) {\n bits >>= 8;\n *array_pos++ = (uint8_t)bits;\n }\n *array_pos = 0;\n *pos += n_bits;\n }\n#endif\n}\n\nstatic BROTLI_INLINE void BrotliWriteBitsPrepareStorage(\n size_t pos, uint8_t* array) {\n BROTLI_LOG((\"WriteBitsPrepareStorage %10d\\n\", (int)pos));\n BROTLI_DCHECK((pos & 7) == 0);\n array[pos >> 3] = 0;\n}\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_WRITE_BITS_H_ */\n" }, { "path": "libs/brotli/include/brotli/decode.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/**\n * @file\n * API for Brotli decompression.\n */\n\n#ifndef BROTLI_DEC_DECODE_H_\n#define BROTLI_DEC_DECODE_H_\n\n#include \n#include \n#include /* IWYU pragma: export */\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/**\n * Opaque structure that holds decoder state.\n *\n * Allocated and initialized with ::BrotliDecoderCreateInstance.\n * Cleaned up and deallocated with ::BrotliDecoderDestroyInstance.\n */\ntypedef struct BrotliDecoderStateStruct BrotliDecoderState;\n\n/**\n * Result type for ::BrotliDecoderDecompress and\n * ::BrotliDecoderDecompressStream functions.\n */\ntypedef enum {\n /** Decoding error, e.g. corrupted input or memory allocation problem. */\n BROTLI_DECODER_RESULT_ERROR = 0,\n /** Decoding successfully completed. */\n BROTLI_DECODER_RESULT_SUCCESS = 1,\n /** Partially done; should be called again with more input. */\n BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT = 2,\n /** Partially done; should be called again with more output. */\n BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT = 3\n} BrotliDecoderResult;\n\n/**\n * Template that evaluates items of ::BrotliDecoderErrorCode.\n *\n * Example: @code {.cpp}\n * // Log Brotli error code.\n * switch (brotliDecoderErrorCode) {\n * #define CASE_(PREFIX, NAME, CODE) \\\n * case BROTLI_DECODER ## PREFIX ## NAME: \\\n * LOG(INFO) << \"error code:\" << #NAME; \\\n * break;\n * #define NEWLINE_\n * BROTLI_DECODER_ERROR_CODES_LIST(CASE_, NEWLINE_)\n * #undef CASE_\n * #undef NEWLINE_\n * default: LOG(FATAL) << \"unknown brotli error code\";\n * }\n * @endcode\n */\n#define BROTLI_DECODER_ERROR_CODES_LIST(BROTLI_ERROR_CODE, SEPARATOR) \\\n BROTLI_ERROR_CODE(_, NO_ERROR, 0) SEPARATOR \\\n /* Same as BrotliDecoderResult values */ \\\n BROTLI_ERROR_CODE(_, SUCCESS, 1) SEPARATOR \\\n BROTLI_ERROR_CODE(_, NEEDS_MORE_INPUT, 2) SEPARATOR \\\n BROTLI_ERROR_CODE(_, NEEDS_MORE_OUTPUT, 3) SEPARATOR \\\n \\\n /* Errors caused by invalid input */ \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, EXUBERANT_NIBBLE, -1) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, RESERVED, -2) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, EXUBERANT_META_NIBBLE, -3) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, SIMPLE_HUFFMAN_ALPHABET, -4) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, SIMPLE_HUFFMAN_SAME, -5) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, CL_SPACE, -6) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, HUFFMAN_SPACE, -7) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, CONTEXT_MAP_REPEAT, -8) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, BLOCK_LENGTH_1, -9) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, BLOCK_LENGTH_2, -10) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, TRANSFORM, -11) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, DICTIONARY, -12) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, WINDOW_BITS, -13) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, PADDING_1, -14) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, PADDING_2, -15) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_FORMAT_, DISTANCE, -16) SEPARATOR \\\n \\\n /* -17 code is reserved */ \\\n \\\n BROTLI_ERROR_CODE(_ERROR_, COMPOUND_DICTIONARY, -18) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_, DICTIONARY_NOT_SET, -19) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_, INVALID_ARGUMENTS, -20) SEPARATOR \\\n \\\n /* Memory allocation problems */ \\\n BROTLI_ERROR_CODE(_ERROR_ALLOC_, CONTEXT_MODES, -21) SEPARATOR \\\n /* Literal, insert and distance trees together */ \\\n BROTLI_ERROR_CODE(_ERROR_ALLOC_, TREE_GROUPS, -22) SEPARATOR \\\n /* -23..-24 codes are reserved for distinct tree groups */ \\\n BROTLI_ERROR_CODE(_ERROR_ALLOC_, CONTEXT_MAP, -25) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_ALLOC_, RING_BUFFER_1, -26) SEPARATOR \\\n BROTLI_ERROR_CODE(_ERROR_ALLOC_, RING_BUFFER_2, -27) SEPARATOR \\\n /* -28..-29 codes are reserved for dynamic ring-buffer allocation */ \\\n BROTLI_ERROR_CODE(_ERROR_ALLOC_, BLOCK_TYPE_TREES, -30) SEPARATOR \\\n \\\n /* \"Impossible\" states */ \\\n BROTLI_ERROR_CODE(_ERROR_, UNREACHABLE, -31)\n\n/**\n * Error code for detailed logging / production debugging.\n *\n * See ::BrotliDecoderGetErrorCode and ::BROTLI_LAST_ERROR_CODE.\n */\ntypedef enum {\n#define BROTLI_COMMA_ ,\n#define BROTLI_ERROR_CODE_ENUM_ITEM_(PREFIX, NAME, CODE) \\\n BROTLI_DECODER ## PREFIX ## NAME = CODE\n BROTLI_DECODER_ERROR_CODES_LIST(BROTLI_ERROR_CODE_ENUM_ITEM_, BROTLI_COMMA_)\n} BrotliDecoderErrorCode;\n#undef BROTLI_ERROR_CODE_ENUM_ITEM_\n#undef BROTLI_COMMA_\n\n/**\n * The value of the last error code, negative integer.\n *\n * All other error code values are in the range from ::BROTLI_LAST_ERROR_CODE\n * to @c -1. There are also 4 other possible non-error codes @c 0 .. @c 3 in\n * ::BrotliDecoderErrorCode enumeration.\n */\n#define BROTLI_LAST_ERROR_CODE BROTLI_DECODER_ERROR_UNREACHABLE\n\n/** Options to be used with ::BrotliDecoderSetParameter. */\ntypedef enum BrotliDecoderParameter {\n /**\n * Disable \"canny\" ring buffer allocation strategy.\n *\n * Ring buffer is allocated according to window size, despite the real size of\n * the content.\n */\n BROTLI_DECODER_PARAM_DISABLE_RING_BUFFER_REALLOCATION = 0,\n /**\n * Flag that determines if \"Large Window Brotli\" is used.\n */\n BROTLI_DECODER_PARAM_LARGE_WINDOW = 1\n} BrotliDecoderParameter;\n\n/**\n * Sets the specified parameter to the given decoder instance.\n *\n * @param state decoder instance\n * @param param parameter to set\n * @param value new parameter value\n * @returns ::BROTLI_FALSE if parameter is unrecognized, or value is invalid\n * @returns ::BROTLI_TRUE if value is accepted\n */\nBROTLI_DEC_API BROTLI_BOOL BrotliDecoderSetParameter(\n BrotliDecoderState* state, BrotliDecoderParameter param, uint32_t value);\n\n/**\n * Adds LZ77 prefix dictionary, adds or replaces built-in static dictionary and\n * transforms.\n *\n * Attached dictionary ownership is not transferred.\n * Data provided to this method should be kept accessible until\n * decoding is finished and decoder instance is destroyed.\n *\n * @note Dictionaries can NOT be attached after actual decoding is started.\n *\n * @param state decoder instance\n * @param type dictionary data format\n * @param data_size length of memory region pointed by @p data\n * @param data dictionary data in format corresponding to @p type\n * @returns ::BROTLI_FALSE if dictionary is corrupted,\n * or dictionary count limit is reached\n * @returns ::BROTLI_TRUE if dictionary is accepted / attached\n */\nBROTLI_DEC_API BROTLI_BOOL BrotliDecoderAttachDictionary(\n BrotliDecoderState* state, BrotliSharedDictionaryType type,\n size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)]);\n\n/**\n * Creates an instance of ::BrotliDecoderState and initializes it.\n *\n * The instance can be used once for decoding and should then be destroyed with\n * ::BrotliDecoderDestroyInstance, it cannot be reused for a new decoding\n * session.\n *\n * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the\n * case they are both zero, default memory allocators are used. @p opaque is\n * passed to @p alloc_func and @p free_func when they are called. @p free_func\n * has to return without doing anything when asked to free a NULL pointer.\n *\n * @param alloc_func custom memory allocation function\n * @param free_func custom memory free function\n * @param opaque custom memory manager handle\n * @returns @c 0 if instance can not be allocated or initialized\n * @returns pointer to initialized ::BrotliDecoderState otherwise\n */\nBROTLI_DEC_API BrotliDecoderState* BrotliDecoderCreateInstance(\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);\n\n/**\n * Deinitializes and frees ::BrotliDecoderState instance.\n *\n * @param state decoder instance to be cleaned up and deallocated\n */\nBROTLI_DEC_API void BrotliDecoderDestroyInstance(BrotliDecoderState* state);\n\n/**\n * Performs one-shot memory-to-memory decompression.\n *\n * Decompresses the data in @p encoded_buffer into @p decoded_buffer, and sets\n * @p *decoded_size to the decompressed length.\n *\n * @param encoded_size size of @p encoded_buffer\n * @param encoded_buffer compressed data buffer with at least @p encoded_size\n * addressable bytes\n * @param[in, out] decoded_size @b in: size of @p decoded_buffer; \\n\n * @b out: length of decompressed data written to\n * @p decoded_buffer\n * @param decoded_buffer decompressed data destination buffer\n * @returns ::BROTLI_DECODER_RESULT_ERROR if input is corrupted, memory\n * allocation failed, or @p decoded_buffer is not large enough;\n * @returns ::BROTLI_DECODER_RESULT_SUCCESS otherwise\n */\nBROTLI_DEC_API BrotliDecoderResult BrotliDecoderDecompress(\n size_t encoded_size,\n const uint8_t encoded_buffer[BROTLI_ARRAY_PARAM(encoded_size)],\n size_t* decoded_size,\n uint8_t decoded_buffer[BROTLI_ARRAY_PARAM(*decoded_size)]);\n\n/**\n * Decompresses the input stream to the output stream.\n *\n * The values @p *available_in and @p *available_out must specify the number of\n * bytes addressable at @p *next_in and @p *next_out respectively.\n * When @p *available_out is @c 0, @p next_out is allowed to be @c NULL.\n *\n * After each call, @p *available_in will be decremented by the amount of input\n * bytes consumed, and the @p *next_in pointer will be incremented by that\n * amount. Similarly, @p *available_out will be decremented by the amount of\n * output bytes written, and the @p *next_out pointer will be incremented by\n * that amount.\n *\n * @p total_out, if it is not a null-pointer, will be set to the number\n * of bytes decompressed since the last @p state initialization.\n *\n * @note Input is never overconsumed, so @p next_in and @p available_in could be\n * passed to the next consumer after decoding is complete.\n *\n * @param state decoder instance\n * @param[in, out] available_in @b in: amount of available input; \\n\n * @b out: amount of unused input\n * @param[in, out] next_in pointer to the next compressed byte\n * @param[in, out] available_out @b in: length of output buffer; \\n\n * @b out: remaining size of output buffer\n * @param[in, out] next_out output buffer cursor;\n * can be @c NULL if @p available_out is @c 0\n * @param[out] total_out number of bytes decompressed so far; can be @c NULL\n * @returns ::BROTLI_DECODER_RESULT_ERROR if input is corrupted, memory\n * allocation failed, arguments were invalid, etc.;\n * use ::BrotliDecoderGetErrorCode to get detailed error code\n * @returns ::BROTLI_DECODER_RESULT_NEEDS_MORE_INPUT decoding is blocked until\n * more input data is provided\n * @returns ::BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT decoding is blocked until\n * more output space is provided\n * @returns ::BROTLI_DECODER_RESULT_SUCCESS decoding is finished, no more\n * input might be consumed and no more output will be produced\n */\nBROTLI_DEC_API BrotliDecoderResult BrotliDecoderDecompressStream(\n BrotliDecoderState* state, size_t* available_in, const uint8_t** next_in,\n size_t* available_out, uint8_t** next_out, size_t* total_out);\n\n/**\n * Checks if decoder has more output.\n *\n * @param state decoder instance\n * @returns ::BROTLI_TRUE, if decoder has some unconsumed output\n * @returns ::BROTLI_FALSE otherwise\n */\nBROTLI_DEC_API BROTLI_BOOL BrotliDecoderHasMoreOutput(\n const BrotliDecoderState* state);\n\n/**\n * Acquires pointer to internal output buffer.\n *\n * This method is used to make language bindings easier and more efficient:\n * -# push data to ::BrotliDecoderDecompressStream,\n * until ::BROTLI_DECODER_RESULT_NEEDS_MORE_OUTPUT is reported\n * -# use ::BrotliDecoderTakeOutput to peek bytes and copy to language-specific\n * entity\n *\n * Also this could be useful if there is an output stream that is able to\n * consume all the provided data (e.g. when data is saved to file system).\n *\n * @attention After every call to ::BrotliDecoderTakeOutput @p *size bytes of\n * output are considered consumed for all consecutive calls to the\n * instance methods; returned pointer becomes invalidated as well.\n *\n * @note Decoder output is not guaranteed to be contiguous. This means that\n * after the size-unrestricted call to ::BrotliDecoderTakeOutput,\n * immediate next call to ::BrotliDecoderTakeOutput may return more data.\n *\n * @param state decoder instance\n * @param[in, out] size @b in: number of bytes caller is ready to take, @c 0 if\n * any amount could be handled; \\n\n * @b out: amount of data pointed by returned pointer and\n * considered consumed; \\n\n * out value is never greater than in value, unless it is @c 0\n * @returns pointer to output data\n */\nBROTLI_DEC_API const uint8_t* BrotliDecoderTakeOutput(\n BrotliDecoderState* state, size_t* size);\n\n/**\n * Checks if instance has already consumed input.\n *\n * Instance that returns ::BROTLI_FALSE is considered \"fresh\" and could be\n * reused.\n *\n * @param state decoder instance\n * @returns ::BROTLI_TRUE if decoder has already used some input bytes\n * @returns ::BROTLI_FALSE otherwise\n */\nBROTLI_DEC_API BROTLI_BOOL BrotliDecoderIsUsed(const BrotliDecoderState* state);\n\n/**\n * Checks if decoder instance reached the final state.\n *\n * @param state decoder instance\n * @returns ::BROTLI_TRUE if decoder is in a state where it reached the end of\n * the input and produced all of the output\n * @returns ::BROTLI_FALSE otherwise\n */\nBROTLI_DEC_API BROTLI_BOOL BrotliDecoderIsFinished(\n const BrotliDecoderState* state);\n\n/**\n * Acquires a detailed error code.\n *\n * Should be used only after ::BrotliDecoderDecompressStream returns\n * ::BROTLI_DECODER_RESULT_ERROR.\n *\n * See also ::BrotliDecoderErrorString\n *\n * @param state decoder instance\n * @returns last saved error code\n */\nBROTLI_DEC_API BrotliDecoderErrorCode BrotliDecoderGetErrorCode(\n const BrotliDecoderState* state);\n\n/**\n * Converts error code to a c-string.\n */\nBROTLI_DEC_API const char* BrotliDecoderErrorString(BrotliDecoderErrorCode c);\n\n/**\n * Gets a decoder library version.\n *\n * Look at BROTLI_MAKE_HEX_VERSION for more information.\n */\nBROTLI_DEC_API uint32_t BrotliDecoderVersion(void);\n\n/**\n * Callback to fire on metadata block start.\n *\n * After this callback is fired, if @p size is not @c 0, it is followed by\n * ::brotli_decoder_metadata_chunk_func as more metadata block contents become\n * accessible.\n *\n * @param opaque callback handle\n * @param size size of metadata block\n */\ntypedef void (*brotli_decoder_metadata_start_func)(void* opaque, size_t size);\n\n/**\n * Callback to fire on metadata block chunk becomes available.\n *\n * This function can be invoked multiple times per metadata block; block should\n * be considered finished when sum of @p size matches the announced metadata\n * block size. Chunks contents pointed by @p data are transient and shouln not\n * be accessed after leaving the callback.\n *\n * @param opaque callback handle\n * @param data pointer to metadata contents\n * @param size size of metadata block chunk, at least @c 1\n */\ntypedef void (*brotli_decoder_metadata_chunk_func)(void* opaque,\n const uint8_t* data,\n size_t size);\n\n/**\n * Sets callback for receiving metadata blocks.\n *\n * @param state decoder instance\n * @param start_func callback on metadata block start\n * @param chunk_func callback on metadata block chunk\n * @param opaque callback handle\n */\nBROTLI_DEC_API void BrotliDecoderSetMetadataCallbacks(\n BrotliDecoderState* state,\n brotli_decoder_metadata_start_func start_func,\n brotli_decoder_metadata_chunk_func chunk_func, void* opaque);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_DEC_DECODE_H_ */\n" }, { "path": "libs/brotli/include/brotli/encode.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/**\n * @file\n * API for Brotli compression.\n */\n\n#ifndef BROTLI_ENC_ENCODE_H_\n#define BROTLI_ENC_ENCODE_H_\n\n#include \n#include \n#include /* IWYU pragma: export */\n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n/** Minimal value for ::BROTLI_PARAM_LGWIN parameter. */\n#define BROTLI_MIN_WINDOW_BITS 10\n/**\n * Maximal value for ::BROTLI_PARAM_LGWIN parameter.\n *\n * @note equal to @c BROTLI_MAX_DISTANCE_BITS constant.\n */\n#define BROTLI_MAX_WINDOW_BITS 24\n/**\n * Maximal value for ::BROTLI_PARAM_LGWIN parameter\n * in \"Large Window Brotli\" (32-bit).\n */\n#define BROTLI_LARGE_MAX_WINDOW_BITS 30\n/** Minimal value for ::BROTLI_PARAM_LGBLOCK parameter. */\n#define BROTLI_MIN_INPUT_BLOCK_BITS 16\n/** Maximal value for ::BROTLI_PARAM_LGBLOCK parameter. */\n#define BROTLI_MAX_INPUT_BLOCK_BITS 24\n/** Minimal value for ::BROTLI_PARAM_QUALITY parameter. */\n#define BROTLI_MIN_QUALITY 0\n/** Maximal value for ::BROTLI_PARAM_QUALITY parameter. */\n#define BROTLI_MAX_QUALITY 11\n\n/** Options for ::BROTLI_PARAM_MODE parameter. */\ntypedef enum BrotliEncoderMode {\n /**\n * Default compression mode.\n *\n * In this mode compressor does not know anything in advance about the\n * properties of the input.\n */\n BROTLI_MODE_GENERIC = 0,\n /** Compression mode for UTF-8 formatted text input. */\n BROTLI_MODE_TEXT = 1,\n /** Compression mode used in WOFF 2.0. */\n BROTLI_MODE_FONT = 2\n} BrotliEncoderMode;\n\n/** Default value for ::BROTLI_PARAM_QUALITY parameter. */\n#define BROTLI_DEFAULT_QUALITY 11\n/** Default value for ::BROTLI_PARAM_LGWIN parameter. */\n#define BROTLI_DEFAULT_WINDOW 22\n/** Default value for ::BROTLI_PARAM_MODE parameter. */\n#define BROTLI_DEFAULT_MODE BROTLI_MODE_GENERIC\n\n/** Operations that can be performed by streaming encoder. */\ntypedef enum BrotliEncoderOperation {\n /**\n * Process input.\n *\n * Encoder may postpone producing output, until it has processed enough input.\n */\n BROTLI_OPERATION_PROCESS = 0,\n /**\n * Produce output for all processed input.\n *\n * Actual flush is performed when input stream is depleted and there is enough\n * space in output stream. This means that client should repeat\n * ::BROTLI_OPERATION_FLUSH operation until @p available_in becomes @c 0, and\n * ::BrotliEncoderHasMoreOutput returns ::BROTLI_FALSE. If output is acquired\n * via ::BrotliEncoderTakeOutput, then operation should be repeated after\n * output buffer is drained.\n *\n * @warning Until flush is complete, client @b SHOULD @b NOT swap,\n * reduce or extend input stream.\n *\n * When flush is complete, output data will be sufficient for decoder to\n * reproduce all the given input.\n */\n BROTLI_OPERATION_FLUSH = 1,\n /**\n * Finalize the stream.\n *\n * Actual finalization is performed when input stream is depleted and there is\n * enough space in output stream. This means that client should repeat\n * ::BROTLI_OPERATION_FINISH operation until @p available_in becomes @c 0, and\n * ::BrotliEncoderHasMoreOutput returns ::BROTLI_FALSE. If output is acquired\n * via ::BrotliEncoderTakeOutput, then operation should be repeated after\n * output buffer is drained.\n *\n * @warning Until finalization is complete, client @b SHOULD @b NOT swap,\n * reduce or extend input stream.\n *\n * Helper function ::BrotliEncoderIsFinished checks if stream is finalized and\n * output fully dumped.\n *\n * Adding more input data to finalized stream is impossible.\n */\n BROTLI_OPERATION_FINISH = 2,\n /**\n * Emit metadata block to stream.\n *\n * Metadata is opaque to Brotli: neither encoder, nor decoder processes this\n * data or relies on it. It may be used to pass some extra information from\n * encoder client to decoder client without interfering with main data stream.\n *\n * @note Encoder may emit empty metadata blocks internally, to pad encoded\n * stream to byte boundary.\n *\n * @warning Until emitting metadata is complete client @b SHOULD @b NOT swap,\n * reduce or extend input stream.\n *\n * @warning The whole content of input buffer is considered to be the content\n * of metadata block. Do @b NOT @e append metadata to input stream,\n * before it is depleted with other operations.\n *\n * Stream is soft-flushed before metadata block is emitted. Metadata block\n * @b MUST be no longer than than 16MiB.\n */\n BROTLI_OPERATION_EMIT_METADATA = 3\n} BrotliEncoderOperation;\n\n/** Options to be used with ::BrotliEncoderSetParameter. */\ntypedef enum BrotliEncoderParameter {\n /**\n * Tune encoder for specific input.\n *\n * ::BrotliEncoderMode enumerates all available values.\n */\n BROTLI_PARAM_MODE = 0,\n /**\n * The main compression speed-density lever.\n *\n * The higher the quality, the slower the compression. Range is\n * from ::BROTLI_MIN_QUALITY to ::BROTLI_MAX_QUALITY.\n */\n BROTLI_PARAM_QUALITY = 1,\n /**\n * Recommended sliding LZ77 window size.\n *\n * Encoder may reduce this value, e.g. if input is much smaller than\n * window size.\n *\n * Window size is `(1 << value) - 16`.\n *\n * Range is from ::BROTLI_MIN_WINDOW_BITS to ::BROTLI_MAX_WINDOW_BITS.\n */\n BROTLI_PARAM_LGWIN = 2,\n /**\n * Recommended input block size.\n *\n * Encoder may reduce this value, e.g. if input is much smaller than input\n * block size.\n *\n * Range is from ::BROTLI_MIN_INPUT_BLOCK_BITS to\n * ::BROTLI_MAX_INPUT_BLOCK_BITS.\n *\n * @note Bigger input block size allows better compression, but consumes more\n * memory. \\n The rough formula of memory used for temporary input\n * storage is `3 << lgBlock`.\n */\n BROTLI_PARAM_LGBLOCK = 3,\n /**\n * Flag that affects usage of \"literal context modeling\" format feature.\n *\n * This flag is a \"decoding-speed vs compression ratio\" trade-off.\n */\n BROTLI_PARAM_DISABLE_LITERAL_CONTEXT_MODELING = 4,\n /**\n * Estimated total input size for all ::BrotliEncoderCompressStream calls.\n *\n * The default value is 0, which means that the total input size is unknown.\n */\n BROTLI_PARAM_SIZE_HINT = 5,\n /**\n * Flag that determines if \"Large Window Brotli\" is used.\n */\n BROTLI_PARAM_LARGE_WINDOW = 6,\n /**\n * Recommended number of postfix bits (NPOSTFIX).\n *\n * Encoder may change this value.\n *\n * Range is from 0 to ::BROTLI_MAX_NPOSTFIX.\n */\n BROTLI_PARAM_NPOSTFIX = 7,\n /**\n * Recommended number of direct distance codes (NDIRECT).\n *\n * Encoder may change this value.\n *\n * Range is from 0 to (15 << NPOSTFIX) in steps of (1 << NPOSTFIX).\n */\n BROTLI_PARAM_NDIRECT = 8,\n /**\n * Number of bytes of input stream already processed by a different instance.\n *\n * @note It is important to configure all the encoder instances with same\n * parameters (except this one) in order to allow all the encoded parts\n * obey the same restrictions implied by header.\n *\n * If offset is not 0, then stream header is omitted.\n * In any case output start is byte aligned, so for proper streams stitching\n * \"predecessor\" stream must be flushed.\n *\n * Range is not artificially limited, but all the values greater or equal to\n * maximal window size have the same effect. Values greater than 2**30 are not\n * allowed.\n */\n BROTLI_PARAM_STREAM_OFFSET = 9\n} BrotliEncoderParameter;\n\n/**\n * Opaque structure that holds encoder state.\n *\n * Allocated and initialized with ::BrotliEncoderCreateInstance.\n * Cleaned up and deallocated with ::BrotliEncoderDestroyInstance.\n */\ntypedef struct BrotliEncoderStateStruct BrotliEncoderState;\n\n/**\n * Sets the specified parameter to the given encoder instance.\n *\n * @param state encoder instance\n * @param param parameter to set\n * @param value new parameter value\n * @returns ::BROTLI_FALSE if parameter is unrecognized, or value is invalid\n * @returns ::BROTLI_FALSE if value of parameter can not be changed at current\n * encoder state (e.g. when encoding is started, window size might be\n * already encoded and therefore it is impossible to change it)\n * @returns ::BROTLI_TRUE if value is accepted\n * @warning invalid values might be accepted in case they would not break\n * encoding process.\n */\nBROTLI_ENC_API BROTLI_BOOL BrotliEncoderSetParameter(\n BrotliEncoderState* state, BrotliEncoderParameter param, uint32_t value);\n\n/**\n * Creates an instance of ::BrotliEncoderState and initializes it.\n *\n * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the\n * case they are both zero, default memory allocators are used. @p opaque is\n * passed to @p alloc_func and @p free_func when they are called. @p free_func\n * has to return without doing anything when asked to free a NULL pointer.\n *\n * @param alloc_func custom memory allocation function\n * @param free_func custom memory free function\n * @param opaque custom memory manager handle\n * @returns @c 0 if instance can not be allocated or initialized\n * @returns pointer to initialized ::BrotliEncoderState otherwise\n */\nBROTLI_ENC_API BrotliEncoderState* BrotliEncoderCreateInstance(\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);\n\n/**\n * Deinitializes and frees ::BrotliEncoderState instance.\n *\n * @param state decoder instance to be cleaned up and deallocated\n */\nBROTLI_ENC_API void BrotliEncoderDestroyInstance(BrotliEncoderState* state);\n\n/* Opaque type for pointer to different possible internal structures containing\n dictionary prepared for the encoder */\ntypedef struct BrotliEncoderPreparedDictionaryStruct\n BrotliEncoderPreparedDictionary;\n\n/**\n * Prepares a shared dictionary from the given file format for the encoder.\n *\n * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the\n * case they are both zero, default memory allocators are used. @p opaque is\n * passed to @p alloc_func and @p free_func when they are called. @p free_func\n * has to return without doing anything when asked to free a NULL pointer.\n *\n * @warning Created instance is \"lean\"; it does not contain copy of @p data,\n * rather it contains only pointer to it; therefore,\n * @p data @b MUST outlive the created instance.\n *\n * @param type type of dictionary stored in data\n * @param data_size size of @p data buffer\n * @param data pointer to the dictionary data\n * @param quality the maximum Brotli quality to prepare the dictionary for,\n * use BROTLI_MAX_QUALITY by default\n * @param alloc_func custom memory allocation function\n * @param free_func custom memory free function\n * @param opaque custom memory manager handle\n */\nBROTLI_ENC_API BrotliEncoderPreparedDictionary*\nBrotliEncoderPrepareDictionary(BrotliSharedDictionaryType type,\n size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)],\n int quality,\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);\n\nBROTLI_ENC_API void BrotliEncoderDestroyPreparedDictionary(\n BrotliEncoderPreparedDictionary* dictionary);\n\n/**\n * Attaches a prepared dictionary of any type to the encoder. Can be used\n * multiple times to attach multiple dictionaries. The dictionary type was\n * determined by BrotliEncoderPrepareDictionary. Multiple raw prefix\n * dictionaries and/or max 1 serialized dictionary with custom words can be\n * attached.\n *\n * @returns ::BROTLI_FALSE in case of error\n * @returns ::BROTLI_TRUE otherwise\n */\nBROTLI_ENC_API BROTLI_BOOL BrotliEncoderAttachPreparedDictionary(\n BrotliEncoderState* state,\n const BrotliEncoderPreparedDictionary* dictionary);\n\n/**\n * Calculates the output size bound for the given @p input_size.\n *\n * @warning Result is only valid if quality is at least @c 2 and, in\n * case ::BrotliEncoderCompressStream was used, no flushes\n * (::BROTLI_OPERATION_FLUSH) were performed.\n *\n * @param input_size size of projected input\n * @returns @c 0 if result does not fit @c size_t\n */\nBROTLI_ENC_API size_t BrotliEncoderMaxCompressedSize(size_t input_size);\n\n/**\n * Performs one-shot memory-to-memory compression.\n *\n * Compresses the data in @p input_buffer into @p encoded_buffer, and sets\n * @p *encoded_size to the compressed length.\n *\n * @note If ::BrotliEncoderMaxCompressedSize(@p input_size) returns non-zero\n * value, then output is guaranteed to be no longer than that.\n *\n * @note If @p lgwin is greater than ::BROTLI_MAX_WINDOW_BITS then resulting\n * stream might be incompatible with RFC 7932; to decode such streams,\n * decoder should be configured with\n * ::BROTLI_DECODER_PARAM_LARGE_WINDOW = @c 1\n *\n * @param quality quality parameter value, e.g. ::BROTLI_DEFAULT_QUALITY\n * @param lgwin lgwin parameter value, e.g. ::BROTLI_DEFAULT_WINDOW\n * @param mode mode parameter value, e.g. ::BROTLI_DEFAULT_MODE\n * @param input_size size of @p input_buffer\n * @param input_buffer input data buffer with at least @p input_size\n * addressable bytes\n * @param[in, out] encoded_size @b in: size of @p encoded_buffer; \\n\n * @b out: length of compressed data written to\n * @p encoded_buffer, or @c 0 if compression fails\n * @param encoded_buffer compressed data destination buffer\n * @returns ::BROTLI_FALSE in case of compression error\n * @returns ::BROTLI_FALSE if output buffer is too small\n * @returns ::BROTLI_TRUE otherwise\n */\nBROTLI_ENC_API BROTLI_BOOL BrotliEncoderCompress(\n int quality, int lgwin, BrotliEncoderMode mode, size_t input_size,\n const uint8_t input_buffer[BROTLI_ARRAY_PARAM(input_size)],\n size_t* encoded_size,\n uint8_t encoded_buffer[BROTLI_ARRAY_PARAM(*encoded_size)]);\n\n/**\n * Compresses input stream to output stream.\n *\n * The values @p *available_in and @p *available_out must specify the number of\n * bytes addressable at @p *next_in and @p *next_out respectively.\n * When @p *available_out is @c 0, @p next_out is allowed to be @c NULL.\n *\n * After each call, @p *available_in will be decremented by the amount of input\n * bytes consumed, and the @p *next_in pointer will be incremented by that\n * amount. Similarly, @p *available_out will be decremented by the amount of\n * output bytes written, and the @p *next_out pointer will be incremented by\n * that amount.\n *\n * @p total_out, if it is not a null-pointer, will be set to the number\n * of bytes compressed since the last @p state initialization.\n *\n *\n *\n * Internally workflow consists of 3 tasks:\n * -# (optionally) copy input data to internal buffer\n * -# actually compress data and (optionally) store it to internal buffer\n * -# (optionally) copy compressed bytes from internal buffer to output stream\n *\n * Whenever all 3 tasks can't move forward anymore, or error occurs, this\n * method returns the control flow to caller.\n *\n * @p op is used to perform flush, finish the stream, or inject metadata block.\n * See ::BrotliEncoderOperation for more information.\n *\n * Flushing the stream means forcing encoding of all input passed to encoder and\n * completing the current output block, so it could be fully decoded by stream\n * decoder. To perform flush set @p op to ::BROTLI_OPERATION_FLUSH.\n * Under some circumstances (e.g. lack of output stream capacity) this operation\n * would require several calls to ::BrotliEncoderCompressStream. The method must\n * be called again until both input stream is depleted and encoder has no more\n * output (see ::BrotliEncoderHasMoreOutput) after the method is called.\n *\n * Finishing the stream means encoding of all input passed to encoder and\n * adding specific \"final\" marks, so stream decoder could determine that stream\n * is complete. To perform finish set @p op to ::BROTLI_OPERATION_FINISH.\n * Under some circumstances (e.g. lack of output stream capacity) this operation\n * would require several calls to ::BrotliEncoderCompressStream. The method must\n * be called again until both input stream is depleted and encoder has no more\n * output (see ::BrotliEncoderHasMoreOutput) after the method is called.\n *\n * @warning When flushing and finishing, @p op should not change until operation\n * is complete; input stream should not be swapped, reduced or\n * extended as well.\n *\n * @param state encoder instance\n * @param op requested operation\n * @param[in, out] available_in @b in: amount of available input; \\n\n * @b out: amount of unused input\n * @param[in, out] next_in pointer to the next input byte\n * @param[in, out] available_out @b in: length of output buffer; \\n\n * @b out: remaining size of output buffer\n * @param[in, out] next_out compressed output buffer cursor;\n * can be @c NULL if @p available_out is @c 0\n * @param[out] total_out number of bytes produced so far; can be @c NULL\n * @returns ::BROTLI_FALSE if there was an error\n * @returns ::BROTLI_TRUE otherwise\n */\nBROTLI_ENC_API BROTLI_BOOL BrotliEncoderCompressStream(\n BrotliEncoderState* state, BrotliEncoderOperation op, size_t* available_in,\n const uint8_t** next_in, size_t* available_out, uint8_t** next_out,\n size_t* total_out);\n\n/**\n * Checks if encoder instance reached the final state.\n *\n * @param state encoder instance\n * @returns ::BROTLI_TRUE if encoder is in a state where it reached the end of\n * the input and produced all of the output\n * @returns ::BROTLI_FALSE otherwise\n */\nBROTLI_ENC_API BROTLI_BOOL BrotliEncoderIsFinished(BrotliEncoderState* state);\n\n/**\n * Checks if encoder has more output.\n *\n * @param state encoder instance\n * @returns ::BROTLI_TRUE, if encoder has some unconsumed output\n * @returns ::BROTLI_FALSE otherwise\n */\nBROTLI_ENC_API BROTLI_BOOL BrotliEncoderHasMoreOutput(\n BrotliEncoderState* state);\n\n/**\n * Acquires pointer to internal output buffer.\n *\n * This method is used to make language bindings easier and more efficient:\n * -# push data to ::BrotliEncoderCompressStream,\n * until ::BrotliEncoderHasMoreOutput returns BROTLI_TRUE\n * -# use ::BrotliEncoderTakeOutput to peek bytes and copy to language-specific\n * entity\n *\n * Also this could be useful if there is an output stream that is able to\n * consume all the provided data (e.g. when data is saved to file system).\n *\n * @attention After every call to ::BrotliEncoderTakeOutput @p *size bytes of\n * output are considered consumed for all consecutive calls to the\n * instance methods; returned pointer becomes invalidated as well.\n *\n * @note Encoder output is not guaranteed to be contiguous. This means that\n * after the size-unrestricted call to ::BrotliEncoderTakeOutput,\n * immediate next call to ::BrotliEncoderTakeOutput may return more data.\n *\n * @param state encoder instance\n * @param[in, out] size @b in: number of bytes caller is ready to take, @c 0 if\n * any amount could be handled; \\n\n * @b out: amount of data pointed by returned pointer and\n * considered consumed; \\n\n * out value is never greater than in value, unless it is @c 0\n * @returns pointer to output data\n */\nBROTLI_ENC_API const uint8_t* BrotliEncoderTakeOutput(\n BrotliEncoderState* state, size_t* size);\n\n/* Returns the estimated peak memory usage (in bytes) of the BrotliCompress()\n function, not counting the memory needed for the input and output. */\nBROTLI_ENC_EXTRA_API size_t BrotliEncoderEstimatePeakMemoryUsage(\n int quality, int lgwin, size_t input_size);\n/* Returns 0 if dictionary is not valid; otherwise returns allocation size. */\nBROTLI_ENC_EXTRA_API size_t BrotliEncoderGetPreparedDictionarySize(\n const BrotliEncoderPreparedDictionary* dictionary);\n\n/**\n * Gets an encoder library version.\n *\n * Look at BROTLI_MAKE_HEX_VERSION for more information.\n */\nBROTLI_ENC_API uint32_t BrotliEncoderVersion(void);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_ENC_ENCODE_H_ */\n" }, { "path": "libs/brotli/include/brotli/port.h", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Macros for compiler / platform specific API declarations. */\n\n#ifndef BROTLI_COMMON_PORT_H_\n#define BROTLI_COMMON_PORT_H_\n\n/* The following macros were borrowed from https://github.com/nemequ/hedley\n * with permission of original author - Evan Nemerson */\n\n/* >>> >>> >>> hedley macros */\n\n#define BROTLI_MAKE_VERSION(major, minor, revision) \\\n (((major) * 1000000) + ((minor) * 1000) + (revision))\n\n#if defined(__GNUC__) && defined(__GNUC_PATCHLEVEL__)\n#define BROTLI_GNUC_VERSION \\\n BROTLI_MAKE_VERSION(__GNUC__, __GNUC_MINOR__, __GNUC_PATCHLEVEL__)\n#elif defined(__GNUC__)\n#define BROTLI_GNUC_VERSION BROTLI_MAKE_VERSION(__GNUC__, __GNUC_MINOR__, 0)\n#endif\n\n#if defined(BROTLI_GNUC_VERSION)\n#define BROTLI_GNUC_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_GNUC_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_GNUC_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(_MSC_FULL_VER) && (_MSC_FULL_VER >= 140000000)\n#define BROTLI_MSVC_VERSION \\\n BROTLI_MAKE_VERSION((_MSC_FULL_VER / 10000000), \\\n (_MSC_FULL_VER % 10000000) / 100000, \\\n (_MSC_FULL_VER % 100000) / 100)\n#elif defined(_MSC_FULL_VER)\n#define BROTLI_MSVC_VERSION \\\n BROTLI_MAKE_VERSION((_MSC_FULL_VER / 1000000), \\\n (_MSC_FULL_VER % 1000000) / 10000, \\\n (_MSC_FULL_VER % 10000) / 10)\n#elif defined(_MSC_VER)\n#define BROTLI_MSVC_VERSION \\\n BROTLI_MAKE_VERSION(_MSC_VER / 100, _MSC_VER % 100, 0)\n#endif\n\n#if !defined(_MSC_VER)\n#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) (0)\n#elif defined(_MSC_VER) && (_MSC_VER >= 1400)\n#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) \\\n (_MSC_FULL_VER >= ((major * 10000000) + (minor * 100000) + (patch)))\n#elif defined(_MSC_VER) && (_MSC_VER >= 1200)\n#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) \\\n (_MSC_FULL_VER >= ((major * 1000000) + (minor * 10000) + (patch)))\n#else\n#define BROTLI_MSVC_VERSION_CHECK(major, minor, patch) \\\n (_MSC_VER >= ((major * 100) + (minor)))\n#endif\n\n#if defined(__INTEL_COMPILER) && defined(__INTEL_COMPILER_UPDATE)\n#define BROTLI_INTEL_VERSION \\\n BROTLI_MAKE_VERSION(__INTEL_COMPILER / 100, \\\n __INTEL_COMPILER % 100, \\\n __INTEL_COMPILER_UPDATE)\n#elif defined(__INTEL_COMPILER)\n#define BROTLI_INTEL_VERSION \\\n BROTLI_MAKE_VERSION(__INTEL_COMPILER / 100, __INTEL_COMPILER % 100, 0)\n#endif\n\n#if defined(BROTLI_INTEL_VERSION)\n#define BROTLI_INTEL_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_INTEL_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_INTEL_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__PGI) && \\\n defined(__PGIC__) && defined(__PGIC_MINOR__) && defined(__PGIC_PATCHLEVEL__)\n#define BROTLI_PGI_VERSION \\\n BROTLI_MAKE_VERSION(__PGIC__, __PGIC_MINOR__, __PGIC_PATCHLEVEL__)\n#endif\n\n#if defined(BROTLI_PGI_VERSION)\n#define BROTLI_PGI_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_PGI_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_PGI_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__SUNPRO_C) && (__SUNPRO_C > 0x1000)\n#define BROTLI_SUNPRO_VERSION \\\n BROTLI_MAKE_VERSION( \\\n (((__SUNPRO_C >> 16) & 0xf) * 10) + ((__SUNPRO_C >> 12) & 0xf), \\\n (((__SUNPRO_C >> 8) & 0xf) * 10) + ((__SUNPRO_C >> 4) & 0xf), \\\n (__SUNPRO_C & 0xf) * 10)\n#elif defined(__SUNPRO_C)\n#define BROTLI_SUNPRO_VERSION \\\n BROTLI_MAKE_VERSION((__SUNPRO_C >> 8) & 0xf, \\\n (__SUNPRO_C >> 4) & 0xf, \\\n (__SUNPRO_C) & 0xf)\n#elif defined(__SUNPRO_CC) && (__SUNPRO_CC > 0x1000)\n#define BROTLI_SUNPRO_VERSION \\\n BROTLI_MAKE_VERSION( \\\n (((__SUNPRO_CC >> 16) & 0xf) * 10) + ((__SUNPRO_CC >> 12) & 0xf), \\\n (((__SUNPRO_CC >> 8) & 0xf) * 10) + ((__SUNPRO_CC >> 4) & 0xf), \\\n (__SUNPRO_CC & 0xf) * 10)\n#elif defined(__SUNPRO_CC)\n#define BROTLI_SUNPRO_VERSION \\\n BROTLI_MAKE_VERSION((__SUNPRO_CC >> 8) & 0xf, \\\n (__SUNPRO_CC >> 4) & 0xf, \\\n (__SUNPRO_CC) & 0xf)\n#endif\n\n#if defined(BROTLI_SUNPRO_VERSION)\n#define BROTLI_SUNPRO_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_SUNPRO_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_SUNPRO_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__CC_ARM) && defined(__ARMCOMPILER_VERSION)\n#define BROTLI_ARM_VERSION \\\n BROTLI_MAKE_VERSION((__ARMCOMPILER_VERSION / 1000000), \\\n (__ARMCOMPILER_VERSION % 1000000) / 10000, \\\n (__ARMCOMPILER_VERSION % 10000) / 100)\n#elif defined(__CC_ARM) && defined(__ARMCC_VERSION)\n#define BROTLI_ARM_VERSION \\\n BROTLI_MAKE_VERSION((__ARMCC_VERSION / 1000000), \\\n (__ARMCC_VERSION % 1000000) / 10000, \\\n (__ARMCC_VERSION % 10000) / 100)\n#endif\n\n#if defined(BROTLI_ARM_VERSION)\n#define BROTLI_ARM_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_ARM_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_ARM_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__ibmxl__)\n#define BROTLI_IBM_VERSION \\\n BROTLI_MAKE_VERSION(__ibmxl_version__, \\\n __ibmxl_release__, \\\n __ibmxl_modification__)\n#elif defined(__xlC__) && defined(__xlC_ver__)\n#define BROTLI_IBM_VERSION \\\n BROTLI_MAKE_VERSION(__xlC__ >> 8, __xlC__ & 0xff, (__xlC_ver__ >> 8) & 0xff)\n#elif defined(__xlC__)\n#define BROTLI_IBM_VERSION BROTLI_MAKE_VERSION(__xlC__ >> 8, __xlC__ & 0xff, 0)\n#endif\n\n#if defined(BROTLI_IBM_VERSION)\n#define BROTLI_IBM_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_IBM_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_IBM_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__TI_COMPILER_VERSION__)\n#define BROTLI_TI_VERSION \\\n BROTLI_MAKE_VERSION((__TI_COMPILER_VERSION__ / 1000000), \\\n (__TI_COMPILER_VERSION__ % 1000000) / 1000, \\\n (__TI_COMPILER_VERSION__ % 1000))\n#endif\n\n#if defined(BROTLI_TI_VERSION)\n#define BROTLI_TI_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_TI_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_TI_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__IAR_SYSTEMS_ICC__)\n#if __VER__ > 1000\n#define BROTLI_IAR_VERSION \\\n BROTLI_MAKE_VERSION((__VER__ / 1000000), \\\n (__VER__ / 1000) % 1000, \\\n (__VER__ % 1000))\n#else\n#define BROTLI_IAR_VERSION BROTLI_MAKE_VERSION(VER / 100, __VER__ % 100, 0)\n#endif\n#endif\n\n#if defined(BROTLI_IAR_VERSION)\n#define BROTLI_IAR_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_IAR_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_IAR_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__TINYC__)\n#define BROTLI_TINYC_VERSION \\\n BROTLI_MAKE_VERSION(__TINYC__ / 1000, (__TINYC__ / 100) % 10, __TINYC__ % 100)\n#endif\n\n#if defined(BROTLI_TINYC_VERSION)\n#define BROTLI_TINYC_VERSION_CHECK(major, minor, patch) \\\n (BROTLI_TINYC_VERSION >= BROTLI_MAKE_VERSION(major, minor, patch))\n#else\n#define BROTLI_TINYC_VERSION_CHECK(major, minor, patch) (0)\n#endif\n\n#if defined(__has_attribute)\n#define BROTLI_GNUC_HAS_ATTRIBUTE(attribute, major, minor, patch) \\\n __has_attribute(attribute)\n#else\n#define BROTLI_GNUC_HAS_ATTRIBUTE(attribute, major, minor, patch) \\\n BROTLI_GNUC_VERSION_CHECK(major, minor, patch)\n#endif\n\n#if defined(__has_builtin)\n#define BROTLI_GNUC_HAS_BUILTIN(builtin, major, minor, patch) \\\n __has_builtin(builtin)\n#else\n#define BROTLI_GNUC_HAS_BUILTIN(builtin, major, minor, patch) \\\n BROTLI_GNUC_VERSION_CHECK(major, minor, patch)\n#endif\n\n#if defined(__has_feature)\n#define BROTLI_HAS_FEATURE(feature) __has_feature(feature)\n#else\n#define BROTLI_HAS_FEATURE(feature) (0)\n#endif\n\n#if defined(_WIN32) || defined(__CYGWIN__)\n#define BROTLI_PUBLIC\n#elif BROTLI_GNUC_VERSION_CHECK(3, 3, 0) || \\\n BROTLI_TI_VERSION_CHECK(8, 0, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0) || \\\n BROTLI_ARM_VERSION_CHECK(4, 1, 0) || \\\n BROTLI_IBM_VERSION_CHECK(13, 1, 0) || \\\n BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) || \\\n (BROTLI_TI_VERSION_CHECK(7, 3, 0) && \\\n defined(__TI_GNU_ATTRIBUTE_SUPPORT__) && defined(__TI_EABI__))\n#define BROTLI_PUBLIC __attribute__ ((visibility (\"default\")))\n#else\n#define BROTLI_PUBLIC\n#endif\n\n#if defined(_WIN32) || defined(__CYGWIN__)\n#define BROTLI_INTERNAL\n#elif BROTLI_GNUC_VERSION_CHECK(3, 3, 0) || \\\n BROTLI_TI_VERSION_CHECK(8, 0, 0) || \\\n BROTLI_INTEL_VERSION_CHECK(16, 0, 0) || \\\n BROTLI_ARM_VERSION_CHECK(4, 1, 0) || \\\n BROTLI_IBM_VERSION_CHECK(13, 1, 0) || \\\n BROTLI_SUNPRO_VERSION_CHECK(5, 11, 0) || \\\n (BROTLI_TI_VERSION_CHECK(7, 3, 0) && \\\n defined(__TI_GNU_ATTRIBUTE_SUPPORT__) && defined(__TI_EABI__))\n#define BROTLI_INTERNAL __attribute__ ((visibility (\"hidden\")))\n#else\n#define BROTLI_INTERNAL\n#endif\n\n#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) && \\\n !defined(__STDC_NO_VLA__) && !defined(__cplusplus) && \\\n !defined(__PGI) && !defined(__PGIC__) && !defined(__TINYC__) && \\\n !defined(__clang__)\n#define BROTLI_ARRAY_PARAM(name) (name)\n#else\n#define BROTLI_ARRAY_PARAM(name)\n#endif\n\n/* <<< <<< <<< end of hedley macros. */\n\n#if defined(BROTLI_SHARED_COMPILATION)\n#if defined(_WIN32)\n#if defined(BROTLICOMMON_SHARED_COMPILATION)\n#define BROTLI_COMMON_API __declspec(dllexport)\n#else /* !BROTLICOMMON_SHARED_COMPILATION */\n#define BROTLI_COMMON_API __declspec(dllimport)\n#endif /* BROTLICOMMON_SHARED_COMPILATION */\n#if defined(BROTLIDEC_SHARED_COMPILATION)\n#define BROTLI_DEC_API __declspec(dllexport)\n#else /* !BROTLIDEC_SHARED_COMPILATION */\n#define BROTLI_DEC_API __declspec(dllimport)\n#endif /* BROTLIDEC_SHARED_COMPILATION */\n#if defined(BROTLIENC_SHARED_COMPILATION)\n#define BROTLI_ENC_API __declspec(dllexport)\n#else /* !BROTLIENC_SHARED_COMPILATION */\n#define BROTLI_ENC_API __declspec(dllimport)\n#endif /* BROTLIENC_SHARED_COMPILATION */\n#else /* !_WIN32 */\n#define BROTLI_COMMON_API BROTLI_PUBLIC\n#define BROTLI_DEC_API BROTLI_PUBLIC\n#define BROTLI_ENC_API BROTLI_PUBLIC\n#endif /* _WIN32 */\n#else /* BROTLI_SHARED_COMPILATION */\n#define BROTLI_COMMON_API\n#define BROTLI_DEC_API\n#define BROTLI_ENC_API\n#endif\n\n#if defined(BROTLI_BUILD_ENC_EXTRA_API)\n#define BROTLI_ENC_EXTRA_API BROTLI_ENC_API\n#else\n#define BROTLI_ENC_EXTRA_API BROTLI_INTERNAL\n#endif\n\n#endif /* BROTLI_COMMON_PORT_H_ */\n" }, { "path": "libs/brotli/include/brotli/shared_dictionary.h", "content": "/* Copyright 2017 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* (Opaque) Shared Dictionary definition and utilities. */\n\n#ifndef BROTLI_COMMON_SHARED_DICTIONARY_H_\n#define BROTLI_COMMON_SHARED_DICTIONARY_H_\n\n#include \n#include \n\n#if defined(__cplusplus) || defined(c_plusplus)\nextern \"C\" {\n#endif\n\n#define SHARED_BROTLI_MIN_DICTIONARY_WORD_LENGTH 4\n#define SHARED_BROTLI_MAX_DICTIONARY_WORD_LENGTH 31\n#define SHARED_BROTLI_NUM_DICTIONARY_CONTEXTS 64\n#define SHARED_BROTLI_MAX_COMPOUND_DICTS 15\n\n/**\n * Opaque structure that holds shared dictionary data.\n *\n * Allocated and initialized with ::BrotliSharedDictionaryCreateInstance.\n * Cleaned up and deallocated with ::BrotliSharedDictionaryDestroyInstance.\n */\ntypedef struct BrotliSharedDictionaryStruct BrotliSharedDictionary;\n\n/**\n * Input data type for ::BrotliSharedDictionaryAttach.\n */\ntypedef enum BrotliSharedDictionaryType {\n /** Raw LZ77 prefix dictionary. */\n BROTLI_SHARED_DICTIONARY_RAW = 0,\n /** Serialized shared dictionary.\n *\n * DO NOT USE: methods accepting this value will fail.\n */\n BROTLI_SHARED_DICTIONARY_SERIALIZED = 1\n} BrotliSharedDictionaryType;\n\n/**\n * Creates an instance of ::BrotliSharedDictionary.\n *\n * Fresh instance has default word dictionary and transforms\n * and no LZ77 prefix dictionary.\n *\n * @p alloc_func and @p free_func @b MUST be both zero or both non-zero. In the\n * case they are both zero, default memory allocators are used. @p opaque is\n * passed to @p alloc_func and @p free_func when they are called. @p free_func\n * has to return without doing anything when asked to free a NULL pointer.\n *\n * @param alloc_func custom memory allocation function\n * @param free_func custom memory free function\n * @param opaque custom memory manager handle\n * @returns @c 0 if instance can not be allocated or initialized\n * @returns pointer to initialized ::BrotliSharedDictionary otherwise\n */\nBROTLI_COMMON_API BrotliSharedDictionary* BrotliSharedDictionaryCreateInstance(\n brotli_alloc_func alloc_func, brotli_free_func free_func, void* opaque);\n\n/**\n * Deinitializes and frees ::BrotliSharedDictionary instance.\n *\n * @param dict shared dictionary instance to be cleaned up and deallocated\n */\nBROTLI_COMMON_API void BrotliSharedDictionaryDestroyInstance(\n BrotliSharedDictionary* dict);\n\n/**\n * Attaches dictionary to a given instance of ::BrotliSharedDictionary.\n *\n * Dictionary to be attached is represented in a serialized format as a region\n * of memory.\n *\n * Provided data it partially referenced by a resulting (compound) dictionary,\n * and should be kept untouched, while at least one compound dictionary uses it.\n * This way memory overhead is kept minimal by the cost of additional resource\n * management.\n *\n * @param dict dictionary to extend\n * @param type type of dictionary to attach\n * @param data_size size of @p data\n * @param data serialized dictionary of type @p type, with at least @p data_size\n * addressable bytes\n * @returns ::BROTLI_TRUE if provided dictionary is successfully attached\n * @returns ::BROTLI_FALSE otherwise\n */\nBROTLI_COMMON_API BROTLI_BOOL BrotliSharedDictionaryAttach(\n BrotliSharedDictionary* dict, BrotliSharedDictionaryType type,\n size_t data_size, const uint8_t data[BROTLI_ARRAY_PARAM(data_size)]);\n\n#if defined(__cplusplus) || defined(c_plusplus)\n} /* extern \"C\" */\n#endif\n\n#endif /* BROTLI_COMMON_SHARED_DICTIONARY_H_ */\n" }, { "path": "libs/brotli/include/brotli/types.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/**\n * @file\n * Common types used in decoder and encoder API.\n */\n\n#ifndef BROTLI_COMMON_TYPES_H_\n#define BROTLI_COMMON_TYPES_H_\n\n#include /* IWYU pragma: export */\n\n#if defined(_MSC_VER) && (_MSC_VER < 1600)\ntypedef __int8 int8_t;\ntypedef unsigned __int8 uint8_t;\ntypedef __int16 int16_t;\ntypedef unsigned __int16 uint16_t;\ntypedef __int32 int32_t;\ntypedef unsigned __int32 uint32_t;\ntypedef unsigned __int64 uint64_t;\ntypedef __int64 int64_t;\n#else\n#include /* IWYU pragma: export */\n#endif /* defined(_MSC_VER) && (_MSC_VER < 1600) */\n\n/**\n * A portable @c bool replacement.\n *\n * ::BROTLI_BOOL is a \"documentation\" type: actually it is @c int, but in API it\n * denotes a type, whose only values are ::BROTLI_TRUE and ::BROTLI_FALSE.\n *\n * ::BROTLI_BOOL values passed to Brotli should either be ::BROTLI_TRUE or\n * ::BROTLI_FALSE, or be a result of ::TO_BROTLI_BOOL macros.\n *\n * ::BROTLI_BOOL values returned by Brotli should not be tested for equality\n * with @c true, @c false, ::BROTLI_TRUE, ::BROTLI_FALSE, but rather should be\n * evaluated, for example: @code{.cpp}\n * if (SomeBrotliFunction(encoder, BROTLI_TRUE) &&\n * !OtherBrotliFunction(decoder, BROTLI_FALSE)) {\n * bool x = !!YetAnotherBrotliFunction(encoder, TO_BROLTI_BOOL(2 * 2 == 4));\n * DoSomething(x);\n * }\n * @endcode\n */\n#define BROTLI_BOOL int\n/** Portable @c true replacement. */\n#define BROTLI_TRUE 1\n/** Portable @c false replacement. */\n#define BROTLI_FALSE 0\n/** @c bool to ::BROTLI_BOOL conversion macros. */\n#define TO_BROTLI_BOOL(X) (!!(X) ? BROTLI_TRUE : BROTLI_FALSE)\n\n#define BROTLI_MAKE_UINT64_T(high, low) ((((uint64_t)(high)) << 32) | low)\n\n#define BROTLI_UINT32_MAX (~((uint32_t)0))\n#define BROTLI_SIZE_MAX (~((size_t)0))\n\n/**\n * Allocating function pointer type.\n *\n * @param opaque custom memory manager handle provided by client\n * @param size requested memory region size; can not be @c 0\n * @returns @c 0 in the case of failure\n * @returns a valid pointer to a memory region of at least @p size bytes\n * long otherwise\n */\ntypedef void* (*brotli_alloc_func)(void* opaque, size_t size);\n\n/**\n * Deallocating function pointer type.\n *\n * This function @b SHOULD do nothing if @p address is @c 0.\n *\n * @param opaque custom memory manager handle provided by client\n * @param address memory region pointer returned by ::brotli_alloc_func, or @c 0\n */\ntypedef void (*brotli_free_func)(void* opaque, void* address);\n\n#endif /* BROTLI_COMMON_TYPES_H_ */\n" }, { "path": "libs/clipper/License.txt", "content": "Boost Software License - Version 1.0 - August 17th, 2003\nhttp://www.boost.org/LICENSE_1_0.txt\n\nPermission is hereby granted, free of charge, to any person or organization\nobtaining a copy of the software and accompanying documentation covered by\nthis license (the \"Software\") to use, reproduce, display, distribute,\nexecute, and transmit the Software, and to prepare derivative works of the\nSoftware, and to permit third-parties to whom the Software is furnished to\ndo so, all subject to the following:\n\nThe copyright notices in the Software and this entire statement, including\nthe above license grant, this restriction and the following disclaimer,\nmust be included in all copies of the Software, in whole or in part, and\nall derivative works of the Software, unless such copies or derivative\nworks are solely in the form of machine-executable object code generated by\na source language processor.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\nSHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\nFOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\nDEALINGS IN THE SOFTWARE." }, { "path": "libs/clipper/Makefile.am", "content": "noinst_LIBRARIES = libclipper.a\nlibclipper_a_SOURCES = clipper.cpp clipper.hpp\nEXTRA_DIST = License.txt\n\nAM_CXXFLAGS = -Wall\n\nclipper.cpp: clipper.hpp\n\nCLEANFILES = *.gcda *.gcno\n" }, { "path": "libs/clipper/clipper.cpp", "content": "/*******************************************************************************\n* *\n* Author : Angus Johnson *\n* Version : 6.2.1 *\n* Date : 31 October 2014 *\n* Website : http://www.angusj.com *\n* Copyright : Angus Johnson 2010-2014 *\n* *\n* License: *\n* Use, modification & distribution is subject to Boost Software License Ver 1. *\n* http://www.boost.org/LICENSE_1_0.txt *\n* *\n* Attributions: *\n* The code in this library is an extension of Bala Vatti's clipping algorithm: *\n* \"A generic solution to polygon clipping\" *\n* Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63. *\n* http://portal.acm.org/citation.cfm?id=129906 *\n* *\n* Computer graphics and geometric modeling: implementation and algorithms *\n* By Max K. Agoston *\n* Springer; 1 edition (January 4, 2005) *\n* http://books.google.com/books?q=vatti+clipping+agoston *\n* *\n* See also: *\n* \"Polygon Offsetting by Computing Winding Numbers\" *\n* Paper no. DETC2005-85513 pp. 565-575 *\n* ASME 2005 International Design Engineering Technical Conferences *\n* and Computers and Information in Engineering Conference (IDETC/CIE2005) *\n* September 24-28, 2005 , Long Beach, California, USA *\n* http://www.me.berkeley.edu/~mcmains/pubs/DAC05OffsetPolygon.pdf *\n* *\n*******************************************************************************/\n\n/*******************************************************************************\n* *\n* This is a translation of the Delphi Clipper library and the naming style *\n* used has retained a Delphi flavour. *\n* *\n*******************************************************************************/\n\n#include \"clipper.hpp\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace ClipperLib {\n\nstatic double const pi = 3.141592653589793238;\nstatic double const two_pi = pi *2;\nstatic double const def_arc_tolerance = 0.25;\n\nenum Direction { dRightToLeft, dLeftToRight };\n\nstatic int const Unassigned = -1; //edge not currently 'owning' a solution\nstatic int const Skip = -2; //edge that would otherwise close a path\n\n#define HORIZONTAL (-1.0E+40)\n#define TOLERANCE (1.0e-20)\n#define NEAR_ZERO(val) (((val) > -TOLERANCE) && ((val) < TOLERANCE))\n\nstruct TEdge {\n IntPoint Bot;\n IntPoint Curr;\n IntPoint Top;\n IntPoint Delta;\n double Dx = 0.0;\n PolyType PolyTyp = ptSubject;\n EdgeSide Side = esLeft;\n int WindDelta = 0; //1 or -1 depending on winding direction\n int WindCnt = 0;\n int WindCnt2 = 0; //winding count of the opposite polytype\n int OutIdx = 0;\n TEdge *Next = nullptr;\n TEdge *Prev = nullptr;\n TEdge *NextInLML = nullptr;\n TEdge *NextInAEL = nullptr;\n TEdge *PrevInAEL = nullptr;\n TEdge *NextInSEL = nullptr;\n TEdge *PrevInSEL = nullptr;\n};\n\nstruct IntersectNode {\n TEdge *Edge1;\n TEdge *Edge2;\n IntPoint Pt;\n};\n\nstruct LocalMinimum {\n cInt Y;\n TEdge *LeftBound;\n TEdge *RightBound;\n};\n\nstruct OutPt;\n\nstruct OutRec {\n int Idx;\n bool IsHole;\n bool IsOpen;\n OutRec *FirstLeft; //see comments in clipper.pas\n PolyNode *PolyNd;\n OutPt *Pts;\n OutPt *BottomPt;\n};\n\nstruct OutPt {\n int Idx;\n IntPoint Pt;\n OutPt *Next;\n OutPt *Prev;\n};\n\nstruct Join {\n OutPt *OutPt1;\n OutPt *OutPt2;\n IntPoint OffPt;\n};\n\nstruct LocMinSorter\n{\n inline bool operator()(const LocalMinimum& locMin1, const LocalMinimum& locMin2)\n {\n return locMin2.Y < locMin1.Y;\n }\n};\n\n//------------------------------------------------------------------------------\n//------------------------------------------------------------------------------\n\ninline cInt Round(double val)\n{\n if ((val < 0)) return static_cast(val - 0.5); \n else return static_cast(val + 0.5);\n}\n//------------------------------------------------------------------------------\n\ninline cInt Abs(cInt val)\n{\n return val < 0 ? -val : val;\n}\n\n//------------------------------------------------------------------------------\n// PolyTree methods ...\n//------------------------------------------------------------------------------\n\nvoid PolyTree::Clear()\n{\n for (PolyNodes::size_type i = 0; i < AllNodes.size(); ++i)\n delete AllNodes[i];\n AllNodes.resize(0); \n Childs.resize(0);\n}\n//------------------------------------------------------------------------------\n\nPolyNode* PolyTree::GetFirst() const\n{\n if (!Childs.empty())\n return Childs[0];\n else\n return 0;\n}\n//------------------------------------------------------------------------------\n\nint PolyTree::Total() const\n{\n int result = (int)AllNodes.size();\n //with negative offsets, ignore the hidden outer polygon ...\n if (result > 0 && Childs[0] != AllNodes[0]) result--;\n return result;\n}\n\n//------------------------------------------------------------------------------\n// PolyNode methods ...\n//------------------------------------------------------------------------------\n\nPolyNode::PolyNode(): Childs(), Parent(0), Index(0), m_IsOpen(false)\n{\n}\n//------------------------------------------------------------------------------\n\nint PolyNode::ChildCount() const\n{\n return (int)Childs.size();\n}\n//------------------------------------------------------------------------------\n\nvoid PolyNode::AddChild(PolyNode& child)\n{\n unsigned cnt = (unsigned)Childs.size();\n Childs.push_back(&child);\n child.Parent = this;\n child.Index = cnt;\n}\n//------------------------------------------------------------------------------\n\nPolyNode* PolyNode::GetNext() const\n{ \n if (!Childs.empty()) \n return Childs[0]; \n else\n return GetNextSiblingUp(); \n} \n//------------------------------------------------------------------------------\n\nPolyNode* PolyNode::GetNextSiblingUp() const\n{ \n if (!Parent) //protects against PolyTree.GetNextSiblingUp()\n return 0;\n else if (Index == Parent->Childs.size() - 1)\n return Parent->GetNextSiblingUp();\n else\n return Parent->Childs[Index + 1];\n} \n//------------------------------------------------------------------------------\n\nbool PolyNode::IsHole() const\n{ \n bool result = true;\n PolyNode* node = Parent;\n while (node)\n {\n result = !result;\n node = node->Parent;\n }\n return result;\n} \n//------------------------------------------------------------------------------\n\nbool PolyNode::IsOpen() const\n{ \n return m_IsOpen;\n} \n//------------------------------------------------------------------------------\n\n#ifndef use_int32\n\n//------------------------------------------------------------------------------\n// Int128 class (enables safe math on signed 64bit integers)\n// eg Int128 val1((long64)9223372036854775807); //ie 2^63 -1\n// Int128 val2((long64)9223372036854775807);\n// Int128 val3 = val1 * val2;\n// val3.AsString => \"85070591730234615847396907784232501249\" (8.5e+37)\n//------------------------------------------------------------------------------\n\nclass Int128\n{\n public:\n ulong64 lo;\n long64 hi;\n\n Int128(long64 _lo = 0)\n {\n lo = (ulong64)_lo; \n if (_lo < 0) hi = -1; else hi = 0; \n }\n\n\n Int128(const Int128 &val): lo(val.lo), hi(val.hi){}\n\n Int128(const long64& _hi, const ulong64& _lo): lo(_lo), hi(_hi){}\n \n Int128& operator = (const long64 &val)\n {\n lo = (ulong64)val;\n if (val < 0) hi = -1; else hi = 0;\n return *this;\n }\n\n bool operator == (const Int128 &val) const\n {return (hi == val.hi && lo == val.lo);}\n\n bool operator != (const Int128 &val) const\n { return !(*this == val);}\n\n bool operator > (const Int128 &val) const\n {\n if (hi != val.hi)\n return hi > val.hi;\n else\n return lo > val.lo;\n }\n\n bool operator < (const Int128 &val) const\n {\n if (hi != val.hi)\n return hi < val.hi;\n else\n return lo < val.lo;\n }\n\n bool operator >= (const Int128 &val) const\n { return !(*this < val);}\n\n bool operator <= (const Int128 &val) const\n { return !(*this > val);}\n\n Int128& operator += (const Int128 &rhs)\n {\n hi += rhs.hi;\n lo += rhs.lo;\n if (lo < rhs.lo) hi++;\n return *this;\n }\n\n Int128 operator + (const Int128 &rhs) const\n {\n Int128 result(*this);\n result+= rhs;\n return result;\n }\n\n Int128& operator -= (const Int128 &rhs)\n {\n *this += -rhs;\n return *this;\n }\n\n Int128 operator - (const Int128 &rhs) const\n {\n Int128 result(*this);\n result -= rhs;\n return result;\n }\n\n Int128 operator-() const //unary negation\n {\n if (lo == 0)\n return Int128(-hi, 0);\n else\n return Int128(~hi, ~lo + 1);\n }\n\n operator double() const\n {\n const double shift64 = 18446744073709551616.0; //2^64\n if (hi < 0)\n {\n if (lo == 0) return (double)hi * shift64;\n else return -(double)(~lo + ~hi * shift64);\n }\n else\n return (double)(lo + hi * shift64);\n }\n\n};\n//------------------------------------------------------------------------------\n\nInt128 Int128Mul (long64 lhs, long64 rhs)\n{\n bool negate = (lhs < 0) != (rhs < 0);\n\n if (lhs < 0) lhs = -lhs;\n ulong64 int1Hi = ulong64(lhs) >> 32;\n ulong64 int1Lo = ulong64(lhs & 0xFFFFFFFF);\n\n if (rhs < 0) rhs = -rhs;\n ulong64 int2Hi = ulong64(rhs) >> 32;\n ulong64 int2Lo = ulong64(rhs & 0xFFFFFFFF);\n\n //nb: see comments in clipper.pas\n ulong64 a = int1Hi * int2Hi;\n ulong64 b = int1Lo * int2Lo;\n ulong64 c = int1Hi * int2Lo + int1Lo * int2Hi;\n\n Int128 tmp;\n tmp.hi = long64(a + (c >> 32));\n tmp.lo = long64(c << 32);\n tmp.lo += long64(b);\n if (tmp.lo < b) tmp.hi++;\n if (negate) tmp = -tmp;\n return tmp;\n};\n#endif\n\n//------------------------------------------------------------------------------\n// Miscellaneous global functions\n//------------------------------------------------------------------------------\n\nbool Orientation(const Path &poly)\n{\n return Area(poly) >= 0;\n}\n//------------------------------------------------------------------------------\n\ndouble Area(const Path &poly)\n{\n int size = (int)poly.size();\n if (size < 3) return 0;\n\n double a = 0;\n for (int i = 0, j = size -1; i < size; ++i)\n {\n a += ((double)poly[j].X + poly[i].X) * ((double)poly[j].Y - poly[i].Y);\n j = i;\n }\n return -a * 0.5;\n}\n//------------------------------------------------------------------------------\n\ndouble Area(const OutRec &outRec)\n{\n OutPt *op = outRec.Pts;\n if (!op) return 0;\n double a = 0;\n do {\n a += (double)(op->Prev->Pt.X + op->Pt.X) * (double)(op->Prev->Pt.Y - op->Pt.Y);\n op = op->Next;\n } while (op != outRec.Pts);\n return a * 0.5;\n}\n//------------------------------------------------------------------------------\n\nbool PointIsVertex(const IntPoint &Pt, OutPt *pp)\n{\n OutPt *pp2 = pp;\n do\n {\n if (pp2->Pt == Pt) return true;\n pp2 = pp2->Next;\n }\n while (pp2 != pp);\n return false;\n}\n//------------------------------------------------------------------------------\n\nint PointInPolygon (const IntPoint &pt, const Path &path)\n{\n //returns 0 if false, +1 if true, -1 if pt ON polygon boundary\n //See \"The Point in Polygon Problem for Arbitrary Polygons\" by Hormann & Agathos\n //http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.5498&rep=rep1&type=pdf\n int result = 0;\n size_t cnt = path.size();\n if (cnt < 3) return 0;\n IntPoint ip = path[0];\n for(size_t i = 1; i <= cnt; ++i)\n {\n IntPoint ipNext = (i == cnt ? path[0] : path[i]);\n if (ipNext.Y == pt.Y)\n {\n if ((ipNext.X == pt.X) || (ip.Y == pt.Y && \n ((ipNext.X > pt.X) == (ip.X < pt.X)))) return -1;\n }\n if ((ip.Y < pt.Y) != (ipNext.Y < pt.Y))\n {\n if (ip.X >= pt.X)\n {\n if (ipNext.X > pt.X) result = 1 - result;\n else\n {\n double d = (double)(ip.X - pt.X) * (ipNext.Y - pt.Y) - \n (double)(ipNext.X - pt.X) * (ip.Y - pt.Y);\n if (!d) return -1;\n if ((d > 0) == (ipNext.Y > ip.Y)) result = 1 - result;\n }\n } else\n {\n if (ipNext.X > pt.X)\n {\n double d = (double)(ip.X - pt.X) * (ipNext.Y - pt.Y) - \n (double)(ipNext.X - pt.X) * (ip.Y - pt.Y);\n if (!d) return -1;\n if ((d > 0) == (ipNext.Y > ip.Y)) result = 1 - result;\n }\n }\n }\n ip = ipNext;\n } \n return result;\n}\n//------------------------------------------------------------------------------\n\nint PointInPolygon (const IntPoint &pt, OutPt *op)\n{\n //returns 0 if false, +1 if true, -1 if pt ON polygon boundary\n int result = 0;\n OutPt* startOp = op;\n for(;;)\n {\n if (op->Next->Pt.Y == pt.Y)\n {\n if ((op->Next->Pt.X == pt.X) || (op->Pt.Y == pt.Y && \n ((op->Next->Pt.X > pt.X) == (op->Pt.X < pt.X)))) return -1;\n }\n if ((op->Pt.Y < pt.Y) != (op->Next->Pt.Y < pt.Y))\n {\n if (op->Pt.X >= pt.X)\n {\n if (op->Next->Pt.X > pt.X) result = 1 - result;\n else\n {\n double d = (double)(op->Pt.X - pt.X) * (op->Next->Pt.Y - pt.Y) - \n (double)(op->Next->Pt.X - pt.X) * (op->Pt.Y - pt.Y);\n if (!d) return -1;\n if ((d > 0) == (op->Next->Pt.Y > op->Pt.Y)) result = 1 - result;\n }\n } else\n {\n if (op->Next->Pt.X > pt.X)\n {\n double d = (double)(op->Pt.X - pt.X) * (op->Next->Pt.Y - pt.Y) - \n (double)(op->Next->Pt.X - pt.X) * (op->Pt.Y - pt.Y);\n if (!d) return -1;\n if ((d > 0) == (op->Next->Pt.Y > op->Pt.Y)) result = 1 - result;\n }\n }\n } \n op = op->Next;\n if (startOp == op) break;\n } \n return result;\n}\n//------------------------------------------------------------------------------\n\nbool Poly2ContainsPoly1(OutPt *OutPt1, OutPt *OutPt2)\n{\n OutPt* op = OutPt1;\n do\n {\n //nb: PointInPolygon returns 0 if false, +1 if true, -1 if pt on polygon\n int res = PointInPolygon(op->Pt, OutPt2);\n if (res >= 0) return res > 0;\n op = op->Next; \n }\n while (op != OutPt1);\n return true; \n}\n//----------------------------------------------------------------------\n\nbool SlopesEqual(const TEdge &e1, const TEdge &e2, bool UseFullInt64Range)\n{\n#ifndef use_int32\n if (UseFullInt64Range)\n return Int128Mul(e1.Delta.Y, e2.Delta.X) == Int128Mul(e1.Delta.X, e2.Delta.Y);\n else \n#endif\n return e1.Delta.Y * e2.Delta.X == e1.Delta.X * e2.Delta.Y;\n}\n//------------------------------------------------------------------------------\n\nbool SlopesEqual(const IntPoint pt1, const IntPoint pt2,\n const IntPoint pt3, bool UseFullInt64Range)\n{\n#ifndef use_int32\n if (UseFullInt64Range)\n return Int128Mul(pt1.Y-pt2.Y, pt2.X-pt3.X) == Int128Mul(pt1.X-pt2.X, pt2.Y-pt3.Y);\n else \n#endif\n return (pt1.Y-pt2.Y)*(pt2.X-pt3.X) == (pt1.X-pt2.X)*(pt2.Y-pt3.Y);\n}\n//------------------------------------------------------------------------------\n\nbool SlopesEqual(const IntPoint pt1, const IntPoint pt2,\n const IntPoint pt3, const IntPoint pt4, bool UseFullInt64Range)\n{\n#ifndef use_int32\n if (UseFullInt64Range)\n return Int128Mul(pt1.Y-pt2.Y, pt3.X-pt4.X) == Int128Mul(pt1.X-pt2.X, pt3.Y-pt4.Y);\n else \n#endif\n return (pt1.Y-pt2.Y)*(pt3.X-pt4.X) == (pt1.X-pt2.X)*(pt3.Y-pt4.Y);\n}\n//------------------------------------------------------------------------------\n\ninline bool IsHorizontal(TEdge &e)\n{\n return e.Delta.Y == 0;\n}\n//------------------------------------------------------------------------------\n\ninline double GetDx(const IntPoint pt1, const IntPoint pt2)\n{\n return (pt1.Y == pt2.Y) ?\n HORIZONTAL : (double)(pt2.X - pt1.X) / (pt2.Y - pt1.Y);\n}\n//---------------------------------------------------------------------------\n\ninline void SetDx(TEdge &e)\n{\n e.Delta.X = (e.Top.X - e.Bot.X);\n e.Delta.Y = (e.Top.Y - e.Bot.Y);\n\n if (e.Delta.Y == 0) e.Dx = HORIZONTAL;\n else e.Dx = (double)(e.Delta.X) / e.Delta.Y;\n}\n//---------------------------------------------------------------------------\n\ninline void SwapSides(TEdge &Edge1, TEdge &Edge2)\n{\n EdgeSide Side = Edge1.Side;\n Edge1.Side = Edge2.Side;\n Edge2.Side = Side;\n}\n//------------------------------------------------------------------------------\n\ninline void SwapPolyIndexes(TEdge &Edge1, TEdge &Edge2)\n{\n int OutIdx = Edge1.OutIdx;\n Edge1.OutIdx = Edge2.OutIdx;\n Edge2.OutIdx = OutIdx;\n}\n//------------------------------------------------------------------------------\n\ninline cInt TopX(TEdge &edge, const cInt currentY)\n{\n return ( currentY == edge.Top.Y ) ?\n edge.Top.X : edge.Bot.X + Round(edge.Dx *(currentY - edge.Bot.Y));\n}\n//------------------------------------------------------------------------------\n\nvoid IntersectPoint(TEdge &Edge1, TEdge &Edge2, IntPoint &ip)\n{\n#ifdef use_xyz \n ip.Z = 0;\n#endif\n\n double b1, b2;\n if (Edge1.Dx == Edge2.Dx)\n {\n ip.Y = Edge1.Curr.Y;\n ip.X = TopX(Edge1, ip.Y);\n return;\n }\n else if (Edge1.Delta.X == 0)\n {\n ip.X = Edge1.Bot.X;\n if (IsHorizontal(Edge2))\n ip.Y = Edge2.Bot.Y;\n else\n {\n b2 = Edge2.Bot.Y - (Edge2.Bot.X / Edge2.Dx);\n ip.Y = Round(ip.X / Edge2.Dx + b2);\n }\n }\n else if (Edge2.Delta.X == 0)\n {\n ip.X = Edge2.Bot.X;\n if (IsHorizontal(Edge1))\n ip.Y = Edge1.Bot.Y;\n else\n {\n b1 = Edge1.Bot.Y - (Edge1.Bot.X / Edge1.Dx);\n ip.Y = Round(ip.X / Edge1.Dx + b1);\n }\n } \n else \n {\n b1 = Edge1.Bot.X - Edge1.Bot.Y * Edge1.Dx;\n b2 = Edge2.Bot.X - Edge2.Bot.Y * Edge2.Dx;\n double q = (b2-b1) / (Edge1.Dx - Edge2.Dx);\n ip.Y = Round(q);\n if (std::fabs(Edge1.Dx) < std::fabs(Edge2.Dx))\n ip.X = Round(Edge1.Dx * q + b1);\n else \n ip.X = Round(Edge2.Dx * q + b2);\n }\n\n if (ip.Y < Edge1.Top.Y || ip.Y < Edge2.Top.Y) \n {\n if (Edge1.Top.Y > Edge2.Top.Y)\n ip.Y = Edge1.Top.Y;\n else\n ip.Y = Edge2.Top.Y;\n if (std::fabs(Edge1.Dx) < std::fabs(Edge2.Dx))\n ip.X = TopX(Edge1, ip.Y);\n else\n ip.X = TopX(Edge2, ip.Y);\n } \n //finally, don't allow 'ip' to be BELOW curr.Y (ie bottom of scanbeam) ...\n if (ip.Y > Edge1.Curr.Y)\n {\n ip.Y = Edge1.Curr.Y;\n //use the more vertical edge to derive X ...\n if (std::fabs(Edge1.Dx) > std::fabs(Edge2.Dx))\n ip.X = TopX(Edge2, ip.Y); else\n ip.X = TopX(Edge1, ip.Y);\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ReversePolyPtLinks(OutPt *pp)\n{\n if (!pp) return;\n OutPt *pp1, *pp2;\n pp1 = pp;\n do {\n pp2 = pp1->Next;\n pp1->Next = pp1->Prev;\n pp1->Prev = pp2;\n pp1 = pp2;\n } while( pp1 != pp );\n}\n//------------------------------------------------------------------------------\n\nvoid DisposeOutPts(OutPt*& pp)\n{\n if (pp == 0) return;\n pp->Prev->Next = 0;\n while( pp )\n {\n OutPt *tmpPp = pp;\n pp = pp->Next;\n delete tmpPp;\n }\n}\n//------------------------------------------------------------------------------\n\ninline void InitEdge(TEdge* e, TEdge* eNext, TEdge* ePrev, const IntPoint& Pt)\n{\n *e = TEdge();\n e->Next = eNext;\n e->Prev = ePrev;\n e->Curr = Pt;\n e->OutIdx = Unassigned;\n}\n//------------------------------------------------------------------------------\n\nvoid InitEdge2(TEdge& e, PolyType Pt)\n{\n if (e.Curr.Y >= e.Next->Curr.Y)\n {\n e.Bot = e.Curr;\n e.Top = e.Next->Curr;\n } else\n {\n e.Top = e.Curr;\n e.Bot = e.Next->Curr;\n }\n SetDx(e);\n e.PolyTyp = Pt;\n}\n//------------------------------------------------------------------------------\n\nTEdge* RemoveEdge(TEdge* e)\n{\n //removes e from double_linked_list (but without removing from memory)\n e->Prev->Next = e->Next;\n e->Next->Prev = e->Prev;\n TEdge* result = e->Next;\n e->Prev = 0; //flag as removed (see ClipperBase.Clear)\n return result;\n}\n//------------------------------------------------------------------------------\n\ninline void ReverseHorizontal(TEdge &e)\n{\n //swap horizontal edges' Top and Bottom x's so they follow the natural\n //progression of the bounds - ie so their xbots will align with the\n //adjoining lower edge. [Helpful in the ProcessHorizontal() method.]\n std::swap(e.Top.X, e.Bot.X);\n#ifdef use_xyz\n std::swap(e.Top.Z, e.Bot.Z);\n#endif\n}\n//------------------------------------------------------------------------------\n\nvoid SwapPoints(IntPoint &pt1, IntPoint &pt2)\n{\n IntPoint tmp = pt1;\n pt1 = pt2;\n pt2 = tmp;\n}\n//------------------------------------------------------------------------------\n\nbool GetOverlapSegment(IntPoint pt1a, IntPoint pt1b, IntPoint pt2a,\n IntPoint pt2b, IntPoint &pt1, IntPoint &pt2)\n{\n //precondition: segments are Collinear.\n if (Abs(pt1a.X - pt1b.X) > Abs(pt1a.Y - pt1b.Y))\n {\n if (pt1a.X > pt1b.X) SwapPoints(pt1a, pt1b);\n if (pt2a.X > pt2b.X) SwapPoints(pt2a, pt2b);\n if (pt1a.X > pt2a.X) pt1 = pt1a; else pt1 = pt2a;\n if (pt1b.X < pt2b.X) pt2 = pt1b; else pt2 = pt2b;\n return pt1.X < pt2.X;\n } else\n {\n if (pt1a.Y < pt1b.Y) SwapPoints(pt1a, pt1b);\n if (pt2a.Y < pt2b.Y) SwapPoints(pt2a, pt2b);\n if (pt1a.Y < pt2a.Y) pt1 = pt1a; else pt1 = pt2a;\n if (pt1b.Y > pt2b.Y) pt2 = pt1b; else pt2 = pt2b;\n return pt1.Y > pt2.Y;\n }\n}\n//------------------------------------------------------------------------------\n\nbool FirstIsBottomPt(const OutPt* btmPt1, const OutPt* btmPt2)\n{\n OutPt *p = btmPt1->Prev;\n while ((p->Pt == btmPt1->Pt) && (p != btmPt1)) p = p->Prev;\n double dx1p = std::fabs(GetDx(btmPt1->Pt, p->Pt));\n p = btmPt1->Next;\n while ((p->Pt == btmPt1->Pt) && (p != btmPt1)) p = p->Next;\n double dx1n = std::fabs(GetDx(btmPt1->Pt, p->Pt));\n\n p = btmPt2->Prev;\n while ((p->Pt == btmPt2->Pt) && (p != btmPt2)) p = p->Prev;\n double dx2p = std::fabs(GetDx(btmPt2->Pt, p->Pt));\n p = btmPt2->Next;\n while ((p->Pt == btmPt2->Pt) && (p != btmPt2)) p = p->Next;\n double dx2n = std::fabs(GetDx(btmPt2->Pt, p->Pt));\n return (dx1p >= dx2p && dx1p >= dx2n) || (dx1n >= dx2p && dx1n >= dx2n);\n}\n//------------------------------------------------------------------------------\n\nOutPt* GetBottomPt(OutPt *pp)\n{\n OutPt* dups = 0;\n OutPt* p = pp->Next;\n while (p != pp)\n {\n if (p->Pt.Y > pp->Pt.Y)\n {\n pp = p;\n dups = 0;\n }\n else if (p->Pt.Y == pp->Pt.Y && p->Pt.X <= pp->Pt.X)\n {\n if (p->Pt.X < pp->Pt.X)\n {\n dups = 0;\n pp = p;\n } else\n {\n if (p->Next != pp && p->Prev != pp) dups = p;\n }\n }\n p = p->Next;\n }\n if (dups)\n {\n //there appears to be at least 2 vertices at BottomPt so ...\n while (dups != p)\n {\n if (!FirstIsBottomPt(p, dups)) pp = dups;\n dups = dups->Next;\n while (dups->Pt != pp->Pt) dups = dups->Next;\n }\n }\n return pp;\n}\n//------------------------------------------------------------------------------\n\nbool Pt2IsBetweenPt1AndPt3(const IntPoint pt1,\n const IntPoint pt2, const IntPoint pt3)\n{\n if ((pt1 == pt3) || (pt1 == pt2) || (pt3 == pt2))\n return false;\n else if (pt1.X != pt3.X)\n return (pt2.X > pt1.X) == (pt2.X < pt3.X);\n else\n return (pt2.Y > pt1.Y) == (pt2.Y < pt3.Y);\n}\n//------------------------------------------------------------------------------\n\nbool HorzSegmentsOverlap(cInt seg1a, cInt seg1b, cInt seg2a, cInt seg2b)\n{\n if (seg1a > seg1b) std::swap(seg1a, seg1b);\n if (seg2a > seg2b) std::swap(seg2a, seg2b);\n return (seg1a < seg2b) && (seg2a < seg1b);\n}\n\n//------------------------------------------------------------------------------\n// ClipperBase class methods ...\n//------------------------------------------------------------------------------\n\nClipperBase::ClipperBase() //constructor\n{\n m_CurrentLM = m_MinimaList.begin(); //begin() == end() here\n m_UseFullRange = false;\n}\n//------------------------------------------------------------------------------\n\nClipperBase::~ClipperBase() //destructor\n{\n Clear();\n}\n//------------------------------------------------------------------------------\n\nvoid RangeTest(const IntPoint& Pt, bool& useFullRange)\n{\n if (useFullRange)\n {\n if (Pt.X > hiRange || Pt.Y > hiRange || -Pt.X > hiRange || -Pt.Y > hiRange) \n throw \"Coordinate outside allowed range\";\n }\n else if (Pt.X > loRange|| Pt.Y > loRange || -Pt.X > loRange || -Pt.Y > loRange) \n {\n useFullRange = true;\n RangeTest(Pt, useFullRange);\n }\n}\n//------------------------------------------------------------------------------\n\nTEdge* FindNextLocMin(TEdge* E)\n{\n for (;;)\n {\n while (E->Bot != E->Prev->Bot || E->Curr == E->Top) E = E->Next;\n if (!IsHorizontal(*E) && !IsHorizontal(*E->Prev)) break;\n while (IsHorizontal(*E->Prev)) E = E->Prev;\n TEdge* E2 = E;\n while (IsHorizontal(*E)) E = E->Next;\n if (E->Top.Y == E->Prev->Bot.Y) continue; //ie just an intermediate horz.\n if (E2->Prev->Bot.X < E->Bot.X) E = E2;\n break;\n }\n return E;\n}\n//------------------------------------------------------------------------------\n\nTEdge* ClipperBase::ProcessBound(TEdge* E, bool NextIsForward)\n{\n TEdge *Result = E;\n TEdge *Horz = 0;\n\n if (E->OutIdx == Skip)\n {\n //if edges still remain in the current bound beyond the skip edge then\n //create another LocMin and call ProcessBound once more\n if (NextIsForward)\n {\n while (E->Top.Y == E->Next->Bot.Y) E = E->Next;\n //don't include top horizontals when parsing a bound a second time,\n //they will be contained in the opposite bound ...\n while (E != Result && IsHorizontal(*E)) E = E->Prev;\n }\n else\n {\n while (E->Top.Y == E->Prev->Bot.Y) E = E->Prev;\n while (E != Result && IsHorizontal(*E)) E = E->Next;\n }\n\n if (E == Result)\n {\n if (NextIsForward) Result = E->Next;\n else Result = E->Prev;\n }\n else\n {\n //there are more edges in the bound beyond result starting with E\n if (NextIsForward)\n E = Result->Next;\n else\n E = Result->Prev;\n MinimaList::value_type locMin;\n locMin.Y = E->Bot.Y;\n locMin.LeftBound = 0;\n locMin.RightBound = E;\n E->WindDelta = 0;\n Result = ProcessBound(E, NextIsForward);\n m_MinimaList.push_back(locMin);\n }\n return Result;\n }\n\n TEdge *EStart;\n\n if (IsHorizontal(*E))\n {\n //We need to be careful with open paths because this may not be a\n //true local minima (ie E may be following a skip edge).\n //Also, consecutive horz. edges may start heading left before going right.\n if (NextIsForward) \n EStart = E->Prev;\n else \n EStart = E->Next;\n if (EStart->OutIdx != Skip)\n {\n if (IsHorizontal(*EStart)) //ie an adjoining horizontal skip edge\n {\n if (EStart->Bot.X != E->Bot.X && EStart->Top.X != E->Bot.X)\n ReverseHorizontal(*E);\n }\n else if (EStart->Bot.X != E->Bot.X)\n ReverseHorizontal(*E);\n }\n }\n \n EStart = E;\n if (NextIsForward)\n {\n while (Result->Top.Y == Result->Next->Bot.Y && Result->Next->OutIdx != Skip)\n Result = Result->Next;\n if (IsHorizontal(*Result) && Result->Next->OutIdx != Skip)\n {\n //nb: at the top of a bound, horizontals are added to the bound\n //only when the preceding edge attaches to the horizontal's left vertex\n //unless a Skip edge is encountered when that becomes the top divide\n Horz = Result;\n while (IsHorizontal(*Horz->Prev)) Horz = Horz->Prev;\n if (Horz->Prev->Top.X == Result->Next->Top.X) \n {\n if (!NextIsForward) Result = Horz->Prev;\n }\n else if (Horz->Prev->Top.X > Result->Next->Top.X) Result = Horz->Prev;\n }\n while (E != Result) \n {\n E->NextInLML = E->Next;\n if (IsHorizontal(*E) && E != EStart &&\n E->Bot.X != E->Prev->Top.X) ReverseHorizontal(*E);\n E = E->Next;\n }\n if (IsHorizontal(*E) && E != EStart && E->Bot.X != E->Prev->Top.X) \n ReverseHorizontal(*E);\n Result = Result->Next; //move to the edge just beyond current bound\n } else\n {\n while (Result->Top.Y == Result->Prev->Bot.Y && Result->Prev->OutIdx != Skip) \n Result = Result->Prev;\n if (IsHorizontal(*Result) && Result->Prev->OutIdx != Skip)\n {\n Horz = Result;\n while (IsHorizontal(*Horz->Next)) Horz = Horz->Next;\n if (Horz->Next->Top.X == Result->Prev->Top.X) \n {\n if (!NextIsForward) Result = Horz->Next;\n }\n else if (Horz->Next->Top.X > Result->Prev->Top.X) Result = Horz->Next;\n }\n\n while (E != Result)\n {\n E->NextInLML = E->Prev;\n if (IsHorizontal(*E) && E != EStart && E->Bot.X != E->Next->Top.X) \n ReverseHorizontal(*E);\n E = E->Prev;\n }\n if (IsHorizontal(*E) && E != EStart && E->Bot.X != E->Next->Top.X) \n ReverseHorizontal(*E);\n Result = Result->Prev; //move to the edge just beyond current bound\n }\n\n return Result;\n}\n//------------------------------------------------------------------------------\n\nbool ClipperBase::AddPath(const Path &pg, PolyType PolyTyp, bool Closed)\n{\n#ifdef use_lines\n if (!Closed && PolyTyp == ptClip)\n throw clipperException(\"AddPath: Open paths must be subject.\");\n#else\n if (!Closed)\n throw clipperException(\"AddPath: Open paths have been disabled.\");\n#endif\n\n int highI = (int)pg.size() -1;\n if (Closed) while (highI > 0 && (pg[highI] == pg[0])) --highI;\n while (highI > 0 && (pg[highI] == pg[highI -1])) --highI;\n if ((Closed && highI < 2) || (!Closed && highI < 1)) return false;\n\n //create a new edge array ...\n TEdge *edges = new TEdge [highI +1];\n\n bool IsFlat = true;\n //1. Basic (first) edge initialization ...\n try\n {\n edges[1].Curr = pg[1];\n RangeTest(pg[0], m_UseFullRange);\n RangeTest(pg[highI], m_UseFullRange);\n InitEdge(&edges[0], &edges[1], &edges[highI], pg[0]);\n InitEdge(&edges[highI], &edges[0], &edges[highI-1], pg[highI]);\n for (int i = highI - 1; i >= 1; --i)\n {\n RangeTest(pg[i], m_UseFullRange);\n InitEdge(&edges[i], &edges[i+1], &edges[i-1], pg[i]);\n }\n }\n catch(...)\n {\n delete [] edges;\n throw; //range test fails\n }\n TEdge *eStart = &edges[0];\n\n //2. Remove duplicate vertices, and (when closed) collinear edges ...\n TEdge *E = eStart, *eLoopStop = eStart;\n for (;;)\n {\n //nb: allows matching start and end points when not Closed ...\n if (E->Curr == E->Next->Curr && (Closed || E->Next != eStart))\n {\n if (E == E->Next) break;\n if (E == eStart) eStart = E->Next;\n E = RemoveEdge(E);\n eLoopStop = E;\n continue;\n }\n if (E->Prev == E->Next) \n break; //only two vertices\n else if (Closed &&\n SlopesEqual(E->Prev->Curr, E->Curr, E->Next->Curr, m_UseFullRange) && \n (!m_PreserveCollinear ||\n !Pt2IsBetweenPt1AndPt3(E->Prev->Curr, E->Curr, E->Next->Curr)))\n {\n //Collinear edges are allowed for open paths but in closed paths\n //the default is to merge adjacent collinear edges into a single edge.\n //However, if the PreserveCollinear property is enabled, only overlapping\n //collinear edges (ie spikes) will be removed from closed paths.\n if (E == eStart) eStart = E->Next;\n E = RemoveEdge(E);\n E = E->Prev;\n eLoopStop = E;\n continue;\n }\n E = E->Next;\n if ((E == eLoopStop) || (!Closed && E->Next == eStart)) break;\n }\n\n if ((!Closed && (E == E->Next)) || (Closed && (E->Prev == E->Next)))\n {\n delete [] edges;\n return false;\n }\n\n if (!Closed)\n { \n m_HasOpenPaths = true;\n eStart->Prev->OutIdx = Skip;\n }\n\n //3. Do second stage of edge initialization ...\n E = eStart;\n do\n {\n InitEdge2(*E, PolyTyp);\n E = E->Next;\n if (IsFlat && E->Curr.Y != eStart->Curr.Y) IsFlat = false;\n }\n while (E != eStart);\n\n //4. Finally, add edge bounds to LocalMinima list ...\n\n //Totally flat paths must be handled differently when adding them\n //to LocalMinima list to avoid endless loops etc ...\n if (IsFlat) \n {\n if (Closed) \n {\n delete [] edges;\n return false;\n }\n E->Prev->OutIdx = Skip;\n if (E->Prev->Bot.X < E->Prev->Top.X) ReverseHorizontal(*E->Prev);\n MinimaList::value_type locMin;\n locMin.Y = E->Bot.Y;\n locMin.LeftBound = 0;\n locMin.RightBound = E;\n locMin.RightBound->Side = esRight;\n locMin.RightBound->WindDelta = 0;\n while (E->Next->OutIdx != Skip)\n {\n E->NextInLML = E->Next;\n if (E->Bot.X != E->Prev->Top.X) ReverseHorizontal(*E);\n E = E->Next;\n }\n m_MinimaList.push_back(locMin);\n m_edges.push_back(edges);\n\t return true;\n }\n\n m_edges.push_back(edges);\n bool leftBoundIsForward;\n TEdge* EMin = 0;\n\n //workaround to avoid an endless loop in the while loop below when\n //open paths have matching start and end points ...\n if (E->Prev->Bot == E->Prev->Top) E = E->Next;\n\n for (;;)\n {\n E = FindNextLocMin(E);\n if (E == EMin) break;\n else if (!EMin) EMin = E;\n\n //E and E.Prev now share a local minima (left aligned if horizontal).\n //Compare their slopes to find which starts which bound ...\n MinimaList::value_type locMin;\n locMin.Y = E->Bot.Y;\n if (E->Dx < E->Prev->Dx) \n {\n locMin.LeftBound = E->Prev;\n locMin.RightBound = E;\n leftBoundIsForward = false; //Q.nextInLML = Q.prev\n } else\n {\n locMin.LeftBound = E;\n locMin.RightBound = E->Prev;\n leftBoundIsForward = true; //Q.nextInLML = Q.next\n }\n locMin.LeftBound->Side = esLeft;\n locMin.RightBound->Side = esRight;\n\n if (!Closed) locMin.LeftBound->WindDelta = 0;\n else if (locMin.LeftBound->Next == locMin.RightBound)\n locMin.LeftBound->WindDelta = -1;\n else locMin.LeftBound->WindDelta = 1;\n locMin.RightBound->WindDelta = -locMin.LeftBound->WindDelta;\n\n E = ProcessBound(locMin.LeftBound, leftBoundIsForward);\n if (E->OutIdx == Skip) E = ProcessBound(E, leftBoundIsForward);\n\n TEdge* E2 = ProcessBound(locMin.RightBound, !leftBoundIsForward);\n if (E2->OutIdx == Skip) E2 = ProcessBound(E2, !leftBoundIsForward);\n\n if (locMin.LeftBound->OutIdx == Skip)\n locMin.LeftBound = 0;\n else if (locMin.RightBound->OutIdx == Skip)\n locMin.RightBound = 0;\n m_MinimaList.push_back(locMin);\n if (!leftBoundIsForward) E = E2;\n }\n return true;\n}\n//------------------------------------------------------------------------------\n\nbool ClipperBase::AddPaths(const Paths &ppg, PolyType PolyTyp, bool Closed)\n{\n bool result = false;\n for (Paths::size_type i = 0; i < ppg.size(); ++i)\n if (AddPath(ppg[i], PolyTyp, Closed)) result = true;\n return result;\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperBase::Clear()\n{\n DisposeLocalMinimaList();\n for (EdgeList::size_type i = 0; i < m_edges.size(); ++i)\n {\n //for each edge array in turn, find the first used edge and \n //check for and remove any hiddenPts in each edge in the array.\n TEdge* edges = m_edges[i];\n delete [] edges;\n }\n m_edges.clear();\n m_UseFullRange = false;\n m_HasOpenPaths = false;\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperBase::Reset()\n{\n m_CurrentLM = m_MinimaList.begin();\n if (m_CurrentLM == m_MinimaList.end()) return; //ie nothing to process\n std::sort(m_MinimaList.begin(), m_MinimaList.end(), LocMinSorter());\n\n //reset all edges ...\n for (MinimaList::iterator lm = m_MinimaList.begin(); lm != m_MinimaList.end(); ++lm)\n {\n TEdge* e = lm->LeftBound;\n if (e)\n {\n e->Curr = e->Bot;\n e->Side = esLeft;\n e->OutIdx = Unassigned;\n }\n\n e = lm->RightBound;\n if (e)\n {\n e->Curr = e->Bot;\n e->Side = esRight;\n e->OutIdx = Unassigned;\n }\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperBase::DisposeLocalMinimaList()\n{\n m_MinimaList.clear();\n m_CurrentLM = m_MinimaList.begin();\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperBase::PopLocalMinima()\n{\n if (m_CurrentLM == m_MinimaList.end()) return;\n ++m_CurrentLM;\n}\n//------------------------------------------------------------------------------\n\nIntRect ClipperBase::GetBounds()\n{\n IntRect result;\n MinimaList::iterator lm = m_MinimaList.begin();\n if (lm == m_MinimaList.end())\n {\n result.left = result.top = result.right = result.bottom = 0;\n return result;\n }\n result.left = lm->LeftBound->Bot.X;\n result.top = lm->LeftBound->Bot.Y;\n result.right = lm->LeftBound->Bot.X;\n result.bottom = lm->LeftBound->Bot.Y;\n while (lm != m_MinimaList.end())\n {\n result.bottom = std::max(result.bottom, lm->LeftBound->Bot.Y);\n TEdge* e = lm->LeftBound;\n for (;;) {\n TEdge* bottomE = e;\n while (e->NextInLML)\n {\n if (e->Bot.X < result.left) result.left = e->Bot.X;\n if (e->Bot.X > result.right) result.right = e->Bot.X;\n e = e->NextInLML;\n }\n result.left = std::min(result.left, e->Bot.X);\n result.right = std::max(result.right, e->Bot.X);\n result.left = std::min(result.left, e->Top.X);\n result.right = std::max(result.right, e->Top.X);\n result.top = std::min(result.top, e->Top.Y);\n if (bottomE == lm->LeftBound) e = lm->RightBound;\n else break;\n }\n ++lm;\n }\n return result;\n}\n\n//------------------------------------------------------------------------------\n// TClipper methods ...\n//------------------------------------------------------------------------------\n\nClipper::Clipper(int initOptions) : ClipperBase() //constructor\n{\n m_ActiveEdges = 0;\n m_SortedEdges = 0;\n m_ExecuteLocked = false;\n m_UseFullRange = false;\n m_ReverseOutput = ((initOptions & ioReverseSolution) != 0);\n m_StrictSimple = ((initOptions & ioStrictlySimple) != 0);\n m_PreserveCollinear = ((initOptions & ioPreserveCollinear) != 0);\n m_HasOpenPaths = false;\n#ifdef use_xyz \n m_ZFill = 0;\n#endif\n}\n//------------------------------------------------------------------------------\n\nClipper::~Clipper() //destructor\n{\n Clear();\n}\n//------------------------------------------------------------------------------\n\n#ifdef use_xyz \nvoid Clipper::ZFillFunction(ZFillCallback zFillFunc)\n{ \n m_ZFill = zFillFunc;\n}\n//------------------------------------------------------------------------------\n#endif\n\nvoid Clipper::Reset()\n{\n ClipperBase::Reset();\n m_Scanbeam = ScanbeamList();\n m_ActiveEdges = 0;\n m_SortedEdges = 0;\n for (MinimaList::iterator lm = m_MinimaList.begin(); lm != m_MinimaList.end(); ++lm)\n InsertScanbeam(lm->Y);\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::Execute(ClipType clipType, Paths &solution,\n PolyFillType subjFillType, PolyFillType clipFillType)\n{\n if( m_ExecuteLocked ) return false;\n if (m_HasOpenPaths)\n throw clipperException(\"Error: PolyTree struct is need for open path clipping.\");\n m_ExecuteLocked = true;\n solution.resize(0);\n m_SubjFillType = subjFillType;\n m_ClipFillType = clipFillType;\n m_ClipType = clipType;\n m_UsingPolyTree = false;\n bool succeeded = ExecuteInternal();\n if (succeeded) BuildResult(solution);\n DisposeAllOutRecs();\n m_ExecuteLocked = false;\n return succeeded;\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::Execute(ClipType clipType, PolyTree& polytree,\n PolyFillType subjFillType, PolyFillType clipFillType)\n{\n if( m_ExecuteLocked ) return false;\n m_ExecuteLocked = true;\n m_SubjFillType = subjFillType;\n m_ClipFillType = clipFillType;\n m_ClipType = clipType;\n m_UsingPolyTree = true;\n bool succeeded = ExecuteInternal();\n if (succeeded) BuildResult2(polytree);\n DisposeAllOutRecs();\n m_ExecuteLocked = false;\n return succeeded;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::FixHoleLinkage(OutRec &outrec)\n{\n //skip OutRecs that (a) contain outermost polygons or\n //(b) already have the correct owner/child linkage ...\n if (!outrec.FirstLeft || \n (outrec.IsHole != outrec.FirstLeft->IsHole &&\n outrec.FirstLeft->Pts)) return;\n\n OutRec* orfl = outrec.FirstLeft;\n while (orfl && ((orfl->IsHole == outrec.IsHole) || !orfl->Pts))\n orfl = orfl->FirstLeft;\n outrec.FirstLeft = orfl;\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::ExecuteInternal()\n{\n bool succeeded = true;\n try {\n Reset();\n if (m_CurrentLM == m_MinimaList.end()) return true;\n cInt botY = PopScanbeam();\n do {\n InsertLocalMinimaIntoAEL(botY);\n ClearGhostJoins();\n ProcessHorizontals(false);\n if (m_Scanbeam.empty()) break;\n cInt topY = PopScanbeam();\n succeeded = ProcessIntersections(topY);\n if (!succeeded) break;\n ProcessEdgesAtTopOfScanbeam(topY);\n botY = topY;\n } while (!m_Scanbeam.empty() || m_CurrentLM != m_MinimaList.end());\n }\n catch(...) \n {\n succeeded = false;\n }\n\n if (succeeded)\n {\n //fix orientations ...\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)\n {\n OutRec *outRec = m_PolyOuts[i];\n if (!outRec->Pts || outRec->IsOpen) continue;\n if ((outRec->IsHole ^ m_ReverseOutput) == (Area(*outRec) > 0))\n ReversePolyPtLinks(outRec->Pts);\n }\n\n if (!m_Joins.empty()) JoinCommonEdges();\n\n //unfortunately FixupOutPolygon() must be done after JoinCommonEdges()\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)\n {\n OutRec *outRec = m_PolyOuts[i];\n if (outRec->Pts && !outRec->IsOpen)\n FixupOutPolygon(*outRec);\n }\n\n if (m_StrictSimple) DoSimplePolygons();\n }\n\n ClearJoins();\n ClearGhostJoins();\n return succeeded;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::InsertScanbeam(const cInt Y)\n{\n //if (!m_Scanbeam.empty() && Y == m_Scanbeam.top()) return;// avoid duplicates.\n m_Scanbeam.push(Y);\n}\n//------------------------------------------------------------------------------\n\ncInt Clipper::PopScanbeam()\n{\n const cInt Y = m_Scanbeam.top();\n m_Scanbeam.pop();\n while (!m_Scanbeam.empty() && Y == m_Scanbeam.top()) { m_Scanbeam.pop(); } // Pop duplicates.\n return Y;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::DisposeAllOutRecs(){\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)\n DisposeOutRec(i);\n m_PolyOuts.clear();\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::DisposeOutRec(PolyOutList::size_type index)\n{\n OutRec *outRec = m_PolyOuts[index];\n if (outRec->Pts) DisposeOutPts(outRec->Pts);\n delete outRec;\n m_PolyOuts[index] = 0;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::SetWindingCount(TEdge &edge)\n{\n TEdge *e = edge.PrevInAEL;\n //find the edge of the same polytype that immediately preceeds 'edge' in AEL\n while (e && ((e->PolyTyp != edge.PolyTyp) || (e->WindDelta == 0))) e = e->PrevInAEL;\n if (!e)\n {\n edge.WindCnt = (edge.WindDelta == 0 ? 1 : edge.WindDelta);\n edge.WindCnt2 = 0;\n e = m_ActiveEdges; //ie get ready to calc WindCnt2\n } \n else if (edge.WindDelta == 0 && m_ClipType != ctUnion)\n {\n edge.WindCnt = 1;\n edge.WindCnt2 = e->WindCnt2;\n e = e->NextInAEL; //ie get ready to calc WindCnt2\n }\n else if (IsEvenOddFillType(edge))\n {\n //EvenOdd filling ...\n if (edge.WindDelta == 0)\n {\n //are we inside a subj polygon ...\n bool Inside = true;\n TEdge *e2 = e->PrevInAEL;\n while (e2)\n {\n if (e2->PolyTyp == e->PolyTyp && e2->WindDelta != 0) \n Inside = !Inside;\n e2 = e2->PrevInAEL;\n }\n edge.WindCnt = (Inside ? 0 : 1);\n }\n else\n {\n edge.WindCnt = edge.WindDelta;\n }\n edge.WindCnt2 = e->WindCnt2;\n e = e->NextInAEL; //ie get ready to calc WindCnt2\n } \n else\n {\n //nonZero, Positive or Negative filling ...\n if (e->WindCnt * e->WindDelta < 0)\n {\n //prev edge is 'decreasing' WindCount (WC) toward zero\n //so we're outside the previous polygon ...\n if (Abs(e->WindCnt) > 1)\n {\n //outside prev poly but still inside another.\n //when reversing direction of prev poly use the same WC \n if (e->WindDelta * edge.WindDelta < 0) edge.WindCnt = e->WindCnt;\n //otherwise continue to 'decrease' WC ...\n else edge.WindCnt = e->WindCnt + edge.WindDelta;\n } \n else\n //now outside all polys of same polytype so set own WC ...\n edge.WindCnt = (edge.WindDelta == 0 ? 1 : edge.WindDelta);\n } else\n {\n //prev edge is 'increasing' WindCount (WC) away from zero\n //so we're inside the previous polygon ...\n if (edge.WindDelta == 0) \n edge.WindCnt = (e->WindCnt < 0 ? e->WindCnt - 1 : e->WindCnt + 1);\n //if wind direction is reversing prev then use same WC\n else if (e->WindDelta * edge.WindDelta < 0) edge.WindCnt = e->WindCnt;\n //otherwise add to WC ...\n else edge.WindCnt = e->WindCnt + edge.WindDelta;\n }\n edge.WindCnt2 = e->WindCnt2;\n e = e->NextInAEL; //ie get ready to calc WindCnt2\n }\n\n //update WindCnt2 ...\n if (IsEvenOddAltFillType(edge))\n {\n //EvenOdd filling ...\n while (e != &edge)\n {\n if (e->WindDelta != 0)\n edge.WindCnt2 = (edge.WindCnt2 == 0 ? 1 : 0);\n e = e->NextInAEL;\n }\n } else\n {\n //nonZero, Positive or Negative filling ...\n while ( e != &edge )\n {\n edge.WindCnt2 += e->WindDelta;\n e = e->NextInAEL;\n }\n }\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::IsEvenOddFillType(const TEdge& edge) const\n{\n if (edge.PolyTyp == ptSubject)\n return m_SubjFillType == pftEvenOdd; else\n return m_ClipFillType == pftEvenOdd;\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::IsEvenOddAltFillType(const TEdge& edge) const\n{\n if (edge.PolyTyp == ptSubject)\n return m_ClipFillType == pftEvenOdd; else\n return m_SubjFillType == pftEvenOdd;\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::IsContributing(const TEdge& edge) const\n{\n PolyFillType pft, pft2;\n if (edge.PolyTyp == ptSubject)\n {\n pft = m_SubjFillType;\n pft2 = m_ClipFillType;\n } else\n {\n pft = m_ClipFillType;\n pft2 = m_SubjFillType;\n }\n\n switch(pft)\n {\n case pftEvenOdd: \n //return false if a subj line has been flagged as inside a subj polygon\n if (edge.WindDelta == 0 && edge.WindCnt != 1) return false;\n break;\n case pftNonZero:\n if (Abs(edge.WindCnt) != 1) return false;\n break;\n case pftPositive: \n if (edge.WindCnt != 1) return false;\n break;\n default: //pftNegative\n if (edge.WindCnt != -1) return false;\n }\n\n switch(m_ClipType)\n {\n case ctIntersection:\n switch(pft2)\n {\n case pftEvenOdd: \n case pftNonZero: \n return (edge.WindCnt2 != 0);\n case pftPositive: \n return (edge.WindCnt2 > 0);\n default: \n return (edge.WindCnt2 < 0);\n }\n break;\n case ctUnion:\n switch(pft2)\n {\n case pftEvenOdd: \n case pftNonZero: \n return (edge.WindCnt2 == 0);\n case pftPositive: \n return (edge.WindCnt2 <= 0);\n default: \n return (edge.WindCnt2 >= 0);\n }\n break;\n case ctDifference:\n if (edge.PolyTyp == ptSubject)\n switch(pft2)\n {\n case pftEvenOdd: \n case pftNonZero: \n return (edge.WindCnt2 == 0);\n case pftPositive: \n return (edge.WindCnt2 <= 0);\n default: \n return (edge.WindCnt2 >= 0);\n }\n else\n switch(pft2)\n {\n case pftEvenOdd: \n case pftNonZero: \n return (edge.WindCnt2 != 0);\n case pftPositive: \n return (edge.WindCnt2 > 0);\n default: \n return (edge.WindCnt2 < 0);\n }\n break;\n case ctXor:\n if (edge.WindDelta == 0) //XOr always contributing unless open\n switch(pft2)\n {\n case pftEvenOdd: \n case pftNonZero: \n return (edge.WindCnt2 == 0);\n case pftPositive: \n return (edge.WindCnt2 <= 0);\n default: \n return (edge.WindCnt2 >= 0);\n }\n else \n return true;\n break;\n default:\n return true;\n }\n}\n//------------------------------------------------------------------------------\n\nOutPt* Clipper::AddLocalMinPoly(TEdge *e1, TEdge *e2, const IntPoint &Pt)\n{\n OutPt* result;\n TEdge *e, *prevE;\n if (IsHorizontal(*e2) || ( e1->Dx > e2->Dx ))\n {\n result = AddOutPt(e1, Pt);\n e2->OutIdx = e1->OutIdx;\n e1->Side = esLeft;\n e2->Side = esRight;\n e = e1;\n if (e->PrevInAEL == e2)\n prevE = e2->PrevInAEL; \n else\n prevE = e->PrevInAEL;\n } else\n {\n result = AddOutPt(e2, Pt);\n e1->OutIdx = e2->OutIdx;\n e1->Side = esRight;\n e2->Side = esLeft;\n e = e2;\n if (e->PrevInAEL == e1)\n prevE = e1->PrevInAEL;\n else\n prevE = e->PrevInAEL;\n }\n\n if (prevE && prevE->OutIdx >= 0 &&\n (TopX(*prevE, Pt.Y) == TopX(*e, Pt.Y)) &&\n SlopesEqual(*e, *prevE, m_UseFullRange) &&\n (e->WindDelta != 0) && (prevE->WindDelta != 0))\n {\n OutPt* outPt = AddOutPt(prevE, Pt);\n AddJoin(result, outPt, e->Top);\n }\n return result;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::AddLocalMaxPoly(TEdge *e1, TEdge *e2, const IntPoint &Pt)\n{\n AddOutPt( e1, Pt );\n if (e2->WindDelta == 0) AddOutPt(e2, Pt);\n if( e1->OutIdx == e2->OutIdx )\n {\n e1->OutIdx = Unassigned;\n e2->OutIdx = Unassigned;\n }\n else if (e1->OutIdx < e2->OutIdx) \n AppendPolygon(e1, e2); \n else \n AppendPolygon(e2, e1);\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::AddEdgeToSEL(TEdge *edge)\n{\n //SEL pointers in PEdge are reused to build a list of horizontal edges.\n //However, we don't need to worry about order with horizontal edge processing.\n if( !m_SortedEdges )\n {\n m_SortedEdges = edge;\n edge->PrevInSEL = 0;\n edge->NextInSEL = 0;\n }\n else\n {\n edge->NextInSEL = m_SortedEdges;\n edge->PrevInSEL = 0;\n m_SortedEdges->PrevInSEL = edge;\n m_SortedEdges = edge;\n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::CopyAELToSEL()\n{\n TEdge* e = m_ActiveEdges;\n m_SortedEdges = e;\n while ( e )\n {\n e->PrevInSEL = e->PrevInAEL;\n e->NextInSEL = e->NextInAEL;\n e = e->NextInAEL;\n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::AddJoin(OutPt *op1, OutPt *op2, const IntPoint OffPt)\n{\n Join* j = new Join;\n j->OutPt1 = op1;\n j->OutPt2 = op2;\n j->OffPt = OffPt;\n m_Joins.push_back(j);\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::ClearJoins()\n{\n for (JoinList::size_type i = 0; i < m_Joins.size(); i++)\n delete m_Joins[i];\n m_Joins.resize(0);\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::ClearGhostJoins()\n{\n for (JoinList::size_type i = 0; i < m_GhostJoins.size(); i++)\n delete m_GhostJoins[i];\n m_GhostJoins.resize(0);\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::AddGhostJoin(OutPt *op, const IntPoint OffPt)\n{\n Join* j = new Join;\n j->OutPt1 = op;\n j->OutPt2 = 0;\n j->OffPt = OffPt;\n m_GhostJoins.push_back(j);\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::InsertLocalMinimaIntoAEL(const cInt botY)\n{\n while (m_CurrentLM != m_MinimaList.end() && (m_CurrentLM->Y == botY))\n {\n TEdge* lb = m_CurrentLM->LeftBound;\n TEdge* rb = m_CurrentLM->RightBound;\n PopLocalMinima();\n OutPt *Op1 = 0;\n if (!lb)\n {\n //nb: don't insert LB into either AEL or SEL\n InsertEdgeIntoAEL(rb, 0);\n SetWindingCount(*rb);\n if (IsContributing(*rb))\n Op1 = AddOutPt(rb, rb->Bot); \n } \n else if (!rb)\n {\n InsertEdgeIntoAEL(lb, 0);\n SetWindingCount(*lb);\n if (IsContributing(*lb))\n Op1 = AddOutPt(lb, lb->Bot);\n InsertScanbeam(lb->Top.Y);\n }\n else\n {\n InsertEdgeIntoAEL(lb, 0);\n InsertEdgeIntoAEL(rb, lb);\n SetWindingCount( *lb );\n rb->WindCnt = lb->WindCnt;\n rb->WindCnt2 = lb->WindCnt2;\n if (IsContributing(*lb))\n Op1 = AddLocalMinPoly(lb, rb, lb->Bot); \n InsertScanbeam(lb->Top.Y);\n }\n\n if (rb)\n {\n if(IsHorizontal(*rb)) AddEdgeToSEL(rb);\n else InsertScanbeam( rb->Top.Y );\n }\n\n if (!lb || !rb) continue;\n\n //if any output polygons share an edge, they'll need joining later ...\n if (Op1 && IsHorizontal(*rb) && \n m_GhostJoins.size() > 0 && (rb->WindDelta != 0))\n {\n for (JoinList::size_type i = 0; i < m_GhostJoins.size(); ++i)\n {\n Join* jr = m_GhostJoins[i];\n //if the horizontal Rb and a 'ghost' horizontal overlap, then convert\n //the 'ghost' join to a real join ready for later ...\n if (HorzSegmentsOverlap(jr->OutPt1->Pt.X, jr->OffPt.X, rb->Bot.X, rb->Top.X))\n AddJoin(jr->OutPt1, Op1, jr->OffPt);\n }\n }\n\n if (lb->OutIdx >= 0 && lb->PrevInAEL && \n lb->PrevInAEL->Curr.X == lb->Bot.X &&\n lb->PrevInAEL->OutIdx >= 0 &&\n SlopesEqual(*lb->PrevInAEL, *lb, m_UseFullRange) &&\n (lb->WindDelta != 0) && (lb->PrevInAEL->WindDelta != 0))\n {\n OutPt *Op2 = AddOutPt(lb->PrevInAEL, lb->Bot);\n AddJoin(Op1, Op2, lb->Top);\n }\n\n if(lb->NextInAEL != rb)\n {\n\n if (rb->OutIdx >= 0 && rb->PrevInAEL->OutIdx >= 0 &&\n SlopesEqual(*rb->PrevInAEL, *rb, m_UseFullRange) &&\n (rb->WindDelta != 0) && (rb->PrevInAEL->WindDelta != 0))\n {\n OutPt *Op2 = AddOutPt(rb->PrevInAEL, rb->Bot);\n AddJoin(Op1, Op2, rb->Top);\n }\n\n TEdge* e = lb->NextInAEL;\n if (e)\n {\n while( e != rb )\n {\n //nb: For calculating winding counts etc, IntersectEdges() assumes\n //that param1 will be to the Right of param2 ABOVE the intersection ...\n IntersectEdges(rb , e , lb->Curr); //order important here\n e = e->NextInAEL;\n }\n }\n }\n \n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::DeleteFromAEL(TEdge *e)\n{\n TEdge* AelPrev = e->PrevInAEL;\n TEdge* AelNext = e->NextInAEL;\n if( !AelPrev && !AelNext && (e != m_ActiveEdges) ) return; //already deleted\n if( AelPrev ) AelPrev->NextInAEL = AelNext;\n else m_ActiveEdges = AelNext;\n if( AelNext ) AelNext->PrevInAEL = AelPrev;\n e->NextInAEL = 0;\n e->PrevInAEL = 0;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::DeleteFromSEL(TEdge *e)\n{\n TEdge* SelPrev = e->PrevInSEL;\n TEdge* SelNext = e->NextInSEL;\n if( !SelPrev && !SelNext && (e != m_SortedEdges) ) return; //already deleted\n if( SelPrev ) SelPrev->NextInSEL = SelNext;\n else m_SortedEdges = SelNext;\n if( SelNext ) SelNext->PrevInSEL = SelPrev;\n e->NextInSEL = 0;\n e->PrevInSEL = 0;\n}\n//------------------------------------------------------------------------------\n\n#ifdef use_xyz\nvoid Clipper::SetZ(IntPoint& pt, TEdge& e1, TEdge& e2)\n{\n if (pt.Z != 0 || !m_ZFill) return;\n else if (pt == e1.Bot) pt.Z = e1.Bot.Z;\n else if (pt == e1.Top) pt.Z = e1.Top.Z;\n else if (pt == e2.Bot) pt.Z = e2.Bot.Z;\n else if (pt == e2.Top) pt.Z = e2.Top.Z;\n else (*m_ZFill)(e1.Bot, e1.Top, e2.Bot, e2.Top, pt); \n}\n//------------------------------------------------------------------------------\n#endif\n\nvoid Clipper::IntersectEdges(TEdge *e1, TEdge *e2, IntPoint &Pt)\n{\n bool e1Contributing = ( e1->OutIdx >= 0 );\n bool e2Contributing = ( e2->OutIdx >= 0 );\n\n#ifdef use_xyz\n SetZ(Pt, *e1, *e2);\n#endif\n\n#ifdef use_lines\n //if either edge is on an OPEN path ...\n if (e1->WindDelta == 0 || e2->WindDelta == 0)\n {\n //ignore subject-subject open path intersections UNLESS they\n //are both open paths, AND they are both 'contributing maximas' ...\n\tif (e1->WindDelta == 0 && e2->WindDelta == 0) return;\n\n //if intersecting a subj line with a subj poly ...\n else if (e1->PolyTyp == e2->PolyTyp && \n e1->WindDelta != e2->WindDelta && m_ClipType == ctUnion)\n {\n if (e1->WindDelta == 0)\n {\n if (e2Contributing)\n {\n AddOutPt(e1, Pt);\n if (e1Contributing) e1->OutIdx = Unassigned;\n }\n }\n else\n {\n if (e1Contributing)\n {\n AddOutPt(e2, Pt);\n if (e2Contributing) e2->OutIdx = Unassigned;\n }\n }\n }\n else if (e1->PolyTyp != e2->PolyTyp)\n {\n //toggle subj open path OutIdx on/off when Abs(clip.WndCnt) == 1 ...\n if ((e1->WindDelta == 0) && abs(e2->WindCnt) == 1 && \n (m_ClipType != ctUnion || e2->WindCnt2 == 0))\n {\n AddOutPt(e1, Pt);\n if (e1Contributing) e1->OutIdx = Unassigned;\n }\n else if ((e2->WindDelta == 0) && (abs(e1->WindCnt) == 1) && \n (m_ClipType != ctUnion || e1->WindCnt2 == 0))\n {\n AddOutPt(e2, Pt);\n if (e2Contributing) e2->OutIdx = Unassigned;\n }\n }\n return;\n }\n#endif\n\n //update winding counts...\n //assumes that e1 will be to the Right of e2 ABOVE the intersection\n if ( e1->PolyTyp == e2->PolyTyp )\n {\n if ( IsEvenOddFillType( *e1) )\n {\n int oldE1WindCnt = e1->WindCnt;\n e1->WindCnt = e2->WindCnt;\n e2->WindCnt = oldE1WindCnt;\n } else\n {\n if (e1->WindCnt + e2->WindDelta == 0 ) e1->WindCnt = -e1->WindCnt;\n else e1->WindCnt += e2->WindDelta;\n if ( e2->WindCnt - e1->WindDelta == 0 ) e2->WindCnt = -e2->WindCnt;\n else e2->WindCnt -= e1->WindDelta;\n }\n } else\n {\n if (!IsEvenOddFillType(*e2)) e1->WindCnt2 += e2->WindDelta;\n else e1->WindCnt2 = ( e1->WindCnt2 == 0 ) ? 1 : 0;\n if (!IsEvenOddFillType(*e1)) e2->WindCnt2 -= e1->WindDelta;\n else e2->WindCnt2 = ( e2->WindCnt2 == 0 ) ? 1 : 0;\n }\n\n PolyFillType e1FillType, e2FillType, e1FillType2, e2FillType2;\n if (e1->PolyTyp == ptSubject)\n {\n e1FillType = m_SubjFillType;\n e1FillType2 = m_ClipFillType;\n } else\n {\n e1FillType = m_ClipFillType;\n e1FillType2 = m_SubjFillType;\n }\n if (e2->PolyTyp == ptSubject)\n {\n e2FillType = m_SubjFillType;\n e2FillType2 = m_ClipFillType;\n } else\n {\n e2FillType = m_ClipFillType;\n e2FillType2 = m_SubjFillType;\n }\n\n cInt e1Wc, e2Wc;\n switch (e1FillType)\n {\n case pftPositive: e1Wc = e1->WindCnt; break;\n case pftNegative: e1Wc = -e1->WindCnt; break;\n default: e1Wc = Abs(e1->WindCnt);\n }\n switch(e2FillType)\n {\n case pftPositive: e2Wc = e2->WindCnt; break;\n case pftNegative: e2Wc = -e2->WindCnt; break;\n default: e2Wc = Abs(e2->WindCnt);\n }\n\n if ( e1Contributing && e2Contributing )\n {\n if ((e1Wc != 0 && e1Wc != 1) || (e2Wc != 0 && e2Wc != 1) ||\n (e1->PolyTyp != e2->PolyTyp && m_ClipType != ctXor) )\n {\n AddLocalMaxPoly(e1, e2, Pt); \n }\n else\n {\n AddOutPt(e1, Pt);\n AddOutPt(e2, Pt);\n SwapSides( *e1 , *e2 );\n SwapPolyIndexes( *e1 , *e2 );\n }\n }\n else if ( e1Contributing )\n {\n if (e2Wc == 0 || e2Wc == 1) \n {\n AddOutPt(e1, Pt);\n SwapSides(*e1, *e2);\n SwapPolyIndexes(*e1, *e2);\n }\n }\n else if ( e2Contributing )\n {\n if (e1Wc == 0 || e1Wc == 1) \n {\n AddOutPt(e2, Pt);\n SwapSides(*e1, *e2);\n SwapPolyIndexes(*e1, *e2);\n }\n } \n else if ( (e1Wc == 0 || e1Wc == 1) && (e2Wc == 0 || e2Wc == 1))\n {\n //neither edge is currently contributing ...\n\n cInt e1Wc2, e2Wc2;\n switch (e1FillType2)\n {\n case pftPositive: e1Wc2 = e1->WindCnt2; break;\n case pftNegative : e1Wc2 = -e1->WindCnt2; break;\n default: e1Wc2 = Abs(e1->WindCnt2);\n }\n switch (e2FillType2)\n {\n case pftPositive: e2Wc2 = e2->WindCnt2; break;\n case pftNegative: e2Wc2 = -e2->WindCnt2; break;\n default: e2Wc2 = Abs(e2->WindCnt2);\n }\n\n if (e1->PolyTyp != e2->PolyTyp)\n {\n AddLocalMinPoly(e1, e2, Pt);\n }\n else if (e1Wc == 1 && e2Wc == 1)\n switch( m_ClipType ) {\n case ctIntersection:\n if (e1Wc2 > 0 && e2Wc2 > 0)\n AddLocalMinPoly(e1, e2, Pt);\n break;\n case ctUnion:\n if ( e1Wc2 <= 0 && e2Wc2 <= 0 )\n AddLocalMinPoly(e1, e2, Pt);\n break;\n case ctDifference:\n if (((e1->PolyTyp == ptClip) && (e1Wc2 > 0) && (e2Wc2 > 0)) ||\n ((e1->PolyTyp == ptSubject) && (e1Wc2 <= 0) && (e2Wc2 <= 0)))\n AddLocalMinPoly(e1, e2, Pt);\n break;\n case ctXor:\n AddLocalMinPoly(e1, e2, Pt);\n }\n else\n SwapSides( *e1, *e2 );\n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::SetHoleState(TEdge *e, OutRec *outrec)\n{\n bool IsHole = false;\n TEdge *e2 = e->PrevInAEL;\n while (e2)\n {\n if (e2->OutIdx >= 0 && e2->WindDelta != 0)\n {\n IsHole = !IsHole;\n if (! outrec->FirstLeft)\n outrec->FirstLeft = m_PolyOuts[e2->OutIdx];\n }\n e2 = e2->PrevInAEL;\n }\n if (IsHole) outrec->IsHole = true;\n}\n//------------------------------------------------------------------------------\n\nOutRec* GetLowermostRec(OutRec *outRec1, OutRec *outRec2)\n{\n //work out which polygon fragment has the correct hole state ...\n if (!outRec1->BottomPt) \n outRec1->BottomPt = GetBottomPt(outRec1->Pts);\n if (!outRec2->BottomPt) \n outRec2->BottomPt = GetBottomPt(outRec2->Pts);\n OutPt *OutPt1 = outRec1->BottomPt;\n OutPt *OutPt2 = outRec2->BottomPt;\n if (OutPt1->Pt.Y > OutPt2->Pt.Y) return outRec1;\n else if (OutPt1->Pt.Y < OutPt2->Pt.Y) return outRec2;\n else if (OutPt1->Pt.X < OutPt2->Pt.X) return outRec1;\n else if (OutPt1->Pt.X > OutPt2->Pt.X) return outRec2;\n else if (OutPt1->Next == OutPt1) return outRec2;\n else if (OutPt2->Next == OutPt2) return outRec1;\n else if (FirstIsBottomPt(OutPt1, OutPt2)) return outRec1;\n else return outRec2;\n}\n//------------------------------------------------------------------------------\n\nbool Param1RightOfParam2(OutRec* outRec1, OutRec* outRec2)\n{\n do\n {\n outRec1 = outRec1->FirstLeft;\n if (outRec1 == outRec2) return true;\n } while (outRec1);\n return false;\n}\n//------------------------------------------------------------------------------\n\nOutRec* Clipper::GetOutRec(int Idx)\n{\n OutRec* outrec = m_PolyOuts[Idx];\n while (outrec != m_PolyOuts[outrec->Idx])\n outrec = m_PolyOuts[outrec->Idx];\n return outrec;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::AppendPolygon(TEdge *e1, TEdge *e2)\n{\n //get the start and ends of both output polygons ...\n OutRec *outRec1 = m_PolyOuts[e1->OutIdx];\n OutRec *outRec2 = m_PolyOuts[e2->OutIdx];\n\n OutRec *holeStateRec;\n if (Param1RightOfParam2(outRec1, outRec2)) \n holeStateRec = outRec2;\n else if (Param1RightOfParam2(outRec2, outRec1)) \n holeStateRec = outRec1;\n else \n holeStateRec = GetLowermostRec(outRec1, outRec2);\n\n //get the start and ends of both output polygons and\n //join e2 poly onto e1 poly and delete pointers to e2 ...\n\n OutPt* p1_lft = outRec1->Pts;\n OutPt* p1_rt = p1_lft->Prev;\n OutPt* p2_lft = outRec2->Pts;\n OutPt* p2_rt = p2_lft->Prev;\n\n EdgeSide Side;\n //join e2 poly onto e1 poly and delete pointers to e2 ...\n if( e1->Side == esLeft )\n {\n if( e2->Side == esLeft )\n {\n //z y x a b c\n ReversePolyPtLinks(p2_lft);\n p2_lft->Next = p1_lft;\n p1_lft->Prev = p2_lft;\n p1_rt->Next = p2_rt;\n p2_rt->Prev = p1_rt;\n outRec1->Pts = p2_rt;\n } else\n {\n //x y z a b c\n p2_rt->Next = p1_lft;\n p1_lft->Prev = p2_rt;\n p2_lft->Prev = p1_rt;\n p1_rt->Next = p2_lft;\n outRec1->Pts = p2_lft;\n }\n Side = esLeft;\n } else\n {\n if( e2->Side == esRight )\n {\n //a b c z y x\n ReversePolyPtLinks(p2_lft);\n p1_rt->Next = p2_rt;\n p2_rt->Prev = p1_rt;\n p2_lft->Next = p1_lft;\n p1_lft->Prev = p2_lft;\n } else\n {\n //a b c x y z\n p1_rt->Next = p2_lft;\n p2_lft->Prev = p1_rt;\n p1_lft->Prev = p2_rt;\n p2_rt->Next = p1_lft;\n }\n Side = esRight;\n }\n\n outRec1->BottomPt = 0;\n if (holeStateRec == outRec2)\n {\n if (outRec2->FirstLeft != outRec1)\n outRec1->FirstLeft = outRec2->FirstLeft;\n outRec1->IsHole = outRec2->IsHole;\n }\n outRec2->Pts = 0;\n outRec2->BottomPt = 0;\n outRec2->FirstLeft = outRec1;\n\n int OKIdx = e1->OutIdx;\n int ObsoleteIdx = e2->OutIdx;\n\n e1->OutIdx = Unassigned; //nb: safe because we only get here via AddLocalMaxPoly\n e2->OutIdx = Unassigned;\n\n TEdge* e = m_ActiveEdges;\n while( e )\n {\n if( e->OutIdx == ObsoleteIdx )\n {\n e->OutIdx = OKIdx;\n e->Side = Side;\n break;\n }\n e = e->NextInAEL;\n }\n\n outRec2->Idx = outRec1->Idx;\n}\n//------------------------------------------------------------------------------\n\nOutRec* Clipper::CreateOutRec()\n{\n OutRec* result = new OutRec;\n result->IsHole = false;\n result->IsOpen = false;\n result->FirstLeft = 0;\n result->Pts = 0;\n result->BottomPt = 0;\n result->PolyNd = 0;\n m_PolyOuts.push_back(result);\n result->Idx = (int)m_PolyOuts.size()-1;\n return result;\n}\n//------------------------------------------------------------------------------\n\nOutPt* Clipper::AddOutPt(TEdge *e, const IntPoint &pt)\n{\n bool ToFront = (e->Side == esLeft);\n if( e->OutIdx < 0 )\n {\n OutRec *outRec = CreateOutRec();\n outRec->IsOpen = (e->WindDelta == 0);\n OutPt* newOp = new OutPt;\n outRec->Pts = newOp;\n newOp->Idx = outRec->Idx;\n newOp->Pt = pt;\n newOp->Next = newOp;\n newOp->Prev = newOp;\n if (!outRec->IsOpen)\n SetHoleState(e, outRec);\n e->OutIdx = outRec->Idx;\n return newOp;\n } else\n {\n OutRec *outRec = m_PolyOuts[e->OutIdx];\n //OutRec.Pts is the 'Left-most' point & OutRec.Pts.Prev is the 'Right-most'\n OutPt* op = outRec->Pts;\n\n if (ToFront && (pt == op->Pt)) return op;\n else if (!ToFront && (pt == op->Prev->Pt)) return op->Prev;\n\n OutPt* newOp = new OutPt;\n newOp->Idx = outRec->Idx;\n newOp->Pt = pt;\n newOp->Next = op;\n newOp->Prev = op->Prev;\n newOp->Prev->Next = newOp;\n op->Prev = newOp;\n if (ToFront) outRec->Pts = newOp;\n return newOp;\n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::ProcessHorizontals(bool IsTopOfScanbeam)\n{\n TEdge* horzEdge = m_SortedEdges;\n while(horzEdge)\n {\n DeleteFromSEL(horzEdge);\n ProcessHorizontal(horzEdge, IsTopOfScanbeam);\n horzEdge = m_SortedEdges;\n }\n}\n//------------------------------------------------------------------------------\n\ninline bool IsMinima(TEdge *e)\n{\n return e && (e->Prev->NextInLML != e) && (e->Next->NextInLML != e);\n}\n//------------------------------------------------------------------------------\n\ninline bool IsMaxima(TEdge *e, const cInt Y)\n{\n return e && e->Top.Y == Y && !e->NextInLML;\n}\n//------------------------------------------------------------------------------\n\ninline bool IsIntermediate(TEdge *e, const cInt Y)\n{\n return e->Top.Y == Y && e->NextInLML;\n}\n//------------------------------------------------------------------------------\n\nTEdge *GetMaximaPair(TEdge *e)\n{\n TEdge* result = 0;\n if ((e->Next->Top == e->Top) && !e->Next->NextInLML)\n result = e->Next;\n else if ((e->Prev->Top == e->Top) && !e->Prev->NextInLML)\n result = e->Prev;\n\n if (result && (result->OutIdx == Skip ||\n //result is false if both NextInAEL & PrevInAEL are nil & not horizontal ...\n (result->NextInAEL == result->PrevInAEL && !IsHorizontal(*result))))\n return 0;\n return result;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::SwapPositionsInAEL(TEdge *Edge1, TEdge *Edge2)\n{\n //check that one or other edge hasn't already been removed from AEL ...\n if (Edge1->NextInAEL == Edge1->PrevInAEL || \n Edge2->NextInAEL == Edge2->PrevInAEL) return;\n\n if( Edge1->NextInAEL == Edge2 )\n {\n TEdge* Next = Edge2->NextInAEL;\n if( Next ) Next->PrevInAEL = Edge1;\n TEdge* Prev = Edge1->PrevInAEL;\n if( Prev ) Prev->NextInAEL = Edge2;\n Edge2->PrevInAEL = Prev;\n Edge2->NextInAEL = Edge1;\n Edge1->PrevInAEL = Edge2;\n Edge1->NextInAEL = Next;\n }\n else if( Edge2->NextInAEL == Edge1 )\n {\n TEdge* Next = Edge1->NextInAEL;\n if( Next ) Next->PrevInAEL = Edge2;\n TEdge* Prev = Edge2->PrevInAEL;\n if( Prev ) Prev->NextInAEL = Edge1;\n Edge1->PrevInAEL = Prev;\n Edge1->NextInAEL = Edge2;\n Edge2->PrevInAEL = Edge1;\n Edge2->NextInAEL = Next;\n }\n else\n {\n TEdge* Next = Edge1->NextInAEL;\n TEdge* Prev = Edge1->PrevInAEL;\n Edge1->NextInAEL = Edge2->NextInAEL;\n if( Edge1->NextInAEL ) Edge1->NextInAEL->PrevInAEL = Edge1;\n Edge1->PrevInAEL = Edge2->PrevInAEL;\n if( Edge1->PrevInAEL ) Edge1->PrevInAEL->NextInAEL = Edge1;\n Edge2->NextInAEL = Next;\n if( Edge2->NextInAEL ) Edge2->NextInAEL->PrevInAEL = Edge2;\n Edge2->PrevInAEL = Prev;\n if( Edge2->PrevInAEL ) Edge2->PrevInAEL->NextInAEL = Edge2;\n }\n\n if( !Edge1->PrevInAEL ) m_ActiveEdges = Edge1;\n else if( !Edge2->PrevInAEL ) m_ActiveEdges = Edge2;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::SwapPositionsInSEL(TEdge *Edge1, TEdge *Edge2)\n{\n if( !( Edge1->NextInSEL ) && !( Edge1->PrevInSEL ) ) return;\n if( !( Edge2->NextInSEL ) && !( Edge2->PrevInSEL ) ) return;\n\n if( Edge1->NextInSEL == Edge2 )\n {\n TEdge* Next = Edge2->NextInSEL;\n if( Next ) Next->PrevInSEL = Edge1;\n TEdge* Prev = Edge1->PrevInSEL;\n if( Prev ) Prev->NextInSEL = Edge2;\n Edge2->PrevInSEL = Prev;\n Edge2->NextInSEL = Edge1;\n Edge1->PrevInSEL = Edge2;\n Edge1->NextInSEL = Next;\n }\n else if( Edge2->NextInSEL == Edge1 )\n {\n TEdge* Next = Edge1->NextInSEL;\n if( Next ) Next->PrevInSEL = Edge2;\n TEdge* Prev = Edge2->PrevInSEL;\n if( Prev ) Prev->NextInSEL = Edge1;\n Edge1->PrevInSEL = Prev;\n Edge1->NextInSEL = Edge2;\n Edge2->PrevInSEL = Edge1;\n Edge2->NextInSEL = Next;\n }\n else\n {\n TEdge* Next = Edge1->NextInSEL;\n TEdge* Prev = Edge1->PrevInSEL;\n Edge1->NextInSEL = Edge2->NextInSEL;\n if( Edge1->NextInSEL ) Edge1->NextInSEL->PrevInSEL = Edge1;\n Edge1->PrevInSEL = Edge2->PrevInSEL;\n if( Edge1->PrevInSEL ) Edge1->PrevInSEL->NextInSEL = Edge1;\n Edge2->NextInSEL = Next;\n if( Edge2->NextInSEL ) Edge2->NextInSEL->PrevInSEL = Edge2;\n Edge2->PrevInSEL = Prev;\n if( Edge2->PrevInSEL ) Edge2->PrevInSEL->NextInSEL = Edge2;\n }\n\n if( !Edge1->PrevInSEL ) m_SortedEdges = Edge1;\n else if( !Edge2->PrevInSEL ) m_SortedEdges = Edge2;\n}\n//------------------------------------------------------------------------------\n\nTEdge* GetNextInAEL(TEdge *e, Direction dir)\n{\n return dir == dLeftToRight ? e->NextInAEL : e->PrevInAEL;\n}\n//------------------------------------------------------------------------------\n\nvoid GetHorzDirection(TEdge& HorzEdge, Direction& Dir, cInt& Left, cInt& Right)\n{\n if (HorzEdge.Bot.X < HorzEdge.Top.X)\n {\n Left = HorzEdge.Bot.X;\n Right = HorzEdge.Top.X;\n Dir = dLeftToRight;\n } else\n {\n Left = HorzEdge.Top.X;\n Right = HorzEdge.Bot.X;\n Dir = dRightToLeft;\n }\n}\n//------------------------------------------------------------------------\n\n/*******************************************************************************\n* Notes: Horizontal edges (HEs) at scanline intersections (ie at the Top or *\n* Bottom of a scanbeam) are processed as if layered. The order in which HEs *\n* are processed doesn't matter. HEs intersect with other HE Bot.Xs only [#] *\n* (or they could intersect with Top.Xs only, ie EITHER Bot.Xs OR Top.Xs), *\n* and with other non-horizontal edges [*]. Once these intersections are *\n* processed, intermediate HEs then 'promote' the Edge above (NextInLML) into *\n* the AEL. These 'promoted' edges may in turn intersect [%] with other HEs. *\n*******************************************************************************/\n\nvoid Clipper::ProcessHorizontal(TEdge *horzEdge, bool isTopOfScanbeam)\n{\n Direction dir;\n cInt horzLeft, horzRight;\n\n GetHorzDirection(*horzEdge, dir, horzLeft, horzRight);\n\n TEdge* eLastHorz = horzEdge, *eMaxPair = 0;\n while (eLastHorz->NextInLML && IsHorizontal(*eLastHorz->NextInLML)) \n eLastHorz = eLastHorz->NextInLML;\n if (!eLastHorz->NextInLML)\n eMaxPair = GetMaximaPair(eLastHorz);\n\n for (;;)\n {\n bool IsLastHorz = (horzEdge == eLastHorz);\n TEdge* e = GetNextInAEL(horzEdge, dir);\n while(e)\n {\n //Break if we've got to the end of an intermediate horizontal edge ...\n //nb: Smaller Dx's are to the right of larger Dx's ABOVE the horizontal.\n if (e->Curr.X == horzEdge->Top.X && horzEdge->NextInLML && \n e->Dx < horzEdge->NextInLML->Dx) break;\n\n TEdge* eNext = GetNextInAEL(e, dir); //saves eNext for later\n\n if ((dir == dLeftToRight && e->Curr.X <= horzRight) ||\n (dir == dRightToLeft && e->Curr.X >= horzLeft))\n {\n //so far we're still in range of the horizontal Edge but make sure\n //we're at the last of consec. horizontals when matching with eMaxPair\n if(e == eMaxPair && IsLastHorz)\n {\n\n if (horzEdge->OutIdx >= 0)\n {\n OutPt* op1 = AddOutPt(horzEdge, horzEdge->Top);\n TEdge* eNextHorz = m_SortedEdges;\n while (eNextHorz)\n {\n if (eNextHorz->OutIdx >= 0 &&\n HorzSegmentsOverlap(horzEdge->Bot.X,\n horzEdge->Top.X, eNextHorz->Bot.X, eNextHorz->Top.X))\n {\n OutPt* op2 = AddOutPt(eNextHorz, eNextHorz->Bot);\n AddJoin(op2, op1, eNextHorz->Top);\n }\n eNextHorz = eNextHorz->NextInSEL;\n }\n AddGhostJoin(op1, horzEdge->Bot);\n AddLocalMaxPoly(horzEdge, eMaxPair, horzEdge->Top);\n }\n DeleteFromAEL(horzEdge);\n DeleteFromAEL(eMaxPair);\n return;\n }\n else if(dir == dLeftToRight)\n {\n IntPoint Pt = IntPoint(e->Curr.X, horzEdge->Curr.Y);\n IntersectEdges(horzEdge, e, Pt);\n }\n else\n {\n IntPoint Pt = IntPoint(e->Curr.X, horzEdge->Curr.Y);\n IntersectEdges( e, horzEdge, Pt);\n }\n SwapPositionsInAEL( horzEdge, e );\n }\n else if( (dir == dLeftToRight && e->Curr.X >= horzRight) ||\n (dir == dRightToLeft && e->Curr.X <= horzLeft) ) break;\n e = eNext;\n } //end while\n\n if (horzEdge->NextInLML && IsHorizontal(*horzEdge->NextInLML))\n {\n UpdateEdgeIntoAEL(horzEdge);\n if (horzEdge->OutIdx >= 0) AddOutPt(horzEdge, horzEdge->Bot);\n GetHorzDirection(*horzEdge, dir, horzLeft, horzRight);\n } else\n break;\n } //end for (;;)\n\n if(horzEdge->NextInLML)\n {\n if(horzEdge->OutIdx >= 0)\n {\n OutPt* op1 = AddOutPt( horzEdge, horzEdge->Top);\n if (isTopOfScanbeam) AddGhostJoin(op1, horzEdge->Bot);\n UpdateEdgeIntoAEL(horzEdge);\n if (horzEdge->WindDelta == 0) return;\n //nb: HorzEdge is no longer horizontal here\n TEdge* ePrev = horzEdge->PrevInAEL;\n TEdge* eNext = horzEdge->NextInAEL;\n if (ePrev && ePrev->Curr.X == horzEdge->Bot.X &&\n ePrev->Curr.Y == horzEdge->Bot.Y && ePrev->WindDelta != 0 &&\n (ePrev->OutIdx >= 0 && ePrev->Curr.Y > ePrev->Top.Y &&\n SlopesEqual(*horzEdge, *ePrev, m_UseFullRange)))\n {\n OutPt* op2 = AddOutPt(ePrev, horzEdge->Bot);\n AddJoin(op1, op2, horzEdge->Top);\n }\n else if (eNext && eNext->Curr.X == horzEdge->Bot.X &&\n eNext->Curr.Y == horzEdge->Bot.Y && eNext->WindDelta != 0 &&\n eNext->OutIdx >= 0 && eNext->Curr.Y > eNext->Top.Y &&\n SlopesEqual(*horzEdge, *eNext, m_UseFullRange))\n {\n OutPt* op2 = AddOutPt(eNext, horzEdge->Bot);\n AddJoin(op1, op2, horzEdge->Top);\n }\n }\n else\n UpdateEdgeIntoAEL(horzEdge); \n }\n else\n {\n if (horzEdge->OutIdx >= 0) AddOutPt(horzEdge, horzEdge->Top);\n DeleteFromAEL(horzEdge);\n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::UpdateEdgeIntoAEL(TEdge *&e)\n{\n if( !e->NextInLML ) throw\n clipperException(\"UpdateEdgeIntoAEL: invalid call\");\n\n e->NextInLML->OutIdx = e->OutIdx;\n TEdge* AelPrev = e->PrevInAEL;\n TEdge* AelNext = e->NextInAEL;\n if (AelPrev) AelPrev->NextInAEL = e->NextInLML;\n else m_ActiveEdges = e->NextInLML;\n if (AelNext) AelNext->PrevInAEL = e->NextInLML;\n e->NextInLML->Side = e->Side;\n e->NextInLML->WindDelta = e->WindDelta;\n e->NextInLML->WindCnt = e->WindCnt;\n e->NextInLML->WindCnt2 = e->WindCnt2;\n e = e->NextInLML;\n e->Curr = e->Bot;\n e->PrevInAEL = AelPrev;\n e->NextInAEL = AelNext;\n if (!IsHorizontal(*e)) InsertScanbeam(e->Top.Y);\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::ProcessIntersections(const cInt topY)\n{\n if( !m_ActiveEdges ) return true;\n try {\n BuildIntersectList(topY);\n size_t IlSize = m_IntersectList.size();\n if (IlSize == 0) return true;\n if (IlSize == 1 || FixupIntersectionOrder()) ProcessIntersectList();\n else return false;\n }\n catch(...) \n {\n m_SortedEdges = 0;\n DisposeIntersectNodes();\n throw clipperException(\"ProcessIntersections error\");\n }\n m_SortedEdges = 0;\n return true;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::DisposeIntersectNodes()\n{\n for (size_t i = 0; i < m_IntersectList.size(); ++i )\n delete m_IntersectList[i];\n m_IntersectList.clear();\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::BuildIntersectList(const cInt topY)\n{\n if ( !m_ActiveEdges ) return;\n\n //prepare for sorting ...\n TEdge* e = m_ActiveEdges;\n m_SortedEdges = e;\n while( e )\n {\n e->PrevInSEL = e->PrevInAEL;\n e->NextInSEL = e->NextInAEL;\n e->Curr.X = TopX( *e, topY );\n e = e->NextInAEL;\n }\n\n //bubblesort ...\n bool isModified;\n do\n {\n isModified = false;\n e = m_SortedEdges;\n while( e->NextInSEL )\n {\n TEdge *eNext = e->NextInSEL;\n IntPoint Pt;\n if(e->Curr.X > eNext->Curr.X)\n {\n IntersectPoint(*e, *eNext, Pt);\n IntersectNode * newNode = new IntersectNode;\n newNode->Edge1 = e;\n newNode->Edge2 = eNext;\n newNode->Pt = Pt;\n m_IntersectList.push_back(newNode);\n\n SwapPositionsInSEL(e, eNext);\n isModified = true;\n }\n else\n e = eNext;\n }\n if( e->PrevInSEL ) e->PrevInSEL->NextInSEL = 0;\n else break;\n }\n while ( isModified );\n m_SortedEdges = 0; //important\n}\n//------------------------------------------------------------------------------\n\n\nvoid Clipper::ProcessIntersectList()\n{\n for (size_t i = 0; i < m_IntersectList.size(); ++i)\n {\n IntersectNode* iNode = m_IntersectList[i];\n {\n IntersectEdges( iNode->Edge1, iNode->Edge2, iNode->Pt);\n SwapPositionsInAEL( iNode->Edge1 , iNode->Edge2 );\n }\n delete iNode;\n }\n m_IntersectList.clear();\n}\n//------------------------------------------------------------------------------\n\nbool IntersectListSort(IntersectNode* node1, IntersectNode* node2)\n{\n return node2->Pt.Y < node1->Pt.Y;\n}\n//------------------------------------------------------------------------------\n\ninline bool EdgesAdjacent(const IntersectNode &inode)\n{\n return (inode.Edge1->NextInSEL == inode.Edge2) ||\n (inode.Edge1->PrevInSEL == inode.Edge2);\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::FixupIntersectionOrder()\n{\n //pre-condition: intersections are sorted Bottom-most first.\n //Now it's crucial that intersections are made only between adjacent edges,\n //so to ensure this the order of intersections may need adjusting ...\n CopyAELToSEL();\n std::sort(m_IntersectList.begin(), m_IntersectList.end(), IntersectListSort);\n size_t cnt = m_IntersectList.size();\n for (size_t i = 0; i < cnt; ++i) \n {\n if (!EdgesAdjacent(*m_IntersectList[i]))\n {\n size_t j = i + 1;\n while (j < cnt && !EdgesAdjacent(*m_IntersectList[j])) j++;\n if (j == cnt) return false;\n std::swap(m_IntersectList[i], m_IntersectList[j]);\n }\n SwapPositionsInSEL(m_IntersectList[i]->Edge1, m_IntersectList[i]->Edge2);\n }\n return true;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::DoMaxima(TEdge *e)\n{\n TEdge* eMaxPair = GetMaximaPair(e);\n if (!eMaxPair)\n {\n if (e->OutIdx >= 0)\n AddOutPt(e, e->Top);\n DeleteFromAEL(e);\n return;\n }\n\n TEdge* eNext = e->NextInAEL;\n while(eNext && eNext != eMaxPair)\n {\n IntersectEdges(e, eNext, e->Top);\n SwapPositionsInAEL(e, eNext);\n eNext = e->NextInAEL;\n }\n\n if(e->OutIdx == Unassigned && eMaxPair->OutIdx == Unassigned)\n {\n DeleteFromAEL(e);\n DeleteFromAEL(eMaxPair);\n }\n else if( e->OutIdx >= 0 && eMaxPair->OutIdx >= 0 )\n {\n if (e->OutIdx >= 0) AddLocalMaxPoly(e, eMaxPair, e->Top);\n DeleteFromAEL(e);\n DeleteFromAEL(eMaxPair);\n }\n#ifdef use_lines\n else if (e->WindDelta == 0)\n {\n if (e->OutIdx >= 0) \n {\n AddOutPt(e, e->Top);\n e->OutIdx = Unassigned;\n }\n DeleteFromAEL(e);\n\n if (eMaxPair->OutIdx >= 0)\n {\n AddOutPt(eMaxPair, e->Top);\n eMaxPair->OutIdx = Unassigned;\n }\n DeleteFromAEL(eMaxPair);\n } \n#endif\n else throw clipperException(\"DoMaxima error\");\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::ProcessEdgesAtTopOfScanbeam(const cInt topY)\n{\n TEdge* e = m_ActiveEdges;\n while( e )\n {\n //1. process maxima, treating them as if they're 'bent' horizontal edges,\n // but exclude maxima with horizontal edges. nb: e can't be a horizontal.\n bool IsMaximaEdge = IsMaxima(e, topY);\n\n if(IsMaximaEdge)\n {\n TEdge* eMaxPair = GetMaximaPair(e);\n IsMaximaEdge = (!eMaxPair || !IsHorizontal(*eMaxPair));\n }\n\n if(IsMaximaEdge)\n {\n TEdge* ePrev = e->PrevInAEL;\n DoMaxima(e);\n if( !ePrev ) e = m_ActiveEdges;\n else e = ePrev->NextInAEL;\n }\n else\n {\n //2. promote horizontal edges, otherwise update Curr.X and Curr.Y ...\n if (IsIntermediate(e, topY) && IsHorizontal(*e->NextInLML))\n {\n UpdateEdgeIntoAEL(e);\n if (e->OutIdx >= 0)\n AddOutPt(e, e->Bot);\n AddEdgeToSEL(e);\n } \n else\n {\n e->Curr.X = TopX( *e, topY );\n e->Curr.Y = topY;\n }\n\n if (m_StrictSimple)\n { \n TEdge* ePrev = e->PrevInAEL;\n if ((e->OutIdx >= 0) && (e->WindDelta != 0) && ePrev && (ePrev->OutIdx >= 0) &&\n (ePrev->Curr.X == e->Curr.X) && (ePrev->WindDelta != 0))\n {\n IntPoint pt = e->Curr;\n#ifdef use_xyz\n SetZ(pt, *ePrev, *e);\n#endif\n OutPt* op = AddOutPt(ePrev, pt);\n OutPt* op2 = AddOutPt(e, pt);\n AddJoin(op, op2, pt); //StrictlySimple (type-3) join\n }\n }\n\n e = e->NextInAEL;\n }\n }\n\n //3. Process horizontals at the Top of the scanbeam ...\n ProcessHorizontals(true);\n\n //4. Promote intermediate vertices ...\n e = m_ActiveEdges;\n while(e)\n {\n if(IsIntermediate(e, topY))\n {\n OutPt* op = 0;\n if( e->OutIdx >= 0 ) \n op = AddOutPt(e, e->Top);\n UpdateEdgeIntoAEL(e);\n\n //if output polygons share an edge, they'll need joining later ...\n TEdge* ePrev = e->PrevInAEL;\n TEdge* eNext = e->NextInAEL;\n if (ePrev && ePrev->Curr.X == e->Bot.X &&\n ePrev->Curr.Y == e->Bot.Y && op &&\n ePrev->OutIdx >= 0 && ePrev->Curr.Y > ePrev->Top.Y &&\n SlopesEqual(*e, *ePrev, m_UseFullRange) &&\n (e->WindDelta != 0) && (ePrev->WindDelta != 0))\n {\n OutPt* op2 = AddOutPt(ePrev, e->Bot);\n AddJoin(op, op2, e->Top);\n }\n else if (eNext && eNext->Curr.X == e->Bot.X &&\n eNext->Curr.Y == e->Bot.Y && op &&\n eNext->OutIdx >= 0 && eNext->Curr.Y > eNext->Top.Y &&\n SlopesEqual(*e, *eNext, m_UseFullRange) &&\n (e->WindDelta != 0) && (eNext->WindDelta != 0))\n {\n OutPt* op2 = AddOutPt(eNext, e->Bot);\n AddJoin(op, op2, e->Top);\n }\n }\n e = e->NextInAEL;\n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::FixupOutPolygon(OutRec &outrec)\n{\n //FixupOutPolygon() - removes duplicate points and simplifies consecutive\n //parallel edges by removing the middle vertex.\n OutPt *lastOK = 0;\n outrec.BottomPt = 0;\n OutPt *pp = outrec.Pts;\n\n for (;;)\n {\n if (pp->Prev == pp || pp->Prev == pp->Next )\n {\n DisposeOutPts(pp);\n outrec.Pts = 0;\n return;\n }\n\n //test for duplicate points and collinear edges ...\n if ((pp->Pt == pp->Next->Pt) || (pp->Pt == pp->Prev->Pt) || \n (SlopesEqual(pp->Prev->Pt, pp->Pt, pp->Next->Pt, m_UseFullRange) &&\n (!m_PreserveCollinear || \n !Pt2IsBetweenPt1AndPt3(pp->Prev->Pt, pp->Pt, pp->Next->Pt))))\n {\n lastOK = 0;\n OutPt *tmp = pp;\n pp->Prev->Next = pp->Next;\n pp->Next->Prev = pp->Prev;\n pp = pp->Prev;\n delete tmp;\n }\n else if (pp == lastOK) break;\n else\n {\n if (!lastOK) lastOK = pp;\n pp = pp->Next;\n }\n }\n outrec.Pts = pp;\n}\n//------------------------------------------------------------------------------\n\nint PointCount(OutPt *Pts)\n{\n if (!Pts) return 0;\n int result = 0;\n OutPt* p = Pts;\n do\n {\n result++;\n p = p->Next;\n }\n while (p != Pts);\n return result;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::BuildResult(Paths &polys)\n{\n polys.reserve(m_PolyOuts.size());\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)\n {\n if (!m_PolyOuts[i]->Pts) continue;\n Path pg;\n OutPt* p = m_PolyOuts[i]->Pts->Prev;\n int cnt = PointCount(p);\n if (cnt < 2) continue;\n pg.reserve(cnt);\n for (int i = 0; i < cnt; ++i)\n {\n pg.push_back(p->Pt);\n p = p->Prev;\n }\n polys.push_back(pg);\n }\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::BuildResult2(PolyTree& polytree)\n{\n polytree.Clear();\n polytree.AllNodes.reserve(m_PolyOuts.size());\n //add each output polygon/contour to polytree ...\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); i++)\n {\n OutRec* outRec = m_PolyOuts[i];\n int cnt = PointCount(outRec->Pts);\n if ((outRec->IsOpen && cnt < 2) || (!outRec->IsOpen && cnt < 3)) continue;\n FixHoleLinkage(*outRec);\n PolyNode* pn = new PolyNode();\n //nb: polytree takes ownership of all the PolyNodes\n polytree.AllNodes.push_back(pn);\n outRec->PolyNd = pn;\n pn->Parent = 0;\n pn->Index = 0;\n pn->Contour.reserve(cnt);\n OutPt *op = outRec->Pts->Prev;\n for (int j = 0; j < cnt; j++)\n {\n pn->Contour.push_back(op->Pt);\n op = op->Prev;\n }\n }\n\n //fixup PolyNode links etc ...\n polytree.Childs.reserve(m_PolyOuts.size());\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); i++)\n {\n OutRec* outRec = m_PolyOuts[i];\n if (!outRec->PolyNd) continue;\n if (outRec->IsOpen) \n {\n outRec->PolyNd->m_IsOpen = true;\n polytree.AddChild(*outRec->PolyNd);\n }\n else if (outRec->FirstLeft && outRec->FirstLeft->PolyNd) \n outRec->FirstLeft->PolyNd->AddChild(*outRec->PolyNd);\n else\n polytree.AddChild(*outRec->PolyNd);\n }\n}\n//------------------------------------------------------------------------------\n\nvoid SwapIntersectNodes(IntersectNode &int1, IntersectNode &int2)\n{\n //just swap the contents (because fIntersectNodes is a single-linked-list)\n IntersectNode inode = int1; //gets a copy of Int1\n int1.Edge1 = int2.Edge1;\n int1.Edge2 = int2.Edge2;\n int1.Pt = int2.Pt;\n int2.Edge1 = inode.Edge1;\n int2.Edge2 = inode.Edge2;\n int2.Pt = inode.Pt;\n}\n//------------------------------------------------------------------------------\n\ninline bool E2InsertsBeforeE1(TEdge &e1, TEdge &e2)\n{\n if (e2.Curr.X == e1.Curr.X) \n {\n if (e2.Top.Y > e1.Top.Y)\n return e2.Top.X < TopX(e1, e2.Top.Y); \n else return e1.Top.X > TopX(e2, e1.Top.Y);\n } \n else return e2.Curr.X < e1.Curr.X;\n}\n//------------------------------------------------------------------------------\n\nbool GetOverlap(const cInt a1, const cInt a2, const cInt b1, const cInt b2, \n cInt& Left, cInt& Right)\n{\n if (a1 < a2)\n {\n if (b1 < b2) {Left = std::max(a1,b1); Right = std::min(a2,b2);}\n else {Left = std::max(a1,b2); Right = std::min(a2,b1);}\n } \n else\n {\n if (b1 < b2) {Left = std::max(a2,b1); Right = std::min(a1,b2);}\n else {Left = std::max(a2,b2); Right = std::min(a1,b1);}\n }\n return Left < Right;\n}\n//------------------------------------------------------------------------------\n\ninline void UpdateOutPtIdxs(OutRec& outrec)\n{ \n OutPt* op = outrec.Pts;\n do\n {\n op->Idx = outrec.Idx;\n op = op->Prev;\n }\n while(op != outrec.Pts);\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::InsertEdgeIntoAEL(TEdge *edge, TEdge* startEdge)\n{\n if(!m_ActiveEdges)\n {\n edge->PrevInAEL = 0;\n edge->NextInAEL = 0;\n m_ActiveEdges = edge;\n }\n else if(!startEdge && E2InsertsBeforeE1(*m_ActiveEdges, *edge))\n {\n edge->PrevInAEL = 0;\n edge->NextInAEL = m_ActiveEdges;\n m_ActiveEdges->PrevInAEL = edge;\n m_ActiveEdges = edge;\n } \n else\n {\n if(!startEdge) startEdge = m_ActiveEdges;\n while(startEdge->NextInAEL && \n !E2InsertsBeforeE1(*startEdge->NextInAEL , *edge))\n startEdge = startEdge->NextInAEL;\n edge->NextInAEL = startEdge->NextInAEL;\n if(startEdge->NextInAEL) startEdge->NextInAEL->PrevInAEL = edge;\n edge->PrevInAEL = startEdge;\n startEdge->NextInAEL = edge;\n }\n}\n//----------------------------------------------------------------------\n\nOutPt* DupOutPt(OutPt* outPt, bool InsertAfter)\n{\n OutPt* result = new OutPt;\n result->Pt = outPt->Pt;\n result->Idx = outPt->Idx;\n if (InsertAfter)\n {\n result->Next = outPt->Next;\n result->Prev = outPt;\n outPt->Next->Prev = result;\n outPt->Next = result;\n } \n else\n {\n result->Prev = outPt->Prev;\n result->Next = outPt;\n outPt->Prev->Next = result;\n outPt->Prev = result;\n }\n return result;\n}\n//------------------------------------------------------------------------------\n\nbool JoinHorz(OutPt* op1, OutPt* op1b, OutPt* op2, OutPt* op2b,\n const IntPoint Pt, bool DiscardLeft)\n{\n Direction Dir1 = (op1->Pt.X > op1b->Pt.X ? dRightToLeft : dLeftToRight);\n Direction Dir2 = (op2->Pt.X > op2b->Pt.X ? dRightToLeft : dLeftToRight);\n if (Dir1 == Dir2) return false;\n\n //When DiscardLeft, we want Op1b to be on the Left of Op1, otherwise we\n //want Op1b to be on the Right. (And likewise with Op2 and Op2b.)\n //So, to facilitate this while inserting Op1b and Op2b ...\n //when DiscardLeft, make sure we're AT or RIGHT of Pt before adding Op1b,\n //otherwise make sure we're AT or LEFT of Pt. (Likewise with Op2b.)\n if (Dir1 == dLeftToRight) \n {\n while (op1->Next->Pt.X <= Pt.X && \n op1->Next->Pt.X >= op1->Pt.X && op1->Next->Pt.Y == Pt.Y) \n op1 = op1->Next;\n if (DiscardLeft && (op1->Pt.X != Pt.X)) op1 = op1->Next;\n op1b = DupOutPt(op1, !DiscardLeft);\n if (op1b->Pt != Pt) \n {\n op1 = op1b;\n op1->Pt = Pt;\n op1b = DupOutPt(op1, !DiscardLeft);\n }\n } \n else\n {\n while (op1->Next->Pt.X >= Pt.X && \n op1->Next->Pt.X <= op1->Pt.X && op1->Next->Pt.Y == Pt.Y) \n op1 = op1->Next;\n if (!DiscardLeft && (op1->Pt.X != Pt.X)) op1 = op1->Next;\n op1b = DupOutPt(op1, DiscardLeft);\n if (op1b->Pt != Pt)\n {\n op1 = op1b;\n op1->Pt = Pt;\n op1b = DupOutPt(op1, DiscardLeft);\n }\n }\n\n if (Dir2 == dLeftToRight)\n {\n while (op2->Next->Pt.X <= Pt.X && \n op2->Next->Pt.X >= op2->Pt.X && op2->Next->Pt.Y == Pt.Y)\n op2 = op2->Next;\n if (DiscardLeft && (op2->Pt.X != Pt.X)) op2 = op2->Next;\n op2b = DupOutPt(op2, !DiscardLeft);\n if (op2b->Pt != Pt)\n {\n op2 = op2b;\n op2->Pt = Pt;\n op2b = DupOutPt(op2, !DiscardLeft);\n };\n } else\n {\n while (op2->Next->Pt.X >= Pt.X && \n op2->Next->Pt.X <= op2->Pt.X && op2->Next->Pt.Y == Pt.Y) \n op2 = op2->Next;\n if (!DiscardLeft && (op2->Pt.X != Pt.X)) op2 = op2->Next;\n op2b = DupOutPt(op2, DiscardLeft);\n if (op2b->Pt != Pt)\n {\n op2 = op2b;\n op2->Pt = Pt;\n op2b = DupOutPt(op2, DiscardLeft);\n };\n };\n\n if ((Dir1 == dLeftToRight) == DiscardLeft)\n {\n op1->Prev = op2;\n op2->Next = op1;\n op1b->Next = op2b;\n op2b->Prev = op1b;\n }\n else\n {\n op1->Next = op2;\n op2->Prev = op1;\n op1b->Prev = op2b;\n op2b->Next = op1b;\n }\n return true;\n}\n//------------------------------------------------------------------------------\n\nbool Clipper::JoinPoints(Join *j, OutRec* outRec1, OutRec* outRec2)\n{\n OutPt *op1 = j->OutPt1, *op1b;\n OutPt *op2 = j->OutPt2, *op2b;\n\n //There are 3 kinds of joins for output polygons ...\n //1. Horizontal joins where Join.OutPt1 & Join.OutPt2 are a vertices anywhere\n //along (horizontal) collinear edges (& Join.OffPt is on the same horizontal).\n //2. Non-horizontal joins where Join.OutPt1 & Join.OutPt2 are at the same\n //location at the Bottom of the overlapping segment (& Join.OffPt is above).\n //3. StrictSimple joins where edges touch but are not collinear and where\n //Join.OutPt1, Join.OutPt2 & Join.OffPt all share the same point.\n bool isHorizontal = (j->OutPt1->Pt.Y == j->OffPt.Y);\n\n if (isHorizontal && (j->OffPt == j->OutPt1->Pt) &&\n (j->OffPt == j->OutPt2->Pt))\n {\n //Strictly Simple join ...\n if (outRec1 != outRec2) return false;\n op1b = j->OutPt1->Next;\n while (op1b != op1 && (op1b->Pt == j->OffPt)) \n op1b = op1b->Next;\n bool reverse1 = (op1b->Pt.Y > j->OffPt.Y);\n op2b = j->OutPt2->Next;\n while (op2b != op2 && (op2b->Pt == j->OffPt)) \n op2b = op2b->Next;\n bool reverse2 = (op2b->Pt.Y > j->OffPt.Y);\n if (reverse1 == reverse2) return false;\n if (reverse1)\n {\n op1b = DupOutPt(op1, false);\n op2b = DupOutPt(op2, true);\n op1->Prev = op2;\n op2->Next = op1;\n op1b->Next = op2b;\n op2b->Prev = op1b;\n j->OutPt1 = op1;\n j->OutPt2 = op1b;\n return true;\n } else\n {\n op1b = DupOutPt(op1, true);\n op2b = DupOutPt(op2, false);\n op1->Next = op2;\n op2->Prev = op1;\n op1b->Prev = op2b;\n op2b->Next = op1b;\n j->OutPt1 = op1;\n j->OutPt2 = op1b;\n return true;\n }\n } \n else if (isHorizontal)\n {\n //treat horizontal joins differently to non-horizontal joins since with\n //them we're not yet sure where the overlapping is. OutPt1.Pt & OutPt2.Pt\n //may be anywhere along the horizontal edge.\n op1b = op1;\n while (op1->Prev->Pt.Y == op1->Pt.Y && op1->Prev != op1b && op1->Prev != op2)\n op1 = op1->Prev;\n while (op1b->Next->Pt.Y == op1b->Pt.Y && op1b->Next != op1 && op1b->Next != op2)\n op1b = op1b->Next;\n if (op1b->Next == op1 || op1b->Next == op2) return false; //a flat 'polygon'\n\n op2b = op2;\n while (op2->Prev->Pt.Y == op2->Pt.Y && op2->Prev != op2b && op2->Prev != op1b)\n op2 = op2->Prev;\n while (op2b->Next->Pt.Y == op2b->Pt.Y && op2b->Next != op2 && op2b->Next != op1)\n op2b = op2b->Next;\n if (op2b->Next == op2 || op2b->Next == op1) return false; //a flat 'polygon'\n\n cInt Left, Right;\n //Op1 --> Op1b & Op2 --> Op2b are the extremites of the horizontal edges\n if (!GetOverlap(op1->Pt.X, op1b->Pt.X, op2->Pt.X, op2b->Pt.X, Left, Right))\n return false;\n\n //DiscardLeftSide: when overlapping edges are joined, a spike will created\n //which needs to be cleaned up. However, we don't want Op1 or Op2 caught up\n //on the discard Side as either may still be needed for other joins ...\n IntPoint Pt;\n bool DiscardLeftSide;\n if (op1->Pt.X >= Left && op1->Pt.X <= Right) \n {\n Pt = op1->Pt; DiscardLeftSide = (op1->Pt.X > op1b->Pt.X);\n } \n else if (op2->Pt.X >= Left&& op2->Pt.X <= Right) \n {\n Pt = op2->Pt; DiscardLeftSide = (op2->Pt.X > op2b->Pt.X);\n } \n else if (op1b->Pt.X >= Left && op1b->Pt.X <= Right)\n {\n Pt = op1b->Pt; DiscardLeftSide = op1b->Pt.X > op1->Pt.X;\n } \n else\n {\n Pt = op2b->Pt; DiscardLeftSide = (op2b->Pt.X > op2->Pt.X);\n }\n j->OutPt1 = op1; j->OutPt2 = op2;\n return JoinHorz(op1, op1b, op2, op2b, Pt, DiscardLeftSide);\n } else\n {\n //nb: For non-horizontal joins ...\n // 1. Jr.OutPt1.Pt.Y == Jr.OutPt2.Pt.Y\n // 2. Jr.OutPt1.Pt > Jr.OffPt.Y\n\n //make sure the polygons are correctly oriented ...\n op1b = op1->Next;\n while ((op1b->Pt == op1->Pt) && (op1b != op1)) op1b = op1b->Next;\n bool Reverse1 = ((op1b->Pt.Y > op1->Pt.Y) ||\n !SlopesEqual(op1->Pt, op1b->Pt, j->OffPt, m_UseFullRange));\n if (Reverse1)\n {\n op1b = op1->Prev;\n while ((op1b->Pt == op1->Pt) && (op1b != op1)) op1b = op1b->Prev;\n if ((op1b->Pt.Y > op1->Pt.Y) ||\n !SlopesEqual(op1->Pt, op1b->Pt, j->OffPt, m_UseFullRange)) return false;\n };\n op2b = op2->Next;\n while ((op2b->Pt == op2->Pt) && (op2b != op2))op2b = op2b->Next;\n bool Reverse2 = ((op2b->Pt.Y > op2->Pt.Y) ||\n !SlopesEqual(op2->Pt, op2b->Pt, j->OffPt, m_UseFullRange));\n if (Reverse2)\n {\n op2b = op2->Prev;\n while ((op2b->Pt == op2->Pt) && (op2b != op2)) op2b = op2b->Prev;\n if ((op2b->Pt.Y > op2->Pt.Y) ||\n !SlopesEqual(op2->Pt, op2b->Pt, j->OffPt, m_UseFullRange)) return false;\n }\n\n if ((op1b == op1) || (op2b == op2) || (op1b == op2b) ||\n ((outRec1 == outRec2) && (Reverse1 == Reverse2))) return false;\n\n if (Reverse1)\n {\n op1b = DupOutPt(op1, false);\n op2b = DupOutPt(op2, true);\n op1->Prev = op2;\n op2->Next = op1;\n op1b->Next = op2b;\n op2b->Prev = op1b;\n j->OutPt1 = op1;\n j->OutPt2 = op1b;\n return true;\n } else\n {\n op1b = DupOutPt(op1, true);\n op2b = DupOutPt(op2, false);\n op1->Next = op2;\n op2->Prev = op1;\n op1b->Prev = op2b;\n op2b->Next = op1b;\n j->OutPt1 = op1;\n j->OutPt2 = op1b;\n return true;\n }\n }\n}\n//----------------------------------------------------------------------\n\nstatic OutRec* ParseFirstLeft(OutRec* FirstLeft)\n{\n while (FirstLeft && !FirstLeft->Pts)\n FirstLeft = FirstLeft->FirstLeft;\n return FirstLeft;\n}\n//------------------------------------------------------------------------------\n\nvoid Clipper::FixupFirstLefts1(OutRec* OldOutRec, OutRec* NewOutRec)\n{ \n //tests if NewOutRec contains the polygon before reassigning FirstLeft\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)\n {\n OutRec* outRec = m_PolyOuts[i];\n if (!outRec->Pts || !outRec->FirstLeft) continue;\n OutRec* firstLeft = ParseFirstLeft(outRec->FirstLeft);\n if (firstLeft == OldOutRec)\n {\n if (Poly2ContainsPoly1(outRec->Pts, NewOutRec->Pts))\n outRec->FirstLeft = NewOutRec;\n }\n }\n}\n//----------------------------------------------------------------------\n\nvoid Clipper::FixupFirstLefts2(OutRec* OldOutRec, OutRec* NewOutRec)\n{ \n //reassigns FirstLeft WITHOUT testing if NewOutRec contains the polygon\n for (PolyOutList::size_type i = 0; i < m_PolyOuts.size(); ++i)\n {\n OutRec* outRec = m_PolyOuts[i];\n if (outRec->FirstLeft == OldOutRec) outRec->FirstLeft = NewOutRec;\n }\n}\n//----------------------------------------------------------------------\n\nvoid Clipper::JoinCommonEdges()\n{\n for (JoinList::size_type i = 0; i < m_Joins.size(); i++)\n {\n Join* join = m_Joins[i];\n\n OutRec *outRec1 = GetOutRec(join->OutPt1->Idx);\n OutRec *outRec2 = GetOutRec(join->OutPt2->Idx);\n\n if (!outRec1->Pts || !outRec2->Pts) continue;\n\n //get the polygon fragment with the correct hole state (FirstLeft)\n //before calling JoinPoints() ...\n OutRec *holeStateRec;\n if (outRec1 == outRec2) holeStateRec = outRec1;\n else if (Param1RightOfParam2(outRec1, outRec2)) holeStateRec = outRec2;\n else if (Param1RightOfParam2(outRec2, outRec1)) holeStateRec = outRec1;\n else holeStateRec = GetLowermostRec(outRec1, outRec2);\n\n if (!JoinPoints(join, outRec1, outRec2)) continue;\n\n if (outRec1 == outRec2)\n {\n //instead of joining two polygons, we've just created a new one by\n //splitting one polygon into two.\n outRec1->Pts = join->OutPt1;\n outRec1->BottomPt = 0;\n outRec2 = CreateOutRec();\n outRec2->Pts = join->OutPt2;\n\n //update all OutRec2.Pts Idx's ...\n UpdateOutPtIdxs(*outRec2);\n\n //We now need to check every OutRec.FirstLeft pointer. If it points\n //to OutRec1 it may need to point to OutRec2 instead ...\n if (m_UsingPolyTree)\n for (PolyOutList::size_type j = 0; j < m_PolyOuts.size() - 1; j++)\n {\n OutRec* oRec = m_PolyOuts[j];\n if (!oRec->Pts || ParseFirstLeft(oRec->FirstLeft) != outRec1 ||\n oRec->IsHole == outRec1->IsHole) continue;\n if (Poly2ContainsPoly1(oRec->Pts, join->OutPt2))\n oRec->FirstLeft = outRec2;\n }\n\n if (Poly2ContainsPoly1(outRec2->Pts, outRec1->Pts))\n {\n //outRec2 is contained by outRec1 ...\n outRec2->IsHole = !outRec1->IsHole;\n outRec2->FirstLeft = outRec1;\n\n //fixup FirstLeft pointers that may need reassigning to OutRec1\n if (m_UsingPolyTree) FixupFirstLefts2(outRec2, outRec1);\n\n if ((outRec2->IsHole ^ m_ReverseOutput) == (Area(*outRec2) > 0))\n ReversePolyPtLinks(outRec2->Pts);\n \n } else if (Poly2ContainsPoly1(outRec1->Pts, outRec2->Pts))\n {\n //outRec1 is contained by outRec2 ...\n outRec2->IsHole = outRec1->IsHole;\n outRec1->IsHole = !outRec2->IsHole;\n outRec2->FirstLeft = outRec1->FirstLeft;\n outRec1->FirstLeft = outRec2;\n\n //fixup FirstLeft pointers that may need reassigning to OutRec1\n if (m_UsingPolyTree) FixupFirstLefts2(outRec1, outRec2);\n\n if ((outRec1->IsHole ^ m_ReverseOutput) == (Area(*outRec1) > 0))\n ReversePolyPtLinks(outRec1->Pts);\n } \n else\n {\n //the 2 polygons are completely separate ...\n outRec2->IsHole = outRec1->IsHole;\n outRec2->FirstLeft = outRec1->FirstLeft;\n\n //fixup FirstLeft pointers that may need reassigning to OutRec2\n if (m_UsingPolyTree) FixupFirstLefts1(outRec1, outRec2);\n }\n \n } else\n {\n //joined 2 polygons together ...\n\n outRec2->Pts = 0;\n outRec2->BottomPt = 0;\n outRec2->Idx = outRec1->Idx;\n\n outRec1->IsHole = holeStateRec->IsHole;\n if (holeStateRec == outRec2) \n outRec1->FirstLeft = outRec2->FirstLeft;\n outRec2->FirstLeft = outRec1;\n\n //fixup FirstLeft pointers that may need reassigning to OutRec1\n if (m_UsingPolyTree) FixupFirstLefts2(outRec2, outRec1);\n }\n }\n}\n\n//------------------------------------------------------------------------------\n// ClipperOffset support functions ...\n//------------------------------------------------------------------------------\n\nDoublePoint GetUnitNormal(const IntPoint &pt1, const IntPoint &pt2)\n{\n if(pt2.X == pt1.X && pt2.Y == pt1.Y) \n return DoublePoint(0, 0);\n\n double Dx = (double)(pt2.X - pt1.X);\n double dy = (double)(pt2.Y - pt1.Y);\n double f = 1 *1.0/ std::sqrt( Dx*Dx + dy*dy );\n Dx *= f;\n dy *= f;\n return DoublePoint(dy, -Dx);\n}\n\n//------------------------------------------------------------------------------\n// ClipperOffset class\n//------------------------------------------------------------------------------\n\nClipperOffset::ClipperOffset(double miterLimit, double arcTolerance)\n{\n this->MiterLimit = miterLimit;\n this->ArcTolerance = arcTolerance;\n m_lowest.X = -1;\n}\n//------------------------------------------------------------------------------\n\nClipperOffset::~ClipperOffset()\n{\n Clear();\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::Clear()\n{\n for (int i = 0; i < m_polyNodes.ChildCount(); ++i)\n delete m_polyNodes.Childs[i];\n m_polyNodes.Childs.clear();\n m_lowest.X = -1;\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::AddPath(const Path& path, JoinType joinType, EndType endType)\n{\n int highI = (int)path.size() - 1;\n if (highI < 0) return;\n PolyNode* newNode = new PolyNode();\n newNode->m_jointype = joinType;\n newNode->m_endtype = endType;\n\n //strip duplicate points from path and also get index to the lowest point ...\n if (endType == etClosedLine || endType == etClosedPolygon)\n while (highI > 0 && path[0] == path[highI]) highI--;\n newNode->Contour.reserve(highI + 1);\n newNode->Contour.push_back(path[0]);\n int j = 0, k = 0;\n for (int i = 1; i <= highI; i++)\n if (newNode->Contour[j] != path[i])\n {\n j++;\n newNode->Contour.push_back(path[i]);\n if (path[i].Y > newNode->Contour[k].Y ||\n (path[i].Y == newNode->Contour[k].Y &&\n path[i].X < newNode->Contour[k].X)) k = j;\n }\n if (endType == etClosedPolygon && j < 2)\n {\n delete newNode;\n return;\n }\n m_polyNodes.AddChild(*newNode);\n\n //if this path's lowest pt is lower than all the others then update m_lowest\n if (endType != etClosedPolygon) return;\n if (m_lowest.X < 0)\n m_lowest = IntPoint(m_polyNodes.ChildCount() - 1, k);\n else\n {\n IntPoint ip = m_polyNodes.Childs[(int)m_lowest.X]->Contour[(int)m_lowest.Y];\n if (newNode->Contour[k].Y > ip.Y ||\n (newNode->Contour[k].Y == ip.Y &&\n newNode->Contour[k].X < ip.X))\n m_lowest = IntPoint(m_polyNodes.ChildCount() - 1, k);\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::AddPaths(const Paths& paths, JoinType joinType, EndType endType)\n{\n for (Paths::size_type i = 0; i < paths.size(); ++i)\n AddPath(paths[i], joinType, endType);\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::FixOrientations()\n{\n //fixup orientations of all closed paths if the orientation of the\n //closed path with the lowermost vertex is wrong ...\n if (m_lowest.X >= 0 && \n !Orientation(m_polyNodes.Childs[(int)m_lowest.X]->Contour))\n {\n for (int i = 0; i < m_polyNodes.ChildCount(); ++i)\n {\n PolyNode& node = *m_polyNodes.Childs[i];\n if (node.m_endtype == etClosedPolygon ||\n (node.m_endtype == etClosedLine && Orientation(node.Contour)))\n ReversePath(node.Contour);\n }\n } else\n {\n for (int i = 0; i < m_polyNodes.ChildCount(); ++i)\n {\n PolyNode& node = *m_polyNodes.Childs[i];\n if (node.m_endtype == etClosedLine && !Orientation(node.Contour))\n ReversePath(node.Contour);\n }\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::Execute(Paths& solution, double delta)\n{\n solution.clear();\n FixOrientations();\n DoOffset(delta);\n \n //now clean up 'corners' ...\n Clipper clpr;\n clpr.AddPaths(m_destPolys, ptSubject, true);\n if (delta > 0)\n {\n clpr.Execute(ctUnion, solution, pftPositive, pftPositive);\n }\n else\n {\n IntRect r = clpr.GetBounds();\n Path outer(4);\n outer[0] = IntPoint(r.left - 10, r.bottom + 10);\n outer[1] = IntPoint(r.right + 10, r.bottom + 10);\n outer[2] = IntPoint(r.right + 10, r.top - 10);\n outer[3] = IntPoint(r.left - 10, r.top - 10);\n\n clpr.AddPath(outer, ptSubject, true);\n clpr.ReverseSolution(true);\n clpr.Execute(ctUnion, solution, pftNegative, pftNegative);\n if (solution.size() > 0) solution.erase(solution.begin());\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::Execute(PolyTree& solution, double delta)\n{\n solution.Clear();\n FixOrientations();\n DoOffset(delta);\n\n //now clean up 'corners' ...\n Clipper clpr;\n clpr.AddPaths(m_destPolys, ptSubject, true);\n if (delta > 0)\n {\n clpr.Execute(ctUnion, solution, pftPositive, pftPositive);\n }\n else\n {\n IntRect r = clpr.GetBounds();\n Path outer(4);\n outer[0] = IntPoint(r.left - 10, r.bottom + 10);\n outer[1] = IntPoint(r.right + 10, r.bottom + 10);\n outer[2] = IntPoint(r.right + 10, r.top - 10);\n outer[3] = IntPoint(r.left - 10, r.top - 10);\n\n clpr.AddPath(outer, ptSubject, true);\n clpr.ReverseSolution(true);\n clpr.Execute(ctUnion, solution, pftNegative, pftNegative);\n //remove the outer PolyNode rectangle ...\n if (solution.ChildCount() == 1 && solution.Childs[0]->ChildCount() > 0)\n {\n PolyNode* outerNode = solution.Childs[0];\n solution.Childs.reserve(outerNode->ChildCount());\n solution.Childs[0] = outerNode->Childs[0];\n solution.Childs[0]->Parent = outerNode->Parent;\n for (int i = 1; i < outerNode->ChildCount(); ++i)\n solution.AddChild(*outerNode->Childs[i]);\n }\n else\n solution.Clear();\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::DoOffset(double delta)\n{\n m_destPolys.clear();\n m_delta = delta;\n\n //if Zero offset, just copy any CLOSED polygons to m_p and return ...\n if (NEAR_ZERO(delta)) \n {\n m_destPolys.reserve(m_polyNodes.ChildCount());\n for (int i = 0; i < m_polyNodes.ChildCount(); i++)\n {\n PolyNode& node = *m_polyNodes.Childs[i];\n if (node.m_endtype == etClosedPolygon)\n m_destPolys.push_back(node.Contour);\n }\n return;\n }\n\n //see offset_triginometry3.svg in the documentation folder ...\n if (MiterLimit > 2) m_miterLim = 2/(MiterLimit * MiterLimit);\n else m_miterLim = 0.5;\n\n double y;\n if (ArcTolerance <= 0.0) y = def_arc_tolerance;\n else if (ArcTolerance > std::fabs(delta) * def_arc_tolerance) \n y = std::fabs(delta) * def_arc_tolerance;\n else y = ArcTolerance;\n //see offset_triginometry2.svg in the documentation folder ...\n double steps = pi / std::acos(1 - y / std::fabs(delta));\n if (steps > std::fabs(delta) * pi) \n steps = std::fabs(delta) * pi; //ie excessive precision check\n m_sin = std::sin(two_pi / steps);\n m_cos = std::cos(two_pi / steps);\n m_StepsPerRad = steps / two_pi;\n if (delta < 0.0) m_sin = -m_sin;\n\n m_destPolys.reserve(m_polyNodes.ChildCount() * 2);\n for (int i = 0; i < m_polyNodes.ChildCount(); i++)\n {\n PolyNode& node = *m_polyNodes.Childs[i];\n m_srcPoly = node.Contour;\n\n int len = (int)m_srcPoly.size();\n if (len == 0 || (delta <= 0 && (len < 3 || node.m_endtype != etClosedPolygon)))\n continue;\n\n m_destPoly.clear();\n if (len == 1)\n {\n if (node.m_jointype == jtRound)\n {\n double X = 1.0, Y = 0.0;\n for (cInt j = 1; j <= steps; j++)\n {\n m_destPoly.push_back(IntPoint(\n Round(m_srcPoly[0].X + X * delta),\n Round(m_srcPoly[0].Y + Y * delta)));\n double X2 = X;\n X = X * m_cos - m_sin * Y;\n Y = X2 * m_sin + Y * m_cos;\n }\n }\n else\n {\n double X = -1.0, Y = -1.0;\n for (int j = 0; j < 4; ++j)\n {\n m_destPoly.push_back(IntPoint(\n Round(m_srcPoly[0].X + X * delta),\n Round(m_srcPoly[0].Y + Y * delta)));\n if (X < 0) X = 1;\n else if (Y < 0) Y = 1;\n else X = -1;\n }\n }\n m_destPolys.push_back(m_destPoly);\n continue;\n }\n //build m_normals ...\n m_normals.clear();\n m_normals.reserve(len);\n for (int j = 0; j < len - 1; ++j)\n m_normals.push_back(GetUnitNormal(m_srcPoly[j], m_srcPoly[j + 1]));\n if (node.m_endtype == etClosedLine || node.m_endtype == etClosedPolygon)\n m_normals.push_back(GetUnitNormal(m_srcPoly[len - 1], m_srcPoly[0]));\n else\n m_normals.push_back(DoublePoint(m_normals[len - 2]));\n\n if (node.m_endtype == etClosedPolygon)\n {\n int k = len - 1;\n for (int j = 0; j < len; ++j)\n OffsetPoint(j, k, node.m_jointype);\n m_destPolys.push_back(m_destPoly);\n }\n else if (node.m_endtype == etClosedLine)\n {\n int k = len - 1;\n for (int j = 0; j < len; ++j)\n OffsetPoint(j, k, node.m_jointype);\n m_destPolys.push_back(m_destPoly);\n m_destPoly.clear();\n //re-build m_normals ...\n DoublePoint n = m_normals[len -1];\n for (int j = len - 1; j > 0; j--)\n m_normals[j] = DoublePoint(-m_normals[j - 1].X, -m_normals[j - 1].Y);\n m_normals[0] = DoublePoint(-n.X, -n.Y);\n k = 0;\n for (int j = len - 1; j >= 0; j--)\n OffsetPoint(j, k, node.m_jointype);\n m_destPolys.push_back(m_destPoly);\n }\n else\n {\n int k = 0;\n for (int j = 1; j < len - 1; ++j)\n OffsetPoint(j, k, node.m_jointype);\n\n IntPoint pt1;\n if (node.m_endtype == etOpenButt)\n {\n int j = len - 1;\n pt1 = IntPoint((cInt)Round(m_srcPoly[j].X + m_normals[j].X *\n delta), (cInt)Round(m_srcPoly[j].Y + m_normals[j].Y * delta));\n m_destPoly.push_back(pt1);\n pt1 = IntPoint((cInt)Round(m_srcPoly[j].X - m_normals[j].X *\n delta), (cInt)Round(m_srcPoly[j].Y - m_normals[j].Y * delta));\n m_destPoly.push_back(pt1);\n }\n else\n {\n int j = len - 1;\n k = len - 2;\n m_sinA = 0;\n m_normals[j] = DoublePoint(-m_normals[j].X, -m_normals[j].Y);\n if (node.m_endtype == etOpenSquare)\n DoSquare(j, k);\n else\n DoRound(j, k);\n }\n\n //re-build m_normals ...\n for (int j = len - 1; j > 0; j--)\n m_normals[j] = DoublePoint(-m_normals[j - 1].X, -m_normals[j - 1].Y);\n m_normals[0] = DoublePoint(-m_normals[1].X, -m_normals[1].Y);\n\n k = len - 1;\n for (int j = k - 1; j > 0; --j) OffsetPoint(j, k, node.m_jointype);\n\n if (node.m_endtype == etOpenButt)\n {\n pt1 = IntPoint((cInt)Round(m_srcPoly[0].X - m_normals[0].X * delta),\n (cInt)Round(m_srcPoly[0].Y - m_normals[0].Y * delta));\n m_destPoly.push_back(pt1);\n pt1 = IntPoint((cInt)Round(m_srcPoly[0].X + m_normals[0].X * delta),\n (cInt)Round(m_srcPoly[0].Y + m_normals[0].Y * delta));\n m_destPoly.push_back(pt1);\n }\n else\n {\n k = 1;\n m_sinA = 0;\n if (node.m_endtype == etOpenSquare)\n DoSquare(0, 1);\n else\n DoRound(0, 1);\n }\n m_destPolys.push_back(m_destPoly);\n }\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::OffsetPoint(int j, int& k, JoinType jointype)\n{\n //cross product ...\n m_sinA = (m_normals[k].X * m_normals[j].Y - m_normals[j].X * m_normals[k].Y);\n if (std::fabs(m_sinA * m_delta) < 1.0) \n {\n //dot product ...\n double cosA = (m_normals[k].X * m_normals[j].X + m_normals[j].Y * m_normals[k].Y ); \n if (cosA > 0) // angle => 0 degrees\n {\n m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].X + m_normals[k].X * m_delta),\n Round(m_srcPoly[j].Y + m_normals[k].Y * m_delta)));\n return; \n }\n //else angle => 180 degrees \n }\n else if (m_sinA > 1.0) m_sinA = 1.0;\n else if (m_sinA < -1.0) m_sinA = -1.0;\n\n if (m_sinA * m_delta < 0)\n {\n m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].X + m_normals[k].X * m_delta),\n Round(m_srcPoly[j].Y + m_normals[k].Y * m_delta)));\n m_destPoly.push_back(m_srcPoly[j]);\n m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].X + m_normals[j].X * m_delta),\n Round(m_srcPoly[j].Y + m_normals[j].Y * m_delta)));\n }\n else\n switch (jointype)\n {\n case jtMiter:\n {\n double r = 1 + (m_normals[j].X * m_normals[k].X +\n m_normals[j].Y * m_normals[k].Y);\n if (r >= m_miterLim) DoMiter(j, k, r); else DoSquare(j, k);\n break;\n }\n case jtSquare: DoSquare(j, k); break;\n case jtRound: DoRound(j, k); break;\n }\n k = j;\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::DoSquare(int j, int k)\n{\n double dx = std::tan(std::atan2(m_sinA,\n m_normals[k].X * m_normals[j].X + m_normals[k].Y * m_normals[j].Y) / 4);\n m_destPoly.push_back(IntPoint(\n Round(m_srcPoly[j].X + m_delta * (m_normals[k].X - m_normals[k].Y * dx)),\n Round(m_srcPoly[j].Y + m_delta * (m_normals[k].Y + m_normals[k].X * dx))));\n m_destPoly.push_back(IntPoint(\n Round(m_srcPoly[j].X + m_delta * (m_normals[j].X + m_normals[j].Y * dx)),\n Round(m_srcPoly[j].Y + m_delta * (m_normals[j].Y - m_normals[j].X * dx))));\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::DoMiter(int j, int k, double r)\n{\n double q = m_delta / r;\n m_destPoly.push_back(IntPoint(Round(m_srcPoly[j].X + (m_normals[k].X + m_normals[j].X) * q),\n Round(m_srcPoly[j].Y + (m_normals[k].Y + m_normals[j].Y) * q)));\n}\n//------------------------------------------------------------------------------\n\nvoid ClipperOffset::DoRound(int j, int k)\n{\n double a = std::atan2(m_sinA,\n m_normals[k].X * m_normals[j].X + m_normals[k].Y * m_normals[j].Y);\n int steps = std::max((int)Round(m_StepsPerRad * std::fabs(a)), 1);\n\n double X = m_normals[k].X, Y = m_normals[k].Y, X2;\n for (int i = 0; i < steps; ++i)\n {\n m_destPoly.push_back(IntPoint(\n Round(m_srcPoly[j].X + X * m_delta),\n Round(m_srcPoly[j].Y + Y * m_delta)));\n X2 = X;\n X = X * m_cos - m_sin * Y;\n Y = X2 * m_sin + Y * m_cos;\n }\n m_destPoly.push_back(IntPoint(\n Round(m_srcPoly[j].X + m_normals[j].X * m_delta),\n Round(m_srcPoly[j].Y + m_normals[j].Y * m_delta)));\n}\n\n//------------------------------------------------------------------------------\n// Miscellaneous public functions\n//------------------------------------------------------------------------------\n\nvoid Clipper::DoSimplePolygons()\n{\n PolyOutList::size_type i = 0;\n while (i < m_PolyOuts.size()) \n {\n OutRec* outrec = m_PolyOuts[i++];\n OutPt* op = outrec->Pts;\n if (!op || outrec->IsOpen) continue;\n do //for each Pt in Polygon until duplicate found do ...\n {\n OutPt* op2 = op->Next;\n while (op2 != outrec->Pts) \n {\n if ((op->Pt == op2->Pt) && op2->Next != op && op2->Prev != op) \n {\n //split the polygon into two ...\n OutPt* op3 = op->Prev;\n OutPt* op4 = op2->Prev;\n op->Prev = op4;\n op4->Next = op;\n op2->Prev = op3;\n op3->Next = op2;\n\n outrec->Pts = op;\n OutRec* outrec2 = CreateOutRec();\n outrec2->Pts = op2;\n UpdateOutPtIdxs(*outrec2);\n if (Poly2ContainsPoly1(outrec2->Pts, outrec->Pts))\n {\n //OutRec2 is contained by OutRec1 ...\n outrec2->IsHole = !outrec->IsHole;\n outrec2->FirstLeft = outrec;\n if (m_UsingPolyTree) FixupFirstLefts2(outrec2, outrec);\n }\n else\n if (Poly2ContainsPoly1(outrec->Pts, outrec2->Pts))\n {\n //OutRec1 is contained by OutRec2 ...\n outrec2->IsHole = outrec->IsHole;\n outrec->IsHole = !outrec2->IsHole;\n outrec2->FirstLeft = outrec->FirstLeft;\n outrec->FirstLeft = outrec2;\n if (m_UsingPolyTree) FixupFirstLefts2(outrec, outrec2);\n }\n else\n {\n //the 2 polygons are separate ...\n outrec2->IsHole = outrec->IsHole;\n outrec2->FirstLeft = outrec->FirstLeft;\n if (m_UsingPolyTree) FixupFirstLefts1(outrec, outrec2);\n }\n op2 = op; //ie get ready for the Next iteration\n }\n op2 = op2->Next;\n }\n op = op->Next;\n }\n while (op != outrec->Pts);\n }\n}\n//------------------------------------------------------------------------------\n\nvoid ReversePath(Path& p)\n{\n std::reverse(p.begin(), p.end());\n}\n//------------------------------------------------------------------------------\n\nvoid ReversePaths(Paths& p)\n{\n for (Paths::size_type i = 0; i < p.size(); ++i)\n ReversePath(p[i]);\n}\n//------------------------------------------------------------------------------\n\nvoid SimplifyPolygon(const Path &in_poly, Paths &out_polys, PolyFillType fillType)\n{\n Clipper c;\n c.StrictlySimple(true);\n c.AddPath(in_poly, ptSubject, true);\n c.Execute(ctUnion, out_polys, fillType, fillType);\n}\n//------------------------------------------------------------------------------\n\nvoid SimplifyPolygons(const Paths &in_polys, Paths &out_polys, PolyFillType fillType)\n{\n Clipper c;\n c.StrictlySimple(true);\n c.AddPaths(in_polys, ptSubject, true);\n c.Execute(ctUnion, out_polys, fillType, fillType);\n}\n//------------------------------------------------------------------------------\n\nvoid SimplifyPolygons(Paths &polys, PolyFillType fillType)\n{\n SimplifyPolygons(polys, polys, fillType);\n}\n//------------------------------------------------------------------------------\n\ninline double DistanceSqrd(const IntPoint& pt1, const IntPoint& pt2)\n{\n double Dx = ((double)pt1.X - pt2.X);\n double dy = ((double)pt1.Y - pt2.Y);\n return (Dx*Dx + dy*dy);\n}\n//------------------------------------------------------------------------------\n\ndouble DistanceFromLineSqrd(\n const IntPoint& pt, const IntPoint& ln1, const IntPoint& ln2)\n{\n //The equation of a line in general form (Ax + By + C = 0)\n //given 2 points (x,y) & (x,y) is ...\n //(y - y)x + (x - x)y + (y - y)x - (x - x)y = 0\n //A = (y - y); B = (x - x); C = (y - y)x - (x - x)y\n //perpendicular distance of point (x,y) = (Ax + By + C)/Sqrt(A + B)\n //see http://en.wikipedia.org/wiki/Perpendicular_distance\n double A = double(ln1.Y - ln2.Y);\n double B = double(ln2.X - ln1.X);\n double C = A * ln1.X + B * ln1.Y;\n C = A * pt.X + B * pt.Y - C;\n return (C * C) / (A * A + B * B);\n}\n//---------------------------------------------------------------------------\n\nbool SlopesNearCollinear(const IntPoint& pt1, \n const IntPoint& pt2, const IntPoint& pt3, double distSqrd)\n{\n //this function is more accurate when the point that's geometrically\n //between the other 2 points is the one that's tested for distance.\n //ie makes it more likely to pick up 'spikes' ...\n\tif (Abs(pt1.X - pt2.X) > Abs(pt1.Y - pt2.Y))\n\t{\n if ((pt1.X > pt2.X) == (pt1.X < pt3.X))\n return DistanceFromLineSqrd(pt1, pt2, pt3) < distSqrd;\n else if ((pt2.X > pt1.X) == (pt2.X < pt3.X))\n return DistanceFromLineSqrd(pt2, pt1, pt3) < distSqrd;\n\t\telse\n\t return DistanceFromLineSqrd(pt3, pt1, pt2) < distSqrd;\n\t}\n\telse\n\t{\n if ((pt1.Y > pt2.Y) == (pt1.Y < pt3.Y))\n return DistanceFromLineSqrd(pt1, pt2, pt3) < distSqrd;\n else if ((pt2.Y > pt1.Y) == (pt2.Y < pt3.Y))\n return DistanceFromLineSqrd(pt2, pt1, pt3) < distSqrd;\n\t\telse\n return DistanceFromLineSqrd(pt3, pt1, pt2) < distSqrd;\n\t}\n}\n//------------------------------------------------------------------------------\n\nbool PointsAreClose(IntPoint pt1, IntPoint pt2, double distSqrd)\n{\n double Dx = (double)pt1.X - pt2.X;\n double dy = (double)pt1.Y - pt2.Y;\n return ((Dx * Dx) + (dy * dy) <= distSqrd);\n}\n//------------------------------------------------------------------------------\n\nOutPt* ExcludeOp(OutPt* op)\n{\n OutPt* result = op->Prev;\n result->Next = op->Next;\n op->Next->Prev = result;\n result->Idx = 0;\n return result;\n}\n//------------------------------------------------------------------------------\n\nvoid CleanPolygon(const Path& in_poly, Path& out_poly, double distance)\n{\n //distance = proximity in units/pixels below which vertices\n //will be stripped. Default ~= sqrt(2).\n \n size_t size = in_poly.size();\n \n if (size == 0) \n {\n out_poly.clear();\n return;\n }\n\n OutPt* outPts = new OutPt[size];\n for (size_t i = 0; i < size; ++i)\n {\n outPts[i].Pt = in_poly[i];\n outPts[i].Next = &outPts[(i + 1) % size];\n outPts[i].Next->Prev = &outPts[i];\n outPts[i].Idx = 0;\n }\n\n double distSqrd = distance * distance;\n OutPt* op = &outPts[0];\n while (op->Idx == 0 && op->Next != op->Prev) \n {\n if (PointsAreClose(op->Pt, op->Prev->Pt, distSqrd))\n {\n op = ExcludeOp(op);\n size--;\n } \n else if (PointsAreClose(op->Prev->Pt, op->Next->Pt, distSqrd))\n {\n ExcludeOp(op->Next);\n op = ExcludeOp(op);\n size -= 2;\n }\n else if (SlopesNearCollinear(op->Prev->Pt, op->Pt, op->Next->Pt, distSqrd))\n {\n op = ExcludeOp(op);\n size--;\n }\n else\n {\n op->Idx = 1;\n op = op->Next;\n }\n }\n\n if (size < 3) size = 0;\n out_poly.resize(size);\n for (size_t i = 0; i < size; ++i)\n {\n out_poly[i] = op->Pt;\n op = op->Next;\n }\n delete [] outPts;\n}\n//------------------------------------------------------------------------------\n\nvoid CleanPolygon(Path& poly, double distance)\n{\n CleanPolygon(poly, poly, distance);\n}\n//------------------------------------------------------------------------------\n\nvoid CleanPolygons(const Paths& in_polys, Paths& out_polys, double distance)\n{\n for (Paths::size_type i = 0; i < in_polys.size(); ++i)\n CleanPolygon(in_polys[i], out_polys[i], distance);\n}\n//------------------------------------------------------------------------------\n\nvoid CleanPolygons(Paths& polys, double distance)\n{\n CleanPolygons(polys, polys, distance);\n}\n//------------------------------------------------------------------------------\n\nvoid Minkowski(const Path& poly, const Path& path, \n Paths& solution, bool isSum, bool isClosed)\n{\n int delta = (isClosed ? 1 : 0);\n size_t polyCnt = poly.size();\n size_t pathCnt = path.size();\n Paths pp;\n pp.reserve(pathCnt);\n if (isSum)\n for (size_t i = 0; i < pathCnt; ++i)\n {\n Path p;\n p.reserve(polyCnt);\n for (size_t j = 0; j < poly.size(); ++j)\n p.push_back(IntPoint(path[i].X + poly[j].X, path[i].Y + poly[j].Y));\n pp.push_back(p);\n }\n else\n for (size_t i = 0; i < pathCnt; ++i)\n {\n Path p;\n p.reserve(polyCnt);\n for (size_t j = 0; j < poly.size(); ++j)\n p.push_back(IntPoint(path[i].X - poly[j].X, path[i].Y - poly[j].Y));\n pp.push_back(p);\n }\n\n solution.clear();\n solution.reserve((pathCnt + delta) * (polyCnt + 1));\n for (size_t i = 0; i < pathCnt - 1 + delta; ++i)\n for (size_t j = 0; j < polyCnt; ++j)\n {\n Path quad;\n quad.reserve(4);\n quad.push_back(pp[i % pathCnt][j % polyCnt]);\n quad.push_back(pp[(i + 1) % pathCnt][j % polyCnt]);\n quad.push_back(pp[(i + 1) % pathCnt][(j + 1) % polyCnt]);\n quad.push_back(pp[i % pathCnt][(j + 1) % polyCnt]);\n if (!Orientation(quad)) ReversePath(quad);\n solution.push_back(quad);\n }\n}\n//------------------------------------------------------------------------------\n\nvoid MinkowskiSum(const Path& pattern, const Path& path, Paths& solution, bool pathIsClosed)\n{\n Minkowski(pattern, path, solution, true, pathIsClosed);\n Clipper c;\n c.AddPaths(solution, ptSubject, true);\n c.Execute(ctUnion, solution, pftNonZero, pftNonZero);\n}\n//------------------------------------------------------------------------------\n\nvoid TranslatePath(const Path& input, Path& output, IntPoint delta) \n{\n //precondition: input != output\n output.resize(input.size());\n for (size_t i = 0; i < input.size(); ++i)\n output[i] = IntPoint(input[i].X + delta.X, input[i].Y + delta.Y);\n}\n//------------------------------------------------------------------------------\n\nvoid MinkowskiSum(const Path& pattern, const Paths& paths, Paths& solution, bool pathIsClosed)\n{\n Clipper c;\n for (size_t i = 0; i < paths.size(); ++i)\n {\n Paths tmp;\n Minkowski(pattern, paths[i], tmp, true, pathIsClosed);\n c.AddPaths(tmp, ptSubject, true);\n if (pathIsClosed)\n {\n Path tmp2;\n TranslatePath(paths[i], tmp2, pattern[0]);\n c.AddPath(tmp2, ptClip, true);\n }\n }\n c.Execute(ctUnion, solution, pftNonZero, pftNonZero);\n}\n//------------------------------------------------------------------------------\n\nvoid MinkowskiDiff(const Path& poly1, const Path& poly2, Paths& solution)\n{\n Minkowski(poly1, poly2, solution, false, true);\n Clipper c;\n c.AddPaths(solution, ptSubject, true);\n c.Execute(ctUnion, solution, pftNonZero, pftNonZero);\n}\n//------------------------------------------------------------------------------\n\nenum NodeType {ntAny, ntOpen, ntClosed};\n\nvoid AddPolyNodeToPaths(const PolyNode& polynode, NodeType nodetype, Paths& paths)\n{\n bool match = true;\n if (nodetype == ntClosed) match = !polynode.IsOpen();\n else if (nodetype == ntOpen) return;\n\n if (!polynode.Contour.empty() && match)\n paths.push_back(polynode.Contour);\n for (int i = 0; i < polynode.ChildCount(); ++i)\n AddPolyNodeToPaths(*polynode.Childs[i], nodetype, paths);\n}\n//------------------------------------------------------------------------------\n\nvoid PolyTreeToPaths(const PolyTree& polytree, Paths& paths)\n{\n paths.resize(0); \n paths.reserve(polytree.Total());\n AddPolyNodeToPaths(polytree, ntAny, paths);\n}\n//------------------------------------------------------------------------------\n\nvoid ClosedPathsFromPolyTree(const PolyTree& polytree, Paths& paths)\n{\n paths.resize(0); \n paths.reserve(polytree.Total());\n AddPolyNodeToPaths(polytree, ntClosed, paths);\n}\n//------------------------------------------------------------------------------\n\nvoid OpenPathsFromPolyTree(PolyTree& polytree, Paths& paths)\n{\n paths.resize(0); \n paths.reserve(polytree.Total());\n //Open paths are top level only, so ...\n for (int i = 0; i < polytree.ChildCount(); ++i)\n if (polytree.Childs[i]->IsOpen())\n paths.push_back(polytree.Childs[i]->Contour);\n}\n//------------------------------------------------------------------------------\n\nstd::ostream& operator <<(std::ostream &s, const IntPoint &p)\n{\n s << \"(\" << p.X << \",\" << p.Y << \")\";\n return s;\n}\n//------------------------------------------------------------------------------\n\nstd::ostream& operator <<(std::ostream &s, const Path &p)\n{\n if (p.empty()) return s;\n Path::size_type last = p.size() -1;\n for (Path::size_type i = 0; i < last; i++)\n s << \"(\" << p[i].X << \",\" << p[i].Y << \"), \";\n s << \"(\" << p[last].X << \",\" << p[last].Y << \")\\n\";\n return s;\n}\n//------------------------------------------------------------------------------\n\nstd::ostream& operator <<(std::ostream &s, const Paths &p)\n{\n for (Paths::size_type i = 0; i < p.size(); i++)\n s << p[i];\n s << \"\\n\";\n return s;\n}\n//------------------------------------------------------------------------------\n\n} //ClipperLib namespace\n" }, { "path": "libs/clipper/clipper.hpp", "content": "/*******************************************************************************\n* *\n* Author : Angus Johnson *\n* Version : 6.2.1 *\n* Date : 31 October 2014 *\n* Website : http://www.angusj.com *\n* Copyright : Angus Johnson 2010-2014 *\n* *\n* License: *\n* Use, modification & distribution is subject to Boost Software License Ver 1. *\n* http://www.boost.org/LICENSE_1_0.txt *\n* *\n* Attributions: *\n* The code in this library is an extension of Bala Vatti's clipping algorithm: *\n* \"A generic solution to polygon clipping\" *\n* Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63. *\n* http://portal.acm.org/citation.cfm?id=129906 *\n* *\n* Computer graphics and geometric modeling: implementation and algorithms *\n* By Max K. Agoston *\n* Springer; 1 edition (January 4, 2005) *\n* http://books.google.com/books?q=vatti+clipping+agoston *\n* *\n* See also: *\n* \"Polygon Offsetting by Computing Winding Numbers\" *\n* Paper no. DETC2005-85513 pp. 565-575 *\n* ASME 2005 International Design Engineering Technical Conferences *\n* and Computers and Information in Engineering Conference (IDETC/CIE2005) *\n* September 24-28, 2005 , Long Beach, California, USA *\n* http://www.me.berkeley.edu/~mcmains/pubs/DAC05OffsetPolygon.pdf *\n* *\n*******************************************************************************/\n\n#ifndef clipper_hpp\n#define clipper_hpp\n\n#define CLIPPER_VERSION \"6.2.1\"\n\n//use_int32: When enabled 32bit ints are used instead of 64bit ints. This\n//improve performance but coordinate values are limited to the range +/- 46340\n//#define use_int32\n\n//use_xyz: adds a Z member to IntPoint. Adds a minor cost to perfomance.\n#define use_xyz\n\n//use_lines: Enables line clipping. Adds a very minor cost to performance.\n#define use_lines\n\n//use_deprecated: Enables temporary support for the obsolete functions\n//#define use_deprecated\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace ClipperLib {\n\nenum ClipType { ctIntersection, ctUnion, ctDifference, ctXor };\nenum PolyType { ptSubject, ptClip };\n//By far the most widely used winding rules for polygon filling are\n//EvenOdd & NonZero (GDI, GDI+, XLib, OpenGL, Cairo, AGG, Quartz, SVG, Gr32)\n//Others rules include Positive, Negative and ABS_GTR_EQ_TWO (only in OpenGL)\n//see http://glprogramming.com/red/chapter11.html\nenum PolyFillType { pftEvenOdd, pftNonZero, pftPositive, pftNegative };\n\nstruct ZLabel {\n\tZLabel () : id(0), t(0) {}\n\tZLabel (int32_t ii) : id(ii), t(0) {}\n\tZLabel (int32_t ii, double tt) : id(ii), t(tt) {}\n\tbool operator == (const ZLabel &l) const {return id == l.id;}\n\tint32_t id;\n\tdouble t;\n};\n\ninline std::ostream& operator << (std::ostream &os, const ZLabel &l) {\n\treturn os << l.id << ':' << l.t;\n}\n\nstruct ZType {\n\tZType (uint64_t v) : label1(v >> 32), label2(v & 0xffffffff) {}\n\tZType (int32_t id1, int32_t id2) : label1(id1), label2(id2) {}\n\tZType (const ZLabel &l1, const ZLabel &l2) : label1(l1), label2(l2) {}\n\tconst ZLabel& minLabel () const {return (label1.id < label2.id) ? label1 : label2;}\n\tconst ZLabel& maxLabel () const {return (label1.id > label2.id) ? label1 : label2;}\n\n\tconst ZLabel& otherLabel (const ZLabel &l) const {\n\t\treturn (l.id == label1.id && l.t == label1.t) ? label2 : label1;\n\t}\n\n\tbool operator == (const ZType &p) const {return minLabel() == p.minLabel() && maxLabel() == p.maxLabel();}\n\toperator uint64_t () const {return (uint64_t(label1.id) << 32) & label2.id;}\n\tZLabel label1, label2;\n};\n\ninline std::ostream& operator << (std::ostream &os, const ZType &z) {\n\treturn os << '[' << z.label1 << '|' << z.label2 << ']';\n}\n\n#ifdef use_int32\n typedef int cInt;\n static cInt const loRange = 0x7FFF;\n static cInt const hiRange = 0x7FFF;\n#else\n typedef signed long long cInt;\n static cInt const loRange = 0x3FFFFFFF;\n static cInt const hiRange = 0x3FFFFFFFFFFFFFFFLL;\n typedef signed long long long64; //used by Int128 class\n typedef unsigned long long ulong64;\n\n#endif\n\nstruct IntPoint {\n cInt X;\n cInt Y;\n#ifdef use_xyz\n ZType Z;\n IntPoint(cInt x = 0, cInt y = 0, ZType z = 0): X(x), Y(y), Z(z) {};\n#else\n IntPoint(cInt x = 0, cInt y = 0): X(x), Y(y) {};\n#endif\n\n friend inline bool operator== (const IntPoint& a, const IntPoint& b)\n {\n return a.X == b.X && a.Y == b.Y;\n }\n friend inline bool operator!= (const IntPoint& a, const IntPoint& b)\n {\n return a.X != b.X || a.Y != b.Y;\n }\n};\n//------------------------------------------------------------------------------\n\ntypedef std::vector< IntPoint > Path;\ntypedef std::vector< Path > Paths;\n\ninline Path& operator <<(Path& poly, const IntPoint& p) {poly.push_back(p); return poly;}\ninline Paths& operator <<(Paths& polys, const Path& p) {polys.push_back(p); return polys;}\n\nstd::ostream& operator <<(std::ostream &s, const IntPoint &p);\nstd::ostream& operator <<(std::ostream &s, const Path &p);\nstd::ostream& operator <<(std::ostream &s, const Paths &p);\n\nstruct DoublePoint\n{\n double X;\n double Y;\n DoublePoint(double x = 0, double y = 0) : X(x), Y(y) {}\n DoublePoint(IntPoint ip) : X((double)ip.X), Y((double)ip.Y) {}\n};\n//------------------------------------------------------------------------------\n\n#ifdef use_xyz\ntypedef void (*ZFillCallback)(IntPoint& e1bot, IntPoint& e1top, IntPoint& e2bot, IntPoint& e2top, IntPoint& pt);\n#endif\n\nenum InitOptions {ioReverseSolution = 1, ioStrictlySimple = 2, ioPreserveCollinear = 4};\nenum JoinType {jtSquare, jtRound, jtMiter};\nenum EndType {etClosedPolygon, etClosedLine, etOpenButt, etOpenSquare, etOpenRound};\n\nclass PolyNode;\ntypedef std::vector< PolyNode* > PolyNodes;\n\nclass PolyNode\n{\npublic:\n PolyNode();\n virtual ~PolyNode(){};\n Path Contour;\n PolyNodes Childs;\n PolyNode* Parent;\n PolyNode* GetNext() const;\n bool IsHole() const;\n bool IsOpen() const;\n int ChildCount() const;\nprivate:\n unsigned Index; //node index in Parent.Childs\n bool m_IsOpen;\n JoinType m_jointype;\n EndType m_endtype;\n PolyNode* GetNextSiblingUp() const;\n void AddChild(PolyNode& child);\n friend class Clipper; //to access Index\n friend class ClipperOffset;\n};\n\nclass PolyTree: public PolyNode\n{\npublic:\n ~PolyTree(){Clear();};\n PolyNode* GetFirst() const;\n void Clear();\n int Total() const;\nprivate:\n PolyNodes AllNodes;\n friend class Clipper; //to access AllNodes\n};\n\nbool Orientation(const Path &poly);\ndouble Area(const Path &poly);\nint PointInPolygon(const IntPoint &pt, const Path &path);\n\nvoid SimplifyPolygon(const Path &in_poly, Paths &out_polys, PolyFillType fillType = pftEvenOdd);\nvoid SimplifyPolygons(const Paths &in_polys, Paths &out_polys, PolyFillType fillType = pftEvenOdd);\nvoid SimplifyPolygons(Paths &polys, PolyFillType fillType = pftEvenOdd);\n\nvoid CleanPolygon(const Path& in_poly, Path& out_poly, double distance = 1.415);\nvoid CleanPolygon(Path& poly, double distance = 1.415);\nvoid CleanPolygons(const Paths& in_polys, Paths& out_polys, double distance = 1.415);\nvoid CleanPolygons(Paths& polys, double distance = 1.415);\n\nvoid MinkowskiSum(const Path& pattern, const Path& path, Paths& solution, bool pathIsClosed);\nvoid MinkowskiSum(const Path& pattern, const Paths& paths, Paths& solution, bool pathIsClosed);\nvoid MinkowskiDiff(const Path& poly1, const Path& poly2, Paths& solution);\n\nvoid PolyTreeToPaths(const PolyTree& polytree, Paths& paths);\nvoid ClosedPathsFromPolyTree(const PolyTree& polytree, Paths& paths);\nvoid OpenPathsFromPolyTree(PolyTree& polytree, Paths& paths);\n\nvoid ReversePath(Path& p);\nvoid ReversePaths(Paths& p);\n\nstruct IntRect { cInt left; cInt top; cInt right; cInt bottom; };\n\n//enums that are used internally ...\nenum EdgeSide { esLeft = 1, esRight = 2};\n\n//forward declarations (for stuff used internally) ...\nstruct TEdge;\nstruct IntersectNode;\nstruct LocalMinimum;\nstruct Scanbeam;\nstruct OutPt;\nstruct OutRec;\nstruct Join;\n\ntypedef std::vector < OutRec* > PolyOutList;\ntypedef std::vector < TEdge* > EdgeList;\ntypedef std::vector < Join* > JoinList;\ntypedef std::vector < IntersectNode* > IntersectList;\n\n//------------------------------------------------------------------------------\n\n//ClipperBase is the ancestor to the Clipper class. It should not be\n//instantiated directly. This class simply abstracts the conversion of sets of\n//polygon coordinates into edge objects that are stored in a LocalMinima list.\nclass ClipperBase\n{\npublic:\n ClipperBase();\n virtual ~ClipperBase();\n bool AddPath(const Path &pg, PolyType PolyTyp, bool Closed);\n bool AddPaths(const Paths &ppg, PolyType PolyTyp, bool Closed);\n virtual void Clear();\n IntRect GetBounds();\n bool PreserveCollinear() {return m_PreserveCollinear;};\n void PreserveCollinear(bool value) {m_PreserveCollinear = value;};\nprotected:\n void DisposeLocalMinimaList();\n TEdge* AddBoundsToLML(TEdge *e, bool IsClosed);\n void PopLocalMinima();\n virtual void Reset();\n TEdge* ProcessBound(TEdge* E, bool IsClockwise);\n void DoMinimaLML(TEdge* E1, TEdge* E2, bool IsClosed);\n TEdge* DescendToMin(TEdge *&E);\n void AscendToMax(TEdge *&E, bool Appending, bool IsClosed);\n\n typedef std::vector MinimaList;\n MinimaList::iterator m_CurrentLM;\n MinimaList m_MinimaList;\n\n bool m_UseFullRange;\n EdgeList m_edges;\n bool m_PreserveCollinear;\n bool m_HasOpenPaths;\n};\n//------------------------------------------------------------------------------\n\nclass Clipper : public virtual ClipperBase\n{\npublic:\n Clipper(int initOptions = 0);\n ~Clipper();\n bool Execute(ClipType clipType,\n Paths &solution,\n PolyFillType subjFillType = pftEvenOdd,\n PolyFillType clipFillType = pftEvenOdd);\n bool Execute(ClipType clipType,\n PolyTree &polytree,\n PolyFillType subjFillType = pftEvenOdd,\n PolyFillType clipFillType = pftEvenOdd);\n bool ReverseSolution() {return m_ReverseOutput;};\n void ReverseSolution(bool value) {m_ReverseOutput = value;};\n bool StrictlySimple() {return m_StrictSimple;};\n void StrictlySimple(bool value) {m_StrictSimple = value;};\n //set the callback function for z value filling on intersections (otherwise Z is 0)\n#ifdef use_xyz\n void ZFillFunction(ZFillCallback zFillFunc);\n#endif\nprotected:\n void Reset() override;\n virtual bool ExecuteInternal();\nprivate:\n PolyOutList m_PolyOuts;\n JoinList m_Joins;\n JoinList m_GhostJoins;\n IntersectList m_IntersectList;\n ClipType m_ClipType;\n typedef std::priority_queue ScanbeamList;\n ScanbeamList m_Scanbeam;\n TEdge *m_ActiveEdges;\n TEdge *m_SortedEdges;\n bool m_ExecuteLocked;\n PolyFillType m_ClipFillType;\n PolyFillType m_SubjFillType;\n bool m_ReverseOutput;\n bool m_UsingPolyTree;\n bool m_StrictSimple;\n#ifdef use_xyz\n ZFillCallback m_ZFill; //custom callback\n#endif\n void SetWindingCount(TEdge& edge);\n bool IsEvenOddFillType(const TEdge& edge) const;\n bool IsEvenOddAltFillType(const TEdge& edge) const;\n void InsertScanbeam(const cInt Y);\n cInt PopScanbeam();\n void InsertLocalMinimaIntoAEL(const cInt botY);\n void InsertEdgeIntoAEL(TEdge *edge, TEdge* startEdge);\n void AddEdgeToSEL(TEdge *edge);\n void CopyAELToSEL();\n void DeleteFromSEL(TEdge *e);\n void DeleteFromAEL(TEdge *e);\n void UpdateEdgeIntoAEL(TEdge *&e);\n void SwapPositionsInSEL(TEdge *edge1, TEdge *edge2);\n bool IsContributing(const TEdge& edge) const;\n bool IsTopHorz(const cInt XPos);\n void SwapPositionsInAEL(TEdge *edge1, TEdge *edge2);\n void DoMaxima(TEdge *e);\n void ProcessHorizontals(bool IsTopOfScanbeam);\n void ProcessHorizontal(TEdge *horzEdge, bool isTopOfScanbeam);\n void AddLocalMaxPoly(TEdge *e1, TEdge *e2, const IntPoint &pt);\n OutPt* AddLocalMinPoly(TEdge *e1, TEdge *e2, const IntPoint &pt);\n OutRec* GetOutRec(int idx);\n void AppendPolygon(TEdge *e1, TEdge *e2);\n void IntersectEdges(TEdge *e1, TEdge *e2, IntPoint &pt);\n OutRec* CreateOutRec();\n OutPt* AddOutPt(TEdge *e, const IntPoint &pt);\n void DisposeAllOutRecs();\n void DisposeOutRec(PolyOutList::size_type index);\n bool ProcessIntersections(const cInt topY);\n void BuildIntersectList(const cInt topY);\n void ProcessIntersectList();\n void ProcessEdgesAtTopOfScanbeam(const cInt topY);\n void BuildResult(Paths& polys);\n void BuildResult2(PolyTree& polytree);\n void SetHoleState(TEdge *e, OutRec *outrec);\n void DisposeIntersectNodes();\n bool FixupIntersectionOrder();\n void FixupOutPolygon(OutRec &outrec);\n bool IsHole(TEdge *e);\n bool FindOwnerFromSplitRecs(OutRec &outRec, OutRec *&currOrfl);\n void FixHoleLinkage(OutRec &outrec);\n void AddJoin(OutPt *op1, OutPt *op2, const IntPoint offPt);\n void ClearJoins();\n void ClearGhostJoins();\n void AddGhostJoin(OutPt *op, const IntPoint offPt);\n bool JoinPoints(Join *j, OutRec* outRec1, OutRec* outRec2);\n void JoinCommonEdges();\n void DoSimplePolygons();\n void FixupFirstLefts1(OutRec* OldOutRec, OutRec* NewOutRec);\n void FixupFirstLefts2(OutRec* OldOutRec, OutRec* NewOutRec);\n#ifdef use_xyz\n void SetZ(IntPoint& pt, TEdge& e1, TEdge& e2);\n#endif\n};\n//------------------------------------------------------------------------------\n\nclass ClipperOffset\n{\npublic:\n ClipperOffset(double miterLimit = 2.0, double roundPrecision = 0.25);\n ~ClipperOffset();\n void AddPath(const Path& path, JoinType joinType, EndType endType);\n void AddPaths(const Paths& paths, JoinType joinType, EndType endType);\n void Execute(Paths& solution, double delta);\n void Execute(PolyTree& solution, double delta);\n void Clear();\n double MiterLimit;\n double ArcTolerance;\nprivate:\n Paths m_destPolys;\n Path m_srcPoly;\n Path m_destPoly;\n std::vector m_normals;\n double m_delta, m_sinA, m_sin, m_cos;\n double m_miterLim, m_StepsPerRad;\n IntPoint m_lowest;\n PolyNode m_polyNodes;\n\n void FixOrientations();\n void DoOffset(double delta);\n void OffsetPoint(int j, int& k, JoinType jointype);\n void DoSquare(int j, int k);\n void DoMiter(int j, int k, double r);\n void DoRound(int j, int k);\n};\n//------------------------------------------------------------------------------\n\nclass clipperException : public std::exception\n{\n public:\n clipperException(const char* description): m_descr(description) {}\n virtual ~clipperException() throw() {}\n virtual const char* what() const throw() override {return m_descr.c_str();}\n private:\n std::string m_descr;\n};\n//------------------------------------------------------------------------------\n\n} //ClipperLib namespace\n\n#endif //clipper_hpp\n\n\n" }, { "path": "libs/defs.am", "content": "## This file is part of dvisvgm\n## Copyright (C) 2005-2025 Martin Gieseking \n\nif !HAVE_BROTLI\nBROTLI_CFLAGS += -I$(dvisvgm_srcdir)/libs/brotli/include\nBROTLI_LIBS += ../libs/brotli/libbrotli.a\nendif\n\nif TEXLIVE_BUILD\nPOTRACE_CFLAGS = $(POTRACE_INCLUDES)\nelse\nif !HAVE_POTRACE\nPOTRACE_CFLAGS = -I$(dvisvgm_srcdir)/libs/potrace\nPOTRACE_LIBS = ../libs/potrace/libpotrace.a\nendif !HAVE_POTRACE\nendif !TEXLIVE_BUILD\n\nif !HAVE_WOFF2\nWOFF2_CFLAGS += -I$(dvisvgm_srcdir)/libs/woff2/include\nWOFF2_LIBS += ../libs/woff2/libwoff2.a\nendif\n\nif !HAVE_XXHASH\nXXHASH_CFLAGS = -I$(dvisvgm_srcdir)/libs/xxHash\nXXHASH_LIBS = ../libs/xxHash/libxxhash.a\nendif\n" }, { "path": "libs/md5/Makefile.am", "content": "noinst_LIBRARIES = libmd5.a\n\nlibmd5_a_SOURCES = md5.c md5.h\nAM_CXXFLAGS = -Wall\n\nmd5.c: md5.h\n\nCLEANFILES = *.gcda *.gcno\n\n" }, { "path": "libs/md5/md5.c", "content": "/*\n * This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.\n * MD5 Message-Digest Algorithm (RFC 1321).\n *\n * Homepage:\n * http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5\n *\n * Author:\n * Alexander Peslyak, better known as Solar Designer \n *\n * This software was written by Alexander Peslyak in 2001. No copyright is\n * claimed, and the software is hereby placed in the public domain.\n * In case this attempt to disclaim copyright and place the software in the\n * public domain is deemed null and void, then the software is\n * Copyright (c) 2001 Alexander Peslyak and it is hereby released to the\n * general public under the following terms:\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted.\n *\n * There's ABSOLUTELY NO WARRANTY, express or implied.\n *\n * (This is a heavily cut-down \"BSD license\".)\n *\n * This differs from Colin Plumb's older public domain implementation in that\n * no exactly 32-bit integer data type is required (any 32-bit or wider\n * unsigned integer data type will do), there's no compile-time endianness\n * configuration, and the function prototypes match OpenSSL's. No code from\n * Colin Plumb's implementation has been reused; this comment merely compares\n * the properties of the two independent implementations.\n *\n * The primary goals of this implementation are portability and ease of use.\n * It is meant to be fast, but not as fast as possible. Some known\n * optimizations are not included to reduce source code size and avoid\n * compile-time configuration.\n */\n\n#ifndef HAVE_OPENSSL\n\n#include \n\n#include \"md5.h\"\n\n/*\n * The basic MD5 functions.\n *\n * F and G are optimized compared to their RFC 1321 definitions for\n * architectures that lack an AND-NOT instruction, just like in Colin Plumb's\n * implementation.\n */\n#define F(x, y, z)\t\t\t((z) ^ ((x) & ((y) ^ (z))))\n#define G(x, y, z)\t\t\t((y) ^ ((z) & ((x) ^ (y))))\n#define H(x, y, z)\t\t\t(((x) ^ (y)) ^ (z))\n#define H2(x, y, z)\t\t\t((x) ^ ((y) ^ (z)))\n#define I(x, y, z)\t\t\t((y) ^ ((x) | ~(z)))\n\n/*\n * The MD5 transformation for all four rounds.\n */\n#define STEP(f, a, b, c, d, x, t, s) \\\n\t(a) += f((b), (c), (d)) + (x) + (t); \\\n\t(a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \\\n\t(a) += (b);\n\n/*\n * SET reads 4 input bytes in little-endian byte order and stores them in a\n * properly aligned word in host byte order.\n *\n * The check for little-endian architectures that tolerate unaligned memory\n * accesses is just an optimization. Nothing will break if it fails to detect\n * a suitable architecture.\n *\n * Unfortunately, this optimization may be a C strict aliasing rules violation\n * if the caller's data buffer has effective type that cannot be aliased by\n * MD5_u32plus. In practice, this problem may occur if these MD5 routines are\n * inlined into a calling function, or with future and dangerously advanced\n * link-time optimizations. For the time being, keeping these MD5 routines in\n * their own translation unit avoids the problem.\n */\n#if defined(__i386__) || defined(__x86_64__) || defined(__vax__)\n#define SET(n) \\\n\t(*(MD5_u32plus *)&ptr[(n) * 4])\n#define GET(n) \\\n\tSET(n)\n#else\n#define SET(n) \\\n\t(ctx->block[(n)] = \\\n\t(MD5_u32plus)ptr[(n) * 4] | \\\n\t((MD5_u32plus)ptr[(n) * 4 + 1] << 8) | \\\n\t((MD5_u32plus)ptr[(n) * 4 + 2] << 16) | \\\n\t((MD5_u32plus)ptr[(n) * 4 + 3] << 24))\n#define GET(n) \\\n\t(ctx->block[(n)])\n#endif\n\n/*\n * This processes one or more 64-byte data blocks, but does NOT update the bit\n * counters. There are no alignment requirements.\n */\nstatic const void *body(MD5_CTX *ctx, const void *data, unsigned long size)\n{\n\tconst unsigned char *ptr;\n\tMD5_u32plus a, b, c, d;\n\tMD5_u32plus saved_a, saved_b, saved_c, saved_d;\n\n\tptr = (const unsigned char *)data;\n\n\ta = ctx->a;\n\tb = ctx->b;\n\tc = ctx->c;\n\td = ctx->d;\n\n\tdo {\n\t\tsaved_a = a;\n\t\tsaved_b = b;\n\t\tsaved_c = c;\n\t\tsaved_d = d;\n\n/* Round 1 */\n\t\tSTEP(F, a, b, c, d, SET(0), 0xd76aa478, 7)\n\t\tSTEP(F, d, a, b, c, SET(1), 0xe8c7b756, 12)\n\t\tSTEP(F, c, d, a, b, SET(2), 0x242070db, 17)\n\t\tSTEP(F, b, c, d, a, SET(3), 0xc1bdceee, 22)\n\t\tSTEP(F, a, b, c, d, SET(4), 0xf57c0faf, 7)\n\t\tSTEP(F, d, a, b, c, SET(5), 0x4787c62a, 12)\n\t\tSTEP(F, c, d, a, b, SET(6), 0xa8304613, 17)\n\t\tSTEP(F, b, c, d, a, SET(7), 0xfd469501, 22)\n\t\tSTEP(F, a, b, c, d, SET(8), 0x698098d8, 7)\n\t\tSTEP(F, d, a, b, c, SET(9), 0x8b44f7af, 12)\n\t\tSTEP(F, c, d, a, b, SET(10), 0xffff5bb1, 17)\n\t\tSTEP(F, b, c, d, a, SET(11), 0x895cd7be, 22)\n\t\tSTEP(F, a, b, c, d, SET(12), 0x6b901122, 7)\n\t\tSTEP(F, d, a, b, c, SET(13), 0xfd987193, 12)\n\t\tSTEP(F, c, d, a, b, SET(14), 0xa679438e, 17)\n\t\tSTEP(F, b, c, d, a, SET(15), 0x49b40821, 22)\n\n/* Round 2 */\n\t\tSTEP(G, a, b, c, d, GET(1), 0xf61e2562, 5)\n\t\tSTEP(G, d, a, b, c, GET(6), 0xc040b340, 9)\n\t\tSTEP(G, c, d, a, b, GET(11), 0x265e5a51, 14)\n\t\tSTEP(G, b, c, d, a, GET(0), 0xe9b6c7aa, 20)\n\t\tSTEP(G, a, b, c, d, GET(5), 0xd62f105d, 5)\n\t\tSTEP(G, d, a, b, c, GET(10), 0x02441453, 9)\n\t\tSTEP(G, c, d, a, b, GET(15), 0xd8a1e681, 14)\n\t\tSTEP(G, b, c, d, a, GET(4), 0xe7d3fbc8, 20)\n\t\tSTEP(G, a, b, c, d, GET(9), 0x21e1cde6, 5)\n\t\tSTEP(G, d, a, b, c, GET(14), 0xc33707d6, 9)\n\t\tSTEP(G, c, d, a, b, GET(3), 0xf4d50d87, 14)\n\t\tSTEP(G, b, c, d, a, GET(8), 0x455a14ed, 20)\n\t\tSTEP(G, a, b, c, d, GET(13), 0xa9e3e905, 5)\n\t\tSTEP(G, d, a, b, c, GET(2), 0xfcefa3f8, 9)\n\t\tSTEP(G, c, d, a, b, GET(7), 0x676f02d9, 14)\n\t\tSTEP(G, b, c, d, a, GET(12), 0x8d2a4c8a, 20)\n\n/* Round 3 */\n\t\tSTEP(H, a, b, c, d, GET(5), 0xfffa3942, 4)\n\t\tSTEP(H2, d, a, b, c, GET(8), 0x8771f681, 11)\n\t\tSTEP(H, c, d, a, b, GET(11), 0x6d9d6122, 16)\n\t\tSTEP(H2, b, c, d, a, GET(14), 0xfde5380c, 23)\n\t\tSTEP(H, a, b, c, d, GET(1), 0xa4beea44, 4)\n\t\tSTEP(H2, d, a, b, c, GET(4), 0x4bdecfa9, 11)\n\t\tSTEP(H, c, d, a, b, GET(7), 0xf6bb4b60, 16)\n\t\tSTEP(H2, b, c, d, a, GET(10), 0xbebfbc70, 23)\n\t\tSTEP(H, a, b, c, d, GET(13), 0x289b7ec6, 4)\n\t\tSTEP(H2, d, a, b, c, GET(0), 0xeaa127fa, 11)\n\t\tSTEP(H, c, d, a, b, GET(3), 0xd4ef3085, 16)\n\t\tSTEP(H2, b, c, d, a, GET(6), 0x04881d05, 23)\n\t\tSTEP(H, a, b, c, d, GET(9), 0xd9d4d039, 4)\n\t\tSTEP(H2, d, a, b, c, GET(12), 0xe6db99e5, 11)\n\t\tSTEP(H, c, d, a, b, GET(15), 0x1fa27cf8, 16)\n\t\tSTEP(H2, b, c, d, a, GET(2), 0xc4ac5665, 23)\n\n/* Round 4 */\n\t\tSTEP(I, a, b, c, d, GET(0), 0xf4292244, 6)\n\t\tSTEP(I, d, a, b, c, GET(7), 0x432aff97, 10)\n\t\tSTEP(I, c, d, a, b, GET(14), 0xab9423a7, 15)\n\t\tSTEP(I, b, c, d, a, GET(5), 0xfc93a039, 21)\n\t\tSTEP(I, a, b, c, d, GET(12), 0x655b59c3, 6)\n\t\tSTEP(I, d, a, b, c, GET(3), 0x8f0ccc92, 10)\n\t\tSTEP(I, c, d, a, b, GET(10), 0xffeff47d, 15)\n\t\tSTEP(I, b, c, d, a, GET(1), 0x85845dd1, 21)\n\t\tSTEP(I, a, b, c, d, GET(8), 0x6fa87e4f, 6)\n\t\tSTEP(I, d, a, b, c, GET(15), 0xfe2ce6e0, 10)\n\t\tSTEP(I, c, d, a, b, GET(6), 0xa3014314, 15)\n\t\tSTEP(I, b, c, d, a, GET(13), 0x4e0811a1, 21)\n\t\tSTEP(I, a, b, c, d, GET(4), 0xf7537e82, 6)\n\t\tSTEP(I, d, a, b, c, GET(11), 0xbd3af235, 10)\n\t\tSTEP(I, c, d, a, b, GET(2), 0x2ad7d2bb, 15)\n\t\tSTEP(I, b, c, d, a, GET(9), 0xeb86d391, 21)\n\n\t\ta += saved_a;\n\t\tb += saved_b;\n\t\tc += saved_c;\n\t\td += saved_d;\n\n\t\tptr += 64;\n\t} while (size -= 64);\n\n\tctx->a = a;\n\tctx->b = b;\n\tctx->c = c;\n\tctx->d = d;\n\n\treturn ptr;\n}\n\nvoid MD5_Init(MD5_CTX *ctx)\n{\n\tctx->a = 0x67452301;\n\tctx->b = 0xefcdab89;\n\tctx->c = 0x98badcfe;\n\tctx->d = 0x10325476;\n\n\tctx->lo = 0;\n\tctx->hi = 0;\n}\n\nvoid MD5_Update(MD5_CTX *ctx, const void *data, unsigned long size)\n{\n\tMD5_u32plus saved_lo;\n\tunsigned long used, available;\n\n\tsaved_lo = ctx->lo;\n\tif ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo)\n\t\tctx->hi++;\n\tctx->hi += size >> 29;\n\n\tused = saved_lo & 0x3f;\n\n\tif (used) {\n\t\tavailable = 64 - used;\n\n\t\tif (size < available) {\n\t\t\tmemcpy(&ctx->buffer[used], data, size);\n\t\t\treturn;\n\t\t}\n\n\t\tmemcpy(&ctx->buffer[used], data, available);\n\t\tdata = (const unsigned char *)data + available;\n\t\tsize -= available;\n\t\tbody(ctx, ctx->buffer, 64);\n\t}\n\n\tif (size >= 64) {\n\t\tdata = body(ctx, data, size & ~(unsigned long)0x3f);\n\t\tsize &= 0x3f;\n\t}\n\n\tmemcpy(ctx->buffer, data, size);\n}\n\n#define OUT(dst, src) \\\n\t(dst)[0] = (unsigned char)(src); \\\n\t(dst)[1] = (unsigned char)((src) >> 8); \\\n\t(dst)[2] = (unsigned char)((src) >> 16); \\\n\t(dst)[3] = (unsigned char)((src) >> 24);\n\nvoid MD5_Final(unsigned char *result, MD5_CTX *ctx)\n{\n\tunsigned long used, available;\n\n\tused = ctx->lo & 0x3f;\n\n\tctx->buffer[used++] = 0x80;\n\n\tavailable = 64 - used;\n\n\tif (available < 8) {\n\t\tmemset(&ctx->buffer[used], 0, available);\n\t\tbody(ctx, ctx->buffer, 64);\n\t\tused = 0;\n\t\tavailable = 64;\n\t}\n\n\tmemset(&ctx->buffer[used], 0, available - 8);\n\n\tctx->lo <<= 3;\n\tOUT(&ctx->buffer[56], ctx->lo)\n\tOUT(&ctx->buffer[60], ctx->hi)\n\n\tbody(ctx, ctx->buffer, 64);\n\n\tOUT(&result[0], ctx->a)\n\tOUT(&result[4], ctx->b)\n\tOUT(&result[8], ctx->c)\n\tOUT(&result[12], ctx->d)\n\n\tmemset(ctx, 0, sizeof(*ctx));\n}\n\n#endif\n" }, { "path": "libs/md5/md5.h", "content": "/*\n * This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.\n * MD5 Message-Digest Algorithm (RFC 1321).\n *\n * Homepage:\n * http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5\n *\n * Author:\n * Alexander Peslyak, better known as Solar Designer \n *\n * This software was written by Alexander Peslyak in 2001. No copyright is\n * claimed, and the software is hereby placed in the public domain.\n * In case this attempt to disclaim copyright and place the software in the\n * public domain is deemed null and void, then the software is\n * Copyright (c) 2001 Alexander Peslyak and it is hereby released to the\n * general public under the following terms:\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted.\n *\n * There's ABSOLUTELY NO WARRANTY, express or implied.\n *\n * See md5.c for more information.\n */\n\n#ifndef _MD5_H\n#define _MD5_H\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* Any 32-bit or wider unsigned integer data type will do */\ntypedef unsigned int MD5_u32plus;\n\ntypedef struct {\n\tMD5_u32plus lo, hi;\n\tMD5_u32plus a, b, c, d;\n\tunsigned char buffer[64];\n\tMD5_u32plus block[16];\n} MD5_CTX;\n\nextern void MD5_Init(MD5_CTX *ctx);\nextern void MD5_Update(MD5_CTX *ctx, const void *data, unsigned long size);\nextern void MD5_Final(unsigned char *result, MD5_CTX *ctx);\n\n#ifdef __cplusplus\n}\n#endif\n\n#endif\n" }, { "path": "libs/potrace/Makefile.am", "content": "if !HAVE_POTRACE\nnoinst_LIBRARIES = libpotrace.a\nlibpotrace_a_SOURCES = \\\n\tauxiliary.h \\\n\tbitmap.h \\\n\tconfig.h \\\n\tcurve.c \\\n\tcurve.h \\\n\tdecompose.c \\\n\tdecompose.h \\\n\tlists.h \\\n\tpotracelib.c \\\n\tpotracelib.h \\\n\tprogress.h \\\n\ttrace.c \\\n\ttrace.h\n\nAM_CFLAGS = -Wall -I$(srcdir)\n\nendif\n\nCLEANFILES = *.gcda *.gcno\n" }, { "path": "libs/potrace/auxiliary.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n/* This header file collects some general-purpose macros (and static\n inline functions) that are used in various places. */\n\n#ifndef AUXILIARY_H\n#define AUXILIARY_H\n\n#ifdef HAVE_CONFIG_H\n#include \n#endif\n\n#include \n\n/* ---------------------------------------------------------------------- */\n/* point arithmetic */\n\n#include \"potracelib.h\"\n\nstruct point_s {\n long x;\n long y;\n};\ntypedef struct point_s point_t;\n\ntypedef potrace_dpoint_t dpoint_t;\n\n/* convert point_t to dpoint_t */\nstatic inline dpoint_t dpoint(point_t p) {\n dpoint_t res;\n res.x = p.x;\n res.y = p.y;\n return res;\n}\n\n/* range over the straight line segment [a,b] when lambda ranges over [0,1] */\nstatic inline dpoint_t interval(double lambda, dpoint_t a, dpoint_t b) {\n dpoint_t res;\n\n res.x = a.x + lambda * (b.x - a.x);\n res.y = a.y + lambda * (b.y - a.y);\n return res;\n}\n\n/* ---------------------------------------------------------------------- */\n/* some useful macros. Note: the \"mod\" macro works correctly for\n negative a. Also note that the test for a>=n, while redundant,\n speeds up the mod function by 70% in the average case (significant\n since the program spends about 16% of its time here - or 40%\n without the test). The \"floordiv\" macro returns the largest integer\n <= a/n, and again this works correctly for negative a, as long as\n a,n are integers and n>0. */\n\n/* integer arithmetic */\n\nstatic inline int mod(int a, int n) {\n return a>=n ? a%n : a>=0 ? a : n-1-(-1-a)%n;\n}\n\nstatic inline int floordiv(int a, int n) {\n return a>=0 ? a/n : -1-(-1-a)/n;\n}\n\n/* Note: the following work for integers and other numeric types. */\n#undef sign\n#undef abs\n#undef min\n#undef max\n#undef sq\n#undef cu\n#define sign(x) ((x)>0 ? 1 : (x)<0 ? -1 : 0)\n#define abs(a) ((a)>0 ? (a) : -(a))\n#define min(a,b) ((a)<(b) ? (a) : (b))\n#define max(a,b) ((a)>(b) ? (a) : (b))\n#define sq(a) ((a)*(a))\n#define cu(a) ((a)*(a)*(a))\n\n#endif /* AUXILIARY_H */\n" }, { "path": "libs/potrace/bitmap.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n#ifndef BITMAP_H\n#define BITMAP_H\n\n#include \n#include \n#include \n#include \n\n/* The bitmap type is defined in potracelib.h */\n#include \"potracelib.h\"\n\n/* The present file defines some convenient macros and static inline\n functions for accessing bitmaps. Since they only produce inline\n code, they can be conveniently shared by the library and frontends,\n if desired */\n\n/* ---------------------------------------------------------------------- */\n/* some measurements */\n\n#define BM_WORDSIZE ((int)sizeof(potrace_word))\n#define BM_WORDBITS (8*BM_WORDSIZE)\n#define BM_HIBIT (((potrace_word)1)<<(BM_WORDBITS-1))\n#define BM_ALLBITS (~(potrace_word)0)\n\n/* macros for accessing pixel at index (x,y). U* macros omit the\n bounds check. */\n\n#define bm_scanline(bm, y) ((bm)->map + (ptrdiff_t)(y)*(ptrdiff_t)(bm)->dy)\n#define bm_index(bm, x, y) (&bm_scanline(bm, y)[(x)/BM_WORDBITS])\n#define bm_mask(x) (BM_HIBIT >> ((x) & (BM_WORDBITS-1)))\n#define bm_range(x, a) ((int)(x) >= 0 && (int)(x) < (a))\n#define bm_safe(bm, x, y) (bm_range(x, (bm)->w) && bm_range(y, (bm)->h))\n#define BM_UGET(bm, x, y) ((*bm_index(bm, x, y) & bm_mask(x)) != 0)\n#define BM_USET(bm, x, y) (*bm_index(bm, x, y) |= bm_mask(x))\n#define BM_UCLR(bm, x, y) (*bm_index(bm, x, y) &= ~bm_mask(x))\n#define BM_UINV(bm, x, y) (*bm_index(bm, x, y) ^= bm_mask(x))\n#define BM_UPUT(bm, x, y, b) ((b) ? BM_USET(bm, x, y) : BM_UCLR(bm, x, y))\n#define BM_GET(bm, x, y) (bm_safe(bm, x, y) ? BM_UGET(bm, x, y) : 0)\n#define BM_SET(bm, x, y) (bm_safe(bm, x, y) ? BM_USET(bm, x, y) : 0)\n#define BM_CLR(bm, x, y) (bm_safe(bm, x, y) ? BM_UCLR(bm, x, y) : 0)\n#define BM_INV(bm, x, y) (bm_safe(bm, x, y) ? BM_UINV(bm, x, y) : 0)\n#define BM_PUT(bm, x, y, b) (bm_safe(bm, x, y) ? BM_UPUT(bm, x, y, b) : 0)\n\n/* calculate the size, in bytes, required for the data area of a\n bitmap of the given dy and h. Assume h >= 0. Return -1 if the size\n does not fit into the ptrdiff_t type. */\nstatic inline ptrdiff_t getsize(int dy, int h) {\n ptrdiff_t size;\n\n if (dy < 0) {\n dy = -dy;\n }\n \n size = (ptrdiff_t)dy * (ptrdiff_t)h * (ptrdiff_t)BM_WORDSIZE;\n\n /* check for overflow error */\n if (size < 0 || (h != 0 && dy != 0 && size / h / dy != BM_WORDSIZE)) {\n return -1;\n }\n\n return size;\n}\n\n/* return the size, in bytes, of the data area of the bitmap. Return\n -1 if the size does not fit into the ptrdiff_t type; however, this\n cannot happen if the bitmap is well-formed, i.e., if created with\n bm_new or bm_dup. */\nstatic inline ptrdiff_t bm_size(const potrace_bitmap_t *bm) {\n return getsize(bm->dy, bm->h);\n}\n\n/* calculate the base address of the bitmap data. Assume that the\n bitmap is well-formed, i.e., its size fits into the ptrdiff_t type.\n This is the case if created with bm_new or bm_dup. The base address\n may differ from bm->map if dy is negative */\nstatic inline potrace_word *bm_base(const potrace_bitmap_t *bm) {\n int dy = bm->dy;\n\n if (dy >= 0 || bm->h == 0) {\n return bm->map;\n } else {\n return bm_scanline(bm, bm->h - 1);\n } \n}\n\n/* free the given bitmap. Leaves errno untouched. */\nstatic inline void bm_free(potrace_bitmap_t *bm) {\n if (bm && bm->map) {\n free(bm_base(bm));\n }\n free(bm);\n}\n\n/* return new bitmap initialized to 0. NULL with errno on error.\n Assumes w, h >= 0. */\nstatic inline potrace_bitmap_t *bm_new(int w, int h) {\n potrace_bitmap_t *bm;\n int dy = w == 0 ? 0 : (w - 1) / BM_WORDBITS + 1;\n ptrdiff_t size;\n\n size = getsize(dy, h);\n if (size < 0) {\n errno = ENOMEM;\n return NULL;\n }\n if (size == 0) {\n size = BM_WORDSIZE; /* make sure calloc() doesn't return NULL */\n } \n\n bm = (potrace_bitmap_t *) malloc(sizeof(potrace_bitmap_t));\n if (!bm) {\n return NULL;\n }\n bm->w = w;\n bm->h = h;\n bm->dy = dy;\n bm->map = (potrace_word *) calloc(1, size);\n if (!bm->map) {\n free(bm);\n return NULL;\n }\n return bm;\n}\n\n/* clear the given bitmap. Set all bits to c. Assumes a well-formed\n bitmap. */\nstatic inline void bm_clear(potrace_bitmap_t *bm, int c) {\n /* Note: if the bitmap was created with bm_new, then it is\n guaranteed that size will fit into the ptrdiff_t type. */\n ptrdiff_t size = bm_size(bm);\n memset(bm_base(bm), c ? -1 : 0, size);\n}\n\n/* duplicate the given bitmap. Return NULL on error with errno\n set. Assumes a well-formed bitmap. */\nstatic inline potrace_bitmap_t *bm_dup(const potrace_bitmap_t *bm) {\n potrace_bitmap_t *bm1 = bm_new(bm->w, bm->h);\n int y;\n \n if (!bm1) {\n return NULL;\n }\n for (y=0; y < bm->h; y++) {\n memcpy(bm_scanline(bm1, y), bm_scanline(bm, y), (size_t)bm1->dy * (size_t)BM_WORDSIZE);\n }\n return bm1;\n}\n\n/* invert the given bitmap. */\nstatic inline void bm_invert(potrace_bitmap_t *bm) {\n int dy = bm->dy;\n int y;\n int i;\n potrace_word *p;\n\n if (dy < 0) {\n dy = -dy;\n }\n \n for (y=0; y < bm->h; y++) {\n p = bm_scanline(bm, y);\n for (i=0; i < dy; i++) {\n p[i] ^= BM_ALLBITS;\n }\n }\n}\n\n/* turn the given bitmap upside down. This does not move the bitmap\n data or change the bm_base() address. */\nstatic inline void bm_flip(potrace_bitmap_t *bm) {\n int dy = bm->dy;\n\n if (bm->h == 0 || bm->h == 1) {\n return;\n }\n \n bm->map = bm_scanline(bm, bm->h - 1);\n bm->dy = -dy;\n}\n\n/* resize the bitmap to the given new height. The bitmap data remains\n bottom-aligned (truncated at the top) when dy >= 0 and top-aligned\n (truncated at the bottom) when dy < 0. Return 0 on success, or 1 on\n error with errno set. If the new height is <= the old one, no error\n should occur. If the new height is larger, the additional bitmap\n data is *not* initialized. */\nstatic inline int bm_resize(potrace_bitmap_t *bm, int h) {\n int dy = bm->dy;\n ptrdiff_t newsize;\n potrace_word *newmap;\n\n if (dy < 0) {\n bm_flip(bm);\n }\n \n newsize = getsize(dy, h);\n if (newsize < 0) {\n errno = ENOMEM;\n goto error;\n }\n if (newsize == 0) {\n newsize = BM_WORDSIZE; /* make sure realloc() doesn't return NULL */\n }\n \n newmap = (potrace_word *)realloc(bm->map, newsize);\n if (newmap == NULL) {\n goto error;\n }\n bm->map = newmap;\n bm->h = h;\n\n if (dy < 0) {\n bm_flip(bm);\n }\n return 0;\n \n error:\n if (dy < 0) {\n bm_flip(bm);\n }\n return 1; \n}\n\n#endif /* BITMAP_H */\n" }, { "path": "libs/potrace/config.h", "content": "#ifndef CONFIG_H\n#define CONFIG_H\n#define VERSION \"1.16\"\n#define HAVE_INTTYPES_H 1\n#endif\n" }, { "path": "libs/potrace/curve.c", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n/* private part of the path and curve data structures */\n\n#ifdef HAVE_CONFIG_H\n#include \n#endif\n\n#include \n#include \n#include \n\n#include \"potracelib.h\"\n#include \"lists.h\"\n#include \"curve.h\"\n\n#define SAFE_CALLOC(var, n, typ) \\\n if ((var = (typ *)calloc(n, sizeof(typ))) == NULL) goto calloc_error \n\n/* ---------------------------------------------------------------------- */\n/* allocate and free path objects */\n\npath_t *path_new(void) {\n path_t *p = NULL;\n privpath_t *priv = NULL;\n\n SAFE_CALLOC(p, 1, path_t);\n memset(p, 0, sizeof(path_t));\n SAFE_CALLOC(priv, 1, privpath_t);\n memset(priv, 0, sizeof(privpath_t));\n p->priv = priv;\n return p;\n\n calloc_error:\n free(p);\n free(priv);\n return NULL;\n}\n\n/* free the members of the given curve structure. Leave errno unchanged. */\nstatic void privcurve_free_members(privcurve_t *curve) {\n free(curve->tag);\n free(curve->c);\n free(curve->vertex);\n free(curve->alpha);\n free(curve->alpha0);\n free(curve->beta);\n}\n\n/* free a path. Leave errno untouched. */\nvoid path_free(path_t *p) {\n if (p) {\n if (p->priv) {\n free(p->priv->pt);\n free(p->priv->lon);\n free(p->priv->sums);\n free(p->priv->po);\n privcurve_free_members(&p->priv->curve);\n privcurve_free_members(&p->priv->ocurve);\n }\n free(p->priv);\n /* do not free p->fcurve ! */\n }\n free(p);\n} \n\n/* free a pathlist, leaving errno untouched. */\nvoid pathlist_free(path_t *plist) {\n path_t *p;\n\n list_forall_unlink(p, plist) {\n path_free(p);\n }\n}\n\n/* ---------------------------------------------------------------------- */\n/* initialize and finalize curve structures */\n\ntypedef dpoint_t dpoint3_t[3];\n\n/* initialize the members of the given curve structure to size m.\n Return 0 on success, 1 on error with errno set. */\nint privcurve_init(privcurve_t *curve, int n) {\n memset(curve, 0, sizeof(privcurve_t));\n curve->n = n;\n SAFE_CALLOC(curve->tag, n, int);\n SAFE_CALLOC(curve->c, n, dpoint3_t);\n SAFE_CALLOC(curve->vertex, n, dpoint_t);\n SAFE_CALLOC(curve->alpha, n, double);\n SAFE_CALLOC(curve->alpha0, n, double);\n SAFE_CALLOC(curve->beta, n, double);\n return 0;\n\n calloc_error:\n free(curve->tag);\n free(curve->c);\n free(curve->vertex);\n free(curve->alpha);\n free(curve->alpha0);\n free(curve->beta);\n return 1;\n}\n\n/* copy private to public curve structure */\nvoid privcurve_to_curve(privcurve_t *pc, potrace_curve_t *c) {\n c->n = pc->n;\n c->tag = pc->tag;\n c->c = pc->c;\n}\n \n" }, { "path": "libs/potrace/curve.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n#ifndef CURVE_H\n#define CURVE_H\n\n#include \"auxiliary.h\"\n\n/* vertex is c[1] for tag=POTRACE_CORNER, and the intersection of\n .c[-1][2]..c[0] and c[1]..c[2] for tag=POTRACE_CURVETO. alpha is only\n defined for tag=POTRACE_CURVETO and is the alpha parameter of the curve:\n .c[-1][2]..c[0] = alpha*(.c[-1][2]..vertex), and\n c[2]..c[1] = alpha*(c[2]..vertex).\n Beta is so that (.beta[i])[.vertex[i],.vertex[i+1]] = .c[i][2].\n*/\n\nstruct privcurve_s {\n int n; /* number of segments */\n int *tag; /* tag[n]: POTRACE_CORNER or POTRACE_CURVETO */\n dpoint_t (*c)[3]; /* c[n][i]: control points. \n\t\t c[n][0] is unused for tag[n]=POTRACE_CORNER */\n /* the remainder of this structure is special to privcurve, and is\n used in EPS debug output and special EPS \"short coding\". These\n fields are valid only if \"alphacurve\" is set. */\n int alphacurve; /* have the following fields been initialized? */\n dpoint_t *vertex; /* for POTRACE_CORNER, this equals c[1] */\n double *alpha; /* only for POTRACE_CURVETO */\n double *alpha0; /* \"uncropped\" alpha parameter - for debug output only */\n double *beta;\n};\ntypedef struct privcurve_s privcurve_t;\n\nstruct sums_s {\n double x;\n double y;\n double x2;\n double xy;\n double y2;\n};\ntypedef struct sums_s sums_t;\n\n/* the path structure is filled in with information about a given path\n as it is accumulated and passed through the different stages of the\n Potrace algorithm. Backends only need to read the fcurve and fm\n fields of this data structure, but debugging backends may read\n other fields. */\nstruct potrace_privpath_s {\n int len;\n point_t *pt; /* pt[len]: path as extracted from bitmap */\n int *lon; /* lon[len]: (i,lon[i]) = longest straight line from i */\n\n int x0, y0; /* origin for sums */\n sums_t *sums; /* sums[len+1]: cache for fast summing */\n\n int m; /* length of optimal polygon */\n int *po; /* po[m]: optimal polygon */\n\n privcurve_t curve; /* curve[m]: array of curve elements */\n privcurve_t ocurve; /* ocurve[om]: array of curve elements */\n privcurve_t *fcurve; /* final curve: this points to either curve or\n\t\t ocurve. Do not free this separately. */\n};\ntypedef struct potrace_privpath_s potrace_privpath_t;\n\n/* shorter names */\ntypedef potrace_privpath_t privpath_t;\ntypedef potrace_path_t path_t;\n\npath_t *path_new(void);\nvoid path_free(path_t *p);\nvoid pathlist_free(path_t *plist);\nint privcurve_init(privcurve_t *curve, int n);\nvoid privcurve_to_curve(privcurve_t *pc, potrace_curve_t *c);\n\n#endif /* CURVE_H */\n\n" }, { "path": "libs/potrace/decompose.c", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n#ifdef HAVE_CONFIG_H\n#include \n#endif\n\n#include \n#include \n#include \n#include \n#ifdef HAVE_INTTYPES_H\n#include \n#endif\n\n#include \"potracelib.h\"\n#include \"curve.h\"\n#include \"lists.h\"\n#include \"bitmap.h\"\n#include \"decompose.h\"\n#include \"progress.h\"\n\n/* ---------------------------------------------------------------------- */\n/* deterministically and efficiently hash (x,y) into a pseudo-random bit */\n\nstatic inline int detrand(int x, int y) {\n unsigned int z;\n static const unsigned char t[256] = { \n /* non-linear sequence: constant term of inverse in GF(8), \n mod x^8+x^4+x^3+x+1 */\n 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, \n 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, \n 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, \n 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, \n 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, \n 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, \n 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, \n 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, \n 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, \n 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, \n 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, \n };\n\n /* 0x04b3e375 and 0x05a8ef93 are chosen to contain every possible\n 5-bit sequence */\n z = ((0x04b3e375 * x) ^ y) * 0x05a8ef93;\n z = t[z & 0xff] ^ t[(z>>8) & 0xff] ^ t[(z>>16) & 0xff] ^ t[(z>>24) & 0xff];\n return z;\n}\n\n/* ---------------------------------------------------------------------- */\n/* auxiliary bitmap manipulations */\n\n/* set the excess padding to 0 */\nstatic void bm_clearexcess(potrace_bitmap_t *bm) {\n potrace_word mask;\n int y;\n\n if (bm->w % BM_WORDBITS != 0) {\n mask = BM_ALLBITS << (BM_WORDBITS - (bm->w % BM_WORDBITS));\n for (y=0; yh; y++) {\n *bm_index(bm, bm->w, y) &= mask;\n }\n }\n}\n\nstruct bbox_s {\n int x0, x1, y0, y1; /* bounding box */\n};\ntypedef struct bbox_s bbox_t;\n\n/* clear the bm, assuming the bounding box is set correctly (faster\n than clearing the whole bitmap) */\nstatic void clear_bm_with_bbox(potrace_bitmap_t *bm, bbox_t *bbox) {\n int imin = (bbox->x0 / BM_WORDBITS);\n int imax = ((bbox->x1 + BM_WORDBITS-1) / BM_WORDBITS);\n int i, y;\n\n for (y=bbox->y0; yy1; y++) {\n for (i=imin; i0) {\n return 1;\n } else if (ct<0) {\n return 0;\n }\n }\n return 0;\n}\n\n/* ---------------------------------------------------------------------- */\n/* decompose image into paths */\n\n/* efficiently invert bits [x,infty) and [xa,infty) in line y. Here xa\n must be a multiple of BM_WORDBITS. */\nstatic void xor_to_ref(potrace_bitmap_t *bm, int x, int y, int xa) {\n int xhi = x & -BM_WORDBITS;\n int xlo = x & (BM_WORDBITS-1); /* = x % BM_WORDBITS */\n int i;\n \n if (xhipriv->len <= 0) { /* a path of length 0 is silly, but legal */\n return;\n }\n\n y1 = p->priv->pt[p->priv->len-1].y;\n\n xa = p->priv->pt[0].x & -BM_WORDBITS;\n for (k=0; kpriv->len; k++) {\n x = p->priv->pt[k].x;\n y = p->priv->pt[k].y;\n\n if (y != y1) {\n /* efficiently invert the rectangle [x,xa] x [y,y1] */\n xor_to_ref(bm, x, min(y,y1), xa);\n y1 = y;\n }\n }\n}\n\n/* Find the bounding box of a given path. Path is assumed to be of\n non-zero length. */\nstatic void setbbox_path(bbox_t *bbox, path_t *p) {\n int x, y;\n int k;\n\n bbox->y0 = INT_MAX;\n bbox->y1 = 0;\n bbox->x0 = INT_MAX;\n bbox->x1 = 0;\n\n for (k=0; kpriv->len; k++) {\n x = p->priv->pt[k].x;\n y = p->priv->pt[k].y;\n\n if (x < bbox->x0) {\n bbox->x0 = x;\n }\n if (x > bbox->x1) {\n bbox->x1 = x;\n }\n if (y < bbox->y0) {\n bbox->y0 = y;\n }\n if (y > bbox->y1) {\n bbox->y1 = y;\n }\n }\n}\n\n/* compute a path in the given pixmap, separating black from white.\n Start path at the point (x0,x1), which must be an upper left corner\n of the path. Also compute the area enclosed by the path. Return a\n new path_t object, or NULL on error (note that a legitimate path\n cannot have length 0). Sign is required for correct interpretation\n of turnpolicies. */\nstatic path_t *findpath(potrace_bitmap_t *bm, int x0, int y0, int sign, int turnpolicy) {\n int x, y, dirx, diry, len, size;\n uint64_t area;\n int c, d, tmp;\n point_t *pt, *pt1;\n path_t *p = NULL;\n\n x = x0;\n y = y0;\n dirx = 0;\n diry = -1;\n\n len = size = 0;\n pt = NULL;\n area = 0;\n \n while (1) {\n /* add point to path */\n if (len>=size) {\n size += 100;\n size = (int)(1.3 * size);\n pt1 = (point_t *)realloc(pt, size * sizeof(point_t));\n if (!pt1) {\n\tgoto error;\n }\n pt = pt1;\n }\n pt[len].x = x;\n pt[len].y = y;\n len++;\n \n /* move to next point */\n x += dirx;\n y += diry;\n area += x*diry;\n \n /* path complete? */\n if (x==x0 && y==y0) {\n break;\n }\n \n /* determine next direction */\n c = BM_GET(bm, x + (dirx+diry-1)/2, y + (diry-dirx-1)/2);\n d = BM_GET(bm, x + (dirx-diry-1)/2, y + (diry+dirx-1)/2);\n \n if (c && !d) { /* ambiguous turn */\n if (turnpolicy == POTRACE_TURNPOLICY_RIGHT\n\t || (turnpolicy == POTRACE_TURNPOLICY_BLACK && sign == '+')\n\t || (turnpolicy == POTRACE_TURNPOLICY_WHITE && sign == '-')\n\t || (turnpolicy == POTRACE_TURNPOLICY_RANDOM && detrand(x,y))\n\t || (turnpolicy == POTRACE_TURNPOLICY_MAJORITY && majority(bm, x, y))\n\t || (turnpolicy == POTRACE_TURNPOLICY_MINORITY && !majority(bm, x, y))) {\n\ttmp = dirx; /* right turn */\n\tdirx = diry;\n\tdiry = -tmp;\n } else {\n\ttmp = dirx; /* left turn */\n\tdirx = -diry;\n\tdiry = tmp;\n }\n } else if (c) { /* right turn */\n tmp = dirx;\n dirx = diry;\n diry = -tmp;\n } else if (!d) { /* left turn */\n tmp = dirx;\n dirx = -diry;\n diry = tmp;\n }\n } /* while this path */\n\n /* allocate new path object */\n p = path_new();\n if (!p) {\n goto error;\n }\n\n p->priv->pt = pt;\n p->priv->len = len;\n p->area = area <= INT_MAX ? area : INT_MAX; /* avoid overflow */\n p->sign = sign;\n\n return p;\n \n error:\n free(pt);\n return NULL; \n}\n\n/* Give a tree structure to the given path list, based on \"insideness\"\n testing. I.e., path A is considered \"below\" path B if it is inside\n path B. The input pathlist is assumed to be ordered so that \"outer\"\n paths occur before \"inner\" paths. The tree structure is stored in\n the \"childlist\" and \"sibling\" components of the path_t\n structure. The linked list structure is also changed so that\n negative path components are listed immediately after their\n positive parent. Note: some backends may ignore the tree\n structure, others may use it e.g. to group path components. We\n assume that in the input, point 0 of each path is an \"upper left\"\n corner of the path, as returned by bm_to_pathlist. This makes it\n easy to find an \"interior\" point. The bm argument should be a\n bitmap of the correct size (large enough to hold all the paths),\n and will be used as scratch space. Return 0 on success or -1 on\n error with errno set. */\n\nstatic void pathlist_to_tree(path_t *plist, potrace_bitmap_t *bm) {\n path_t *p, *p1;\n path_t *heap, *heap1;\n path_t *cur;\n path_t *head;\n path_t **plist_hook; /* for fast appending to linked list */\n path_t **hook_in, **hook_out; /* for fast appending to linked list */\n bbox_t bbox;\n \n bm_clear(bm, 0);\n\n /* save original \"next\" pointers */\n list_forall(p, plist) {\n p->sibling = p->next;\n p->childlist = NULL;\n }\n \n heap = plist;\n\n /* the heap holds a list of lists of paths. Use \"childlist\" field\n for outer list, \"next\" field for inner list. Each of the sublists\n is to be turned into a tree. This code is messy, but it is\n actually fast. Each path is rendered exactly once. We use the\n heap to get a tail recursive algorithm: the heap holds a list of\n pathlists which still need to be transformed. */\n\n while (heap) {\n /* unlink first sublist */\n cur = heap;\n heap = heap->childlist;\n cur->childlist = NULL;\n \n /* unlink first path */\n head = cur;\n cur = cur->next;\n head->next = NULL;\n\n /* render path */\n xor_path(bm, head);\n setbbox_path(&bbox, head);\n\n /* now do insideness test for each element of cur; append it to\n head->childlist if it's inside head, else append it to\n head->next. */\n hook_in=&head->childlist;\n hook_out=&head->next;\n list_forall_unlink(p, cur) {\n if (p->priv->pt[0].y <= bbox.y0) {\n\tlist_insert_beforehook(p, hook_out);\n\t/* append the remainder of the list to hook_out */\n\t*hook_out = cur;\n\tbreak;\n }\n if (BM_GET(bm, p->priv->pt[0].x, p->priv->pt[0].y-1)) {\n\tlist_insert_beforehook(p, hook_in);\n } else {\n\tlist_insert_beforehook(p, hook_out);\n }\n }\n\n /* clear bm */\n clear_bm_with_bbox(bm, &bbox);\n\n /* now schedule head->childlist and head->next for further\n processing */\n if (head->next) {\n head->next->childlist = heap;\n heap = head->next;\n }\n if (head->childlist) {\n head->childlist->childlist = heap;\n heap = head->childlist;\n }\n }\n \n /* copy sibling structure from \"next\" to \"sibling\" component */\n p = plist;\n while (p) {\n p1 = p->sibling;\n p->sibling = p->next;\n p = p1;\n }\n\n /* reconstruct a new linked list (\"next\") structure from tree\n (\"childlist\", \"sibling\") structure. This code is slightly messy,\n because we use a heap to make it tail recursive: the heap\n contains a list of childlists which still need to be\n processed. */\n heap = plist;\n if (heap) {\n heap->next = NULL; /* heap is a linked list of childlists */\n }\n plist = NULL;\n plist_hook = &plist;\n while (heap) {\n heap1 = heap->next;\n for (p=heap; p; p=p->sibling) {\n /* p is a positive path */\n /* append to linked list */\n list_insert_beforehook(p, plist_hook);\n \n /* go through its children */\n for (p1=p->childlist; p1; p1=p1->sibling) {\n\t/* append to linked list */\n\tlist_insert_beforehook(p1, plist_hook);\n\t/* append its childlist to heap, if non-empty */\n\tif (p1->childlist) {\n\t list_append(path_t, heap1, p1->childlist);\n\t}\n }\n }\n heap = heap1;\n }\n\n return;\n}\n\n/* find the next set pixel in a row <= y. Pixels are searched first\n left-to-right, then top-down. In other words, (x,y)<(x',y') if y>y'\n or y=y' and x=0; y--) {\n for (x=x0; xw && x>=0; x+=(unsigned)BM_WORDBITS) {\n if (*bm_index(bm, x, y)) {\n\twhile (!BM_GET(bm, x, y)) {\n\t x++;\n\t}\n\t/* found */\n\t*xp = x;\n\t*yp = y;\n\treturn 0;\n }\n }\n x0 = 0;\n }\n /* not found */\n return 1;\n}\n\n/* Decompose the given bitmap into paths. Returns a linked list of\n path_t objects with the fields len, pt, area, sign filled\n in. Returns 0 on success with plistp set, or -1 on error with errno\n set. */\n\nint bm_to_pathlist(const potrace_bitmap_t *bm, path_t **plistp, const potrace_param_t *param, progress_t *progress) {\n int x;\n int y;\n path_t *p;\n path_t *plist = NULL; /* linked list of path objects */\n path_t **plist_hook = &plist; /* used to speed up appending to linked list */\n potrace_bitmap_t *bm1 = NULL;\n int sign;\n\n bm1 = bm_dup(bm);\n if (!bm1) {\n goto error;\n }\n\n /* be sure the byte padding on the right is set to 0, as the fast\n pixel search below relies on it */\n bm_clearexcess(bm1);\n\n /* iterate through components */\n x = 0;\n y = bm1->h - 1;\n while (findnext(bm1, &x, &y) == 0) { \n /* calculate the sign by looking at the original */\n sign = BM_GET(bm, x, y) ? '+' : '-';\n\n /* calculate the path */\n p = findpath(bm1, x, y+1, sign, param->turnpolicy);\n if (p==NULL) {\n goto error;\n }\n\n /* update buffered image */\n xor_path(bm1, p);\n\n /* if it's a turd, eliminate it, else append it to the list */\n if (p->area <= param->turdsize) {\n path_free(p);\n } else {\n list_insert_beforehook(p, plist_hook);\n }\n\n if (bm1->h > 0) { /* to be sure */\n progress_update(1-y/(double)bm1->h, progress);\n }\n }\n\n pathlist_to_tree(plist, bm1);\n bm_free(bm1);\n *plistp = plist;\n\n progress_update(1.0, progress);\n\n return 0;\n\n error:\n bm_free(bm1);\n list_forall_unlink(p, plist) {\n path_free(p);\n }\n return -1;\n}\n" }, { "path": "libs/potrace/decompose.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n\n#ifndef DECOMPOSE_H\n#define DECOMPOSE_H\n\n#include \"potracelib.h\"\n#include \"progress.h\"\n#include \"curve.h\"\n\nint bm_to_pathlist(const potrace_bitmap_t *bm, path_t **plistp, const potrace_param_t *param, progress_t *progress);\n\n#endif /* DECOMPOSE_H */\n\n" }, { "path": "libs/potrace/lists.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n\n#ifndef _PS_LISTS_H\n#define _PS_LISTS_H\n\n/* here we define some general list macros. Because they are macros,\n they should work on any datatype with a \"->next\" component. Some of\n them use a \"hook\". If elt and list are of type t* then hook is of\n type t**. A hook stands for an insertion point in the list, i.e.,\n either before the first element, or between two elements, or after\n the last element. If an operation \"sets the hook\" for an element,\n then the hook is set to just before the element. One can insert\n something at a hook. One can also unlink at a hook: this means,\n unlink the element just after the hook. By \"to unlink\", we mean the\n element is removed from the list, but not deleted. Thus, it and its\n components still need to be freed. */\n\n/* Note: these macros are somewhat experimental. Only the ones that\n are actually *used* have been tested. So be careful to test any\n that you use. Looking at the output of the preprocessor, \"gcc -E\"\n (possibly piped though \"indent\"), might help too. Also: these\n macros define some internal (local) variables that start with\n \"_\". */\n\n/* we enclose macro definitions whose body consists of more than one\n statement in MACRO_BEGIN and MACRO_END, rather than '{' and '}'. The\n reason is that we want to be able to use the macro in a context\n such as \"if (...) macro(...); else ...\". If we didn't use this obscure\n trick, we'd have to omit the \";\" in such cases. */\n\n#define MACRO_BEGIN do {\n#define MACRO_END } while (0)\n\n/* ---------------------------------------------------------------------- */\n/* macros for singly-linked lists */\n\n/* traverse list. At the end, elt is set to NULL. */\n#define list_forall(elt, list) for (elt=list; elt!=NULL; elt=elt->next)\n\n/* set elt to the first element of list satisfying boolean condition\n c, or NULL if not found */\n#define list_find(elt, list, c) \\\n MACRO_BEGIN list_forall(elt, list) if (c) break; MACRO_END\n\n/* like forall, except also set hook for elt. */\n#define list_forall2(elt, list, hook) \\\n for (elt=list, hook=&list; elt!=NULL; hook=&elt->next, elt=elt->next)\n\n/* same as list_find, except also set hook for elt. */\n#define list_find2(elt, list, c, hook) \\\n MACRO_BEGIN list_forall2(elt, list, hook) if (c) break; MACRO_END\n\n/* same, except only use hook. */\n#define _list_forall_hook(list, hook) \\\n for (hook=&list; *hook!=NULL; hook=&(*hook)->next)\n\n/* same, except only use hook. Note: c may only refer to *hook, not elt. */\n#define _list_find_hook(list, c, hook) \\\n MACRO_BEGIN _list_forall_hook(list, hook) if (c) break; MACRO_END\n\n/* insert element after hook */\n#define list_insert_athook(elt, hook) \\\n MACRO_BEGIN elt->next = *hook; *hook = elt; MACRO_END\n\n/* insert element before hook */\n#define list_insert_beforehook(elt, hook) \\\n MACRO_BEGIN elt->next = *hook; *hook = elt; hook=&elt->next; MACRO_END\n\n/* unlink element after hook, let elt be unlinked element, or NULL.\n hook remains. */\n#define list_unlink_athook(list, elt, hook) \\\n MACRO_BEGIN \\\n elt = hook ? *hook : NULL; if (elt) { *hook = elt->next; elt->next = NULL; }\\\n MACRO_END\n\n/* unlink the specific element, if it is in the list. Otherwise, set\n elt to NULL */\n#define list_unlink(listtype, list, elt) \\\n MACRO_BEGIN \t \t \t \t \\\n listtype **_hook;\t\t\t \\\n _list_find_hook(list, *_hook==elt, _hook); \\\n list_unlink_athook(list, elt, _hook);\t \\\n MACRO_END\n\n/* prepend elt to list */\n#define list_prepend(list, elt) \\\n MACRO_BEGIN elt->next = list; list = elt; MACRO_END\n\n/* append elt to list. */\n#define list_append(listtype, list, elt) \\\n MACRO_BEGIN \\\n listtype **_hook; \\\n _list_forall_hook(list, _hook) {} \\\n list_insert_athook(elt, _hook); \\\n MACRO_END\n\n/* unlink the first element that satisfies the condition. */\n#define list_unlink_cond(listtype, list, elt, c) \\\n MACRO_BEGIN \\\n listtype **_hook;\t\t\t \t \\\n list_find2(elt, list, c, _hook); \\\n list_unlink_athook(list, elt, _hook); \\\n MACRO_END\n\n/* let elt be the nth element of the list, starting to count from 0.\n Return NULL if out of bounds. */\n#define list_nth(elt, list, n) \\\n MACRO_BEGIN \\\n int _x; /* only evaluate n once */ \\\n for (_x=(n), elt=list; _x && elt; _x--, elt=elt->next) {} \\\n MACRO_END\n\n/* let elt be the nth element of the list, starting to count from 0.\n Return NULL if out of bounds. */\n#define list_nth_hook(elt, list, n, hook) \\\n MACRO_BEGIN \\\n int _x; /* only evaluate n once */ \\\n for (_x=(n), elt=list, hook=&list; _x && elt; _x--, hook=&elt->next, elt=elt->next) {} \\\n MACRO_END\n\n/* set n to the length of the list */\n#define list_length(listtype, list, n) \\\n MACRO_BEGIN \t \t \t \t \t \\\n listtype *_elt; \t\t\t \t\t \\\n n=0;\t\t\t\t\t \t\t \\\n list_forall(_elt, list) \t\t \t\t \\\n n++;\t\t\t\t \t\t \\\n MACRO_END\n\n/* set n to the index of the first element satisfying cond, or -1 if\n none found. Also set elt to the element, or NULL if none found. */\n#define list_index(list, n, elt, c) \\\n MACRO_BEGIN\t\t\t\t \t\t \\\n n=0;\t\t\t\t\t \t\t \\\n list_forall(elt, list) {\t\t \t\t \\\n if (c) break;\t\t\t \t\t \\\n n++;\t\t\t\t \t\t \\\n }\t\t\t\t\t \t\t \\\n if (!elt)\t\t\t\t \t\t \\\n n=-1;\t\t\t\t \t\t \\\n MACRO_END\n\n/* set n to the number of elements in the list that satisfy condition c */\n#define list_count(list, n, elt, c) \\\n MACRO_BEGIN\t\t\t\t \t\t \\\n n=0;\t\t\t\t\t \t\t \\\n list_forall(elt, list) {\t\t \t\t \\\n if (c) n++;\t\t\t\t \t\t \\\n } \\\n MACRO_END\n\n/* let elt be each element of the list, unlinked. At the end, set list=NULL. */\n#define list_forall_unlink(elt, list) \\\n for (elt=list; elt ? (list=elt->next, elt->next=NULL), 1 : 0; elt=list)\n\n/* reverse a list (efficient) */\n#define list_reverse(listtype, list) \\\n MACRO_BEGIN\t\t\t\t \t\\\n listtype *_list1=NULL, *elt;\t\t\t\\\n list_forall_unlink(elt, list) \t\t\\\n list_prepend(_list1, elt);\t\t\t\\\n list = _list1;\t\t\t\t\\\n MACRO_END\n\n/* insert the element ELT just before the first element TMP of the\n list for which COND holds. Here COND must be a condition of ELT and\n TMP. Typical usage is to insert an element into an ordered list:\n for instance, list_insert_ordered(listtype, list, elt, tmp,\n elt->size <= tmp->size). Note: if we give a \"less than or equal\"\n condition, the new element will be inserted just before a sequence\n of equal elements. If we give a \"less than\" condition, the new\n element will be inserted just after a list of equal elements.\n Note: it is much more efficient to construct a list with\n list_prepend and then order it with list_merge_sort, than to\n construct it with list_insert_ordered. */\n#define list_insert_ordered(listtype, list, elt, tmp, cond) \\\n MACRO_BEGIN \\\n listtype **_hook; \\\n _list_find_hook(list, (tmp=*_hook, (cond)), _hook); \\\n list_insert_athook(elt, _hook); \\\n MACRO_END\n\n/* sort the given list, according to the comparison condition.\n Typical usage is list_sort(listtype, list, a, b, a->size <\n b->size). Note: if we give \"less than or equal\" condition, each\n segment of equal elements will be reversed in order. If we give a\n \"less than\" condition, each segment of equal elements will retain\n the original order. The latter is slower but sometimes\n prettier. Average running time: n*n/2. */\n#define list_sort(listtype, list, a, b, cond) \\\n MACRO_BEGIN \\\n listtype *_newlist=NULL; \\\n list_forall_unlink(a, list) \\\n list_insert_ordered(listtype, _newlist, a, b, cond); \\\n list = _newlist; \\\n MACRO_END\n\n/* a much faster sort algorithm (merge sort, n log n worst case). It\n is required that the list type has an additional, unused next1\n component. Note there is no curious reversal of order of equal\n elements as for list_sort. */\n\n#define list_mergesort(listtype, list, a, b, cond) \\\n MACRO_BEGIN\t\t\t\t\t\t \\\n listtype *_elt, **_hook1;\t\t\t\t \t\\\n\t\t\t\t\t\t\t \t\\\n for (_elt=list; _elt; _elt=_elt->next1) {\t\t\t\\\n _elt->next1 = _elt->next;\t\t\t\t \t\\\n _elt->next = NULL;\t\t\t\t\t \t\\\n }\t\t\t\t\t\t\t \t\\\n do {\t\t\t \t \t\\\n _hook1 = &(list);\t\t\t\t \t \t\\\n while ((a = *_hook1) != NULL && (b = a->next1) != NULL ) { \\\n _elt = b->next1;\t\t\t\t\t \t\\\n _list_merge_cond(listtype, a, b, cond, *_hook1); \t\\\n _hook1 = &((*_hook1)->next1);\t\t\t \t\\\n *_hook1 = _elt;\t\t\t\t \t\\\n }\t\t\t\t\t\t\t \t\\\n } while (_hook1 != &(list)); \t\\\n MACRO_END\n\n/* merge two sorted lists. Store result at &result */\n#define _list_merge_cond(listtype, a, b, cond, result) \\\n MACRO_BEGIN \\\n listtype **_hook;\t\t\t\t\t \\\n _hook = &(result);\t\t\t\t\t \\\n while (1) { \\\n if (a==NULL) {\t\t\t\t\t \\\n *_hook = b;\t\t\t\t\t \\\n break;\t\t\t\t\t\t \\\n } else if (b==NULL) {\t\t\t\t \\\n *_hook = a;\t\t\t\t\t \\\n break;\t\t\t\t\t\t \\\n } else if (cond) {\t\t\t\t\t \\\n *_hook = a;\t\t\t\t\t \\\n _hook = &(a->next);\t\t\t\t \\\n a = a->next;\t\t\t\t\t \\\n } else {\t\t\t\t\t\t \\\n *_hook = b;\t\t\t\t\t \\\n _hook = &(b->next);\t\t\t\t \\\n b = b->next;\t\t\t\t\t \\\n }\t\t\t\t\t\t\t \\\n }\t\t\t\t\t\t\t \\\n MACRO_END\n\n/* ---------------------------------------------------------------------- */\n/* macros for doubly-linked lists */\n\n#define dlist_append(head, end, elt) \\\n MACRO_BEGIN \t \t \t \t \t \t \\\n elt->prev = end;\t\t\t\t\t \\\n elt->next = NULL;\t\t\t\t\t \\\n if (end) {\t\t\t\t\t\t \\\n end->next = elt;\t\t\t\t\t \\\n } else { \t\t\t\t\t\t \\\n head = elt;\t\t\t\t\t\t \\\n }\t \t\t\t\t\t\t \\\n end = elt;\t\t\t\t\t\t \\\n MACRO_END\n\n/* let elt be each element of the list, unlinked. At the end, set list=NULL. */\n#define dlist_forall_unlink(elt, head, end) \\\n for (elt=head; elt ? (head=elt->next, elt->next=NULL, elt->prev=NULL), 1 : (end=NULL, 0); elt=head)\n\n/* unlink the first element of the list */\n#define dlist_unlink_first(head, end, elt) \\\n MACRO_BEGIN\t\t\t\t \t \t \\\n elt = head;\t\t\t\t\t\t \\\n if (head) {\t\t\t\t\t\t \\\n head = head->next;\t\t\t\t\t \\\n if (head) {\t\t\t\t\t\t \\\n head->prev = NULL;\t\t\t\t \\\n } else {\t\t\t\t\t\t \\\n end = NULL;\t\t\t\t\t \\\n } \t\t\t\t\t\t \\\n elt->prev = NULL;\t\t\t\t\t \\\n elt->next = NULL;\t\t\t\t\t \\\n }\t\t\t\t\t\t\t \\\n MACRO_END\n\n#endif /* _PS_LISTS_H */\n\n" }, { "path": "libs/potrace/potracelib.c", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n#ifdef HAVE_CONFIG_H\n#include \n#endif\n\n#include \n#include \n\n#include \"potracelib.h\"\n#include \"curve.h\"\n#include \"decompose.h\"\n#include \"trace.h\"\n#include \"progress.h\"\n\n/* default parameters */\nstatic const potrace_param_t param_default = {\n 2, /* turdsize */\n POTRACE_TURNPOLICY_MINORITY, /* turnpolicy */\n 1.0, /* alphamax */\n 1, /* opticurve */\n 0.2, /* opttolerance */\n {\n NULL, /* callback function */\n NULL, /* callback data */\n 0.0, 1.0, /* progress range */\n 0.0, /* granularity */\n },\n};\n\n/* Return a fresh copy of the set of default parameters, or NULL on\n failure with errno set. */\npotrace_param_t *potrace_param_default(void) {\n potrace_param_t *p;\n\n p = (potrace_param_t *) malloc(sizeof(potrace_param_t));\n if (!p) {\n return NULL;\n }\n memcpy(p, ¶m_default, sizeof(potrace_param_t));\n return p;\n}\n\n/* On success, returns a Potrace state st with st->status ==\n POTRACE_STATUS_OK. On failure, returns NULL if no Potrace state\n could be created (with errno set), or returns an incomplete Potrace\n state (with st->status == POTRACE_STATUS_INCOMPLETE, and with errno\n set). Complete or incomplete Potrace state can be freed with\n potrace_state_free(). */\npotrace_state_t *potrace_trace(const potrace_param_t *param, const potrace_bitmap_t *bm) {\n int r;\n path_t *plist = NULL;\n potrace_state_t *st;\n progress_t prog;\n progress_t subprog;\n \n /* prepare private progress bar state */\n prog.callback = param->progress.callback;\n prog.data = param->progress.data;\n prog.min = param->progress.min;\n prog.max = param->progress.max;\n prog.epsilon = param->progress.epsilon;\n prog.d_prev = param->progress.min;\n\n /* allocate state object */\n st = (potrace_state_t *)malloc(sizeof(potrace_state_t));\n if (!st) {\n return NULL;\n }\n\n progress_subrange_start(0.0, 0.1, &prog, &subprog);\n\n /* process the image */\n r = bm_to_pathlist(bm, &plist, param, &subprog);\n if (r) {\n free(st);\n return NULL;\n }\n\n st->status = POTRACE_STATUS_OK;\n st->plist = plist;\n st->priv = NULL; /* private state currently unused */\n\n progress_subrange_end(&prog, &subprog);\n\n progress_subrange_start(0.1, 1.0, &prog, &subprog);\n\n /* partial success. */\n r = process_path(plist, param, &subprog);\n if (r) {\n st->status = POTRACE_STATUS_INCOMPLETE;\n }\n\n progress_subrange_end(&prog, &subprog);\n\n return st;\n}\n\n/* free a Potrace state, without disturbing errno. */\nvoid potrace_state_free(potrace_state_t *st) {\n pathlist_free(st->plist);\n free(st);\n}\n\n/* free a parameter list, without disturbing errno. */\nvoid potrace_param_free(potrace_param_t *p) {\n free(p);\n}\n\nconst char *potrace_version(void) {\n return \"potracelib \" VERSION \"\";\n}\n" }, { "path": "libs/potrace/potracelib.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n#ifndef POTRACELIB_H\n#define POTRACELIB_H\n\n/* this file defines the API for the core Potrace library. For a more\n detailed description of the API, see potracelib.pdf */\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n/* ---------------------------------------------------------------------- */\n/* tracing parameters */\n\n/* turn policies */\n#define POTRACE_TURNPOLICY_BLACK 0\n#define POTRACE_TURNPOLICY_WHITE 1\n#define POTRACE_TURNPOLICY_LEFT 2\n#define POTRACE_TURNPOLICY_RIGHT 3\n#define POTRACE_TURNPOLICY_MINORITY 4\n#define POTRACE_TURNPOLICY_MAJORITY 5\n#define POTRACE_TURNPOLICY_RANDOM 6\n\n/* structure to hold progress bar callback data */\nstruct potrace_progress_s {\n void (*callback)(double progress, void *privdata); /* callback fn */\n void *data; /* callback function's private data */\n double min, max; /* desired range of progress, e.g. 0.0 to 1.0 */\n double epsilon; /* granularity: can skip smaller increments */\n};\ntypedef struct potrace_progress_s potrace_progress_t;\n\n/* structure to hold tracing parameters */\nstruct potrace_param_s {\n int turdsize; /* area of largest path to be ignored */\n int turnpolicy; /* resolves ambiguous turns in path decomposition */\n double alphamax; /* corner threshold */\n int opticurve; /* use curve optimization? */\n double opttolerance; /* curve optimization tolerance */\n potrace_progress_t progress; /* progress callback function */\n};\ntypedef struct potrace_param_s potrace_param_t;\n\n/* ---------------------------------------------------------------------- */\n/* bitmaps */\n\n/* native word size */\ntypedef unsigned long potrace_word;\n\n/* Internal bitmap format. The n-th scanline starts at scanline(n) =\n (map + n*dy). Raster data is stored as a sequence of potrace_words\n (NOT bytes). The leftmost bit of scanline n is the most significant\n bit of scanline(n)[0]. */\nstruct potrace_bitmap_s {\n int w, h; /* width and height, in pixels */\n int dy; /* words per scanline (not bytes) */\n potrace_word *map; /* raw data, dy*h words */\n};\ntypedef struct potrace_bitmap_s potrace_bitmap_t;\n\n/* ---------------------------------------------------------------------- */\n/* curves */\n\n/* point */\nstruct potrace_dpoint_s {\n double x, y;\n};\ntypedef struct potrace_dpoint_s potrace_dpoint_t;\n\n/* segment tags */\n#define POTRACE_CURVETO 1\n#define POTRACE_CORNER 2\n\n/* closed curve segment */\nstruct potrace_curve_s {\n int n; /* number of segments */\n int *tag; /* tag[n]: POTRACE_CURVETO or POTRACE_CORNER */\n potrace_dpoint_t (*c)[3]; /* c[n][3]: control points. \n\t\t\t c[n][0] is unused for tag[n]=POTRACE_CORNER */\n};\ntypedef struct potrace_curve_s potrace_curve_t;\n\n/* Linked list of signed curve segments. Also carries a tree structure. */\nstruct potrace_path_s {\n int area; /* area of the bitmap path */\n int sign; /* '+' or '-', depending on orientation */\n potrace_curve_t curve; /* this path's vector data */\n\n struct potrace_path_s *next; /* linked list structure */\n\n struct potrace_path_s *childlist; /* tree structure */\n struct potrace_path_s *sibling; /* tree structure */\n\n struct potrace_privpath_s *priv; /* private state */\n};\ntypedef struct potrace_path_s potrace_path_t; \n\n/* ---------------------------------------------------------------------- */\n/* Potrace state */\n\n#define POTRACE_STATUS_OK 0\n#define POTRACE_STATUS_INCOMPLETE 1\n\nstruct potrace_state_s {\n int status; \n potrace_path_t *plist; /* vector data */\n\n struct potrace_privstate_s *priv; /* private state */\n};\ntypedef struct potrace_state_s potrace_state_t;\n\n/* ---------------------------------------------------------------------- */\n/* API functions */\n\n/* get default parameters */\npotrace_param_t *potrace_param_default(void);\n\n/* free parameter set */\nvoid potrace_param_free(potrace_param_t *p);\n\n/* trace a bitmap */\npotrace_state_t *potrace_trace(const potrace_param_t *param, \n\t\t\t const potrace_bitmap_t *bm);\n\n/* free a Potrace state */\nvoid potrace_state_free(potrace_state_t *st);\n\n/* return a static plain text version string identifying this version\n of potracelib */\nconst char *potrace_version(void);\n\n#ifdef __cplusplus\n} /* end of extern \"C\" */\n#endif\n\n#endif /* POTRACELIB_H */\n" }, { "path": "libs/potrace/progress.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n/* operations on potrace_progress_t objects, which are defined in\n potracelib.h. Note: the code attempts to minimize runtime overhead\n when no progress monitoring was requested. It also tries to\n minimize excessive progress calculations beneath the \"epsilon\"\n threshold. */\n\n#ifndef PROGRESS_H\n#define PROGRESS_H\n\n/* structure to hold progress bar callback data */\nstruct progress_s {\n void (*callback)(double progress, void *privdata); /* callback fn */\n void *data; /* callback function's private data */\n double min, max; /* desired range of progress, e.g. 0.0 to 1.0 */\n double epsilon; /* granularity: can skip smaller increments */\n double b; /* upper limit of subrange in superrange units */\n double d_prev; /* previous value of d */\n};\ntypedef struct progress_s progress_t;\n\n/* notify given progress object of current progress. Note that d is\n given in the 0.0-1.0 range, which will be scaled and translated to\n the progress object's range. */\nstatic inline void progress_update(double d, progress_t *prog) {\n double d_scaled;\n\n if (prog != NULL && prog->callback != NULL) {\n d_scaled = prog->min * (1-d) + prog->max * d;\n if (d == 1.0 || d_scaled >= prog->d_prev + prog->epsilon) {\n prog->callback(prog->min * (1-d) + prog->max * d, prog->data);\n prog->d_prev = d_scaled;\n }\n }\n}\n\n/* start a subrange of the given progress object. The range is\n narrowed to [a..b], relative to 0.0-1.0 coordinates. If new range\n is below granularity threshold, disable further subdivisions. */\nstatic inline void progress_subrange_start(double a, double b, const progress_t *prog, progress_t *sub) {\n double min, max;\n\n if (prog == NULL || prog->callback == NULL) {\n sub->callback = NULL;\n return;\n }\n\n min = prog->min * (1-a) + prog->max * a;\n max = prog->min * (1-b) + prog->max * b;\n\n if (max - min < prog->epsilon) {\n sub->callback = NULL; /* no further progress info in subrange */\n sub->b = b;\n return;\n }\n sub->callback = prog->callback;\n sub->data = prog->data;\n sub->epsilon = prog->epsilon;\n sub->min = min;\n sub->max = max;\n sub->d_prev = prog->d_prev;\n return;\n}\n\nstatic inline void progress_subrange_end(progress_t *prog, progress_t *sub) {\n if (prog != NULL && prog->callback != NULL) {\n if (sub->callback == NULL) {\n progress_update(sub->b, prog);\n } else {\n prog->d_prev = sub->d_prev;\n }\n } \n}\n\n#endif /* PROGRESS_H */\n\n" }, { "path": "libs/potrace/trace.c", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n/* transform jaggy paths into smooth curves */\n\n#ifdef HAVE_CONFIG_H\n#include \n#endif\n\n#include \n#include \n#include \n#include \n\n#include \"potracelib.h\"\n#include \"curve.h\"\n#include \"lists.h\"\n#include \"auxiliary.h\"\n#include \"trace.h\"\n#include \"progress.h\"\n\n#define INFTY 10000000\t/* it suffices that this is longer than any\n\t\t\t path; it need not be really infinite */\n#define COS179 -0.999847695156\t /* the cosine of 179 degrees */\n\n/* ---------------------------------------------------------------------- */\n#define SAFE_CALLOC(var, n, typ) \\\n if ((var = (typ *)calloc(n, sizeof(typ))) == NULL) goto calloc_error \n\n/* ---------------------------------------------------------------------- */\n/* auxiliary functions */\n\n/* return a direction that is 90 degrees counterclockwise from p2-p0,\n but then restricted to one of the major wind directions (n, nw, w, etc) */\nstatic inline point_t dorth_infty(dpoint_t p0, dpoint_t p2) {\n point_t r;\n \n r.y = sign(p2.x-p0.x);\n r.x = -sign(p2.y-p0.y);\n\n return r;\n}\n\n/* return (p1-p0)x(p2-p0), the area of the parallelogram */\nstatic inline double dpara(dpoint_t p0, dpoint_t p1, dpoint_t p2) {\n double x1, y1, x2, y2;\n\n x1 = p1.x-p0.x;\n y1 = p1.y-p0.y;\n x2 = p2.x-p0.x;\n y2 = p2.y-p0.y;\n\n return x1*y2 - x2*y1;\n}\n\n/* ddenom/dpara have the property that the square of radius 1 centered\n at p1 intersects the line p0p2 iff |dpara(p0,p1,p2)| <= ddenom(p0,p2) */\nstatic inline double ddenom(dpoint_t p0, dpoint_t p2) {\n point_t r = dorth_infty(p0, p2);\n\n return r.y*(p2.x-p0.x) - r.x*(p2.y-p0.y);\n}\n\n/* return 1 if a <= b < c < a, in a cyclic sense (mod n) */\nstatic inline int cyclic(int a, int b, int c) {\n if (a<=c) {\n return (a<=b && blen;\n sums_t *sums = pp->sums;\n\n double x, y, x2, xy, y2;\n double k;\n double a, b, c, lambda2, l;\n int r=0; /* rotations from i to j */\n\n while (j>=n) {\n j-=n;\n r+=1;\n }\n while (i>=n) {\n i-=n;\n r-=1;\n }\n while (j<0) {\n j+=n;\n r-=1;\n }\n while (i<0) {\n i+=n;\n r+=1;\n }\n \n x = sums[j+1].x-sums[i].x+r*sums[n].x;\n y = sums[j+1].y-sums[i].y+r*sums[n].y;\n x2 = sums[j+1].x2-sums[i].x2+r*sums[n].x2;\n xy = sums[j+1].xy-sums[i].xy+r*sums[n].xy;\n y2 = sums[j+1].y2-sums[i].y2+r*sums[n].y2;\n k = j+1-i+r*n;\n \n ctr->x = x/k;\n ctr->y = y/k;\n\n a = (x2-(double)x*x/k)/k;\n b = (xy-(double)x*y/k)/k;\n c = (y2-(double)y*y/k)/k;\n \n lambda2 = (a+c+sqrt((a-c)*(a-c)+4*b*b))/2; /* larger e.value */\n\n /* now find e.vector for lambda2 */\n a -= lambda2;\n c -= lambda2;\n\n if (fabs(a) >= fabs(c)) {\n l = sqrt(a*a+b*b);\n if (l!=0) {\n dir->x = -b/l;\n dir->y = a/l;\n }\n } else {\n l = sqrt(c*c+b*b);\n if (l!=0) {\n dir->x = -c/l;\n dir->y = b/l;\n }\n }\n if (l==0) {\n dir->x = dir->y = 0; /* sometimes this can happen when k=4:\n\t\t\t the two eigenvalues coincide */\n }\n}\n\n/* the type of (affine) quadratic forms, represented as symmetric 3x3\n matrices. The value of the quadratic form at a vector (x,y) is v^t\n Q v, where v = (x,y,1)^t. */\ntypedef double quadform_t[3][3];\n\n/* Apply quadratic form Q to vector w = (w.x,w.y) */\nstatic inline double quadform(quadform_t Q, dpoint_t w) {\n double v[3];\n int i, j;\n double sum;\n\n v[0] = w.x;\n v[1] = w.y;\n v[2] = 1;\n sum = 0.0;\n\n for (i=0; i<3; i++) {\n for (j=0; j<3; j++) {\n sum += v[i] * Q[i][j] * v[j];\n }\n }\n return sum;\n}\n\n/* calculate p1 x p2 */\nstatic inline int xprod(point_t p1, point_t p2) {\n return p1.x*p2.y - p1.y*p2.x;\n}\n\n/* calculate (p1-p0)x(p3-p2) */\nstatic inline double cprod(dpoint_t p0, dpoint_t p1, dpoint_t p2, dpoint_t p3) {\n double x1, y1, x2, y2;\n\n x1 = p1.x - p0.x;\n y1 = p1.y - p0.y;\n x2 = p3.x - p2.x;\n y2 = p3.y - p2.y;\n\n return x1*y2 - x2*y1;\n}\n\n/* calculate (p1-p0)*(p2-p0) */\nstatic inline double iprod(dpoint_t p0, dpoint_t p1, dpoint_t p2) {\n double x1, y1, x2, y2;\n\n x1 = p1.x - p0.x;\n y1 = p1.y - p0.y;\n x2 = p2.x - p0.x;\n y2 = p2.y - p0.y;\n\n return x1*x2 + y1*y2;\n}\n\n/* calculate (p1-p0)*(p3-p2) */\nstatic inline double iprod1(dpoint_t p0, dpoint_t p1, dpoint_t p2, dpoint_t p3) {\n double x1, y1, x2, y2;\n\n x1 = p1.x - p0.x;\n y1 = p1.y - p0.y;\n x2 = p3.x - p2.x;\n y2 = p3.y - p2.y;\n\n return x1*x2 + y1*y2;\n}\n\n/* calculate distance between two points */\nstatic inline double ddist(dpoint_t p, dpoint_t q) {\n return sqrt(sq(p.x-q.x)+sq(p.y-q.y));\n}\n\n/* calculate point of a bezier curve */\nstatic inline dpoint_t bezier(double t, dpoint_t p0, dpoint_t p1, dpoint_t p2, dpoint_t p3) {\n double s = 1-t;\n dpoint_t res;\n\n /* Note: a good optimizing compiler (such as gcc-3) reduces the\n following to 16 multiplications, using common subexpression\n elimination. */\n\n res.x = s*s*s*p0.x + 3*(s*s*t)*p1.x + 3*(t*t*s)*p2.x + t*t*t*p3.x;\n res.y = s*s*s*p0.y + 3*(s*s*t)*p1.y + 3*(t*t*s)*p2.y + t*t*t*p3.y;\n\n return res;\n}\n\n/* calculate the point t in [0..1] on the (convex) bezier curve\n (p0,p1,p2,p3) which is tangent to q1-q0. Return -1.0 if there is no\n solution in [0..1]. */\nstatic double tangent(dpoint_t p0, dpoint_t p1, dpoint_t p2, dpoint_t p3, dpoint_t q0, dpoint_t q1) {\n double A, B, C; /* (1-t)^2 A + 2(1-t)t B + t^2 C = 0 */\n double a, b, c; /* a t^2 + b t + c = 0 */\n double d, s, r1, r2;\n\n A = cprod(p0, p1, q0, q1);\n B = cprod(p1, p2, q0, q1);\n C = cprod(p2, p3, q0, q1);\n\n a = A - 2*B + C;\n b = -2*A + 2*B;\n c = A;\n \n d = b*b - 4*a*c;\n\n if (a==0 || d<0) {\n return -1.0;\n }\n\n s = sqrt(d);\n\n r1 = (-b + s) / (2 * a);\n r2 = (-b - s) / (2 * a);\n\n if (r1 >= 0 && r1 <= 1) {\n return r1;\n } else if (r2 >= 0 && r2 <= 1) {\n return r2;\n } else {\n return -1.0;\n }\n}\n\n/* ---------------------------------------------------------------------- */\n/* Preparation: fill in the sum* fields of a path (used for later\n rapid summing). Return 0 on success, 1 with errno set on\n failure. */\nstatic int calc_sums(privpath_t *pp) {\n int i, x, y;\n int n = pp->len;\n\n SAFE_CALLOC(pp->sums, pp->len+1, sums_t);\n\n /* origin */\n pp->x0 = pp->pt[0].x;\n pp->y0 = pp->pt[0].y;\n\n /* preparatory computation for later fast summing */\n pp->sums[0].x2 = pp->sums[0].xy = pp->sums[0].y2 = pp->sums[0].x = pp->sums[0].y = 0;\n for (i=0; ipt[i].x - pp->x0;\n y = pp->pt[i].y - pp->y0;\n pp->sums[i+1].x = pp->sums[i].x + x;\n pp->sums[i+1].y = pp->sums[i].y + y;\n pp->sums[i+1].x2 = pp->sums[i].x2 + (double)x*x;\n pp->sums[i+1].xy = pp->sums[i].xy + (double)x*y;\n pp->sums[i+1].y2 = pp->sums[i].y2 + (double)y*y;\n }\n return 0; \n\n calloc_error:\n return 1;\n}\n\n/* ---------------------------------------------------------------------- */\n/* Stage 1: determine the straight subpaths (Sec. 2.2.1). Fill in the\n \"lon\" component of a path object (based on pt/len).\tFor each i,\n lon[i] is the furthest index such that a straight line can be drawn\n from i to lon[i]. Return 1 on error with errno set, else 0. */\n\n/* this algorithm depends on the fact that the existence of straight\n subpaths is a triplewise property. I.e., there exists a straight\n line through squares i0,...,in iff there exists a straight line\n through i,j,k, for all i0<=i= 0 and xprod(constraint[1],\n cur) <= 0. */\n\n/* Remark for Potrace 1.1: the current implementation of calc_lon is\n more complex than the implementation found in Potrace 1.0, but it\n is considerably faster. The introduction of the \"nc\" data structure\n means that we only have to test the constraints for \"corner\"\n points. On a typical input file, this speeds up the calc_lon\n function by a factor of 31.2, thereby decreasing its time share\n within the overall Potrace algorithm from 72.6% to 7.82%, and\n speeding up the overall algorithm by a factor of 3.36. On another\n input file, calc_lon was sped up by a factor of 6.7, decreasing its\n time share from 51.4% to 13.61%, and speeding up the overall\n algorithm by a factor of 1.78. In any case, the savings are\n substantial. */\n\n/* returns 0 on success, 1 on error with errno set */\nstatic int calc_lon(privpath_t *pp) {\n point_t *pt = pp->pt;\n int n = pp->len;\n int i, j, k, k1;\n int ct[4], dir;\n point_t constraint[2];\n point_t cur;\n point_t off;\n int *pivk = NULL; /* pivk[n] */\n int *nc = NULL; /* nc[n]: next corner */\n point_t dk; /* direction of k-k1 */\n int a, b, c, d;\n\n SAFE_CALLOC(pivk, n, int);\n SAFE_CALLOC(nc, n, int);\n\n /* initialize the nc data structure. Point from each point to the\n furthest future point to which it is connected by a vertical or\n horizontal segment. We take advantage of the fact that there is\n always a direction change at 0 (due to the path decomposition\n algorithm). But even if this were not so, there is no harm, as\n in practice, correctness does not depend on the word \"furthest\"\n above. */\n k = 0;\n for (i=n-1; i>=0; i--) {\n if (pt[i].x != pt[k].x && pt[i].y != pt[k].y) {\n k = i+1; /* necessarily ilon, n, int);\n\n /* determine pivot points: for each i, let pivk[i] be the furthest k\n such that all j with i=0; i--) {\n ct[0] = ct[1] = ct[2] = ct[3] = 0;\n\n /* keep track of \"directions\" that have occurred */\n dir = (3+3*(pt[mod(i+1,n)].x-pt[i].x)+(pt[mod(i+1,n)].y-pt[i].y))/2;\n ct[dir]++;\n\n constraint[0].x = 0;\n constraint[0].y = 0;\n constraint[1].x = 0;\n constraint[1].y = 0;\n\n /* find the next k such that no straight line from i to k */\n k = nc[i];\n k1 = i;\n while (1) {\n \n dir = (3+3*sign(pt[k].x-pt[k1].x)+sign(pt[k].y-pt[k1].y))/2;\n ct[dir]++;\n\n /* if all four \"directions\" have occurred, cut this path */\n if (ct[0] && ct[1] && ct[2] && ct[3]) {\n\tpivk[i] = k1;\n\tgoto foundk;\n }\n\n cur.x = pt[k].x - pt[i].x;\n cur.y = pt[k].y - pt[i].y;\n\n /* see if current constraint is violated */\n if (xprod(constraint[0], cur) < 0 || xprod(constraint[1], cur) > 0) {\n\tgoto constraint_viol;\n }\n\n /* else, update constraint */\n if (abs(cur.x) <= 1 && abs(cur.y) <= 1) {\n\t/* no constraint */\n } else {\n\toff.x = cur.x + ((cur.y>=0 && (cur.y>0 || cur.x<0)) ? 1 : -1);\n\toff.y = cur.y + ((cur.x<=0 && (cur.x<0 || cur.y<0)) ? 1 : -1);\n\tif (xprod(constraint[0], off) >= 0) {\n\t constraint[0] = off;\n\t}\n\toff.x = cur.x + ((cur.y<=0 && (cur.y<0 || cur.x<0)) ? 1 : -1);\n\toff.y = cur.y + ((cur.x>=0 && (cur.x>0 || cur.y<0)) ? 1 : -1);\n\tif (xprod(constraint[1], off) <= 0) {\n\t constraint[1] = off;\n\t}\n }\t\n k1 = k;\n k = nc[k1];\n if (!cyclic(k,i,k1)) {\n\tbreak;\n }\n }\n constraint_viol:\n /* k1 was the last \"corner\" satisfying the current constraint, and\n k is the first one violating it. We now need to find the last\n point along k1..k which satisfied the constraint. */\n dk.x = sign(pt[k].x-pt[k1].x);\n dk.y = sign(pt[k].y-pt[k1].y);\n cur.x = pt[k1].x - pt[i].x;\n cur.y = pt[k1].y - pt[i].y;\n /* find largest integer j such that xprod(constraint[0], cur+j*dk)\n >= 0 and xprod(constraint[1], cur+j*dk) <= 0. Use bilinearity\n of xprod. */\n a = xprod(constraint[0], cur);\n b = xprod(constraint[0], dk);\n c = xprod(constraint[1], cur);\n d = xprod(constraint[1], dk);\n /* find largest integer j such that a+j*b>=0 and c+j*d<=0. This\n can be solved with integer arithmetic. */\n j = INFTY;\n if (b<0) {\n j = floordiv(a,-b);\n }\n if (d>0) {\n j = min(j, floordiv(-c,d));\n }\n pivk[i] = mod(k1+j,n);\n foundk:\n ;\n } /* for i */\n\n /* clean up: for each i, let lon[i] be the largest k such that for\n all i' with i<=i'lon[n-1]=j;\n for (i=n-2; i>=0; i--) {\n if (cyclic(i+1,pivk[i],j)) {\n j=pivk[i];\n }\n pp->lon[i]=j;\n }\n\n for (i=n-1; cyclic(mod(i+1,n),j,pp->lon[i]); i--) {\n pp->lon[i] = j;\n }\n\n free(pivk);\n free(nc);\n return 0;\n\n calloc_error:\n free(pivk);\n free(nc);\n return 1;\n}\n\n\n/* ---------------------------------------------------------------------- */\n/* Stage 2: calculate the optimal polygon (Sec. 2.2.2-2.2.4). */ \n\n/* Auxiliary function: calculate the penalty of an edge from i to j in\n the given path. This needs the \"lon\" and \"sum*\" data. */\n\nstatic double penalty3(privpath_t *pp, int i, int j) {\n int n = pp->len;\n point_t *pt = pp->pt;\n sums_t *sums = pp->sums;\n\n /* assume 0<=i=n) {\n j -= n;\n r = 1;\n }\n \n /* critical inner loop: the \"if\" gives a 4.6 percent speedup */\n if (r == 0) {\n x = sums[j+1].x - sums[i].x;\n y = sums[j+1].y - sums[i].y;\n x2 = sums[j+1].x2 - sums[i].x2;\n xy = sums[j+1].xy - sums[i].xy;\n y2 = sums[j+1].y2 - sums[i].y2;\n k = j+1 - i;\n } else {\n x = sums[j+1].x - sums[i].x + sums[n].x;\n y = sums[j+1].y - sums[i].y + sums[n].y;\n x2 = sums[j+1].x2 - sums[i].x2 + sums[n].x2;\n xy = sums[j+1].xy - sums[i].xy + sums[n].xy;\n y2 = sums[j+1].y2 - sums[i].y2 + sums[n].y2;\n k = j+1 - i + n;\n } \n\n px = (pt[i].x + pt[j].x) / 2.0 - pt[0].x;\n py = (pt[i].y + pt[j].y) / 2.0 - pt[0].y;\n ey = (pt[j].x - pt[i].x);\n ex = -(pt[j].y - pt[i].y);\n\n a = ((x2 - 2*x*px) / k + px*px);\n b = ((xy - x*py - y*px) / k + px*py);\n c = ((y2 - 2*y*py) / k + py*py);\n \n s = ex*ex*a + 2*ex*ey*b + ey*ey*c;\n\n return sqrt(s);\n}\n\n/* find the optimal polygon. Fill in the m and po components. Return 1\n on failure with errno set, else 0. Non-cyclic version: assumes i=0\n is in the polygon. Fixme: implement cyclic version. */\nstatic int bestpolygon(privpath_t *pp)\n{\n int i, j, m, k; \n int n = pp->len;\n double *pen = NULL; /* pen[n+1]: penalty vector */\n int *prev = NULL; /* prev[n+1]: best path pointer vector */\n int *clip0 = NULL; /* clip0[n]: longest segment pointer, non-cyclic */\n int *clip1 = NULL; /* clip1[n+1]: backwards segment pointer, non-cyclic */\n int *seg0 = NULL; /* seg0[m+1]: forward segment bounds, m<=n */\n int *seg1 = NULL; /* seg1[m+1]: backward segment bounds, m<=n */\n double thispen;\n double best;\n int c;\n\n SAFE_CALLOC(pen, n+1, double);\n SAFE_CALLOC(prev, n+1, int);\n SAFE_CALLOC(clip0, n, int);\n SAFE_CALLOC(clip1, n+1, int);\n SAFE_CALLOC(seg0, n+1, int);\n SAFE_CALLOC(seg1, n+1, int);\n\n /* calculate clipped paths */\n for (i=0; ilon[mod(i-1,n)]-1,n);\n if (c == i) {\n c = mod(i+1,n);\n }\n if (c < i) {\n clip0[i] = n;\n } else {\n clip0[i] = c;\n }\n }\n\n /* calculate backwards path clipping, non-cyclic. j <= clip0[i] iff\n clip1[j] <= i, for i,j=0..n. */\n j = 1;\n for (i=0; i0; j--) {\n seg1[j] = i;\n i = clip1[i];\n }\n seg1[0] = 0;\n\n /* now find the shortest path with m segments, based on penalty3 */\n /* note: the outer 2 loops jointly have at most n iterations, thus\n the worst-case behavior here is quadratic. In practice, it is\n close to linear since the inner loop tends to be short. */\n pen[0]=0;\n for (j=1; j<=m; j++) {\n for (i=seg1[j]; i<=seg0[j]; i++) {\n best = -1;\n for (k=seg0[j-1]; k>=clip1[i]; k--) {\n\tthispen = penalty3(pp, k, i) + pen[k];\n\tif (best < 0 || thispen < best) {\n\t prev[i] = k;\n\t best = thispen;\n\t}\n }\n pen[i] = best;\n }\n }\n\n pp->m = m;\n SAFE_CALLOC(pp->po, m, int);\n\n /* read off shortest path */\n for (i=n, j=m-1; i>0; j--) {\n i = prev[i];\n pp->po[j] = i;\n }\n\n free(pen);\n free(prev);\n free(clip0);\n free(clip1);\n free(seg0);\n free(seg1);\n return 0;\n \n calloc_error:\n free(pen);\n free(prev);\n free(clip0);\n free(clip1);\n free(seg0);\n free(seg1);\n return 1;\n}\n\n/* ---------------------------------------------------------------------- */\n/* Stage 3: vertex adjustment (Sec. 2.3.1). */\n\n/* Adjust vertices of optimal polygon: calculate the intersection of\n the two \"optimal\" line segments, then move it into the unit square\n if it lies outside. Return 1 with errno set on error; 0 on\n success. */\n\nstatic int adjust_vertices(privpath_t *pp) {\n int m = pp->m;\n int *po = pp->po;\n int n = pp->len;\n point_t *pt = pp->pt;\n int x0 = pp->x0;\n int y0 = pp->y0;\n\n dpoint_t *ctr = NULL; /* ctr[m] */\n dpoint_t *dir = NULL; /* dir[m] */\n quadform_t *q = NULL; /* q[m] */\n double v[3];\n double d;\n int i, j, k, l;\n dpoint_t s;\n int r;\n\n SAFE_CALLOC(ctr, m, dpoint_t);\n SAFE_CALLOC(dir, m, dpoint_t);\n SAFE_CALLOC(q, m, quadform_t);\n\n r = privcurve_init(&pp->curve, m);\n if (r) {\n goto calloc_error;\n }\n \n /* calculate \"optimal\" point-slope representation for each line\n segment */\n for (i=0; iQ[1][1]) {\n\tv[0] = -Q[0][1];\n\tv[1] = Q[0][0];\n } else if (Q[1][1]) {\n\tv[0] = -Q[1][1];\n\tv[1] = Q[1][0];\n } else {\n\tv[0] = 1;\n\tv[1] = 0;\n }\n d = sq(v[0]) + sq(v[1]);\n v[2] = - v[1] * s.y - v[0] * s.x;\n for (l=0; l<3; l++) {\n\tfor (k=0; k<3; k++) {\n\t Q[l][k] += v[l] * v[k] / d;\n\t}\n }\n }\n dx = fabs(w.x-s.x);\n dy = fabs(w.y-s.y);\n if (dx <= .5 && dy <= .5) {\n pp->curve.vertex[i].x = w.x+x0;\n pp->curve.vertex[i].y = w.y+y0;\n continue;\n }\n\n /* the minimum was not in the unit square; now minimize quadratic\n on boundary of square */\n min = quadform(Q, s);\n xmin = s.x;\n ymin = s.y;\n\n if (Q[0][0] == 0.0) {\n goto fixx;\n }\n for (z=0; z<2; z++) { /* value of the y-coordinate */\n w.y = s.y-0.5+z;\n w.x = - (Q[0][1] * w.y + Q[0][2]) / Q[0][0];\n dx = fabs(w.x-s.x);\n cand = quadform(Q, w);\n if (dx <= .5 && cand < min) {\n\tmin = cand;\n\txmin = w.x;\n\tymin = w.y;\n }\n }\n fixx:\n if (Q[1][1] == 0.0) {\n goto corners;\n }\n for (z=0; z<2; z++) { /* value of the x-coordinate */\n w.x = s.x-0.5+z;\n w.y = - (Q[1][0] * w.x + Q[1][2]) / Q[1][1];\n dy = fabs(w.y-s.y);\n cand = quadform(Q, w);\n if (dy <= .5 && cand < min) {\n\tmin = cand;\n\txmin = w.x;\n\tymin = w.y;\n }\n }\n corners:\n /* check four corners */\n for (l=0; l<2; l++) {\n for (k=0; k<2; k++) {\n\tw.x = s.x-0.5+l;\n\tw.y = s.y-0.5+k;\n\tcand = quadform(Q, w);\n\tif (cand < min) {\n\t min = cand;\n\t xmin = w.x;\n\t ymin = w.y;\n\t}\n }\n }\n\n pp->curve.vertex[i].x = xmin + x0;\n pp->curve.vertex[i].y = ymin + y0;\n continue;\n }\n\n free(ctr);\n free(dir);\n free(q);\n return 0;\n\n calloc_error:\n free(ctr);\n free(dir);\n free(q);\n return 1;\n}\n\n/* ---------------------------------------------------------------------- */\n/* Stage 4: smoothing and corner analysis (Sec. 2.3.3) */\n\n/* reverse orientation of a path */\nstatic void reverse(privcurve_t *curve) {\n int m = curve->n;\n int i, j;\n dpoint_t tmp;\n\n for (i=0, j=m-1; ivertex[i];\n curve->vertex[i] = curve->vertex[j];\n curve->vertex[j] = tmp;\n }\n}\n\n/* Always succeeds */\nstatic void smooth(privcurve_t *curve, double alphamax) {\n int m = curve->n;\n\n int i, j, k;\n double dd, denom, alpha;\n dpoint_t p2, p3, p4;\n\n /* examine each vertex and find its best fit */\n for (i=0; ivertex[k], curve->vertex[j]);\n\n denom = ddenom(curve->vertex[i], curve->vertex[k]);\n if (denom != 0.0) {\n dd = dpara(curve->vertex[i], curve->vertex[j], curve->vertex[k]) / denom;\n dd = fabs(dd);\n alpha = dd>1 ? (1 - 1.0/dd) : 0;\n alpha = alpha / 0.75;\n } else {\n alpha = 4/3.0;\n }\n curve->alpha0[j] = alpha;\t /* remember \"original\" value of alpha */\n\n if (alpha >= alphamax) { /* pointed corner */\n curve->tag[j] = POTRACE_CORNER;\n curve->c[j][1] = curve->vertex[j];\n curve->c[j][2] = p4;\n } else {\n if (alpha < 0.55) {\n\talpha = 0.55;\n } else if (alpha > 1) {\n\talpha = 1;\n }\n p2 = interval(.5+.5*alpha, curve->vertex[i], curve->vertex[j]);\n p3 = interval(.5+.5*alpha, curve->vertex[k], curve->vertex[j]);\n curve->tag[j] = POTRACE_CURVETO;\n curve->c[j][0] = p2;\n curve->c[j][1] = p3;\n curve->c[j][2] = p4;\n }\n curve->alpha[j] = alpha;\t/* store the \"cropped\" value of alpha */\n curve->beta[j] = 0.5;\n }\n curve->alphacurve = 1;\n\n return;\n}\n\n/* ---------------------------------------------------------------------- */\n/* Stage 5: Curve optimization (Sec. 2.4) */\n\n/* a private type for the result of opti_penalty */\nstruct opti_s {\n double pen;\t /* penalty */\n dpoint_t c[2]; /* curve parameters */\n double t, s;\t /* curve parameters */\n double alpha;\t /* curve parameter */\n};\ntypedef struct opti_s opti_t;\n\n/* calculate best fit from i+.5 to j+.5. Assume icurve.n;\n int k, k1, k2, conv, i1;\n double area, alpha, d, d1, d2;\n dpoint_t p0, p1, p2, p3, pt;\n double A, R, A1, A2, A3, A4;\n double s, t;\n\n /* check convexity, corner-freeness, and maximum bend < 179 degrees */\n\n if (i==j) { /* sanity - a full loop can never be an opticurve */\n return 1;\n }\n\n k = i;\n i1 = mod(i+1, m);\n k1 = mod(k+1, m);\n conv = convc[k1];\n if (conv == 0) {\n return 1;\n }\n d = ddist(pp->curve.vertex[i], pp->curve.vertex[i1]);\n for (k=k1; k!=j; k=k1) {\n k1 = mod(k+1, m);\n k2 = mod(k+2, m);\n if (convc[k1] != conv) {\n return 1;\n }\n if (sign(cprod(pp->curve.vertex[i], pp->curve.vertex[i1], pp->curve.vertex[k1], pp->curve.vertex[k2])) != conv) {\n return 1;\n }\n if (iprod1(pp->curve.vertex[i], pp->curve.vertex[i1], pp->curve.vertex[k1], pp->curve.vertex[k2]) < d * ddist(pp->curve.vertex[k1], pp->curve.vertex[k2]) * COS179) {\n return 1;\n }\n }\n\n /* the curve we're working in: */\n p0 = pp->curve.c[mod(i,m)][2];\n p1 = pp->curve.vertex[mod(i+1,m)];\n p2 = pp->curve.vertex[mod(j,m)];\n p3 = pp->curve.c[mod(j,m)][2];\n\n /* determine its area */\n area = areac[j] - areac[i];\n area -= dpara(pp->curve.vertex[0], pp->curve.c[i][2], pp->curve.c[j][2])/2;\n if (i>=j) {\n area += areac[m];\n }\n\n /* find intersection o of p0p1 and p2p3. Let t,s such that o =\n interval(t,p0,p1) = interval(s,p3,p2). Let A be the area of the\n triangle (p0,o,p3). */\n\n A1 = dpara(p0, p1, p2);\n A2 = dpara(p0, p1, p3);\n A3 = dpara(p0, p2, p3);\n /* A4 = dpara(p1, p2, p3); */\n A4 = A1+A3-A2; \n \n if (A2 == A1) { /* this should never happen */\n return 1;\n }\n\n t = A3/(A3-A4);\n s = A2/(A2-A1);\n A = A2 * t / 2.0;\n \n if (A == 0.0) { /* this should never happen */\n return 1;\n }\n\n R = area / A;\t /* relative area */\n alpha = 2 - sqrt(4 - R / 0.3); /* overall alpha for p0-o-p3 curve */\n\n res->c[0] = interval(t * alpha, p0, p1);\n res->c[1] = interval(s * alpha, p3, p2);\n res->alpha = alpha;\n res->t = t;\n res->s = s;\n\n p1 = res->c[0];\n p2 = res->c[1]; /* the proposed curve is now (p0,p1,p2,p3) */\n\n res->pen = 0;\n\n /* calculate penalty */\n /* check tangency with edges */\n for (k=mod(i+1,m); k!=j; k=k1) {\n k1 = mod(k+1,m);\n t = tangent(p0, p1, p2, p3, pp->curve.vertex[k], pp->curve.vertex[k1]);\n if (t<-.5) {\n return 1;\n }\n pt = bezier(t, p0, p1, p2, p3);\n d = ddist(pp->curve.vertex[k], pp->curve.vertex[k1]);\n if (d == 0.0) { /* this should never happen */\n return 1;\n }\n d1 = dpara(pp->curve.vertex[k], pp->curve.vertex[k1], pt) / d;\n if (fabs(d1) > opttolerance) {\n return 1;\n }\n if (iprod(pp->curve.vertex[k], pp->curve.vertex[k1], pt) < 0 || iprod(pp->curve.vertex[k1], pp->curve.vertex[k], pt) < 0) {\n return 1;\n }\n res->pen += sq(d1);\n }\n\n /* check corners */\n for (k=i; k!=j; k=k1) {\n k1 = mod(k+1,m);\n t = tangent(p0, p1, p2, p3, pp->curve.c[k][2], pp->curve.c[k1][2]);\n if (t<-.5) {\n return 1;\n }\n pt = bezier(t, p0, p1, p2, p3);\n d = ddist(pp->curve.c[k][2], pp->curve.c[k1][2]);\n if (d == 0.0) { /* this should never happen */\n return 1;\n }\n d1 = dpara(pp->curve.c[k][2], pp->curve.c[k1][2], pt) / d;\n d2 = dpara(pp->curve.c[k][2], pp->curve.c[k1][2], pp->curve.vertex[k1]) / d;\n d2 *= 0.75 * pp->curve.alpha[k1];\n if (d2 < 0) {\n d1 = -d1;\n d2 = -d2;\n }\n if (d1 < d2 - opttolerance) {\n return 1;\n }\n if (d1 < d2) {\n res->pen += sq(d1 - d2);\n }\n }\n\n return 0;\n}\n\n/* optimize the path p, replacing sequences of Bezier segments by a\n single segment when possible. Return 0 on success, 1 with errno set\n on failure. */\nstatic int opticurve(privpath_t *pp, double opttolerance) {\n int m = pp->curve.n;\n int *pt = NULL; /* pt[m+1] */\n double *pen = NULL; /* pen[m+1] */\n int *len = NULL; /* len[m+1] */\n opti_t *opt = NULL; /* opt[m+1] */\n int om;\n int i,j,r;\n opti_t o;\n dpoint_t p0;\n int i1;\n double area;\n double alpha;\n double *s = NULL;\n double *t = NULL;\n\n int *convc = NULL; /* conv[m]: pre-computed convexities */\n double *areac = NULL; /* cumarea[m+1]: cache for fast area computation */\n\n SAFE_CALLOC(pt, m+1, int);\n SAFE_CALLOC(pen, m+1, double);\n SAFE_CALLOC(len, m+1, int);\n SAFE_CALLOC(opt, m+1, opti_t);\n SAFE_CALLOC(convc, m, int);\n SAFE_CALLOC(areac, m+1, double);\n\n /* pre-calculate convexity: +1 = right turn, -1 = left turn, 0 = corner */\n for (i=0; icurve.tag[i] == POTRACE_CURVETO) {\n convc[i] = sign(dpara(pp->curve.vertex[mod(i-1,m)], pp->curve.vertex[i], pp->curve.vertex[mod(i+1,m)]));\n } else {\n convc[i] = 0;\n }\n }\n\n /* pre-calculate areas */\n area = 0.0;\n areac[0] = 0.0;\n p0 = pp->curve.vertex[0];\n for (i=0; icurve.tag[i1] == POTRACE_CURVETO) {\n alpha = pp->curve.alpha[i1];\n area += 0.3*alpha*(4-alpha)*dpara(pp->curve.c[i][2], pp->curve.vertex[i1], pp->curve.c[i1][2])/2;\n area += dpara(p0, pp->curve.c[i][2], pp->curve.c[i1][2])/2;\n }\n areac[i+1] = area;\n }\n\n pt[0] = -1;\n pen[0] = 0;\n len[0] = 0;\n\n /* Fixme: we always start from a fixed point -- should find the best\n curve cyclically */\n\n for (j=1; j<=m; j++) {\n /* calculate best path from 0 to j */\n pt[j] = j-1;\n pen[j] = pen[j-1];\n len[j] = len[j-1]+1;\n\n for (i=j-2; i>=0; i--) {\n r = opti_penalty(pp, i, mod(j,m), &o, opttolerance, convc, areac);\n if (r) {\n\tbreak;\n }\n if (len[j] > len[i]+1 || (len[j] == len[i]+1 && pen[j] > pen[i] + o.pen)) {\n\tpt[j] = i;\n\tpen[j] = pen[i] + o.pen;\n\tlen[j] = len[i] + 1;\n\topt[j] = o;\n }\n }\n }\n om = len[m];\n r = privcurve_init(&pp->ocurve, om);\n if (r) {\n goto calloc_error;\n }\n SAFE_CALLOC(s, om, double);\n SAFE_CALLOC(t, om, double);\n\n j = m;\n for (i=om-1; i>=0; i--) {\n if (pt[j]==j-1) {\n pp->ocurve.tag[i] = pp->curve.tag[mod(j,m)];\n pp->ocurve.c[i][0] = pp->curve.c[mod(j,m)][0];\n pp->ocurve.c[i][1] = pp->curve.c[mod(j,m)][1];\n pp->ocurve.c[i][2] = pp->curve.c[mod(j,m)][2];\n pp->ocurve.vertex[i] = pp->curve.vertex[mod(j,m)];\n pp->ocurve.alpha[i] = pp->curve.alpha[mod(j,m)];\n pp->ocurve.alpha0[i] = pp->curve.alpha0[mod(j,m)];\n pp->ocurve.beta[i] = pp->curve.beta[mod(j,m)];\n s[i] = t[i] = 1.0;\n } else {\n pp->ocurve.tag[i] = POTRACE_CURVETO;\n pp->ocurve.c[i][0] = opt[j].c[0];\n pp->ocurve.c[i][1] = opt[j].c[1];\n pp->ocurve.c[i][2] = pp->curve.c[mod(j,m)][2];\n pp->ocurve.vertex[i] = interval(opt[j].s, pp->curve.c[mod(j,m)][2], pp->curve.vertex[mod(j,m)]);\n pp->ocurve.alpha[i] = opt[j].alpha;\n pp->ocurve.alpha0[i] = opt[j].alpha;\n s[i] = opt[j].s;\n t[i] = opt[j].t;\n }\n j = pt[j];\n }\n\n /* calculate beta parameters */\n for (i=0; iocurve.beta[i] = s[i] / (s[i] + t[i1]);\n }\n pp->ocurve.alphacurve = 1;\n\n free(pt);\n free(pen);\n free(len);\n free(opt);\n free(s);\n free(t);\n free(convc);\n free(areac);\n return 0;\n\n calloc_error:\n free(pt);\n free(pen);\n free(len);\n free(opt);\n free(s);\n free(t);\n free(convc);\n free(areac);\n return 1;\n}\n\n/* ---------------------------------------------------------------------- */\n\n#define TRY(x) if (x) goto try_error\n\n/* return 0 on success, 1 on error with errno set. */\nint process_path(path_t *plist, const potrace_param_t *param, progress_t *progress) {\n path_t *p;\n double nn = 0, cn = 0;\n\n if (progress->callback) {\n /* precompute task size for progress estimates */\n nn = 0;\n list_forall (p, plist) {\n nn += p->priv->len;\n }\n cn = 0;\n }\n \n /* call downstream function with each path */\n list_forall (p, plist) {\n TRY(calc_sums(p->priv));\n TRY(calc_lon(p->priv));\n TRY(bestpolygon(p->priv));\n TRY(adjust_vertices(p->priv));\n if (p->sign == '-') { /* reverse orientation of negative paths */\n reverse(&p->priv->curve);\n }\n smooth(&p->priv->curve, param->alphamax);\n if (param->opticurve) {\n TRY(opticurve(p->priv, param->opttolerance));\n p->priv->fcurve = &p->priv->ocurve;\n } else {\n p->priv->fcurve = &p->priv->curve;\n }\n privcurve_to_curve(p->priv->fcurve, &p->curve);\n\n if (progress->callback) {\n cn += p->priv->len;\n progress_update(cn/nn, progress);\n }\n }\n\n progress_update(1.0, progress);\n\n return 0;\n\n try_error:\n return 1;\n}\n" }, { "path": "libs/potrace/trace.h", "content": "/* Copyright (C) 2001-2019 Peter Selinger.\n This file is part of Potrace. It is free software and it is covered\n by the GNU General Public License. See the file COPYING for details. */\n\n\n#ifndef TRACE_H\n#define TRACE_H\n\n#include \"potracelib.h\"\n#include \"progress.h\"\n#include \"curve.h\"\n\nint process_path(path_t *plist, const potrace_param_t *param, progress_t *progress);\n\n#endif /* TRACE_H */\n" }, { "path": "libs/variant/LICENSE.md", "content": "Boost Software License - Version 1.0 - August 17th, 2003\n\nPermission is hereby granted, free of charge, to any person or organization\nobtaining a copy of the software and accompanying documentation covered by\nthis license (the \"Software\") to use, reproduce, display, distribute,\nexecute, and transmit the Software, and to prepare derivative works of the\nSoftware, and to permit third-parties to whom the Software is furnished to\ndo so, all subject to the following:\n\nThe copyright notices in the Software and this entire statement, including\nthe above license grant, this restriction and the following disclaimer,\nmust be included in all copies of the Software, in whole or in part, and\nall derivative works of the Software, unless such copies or derivative\nworks are solely in the form of machine-executable object code generated by\na source language processor.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\nSHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\nFOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\nARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\nDEALINGS IN THE SOFTWARE.\n" }, { "path": "libs/variant/Makefile.am", "content": "noinst_HEADERS = \\\n\tinclude/mpark/variant.hpp\n\nEXTRA_DIST = LICENSE.md\n" }, { "path": "libs/variant/include/mpark/variant.hpp", "content": "// MPark.Variant\n//\n// Copyright Michael Park, 2015-2017\n//\n// Distributed under the Boost Software License, Version 1.0.\n// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)\n\n#ifndef MPARK_VARIANT_HPP\n#define MPARK_VARIANT_HPP\n\n/*\n variant synopsis\n\nnamespace std {\n\n // 20.7.2, class template variant\n template \n class variant {\n public:\n\n // 20.7.2.1, constructors\n constexpr variant() noexcept(see below);\n variant(const variant&);\n variant(variant&&) noexcept(see below);\n\n template constexpr variant(T&&) noexcept(see below);\n\n template \n constexpr explicit variant(in_place_type_t, Args&&...);\n\n template \n constexpr explicit variant(\n in_place_type_t, initializer_list, Args&&...);\n\n template \n constexpr explicit variant(in_place_index_t, Args&&...);\n\n template \n constexpr explicit variant(\n in_place_index_t, initializer_list, Args&&...);\n\n // 20.7.2.2, destructor\n ~variant();\n\n // 20.7.2.3, assignment\n variant& operator=(const variant&);\n variant& operator=(variant&&) noexcept(see below);\n\n template variant& operator=(T&&) noexcept(see below);\n\n // 20.7.2.4, modifiers\n template \n T& emplace(Args&&...);\n\n template \n T& emplace(initializer_list, Args&&...);\n\n template \n variant_alternative& emplace(Args&&...);\n\n template \n variant_alternative& emplace(initializer_list, Args&&...);\n\n // 20.7.2.5, value status\n constexpr bool valueless_by_exception() const noexcept;\n constexpr size_t index() const noexcept;\n\n // 20.7.2.6, swap\n void swap(variant&) noexcept(see below);\n };\n\n // 20.7.3, variant helper classes\n template struct variant_size; // undefined\n\n template \n constexpr size_t variant_size_v = variant_size::value;\n\n template struct variant_size;\n template struct variant_size;\n template struct variant_size;\n\n template \n struct variant_size>;\n\n template struct variant_alternative; // undefined\n\n template \n using variant_alternative_t = typename variant_alternative::type;\n\n template struct variant_alternative;\n template struct variant_alternative;\n template struct variant_alternative;\n\n template \n struct variant_alternative>;\n\n constexpr size_t variant_npos = -1;\n\n // 20.7.4, value access\n template \n constexpr bool holds_alternative(const variant&) noexcept;\n\n template \n constexpr variant_alternative_t>&\n get(variant&);\n\n template \n constexpr variant_alternative_t>&&\n get(variant&&);\n\n template \n constexpr variant_alternative_t> const&\n get(const variant&);\n\n template \n constexpr variant_alternative_t> const&&\n get(const variant&&);\n\n template \n constexpr T& get(variant&);\n\n template \n constexpr T&& get(variant&&);\n\n template \n constexpr const T& get(const variant&);\n\n template \n constexpr const T&& get(const variant&&);\n\n template \n constexpr add_pointer_t>>\n get_if(variant*) noexcept;\n\n template \n constexpr add_pointer_t>>\n get_if(const variant*) noexcept;\n\n template \n constexpr add_pointer_t\n get_if(variant*) noexcept;\n\n template \n constexpr add_pointer_t\n get_if(const variant*) noexcept;\n\n // 20.7.5, relational operators\n template \n constexpr bool operator==(const variant&, const variant&);\n\n template \n constexpr bool operator!=(const variant&, const variant&);\n\n template \n constexpr bool operator<(const variant&, const variant&);\n\n template \n constexpr bool operator>(const variant&, const variant&);\n\n template \n constexpr bool operator<=(const variant&, const variant&);\n\n template \n constexpr bool operator>=(const variant&, const variant&);\n\n // 20.7.6, visitation\n template \n constexpr see below visit(Visitor&&, Variants&&...);\n\n // 20.7.7, class monostate\n struct monostate;\n\n // 20.7.8, monostate relational operators\n constexpr bool operator<(monostate, monostate) noexcept;\n constexpr bool operator>(monostate, monostate) noexcept;\n constexpr bool operator<=(monostate, monostate) noexcept;\n constexpr bool operator>=(monostate, monostate) noexcept;\n constexpr bool operator==(monostate, monostate) noexcept;\n constexpr bool operator!=(monostate, monostate) noexcept;\n\n // 20.7.9, specialized algorithms\n template \n void swap(variant&, variant&) noexcept(see below);\n\n // 20.7.10, class bad_variant_access\n class bad_variant_access;\n\n // 20.7.11, hash support\n template struct hash;\n template struct hash>;\n template <> struct hash;\n\n} // namespace std\n\n*/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n// MPark.Variant\n//\n// Copyright Michael Park, 2015-2017\n//\n// Distributed under the Boost Software License, Version 1.0.\n// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)\n\n#ifndef MPARK_CONFIG_HPP\n#define MPARK_CONFIG_HPP\n\n// MSVC 2015 Update 3.\n#if __cplusplus < 201103L && (!defined(_MSC_VER) || _MSC_FULL_VER < 190024210)\n#error \"MPark.Variant requires C++11 support.\"\n#endif\n\n#ifndef __has_attribute\n#define __has_attribute(x) 0\n#endif\n\n#ifndef __has_builtin\n#define __has_builtin(x) 0\n#endif\n\n#ifndef __has_include\n#define __has_include(x) 0\n#endif\n\n#ifndef __has_feature\n#define __has_feature(x) 0\n#endif\n\n#if __has_attribute(always_inline) || defined(__GNUC__)\n#define MPARK_ALWAYS_INLINE __attribute__((__always_inline__)) inline\n#elif defined(_MSC_VER)\n#define MPARK_ALWAYS_INLINE __forceinline\n#else\n#define MPARK_ALWAYS_INLINE inline\n#endif\n\n#if __has_builtin(__builtin_addressof) || \\\n (defined(__GNUC__) && __GNUC__ >= 7) || defined(_MSC_VER)\n#define MPARK_BUILTIN_ADDRESSOF\n#endif\n\n#if __has_builtin(__builtin_unreachable) || defined(__GNUC__)\n#define MPARK_BUILTIN_UNREACHABLE __builtin_unreachable()\n#elif defined(_MSC_VER)\n#define MPARK_BUILTIN_UNREACHABLE __assume(false)\n#else\n#define MPARK_BUILTIN_UNREACHABLE\n#endif\n\n#if __has_builtin(__type_pack_element)\n#define MPARK_TYPE_PACK_ELEMENT\n#endif\n\n#if defined(__cpp_constexpr) && __cpp_constexpr >= 200704 && \\\n !(defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ == 9)\n#define MPARK_CPP11_CONSTEXPR\n#endif\n\n#if defined(__cpp_constexpr) && __cpp_constexpr >= 201304\n#define MPARK_CPP14_CONSTEXPR\n#endif\n\n#if __has_feature(cxx_exceptions) || defined(__cpp_exceptions) || \\\n (defined(_MSC_VER) && defined(_CPPUNWIND))\n#define MPARK_EXCEPTIONS\n#endif\n\n#if defined(__cpp_generic_lambdas) || defined(_MSC_VER)\n#define MPARK_GENERIC_LAMBDAS\n#endif\n\n#if defined(__cpp_lib_integer_sequence)\n#define MPARK_INTEGER_SEQUENCE\n#endif\n\n#if defined(__cpp_return_type_deduction) || defined(_MSC_VER)\n#define MPARK_RETURN_TYPE_DEDUCTION\n#endif\n\n#if defined(__cpp_lib_transparent_operators) || defined(_MSC_VER)\n#define MPARK_TRANSPARENT_OPERATORS\n#endif\n\n#if defined(__cpp_variable_templates) || defined(_MSC_VER)\n#define MPARK_VARIABLE_TEMPLATES\n#endif\n\n#if !defined(__GLIBCXX__) || __has_include() // >= libstdc++-5\n#define MPARK_TRIVIALITY_TYPE_TRAITS\n#define MPARK_INCOMPLETE_TYPE_TRAITS\n#endif\n\n#endif // MPARK_CONFIG_HPP\n\n// MPark.Variant\n//\n// Copyright Michael Park, 2015-2017\n//\n// Distributed under the Boost Software License, Version 1.0.\n// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)\n\n#ifndef MPARK_IN_PLACE_HPP\n#define MPARK_IN_PLACE_HPP\n\n#include \n\n\nnamespace mpark {\n\n struct in_place_t { explicit in_place_t() = default; };\n\n template \n struct in_place_index_t { explicit in_place_index_t() = default; };\n\n template \n struct in_place_type_t { explicit in_place_type_t() = default; };\n\n#ifdef MPARK_VARIABLE_TEMPLATES\n constexpr in_place_t in_place{};\n\n template constexpr in_place_index_t in_place_index{};\n\n template constexpr in_place_type_t in_place_type{};\n#endif\n\n} // namespace mpark\n\n#endif // MPARK_IN_PLACE_HPP\n\n// MPark.Variant\n//\n// Copyright Michael Park, 2015-2017\n//\n// Distributed under the Boost Software License, Version 1.0.\n// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)\n\n#ifndef MPARK_LIB_HPP\n#define MPARK_LIB_HPP\n\n#include \n#include \n#include \n#include \n\n\n#define MPARK_RETURN(...) \\\n noexcept(noexcept(__VA_ARGS__)) -> decltype(__VA_ARGS__) { return __VA_ARGS__; }\n\nnamespace mpark {\n namespace lib {\n template \n struct identity { using type = T; };\n\n inline namespace cpp14 {\n template \n struct array {\n constexpr const T &operator[](std::size_t index) const {\n return data[index];\n }\n\n T data[N == 0 ? 1 : N];\n };\n\n template \n using add_pointer_t = typename std::add_pointer::type;\n\n template \n using common_type_t = typename std::common_type::type;\n\n template \n using decay_t = typename std::decay::type;\n\n template \n using enable_if_t = typename std::enable_if::type;\n\n template \n using remove_const_t = typename std::remove_const::type;\n\n template \n using remove_reference_t = typename std::remove_reference::type;\n\n template \n inline constexpr T &&forward(remove_reference_t &t) noexcept {\n return static_cast(t);\n }\n\n template \n inline constexpr T &&forward(remove_reference_t &&t) noexcept {\n static_assert(!std::is_lvalue_reference::value,\n \"can not forward an rvalue as an lvalue\");\n return static_cast(t);\n }\n\n template \n inline constexpr remove_reference_t &&move(T &&t) noexcept {\n return static_cast &&>(t);\n }\n\n#ifdef MPARK_INTEGER_SEQUENCE\n using std::integer_sequence;\n using std::index_sequence;\n using std::make_index_sequence;\n using std::index_sequence_for;\n#else\n template \n struct integer_sequence {\n using value_type = T;\n static constexpr std::size_t size() noexcept { return sizeof...(Is); }\n };\n\n template \n using index_sequence = integer_sequence;\n\n template \n struct make_index_sequence_concat;\n\n template \n struct make_index_sequence_concat,\n index_sequence>\n : identity> {};\n\n template \n struct make_index_sequence_impl;\n\n template \n using make_index_sequence = typename make_index_sequence_impl::type;\n\n template \n struct make_index_sequence_impl\n : make_index_sequence_concat,\n make_index_sequence> {};\n\n template <>\n struct make_index_sequence_impl<0> : identity> {};\n\n template <>\n struct make_index_sequence_impl<1> : identity> {};\n\n template \n using index_sequence_for = make_index_sequence;\n#endif\n\n // \n#ifdef MPARK_TRANSPARENT_OPERATORS\n using equal_to = std::equal_to<>;\n#else\n struct equal_to {\n template \n inline constexpr auto operator()(Lhs &&lhs, Rhs &&rhs) const\n MPARK_RETURN(lib::forward(lhs) == lib::forward(rhs))\n };\n#endif\n\n#ifdef MPARK_TRANSPARENT_OPERATORS\n using not_equal_to = std::not_equal_to<>;\n#else\n struct not_equal_to {\n template \n inline constexpr auto operator()(Lhs &&lhs, Rhs &&rhs) const\n MPARK_RETURN(lib::forward(lhs) != lib::forward(rhs))\n };\n#endif\n\n#ifdef MPARK_TRANSPARENT_OPERATORS\n using less = std::less<>;\n#else\n struct less {\n template \n inline constexpr auto operator()(Lhs &&lhs, Rhs &&rhs) const\n MPARK_RETURN(lib::forward(lhs) < lib::forward(rhs))\n };\n#endif\n\n#ifdef MPARK_TRANSPARENT_OPERATORS\n using greater = std::greater<>;\n#else\n struct greater {\n template \n inline constexpr auto operator()(Lhs &&lhs, Rhs &&rhs) const\n MPARK_RETURN(lib::forward(lhs) > lib::forward(rhs))\n };\n#endif\n\n#ifdef MPARK_TRANSPARENT_OPERATORS\n using less_equal = std::less_equal<>;\n#else\n struct less_equal {\n template \n inline constexpr auto operator()(Lhs &&lhs, Rhs &&rhs) const\n MPARK_RETURN(lib::forward(lhs) <= lib::forward(rhs))\n };\n#endif\n\n#ifdef MPARK_TRANSPARENT_OPERATORS\n using greater_equal = std::greater_equal<>;\n#else\n struct greater_equal {\n template \n inline constexpr auto operator()(Lhs &&lhs, Rhs &&rhs) const\n MPARK_RETURN(lib::forward(lhs) >= lib::forward(rhs))\n };\n#endif\n } // namespace cpp14\n\n inline namespace cpp17 {\n\n // \n template \n using bool_constant = std::integral_constant;\n\n template \n struct voider : identity {};\n\n template \n using void_t = typename voider::type;\n\n namespace detail {\n namespace swappable {\n\n using std::swap;\n\n template \n struct is_swappable {\n private:\n template (),\n std::declval()))>\n inline static std::true_type test(int);\n\n template \n inline static std::false_type test(...);\n\n public:\n static constexpr bool value = decltype(test(0))::value;\n };\n\n template \n struct is_nothrow_swappable {\n static constexpr bool value =\n noexcept(swap(std::declval(), std::declval()));\n };\n\n template \n struct is_nothrow_swappable : std::false_type {};\n\n } // namespace swappable\n } // namespace detail\n\n using detail::swappable::is_swappable;\n\n template \n using is_nothrow_swappable =\n detail::swappable::is_nothrow_swappable::value, T>;\n\n // \n namespace detail {\n\n template \n struct is_reference_wrapper : std::false_type {};\n\n template \n struct is_reference_wrapper>\n : std::true_type {};\n\n template \n struct Invoke;\n\n template <>\n struct Invoke {\n template \n inline static constexpr auto invoke(R T::*pmf, Arg &&arg, Args &&... args)\n MPARK_RETURN((lib::forward(arg).*pmf)(lib::forward(args)...))\n };\n\n template <>\n struct Invoke {\n template \n inline static constexpr auto invoke(R T::*pmf, Arg &&arg, Args &&... args)\n MPARK_RETURN((lib::forward(arg).get().*pmf)(lib::forward(args)...))\n };\n\n template <>\n struct Invoke {\n template \n inline static constexpr auto invoke(R T::*pmf, Arg &&arg, Args &&... args)\n MPARK_RETURN(((*lib::forward(arg)).*pmf)(lib::forward(args)...))\n };\n\n template <>\n struct Invoke {\n template \n inline static constexpr auto invoke(R T::*pmo, Arg &&arg)\n MPARK_RETURN(lib::forward(arg).*pmo)\n };\n\n template <>\n struct Invoke {\n template \n inline static constexpr auto invoke(R T::*pmo, Arg &&arg)\n MPARK_RETURN(lib::forward(arg).get().*pmo)\n };\n\n template <>\n struct Invoke {\n template \n inline static constexpr auto invoke(R T::*pmo, Arg &&arg)\n MPARK_RETURN((*lib::forward(arg)).*pmo)\n };\n\n template \n inline constexpr auto invoke(R T::*f, Arg &&arg, Args &&... args)\n MPARK_RETURN(\n Invoke::value,\n (std::is_base_of>::value\n ? 0\n : is_reference_wrapper>::value\n ? 1\n : 2)>::invoke(f,\n lib::forward(arg),\n lib::forward(args)...))\n\n#ifdef _MSC_VER\n#pragma warning(push)\n#pragma warning(disable : 4100)\n#endif\n template \n inline constexpr auto invoke(F &&f, Args &&... args)\n MPARK_RETURN(lib::forward(f)(lib::forward(args)...))\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n } // namespace detail\n\n template \n inline constexpr auto invoke(F &&f, Args &&... args)\n MPARK_RETURN(detail::invoke(lib::forward(f),\n lib::forward(args)...))\n\n namespace detail {\n\n template \n struct invoke_result {};\n\n template \n struct invoke_result(), std::declval()...))>,\n F,\n Args...>\n : identity(), std::declval()...))> {};\n\n } // namespace detail\n\n template \n using invoke_result = detail::invoke_result;\n\n template \n using invoke_result_t = typename invoke_result::type;\n\n namespace detail {\n\n template \n struct is_invocable : std::false_type {};\n\n template \n struct is_invocable>, F, Args...>\n : std::true_type {};\n\n template \n struct is_invocable_r : std::false_type {};\n\n template \n struct is_invocable_r>,\n R,\n F,\n Args...>\n : std::is_convertible, R> {};\n\n } // namespace detail\n\n template \n using is_invocable = detail::is_invocable;\n\n template \n using is_invocable_r = detail::is_invocable_r;\n\n namespace detail {\n\n template \n struct is_nothrow_invocable {\n static constexpr bool value =\n noexcept(lib::invoke(std::declval(), std::declval()...));\n };\n\n template \n struct is_nothrow_invocable : std::false_type {};\n\n template \n struct is_nothrow_invocable_r {\n private:\n inline static R impl() {\n return lib::invoke(std::declval(), std::declval()...);\n }\n\n public:\n static constexpr bool value = noexcept(impl());\n };\n\n template \n struct is_nothrow_invocable_r : std::false_type {};\n\n } // namespace detail\n\n template \n using is_nothrow_invocable = detail::\n is_nothrow_invocable::value, F, Args...>;\n\n template \n using is_nothrow_invocable_r =\n detail::is_nothrow_invocable_r::value,\n R,\n F,\n Args...>;\n\n // \n#ifdef MPARK_BUILTIN_ADDRESSOF\n template \n inline constexpr T *addressof(T &arg) noexcept {\n return __builtin_addressof(arg);\n }\n#else\n namespace detail {\n\n namespace has_addressof_impl {\n\n struct fail;\n\n template \n inline fail operator&(T &&);\n\n template \n inline static constexpr bool impl() {\n return (std::is_class::value || std::is_union::value) &&\n !std::is_same()), fail>::value;\n }\n\n } // namespace has_addressof_impl\n\n template \n using has_addressof = bool_constant()>;\n\n template \n inline constexpr T *addressof(T &arg, std::true_type) noexcept {\n return std::addressof(arg);\n }\n\n template \n inline constexpr T *addressof(T &arg, std::false_type) noexcept {\n return &arg;\n }\n\n } // namespace detail\n\n template \n inline constexpr T *addressof(T &arg) noexcept {\n return detail::addressof(arg, detail::has_addressof{});\n }\n#endif\n\n template \n inline constexpr T *addressof(const T &&) = delete;\n\n } // namespace cpp17\n\n template \n struct remove_all_extents : identity {};\n\n template \n struct remove_all_extents> : remove_all_extents {};\n\n template \n using remove_all_extents_t = typename remove_all_extents::type;\n\n template \n using size_constant = std::integral_constant;\n\n template \n struct indexed_type : size_constant { using type = T; };\n\n template \n using all = std::is_same,\n integer_sequence>;\n\n#ifdef MPARK_TYPE_PACK_ELEMENT\n template \n using type_pack_element_t = __type_pack_element;\n#else\n template \n struct type_pack_element_impl {\n private:\n template \n struct set;\n\n template \n struct set> : indexed_type... {};\n\n template \n inline static std::enable_if impl(indexed_type);\n\n inline static std::enable_if impl(...);\n\n public:\n using type = decltype(impl(set>{}));\n };\n\n template \n using type_pack_element = typename type_pack_element_impl::type;\n\n template \n using type_pack_element_t = typename type_pack_element::type;\n#endif\n\n#ifdef MPARK_TRIVIALITY_TYPE_TRAITS\n using std::is_trivially_copy_constructible;\n using std::is_trivially_move_constructible;\n using std::is_trivially_copy_assignable;\n using std::is_trivially_move_assignable;\n#else\n template \n struct is_trivially_copy_constructible\n : bool_constant<\n std::is_copy_constructible::value && __has_trivial_copy(T)> {};\n\n template \n struct is_trivially_move_constructible : bool_constant<__is_trivial(T)> {};\n\n template \n struct is_trivially_copy_assignable\n : bool_constant<\n std::is_copy_assignable::value && __has_trivial_assign(T)> {};\n\n template \n struct is_trivially_move_assignable : bool_constant<__is_trivial(T)> {};\n#endif\n\n template \n struct dependent_type : T {};\n\n template \n struct push_back;\n\n template \n using push_back_t = typename push_back::type;\n\n template \n struct push_back, J> {\n using type = index_sequence;\n };\n\n } // namespace lib\n} // namespace mpark\n\n#undef MPARK_RETURN\n\n#endif // MPARK_LIB_HPP\n\n\nnamespace mpark {\n\n#ifdef MPARK_RETURN_TYPE_DEDUCTION\n\n#define AUTO auto\n#define AUTO_RETURN(...) { return __VA_ARGS__; }\n\n#define AUTO_REFREF auto &&\n#define AUTO_REFREF_RETURN(...) { return __VA_ARGS__; }\n\n#define DECLTYPE_AUTO decltype(auto)\n#define DECLTYPE_AUTO_RETURN(...) { return __VA_ARGS__; }\n\n#else\n\n#define AUTO auto\n#define AUTO_RETURN(...) \\\n -> lib::decay_t { return __VA_ARGS__; }\n\n#define AUTO_REFREF auto\n#define AUTO_REFREF_RETURN(...) \\\n -> decltype((__VA_ARGS__)) { \\\n static_assert(std::is_reference::value, \"\"); \\\n return __VA_ARGS__; \\\n }\n\n#define DECLTYPE_AUTO auto\n#define DECLTYPE_AUTO_RETURN(...) \\\n -> decltype(__VA_ARGS__) { return __VA_ARGS__; }\n\n#endif\n\n class bad_variant_access : public std::exception {\n public:\n virtual const char *what() const noexcept override { return \"bad_variant_access\"; }\n };\n\n [[noreturn]] inline void throw_bad_variant_access() {\n#ifdef MPARK_EXCEPTIONS\n throw bad_variant_access{};\n#else\n std::terminate();\n MPARK_BUILTIN_UNREACHABLE;\n#endif\n }\n\n template \n class variant;\n\n template \n struct variant_size;\n\n#ifdef MPARK_VARIABLE_TEMPLATES\n template \n constexpr std::size_t variant_size_v = variant_size::value;\n#endif\n\n template \n struct variant_size : variant_size {};\n\n template \n struct variant_size : variant_size {};\n\n template \n struct variant_size : variant_size {};\n\n template \n struct variant_size> : lib::size_constant {};\n\n template \n struct variant_alternative;\n\n template \n using variant_alternative_t = typename variant_alternative::type;\n\n template \n struct variant_alternative\n : std::add_const> {};\n\n template \n struct variant_alternative\n : std::add_volatile> {};\n\n template \n struct variant_alternative\n : std::add_cv> {};\n\n template \n struct variant_alternative> {\n static_assert(I < sizeof...(Ts),\n \"index out of bounds in `std::variant_alternative<>`\");\n using type = lib::type_pack_element_t;\n };\n\n constexpr std::size_t variant_npos = static_cast(-1);\n\n namespace detail {\n\n constexpr std::size_t not_found = static_cast(-1);\n constexpr std::size_t ambiguous = static_cast(-2);\n\n#ifdef MPARK_CPP14_CONSTEXPR\n template \n inline constexpr std::size_t find_index() {\n constexpr lib::array matches = {\n {std::is_same::value...}\n };\n std::size_t result = not_found;\n for (std::size_t i = 0; i < sizeof...(Ts); ++i) {\n if (matches[i]) {\n if (result != not_found) {\n return ambiguous;\n }\n result = i;\n }\n }\n return result;\n }\n#else\n inline constexpr std::size_t find_index_impl(std::size_t result,\n std::size_t) {\n return result;\n }\n\n template \n inline constexpr std::size_t find_index_impl(std::size_t result,\n std::size_t idx,\n bool b,\n Bs... bs) {\n return b ? (result != not_found ? ambiguous\n : find_index_impl(idx, idx + 1, bs...))\n : find_index_impl(result, idx + 1, bs...);\n }\n\n template \n inline constexpr std::size_t find_index() {\n return find_index_impl(not_found, 0, std::is_same::value...);\n }\n#endif\n\n template \n using find_index_sfinae_impl =\n lib::enable_if_t>;\n\n template \n using find_index_sfinae = find_index_sfinae_impl()>;\n\n template \n struct find_index_checked_impl : lib::size_constant {\n static_assert(I != not_found, \"the specified type is not found.\");\n static_assert(I != ambiguous, \"the specified type is ambiguous.\");\n };\n\n template \n using find_index_checked = find_index_checked_impl()>;\n\n struct valueless_t {};\n\n enum class Trait { TriviallyAvailable, Available, Unavailable };\n\n template class IsTriviallyAvailable,\n template class IsAvailable>\n inline constexpr Trait trait() {\n return IsTriviallyAvailable::value\n ? Trait::TriviallyAvailable\n : IsAvailable::value ? Trait::Available\n : Trait::Unavailable;\n }\n\n#ifdef MPARK_CPP14_CONSTEXPR\n template \n inline constexpr Trait common_trait(Traits... traits_) {\n Trait result = Trait::TriviallyAvailable;\n lib::array traits = {{traits_...}};\n for (std::size_t i = 0; i < sizeof...(Traits); ++i) {\n Trait t = traits[i];\n if (static_cast(t) > static_cast(result)) {\n result = t;\n }\n }\n return result;\n }\n#else\n inline constexpr Trait common_trait_impl(Trait result) { return result; }\n\n template \n inline constexpr Trait common_trait_impl(Trait result,\n Trait t,\n Traits... ts) {\n return static_cast(t) > static_cast(result)\n ? common_trait_impl(t, ts...)\n : common_trait_impl(result, ts...);\n }\n\n template \n inline constexpr Trait common_trait(Traits... ts) {\n return common_trait_impl(Trait::TriviallyAvailable, ts...);\n }\n#endif\n\n template \n struct traits {\n static constexpr Trait copy_constructible_trait =\n common_trait(trait()...);\n\n static constexpr Trait move_constructible_trait =\n common_trait(trait()...);\n\n static constexpr Trait copy_assignable_trait =\n common_trait(copy_constructible_trait,\n trait()...);\n\n static constexpr Trait move_assignable_trait =\n common_trait(move_constructible_trait,\n trait()...);\n\n static constexpr Trait destructible_trait =\n common_trait(trait()...);\n };\n\n namespace access {\n\n struct recursive_union {\n#ifdef MPARK_RETURN_TYPE_DEDUCTION\n template \n inline static constexpr auto &&get_alt(V &&v, in_place_index_t<0>) {\n return lib::forward(v).head_;\n }\n\n template \n inline static constexpr auto &&get_alt(V &&v, in_place_index_t) {\n return get_alt(lib::forward(v).tail_, in_place_index_t{});\n }\n#else\n template \n struct get_alt_impl {\n template \n inline constexpr AUTO_REFREF operator()(V &&v) const\n AUTO_REFREF_RETURN(get_alt_impl{}(lib::forward(v).tail_))\n };\n\n template \n struct get_alt_impl<0, Dummy> {\n template \n inline constexpr AUTO_REFREF operator()(V &&v) const\n AUTO_REFREF_RETURN(lib::forward(v).head_)\n };\n\n template \n inline static constexpr AUTO_REFREF get_alt(V &&v, in_place_index_t)\n AUTO_REFREF_RETURN(get_alt_impl{}(lib::forward(v)))\n#endif\n };\n\n struct base {\n template \n inline static constexpr AUTO_REFREF get_alt(V &&v)\n#ifdef _MSC_VER\n AUTO_REFREF_RETURN(recursive_union::get_alt(\n lib::forward(v).data_, in_place_index_t{}))\n#else\n AUTO_REFREF_RETURN(recursive_union::get_alt(\n data(lib::forward(v)), in_place_index_t{}))\n#endif\n };\n\n struct variant {\n template \n inline static constexpr AUTO_REFREF get_alt(V &&v)\n AUTO_REFREF_RETURN(base::get_alt(lib::forward(v).impl_))\n };\n\n } // namespace access\n\n namespace visitation {\n\n#if defined(MPARK_CPP14_CONSTEXPR) && !defined(_MSC_VER)\n#define MPARK_VARIANT_SWITCH_VISIT\n#endif\n\n struct base {\n template \n using dispatch_result_t = decltype(\n lib::invoke(std::declval(),\n access::base::get_alt<0>(std::declval())...));\n\n template \n struct expected {\n template \n inline static constexpr bool but_got() {\n return std::is_same::value;\n }\n };\n\n template \n struct visit_return_type_check {\n static_assert(\n expected::template but_got(),\n \"`visit` requires the visitor to have a single return type\");\n\n template \n inline static constexpr DECLTYPE_AUTO invoke(Visitor &&visitor,\n Alts &&... alts)\n DECLTYPE_AUTO_RETURN(lib::invoke(lib::forward(visitor),\n lib::forward(alts)...))\n };\n\n#ifdef MPARK_VARIANT_SWITCH_VISIT\n template \n struct dispatcher;\n\n template \n struct dispatcher {\n template \n MPARK_ALWAYS_INLINE static constexpr R dispatch(\n F &&, typename ITs::type &&..., Vs &&...) {\n MPARK_BUILTIN_UNREACHABLE;\n }\n\n template \n MPARK_ALWAYS_INLINE static constexpr R dispatch_case(F &&, Vs &&...) {\n MPARK_BUILTIN_UNREACHABLE;\n }\n\n template \n MPARK_ALWAYS_INLINE static constexpr R dispatch_at(std::size_t,\n F &&,\n Vs &&...) {\n MPARK_BUILTIN_UNREACHABLE;\n }\n };\n\n template \n struct dispatcher {\n template \n MPARK_ALWAYS_INLINE static constexpr R dispatch(\n F &&f, typename ITs::type &&... visited_vs) {\n using Expected = R;\n using Actual = decltype(lib::invoke(\n lib::forward(f),\n access::base::get_alt(\n lib::forward(visited_vs))...));\n return visit_return_type_check::invoke(\n lib::forward(f),\n access::base::get_alt(\n lib::forward(visited_vs))...);\n }\n\n template \n MPARK_ALWAYS_INLINE static constexpr R dispatch(\n F &&f, typename ITs::type &&... visited_vs, V &&v, Vs &&... vs) {\n#define MPARK_DISPATCH(I) \\\n dispatcher<(I < lib::decay_t::size()), \\\n R, \\\n ITs..., \\\n lib::indexed_type>:: \\\n template dispatch<0>(lib::forward(f), \\\n lib::forward(visited_vs)..., \\\n lib::forward(v), \\\n lib::forward(vs)...)\n\n#define MPARK_DEFAULT(I) \\\n dispatcher<(I < lib::decay_t::size()), R, ITs...>::template dispatch( \\\n lib::forward(f), \\\n lib::forward(visited_vs)..., \\\n lib::forward(v), \\\n lib::forward(vs)...)\n\n switch (v.index()) {\n case B + 0: return MPARK_DISPATCH(B + 0);\n case B + 1: return MPARK_DISPATCH(B + 1);\n case B + 2: return MPARK_DISPATCH(B + 2);\n case B + 3: return MPARK_DISPATCH(B + 3);\n case B + 4: return MPARK_DISPATCH(B + 4);\n case B + 5: return MPARK_DISPATCH(B + 5);\n case B + 6: return MPARK_DISPATCH(B + 6);\n case B + 7: return MPARK_DISPATCH(B + 7);\n case B + 8: return MPARK_DISPATCH(B + 8);\n case B + 9: return MPARK_DISPATCH(B + 9);\n case B + 10: return MPARK_DISPATCH(B + 10);\n case B + 11: return MPARK_DISPATCH(B + 11);\n case B + 12: return MPARK_DISPATCH(B + 12);\n case B + 13: return MPARK_DISPATCH(B + 13);\n case B + 14: return MPARK_DISPATCH(B + 14);\n case B + 15: return MPARK_DISPATCH(B + 15);\n case B + 16: return MPARK_DISPATCH(B + 16);\n case B + 17: return MPARK_DISPATCH(B + 17);\n case B + 18: return MPARK_DISPATCH(B + 18);\n case B + 19: return MPARK_DISPATCH(B + 19);\n case B + 20: return MPARK_DISPATCH(B + 20);\n case B + 21: return MPARK_DISPATCH(B + 21);\n case B + 22: return MPARK_DISPATCH(B + 22);\n case B + 23: return MPARK_DISPATCH(B + 23);\n case B + 24: return MPARK_DISPATCH(B + 24);\n case B + 25: return MPARK_DISPATCH(B + 25);\n case B + 26: return MPARK_DISPATCH(B + 26);\n case B + 27: return MPARK_DISPATCH(B + 27);\n case B + 28: return MPARK_DISPATCH(B + 28);\n case B + 29: return MPARK_DISPATCH(B + 29);\n case B + 30: return MPARK_DISPATCH(B + 30);\n case B + 31: return MPARK_DISPATCH(B + 31);\n default: return MPARK_DEFAULT(B + 32);\n }\n\n#undef MPARK_DEFAULT\n#undef MPARK_DISPATCH\n }\n\n template \n MPARK_ALWAYS_INLINE static constexpr R dispatch_case(F &&f,\n Vs &&... vs) {\n using Expected = R;\n using Actual = decltype(\n lib::invoke(lib::forward(f),\n access::base::get_alt(lib::forward(vs))...));\n return visit_return_type_check::invoke(\n lib::forward(f),\n access::base::get_alt(lib::forward(vs))...);\n }\n\n template \n MPARK_ALWAYS_INLINE static constexpr R dispatch_at(std::size_t index,\n F &&f,\n V &&v,\n Vs &&... vs) {\n static_assert(lib::all<(lib::decay_t::size() ==\n lib::decay_t::size())...>::value,\n \"all of the variants must be the same size.\");\n#define MPARK_DISPATCH_AT(I) \\\n dispatcher<(I < lib::decay_t::size()), R>::template dispatch_case( \\\n lib::forward(f), lib::forward(v), lib::forward(vs)...)\n\n#define MPARK_DEFAULT(I) \\\n dispatcher<(I < lib::decay_t::size()), R>::template dispatch_at( \\\n index, lib::forward(f), lib::forward(v), lib::forward(vs)...)\n\n switch (index) {\n case B + 0: return MPARK_DISPATCH_AT(B + 0);\n case B + 1: return MPARK_DISPATCH_AT(B + 1);\n case B + 2: return MPARK_DISPATCH_AT(B + 2);\n case B + 3: return MPARK_DISPATCH_AT(B + 3);\n case B + 4: return MPARK_DISPATCH_AT(B + 4);\n case B + 5: return MPARK_DISPATCH_AT(B + 5);\n case B + 6: return MPARK_DISPATCH_AT(B + 6);\n case B + 7: return MPARK_DISPATCH_AT(B + 7);\n case B + 8: return MPARK_DISPATCH_AT(B + 8);\n case B + 9: return MPARK_DISPATCH_AT(B + 9);\n case B + 10: return MPARK_DISPATCH_AT(B + 10);\n case B + 11: return MPARK_DISPATCH_AT(B + 11);\n case B + 12: return MPARK_DISPATCH_AT(B + 12);\n case B + 13: return MPARK_DISPATCH_AT(B + 13);\n case B + 14: return MPARK_DISPATCH_AT(B + 14);\n case B + 15: return MPARK_DISPATCH_AT(B + 15);\n case B + 16: return MPARK_DISPATCH_AT(B + 16);\n case B + 17: return MPARK_DISPATCH_AT(B + 17);\n case B + 18: return MPARK_DISPATCH_AT(B + 18);\n case B + 19: return MPARK_DISPATCH_AT(B + 19);\n case B + 20: return MPARK_DISPATCH_AT(B + 20);\n case B + 21: return MPARK_DISPATCH_AT(B + 21);\n case B + 22: return MPARK_DISPATCH_AT(B + 22);\n case B + 23: return MPARK_DISPATCH_AT(B + 23);\n case B + 24: return MPARK_DISPATCH_AT(B + 24);\n case B + 25: return MPARK_DISPATCH_AT(B + 25);\n case B + 26: return MPARK_DISPATCH_AT(B + 26);\n case B + 27: return MPARK_DISPATCH_AT(B + 27);\n case B + 28: return MPARK_DISPATCH_AT(B + 28);\n case B + 29: return MPARK_DISPATCH_AT(B + 29);\n case B + 30: return MPARK_DISPATCH_AT(B + 30);\n case B + 31: return MPARK_DISPATCH_AT(B + 31);\n default: return MPARK_DEFAULT(B + 32);\n }\n\n#undef MPARK_DEFAULT\n#undef MPARK_DISPATCH_AT\n }\n };\n#else\n template \n inline static constexpr const T &at(const T &elem) noexcept {\n return elem;\n }\n\n template \n inline static constexpr const lib::remove_all_extents_t &at(\n const lib::array &elems, std::size_t i, Is... is) noexcept {\n return at(elems[i], is...);\n }\n\n template \n inline static constexpr lib::array, sizeof...(Fs) + 1>\n make_farray(F &&f, Fs &&... fs) {\n return {{lib::forward(f), lib::forward(fs)...}};\n }\n\n template \n struct make_fmatrix_impl {\n\n template \n inline static constexpr dispatch_result_t dispatch(\n F &&f, Vs &&... vs) {\n using Expected = dispatch_result_t;\n using Actual = decltype(lib::invoke(\n lib::forward(f),\n access::base::get_alt(lib::forward(vs))...));\n return visit_return_type_check::invoke(\n lib::forward(f),\n access::base::get_alt(lib::forward(vs))...);\n }\n\n#ifdef MPARK_RETURN_TYPE_DEDUCTION\n template \n inline static constexpr auto impl(lib::index_sequence) {\n return &dispatch;\n }\n\n template \n inline static constexpr auto impl(Is,\n lib::index_sequence,\n Ls... ls) {\n return make_farray(impl(lib::push_back_t{}, ls...)...);\n }\n#else\n template \n struct impl;\n\n template \n struct impl> {\n inline constexpr AUTO operator()() const\n AUTO_RETURN(&dispatch)\n };\n\n template \n struct impl, Ls...> {\n inline constexpr AUTO operator()() const\n AUTO_RETURN(\n make_farray(impl, Ls...>{}()...))\n };\n#endif\n };\n\n#ifdef MPARK_RETURN_TYPE_DEDUCTION\n template \n inline static constexpr auto make_fmatrix() {\n return make_fmatrix_impl::impl(\n lib::index_sequence<>{},\n lib::make_index_sequence::size()>{}...);\n }\n#else\n template \n inline static constexpr AUTO make_fmatrix()\n AUTO_RETURN(\n typename make_fmatrix_impl::template impl<\n lib::index_sequence<>,\n lib::make_index_sequence::size()>...>{}())\n#endif\n\n template \n struct make_fdiagonal_impl {\n template \n inline static constexpr dispatch_result_t dispatch(\n F &&f, Vs &&... vs) {\n using Expected = dispatch_result_t;\n using Actual = decltype(\n lib::invoke(lib::forward(f),\n access::base::get_alt(lib::forward(vs))...));\n return visit_return_type_check::invoke(\n lib::forward(f),\n access::base::get_alt(lib::forward(vs))...);\n }\n\n template \n inline static constexpr AUTO impl(lib::index_sequence)\n AUTO_RETURN(make_farray(&dispatch...))\n };\n\n template \n inline static constexpr auto make_fdiagonal()\n -> decltype(make_fdiagonal_impl::impl(\n lib::make_index_sequence::size()>{})) {\n static_assert(lib::all<(lib::decay_t::size() ==\n lib::decay_t::size())...>::value,\n \"all of the variants must be the same size.\");\n return make_fdiagonal_impl::impl(\n lib::make_index_sequence::size()>{});\n }\n#endif\n };\n\n#if !defined(MPARK_VARIANT_SWITCH_VISIT) && \\\n (!defined(_MSC_VER) || _MSC_VER >= 1910)\n template \n using fmatrix_t = decltype(base::make_fmatrix());\n\n template \n struct fmatrix {\n static constexpr fmatrix_t value =\n base::make_fmatrix();\n };\n\n template \n constexpr fmatrix_t fmatrix::value;\n\n template \n using fdiagonal_t = decltype(base::make_fdiagonal());\n\n template \n struct fdiagonal {\n static constexpr fdiagonal_t value =\n base::make_fdiagonal();\n };\n\n template \n constexpr fdiagonal_t fdiagonal::value;\n#endif\n\n struct alt {\n template \n inline static constexpr DECLTYPE_AUTO visit_alt(Visitor &&visitor,\n Vs &&... vs)\n#ifdef MPARK_VARIANT_SWITCH_VISIT\n DECLTYPE_AUTO_RETURN(\n base::dispatcher<\n true,\n base::dispatch_result_t(vs)))...>>::\n template dispatch<0>(lib::forward(visitor),\n as_base(lib::forward(vs))...))\n#elif !defined(_MSC_VER) || _MSC_VER >= 1910\n DECLTYPE_AUTO_RETURN(base::at(\n fmatrix(vs)))...>::value,\n vs.index()...)(lib::forward(visitor),\n as_base(lib::forward(vs))...))\n#else\n DECLTYPE_AUTO_RETURN(base::at(\n base::make_fmatrix(vs)))...>(),\n vs.index()...)(lib::forward(visitor),\n as_base(lib::forward(vs))...))\n#endif\n\n template \n inline static constexpr DECLTYPE_AUTO visit_alt_at(std::size_t index,\n Visitor &&visitor,\n Vs &&... vs)\n#ifdef MPARK_VARIANT_SWITCH_VISIT\n DECLTYPE_AUTO_RETURN(\n base::dispatcher<\n true,\n base::dispatch_result_t(vs)))...>>::\n template dispatch_at<0>(index,\n lib::forward(visitor),\n as_base(lib::forward(vs))...))\n#elif !defined(_MSC_VER) || _MSC_VER >= 1910\n DECLTYPE_AUTO_RETURN(base::at(\n fdiagonal(vs)))...>::value,\n index)(lib::forward(visitor),\n as_base(lib::forward(vs))...))\n#else\n DECLTYPE_AUTO_RETURN(base::at(\n base::make_fdiagonal(vs)))...>(),\n index)(lib::forward(visitor),\n as_base(lib::forward(vs))...))\n#endif\n };\n\n struct variant {\n private:\n template \n struct visitor {\n template \n inline static constexpr bool does_not_handle() {\n return lib::is_invocable::value;\n }\n };\n\n template \n struct visit_exhaustiveness_check {\n static_assert(visitor::template does_not_handle(),\n \"`visit` requires the visitor to be exhaustive.\");\n\n inline static constexpr DECLTYPE_AUTO invoke(Visitor &&visitor,\n Values &&... values)\n DECLTYPE_AUTO_RETURN(lib::invoke(lib::forward(visitor),\n lib::forward(values)...))\n };\n\n template \n struct value_visitor {\n Visitor &&visitor_;\n\n template \n inline constexpr DECLTYPE_AUTO operator()(Alts &&... alts) const\n DECLTYPE_AUTO_RETURN(\n visit_exhaustiveness_check<\n Visitor,\n decltype((lib::forward(alts).value))...>::\n invoke(lib::forward(visitor_),\n lib::forward(alts).value...))\n };\n\n template \n inline static constexpr AUTO make_value_visitor(Visitor &&visitor)\n AUTO_RETURN(value_visitor{lib::forward(visitor)})\n\n public:\n template \n inline static constexpr DECLTYPE_AUTO visit_alt(Visitor &&visitor,\n Vs &&... vs)\n DECLTYPE_AUTO_RETURN(alt::visit_alt(lib::forward(visitor),\n lib::forward(vs).impl_...))\n\n template \n inline static constexpr DECLTYPE_AUTO visit_alt_at(std::size_t index,\n Visitor &&visitor,\n Vs &&... vs)\n DECLTYPE_AUTO_RETURN(\n alt::visit_alt_at(index,\n lib::forward(visitor),\n lib::forward(vs).impl_...))\n\n template \n inline static constexpr DECLTYPE_AUTO visit_value(Visitor &&visitor,\n Vs &&... vs)\n DECLTYPE_AUTO_RETURN(\n visit_alt(make_value_visitor(lib::forward(visitor)),\n lib::forward(vs)...))\n\n template \n inline static constexpr DECLTYPE_AUTO visit_value_at(std::size_t index,\n Visitor &&visitor,\n Vs &&... vs)\n DECLTYPE_AUTO_RETURN(\n visit_alt_at(index,\n make_value_visitor(lib::forward(visitor)),\n lib::forward(vs)...))\n };\n\n } // namespace visitation\n\n template \n struct alt {\n using value_type = T;\n\n#ifdef _MSC_VER\n#pragma warning(push)\n#pragma warning(disable : 4244)\n#endif\n template \n inline explicit constexpr alt(in_place_t, Args &&... args)\n : value(lib::forward(args)...) {}\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n T value;\n };\n\n template \n union recursive_union;\n\n template \n union recursive_union {};\n\n#define MPARK_VARIANT_RECURSIVE_UNION(destructible_trait, destructor) \\\n template \\\n union recursive_union { \\\n public: \\\n inline explicit constexpr recursive_union(valueless_t) noexcept \\\n : dummy_{} {} \\\n \\\n template \\\n inline explicit constexpr recursive_union(in_place_index_t<0>, \\\n Args &&... args) \\\n : head_(in_place_t{}, lib::forward(args)...) {} \\\n \\\n template \\\n inline explicit constexpr recursive_union(in_place_index_t, \\\n Args &&... args) \\\n : tail_(in_place_index_t{}, lib::forward(args)...) {} \\\n \\\n recursive_union(const recursive_union &) = default; \\\n recursive_union(recursive_union &&) = default; \\\n \\\n destructor \\\n \\\n recursive_union &operator=(const recursive_union &) = default; \\\n recursive_union &operator=(recursive_union &&) = default; \\\n \\\n private: \\\n char dummy_; \\\n alt head_; \\\n recursive_union tail_; \\\n \\\n friend struct access::recursive_union; \\\n }\n\n MPARK_VARIANT_RECURSIVE_UNION(Trait::TriviallyAvailable,\n ~recursive_union() = default;);\n MPARK_VARIANT_RECURSIVE_UNION(Trait::Available,\n ~recursive_union() {});\n MPARK_VARIANT_RECURSIVE_UNION(Trait::Unavailable,\n ~recursive_union() = delete;);\n\n#undef MPARK_VARIANT_RECURSIVE_UNION\n\n using index_t = unsigned int;\n\n template \n class base {\n public:\n inline explicit constexpr base(valueless_t tag) noexcept\n : data_(tag), index_(static_cast(-1)) {}\n\n template \n inline explicit constexpr base(in_place_index_t, Args &&... args)\n : data_(in_place_index_t{}, lib::forward(args)...),\n index_(I) {}\n\n inline constexpr bool valueless_by_exception() const noexcept {\n return index_ == static_cast(-1);\n }\n\n inline constexpr std::size_t index() const noexcept {\n return valueless_by_exception() ? variant_npos : index_;\n }\n\n protected:\n using data_t = recursive_union;\n\n friend inline constexpr base &as_base(base &b) { return b; }\n friend inline constexpr const base &as_base(const base &b) { return b; }\n friend inline constexpr base &&as_base(base &&b) { return lib::move(b); }\n friend inline constexpr const base &&as_base(const base &&b) { return lib::move(b); }\n\n friend inline constexpr data_t &data(base &b) { return b.data_; }\n friend inline constexpr const data_t &data(const base &b) { return b.data_; }\n friend inline constexpr data_t &&data(base &&b) { return lib::move(b).data_; }\n friend inline constexpr const data_t &&data(const base &&b) { return lib::move(b).data_; }\n\n inline static constexpr std::size_t size() { return sizeof...(Ts); }\n\n data_t data_;\n index_t index_;\n\n friend struct access::base;\n friend struct visitation::base;\n };\n\n struct dtor {\n#ifdef _MSC_VER\n#pragma warning(push)\n#pragma warning(disable : 4100)\n#endif\n template \n inline void operator()(Alt &alt) const noexcept { alt.~Alt(); }\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n };\n\n#if !defined(_MSC_VER) || _MSC_VER >= 1910\n#define MPARK_INHERITING_CTOR(type, base) using base::base;\n#else\n#define MPARK_INHERITING_CTOR(type, base) \\\n template \\\n inline explicit constexpr type(Args &&... args) \\\n : base(lib::forward(args)...) {}\n#endif\n\n template \n class destructor;\n\n#define MPARK_VARIANT_DESTRUCTOR(destructible_trait, definition, destroy) \\\n template \\\n class destructor, destructible_trait> \\\n : public base { \\\n using super = base; \\\n \\\n public: \\\n MPARK_INHERITING_CTOR(destructor, super) \\\n using super::operator=; \\\n \\\n destructor(const destructor &) = default; \\\n destructor(destructor &&) = default; \\\n definition \\\n destructor &operator=(const destructor &) = default; \\\n destructor &operator=(destructor &&) = default; \\\n \\\n protected: \\\n destroy \\\n }\n\n MPARK_VARIANT_DESTRUCTOR(\n Trait::TriviallyAvailable,\n ~destructor() = default;,\n inline void destroy() noexcept {\n this->index_ = static_cast(-1);\n });\n\n MPARK_VARIANT_DESTRUCTOR(\n Trait::Available,\n ~destructor() { destroy(); },\n inline void destroy() noexcept {\n if (!this->valueless_by_exception()) {\n visitation::alt::visit_alt(dtor{}, *this);\n }\n this->index_ = static_cast(-1);\n });\n\n MPARK_VARIANT_DESTRUCTOR(\n Trait::Unavailable,\n ~destructor() = delete;,\n inline void destroy() noexcept = delete;);\n\n#undef MPARK_VARIANT_DESTRUCTOR\n\n template \n class constructor : public destructor {\n using super = destructor;\n\n public:\n MPARK_INHERITING_CTOR(constructor, super)\n using super::operator=;\n\n protected:\n#ifndef MPARK_GENERIC_LAMBDAS\n struct ctor {\n template \n inline void operator()(LhsAlt &lhs_alt, RhsAlt &&rhs_alt) const {\n constructor::construct_alt(lhs_alt,\n lib::forward(rhs_alt).value);\n }\n };\n#endif\n\n template \n inline static T &construct_alt(alt &a, Args &&... args) {\n auto *result = ::new (static_cast(lib::addressof(a)))\n alt(in_place_t{}, lib::forward(args)...);\n return result->value;\n }\n\n template \n inline static void generic_construct(constructor &lhs, Rhs &&rhs) {\n lhs.destroy();\n if (!rhs.valueless_by_exception()) {\n visitation::alt::visit_alt_at(\n rhs.index(),\n#ifdef MPARK_GENERIC_LAMBDAS\n [](auto &lhs_alt, auto &&rhs_alt) {\n constructor::construct_alt(\n lhs_alt, lib::forward(rhs_alt).value);\n }\n#else\n ctor{}\n#endif\n ,\n lhs,\n lib::forward(rhs));\n lhs.index_ = rhs.index_;\n }\n }\n };\n\n template \n class move_constructor;\n\n#define MPARK_VARIANT_MOVE_CONSTRUCTOR(move_constructible_trait, definition) \\\n template \\\n class move_constructor, move_constructible_trait> \\\n : public constructor> { \\\n using super = constructor>; \\\n \\\n public: \\\n MPARK_INHERITING_CTOR(move_constructor, super) \\\n using super::operator=; \\\n \\\n move_constructor(const move_constructor &) = default; \\\n definition \\\n ~move_constructor() = default; \\\n move_constructor &operator=(const move_constructor &) = default; \\\n move_constructor &operator=(move_constructor &&) = default; \\\n }\n\n MPARK_VARIANT_MOVE_CONSTRUCTOR(\n Trait::TriviallyAvailable,\n move_constructor(move_constructor &&that) = default;);\n\n MPARK_VARIANT_MOVE_CONSTRUCTOR(\n Trait::Available,\n move_constructor(move_constructor &&that) noexcept(\n lib::all::value...>::value)\n : move_constructor(valueless_t{}) {\n this->generic_construct(*this, lib::move(that));\n });\n\n MPARK_VARIANT_MOVE_CONSTRUCTOR(\n Trait::Unavailable,\n move_constructor(move_constructor &&) = delete;);\n\n#undef MPARK_VARIANT_MOVE_CONSTRUCTOR\n\n template \n class copy_constructor;\n\n#define MPARK_VARIANT_COPY_CONSTRUCTOR(copy_constructible_trait, definition) \\\n template \\\n class copy_constructor, copy_constructible_trait> \\\n : public move_constructor> { \\\n using super = move_constructor>; \\\n \\\n public: \\\n MPARK_INHERITING_CTOR(copy_constructor, super) \\\n using super::operator=; \\\n \\\n definition \\\n copy_constructor(copy_constructor &&) = default; \\\n ~copy_constructor() = default; \\\n copy_constructor &operator=(const copy_constructor &) = default; \\\n copy_constructor &operator=(copy_constructor &&) = default; \\\n }\n\n MPARK_VARIANT_COPY_CONSTRUCTOR(\n Trait::TriviallyAvailable,\n copy_constructor(const copy_constructor &that) = default;);\n\n MPARK_VARIANT_COPY_CONSTRUCTOR(\n Trait::Available,\n copy_constructor(const copy_constructor &that)\n : copy_constructor(valueless_t{}) {\n this->generic_construct(*this, that);\n });\n\n MPARK_VARIANT_COPY_CONSTRUCTOR(\n Trait::Unavailable,\n copy_constructor(const copy_constructor &) = delete;);\n\n#undef MPARK_VARIANT_COPY_CONSTRUCTOR\n\n template \n class assignment : public copy_constructor {\n using super = copy_constructor;\n\n public:\n MPARK_INHERITING_CTOR(assignment, super)\n using super::operator=;\n\n template \n inline /* auto & */ auto emplace(Args &&... args)\n -> decltype(this->construct_alt(access::base::get_alt(*this),\n lib::forward(args)...)) {\n this->destroy();\n auto &result = this->construct_alt(access::base::get_alt(*this),\n lib::forward(args)...);\n this->index_ = I;\n return result;\n }\n\n protected:\n#ifndef MPARK_GENERIC_LAMBDAS\n template \n struct assigner {\n template \n inline void operator()(ThisAlt &this_alt, ThatAlt &&that_alt) const {\n self->assign_alt(this_alt, lib::forward(that_alt).value);\n }\n assignment *self;\n };\n#endif\n\n template \n inline void assign_alt(alt &a, Arg &&arg) {\n if (this->index() == I) {\n#ifdef _MSC_VER\n#pragma warning(push)\n#pragma warning(disable : 4244)\n#endif\n a.value = lib::forward(arg);\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n } else {\n struct {\n void operator()(std::true_type) const {\n this_->emplace(lib::forward(arg_));\n }\n void operator()(std::false_type) const {\n this_->emplace(T(lib::forward(arg_)));\n }\n assignment *this_;\n Arg &&arg_;\n } impl{this, lib::forward(arg)};\n impl(lib::bool_constant<\n std::is_nothrow_constructible::value ||\n !std::is_nothrow_move_constructible::value>{});\n }\n }\n\n template \n inline void generic_assign(That &&that) {\n if (this->valueless_by_exception() && that.valueless_by_exception()) {\n // do nothing.\n } else if (that.valueless_by_exception()) {\n this->destroy();\n } else {\n visitation::alt::visit_alt_at(\n that.index(),\n#ifdef MPARK_GENERIC_LAMBDAS\n [this](auto &this_alt, auto &&that_alt) {\n this->assign_alt(\n this_alt, lib::forward(that_alt).value);\n }\n#else\n assigner{this}\n#endif\n ,\n *this,\n lib::forward(that));\n }\n }\n };\n\n template \n class move_assignment;\n\n#define MPARK_VARIANT_MOVE_ASSIGNMENT(move_assignable_trait, definition) \\\n template \\\n class move_assignment, move_assignable_trait> \\\n : public assignment> { \\\n using super = assignment>; \\\n \\\n public: \\\n MPARK_INHERITING_CTOR(move_assignment, super) \\\n using super::operator=; \\\n \\\n move_assignment(const move_assignment &) = default; \\\n move_assignment(move_assignment &&) = default; \\\n ~move_assignment() = default; \\\n move_assignment &operator=(const move_assignment &) = default; \\\n definition \\\n }\n\n MPARK_VARIANT_MOVE_ASSIGNMENT(\n Trait::TriviallyAvailable,\n move_assignment &operator=(move_assignment &&that) = default;);\n\n MPARK_VARIANT_MOVE_ASSIGNMENT(\n Trait::Available,\n move_assignment &\n operator=(move_assignment &&that) noexcept(\n lib::all<(std::is_nothrow_move_constructible::value &&\n std::is_nothrow_move_assignable::value)...>::value) {\n this->generic_assign(lib::move(that));\n return *this;\n });\n\n MPARK_VARIANT_MOVE_ASSIGNMENT(\n Trait::Unavailable,\n move_assignment &operator=(move_assignment &&) = delete;);\n\n#undef MPARK_VARIANT_MOVE_ASSIGNMENT\n\n template \n class copy_assignment;\n\n#define MPARK_VARIANT_COPY_ASSIGNMENT(copy_assignable_trait, definition) \\\n template \\\n class copy_assignment, copy_assignable_trait> \\\n : public move_assignment> { \\\n using super = move_assignment>; \\\n \\\n public: \\\n MPARK_INHERITING_CTOR(copy_assignment, super) \\\n using super::operator=; \\\n \\\n copy_assignment(const copy_assignment &) = default; \\\n copy_assignment(copy_assignment &&) = default; \\\n ~copy_assignment() = default; \\\n definition \\\n copy_assignment &operator=(copy_assignment &&) = default; \\\n }\n\n MPARK_VARIANT_COPY_ASSIGNMENT(\n Trait::TriviallyAvailable,\n copy_assignment &operator=(const copy_assignment &that) = default;);\n\n MPARK_VARIANT_COPY_ASSIGNMENT(\n Trait::Available,\n copy_assignment &operator=(const copy_assignment &that) {\n this->generic_assign(that);\n return *this;\n });\n\n MPARK_VARIANT_COPY_ASSIGNMENT(\n Trait::Unavailable,\n copy_assignment &operator=(const copy_assignment &) = delete;);\n\n#undef MPARK_VARIANT_COPY_ASSIGNMENT\n\n template \n class impl : public copy_assignment> {\n using super = copy_assignment>;\n\n public:\n MPARK_INHERITING_CTOR(impl, super)\n using super::operator=;\n\n template \n inline void assign(Arg &&arg) {\n this->assign_alt(access::base::get_alt(*this),\n lib::forward(arg));\n }\n\n inline void swap(impl &that) {\n if (this->valueless_by_exception() && that.valueless_by_exception()) {\n // do nothing.\n } else if (this->index() == that.index()) {\n visitation::alt::visit_alt_at(this->index(),\n#ifdef MPARK_GENERIC_LAMBDAS\n [](auto &this_alt, auto &that_alt) {\n using std::swap;\n swap(this_alt.value,\n that_alt.value);\n }\n#else\n swapper{}\n#endif\n ,\n *this,\n that);\n } else {\n impl *lhs = this;\n impl *rhs = lib::addressof(that);\n if (lhs->move_nothrow() && !rhs->move_nothrow()) {\n std::swap(lhs, rhs);\n }\n impl tmp(lib::move(*rhs));\n#ifdef MPARK_EXCEPTIONS\n // EXTENSION: When the move construction of `lhs` into `rhs` throws\n // and `tmp` is nothrow move constructible then we move `tmp` back\n // into `rhs` and provide the strong exception safety guarantee.\n try {\n this->generic_construct(*rhs, lib::move(*lhs));\n } catch (...) {\n if (tmp.move_nothrow()) {\n this->generic_construct(*rhs, lib::move(tmp));\n }\n throw;\n }\n#else\n this->generic_construct(*rhs, lib::move(*lhs));\n#endif\n this->generic_construct(*lhs, lib::move(tmp));\n }\n }\n\n private:\n#ifndef MPARK_GENERIC_LAMBDAS\n struct swapper {\n template \n inline void operator()(ThisAlt &this_alt, ThatAlt &that_alt) const {\n using std::swap;\n swap(this_alt.value, that_alt.value);\n }\n };\n#endif\n\n inline constexpr bool move_nothrow() const {\n return this->valueless_by_exception() ||\n lib::array{\n {std::is_nothrow_move_constructible::value...}\n }[this->index()];\n }\n };\n\n#undef MPARK_INHERITING_CTOR\n\n template \n struct overload_leaf {\n using F = lib::size_constant (*)(T);\n operator F() const { return nullptr; }\n };\n\n template \n struct overload_impl {\n private:\n template \n struct impl;\n\n template \n struct impl> : overload_leaf... {};\n\n public:\n using type = impl>;\n };\n\n template \n using overload = typename overload_impl::type;\n\n template \n using best_match = lib::invoke_result_t, T &&>;\n\n template \n struct is_in_place_index : std::false_type {};\n\n template \n struct is_in_place_index> : std::true_type {};\n\n template \n struct is_in_place_type : std::false_type {};\n\n template \n struct is_in_place_type> : std::true_type {};\n\n } // detail\n\n template \n class variant {\n static_assert(0 < sizeof...(Ts),\n \"variant must consist of at least one alternative.\");\n\n static_assert(lib::all::value...>::value,\n \"variant can not have an array type as an alternative.\");\n\n static_assert(lib::all::value...>::value,\n \"variant can not have a reference type as an alternative.\");\n\n static_assert(lib::all::value...>::value,\n \"variant can not have a void type as an alternative.\");\n\n public:\n template <\n typename Front = lib::type_pack_element_t<0, Ts...>,\n lib::enable_if_t::value, int> = 0>\n inline constexpr variant() noexcept(\n std::is_nothrow_default_constructible::value)\n : impl_(in_place_index_t<0>{}) {}\n\n variant(const variant &) = default;\n variant(variant &&) = default;\n\n template <\n typename Arg,\n typename Decayed = lib::decay_t,\n lib::enable_if_t::value, int> = 0,\n lib::enable_if_t::value, int> = 0,\n lib::enable_if_t::value, int> = 0,\n std::size_t I = detail::best_match::value,\n typename T = lib::type_pack_element_t,\n lib::enable_if_t::value, int> = 0>\n inline constexpr variant(Arg &&arg) noexcept(\n std::is_nothrow_constructible::value)\n : impl_(in_place_index_t{}, lib::forward(arg)) {}\n\n template <\n std::size_t I,\n typename... Args,\n typename T = lib::type_pack_element_t,\n lib::enable_if_t::value, int> = 0>\n inline explicit constexpr variant(\n in_place_index_t,\n Args &&... args) noexcept(std::is_nothrow_constructible::value)\n : impl_(in_place_index_t{}, lib::forward(args)...) {}\n\n template <\n std::size_t I,\n typename Up,\n typename... Args,\n typename T = lib::type_pack_element_t,\n lib::enable_if_t &,\n Args...>::value,\n int> = 0>\n inline explicit constexpr variant(\n in_place_index_t,\n std::initializer_list il,\n Args &&... args) noexcept(std::\n is_nothrow_constructible<\n T,\n std::initializer_list &,\n Args...>::value)\n : impl_(in_place_index_t{}, il, lib::forward(args)...) {}\n\n template <\n typename T,\n typename... Args,\n std::size_t I = detail::find_index_sfinae::value,\n lib::enable_if_t::value, int> = 0>\n inline explicit constexpr variant(\n in_place_type_t,\n Args &&... args) noexcept(std::is_nothrow_constructible::value)\n : impl_(in_place_index_t{}, lib::forward(args)...) {}\n\n template <\n typename T,\n typename Up,\n typename... Args,\n std::size_t I = detail::find_index_sfinae::value,\n lib::enable_if_t &,\n Args...>::value,\n int> = 0>\n inline explicit constexpr variant(\n in_place_type_t,\n std::initializer_list il,\n Args &&... args) noexcept(std::\n is_nothrow_constructible<\n T,\n std::initializer_list &,\n Args...>::value)\n : impl_(in_place_index_t{}, il, lib::forward(args)...) {}\n\n ~variant() = default;\n\n variant &operator=(const variant &) = default;\n variant &operator=(variant &&) = default;\n\n template , variant>::value,\n int> = 0,\n std::size_t I = detail::best_match::value,\n typename T = lib::type_pack_element_t,\n lib::enable_if_t<(std::is_assignable::value &&\n std::is_constructible::value),\n int> = 0>\n inline variant &operator=(Arg &&arg) noexcept(\n (std::is_nothrow_assignable::value &&\n std::is_nothrow_constructible::value)) {\n impl_.template assign(lib::forward(arg));\n return *this;\n }\n\n template <\n std::size_t I,\n typename... Args,\n typename T = lib::type_pack_element_t,\n lib::enable_if_t::value, int> = 0>\n inline T &emplace(Args &&... args) {\n return impl_.template emplace(lib::forward(args)...);\n }\n\n template <\n std::size_t I,\n typename Up,\n typename... Args,\n typename T = lib::type_pack_element_t,\n lib::enable_if_t &,\n Args...>::value,\n int> = 0>\n inline T &emplace(std::initializer_list il, Args &&... args) {\n return impl_.template emplace(il, lib::forward(args)...);\n }\n\n template <\n typename T,\n typename... Args,\n std::size_t I = detail::find_index_sfinae::value,\n lib::enable_if_t::value, int> = 0>\n inline T &emplace(Args &&... args) {\n return impl_.template emplace(lib::forward(args)...);\n }\n\n template <\n typename T,\n typename Up,\n typename... Args,\n std::size_t I = detail::find_index_sfinae::value,\n lib::enable_if_t &,\n Args...>::value,\n int> = 0>\n inline T &emplace(std::initializer_list il, Args &&... args) {\n return impl_.template emplace(il, lib::forward(args)...);\n }\n\n inline constexpr bool valueless_by_exception() const noexcept {\n return impl_.valueless_by_exception();\n }\n\n inline constexpr std::size_t index() const noexcept {\n return impl_.index();\n }\n\n template ,\n Dummy>::value &&\n lib::dependent_type,\n Dummy>::value)...>::value,\n int> = 0>\n inline void swap(variant &that) noexcept(\n lib::all<(std::is_nothrow_move_constructible::value &&\n lib::is_nothrow_swappable::value)...>::value) {\n impl_.swap(that.impl_);\n }\n\n private:\n detail::impl impl_;\n\n friend struct detail::access::variant;\n friend struct detail::visitation::variant;\n };\n\n template \n inline constexpr bool holds_alternative(const variant &v) noexcept {\n return v.index() == I;\n }\n\n template \n inline constexpr bool holds_alternative(const variant &v) noexcept {\n return holds_alternative::value>(v);\n }\n\n namespace detail {\n template \n struct generic_get_impl {\n constexpr generic_get_impl(int) noexcept {}\n\n constexpr AUTO_REFREF operator()(V &&v) const\n AUTO_REFREF_RETURN(\n access::variant::get_alt(lib::forward(v)).value)\n };\n\n template \n inline constexpr AUTO_REFREF generic_get(V &&v)\n AUTO_REFREF_RETURN(generic_get_impl(\n holds_alternative(v) ? 0 : (throw_bad_variant_access(), 0))(\n lib::forward(v)))\n } // namespace detail\n\n template \n inline constexpr variant_alternative_t> &get(\n variant &v) {\n return detail::generic_get(v);\n }\n\n template \n inline constexpr variant_alternative_t> &&get(\n variant &&v) {\n return detail::generic_get(lib::move(v));\n }\n\n template \n inline constexpr const variant_alternative_t> &get(\n const variant &v) {\n return detail::generic_get(v);\n }\n\n template \n inline constexpr const variant_alternative_t> &&get(\n const variant &&v) {\n return detail::generic_get(lib::move(v));\n }\n\n template \n inline constexpr T &get(variant &v) {\n return get::value>(v);\n }\n\n template \n inline constexpr T &&get(variant &&v) {\n return get::value>(lib::move(v));\n }\n\n template \n inline constexpr const T &get(const variant &v) {\n return get::value>(v);\n }\n\n template \n inline constexpr const T &&get(const variant &&v) {\n return get::value>(lib::move(v));\n }\n\n namespace detail {\n\n template \n inline constexpr /* auto * */ AUTO generic_get_if(V *v) noexcept\n AUTO_RETURN(v && holds_alternative(*v)\n ? lib::addressof(access::variant::get_alt(*v).value)\n : nullptr)\n\n } // namespace detail\n\n template \n inline constexpr lib::add_pointer_t>>\n get_if(variant *v) noexcept {\n return detail::generic_get_if(v);\n }\n\n template \n inline constexpr lib::add_pointer_t<\n const variant_alternative_t>>\n get_if(const variant *v) noexcept {\n return detail::generic_get_if(v);\n }\n\n template \n inline constexpr lib::add_pointer_t\n get_if(variant *v) noexcept {\n return get_if::value>(v);\n }\n\n template \n inline constexpr lib::add_pointer_t\n get_if(const variant *v) noexcept {\n return get_if::value>(v);\n }\n\n namespace detail {\n template \n struct convert_to_bool {\n template \n inline constexpr bool operator()(Lhs &&lhs, Rhs &&rhs) const {\n static_assert(std::is_convertible,\n bool>::value,\n \"relational operators must return a type\"\n \" implicitly convertible to bool\");\n return lib::invoke(\n RelOp{}, lib::forward(lhs), lib::forward(rhs));\n }\n };\n } // namespace detail\n\n template \n inline constexpr bool operator==(const variant &lhs,\n const variant &rhs) {\n using detail::visitation::variant;\n using equal_to = detail::convert_to_bool;\n#ifdef MPARK_CPP14_CONSTEXPR\n if (lhs.index() != rhs.index()) return false;\n if (lhs.valueless_by_exception()) return true;\n return variant::visit_value_at(lhs.index(), equal_to{}, lhs, rhs);\n#else\n return lhs.index() == rhs.index() &&\n (lhs.valueless_by_exception() ||\n variant::visit_value_at(lhs.index(), equal_to{}, lhs, rhs));\n#endif\n }\n\n template \n inline constexpr bool operator!=(const variant &lhs,\n const variant &rhs) {\n using detail::visitation::variant;\n using not_equal_to = detail::convert_to_bool;\n#ifdef MPARK_CPP14_CONSTEXPR\n if (lhs.index() != rhs.index()) return true;\n if (lhs.valueless_by_exception()) return false;\n return variant::visit_value_at(lhs.index(), not_equal_to{}, lhs, rhs);\n#else\n return lhs.index() != rhs.index() ||\n (!lhs.valueless_by_exception() &&\n variant::visit_value_at(lhs.index(), not_equal_to{}, lhs, rhs));\n#endif\n }\n\n template \n inline constexpr bool operator<(const variant &lhs,\n const variant &rhs) {\n using detail::visitation::variant;\n using less = detail::convert_to_bool;\n#ifdef MPARK_CPP14_CONSTEXPR\n if (rhs.valueless_by_exception()) return false;\n if (lhs.valueless_by_exception()) return true;\n if (lhs.index() < rhs.index()) return true;\n if (lhs.index() > rhs.index()) return false;\n return variant::visit_value_at(lhs.index(), less{}, lhs, rhs);\n#else\n return !rhs.valueless_by_exception() &&\n (lhs.valueless_by_exception() || lhs.index() < rhs.index() ||\n (lhs.index() == rhs.index() &&\n variant::visit_value_at(lhs.index(), less{}, lhs, rhs)));\n#endif\n }\n\n template \n inline constexpr bool operator>(const variant &lhs,\n const variant &rhs) {\n using detail::visitation::variant;\n using greater = detail::convert_to_bool;\n#ifdef MPARK_CPP14_CONSTEXPR\n if (lhs.valueless_by_exception()) return false;\n if (rhs.valueless_by_exception()) return true;\n if (lhs.index() > rhs.index()) return true;\n if (lhs.index() < rhs.index()) return false;\n return variant::visit_value_at(lhs.index(), greater{}, lhs, rhs);\n#else\n return !lhs.valueless_by_exception() &&\n (rhs.valueless_by_exception() || lhs.index() > rhs.index() ||\n (lhs.index() == rhs.index() &&\n variant::visit_value_at(lhs.index(), greater{}, lhs, rhs)));\n#endif\n }\n\n template \n inline constexpr bool operator<=(const variant &lhs,\n const variant &rhs) {\n using detail::visitation::variant;\n using less_equal = detail::convert_to_bool;\n#ifdef MPARK_CPP14_CONSTEXPR\n if (lhs.valueless_by_exception()) return true;\n if (rhs.valueless_by_exception()) return false;\n if (lhs.index() < rhs.index()) return true;\n if (lhs.index() > rhs.index()) return false;\n return variant::visit_value_at(lhs.index(), less_equal{}, lhs, rhs);\n#else\n return lhs.valueless_by_exception() ||\n (!rhs.valueless_by_exception() &&\n (lhs.index() < rhs.index() ||\n (lhs.index() == rhs.index() &&\n variant::visit_value_at(lhs.index(), less_equal{}, lhs, rhs))));\n#endif\n }\n\n template \n inline constexpr bool operator>=(const variant &lhs,\n const variant &rhs) {\n using detail::visitation::variant;\n using greater_equal = detail::convert_to_bool;\n#ifdef MPARK_CPP14_CONSTEXPR\n if (rhs.valueless_by_exception()) return true;\n if (lhs.valueless_by_exception()) return false;\n if (lhs.index() > rhs.index()) return true;\n if (lhs.index() < rhs.index()) return false;\n return variant::visit_value_at(lhs.index(), greater_equal{}, lhs, rhs);\n#else\n return rhs.valueless_by_exception() ||\n (!lhs.valueless_by_exception() &&\n (lhs.index() > rhs.index() ||\n (lhs.index() == rhs.index() &&\n variant::visit_value_at(\n lhs.index(), greater_equal{}, lhs, rhs))));\n#endif\n }\n\n struct monostate {};\n\n inline constexpr bool operator<(monostate, monostate) noexcept {\n return false;\n }\n\n inline constexpr bool operator>(monostate, monostate) noexcept {\n return false;\n }\n\n inline constexpr bool operator<=(monostate, monostate) noexcept {\n return true;\n }\n\n inline constexpr bool operator>=(monostate, monostate) noexcept {\n return true;\n }\n\n inline constexpr bool operator==(monostate, monostate) noexcept {\n return true;\n }\n\n inline constexpr bool operator!=(monostate, monostate) noexcept {\n return false;\n }\n\n#ifdef MPARK_CPP14_CONSTEXPR\n namespace detail {\n\n inline constexpr bool all(std::initializer_list bs) {\n for (bool b : bs) {\n if (!b) {\n return false;\n }\n }\n return true;\n }\n\n } // namespace detail\n\n template \n inline constexpr decltype(auto) visit(Visitor &&visitor, Vs &&... vs) {\n return (detail::all({!vs.valueless_by_exception()...})\n ? (void)0\n : throw_bad_variant_access()),\n detail::visitation::variant::visit_value(\n lib::forward(visitor), lib::forward(vs)...);\n }\n#else\n namespace detail {\n\n template \n inline constexpr bool all_impl(const lib::array &bs,\n std::size_t idx) {\n return idx >= N || (bs[idx] && all_impl(bs, idx + 1));\n }\n\n template \n inline constexpr bool all(const lib::array &bs) {\n return all_impl(bs, 0);\n }\n\n } // namespace detail\n\n template \n inline constexpr DECLTYPE_AUTO visit(Visitor &&visitor, Vs &&... vs)\n DECLTYPE_AUTO_RETURN(\n (detail::all(\n lib::array{{!vs.valueless_by_exception()...}})\n ? (void)0\n : throw_bad_variant_access()),\n detail::visitation::variant::visit_value(lib::forward(visitor),\n lib::forward(vs)...))\n#endif\n\n template \n inline auto swap(variant &lhs,\n variant &rhs) noexcept(noexcept(lhs.swap(rhs)))\n -> decltype(lhs.swap(rhs)) {\n lhs.swap(rhs);\n }\n\n namespace detail {\n\n template \n using enabled_type = T;\n\n namespace hash {\n\n template \n constexpr bool meets_requirements() noexcept {\n return std::is_copy_constructible::value &&\n std::is_move_constructible::value &&\n lib::is_invocable_r::value;\n }\n\n template \n constexpr bool is_enabled() noexcept {\n using H = std::hash;\n return meets_requirements() &&\n std::is_default_constructible::value &&\n std::is_copy_assignable::value &&\n std::is_move_assignable::value;\n }\n\n } // namespace hash\n\n } // namespace detail\n\n#undef AUTO\n#undef AUTO_RETURN\n\n#undef AUTO_REFREF\n#undef AUTO_REFREF_RETURN\n\n#undef DECLTYPE_AUTO\n#undef DECLTYPE_AUTO_RETURN\n\n} // namespace mpark\n\nnamespace std {\n\n template \n struct hash,\n mpark::lib::enable_if_t>()...>::value>>> {\n using argument_type = mpark::variant;\n using result_type = std::size_t;\n\n inline result_type operator()(const argument_type &v) const {\n using mpark::detail::visitation::variant;\n std::size_t result =\n v.valueless_by_exception()\n ? 299792458 // Random value chosen by the universe upon creation\n : variant::visit_alt(\n#ifdef MPARK_GENERIC_LAMBDAS\n [](const auto &alt) {\n using alt_type = mpark::lib::decay_t;\n using value_type = mpark::lib::remove_const_t<\n typename alt_type::value_type>;\n return hash{}(alt.value);\n }\n#else\n hasher{}\n#endif\n ,\n v);\n return hash_combine(result, hash{}(v.index()));\n }\n\n private:\n#ifndef MPARK_GENERIC_LAMBDAS\n struct hasher {\n template \n inline std::size_t operator()(const Alt &alt) const {\n using alt_type = mpark::lib::decay_t;\n using value_type =\n mpark::lib::remove_const_t;\n return hash{}(alt.value);\n }\n };\n#endif\n\n static std::size_t hash_combine(std::size_t lhs, std::size_t rhs) {\n return lhs ^= rhs + 0x9e3779b9 + (lhs << 6) + (lhs >> 2);\n }\n };\n\n template <>\n struct hash {\n using argument_type = mpark::monostate;\n using result_type = std::size_t;\n\n inline result_type operator()(const argument_type &) const noexcept {\n return 66740831; // return a fundamentally attractive random value.\n }\n };\n\n} // namespace std\n\n#endif // MPARK_VARIANT_HPP\n" }, { "path": "libs/woff2/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"[]\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "libs/woff2/Makefile.am", "content": "if !HAVE_WOFF2\nnoinst_LIBRARIES = libwoff2.a\nlibwoff2_a_SOURCES = \\\n\tinclude/woff2/decode.h \\\n\tinclude/woff2/encode.h \\\n\tinclude/woff2/output.h \\\n\tinclude/woff2/version.h \\\n\tsrc/buffer.h \\\n\tsrc/font.cc \\\n\tsrc/font.h \\\n\tsrc/glyph.cc \\\n\tsrc/glyph.h \\\n\tsrc/normalize.cc \\\n\tsrc/normalize.h \\\n\tsrc/port.h \\\n\tsrc/round.h \\\n\tsrc/store_bytes.h \\\n\tsrc/table_tags.cc \\\n\tsrc/table_tags.h \\\n\tsrc/transform.cc \\\n\tsrc/transform.h \\\n\tsrc/variable_length.cc \\\n\tsrc/variable_length.h \\\n\tsrc/woff2_common.cc \\\n\tsrc/woff2_common.h \\\n\tsrc/woff2_enc.cc \\\n\tsrc/woff2_out.cc\n\nAM_CXXFLAGS = -Wall -I$(srcdir)/include -I$(srcdir)/../brotli/include\n\nendif\n\nEXTRA_DIST = LICENSE\nCLEANFILES = *.gcda *.gcno\n" }, { "path": "libs/woff2/include/woff2/decode.h", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Library for converting WOFF2 format font files to their TTF versions. */\n\n#ifndef WOFF2_WOFF2_DEC_H_\n#define WOFF2_WOFF2_DEC_H_\n\n#include \n#include \n#include \n\nnamespace woff2 {\n\n// Compute the size of the final uncompressed font, or 0 on error.\nsize_t ComputeWOFF2FinalSize(const uint8_t *data, size_t length);\n\n// Decompresses the font into the target buffer. The result_length should\n// be the same as determined by ComputeFinalSize(). Returns true on successful\n// decompression.\n// DEPRECATED; please prefer the version that takes a WOFF2Out*\nbool ConvertWOFF2ToTTF(uint8_t *result, size_t result_length,\n const uint8_t *data, size_t length);\n\n// Decompresses the font into out. Returns true on success.\n// Works even if WOFF2Header totalSfntSize is wrong.\n// Please prefer this API.\nbool ConvertWOFF2ToTTF(const uint8_t *data, size_t length,\n WOFF2Out* out);\n\n} // namespace woff2\n\n#endif // WOFF2_WOFF2_DEC_H_\n" }, { "path": "libs/woff2/include/woff2/encode.h", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Library for converting WOFF2 format font files to their TTF versions. */\n\n#ifndef WOFF2_WOFF2_ENC_H_\n#define WOFF2_WOFF2_ENC_H_\n\n#include \n#include \n#include \n\nnamespace woff2 {\n\nstruct WOFF2Params {\n WOFF2Params() : extended_metadata(\"\"), brotli_quality(11),\n allow_transforms(true) {}\n\n std::string extended_metadata;\n int brotli_quality;\n bool allow_transforms;\n};\n\n// Returns an upper bound on the size of the compressed file.\nsize_t MaxWOFF2CompressedSize(const uint8_t* data, size_t length);\nsize_t MaxWOFF2CompressedSize(const uint8_t *data, size_t length,\n const std::string &extended_metadata);\n\n// Compresses the font into the target buffer. *result_length should be at least\n// the value returned by MaxWOFF2CompressedSize(), upon return, it is set to the\n// actual compressed size. Returns true on successful compression.\nbool ConvertTTFToWOFF2(const uint8_t *data, size_t length,\n uint8_t *result, size_t *result_length);\nbool ConvertTTFToWOFF2(const uint8_t *data, size_t length,\n uint8_t *result, size_t *result_length,\n const WOFF2Params& params);\n\n} // namespace woff2\n\n#endif // WOFF2_WOFF2_ENC_H_\n" }, { "path": "libs/woff2/include/woff2/output.h", "content": "/* Copyright 2016 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Output buffer for WOFF2 decompression. */\n\n#ifndef WOFF2_WOFF2_OUT_H_\n#define WOFF2_WOFF2_OUT_H_\n\n#include \n#include \n#include \n#include \n#include \n\nnamespace woff2 {\n\n// Suggested max size for output.\nconst size_t kDefaultMaxSize = 30 * 1024 * 1024;\n\n/**\n * Output interface for the woff2 decoding.\n *\n * Writes to arbitrary offsets are supported to facilitate updating offset\n * table and checksums after tables are ready. Reading the current size is\n * supported so a 'loca' table can be built up while writing glyphs.\n *\n * By default limits size to kDefaultMaxSize.\n */\nclass WOFF2Out {\n public:\n virtual ~WOFF2Out(void) {}\n\n // Append n bytes of data from buf.\n // Return true if all written, false otherwise.\n virtual bool Write(const void *buf, size_t n) = 0;\n\n // Write n bytes of data from buf at offset.\n // Return true if all written, false otherwise.\n virtual bool Write(const void *buf, size_t offset, size_t n) = 0;\n\n virtual size_t Size() = 0;\n};\n\n/**\n * Expanding memory block for woff2 out. By default limited to kDefaultMaxSize.\n */\nclass WOFF2StringOut : public WOFF2Out {\n public:\n // Create a writer that writes its data to buf.\n // buf->size() will grow to at most max_size\n // buf may be sized (e.g. using EstimateWOFF2FinalSize) or empty.\n explicit WOFF2StringOut(std::string *buf);\n\n bool Write(const void *buf, size_t n) override;\n bool Write(const void *buf, size_t offset, size_t n) override;\n size_t Size() override { return offset_; }\n size_t MaxSize() { return max_size_; }\n void SetMaxSize(size_t max_size);\n private:\n std::string *buf_;\n size_t max_size_;\n size_t offset_;\n};\n\n/**\n * Fixed memory block for woff2 out.\n */\nclass WOFF2MemoryOut : public WOFF2Out {\n public:\n // Create a writer that writes its data to buf.\n WOFF2MemoryOut(uint8_t* buf, size_t buf_size);\n\n bool Write(const void *buf, size_t n) override;\n bool Write(const void *buf, size_t offset, size_t n) override;\n size_t Size() override { return offset_; }\n private:\n uint8_t* buf_;\n size_t buf_size_;\n size_t offset_;\n};\n\n} // namespace woff2\n\n#endif // WOFF2_WOFF2_OUT_H_\n" }, { "path": "libs/woff2/include/woff2/version.h", "content": "#ifndef WOFF2_WOFF2_VERSION_H_\n#define WOFF2_WOFF2_VERSION_H_\n\nnamespace woff2 {\nconstexpr const int version = 0x010002;\n}\n\n#endif\n" }, { "path": "libs/woff2/src/buffer.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* The parts of ots.h & opentype-sanitiser.h that we need, taken from the\n https://code.google.com/p/ots/ project. */\n\n#ifndef WOFF2_BUFFER_H_\n#define WOFF2_BUFFER_H_\n\n#if defined(_WIN32)\n#include \ntypedef signed char int8_t;\ntypedef unsigned char uint8_t;\ntypedef short int16_t;\ntypedef unsigned short uint16_t;\ntypedef int int32_t;\ntypedef unsigned int uint32_t;\ntypedef __int64 int64_t;\ntypedef unsigned __int64 uint64_t;\n#define ntohl(x) _byteswap_ulong (x)\n#define ntohs(x) _byteswap_ushort (x)\n#define htonl(x) _byteswap_ulong (x)\n#define htons(x) _byteswap_ushort (x)\n#else\n#include \n#include \n#endif\n\n#include \n#include \n#include \n#include \n\nnamespace woff2 {\n\n#if defined(_MSC_VER) || !defined(FONT_COMPRESSION_DEBUG)\n#define FONT_COMPRESSION_FAILURE() false\n#else\n#define FONT_COMPRESSION_FAILURE() \\\n woff2::Failure(__FILE__, __LINE__, __PRETTY_FUNCTION__)\ninline bool Failure(const char *f, int l, const char *fn) {\n fprintf(stderr, \"ERROR at %s:%d (%s)\\n\", f, l, fn);\n fflush(stderr);\n return false;\n}\n#endif\n\n// -----------------------------------------------------------------------------\n// Buffer helper class\n//\n// This class perform some trival buffer operations while checking for\n// out-of-bounds errors. As a family they return false if anything is amiss,\n// updating the current offset otherwise.\n// -----------------------------------------------------------------------------\nclass Buffer {\n public:\n Buffer(const uint8_t *data, size_t len)\n : buffer_(data),\n length_(len),\n offset_(0) { }\n\n bool Skip(size_t n_bytes) {\n return Read(NULL, n_bytes);\n }\n\n bool Read(uint8_t *data, size_t n_bytes) {\n if (n_bytes > 1024 * 1024 * 1024) {\n return FONT_COMPRESSION_FAILURE();\n }\n if ((offset_ + n_bytes > length_) ||\n (offset_ > length_ - n_bytes)) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (data) {\n std::memcpy(data, buffer_ + offset_, n_bytes);\n }\n offset_ += n_bytes;\n return true;\n }\n\n inline bool ReadU8(uint8_t *value) {\n if (offset_ + 1 > length_) {\n return FONT_COMPRESSION_FAILURE();\n }\n *value = buffer_[offset_];\n ++offset_;\n return true;\n }\n\n bool ReadU16(uint16_t *value) {\n if (offset_ + 2 > length_) {\n return FONT_COMPRESSION_FAILURE();\n }\n std::memcpy(value, buffer_ + offset_, sizeof(uint16_t));\n *value = ntohs(*value);\n offset_ += 2;\n return true;\n }\n\n bool ReadS16(int16_t *value) {\n return ReadU16(reinterpret_cast(value));\n }\n\n bool ReadU24(uint32_t *value) {\n if (offset_ + 3 > length_) {\n return FONT_COMPRESSION_FAILURE();\n }\n *value = static_cast(buffer_[offset_]) << 16 |\n static_cast(buffer_[offset_ + 1]) << 8 |\n static_cast(buffer_[offset_ + 2]);\n offset_ += 3;\n return true;\n }\n\n bool ReadU32(uint32_t *value) {\n if (offset_ + 4 > length_) {\n return FONT_COMPRESSION_FAILURE();\n }\n std::memcpy(value, buffer_ + offset_, sizeof(uint32_t));\n *value = ntohl(*value);\n offset_ += 4;\n return true;\n }\n\n bool ReadS32(int32_t *value) {\n return ReadU32(reinterpret_cast(value));\n }\n\n bool ReadTag(uint32_t *value) {\n if (offset_ + 4 > length_) {\n return FONT_COMPRESSION_FAILURE();\n }\n std::memcpy(value, buffer_ + offset_, sizeof(uint32_t));\n offset_ += 4;\n return true;\n }\n\n bool ReadR64(uint64_t *value) {\n if (offset_ + 8 > length_) {\n return FONT_COMPRESSION_FAILURE();\n }\n std::memcpy(value, buffer_ + offset_, sizeof(uint64_t));\n offset_ += 8;\n return true;\n }\n\n const uint8_t *buffer() const { return buffer_; }\n size_t offset() const { return offset_; }\n size_t length() const { return length_; }\n\n void set_offset(size_t newoffset) { offset_ = newoffset; }\n\n private:\n const uint8_t * const buffer_;\n const size_t length_;\n size_t offset_;\n};\n\n} // namespace woff2\n\n#endif // WOFF2_BUFFER_H_\n" }, { "path": "libs/woff2/src/font.cc", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Font management utilities */\n\n#include \"./font.h\"\n\n#include \n\n#include \"./buffer.h\"\n#include \"./port.h\"\n#include \"./store_bytes.h\"\n#include \"./table_tags.h\"\n#include \"./woff2_common.h\"\n\nnamespace woff2 {\n\nFont::Table* Font::FindTable(uint32_t tag) {\n std::map::iterator it = tables.find(tag);\n return it == tables.end() ? 0 : &it->second;\n}\n\nconst Font::Table* Font::FindTable(uint32_t tag) const {\n std::map::const_iterator it = tables.find(tag);\n return it == tables.end() ? 0 : &it->second;\n}\n\nstd::vector Font::OutputOrderedTags() const {\n std::vector output_order;\n\n for (const auto& i : tables) {\n const Font::Table& table = i.second;\n // This is a transformed table, we will write it together with the\n // original version.\n if (table.tag & 0x80808080) {\n continue;\n }\n output_order.push_back(table.tag);\n }\n\n // Alphabetize then put loca immediately after glyf\n auto glyf_loc = std::find(output_order.begin(), output_order.end(),\n kGlyfTableTag);\n auto loca_loc = std::find(output_order.begin(), output_order.end(),\n kLocaTableTag);\n if (glyf_loc != output_order.end() && loca_loc != output_order.end()) {\n output_order.erase(loca_loc);\n output_order.insert(std::find(output_order.begin(), output_order.end(),\n kGlyfTableTag) + 1, kLocaTableTag);\n }\n\n return output_order;\n}\n\nbool ReadTrueTypeFont(Buffer* file, const uint8_t* data, size_t len,\n Font* font) {\n // We don't care about the search_range, entry_selector and range_shift\n // fields, they will always be computed upon writing the font.\n if (!file->ReadU16(&font->num_tables) ||\n !file->Skip(6)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n std::map intervals;\n for (uint16_t i = 0; i < font->num_tables; ++i) {\n Font::Table table;\n table.flag_byte = 0;\n table.reuse_of = NULL;\n if (!file->ReadU32(&table.tag) ||\n !file->ReadU32(&table.checksum) ||\n !file->ReadU32(&table.offset) ||\n !file->ReadU32(&table.length)) {\n return FONT_COMPRESSION_FAILURE();\n }\n if ((table.offset & 3) != 0 ||\n table.length > len ||\n len - table.length < table.offset) {\n return FONT_COMPRESSION_FAILURE();\n }\n intervals[table.offset] = table.length;\n table.data = data + table.offset;\n if (font->tables.find(table.tag) != font->tables.end()) {\n return FONT_COMPRESSION_FAILURE();\n }\n font->tables[table.tag] = table;\n }\n\n // Check that tables are non-overlapping.\n uint32_t last_offset = 12UL + 16UL * font->num_tables;\n for (const auto& i : intervals) {\n if (i.first < last_offset || i.first + i.second < i.first) {\n return FONT_COMPRESSION_FAILURE();\n }\n last_offset = i.first + i.second;\n }\n\n // Sanity check key tables\n const Font::Table* head_table = font->FindTable(kHeadTableTag);\n if (head_table != NULL && head_table->length < 52) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n return true;\n}\n\nbool ReadCollectionFont(Buffer* file, const uint8_t* data, size_t len,\n Font* font,\n std::map* all_tables) {\n if (!file->ReadU32(&font->flavor)) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (!ReadTrueTypeFont(file, data, len, font)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n for (auto& entry : font->tables) {\n Font::Table& table = entry.second;\n\n if (all_tables->find(table.offset) == all_tables->end()) {\n (*all_tables)[table.offset] = font->FindTable(table.tag);\n } else {\n table.reuse_of = (*all_tables)[table.offset];\n if (table.tag != table.reuse_of->tag) {\n return FONT_COMPRESSION_FAILURE();\n }\n }\n\n }\n return true;\n}\n\nbool ReadTrueTypeCollection(Buffer* file, const uint8_t* data, size_t len,\n FontCollection* font_collection) {\n uint32_t num_fonts;\n\n if (!file->ReadU32(&font_collection->header_version) ||\n !file->ReadU32(&num_fonts)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n std::vector offsets;\n for (size_t i = 0; i < num_fonts; i++) {\n uint32_t offset;\n if (!file->ReadU32(&offset)) {\n return FONT_COMPRESSION_FAILURE();\n }\n offsets.push_back(offset);\n }\n\n font_collection->fonts.resize(offsets.size());\n std::vector::iterator font_it = font_collection->fonts.begin();\n\n std::map all_tables;\n for (const auto offset : offsets) {\n file->set_offset(offset);\n Font& font = *font_it++;\n if (!ReadCollectionFont(file, data, len, &font, &all_tables)) {\n return FONT_COMPRESSION_FAILURE();\n }\n }\n\n return true;\n}\n\nbool ReadFont(const uint8_t* data, size_t len, Font* font) {\n Buffer file(data, len);\n\n if (!file.ReadU32(&font->flavor)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n if (font->flavor == kTtcFontFlavor) {\n return FONT_COMPRESSION_FAILURE();\n }\n return ReadTrueTypeFont(&file, data, len, font);\n}\n\nbool ReadFontCollection(const uint8_t* data, size_t len,\n FontCollection* font_collection) {\n Buffer file(data, len);\n\n if (!file.ReadU32(&font_collection->flavor)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n if (font_collection->flavor != kTtcFontFlavor) {\n font_collection->fonts.resize(1);\n Font& font = font_collection->fonts[0];\n font.flavor = font_collection->flavor;\n return ReadTrueTypeFont(&file, data, len, &font);\n }\n return ReadTrueTypeCollection(&file, data, len, font_collection);\n}\n\nsize_t FontFileSize(const Font& font) {\n size_t max_offset = 12ULL + 16ULL * font.num_tables;\n for (const auto& i : font.tables) {\n const Font::Table& table = i.second;\n size_t padding_size = (4 - (table.length & 3)) & 3;\n size_t end_offset = (padding_size + table.offset) + table.length;\n max_offset = std::max(max_offset, end_offset);\n }\n return max_offset;\n}\n\nsize_t FontCollectionFileSize(const FontCollection& font_collection) {\n size_t max_offset = 0;\n for (auto& font : font_collection.fonts) {\n // font file size actually just finds max offset\n max_offset = std::max(max_offset, FontFileSize(font));\n }\n return max_offset;\n}\n\nbool WriteFont(const Font& font, uint8_t* dst, size_t dst_size) {\n size_t offset = 0;\n return WriteFont(font, &offset, dst, dst_size);\n}\n\nbool WriteTableRecord(const Font::Table* table, size_t* offset, uint8_t* dst,\n size_t dst_size) {\n if (dst_size < *offset + kSfntEntrySize) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (table->IsReused()) {\n table = table->reuse_of;\n }\n StoreU32(table->tag, offset, dst);\n StoreU32(table->checksum, offset, dst);\n StoreU32(table->offset, offset, dst);\n StoreU32(table->length, offset, dst);\n return true;\n}\n\nbool WriteTable(const Font::Table& table, size_t* offset, uint8_t* dst,\n size_t dst_size) {\n if (!WriteTableRecord(&table, offset, dst, dst_size)) {\n return false;\n }\n\n // Write the actual table data if it's the first time we've seen it\n if (!table.IsReused()) {\n if (table.offset + table.length < table.offset ||\n dst_size < table.offset + table.length) {\n return FONT_COMPRESSION_FAILURE();\n }\n memcpy(dst + table.offset, table.data, table.length);\n size_t padding_size = (4 - (table.length & 3)) & 3;\n if (table.offset + table.length + padding_size < padding_size ||\n dst_size < table.offset + table.length + padding_size) {\n return FONT_COMPRESSION_FAILURE();\n }\n memset(dst + table.offset + table.length, 0, padding_size);\n }\n return true;\n}\n\nbool WriteFont(const Font& font, size_t* offset, uint8_t* dst,\n size_t dst_size) {\n if (dst_size < 12ULL + 16ULL * font.num_tables) {\n return FONT_COMPRESSION_FAILURE();\n }\n StoreU32(font.flavor, offset, dst);\n Store16(font.num_tables, offset, dst);\n uint16_t max_pow2 = font.num_tables ? Log2Floor(font.num_tables) : 0;\n uint16_t search_range = max_pow2 ? 1 << (max_pow2 + 4) : 0;\n uint16_t range_shift = (font.num_tables << 4) - search_range;\n Store16(search_range, offset, dst);\n Store16(max_pow2, offset, dst);\n Store16(range_shift, offset, dst);\n\n for (const auto& i : font.tables) {\n if (!WriteTable(i.second, offset, dst, dst_size)) {\n return false;\n }\n }\n\n return true;\n}\n\nbool WriteFontCollection(const FontCollection& font_collection, uint8_t* dst,\n size_t dst_size) {\n size_t offset = 0;\n\n // It's simpler if this just a simple sfnt\n if (font_collection.flavor != kTtcFontFlavor) {\n return WriteFont(font_collection.fonts[0], &offset, dst, dst_size);\n }\n\n // Write TTC header\n StoreU32(kTtcFontFlavor, &offset, dst);\n StoreU32(font_collection.header_version, &offset, dst);\n StoreU32(font_collection.fonts.size(), &offset, dst);\n\n // Offset Table, zeroed for now\n size_t offset_table = offset; // where to write offsets later\n for (size_t i = 0; i < font_collection.fonts.size(); i++) {\n StoreU32(0, &offset, dst);\n }\n\n if (font_collection.header_version == 0x00020000) {\n StoreU32(0, &offset, dst); // ulDsigTag\n StoreU32(0, &offset, dst); // ulDsigLength\n StoreU32(0, &offset, dst); // ulDsigOffset\n }\n\n // Write fonts and their offsets.\n for (size_t i = 0; i < font_collection.fonts.size(); i++) {\n const auto& font = font_collection.fonts[i];\n StoreU32(offset, &offset_table, dst);\n if (!WriteFont(font, &offset, dst, dst_size)) {\n return false;\n }\n }\n\n return true;\n}\n\nint NumGlyphs(const Font& font) {\n const Font::Table* head_table = font.FindTable(kHeadTableTag);\n const Font::Table* loca_table = font.FindTable(kLocaTableTag);\n if (head_table == NULL || loca_table == NULL || head_table->length < 52) {\n return 0;\n }\n int index_fmt = IndexFormat(font);\n uint32_t loca_record_size = (index_fmt == 0 ? 2 : 4);\n if (loca_table->length < loca_record_size) {\n return 0;\n }\n return (loca_table->length / loca_record_size) - 1;\n}\n\nint IndexFormat(const Font& font) {\n const Font::Table* head_table = font.FindTable(kHeadTableTag);\n if (head_table == NULL) {\n return 0;\n }\n return head_table->data[51];\n}\n\nbool Font::Table::IsReused() const {\n return this->reuse_of != NULL;\n}\n\nbool GetGlyphData(const Font& font, int glyph_index,\n const uint8_t** glyph_data, size_t* glyph_size) {\n if (glyph_index < 0) {\n return FONT_COMPRESSION_FAILURE();\n }\n const Font::Table* head_table = font.FindTable(kHeadTableTag);\n const Font::Table* loca_table = font.FindTable(kLocaTableTag);\n const Font::Table* glyf_table = font.FindTable(kGlyfTableTag);\n if (head_table == NULL || loca_table == NULL || glyf_table == NULL ||\n head_table->length < 52) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n int index_fmt = IndexFormat(font);\n\n Buffer loca_buf(loca_table->data, loca_table->length);\n if (index_fmt == 0) {\n uint16_t offset1, offset2;\n if (!loca_buf.Skip(2 * glyph_index) ||\n !loca_buf.ReadU16(&offset1) ||\n !loca_buf.ReadU16(&offset2) ||\n offset2 < offset1 ||\n 2 * offset2 > glyf_table->length) {\n return FONT_COMPRESSION_FAILURE();\n }\n *glyph_data = glyf_table->data + 2 * offset1;\n *glyph_size = 2 * (offset2 - offset1);\n } else {\n uint32_t offset1, offset2;\n if (!loca_buf.Skip(4 * glyph_index) ||\n !loca_buf.ReadU32(&offset1) ||\n !loca_buf.ReadU32(&offset2) ||\n offset2 < offset1 ||\n offset2 > glyf_table->length) {\n return FONT_COMPRESSION_FAILURE();\n }\n *glyph_data = glyf_table->data + offset1;\n *glyph_size = offset2 - offset1;\n }\n return true;\n}\n\nbool RemoveDigitalSignature(Font* font) {\n std::map::iterator it =\n font->tables.find(kDsigTableTag);\n if (it != font->tables.end()) {\n font->tables.erase(it);\n font->num_tables = font->tables.size();\n }\n return true;\n}\n\n} // namespace woff2\n" }, { "path": "libs/woff2/src/font.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Data model for a font file in sfnt format, reading and writing functions and\n accessors for the glyph data. */\n\n#ifndef WOFF2_FONT_H_\n#define WOFF2_FONT_H_\n\n#include \n#include \n#include \n#include \n\nnamespace woff2 {\n\n// Represents an sfnt font file. Only the table directory is parsed, for the\n// table data we only store a raw pointer, therefore a font object is valid only\n// as long the data from which it was parsed is around.\nstruct Font {\n uint32_t flavor;\n uint16_t num_tables;\n\n struct Table {\n uint32_t tag;\n uint32_t checksum;\n uint32_t offset;\n uint32_t length;\n const uint8_t* data;\n\n // Buffer used to mutate the data before writing out.\n std::vector buffer;\n\n // If we've seen this tag/offset before, pointer to the first time we saw it\n // If this is the first time we've seen this table, NULL\n // Intended use is to bypass re-processing tables\n Font::Table* reuse_of;\n\n uint8_t flag_byte;\n\n // Is this table reused by a TTC\n bool IsReused() const;\n };\n std::map tables;\n std::vector OutputOrderedTags() const;\n\n Table* FindTable(uint32_t tag);\n const Table* FindTable(uint32_t tag) const;\n};\n\n// Accomodates both singular (OTF, TTF) and collection (TTC) fonts\nstruct FontCollection {\n uint32_t flavor;\n uint32_t header_version;\n // (offset, first use of table*) pairs\n std::map tables;\n std::vector fonts;\n};\n\n// Parses the font from the given data. Returns false on parsing failure or\n// buffer overflow. The font is valid only so long the input data pointer is\n// valid. Does NOT support collections.\nbool ReadFont(const uint8_t* data, size_t len, Font* font);\n\n// Parses the font from the given data. Returns false on parsing failure or\n// buffer overflow. The font is valid only so long the input data pointer is\n// valid. Supports collections.\nbool ReadFontCollection(const uint8_t* data, size_t len, FontCollection* fonts);\n\n// Returns the file size of the font.\nsize_t FontFileSize(const Font& font);\nsize_t FontCollectionFileSize(const FontCollection& font);\n\n// Writes the font into the specified dst buffer. The dst_size should be the\n// same as returned by FontFileSize(). Returns false upon buffer overflow (which\n// should not happen if dst_size was computed by FontFileSize()).\nbool WriteFont(const Font& font, uint8_t* dst, size_t dst_size);\n// Write the font at a specific offset\nbool WriteFont(const Font& font, size_t* offset, uint8_t* dst, size_t dst_size);\n\nbool WriteFontCollection(const FontCollection& font_collection, uint8_t* dst,\n size_t dst_size);\n\n// Returns the number of glyphs in the font.\n// NOTE: Currently this works only for TrueType-flavored fonts, will return\n// zero for CFF-flavored fonts.\nint NumGlyphs(const Font& font);\n\n// Returns the index format of the font\nint IndexFormat(const Font& font);\n\n// Sets *glyph_data and *glyph_size to point to the location of the glyph data\n// with the given index. Returns false if the glyph is not found.\nbool GetGlyphData(const Font& font, int glyph_index,\n const uint8_t** glyph_data, size_t* glyph_size);\n\n// Removes the digital signature (DSIG) table\nbool RemoveDigitalSignature(Font* font);\n\n} // namespace woff2\n\n#endif // WOFF2_FONT_H_\n" }, { "path": "libs/woff2/src/glyph.cc", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Glyph manipulation */\n\n#include \"./glyph.h\"\n\n#include \n#include \n#include \"./buffer.h\"\n#include \"./store_bytes.h\"\n\nnamespace woff2 {\n\nstatic const int32_t kFLAG_ONCURVE = 1;\nstatic const int32_t kFLAG_XSHORT = 1 << 1;\nstatic const int32_t kFLAG_YSHORT = 1 << 2;\nstatic const int32_t kFLAG_REPEAT = 1 << 3;\nstatic const int32_t kFLAG_XREPEATSIGN = 1 << 4;\nstatic const int32_t kFLAG_YREPEATSIGN = 1 << 5;\nstatic const int32_t kFLAG_OVERLAP_SIMPLE = 1 << 6;\nstatic const int32_t kFLAG_ARG_1_AND_2_ARE_WORDS = 1 << 0;\nstatic const int32_t kFLAG_WE_HAVE_A_SCALE = 1 << 3;\nstatic const int32_t kFLAG_MORE_COMPONENTS = 1 << 5;\nstatic const int32_t kFLAG_WE_HAVE_AN_X_AND_Y_SCALE = 1 << 6;\nstatic const int32_t kFLAG_WE_HAVE_A_TWO_BY_TWO = 1 << 7;\nstatic const int32_t kFLAG_WE_HAVE_INSTRUCTIONS = 1 << 8;\n\nbool ReadCompositeGlyphData(Buffer* buffer, Glyph* glyph) {\n glyph->have_instructions = false;\n glyph->composite_data = buffer->buffer() + buffer->offset();\n size_t start_offset = buffer->offset();\n uint16_t flags = kFLAG_MORE_COMPONENTS;\n while (flags & kFLAG_MORE_COMPONENTS) {\n if (!buffer->ReadU16(&flags)) {\n return FONT_COMPRESSION_FAILURE();\n }\n glyph->have_instructions |= (flags & kFLAG_WE_HAVE_INSTRUCTIONS) != 0;\n size_t arg_size = 2; // glyph index\n if (flags & kFLAG_ARG_1_AND_2_ARE_WORDS) {\n arg_size += 4;\n } else {\n arg_size += 2;\n }\n if (flags & kFLAG_WE_HAVE_A_SCALE) {\n arg_size += 2;\n } else if (flags & kFLAG_WE_HAVE_AN_X_AND_Y_SCALE) {\n arg_size += 4;\n } else if (flags & kFLAG_WE_HAVE_A_TWO_BY_TWO) {\n arg_size += 8;\n }\n if (!buffer->Skip(arg_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n }\n if (buffer->offset() - start_offset > std::numeric_limits::max()) {\n return FONT_COMPRESSION_FAILURE();\n }\n glyph->composite_data_size = buffer->offset() - start_offset;\n return true;\n}\n\nbool ReadGlyph(const uint8_t* data, size_t len, Glyph* glyph) {\n Buffer buffer(data, len);\n\n int16_t num_contours;\n if (!buffer.ReadS16(&num_contours)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n // Read the bounding box.\n if (!buffer.ReadS16(&glyph->x_min) ||\n !buffer.ReadS16(&glyph->y_min) ||\n !buffer.ReadS16(&glyph->x_max) ||\n !buffer.ReadS16(&glyph->y_max)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n if (num_contours == 0) {\n // Empty glyph.\n return true;\n }\n\n if (num_contours > 0) {\n // Simple glyph.\n glyph->contours.resize(num_contours);\n\n // Read the number of points per contour.\n uint16_t last_point_index = 0;\n for (int i = 0; i < num_contours; ++i) {\n uint16_t point_index;\n if (!buffer.ReadU16(&point_index)) {\n return FONT_COMPRESSION_FAILURE();\n }\n uint16_t num_points = point_index - last_point_index + (i == 0 ? 1 : 0);\n glyph->contours[i].resize(num_points);\n last_point_index = point_index;\n }\n\n // Read the instructions.\n if (!buffer.ReadU16(&glyph->instructions_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n glyph->instructions_data = data + buffer.offset();\n if (!buffer.Skip(glyph->instructions_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n // Read the run-length coded flags.\n std::vector > flags(num_contours);\n {\n uint8_t flag = 0;\n uint8_t flag_repeat = 0;\n for (int i = 0; i < num_contours; ++i) {\n flags[i].resize(glyph->contours[i].size());\n for (size_t j = 0; j < glyph->contours[i].size(); ++j) {\n if (flag_repeat == 0) {\n if (!buffer.ReadU8(&flag)) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (flag & kFLAG_REPEAT) {\n if (!buffer.ReadU8(&flag_repeat)) {\n return FONT_COMPRESSION_FAILURE();\n }\n }\n } else {\n flag_repeat--;\n }\n flags[i][j] = flag;\n glyph->contours[i][j].on_curve = flag & kFLAG_ONCURVE;\n }\n }\n }\n\n if (!flags.empty() && !flags[0].empty()) {\n glyph->overlap_simple_flag_set = (flags[0][0] & kFLAG_OVERLAP_SIMPLE);\n }\n\n // Read the x coordinates.\n int prev_x = 0;\n for (int i = 0; i < num_contours; ++i) {\n for (size_t j = 0; j < glyph->contours[i].size(); ++j) {\n uint8_t flag = flags[i][j];\n if (flag & kFLAG_XSHORT) {\n // single byte x-delta coord value\n uint8_t x_delta;\n if (!buffer.ReadU8(&x_delta)) {\n return FONT_COMPRESSION_FAILURE();\n }\n int sign = (flag & kFLAG_XREPEATSIGN) ? 1 : -1;\n glyph->contours[i][j].x = prev_x + sign * x_delta;\n } else {\n // double byte x-delta coord value\n int16_t x_delta = 0;\n if (!(flag & kFLAG_XREPEATSIGN)) {\n if (!buffer.ReadS16(&x_delta)) {\n return FONT_COMPRESSION_FAILURE();\n }\n }\n glyph->contours[i][j].x = prev_x + x_delta;\n }\n prev_x = glyph->contours[i][j].x;\n }\n }\n\n // Read the y coordinates.\n int prev_y = 0;\n for (int i = 0; i < num_contours; ++i) {\n for (size_t j = 0; j < glyph->contours[i].size(); ++j) {\n uint8_t flag = flags[i][j];\n if (flag & kFLAG_YSHORT) {\n // single byte y-delta coord value\n uint8_t y_delta;\n if (!buffer.ReadU8(&y_delta)) {\n return FONT_COMPRESSION_FAILURE();\n }\n int sign = (flag & kFLAG_YREPEATSIGN) ? 1 : -1;\n glyph->contours[i][j].y = prev_y + sign * y_delta;\n } else {\n // double byte y-delta coord value\n int16_t y_delta = 0;\n if (!(flag & kFLAG_YREPEATSIGN)) {\n if (!buffer.ReadS16(&y_delta)) {\n return FONT_COMPRESSION_FAILURE();\n }\n }\n glyph->contours[i][j].y = prev_y + y_delta;\n }\n prev_y = glyph->contours[i][j].y;\n }\n }\n } else if (num_contours == -1) {\n // Composite glyph.\n if (!ReadCompositeGlyphData(&buffer, glyph)) {\n return FONT_COMPRESSION_FAILURE();\n }\n // Read the instructions.\n if (glyph->have_instructions) {\n if (!buffer.ReadU16(&glyph->instructions_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n glyph->instructions_data = data + buffer.offset();\n if (!buffer.Skip(glyph->instructions_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n } else {\n glyph->instructions_size = 0;\n }\n } else {\n return FONT_COMPRESSION_FAILURE();\n }\n return true;\n}\n\nnamespace {\n\nvoid StoreBbox(const Glyph& glyph, size_t* offset, uint8_t* dst) {\n Store16(glyph.x_min, offset, dst);\n Store16(glyph.y_min, offset, dst);\n Store16(glyph.x_max, offset, dst);\n Store16(glyph.y_max, offset, dst);\n}\n\nvoid StoreInstructions(const Glyph& glyph, size_t* offset, uint8_t* dst) {\n Store16(glyph.instructions_size, offset, dst);\n StoreBytes(glyph.instructions_data, glyph.instructions_size, offset, dst);\n}\n\nbool StoreEndPtsOfContours(const Glyph& glyph, size_t* offset, uint8_t* dst) {\n int end_point = -1;\n for (const auto& contour : glyph.contours) {\n end_point += contour.size();\n if (contour.size() > std::numeric_limits::max() ||\n end_point > std::numeric_limits::max()) {\n return FONT_COMPRESSION_FAILURE();\n }\n Store16(end_point, offset, dst);\n }\n return true;\n}\n\nbool StorePoints(const Glyph& glyph, size_t* offset,\n uint8_t* dst, size_t dst_size) {\n int previous_flag = -1;\n int repeat_count = 0;\n int last_x = 0;\n int last_y = 0;\n size_t x_bytes = 0;\n size_t y_bytes = 0;\n\n // Store the flags and calculate the total size of the x and y coordinates.\n for (const auto& contour : glyph.contours) {\n for (const auto& point : contour) {\n int flag = point.on_curve ? kFLAG_ONCURVE : 0;\n if (previous_flag == -1 && glyph.overlap_simple_flag_set) {\n // First flag needs to have overlap simple bit set.\n flag = flag | kFLAG_OVERLAP_SIMPLE;\n }\n int dx = point.x - last_x;\n int dy = point.y - last_y;\n if (dx == 0) {\n flag |= kFLAG_XREPEATSIGN;\n } else if (dx > -256 && dx < 256) {\n flag |= kFLAG_XSHORT | (dx > 0 ? kFLAG_XREPEATSIGN : 0);\n x_bytes += 1;\n } else {\n x_bytes += 2;\n }\n if (dy == 0) {\n flag |= kFLAG_YREPEATSIGN;\n } else if (dy > -256 && dy < 256) {\n flag |= kFLAG_YSHORT | (dy > 0 ? kFLAG_YREPEATSIGN : 0);\n y_bytes += 1;\n } else {\n y_bytes += 2;\n }\n if (flag == previous_flag && repeat_count != 255) {\n dst[*offset - 1] |= kFLAG_REPEAT;\n repeat_count++;\n } else {\n if (repeat_count != 0) {\n if (*offset >= dst_size) {\n return FONT_COMPRESSION_FAILURE();\n }\n dst[(*offset)++] = repeat_count;\n }\n if (*offset >= dst_size) {\n return FONT_COMPRESSION_FAILURE();\n }\n dst[(*offset)++] = flag;\n repeat_count = 0;\n }\n last_x = point.x;\n last_y = point.y;\n previous_flag = flag;\n }\n }\n if (repeat_count != 0) {\n if (*offset >= dst_size) {\n return FONT_COMPRESSION_FAILURE();\n }\n dst[(*offset)++] = repeat_count;\n }\n\n if (*offset + x_bytes + y_bytes > dst_size) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n // Store the x and y coordinates.\n size_t x_offset = *offset;\n size_t y_offset = *offset + x_bytes;\n last_x = 0;\n last_y = 0;\n for (const auto& contour : glyph.contours) {\n for (const auto& point : contour) {\n int dx = point.x - last_x;\n int dy = point.y - last_y;\n if (dx == 0) {\n // pass\n } else if (dx > -256 && dx < 256) {\n dst[x_offset++] = std::abs(dx);\n } else {\n Store16(dx, &x_offset, dst);\n }\n if (dy == 0) {\n // pass\n } else if (dy > -256 && dy < 256) {\n dst[y_offset++] = std::abs(dy);\n } else {\n Store16(dy, &y_offset, dst);\n }\n last_x += dx;\n last_y += dy;\n }\n }\n *offset = y_offset;\n return true;\n}\n\n} // namespace\n\nbool StoreGlyph(const Glyph& glyph, uint8_t* dst, size_t* dst_size) {\n size_t offset = 0;\n if (glyph.composite_data_size > 0) {\n // Composite glyph.\n if (*dst_size < ((10ULL + glyph.composite_data_size) +\n ((glyph.have_instructions ? 2ULL : 0) +\n glyph.instructions_size))) {\n return FONT_COMPRESSION_FAILURE();\n }\n Store16(-1, &offset, dst);\n StoreBbox(glyph, &offset, dst);\n StoreBytes(glyph.composite_data, glyph.composite_data_size, &offset, dst);\n if (glyph.have_instructions) {\n StoreInstructions(glyph, &offset, dst);\n }\n } else if (glyph.contours.size() > 0) {\n // Simple glyph.\n if (glyph.contours.size() > std::numeric_limits::max()) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (*dst_size < ((12ULL + 2 * glyph.contours.size()) +\n glyph.instructions_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n Store16(glyph.contours.size(), &offset, dst);\n StoreBbox(glyph, &offset, dst);\n if (!StoreEndPtsOfContours(glyph, &offset, dst)) {\n return FONT_COMPRESSION_FAILURE();\n }\n StoreInstructions(glyph, &offset, dst);\n if (!StorePoints(glyph, &offset, dst, *dst_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n }\n *dst_size = offset;\n return true;\n}\n\n} // namespace woff2\n" }, { "path": "libs/woff2/src/glyph.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Data model and I/O for glyph data within sfnt format files for the purpose of\n performing the preprocessing step of the WOFF 2.0 conversion. */\n\n#ifndef WOFF2_GLYPH_H_\n#define WOFF2_GLYPH_H_\n\n#include \n#include \n\n#include \n#include \n\nnamespace woff2 {\n\n// Represents a parsed simple or composite glyph. The composite glyph data and\n// instructions are un-parsed and we keep only pointers to the raw data,\n// therefore the glyph is valid only so long the data from which it was parsed\n// is around.\nclass Glyph {\n public:\n Glyph()\n : instructions_size(0),\n overlap_simple_flag_set(false),\n composite_data_size(0) {}\n\n // Bounding box.\n int16_t x_min;\n int16_t x_max;\n int16_t y_min;\n int16_t y_max;\n\n // Instructions.\n uint16_t instructions_size;\n const uint8_t* instructions_data;\n\n // Flags.\n bool overlap_simple_flag_set;\n\n // Data model for simple glyphs.\n struct Point {\n int x;\n int y;\n bool on_curve;\n };\n std::vector > contours;\n\n // Data for composite glyphs.\n const uint8_t* composite_data;\n uint32_t composite_data_size;\n bool have_instructions;\n};\n\n// Parses the glyph from the given data. Returns false on parsing failure or\n// buffer overflow. The glyph is valid only so long the input data pointer is\n// valid.\nbool ReadGlyph(const uint8_t* data, size_t len, Glyph* glyph);\n\n// Stores the glyph into the specified dst buffer. The *dst_size is the buffer\n// size on entry and is set to the actual (unpadded) stored size on exit.\n// Returns false on buffer overflow.\nbool StoreGlyph(const Glyph& glyph, uint8_t* dst, size_t* dst_size);\n\n} // namespace woff2\n\n#endif // WOFF2_GLYPH_H_\n" }, { "path": "libs/woff2/src/normalize.cc", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Glyph normalization */\n\n#include \"./normalize.h\"\n\n#include \n#include \n\n#include \"./buffer.h\"\n#include \"./port.h\"\n#include \"./font.h\"\n#include \"./glyph.h\"\n#include \"./round.h\"\n#include \"./store_bytes.h\"\n#include \"./table_tags.h\"\n#include \"./woff2_common.h\"\n\nnamespace woff2 {\n\nnamespace {\n\nvoid StoreLoca(int index_fmt, uint32_t value, size_t* offset, uint8_t* dst) {\n if (index_fmt == 0) {\n Store16(value >> 1, offset, dst);\n } else {\n StoreU32(value, offset, dst);\n }\n}\n\n} // namespace\n\nnamespace {\n\nbool WriteNormalizedLoca(int index_fmt, int num_glyphs, Font* font) {\n Font::Table* glyf_table = font->FindTable(kGlyfTableTag);\n Font::Table* loca_table = font->FindTable(kLocaTableTag);\n\n int glyph_sz = index_fmt == 0 ? 2 : 4;\n loca_table->buffer.resize(Round4(num_glyphs + 1) * glyph_sz);\n loca_table->length = (num_glyphs + 1) * glyph_sz;\n\n uint8_t* glyf_dst = num_glyphs ? &glyf_table->buffer[0] : NULL;\n uint8_t* loca_dst = &loca_table->buffer[0];\n uint32_t glyf_offset = 0;\n size_t loca_offset = 0;\n\n for (int i = 0; i < num_glyphs; ++i) {\n StoreLoca(index_fmt, glyf_offset, &loca_offset, loca_dst);\n Glyph glyph;\n const uint8_t* glyph_data;\n size_t glyph_size;\n if (!GetGlyphData(*font, i, &glyph_data, &glyph_size) ||\n (glyph_size > 0 && !ReadGlyph(glyph_data, glyph_size, &glyph))) {\n return FONT_COMPRESSION_FAILURE();\n }\n size_t glyf_dst_size = glyf_table->buffer.size() - glyf_offset;\n if (!StoreGlyph(glyph, glyf_dst + glyf_offset, &glyf_dst_size)) {\n return FONT_COMPRESSION_FAILURE();\n }\n glyf_dst_size = Round4(glyf_dst_size);\n if (glyf_dst_size > std::numeric_limits::max() ||\n glyf_offset + static_cast(glyf_dst_size) < glyf_offset ||\n (index_fmt == 0 && glyf_offset + glyf_dst_size >= (1UL << 17))) {\n return FONT_COMPRESSION_FAILURE();\n }\n glyf_offset += glyf_dst_size;\n }\n\n StoreLoca(index_fmt, glyf_offset, &loca_offset, loca_dst);\n\n glyf_table->buffer.resize(glyf_offset);\n glyf_table->data = glyf_offset ? &glyf_table->buffer[0] : NULL;\n glyf_table->length = glyf_offset;\n loca_table->data = loca_offset ? &loca_table->buffer[0] : NULL;\n\n return true;\n}\n\n} // namespace\n\nnamespace {\n\nbool MakeEditableBuffer(Font* font, int tableTag) {\n Font::Table* table = font->FindTable(tableTag);\n if (table == NULL) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (table->IsReused()) {\n return true;\n }\n unsigned sz = Round4(table->length);\n table->buffer.resize(sz);\n uint8_t* buf = &table->buffer[0];\n memcpy(buf, table->data, table->length);\n if (PREDICT_FALSE(sz > table->length)) {\n memset(buf + table->length, 0, sz - table->length);\n }\n table->data = buf;\n return true;\n}\n\n} // namespace\n\nbool NormalizeGlyphs(Font* font) {\n Font::Table* head_table = font->FindTable(kHeadTableTag);\n Font::Table* glyf_table = font->FindTable(kGlyfTableTag);\n Font::Table* loca_table = font->FindTable(kLocaTableTag);\n if (head_table == NULL) {\n return FONT_COMPRESSION_FAILURE();\n }\n // If you don't have glyf/loca this transform isn't very interesting\n if (loca_table == NULL && glyf_table == NULL) {\n return true;\n }\n // It would be best if you didn't have just one of glyf/loca\n if ((glyf_table == NULL) != (loca_table == NULL)) {\n return FONT_COMPRESSION_FAILURE();\n }\n // Must share neither or both loca & glyf\n if (loca_table->IsReused() != glyf_table->IsReused()) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (loca_table->IsReused()) {\n return true;\n }\n\n int index_fmt = head_table->data[51];\n int num_glyphs = NumGlyphs(*font);\n\n // We need to allocate a bit more than its original length for the normalized\n // glyf table, since it can happen that the glyphs in the original table are\n // 2-byte aligned, while in the normalized table they are 4-byte aligned.\n // That gives a maximum of 2 bytes increase per glyph. However, there is no\n // theoretical guarantee that the total size of the flags plus the coordinates\n // is the smallest possible in the normalized version, so we have to allow\n // some general overhead.\n // TODO(user) Figure out some more precise upper bound on the size of\n // the overhead.\n size_t max_normalized_glyf_size = 1.1 * glyf_table->length + 2 * num_glyphs;\n\n glyf_table->buffer.resize(max_normalized_glyf_size);\n\n // if we can't write a loca using short's (index_fmt 0)\n // try again using longs (index_fmt 1)\n if (!WriteNormalizedLoca(index_fmt, num_glyphs, font)) {\n if (index_fmt != 0) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n // Rewrite loca with 4-byte entries & update head to match\n index_fmt = 1;\n if (!WriteNormalizedLoca(index_fmt, num_glyphs, font)) {\n return FONT_COMPRESSION_FAILURE();\n }\n head_table->buffer[51] = 1;\n }\n\n return true;\n}\n\nbool NormalizeOffsets(Font* font) {\n uint32_t offset = 12 + 16 * font->num_tables;\n for (auto tag : font->OutputOrderedTags()) {\n auto& table = font->tables[tag];\n table.offset = offset;\n offset += Round4(table.length);\n }\n return true;\n}\n\nnamespace {\n\nuint32_t ComputeHeaderChecksum(const Font& font) {\n uint32_t checksum = font.flavor;\n uint16_t max_pow2 = font.num_tables ? Log2Floor(font.num_tables) : 0;\n uint16_t search_range = max_pow2 ? 1 << (max_pow2 + 4) : 0;\n uint16_t range_shift = (font.num_tables << 4) - search_range;\n checksum += (font.num_tables << 16 | search_range);\n checksum += (max_pow2 << 16 | range_shift);\n for (const auto& i : font.tables) {\n const Font::Table* table = &i.second;\n if (table->IsReused()) {\n table = table->reuse_of;\n }\n checksum += table->tag;\n checksum += table->checksum;\n checksum += table->offset;\n checksum += table->length;\n }\n return checksum;\n}\n\n} // namespace\n\nbool FixChecksums(Font* font) {\n Font::Table* head_table = font->FindTable(kHeadTableTag);\n if (head_table == NULL) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (head_table->reuse_of != NULL) {\n head_table = head_table->reuse_of;\n }\n if (head_table->length < 12) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n uint8_t* head_buf = &head_table->buffer[0];\n size_t offset = 8;\n StoreU32(0, &offset, head_buf);\n uint32_t file_checksum = 0;\n for (auto& i : font->tables) {\n Font::Table* table = &i.second;\n if (table->IsReused()) {\n table = table->reuse_of;\n }\n table->checksum = ComputeULongSum(table->data, table->length);\n file_checksum += table->checksum;\n }\n\n file_checksum += ComputeHeaderChecksum(*font);\n offset = 8;\n StoreU32(0xb1b0afba - file_checksum, &offset, head_buf);\n\n return true;\n}\n\nnamespace {\nbool MarkTransformed(Font* font) {\n Font::Table* head_table = font->FindTable(kHeadTableTag);\n if (head_table == NULL) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (head_table->reuse_of != NULL) {\n head_table = head_table->reuse_of;\n }\n if (head_table->length < 17) {\n return FONT_COMPRESSION_FAILURE();\n }\n // set bit 11 of head table 'flags' to indicate that font has undergone\n // lossless modifying transform\n int head_flags = head_table->data[16];\n head_table->buffer[16] = head_flags | 0x08;\n return true;\n}\n} // namespace\n\n\nbool NormalizeWithoutFixingChecksums(Font* font) {\n return (MakeEditableBuffer(font, kHeadTableTag) &&\n RemoveDigitalSignature(font) &&\n MarkTransformed(font) &&\n NormalizeGlyphs(font) &&\n NormalizeOffsets(font));\n}\n\nbool NormalizeFont(Font* font) {\n return (NormalizeWithoutFixingChecksums(font) &&\n FixChecksums(font));\n}\n\nbool NormalizeFontCollection(FontCollection* font_collection) {\n if (font_collection->fonts.size() == 1) {\n return NormalizeFont(&font_collection->fonts[0]);\n }\n\n uint32_t offset = CollectionHeaderSize(font_collection->header_version,\n font_collection->fonts.size());\n for (auto& font : font_collection->fonts) {\n if (!NormalizeWithoutFixingChecksums(&font)) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Font normalization failed.\\n\");\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n offset += kSfntHeaderSize + kSfntEntrySize * font.num_tables;\n }\n\n // Start table offsets after TTC Header and Sfnt Headers\n for (auto& font : font_collection->fonts) {\n for (auto tag : font.OutputOrderedTags()) {\n Font::Table& table = font.tables[tag];\n if (table.IsReused()) {\n table.offset = table.reuse_of->offset;\n } else {\n table.offset = offset;\n offset += Round4(table.length);\n }\n }\n }\n\n // Now we can fix the checksums\n for (auto& font : font_collection->fonts) {\n if (!FixChecksums(&font)) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Failed to fix checksums\\n\");\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n }\n\n return true;\n}\n\n} // namespace woff2\n" }, { "path": "libs/woff2/src/normalize.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Functions for normalizing fonts. Since the WOFF 2.0 decoder creates font\n files in normalized form, the WOFF 2.0 conversion is guaranteed to be\n lossless (in a bitwise sense) only for normalized font files. */\n\n#ifndef WOFF2_NORMALIZE_H_\n#define WOFF2_NORMALIZE_H_\n\nnamespace woff2 {\n\nstruct Font;\nstruct FontCollection;\n\n// Changes the offset fields of the table headers so that the data for the\n// tables will be written in order of increasing tag values, without any gaps\n// other than the 4-byte padding.\nbool NormalizeOffsets(Font* font);\n\n// Changes the checksum fields of the table headers and the checksum field of\n// the head table so that it matches the current data.\nbool FixChecksums(Font* font);\n\n// Parses each of the glyphs in the font and writes them again to the glyf\n// table in normalized form, as defined by the StoreGlyph() function. Changes\n// the loca table accordigly.\nbool NormalizeGlyphs(Font* font);\n\n// Performs all of the normalization steps above.\nbool NormalizeFont(Font* font);\nbool NormalizeFontCollection(FontCollection* font_collection);\n\n} // namespace woff2\n\n#endif // WOFF2_NORMALIZE_H_\n" }, { "path": "libs/woff2/src/port.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Helper function for bit twiddling and macros for branch prediction. */\n\n#ifndef WOFF2_PORT_H_\n#define WOFF2_PORT_H_\n\n#include \n\nnamespace woff2 {\n\ntypedef unsigned int uint32;\n\ninline int Log2Floor(uint32 n) {\n#if defined(__GNUC__)\n return n == 0 ? -1 : 31 ^ __builtin_clz(n);\n#else\n if (n == 0)\n return -1;\n int log = 0;\n uint32 value = n;\n for (int i = 4; i >= 0; --i) {\n int shift = (1 << i);\n uint32 x = value >> shift;\n if (x != 0) {\n value = x;\n log += shift;\n }\n }\n assert(value == 1);\n return log;\n#endif\n}\n\n} // namespace woff2\n\n/* Compatibility with non-clang compilers. */\n#ifndef __has_builtin\n#define __has_builtin(x) 0\n#endif\n\n#if (__GNUC__ > 2) || (__GNUC__ == 2 && __GNUC_MINOR__ > 95) || \\\n (defined(__llvm__) && __has_builtin(__builtin_expect))\n#define PREDICT_FALSE(x) (__builtin_expect(x, 0))\n#define PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))\n#else\n#define PREDICT_FALSE(x) (x)\n#define PREDICT_TRUE(x) (x)\n#endif\n\n#if (defined(__ARM_ARCH) && (__ARM_ARCH == 7)) || \\\n (defined(M_ARM) && (M_ARM == 7)) || \\\n defined(__aarch64__) || defined(__ARM64_ARCH_8__) || defined(__i386) || \\\n defined(_M_IX86) || defined(__x86_64__) || defined(_M_X64)\n#if defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)\n#define WOFF_LITTLE_ENDIAN\n#elif defined(__BYTE_ORDER__) && (__BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)\n#define WOFF_BIG_ENDIAN\n#endif /* endianness */\n#endif /* CPU whitelist */\n\n#endif // WOFF2_PORT_H_\n" }, { "path": "libs/woff2/src/round.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Helper for rounding */\n\n#ifndef WOFF2_ROUND_H_\n#define WOFF2_ROUND_H_\n\n#include \n\nnamespace woff2 {\n\n// Round a value up to the nearest multiple of 4. Don't round the value in the\n// case that rounding up overflows.\ntemplate T Round4(T value) {\n if (std::numeric_limits::max() - value < 3) {\n return value;\n }\n return (value + 3) & ~3;\n}\n\n} // namespace woff2\n\n#endif // WOFF2_ROUND_H_\n" }, { "path": "libs/woff2/src/store_bytes.h", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Helper functions for storing integer values into byte streams.\n No bounds checking is performed, that is the responsibility of the caller. */\n\n#ifndef WOFF2_STORE_BYTES_H_\n#define WOFF2_STORE_BYTES_H_\n\n#include \n#include \n#include \n\n#include \"./port.h\"\n\nnamespace woff2 {\n\ninline size_t StoreU32(uint8_t* dst, size_t offset, uint32_t x) {\n dst[offset] = x >> 24;\n dst[offset + 1] = x >> 16;\n dst[offset + 2] = x >> 8;\n dst[offset + 3] = x;\n return offset + 4;\n}\n\ninline size_t Store16(uint8_t* dst, size_t offset, int x) {\n dst[offset] = x >> 8;\n dst[offset + 1] = x;\n return offset + 2;\n}\n\ninline void StoreU32(uint32_t val, size_t* offset, uint8_t* dst) {\n dst[(*offset)++] = val >> 24;\n dst[(*offset)++] = val >> 16;\n dst[(*offset)++] = val >> 8;\n dst[(*offset)++] = val;\n}\n\ninline void Store16(int val, size_t* offset, uint8_t* dst) {\n dst[(*offset)++] = val >> 8;\n dst[(*offset)++] = val;\n}\n\ninline void StoreBytes(const uint8_t* data, size_t len,\n size_t* offset, uint8_t* dst) {\n memcpy(&dst[*offset], data, len);\n *offset += len;\n}\n\n} // namespace woff2\n\n#endif // WOFF2_STORE_BYTES_H_\n" }, { "path": "libs/woff2/src/table_tags.cc", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Font table tags */\n\n#include \"./table_tags.h\"\n\nnamespace woff2 {\n\n// Note that the byte order is big-endian, not the same as ots.cc\n#define TAG(a, b, c, d) ((a << 24) | (b << 16) | (c << 8) | d)\n\nconst uint32_t kKnownTags[63] = {\n TAG('c', 'm', 'a', 'p'), // 0\n TAG('h', 'e', 'a', 'd'), // 1\n TAG('h', 'h', 'e', 'a'), // 2\n TAG('h', 'm', 't', 'x'), // 3\n TAG('m', 'a', 'x', 'p'), // 4\n TAG('n', 'a', 'm', 'e'), // 5\n TAG('O', 'S', '/', '2'), // 6\n TAG('p', 'o', 's', 't'), // 7\n TAG('c', 'v', 't', ' '), // 8\n TAG('f', 'p', 'g', 'm'), // 9\n TAG('g', 'l', 'y', 'f'), // 10\n TAG('l', 'o', 'c', 'a'), // 11\n TAG('p', 'r', 'e', 'p'), // 12\n TAG('C', 'F', 'F', ' '), // 13\n TAG('V', 'O', 'R', 'G'), // 14\n TAG('E', 'B', 'D', 'T'), // 15\n TAG('E', 'B', 'L', 'C'), // 16\n TAG('g', 'a', 's', 'p'), // 17\n TAG('h', 'd', 'm', 'x'), // 18\n TAG('k', 'e', 'r', 'n'), // 19\n TAG('L', 'T', 'S', 'H'), // 20\n TAG('P', 'C', 'L', 'T'), // 21\n TAG('V', 'D', 'M', 'X'), // 22\n TAG('v', 'h', 'e', 'a'), // 23\n TAG('v', 'm', 't', 'x'), // 24\n TAG('B', 'A', 'S', 'E'), // 25\n TAG('G', 'D', 'E', 'F'), // 26\n TAG('G', 'P', 'O', 'S'), // 27\n TAG('G', 'S', 'U', 'B'), // 28\n TAG('E', 'B', 'S', 'C'), // 29\n TAG('J', 'S', 'T', 'F'), // 30\n TAG('M', 'A', 'T', 'H'), // 31\n TAG('C', 'B', 'D', 'T'), // 32\n TAG('C', 'B', 'L', 'C'), // 33\n TAG('C', 'O', 'L', 'R'), // 34\n TAG('C', 'P', 'A', 'L'), // 35\n TAG('S', 'V', 'G', ' '), // 36\n TAG('s', 'b', 'i', 'x'), // 37\n TAG('a', 'c', 'n', 't'), // 38\n TAG('a', 'v', 'a', 'r'), // 39\n TAG('b', 'd', 'a', 't'), // 40\n TAG('b', 'l', 'o', 'c'), // 41\n TAG('b', 's', 'l', 'n'), // 42\n TAG('c', 'v', 'a', 'r'), // 43\n TAG('f', 'd', 's', 'c'), // 44\n TAG('f', 'e', 'a', 't'), // 45\n TAG('f', 'm', 't', 'x'), // 46\n TAG('f', 'v', 'a', 'r'), // 47\n TAG('g', 'v', 'a', 'r'), // 48\n TAG('h', 's', 't', 'y'), // 49\n TAG('j', 'u', 's', 't'), // 50\n TAG('l', 'c', 'a', 'r'), // 51\n TAG('m', 'o', 'r', 't'), // 52\n TAG('m', 'o', 'r', 'x'), // 53\n TAG('o', 'p', 'b', 'd'), // 54\n TAG('p', 'r', 'o', 'p'), // 55\n TAG('t', 'r', 'a', 'k'), // 56\n TAG('Z', 'a', 'p', 'f'), // 57\n TAG('S', 'i', 'l', 'f'), // 58\n TAG('G', 'l', 'a', 't'), // 59\n TAG('G', 'l', 'o', 'c'), // 60\n TAG('F', 'e', 'a', 't'), // 61\n TAG('S', 'i', 'l', 'l'), // 62\n};\n\n} // namespace woff2\n" }, { "path": "libs/woff2/src/table_tags.h", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Font table tags */\n\n#ifndef WOFF2_TABLE_TAGS_H_\n#define WOFF2_TABLE_TAGS_H_\n\n#include \n\nnamespace woff2 {\n\n// Tags of popular tables.\nstatic const uint32_t kGlyfTableTag = 0x676c7966;\nstatic const uint32_t kHeadTableTag = 0x68656164;\nstatic const uint32_t kLocaTableTag = 0x6c6f6361;\nstatic const uint32_t kDsigTableTag = 0x44534947;\nstatic const uint32_t kCffTableTag = 0x43464620;\nstatic const uint32_t kHmtxTableTag = 0x686d7478;\nstatic const uint32_t kHheaTableTag = 0x68686561;\nstatic const uint32_t kMaxpTableTag = 0x6d617870;\n\nextern const uint32_t kKnownTags[];\n\n} // namespace woff2\n\n#endif // WOFF2_TABLE_TAGS_H_\n" }, { "path": "libs/woff2/src/transform.cc", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Library for preprocessing fonts as part of the WOFF 2.0 conversion. */\n\n#include \"./transform.h\"\n\n#include // for std::abs\n\n#include \"./buffer.h\"\n#include \"./font.h\"\n#include \"./glyph.h\"\n#include \"./table_tags.h\"\n#include \"./variable_length.h\"\n\nnamespace woff2 {\n\nnamespace {\n\nconst int FLAG_ARG_1_AND_2_ARE_WORDS = 1 << 0;\nconst int FLAG_WE_HAVE_INSTRUCTIONS = 1 << 8;\nconst int FLAG_OVERLAP_SIMPLE_BITMAP = 1 << 0;\n\nvoid WriteBytes(std::vector* out, const uint8_t* data, size_t len) {\n if (len == 0) return;\n size_t offset = out->size();\n out->resize(offset + len);\n memcpy(&(*out)[offset], data, len);\n}\n\nvoid WriteBytes(std::vector* out, const std::vector& in) {\n for (size_t i = 0; i < in.size(); ++i) {\n out->push_back(in[i]);\n }\n}\n\nvoid WriteUShort(std::vector* out, int value) {\n out->push_back(value >> 8);\n out->push_back(value & 255);\n}\n\nvoid WriteLong(std::vector* out, int value) {\n out->push_back((value >> 24) & 255);\n out->push_back((value >> 16) & 255);\n out->push_back((value >> 8) & 255);\n out->push_back(value & 255);\n}\n\n// Glyf table preprocessing, based on\n// GlyfEncoder.java\nclass GlyfEncoder {\n public:\n explicit GlyfEncoder(int num_glyphs)\n : n_glyphs_(num_glyphs) {\n bbox_bitmap_.resize(((num_glyphs + 31) >> 5) << 2);\n }\n\n bool Encode(int glyph_id, const Glyph& glyph) {\n if (glyph.composite_data_size > 0) {\n WriteCompositeGlyph(glyph_id, glyph);\n } else if (glyph.contours.size() > 0) {\n WriteSimpleGlyph(glyph_id, glyph);\n } else {\n WriteUShort(&n_contour_stream_, 0);\n }\n return true;\n }\n\n void GetTransformedGlyfBytes(std::vector* result) {\n WriteUShort(result, 0); // Version\n WriteUShort(result, overlap_bitmap_.empty()\n ? 0x00\n : FLAG_OVERLAP_SIMPLE_BITMAP); // Flags\n WriteUShort(result, n_glyphs_);\n WriteUShort(result, 0); // index_format, will be set later\n WriteLong(result, n_contour_stream_.size());\n WriteLong(result, n_points_stream_.size());\n WriteLong(result, flag_byte_stream_.size());\n WriteLong(result, glyph_stream_.size());\n WriteLong(result, composite_stream_.size());\n WriteLong(result, bbox_bitmap_.size() + bbox_stream_.size());\n WriteLong(result, instruction_stream_.size());\n WriteBytes(result, n_contour_stream_);\n WriteBytes(result, n_points_stream_);\n WriteBytes(result, flag_byte_stream_);\n WriteBytes(result, glyph_stream_);\n WriteBytes(result, composite_stream_);\n WriteBytes(result, bbox_bitmap_);\n WriteBytes(result, bbox_stream_);\n WriteBytes(result, instruction_stream_);\n if (!overlap_bitmap_.empty()) {\n WriteBytes(result, overlap_bitmap_);\n }\n }\n\n private:\n void WriteInstructions(const Glyph& glyph) {\n Write255UShort(&glyph_stream_, glyph.instructions_size);\n WriteBytes(&instruction_stream_,\n glyph.instructions_data, glyph.instructions_size);\n }\n\n bool ShouldWriteSimpleGlyphBbox(const Glyph& glyph) {\n if (glyph.contours.empty() || glyph.contours[0].empty()) {\n return glyph.x_min || glyph.y_min || glyph.x_max || glyph.y_max;\n }\n\n int16_t x_min = glyph.contours[0][0].x;\n int16_t y_min = glyph.contours[0][0].y;\n int16_t x_max = x_min;\n int16_t y_max = y_min;\n for (const auto& contour : glyph.contours) {\n for (const auto& point : contour) {\n if (point.x < x_min) x_min = point.x;\n if (point.x > x_max) x_max = point.x;\n if (point.y < y_min) y_min = point.y;\n if (point.y > y_max) y_max = point.y;\n }\n }\n\n if (glyph.x_min != x_min)\n return true;\n if (glyph.y_min != y_min)\n return true;\n if (glyph.x_max != x_max)\n return true;\n if (glyph.y_max != y_max)\n return true;\n\n return false;\n }\n\n void WriteSimpleGlyph(int glyph_id, const Glyph& glyph) {\n if (glyph.overlap_simple_flag_set) {\n EnsureOverlapBitmap();\n overlap_bitmap_[glyph_id >> 3] |= 0x80 >> (glyph_id & 7);\n }\n int num_contours = glyph.contours.size();\n WriteUShort(&n_contour_stream_, num_contours);\n if (ShouldWriteSimpleGlyphBbox(glyph)) {\n WriteBbox(glyph_id, glyph);\n }\n for (int i = 0; i < num_contours; i++) {\n Write255UShort(&n_points_stream_, glyph.contours[i].size());\n }\n int lastX = 0;\n int lastY = 0;\n for (int i = 0; i < num_contours; i++) {\n int num_points = glyph.contours[i].size();\n for (int j = 0; j < num_points; j++) {\n int x = glyph.contours[i][j].x;\n int y = glyph.contours[i][j].y;\n int dx = x - lastX;\n int dy = y - lastY;\n WriteTriplet(glyph.contours[i][j].on_curve, dx, dy);\n lastX = x;\n lastY = y;\n }\n }\n if (num_contours > 0) {\n WriteInstructions(glyph);\n }\n }\n\n void WriteCompositeGlyph(int glyph_id, const Glyph& glyph) {\n WriteUShort(&n_contour_stream_, -1);\n WriteBbox(glyph_id, glyph);\n WriteBytes(&composite_stream_,\n glyph.composite_data,\n glyph.composite_data_size);\n if (glyph.have_instructions) {\n WriteInstructions(glyph);\n }\n }\n\n void WriteBbox(int glyph_id, const Glyph& glyph) {\n bbox_bitmap_[glyph_id >> 3] |= 0x80 >> (glyph_id & 7);\n WriteUShort(&bbox_stream_, glyph.x_min);\n WriteUShort(&bbox_stream_, glyph.y_min);\n WriteUShort(&bbox_stream_, glyph.x_max);\n WriteUShort(&bbox_stream_, glyph.y_max);\n }\n\n void WriteTriplet(bool on_curve, int x, int y) {\n int abs_x = std::abs(x);\n int abs_y = std::abs(y);\n int on_curve_bit = on_curve ? 0 : 128;\n int x_sign_bit = (x < 0) ? 0 : 1;\n int y_sign_bit = (y < 0) ? 0 : 1;\n int xy_sign_bits = x_sign_bit + 2 * y_sign_bit;\n if (x == 0 && abs_y < 1280) {\n flag_byte_stream_.push_back(on_curve_bit +\n ((abs_y & 0xf00) >> 7) + y_sign_bit);\n glyph_stream_.push_back(abs_y & 0xff);\n } else if (y == 0 && abs_x < 1280) {\n flag_byte_stream_.push_back(on_curve_bit + 10 +\n ((abs_x & 0xf00) >> 7) + x_sign_bit);\n glyph_stream_.push_back(abs_x & 0xff);\n } else if (abs_x < 65 && abs_y < 65) {\n flag_byte_stream_.push_back(on_curve_bit + 20 +\n ((abs_x - 1) & 0x30) +\n (((abs_y - 1) & 0x30) >> 2) +\n xy_sign_bits);\n glyph_stream_.push_back((((abs_x - 1) & 0xf) << 4) | ((abs_y - 1) & 0xf));\n } else if (abs_x < 769 && abs_y < 769) {\n flag_byte_stream_.push_back(on_curve_bit + 84 +\n 12 * (((abs_x - 1) & 0x300) >> 8) +\n (((abs_y - 1) & 0x300) >> 6) + xy_sign_bits);\n glyph_stream_.push_back((abs_x - 1) & 0xff);\n glyph_stream_.push_back((abs_y - 1) & 0xff);\n } else if (abs_x < 4096 && abs_y < 4096) {\n flag_byte_stream_.push_back(on_curve_bit + 120 + xy_sign_bits);\n glyph_stream_.push_back(abs_x >> 4);\n glyph_stream_.push_back(((abs_x & 0xf) << 4) | (abs_y >> 8));\n glyph_stream_.push_back(abs_y & 0xff);\n } else {\n flag_byte_stream_.push_back(on_curve_bit + 124 + xy_sign_bits);\n glyph_stream_.push_back(abs_x >> 8);\n glyph_stream_.push_back(abs_x & 0xff);\n glyph_stream_.push_back(abs_y >> 8);\n glyph_stream_.push_back(abs_y & 0xff);\n }\n }\n\n void EnsureOverlapBitmap() {\n if (overlap_bitmap_.empty()) {\n overlap_bitmap_.resize((n_glyphs_ + 7) >> 3);\n }\n }\n\n std::vector n_contour_stream_;\n std::vector n_points_stream_;\n std::vector flag_byte_stream_;\n std::vector composite_stream_;\n std::vector bbox_bitmap_;\n std::vector bbox_stream_;\n std::vector glyph_stream_;\n std::vector instruction_stream_;\n std::vector overlap_bitmap_;\n int n_glyphs_;\n};\n\n} // namespace\n\nbool TransformGlyfAndLocaTables(Font* font) {\n // no transform for CFF\n const Font::Table* glyf_table = font->FindTable(kGlyfTableTag);\n const Font::Table* loca_table = font->FindTable(kLocaTableTag);\n\n // If you don't have glyf/loca this transform isn't very interesting\n if (loca_table == NULL && glyf_table == NULL) {\n return true;\n }\n // It would be best if you didn't have just one of glyf/loca\n if ((glyf_table == NULL) != (loca_table == NULL)) {\n return FONT_COMPRESSION_FAILURE();\n }\n // Must share neither or both loca & glyf\n if (loca_table->IsReused() != glyf_table->IsReused()) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (loca_table->IsReused()) {\n return true;\n }\n\n Font::Table* transformed_glyf = &font->tables[kGlyfTableTag ^ 0x80808080];\n Font::Table* transformed_loca = &font->tables[kLocaTableTag ^ 0x80808080];\n\n int num_glyphs = NumGlyphs(*font);\n GlyfEncoder encoder(num_glyphs);\n for (int i = 0; i < num_glyphs; ++i) {\n Glyph glyph;\n const uint8_t* glyph_data;\n size_t glyph_size;\n if (!GetGlyphData(*font, i, &glyph_data, &glyph_size) ||\n (glyph_size > 0 && !ReadGlyph(glyph_data, glyph_size, &glyph))) {\n return FONT_COMPRESSION_FAILURE();\n }\n encoder.Encode(i, glyph);\n }\n encoder.GetTransformedGlyfBytes(&transformed_glyf->buffer);\n\n const Font::Table* head_table = font->FindTable(kHeadTableTag);\n if (head_table == NULL || head_table->length < 52) {\n return FONT_COMPRESSION_FAILURE();\n }\n transformed_glyf->buffer[7] = head_table->data[51]; // index_format\n\n transformed_glyf->tag = kGlyfTableTag ^ 0x80808080;\n transformed_glyf->length = transformed_glyf->buffer.size();\n transformed_glyf->data = transformed_glyf->buffer.data();\n\n transformed_loca->tag = kLocaTableTag ^ 0x80808080;\n transformed_loca->length = 0;\n transformed_loca->data = NULL;\n\n return true;\n}\n\n// See https://www.microsoft.com/typography/otspec/hmtx.htm\n// See WOFF2 spec, 5.4. Transformed hmtx table format\nbool TransformHmtxTable(Font* font) {\n const Font::Table* glyf_table = font->FindTable(kGlyfTableTag);\n const Font::Table* hmtx_table = font->FindTable(kHmtxTableTag);\n const Font::Table* hhea_table = font->FindTable(kHheaTableTag);\n\n // If you don't have hmtx or a glyf not much is going to happen here\n if (hmtx_table == NULL || glyf_table == NULL) {\n return true;\n }\n\n // hmtx without hhea doesn't make sense\n if (hhea_table == NULL) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n // Skip 34 to reach 'hhea' numberOfHMetrics\n Buffer hhea_buf(hhea_table->data, hhea_table->length);\n uint16_t num_hmetrics;\n if (!hhea_buf.Skip(34) || !hhea_buf.ReadU16(&num_hmetrics)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n // Must have at least one hMetric\n if (num_hmetrics < 1) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n int num_glyphs = NumGlyphs(*font);\n\n // Most fonts can be transformed; assume it's a go until proven otherwise\n std::vector advance_widths;\n std::vector proportional_lsbs;\n std::vector monospace_lsbs;\n\n bool remove_proportional_lsb = true;\n bool remove_monospace_lsb = (num_glyphs - num_hmetrics) > 0;\n\n Buffer hmtx_buf(hmtx_table->data, hmtx_table->length);\n for (int i = 0; i < num_glyphs; i++) {\n Glyph glyph;\n const uint8_t* glyph_data;\n size_t glyph_size;\n if (!GetGlyphData(*font, i, &glyph_data, &glyph_size) ||\n (glyph_size > 0 && !ReadGlyph(glyph_data, glyph_size, &glyph))) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n uint16_t advance_width = 0;\n int16_t lsb = 0;\n\n if (i < num_hmetrics) {\n // [0, num_hmetrics) are proportional hMetrics\n if (!hmtx_buf.ReadU16(&advance_width)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n if (!hmtx_buf.ReadS16(&lsb)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n if (glyph_size > 0 && glyph.x_min != lsb) {\n remove_proportional_lsb = false;\n }\n\n advance_widths.push_back(advance_width);\n proportional_lsbs.push_back(lsb);\n } else {\n // [num_hmetrics, num_glyphs) are monospace leftSideBearing's\n if (!hmtx_buf.ReadS16(&lsb)) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (glyph_size > 0 && glyph.x_min != lsb) {\n remove_monospace_lsb = false;\n }\n monospace_lsbs.push_back(lsb);\n }\n\n // If we know we can't optimize, bail out completely\n if (!remove_proportional_lsb && !remove_monospace_lsb) {\n return true;\n }\n }\n\n Font::Table* transformed_hmtx = &font->tables[kHmtxTableTag ^ 0x80808080];\n\n uint8_t flags = 0;\n size_t transformed_size = 1 + 2 * advance_widths.size();\n if (remove_proportional_lsb) {\n flags |= 1;\n } else {\n transformed_size += 2 * proportional_lsbs.size();\n }\n if (remove_monospace_lsb) {\n flags |= 1 << 1;\n } else {\n transformed_size += 2 * monospace_lsbs.size();\n }\n\n transformed_hmtx->buffer.reserve(transformed_size);\n std::vector* out = &transformed_hmtx->buffer;\n WriteBytes(out, &flags, 1);\n for (uint16_t advance_width : advance_widths) {\n WriteUShort(out, advance_width);\n }\n\n if (!remove_proportional_lsb) {\n for (int16_t lsb : proportional_lsbs) {\n WriteUShort(out, lsb);\n }\n }\n if (!remove_monospace_lsb) {\n for (int16_t lsb : monospace_lsbs) {\n WriteUShort(out, lsb);\n }\n }\n\n transformed_hmtx->tag = kHmtxTableTag ^ 0x80808080;\n transformed_hmtx->flag_byte = 1 << 6;\n transformed_hmtx->length = transformed_hmtx->buffer.size();\n transformed_hmtx->data = transformed_hmtx->buffer.data();\n\n\n return true;\n}\n\n} // namespace woff2\n" }, { "path": "libs/woff2/src/transform.h", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Library for preprocessing fonts as part of the WOFF 2.0 conversion. */\n\n#ifndef WOFF2_TRANSFORM_H_\n#define WOFF2_TRANSFORM_H_\n\n#include \"./font.h\"\n\nnamespace woff2 {\n\n// Adds the transformed versions of the glyf and loca tables to the font. The\n// transformed loca table has zero length. The tag of the transformed tables is\n// derived from the original tag by flipping the MSBs of every byte.\nbool TransformGlyfAndLocaTables(Font* font);\n\n// Apply transformation to hmtx table if applicable for this font.\nbool TransformHmtxTable(Font* font);\n\n} // namespace woff2\n\n#endif // WOFF2_TRANSFORM_H_\n" }, { "path": "libs/woff2/src/variable_length.cc", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Helper functions for woff2 variable length types: 255UInt16 and UIntBase128 */\n\n#include \"./variable_length.h\"\n\nnamespace woff2 {\n\nsize_t Size255UShort(uint16_t value) {\n size_t result = 3;\n if (value < 253) {\n result = 1;\n } else if (value < 762) {\n result = 2;\n } else {\n result = 3;\n }\n return result;\n}\n\nvoid Write255UShort(std::vector* out, int value) {\n if (value < 253) {\n out->push_back(value);\n } else if (value < 506) {\n out->push_back(255);\n out->push_back(value - 253);\n } else if (value < 762) {\n out->push_back(254);\n out->push_back(value - 506);\n } else {\n out->push_back(253);\n out->push_back(value >> 8);\n out->push_back(value & 0xff);\n }\n}\n\nvoid Store255UShort(int val, size_t* offset, uint8_t* dst) {\n std::vector packed;\n Write255UShort(&packed, val);\n for (uint8_t packed_byte : packed) {\n dst[(*offset)++] = packed_byte;\n }\n}\n\n// Based on section 6.1.1 of MicroType Express draft spec\nbool Read255UShort(Buffer* buf, unsigned int* value) {\n static const int kWordCode = 253;\n static const int kOneMoreByteCode2 = 254;\n static const int kOneMoreByteCode1 = 255;\n static const int kLowestUCode = 253;\n uint8_t code = 0;\n if (!buf->ReadU8(&code)) {\n return FONT_COMPRESSION_FAILURE();\n }\n if (code == kWordCode) {\n uint16_t result = 0;\n if (!buf->ReadU16(&result)) {\n return FONT_COMPRESSION_FAILURE();\n }\n *value = result;\n return true;\n } else if (code == kOneMoreByteCode1) {\n uint8_t result = 0;\n if (!buf->ReadU8(&result)) {\n return FONT_COMPRESSION_FAILURE();\n }\n *value = result + kLowestUCode;\n return true;\n } else if (code == kOneMoreByteCode2) {\n uint8_t result = 0;\n if (!buf->ReadU8(&result)) {\n return FONT_COMPRESSION_FAILURE();\n }\n *value = result + kLowestUCode * 2;\n return true;\n } else {\n *value = code;\n return true;\n }\n}\n\nbool ReadBase128(Buffer* buf, uint32_t* value) {\n uint32_t result = 0;\n for (size_t i = 0; i < 5; ++i) {\n uint8_t code = 0;\n if (!buf->ReadU8(&code)) {\n return FONT_COMPRESSION_FAILURE();\n }\n // Leading zeros are invalid.\n if (i == 0 && code == 0x80) {\n return FONT_COMPRESSION_FAILURE();\n }\n // If any of the top seven bits are set then we're about to overflow.\n if (result & 0xfe000000) {\n return FONT_COMPRESSION_FAILURE();\n }\n result = (result << 7) | (code & 0x7f);\n if ((code & 0x80) == 0) {\n *value = result;\n return true;\n }\n }\n // Make sure not to exceed the size bound\n return FONT_COMPRESSION_FAILURE();\n}\n\nsize_t Base128Size(size_t n) {\n size_t size = 1;\n for (; n >= 128; n >>= 7) ++size;\n return size;\n}\n\nvoid StoreBase128(size_t len, size_t* offset, uint8_t* dst) {\n size_t size = Base128Size(len);\n for (size_t i = 0; i < size; ++i) {\n int b = static_cast((len >> (7 * (size - i - 1))) & 0x7f);\n if (i < size - 1) {\n b |= 0x80;\n }\n dst[(*offset)++] = b;\n }\n}\n\n} // namespace woff2\n\n" }, { "path": "libs/woff2/src/variable_length.h", "content": "/* Copyright 2015 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Helper functions for woff2 variable length types: 255UInt16 and UIntBase128 */\n\n#ifndef WOFF2_VARIABLE_LENGTH_H_\n#define WOFF2_VARIABLE_LENGTH_H_\n\n#include \n#include \n#include \"./buffer.h\"\n\nnamespace woff2 {\n\nsize_t Size255UShort(uint16_t value);\nbool Read255UShort(Buffer* buf, unsigned int* value);\nvoid Write255UShort(std::vector* out, int value);\nvoid Store255UShort(int val, size_t* offset, uint8_t* dst);\n\nsize_t Base128Size(size_t n);\nbool ReadBase128(Buffer* buf, uint32_t* value);\nvoid StoreBase128(size_t len, size_t* offset, uint8_t* dst);\n\n} // namespace woff2\n\n#endif // WOFF2_VARIABLE_LENGTH_H_\n\n" }, { "path": "libs/woff2/src/woff2_common.cc", "content": "/* Copyright 2013 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Helpers common across multiple parts of woff2 */\n\n#include \n\n#include \"./woff2_common.h\"\n\n#include \"./port.h\"\n\nnamespace woff2 {\n\n\nuint32_t ComputeULongSum(const uint8_t* buf, size_t size) {\n uint32_t checksum = 0;\n size_t aligned_size = size & ~3;\n for (size_t i = 0; i < aligned_size; i += 4) {\n checksum +=\n (buf[i] << 24) | (buf[i + 1] << 16) | (buf[i + 2] << 8) | buf[i + 3];\n }\n\n // treat size not aligned on 4 as if it were padded to 4 with 0's\n if (size != aligned_size) {\n uint32_t v = 0;\n for (size_t i = aligned_size; i < size; ++i) {\n v |= buf[i] << (24 - 8 * (i & 3));\n }\n checksum += v;\n }\n\n return checksum;\n}\n\nsize_t CollectionHeaderSize(uint32_t header_version, uint32_t num_fonts) {\n size_t size = 0;\n if (header_version == 0x00020000) {\n size += 12; // ulDsig{Tag,Length,Offset}\n }\n if (header_version == 0x00010000 || header_version == 0x00020000) {\n size += 12 // TTCTag, Version, numFonts\n + 4 * num_fonts; // OffsetTable[numFonts]\n }\n return size;\n}\n\n} // namespace woff2\n" }, { "path": "libs/woff2/src/woff2_common.h", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Common definition for WOFF2 encoding/decoding */\n\n#ifndef WOFF2_WOFF2_COMMON_H_\n#define WOFF2_WOFF2_COMMON_H_\n\n#include \n#include \n\n#include \n\nnamespace woff2 {\n\nstatic const uint32_t kWoff2Signature = 0x774f4632; // \"wOF2\"\n\n// Leave the first byte open to store flag_byte\nconst unsigned int kWoff2FlagsTransform = 1 << 8;\n\n// TrueType Collection ID string: 'ttcf'\nstatic const uint32_t kTtcFontFlavor = 0x74746366;\n\nstatic const size_t kSfntHeaderSize = 12;\nstatic const size_t kSfntEntrySize = 16;\n\nstruct Point {\n int x;\n int y;\n bool on_curve;\n};\n\nstruct Table {\n uint32_t tag;\n uint32_t flags;\n uint32_t src_offset;\n uint32_t src_length;\n\n uint32_t transform_length;\n\n uint32_t dst_offset;\n uint32_t dst_length;\n const uint8_t* dst_data;\n\n bool operator<(const Table& other) const {\n return tag < other.tag;\n }\n};\n\n\n// Size of the collection header. 0 if version indicates this isn't a\n// collection. Ref http://www.microsoft.com/typography/otspec/otff.htm,\n// True Type Collections\nsize_t CollectionHeaderSize(uint32_t header_version, uint32_t num_fonts);\n\n// Compute checksum over size bytes of buf\nuint32_t ComputeULongSum(const uint8_t* buf, size_t size);\n\n} // namespace woff2\n\n#endif // WOFF2_WOFF2_COMMON_H_\n" }, { "path": "libs/woff2/src/woff2_enc.cc", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Library for converting TTF format font files to their WOFF2 versions. */\n\n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \"./buffer.h\"\n#include \"./font.h\"\n#include \"./normalize.h\"\n#include \"./round.h\"\n#include \"./store_bytes.h\"\n#include \"./table_tags.h\"\n#include \"./transform.h\"\n#include \"./variable_length.h\"\n#include \"./woff2_common.h\"\n\nnamespace woff2 {\n\n\nnamespace {\n\nconst size_t kWoff2HeaderSize = 48;\nconst size_t kWoff2EntrySize = 20;\n\nbool Compress(const uint8_t* data, const size_t len, uint8_t* result,\n uint32_t* result_len, BrotliEncoderMode mode, int quality) {\n size_t compressed_len = *result_len;\n if (BrotliEncoderCompress(quality, BROTLI_DEFAULT_WINDOW, mode, len, data,\n &compressed_len, result) == 0) {\n return false;\n }\n *result_len = compressed_len;\n return true;\n}\n\nbool Woff2Compress(const uint8_t* data, const size_t len,\n uint8_t* result, uint32_t* result_len,\n int quality) {\n return Compress(data, len, result, result_len,\n BROTLI_MODE_FONT, quality);\n}\n\nbool TextCompress(const uint8_t* data, const size_t len,\n uint8_t* result, uint32_t* result_len,\n int quality) {\n return Compress(data, len, result, result_len,\n BROTLI_MODE_TEXT, quality);\n}\n\nint KnownTableIndex(uint32_t tag) {\n for (int i = 0; i < 63; ++i) {\n if (tag == kKnownTags[i]) return i;\n }\n return 63;\n}\n\nvoid StoreTableEntry(const Table& table, size_t* offset, uint8_t* dst) {\n uint8_t flag_byte = (table.flags & 0xC0) | KnownTableIndex(table.tag);\n dst[(*offset)++] = flag_byte;\n // The index here is treated as a set of flag bytes because\n // bits 6 and 7 of the byte are reserved for future use as flags.\n // 0x3f or 63 means an arbitrary table tag.\n if ((flag_byte & 0x3f) == 0x3f) {\n StoreU32(table.tag, offset, dst);\n }\n StoreBase128(table.src_length, offset, dst);\n if ((table.flags & kWoff2FlagsTransform) != 0) {\n StoreBase128(table.transform_length, offset, dst);\n }\n}\n\nsize_t TableEntrySize(const Table& table) {\n uint8_t flag_byte = KnownTableIndex(table.tag);\n size_t size = ((flag_byte & 0x3f) != 0x3f) ? 1 : 5;\n size += Base128Size(table.src_length);\n if ((table.flags & kWoff2FlagsTransform) != 0) {\n size += Base128Size(table.transform_length);\n }\n return size;\n}\n\nsize_t ComputeWoff2Length(const FontCollection& font_collection,\n const std::vector& tables,\n std::map, uint16_t>\n index_by_tag_offset,\n size_t compressed_data_length,\n size_t extended_metadata_length) {\n size_t size = kWoff2HeaderSize;\n\n for (const auto& table : tables) {\n size += TableEntrySize(table);\n }\n\n // for collections only, collection tables\n if (font_collection.flavor == kTtcFontFlavor) {\n size += 4; // UInt32 Version of TTC Header\n size += Size255UShort(font_collection.fonts.size()); // 255UInt16 numFonts\n\n size += 4 * font_collection.fonts.size(); // UInt32 flavor for each\n\n for (const auto& font : font_collection.fonts) {\n size += Size255UShort(font.tables.size()); // 255UInt16 numTables\n for (const auto& entry : font.tables) {\n const Font::Table& table = entry.second;\n // no collection entry for xform table\n if (table.tag & 0x80808080) continue;\n\n std::pair tag_offset(table.tag, table.offset);\n uint16_t table_index = index_by_tag_offset[tag_offset];\n size += Size255UShort(table_index); // 255UInt16 index entry\n }\n }\n }\n\n // compressed data\n size += compressed_data_length;\n size = Round4(size);\n\n size += extended_metadata_length;\n return size;\n}\n\nsize_t ComputeUncompressedLength(const Font& font) {\n // sfnt header + offset table\n size_t size = 12 + 16 * font.num_tables;\n for (const auto& entry : font.tables) {\n const Font::Table& table = entry.second;\n if (table.tag & 0x80808080) continue; // xform tables don't stay\n if (table.IsReused()) continue; // don't have to pay twice\n size += Round4(table.length);\n }\n return size;\n}\n\nsize_t ComputeUncompressedLength(const FontCollection& font_collection) {\n if (font_collection.flavor != kTtcFontFlavor) {\n return ComputeUncompressedLength(font_collection.fonts[0]);\n }\n size_t size = CollectionHeaderSize(font_collection.header_version,\n font_collection.fonts.size());\n for (const auto& font : font_collection.fonts) {\n size += ComputeUncompressedLength(font);\n }\n return size;\n}\n\nsize_t ComputeTotalTransformLength(const Font& font) {\n size_t total = 0;\n for (const auto& i : font.tables) {\n const Font::Table& table = i.second;\n if (table.IsReused()) {\n continue;\n }\n if (table.tag & 0x80808080 || !font.FindTable(table.tag ^ 0x80808080)) {\n // Count transformed tables and non-transformed tables that do not have\n // transformed versions.\n total += table.length;\n }\n }\n return total;\n}\n\n} // namespace\n\nsize_t MaxWOFF2CompressedSize(const uint8_t* data, size_t length) {\n return MaxWOFF2CompressedSize(data, length, \"\");\n}\n\nsize_t MaxWOFF2CompressedSize(const uint8_t* data, size_t length,\n const std::string& extended_metadata) {\n // Except for the header size, which is 32 bytes larger in woff2 format,\n // all other parts should be smaller (table header in short format,\n // transformations and compression). Just to be sure, we will give some\n // headroom anyway.\n return length + 1024 + extended_metadata.length();\n}\n\nuint32_t CompressedBufferSize(uint32_t original_size) {\n return 1.2 * original_size + 10240;\n}\n\nbool TransformFontCollection(FontCollection* font_collection) {\n for (auto& font : font_collection->fonts) {\n if (!TransformGlyfAndLocaTables(&font)) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"glyf/loca transformation failed.\\n\");\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n }\n\n return true;\n}\n\nbool ConvertTTFToWOFF2(const uint8_t *data, size_t length,\n uint8_t *result, size_t *result_length) {\n WOFF2Params params;\n return ConvertTTFToWOFF2(data, length, result, result_length,\n params);\n}\n\nbool ConvertTTFToWOFF2(const uint8_t *data, size_t length,\n uint8_t *result, size_t *result_length,\n const WOFF2Params& params) {\n FontCollection font_collection;\n if (!ReadFontCollection(data, length, &font_collection)) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Parsing of the input font failed.\\n\");\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n\n if (!NormalizeFontCollection(&font_collection)) {\n return FONT_COMPRESSION_FAILURE();\n }\n\n if (params.allow_transforms && !TransformFontCollection(&font_collection)) {\n return FONT_COMPRESSION_FAILURE();\n } else {\n // glyf/loca use 11 to flag \"not transformed\"\n for (auto& font : font_collection.fonts) {\n Font::Table* glyf_table = font.FindTable(kGlyfTableTag);\n Font::Table* loca_table = font.FindTable(kLocaTableTag);\n if (glyf_table) {\n glyf_table->flag_byte |= 0xc0;\n }\n if (loca_table) {\n loca_table->flag_byte |= 0xc0;\n }\n }\n }\n\n // Although the compressed size of each table in the final woff2 file won't\n // be larger than its transform_length, we have to allocate a large enough\n // buffer for the compressor, since the compressor can potentially increase\n // the size. If the compressor overflows this, it should return false and\n // then this function will also return false.\n\n size_t total_transform_length = 0;\n for (const auto& font : font_collection.fonts) {\n total_transform_length += ComputeTotalTransformLength(font);\n }\n size_t compression_buffer_size = CompressedBufferSize(total_transform_length);\n std::vector compression_buf(compression_buffer_size);\n uint32_t total_compressed_length = compression_buffer_size;\n\n // Collect all transformed data into one place in output order.\n std::vector transform_buf(total_transform_length);\n size_t transform_offset = 0;\n for (const auto& font : font_collection.fonts) {\n for (const auto tag : font.OutputOrderedTags()) {\n const Font::Table& original = font.tables.at(tag);\n if (original.IsReused()) continue;\n if (tag & 0x80808080) continue;\n const Font::Table* table_to_store = font.FindTable(tag ^ 0x80808080);\n if (table_to_store == NULL) table_to_store = &original;\n\n StoreBytes(table_to_store->data, table_to_store->length,\n &transform_offset, &transform_buf[0]);\n }\n }\n\n // Compress all transformed data in one stream.\n if (!Woff2Compress(transform_buf.data(), total_transform_length,\n &compression_buf[0],\n &total_compressed_length,\n params.brotli_quality)) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Compression of combined table failed.\\n\");\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Compressed %zu to %u.\\n\", total_transform_length,\n total_compressed_length);\n#endif\n\n // Compress the extended metadata\n // TODO(user): how does this apply to collections\n uint32_t compressed_metadata_buf_length =\n CompressedBufferSize(params.extended_metadata.length());\n std::vector compressed_metadata_buf(compressed_metadata_buf_length);\n\n if (params.extended_metadata.length() > 0) {\n if (!TextCompress((const uint8_t*)params.extended_metadata.data(),\n params.extended_metadata.length(),\n compressed_metadata_buf.data(),\n &compressed_metadata_buf_length,\n params.brotli_quality)) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Compression of extended metadata failed.\\n\");\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n } else {\n compressed_metadata_buf_length = 0;\n }\n\n std::vector
tables;\n std::map, uint16_t> index_by_tag_offset;\n\n for (const auto& font : font_collection.fonts) {\n\n for (const auto tag : font.OutputOrderedTags()) {\n const Font::Table& src_table = font.tables.at(tag);\n if (src_table.IsReused()) {\n continue;\n }\n\n std::pair tag_offset(src_table.tag, src_table.offset);\n if (index_by_tag_offset.find(tag_offset) == index_by_tag_offset.end()) {\n index_by_tag_offset[tag_offset] = tables.size();\n } else {\n return false;\n }\n\n Table table;\n table.tag = src_table.tag;\n table.flags = src_table.flag_byte;\n table.src_length = src_table.length;\n table.transform_length = src_table.length;\n const Font::Table* transformed_table =\n font.FindTable(src_table.tag ^ 0x80808080);\n if (transformed_table != NULL) {\n table.flags = transformed_table->flag_byte;\n table.flags |= kWoff2FlagsTransform;\n table.transform_length = transformed_table->length;\n }\n tables.push_back(table);\n }\n }\n\n size_t woff2_length = ComputeWoff2Length(font_collection, tables,\n index_by_tag_offset, total_compressed_length,\n compressed_metadata_buf_length);\n if (woff2_length > *result_length) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Result allocation was too small (%zd vs %zd bytes).\\n\",\n *result_length, woff2_length);\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n *result_length = woff2_length;\n\n size_t offset = 0;\n\n // start of woff2 header (http://www.w3.org/TR/WOFF2/#woff20Header)\n StoreU32(kWoff2Signature, &offset, result);\n if (font_collection.flavor != kTtcFontFlavor) {\n StoreU32(font_collection.fonts[0].flavor, &offset, result);\n } else {\n StoreU32(kTtcFontFlavor, &offset, result);\n }\n StoreU32(woff2_length, &offset, result);\n Store16(tables.size(), &offset, result);\n Store16(0, &offset, result); // reserved\n // totalSfntSize\n StoreU32(ComputeUncompressedLength(font_collection), &offset, result);\n StoreU32(total_compressed_length, &offset, result); // totalCompressedSize\n\n // Let's just all be v1.0\n Store16(1, &offset, result); // majorVersion\n Store16(0, &offset, result); // minorVersion\n if (compressed_metadata_buf_length > 0) {\n StoreU32(woff2_length - compressed_metadata_buf_length,\n &offset, result); // metaOffset\n StoreU32(compressed_metadata_buf_length, &offset, result); // metaLength\n StoreU32(params.extended_metadata.length(),\n &offset, result); // metaOrigLength\n } else {\n StoreU32(0, &offset, result); // metaOffset\n StoreU32(0, &offset, result); // metaLength\n StoreU32(0, &offset, result); // metaOrigLength\n }\n StoreU32(0, &offset, result); // privOffset\n StoreU32(0, &offset, result); // privLength\n // end of woff2 header\n\n // table directory (http://www.w3.org/TR/WOFF2/#table_dir_format)\n for (const auto& table : tables) {\n StoreTableEntry(table, &offset, result);\n }\n\n // for collections only, collection table directory\n if (font_collection.flavor == kTtcFontFlavor) {\n StoreU32(font_collection.header_version, &offset, result);\n Store255UShort(font_collection.fonts.size(), &offset, result);\n for (const Font& font : font_collection.fonts) {\n\n uint16_t num_tables = 0;\n for (const auto& entry : font.tables) {\n const Font::Table& table = entry.second;\n if (table.tag & 0x80808080) continue; // don't write xform tables\n num_tables++;\n }\n Store255UShort(num_tables, &offset, result);\n\n StoreU32(font.flavor, &offset, result);\n for (const auto& entry : font.tables) {\n const Font::Table& table = entry.second;\n if (table.tag & 0x80808080) continue; // don't write xform tables\n\n // for reused tables, only the original has an updated offset\n uint32_t table_offset =\n table.IsReused() ? table.reuse_of->offset : table.offset;\n std::pair tag_offset(table.tag, table_offset);\n if (index_by_tag_offset.find(tag_offset) == index_by_tag_offset.end()) {\n#ifdef FONT_COMPRESSION_BIN\nfprintf(stderr, \"Missing table index for offset 0x%08x\\n\",\n table_offset);\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n uint16_t index = index_by_tag_offset[tag_offset];\n Store255UShort(index, &offset, result);\n\n }\n\n }\n }\n\n // compressed data format (http://www.w3.org/TR/WOFF2/#table_format)\n\n StoreBytes(&compression_buf[0], total_compressed_length, &offset, result);\n offset = Round4(offset);\n\n StoreBytes(compressed_metadata_buf.data(), compressed_metadata_buf_length,\n &offset, result);\n\n if (*result_length != offset) {\n#ifdef FONT_COMPRESSION_BIN\n fprintf(stderr, \"Mismatch between computed and actual length \"\n \"(%zd vs %zd)\\n\", *result_length, offset);\n#endif\n return FONT_COMPRESSION_FAILURE();\n }\n return true;\n}\n\n} // namespace woff2\n" }, { "path": "libs/woff2/src/woff2_out.cc", "content": "/* Copyright 2014 Google Inc. All Rights Reserved.\n\n Distributed under MIT license.\n See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n*/\n\n/* Output buffer for WOFF2 decompression. */\n\n#include \n\nnamespace woff2 {\n\nWOFF2StringOut::WOFF2StringOut(std::string *buf)\n : buf_(buf), max_size_(kDefaultMaxSize), offset_(0) {}\n\nbool WOFF2StringOut::Write(const void *buf, size_t n) {\n return Write(buf, offset_, n);\n}\n\nbool WOFF2StringOut::Write(const void *buf, size_t offset, size_t n) {\n if (offset > max_size_ || n > max_size_ - offset) {\n return false;\n }\n if (offset == buf_->size()) {\n buf_->append(static_cast(buf), n);\n } else {\n if (offset + n > buf_->size()) {\n buf_->append(offset + n - buf_->size(), 0);\n }\n buf_->replace(offset, n, static_cast(buf), n);\n }\n offset_ = std::max(offset_, offset + n);\n\n return true;\n}\n\nvoid WOFF2StringOut::SetMaxSize(size_t max_size) {\n max_size_ = max_size;\n if (offset_ > max_size_) {\n offset_ = max_size_;\n }\n}\n\nWOFF2MemoryOut::WOFF2MemoryOut(uint8_t* buf, size_t buf_size)\n : buf_(buf),\n buf_size_(buf_size),\n offset_(0) {}\n\nbool WOFF2MemoryOut::Write(const void *buf, size_t n) {\n return Write(buf, offset_, n);\n}\n\nbool WOFF2MemoryOut::Write(const void *buf, size_t offset, size_t n) {\n if (offset > buf_size_ || n > buf_size_ - offset) {\n return false;\n }\n std::memcpy(buf_ + offset, buf, n);\n offset_ = std::max(offset_, offset + n);\n\n return true;\n}\n\n} // namespace woff2\n" }, { "path": "libs/xxHash/LICENSE", "content": "xxHash Library\nCopyright (c) 2012-2014, Yann Collet\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification,\nare permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\n list of conditions and the following disclaimer in the documentation and/or\n other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\nANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "libs/xxHash/Makefile.am", "content": "if !HAVE_XXHASH\nnoinst_LIBRARIES = libxxhash.a\n\nlibxxhash_a_SOURCES = xxhash.c xxhash.h xxh3.h\nAM_CXXFLAGS = -Wall\n\nxxhash.c: xxhash.h xxh3.h\n\nendif\n\nCLEANFILES = *.gcda *.gcno\n\n" }, { "path": "libs/xxHash/xxh3.h", "content": "/*\n * xxHash - Extremely Fast Hash algorithm\n * Development source file for `xxh3`\n * Copyright (C) 2019-2021 Yann Collet\n *\n * BSD 2-Clause License (https://www.opensource.org/licenses/bsd-license.php)\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * You can contact the author at:\n * - xxHash homepage: https://www.xxhash.com\n * - xxHash source repository: https://github.com/Cyan4973/xxHash\n */\n\n/*\n * Note: This file used to host the source code of XXH3_* variants.\n * during the development period.\n * The source code is now properly integrated within xxhash.h.\n *\n * xxh3.h is no longer useful,\n * but it is still provided for compatibility with source code\n * which used to include it directly.\n *\n * Programs are now highly discouraged to include xxh3.h.\n * Include `xxhash.h` instead, which is the officially supported interface.\n *\n * In the future, xxh3.h will start to generate warnings, then errors,\n * then it will be removed from source package and from include directory.\n */\n\n/* Simulate the same impact as including the old xxh3.h source file */\n\n#define XXH_INLINE_ALL\n#include \"xxhash.h\"\n" }, { "path": "libs/xxHash/xxhash.c", "content": "/*\n * xxHash - Extremely Fast Hash algorithm\n * Copyright (C) 2012-2023 Yann Collet\n *\n * BSD 2-Clause License (https://www.opensource.org/licenses/bsd-license.php)\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * You can contact the author at:\n * - xxHash homepage: https://www.xxhash.com\n * - xxHash source repository: https://github.com/Cyan4973/xxHash\n */\n\n/*\n * xxhash.c instantiates functions defined in xxhash.h\n */\n\n#define XXH_STATIC_LINKING_ONLY /* access advanced declarations */\n#define XXH_IMPLEMENTATION /* access definitions */\n\n#include \"xxhash.h\"\n" }, { "path": "libs/xxHash/xxhash.h", "content": "/*\n * xxHash - Extremely Fast Hash algorithm\n * Header File\n * Copyright (C) 2012-2023 Yann Collet\n *\n * BSD 2-Clause License (https://www.opensource.org/licenses/bsd-license.php)\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * You can contact the author at:\n * - xxHash homepage: https://www.xxhash.com\n * - xxHash source repository: https://github.com/Cyan4973/xxHash\n */\n\n/*!\n * @mainpage xxHash\n *\n * xxHash is an extremely fast non-cryptographic hash algorithm, working at RAM speed\n * limits.\n *\n * It is proposed in four flavors, in three families:\n * 1. @ref XXH32_family\n * - Classic 32-bit hash function. Simple, compact, and runs on almost all\n * 32-bit and 64-bit systems.\n * 2. @ref XXH64_family\n * - Classic 64-bit adaptation of XXH32. Just as simple, and runs well on most\n * 64-bit systems (but _not_ 32-bit systems).\n * 3. @ref XXH3_family\n * - Modern 64-bit and 128-bit hash function family which features improved\n * strength and performance across the board, especially on smaller data.\n * It benefits greatly from SIMD and 64-bit without requiring it.\n *\n * Benchmarks\n * ---\n * The reference system uses an Intel i7-9700K CPU, and runs Ubuntu x64 20.04.\n * The open source benchmark program is compiled with clang v10.0 using -O3 flag.\n *\n * | Hash Name | ISA ext | Width | Large Data Speed | Small Data Velocity |\n * | -------------------- | ------- | ----: | ---------------: | ------------------: |\n * | XXH3_64bits() | @b AVX2 | 64 | 59.4 GB/s | 133.1 |\n * | MeowHash | AES-NI | 128 | 58.2 GB/s | 52.5 |\n * | XXH3_128bits() | @b AVX2 | 128 | 57.9 GB/s | 118.1 |\n * | CLHash | PCLMUL | 64 | 37.1 GB/s | 58.1 |\n * | XXH3_64bits() | @b SSE2 | 64 | 31.5 GB/s | 133.1 |\n * | XXH3_128bits() | @b SSE2 | 128 | 29.6 GB/s | 118.1 |\n * | RAM sequential read | | N/A | 28.0 GB/s | N/A |\n * | ahash | AES-NI | 64 | 22.5 GB/s | 107.2 |\n * | City64 | | 64 | 22.0 GB/s | 76.6 |\n * | T1ha2 | | 64 | 22.0 GB/s | 99.0 |\n * | City128 | | 128 | 21.7 GB/s | 57.7 |\n * | FarmHash | AES-NI | 64 | 21.3 GB/s | 71.9 |\n * | XXH64() | | 64 | 19.4 GB/s | 71.0 |\n * | SpookyHash | | 64 | 19.3 GB/s | 53.2 |\n * | Mum | | 64 | 18.0 GB/s | 67.0 |\n * | CRC32C | SSE4.2 | 32 | 13.0 GB/s | 57.9 |\n * | XXH32() | | 32 | 9.7 GB/s | 71.9 |\n * | City32 | | 32 | 9.1 GB/s | 66.0 |\n * | Blake3* | @b AVX2 | 256 | 4.4 GB/s | 8.1 |\n * | Murmur3 | | 32 | 3.9 GB/s | 56.1 |\n * | SipHash* | | 64 | 3.0 GB/s | 43.2 |\n * | Blake3* | @b SSE2 | 256 | 2.4 GB/s | 8.1 |\n * | HighwayHash | | 64 | 1.4 GB/s | 6.0 |\n * | FNV64 | | 64 | 1.2 GB/s | 62.7 |\n * | Blake2* | | 256 | 1.1 GB/s | 5.1 |\n * | SHA1* | | 160 | 0.8 GB/s | 5.6 |\n * | MD5* | | 128 | 0.6 GB/s | 7.8 |\n * @note\n * - Hashes which require a specific ISA extension are noted. SSE2 is also noted,\n * even though it is mandatory on x64.\n * - Hashes with an asterisk are cryptographic. Note that MD5 is non-cryptographic\n * by modern standards.\n * - Small data velocity is a rough average of algorithm's efficiency for small\n * data. For more accurate information, see the wiki.\n * - More benchmarks and strength tests are found on the wiki:\n * https://github.com/Cyan4973/xxHash/wiki\n *\n * Usage\n * ------\n * All xxHash variants use a similar API. Changing the algorithm is a trivial\n * substitution.\n *\n * @pre\n * For functions which take an input and length parameter, the following\n * requirements are assumed:\n * - The range from [`input`, `input + length`) is valid, readable memory.\n * - The only exception is if the `length` is `0`, `input` may be `NULL`.\n * - For C++, the objects must have the *TriviallyCopyable* property, as the\n * functions access bytes directly as if it was an array of `unsigned char`.\n *\n * @anchor single_shot_example\n * **Single Shot**\n *\n * These functions are stateless functions which hash a contiguous block of memory,\n * immediately returning the result. They are the easiest and usually the fastest\n * option.\n *\n * XXH32(), XXH64(), XXH3_64bits(), XXH3_128bits()\n *\n * @code{.c}\n * #include \n * #include \"xxhash.h\"\n *\n * // Example for a function which hashes a null terminated string with XXH32().\n * XXH32_hash_t hash_string(const char* string, XXH32_hash_t seed)\n * {\n * // NULL pointers are only valid if the length is zero\n * size_t length = (string == NULL) ? 0 : strlen(string);\n * return XXH32(string, length, seed);\n * }\n * @endcode\n *\n *\n * @anchor streaming_example\n * **Streaming**\n *\n * These groups of functions allow incremental hashing of unknown size, even\n * more than what would fit in a size_t.\n *\n * XXH32_reset(), XXH64_reset(), XXH3_64bits_reset(), XXH3_128bits_reset()\n *\n * @code{.c}\n * #include \n * #include \n * #include \"xxhash.h\"\n * // Example for a function which hashes a FILE incrementally with XXH3_64bits().\n * XXH64_hash_t hashFile(FILE* f)\n * {\n * // Allocate a state struct. Do not just use malloc() or new.\n * XXH3_state_t* state = XXH3_createState();\n * assert(state != NULL && \"Out of memory!\");\n * // Reset the state to start a new hashing session.\n * XXH3_64bits_reset(state);\n * char buffer[4096];\n * size_t count;\n * // Read the file in chunks\n * while ((count = fread(buffer, 1, sizeof(buffer), f)) != 0) {\n * // Run update() as many times as necessary to process the data\n * XXH3_64bits_update(state, buffer, count);\n * }\n * // Retrieve the finalized hash. This will not change the state.\n * XXH64_hash_t result = XXH3_64bits_digest(state);\n * // Free the state. Do not use free().\n * XXH3_freeState(state);\n * return result;\n * }\n * @endcode\n *\n * Streaming functions generate the xxHash value from an incremental input.\n * This method is slower than single-call functions, due to state management.\n * For small inputs, prefer `XXH32()` and `XXH64()`, which are better optimized.\n *\n * An XXH state must first be allocated using `XXH*_createState()`.\n *\n * Start a new hash by initializing the state with a seed using `XXH*_reset()`.\n *\n * Then, feed the hash state by calling `XXH*_update()` as many times as necessary.\n *\n * The function returns an error code, with 0 meaning OK, and any other value\n * meaning there is an error.\n *\n * Finally, a hash value can be produced anytime, by using `XXH*_digest()`.\n * This function returns the nn-bits hash as an int or long long.\n *\n * It's still possible to continue inserting input into the hash state after a\n * digest, and generate new hash values later on by invoking `XXH*_digest()`.\n *\n * When done, release the state using `XXH*_freeState()`.\n *\n *\n * @anchor canonical_representation_example\n * **Canonical Representation**\n *\n * The default return values from XXH functions are unsigned 32, 64 and 128 bit\n * integers.\n * This the simplest and fastest format for further post-processing.\n *\n * However, this leaves open the question of what is the order on the byte level,\n * since little and big endian conventions will store the same number differently.\n *\n * The canonical representation settles this issue by mandating big-endian\n * convention, the same convention as human-readable numbers (large digits first).\n *\n * When writing hash values to storage, sending them over a network, or printing\n * them, it's highly recommended to use the canonical representation to ensure\n * portability across a wider range of systems, present and future.\n *\n * The following functions allow transformation of hash values to and from\n * canonical format.\n *\n * XXH32_canonicalFromHash(), XXH32_hashFromCanonical(),\n * XXH64_canonicalFromHash(), XXH64_hashFromCanonical(),\n * XXH128_canonicalFromHash(), XXH128_hashFromCanonical(),\n *\n * @code{.c}\n * #include \n * #include \"xxhash.h\"\n *\n * // Example for a function which prints XXH32_hash_t in human readable format\n * void printXxh32(XXH32_hash_t hash)\n * {\n * XXH32_canonical_t cano;\n * XXH32_canonicalFromHash(&cano, hash);\n * size_t i;\n * for(i = 0; i < sizeof(cano.digest); ++i) {\n * printf(\"%02x\", cano.digest[i]);\n * }\n * printf(\"\\n\");\n * }\n *\n * // Example for a function which converts XXH32_canonical_t to XXH32_hash_t\n * XXH32_hash_t convertCanonicalToXxh32(XXH32_canonical_t cano)\n * {\n * XXH32_hash_t hash = XXH32_hashFromCanonical(&cano);\n * return hash;\n * }\n * @endcode\n *\n *\n * @file xxhash.h\n * xxHash prototypes and implementation\n */\n\n#if defined (__cplusplus)\nextern \"C\" {\n#endif\n\n/* ****************************\n * INLINE mode\n ******************************/\n/*!\n * @defgroup public Public API\n * Contains details on the public xxHash functions.\n * @{\n */\n#ifdef XXH_DOXYGEN\n/*!\n * @brief Gives access to internal state declaration, required for static allocation.\n *\n * Incompatible with dynamic linking, due to risks of ABI changes.\n *\n * Usage:\n * @code{.c}\n * #define XXH_STATIC_LINKING_ONLY\n * #include \"xxhash.h\"\n * @endcode\n */\n# define XXH_STATIC_LINKING_ONLY\n/* Do not undef XXH_STATIC_LINKING_ONLY for Doxygen */\n\n/*!\n * @brief Gives access to internal definitions.\n *\n * Usage:\n * @code{.c}\n * #define XXH_STATIC_LINKING_ONLY\n * #define XXH_IMPLEMENTATION\n * #include \"xxhash.h\"\n * @endcode\n */\n# define XXH_IMPLEMENTATION\n/* Do not undef XXH_IMPLEMENTATION for Doxygen */\n\n/*!\n * @brief Exposes the implementation and marks all functions as `inline`.\n *\n * Use these build macros to inline xxhash into the target unit.\n * Inlining improves performance on small inputs, especially when the length is\n * expressed as a compile-time constant:\n *\n * https://fastcompression.blogspot.com/2018/03/xxhash-for-small-keys-impressive-power.html\n *\n * It also keeps xxHash symbols private to the unit, so they are not exported.\n *\n * Usage:\n * @code{.c}\n * #define XXH_INLINE_ALL\n * #include \"xxhash.h\"\n * @endcode\n * Do not compile and link xxhash.o as a separate object, as it is not useful.\n */\n# define XXH_INLINE_ALL\n# undef XXH_INLINE_ALL\n/*!\n * @brief Exposes the implementation without marking functions as inline.\n */\n# define XXH_PRIVATE_API\n# undef XXH_PRIVATE_API\n/*!\n * @brief Emulate a namespace by transparently prefixing all symbols.\n *\n * If you want to include _and expose_ xxHash functions from within your own\n * library, but also want to avoid symbol collisions with other libraries which\n * may also include xxHash, you can use @ref XXH_NAMESPACE to automatically prefix\n * any public symbol from xxhash library with the value of @ref XXH_NAMESPACE\n * (therefore, avoid empty or numeric values).\n *\n * Note that no change is required within the calling program as long as it\n * includes `xxhash.h`: Regular symbol names will be automatically translated\n * by this header.\n */\n# define XXH_NAMESPACE /* YOUR NAME HERE */\n# undef XXH_NAMESPACE\n#endif\n\n#if (defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API)) \\\n && !defined(XXH_INLINE_ALL_31684351384)\n /* this section should be traversed only once */\n# define XXH_INLINE_ALL_31684351384\n /* give access to the advanced API, required to compile implementations */\n# undef XXH_STATIC_LINKING_ONLY /* avoid macro redef */\n# define XXH_STATIC_LINKING_ONLY\n /* make all functions private */\n# undef XXH_PUBLIC_API\n# if defined(__GNUC__)\n# define XXH_PUBLIC_API static __inline __attribute__((__unused__))\n# elif defined (__cplusplus) || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */)\n# define XXH_PUBLIC_API static inline\n# elif defined(_MSC_VER)\n# define XXH_PUBLIC_API static __inline\n# else\n /* note: this version may generate warnings for unused static functions */\n# define XXH_PUBLIC_API static\n# endif\n\n /*\n * This part deals with the special case where a unit wants to inline xxHash,\n * but \"xxhash.h\" has previously been included without XXH_INLINE_ALL,\n * such as part of some previously included *.h header file.\n * Without further action, the new include would just be ignored,\n * and functions would effectively _not_ be inlined (silent failure).\n * The following macros solve this situation by prefixing all inlined names,\n * avoiding naming collision with previous inclusions.\n */\n /* Before that, we unconditionally #undef all symbols,\n * in case they were already defined with XXH_NAMESPACE.\n * They will then be redefined for XXH_INLINE_ALL\n */\n# undef XXH_versionNumber\n /* XXH32 */\n# undef XXH32\n# undef XXH32_createState\n# undef XXH32_freeState\n# undef XXH32_reset\n# undef XXH32_update\n# undef XXH32_digest\n# undef XXH32_copyState\n# undef XXH32_canonicalFromHash\n# undef XXH32_hashFromCanonical\n /* XXH64 */\n# undef XXH64\n# undef XXH64_createState\n# undef XXH64_freeState\n# undef XXH64_reset\n# undef XXH64_update\n# undef XXH64_digest\n# undef XXH64_copyState\n# undef XXH64_canonicalFromHash\n# undef XXH64_hashFromCanonical\n /* XXH3_64bits */\n# undef XXH3_64bits\n# undef XXH3_64bits_withSecret\n# undef XXH3_64bits_withSeed\n# undef XXH3_64bits_withSecretandSeed\n# undef XXH3_createState\n# undef XXH3_freeState\n# undef XXH3_copyState\n# undef XXH3_64bits_reset\n# undef XXH3_64bits_reset_withSeed\n# undef XXH3_64bits_reset_withSecret\n# undef XXH3_64bits_update\n# undef XXH3_64bits_digest\n# undef XXH3_generateSecret\n /* XXH3_128bits */\n# undef XXH128\n# undef XXH3_128bits\n# undef XXH3_128bits_withSeed\n# undef XXH3_128bits_withSecret\n# undef XXH3_128bits_reset\n# undef XXH3_128bits_reset_withSeed\n# undef XXH3_128bits_reset_withSecret\n# undef XXH3_128bits_reset_withSecretandSeed\n# undef XXH3_128bits_update\n# undef XXH3_128bits_digest\n# undef XXH128_isEqual\n# undef XXH128_cmp\n# undef XXH128_canonicalFromHash\n# undef XXH128_hashFromCanonical\n /* Finally, free the namespace itself */\n# undef XXH_NAMESPACE\n\n /* employ the namespace for XXH_INLINE_ALL */\n# define XXH_NAMESPACE XXH_INLINE_\n /*\n * Some identifiers (enums, type names) are not symbols,\n * but they must nonetheless be renamed to avoid redeclaration.\n * Alternative solution: do not redeclare them.\n * However, this requires some #ifdefs, and has a more dispersed impact.\n * Meanwhile, renaming can be achieved in a single place.\n */\n# define XXH_IPREF(Id) XXH_NAMESPACE ## Id\n# define XXH_OK XXH_IPREF(XXH_OK)\n# define XXH_ERROR XXH_IPREF(XXH_ERROR)\n# define XXH_errorcode XXH_IPREF(XXH_errorcode)\n# define XXH32_canonical_t XXH_IPREF(XXH32_canonical_t)\n# define XXH64_canonical_t XXH_IPREF(XXH64_canonical_t)\n# define XXH128_canonical_t XXH_IPREF(XXH128_canonical_t)\n# define XXH32_state_s XXH_IPREF(XXH32_state_s)\n# define XXH32_state_t XXH_IPREF(XXH32_state_t)\n# define XXH64_state_s XXH_IPREF(XXH64_state_s)\n# define XXH64_state_t XXH_IPREF(XXH64_state_t)\n# define XXH3_state_s XXH_IPREF(XXH3_state_s)\n# define XXH3_state_t XXH_IPREF(XXH3_state_t)\n# define XXH128_hash_t XXH_IPREF(XXH128_hash_t)\n /* Ensure the header is parsed again, even if it was previously included */\n# undef XXHASH_H_5627135585666179\n# undef XXHASH_H_STATIC_13879238742\n#endif /* XXH_INLINE_ALL || XXH_PRIVATE_API */\n\n/* ****************************************************************\n * Stable API\n *****************************************************************/\n#ifndef XXHASH_H_5627135585666179\n#define XXHASH_H_5627135585666179 1\n\n/*! @brief Marks a global symbol. */\n#if !defined(XXH_INLINE_ALL) && !defined(XXH_PRIVATE_API)\n# if defined(_WIN32) && defined(_MSC_VER) && (defined(XXH_IMPORT) || defined(XXH_EXPORT))\n# ifdef XXH_EXPORT\n# define XXH_PUBLIC_API __declspec(dllexport)\n# elif XXH_IMPORT\n# define XXH_PUBLIC_API __declspec(dllimport)\n# endif\n# else\n# define XXH_PUBLIC_API /* do nothing */\n# endif\n#endif\n\n#ifdef XXH_NAMESPACE\n# define XXH_CAT(A,B) A##B\n# define XXH_NAME2(A,B) XXH_CAT(A,B)\n# define XXH_versionNumber XXH_NAME2(XXH_NAMESPACE, XXH_versionNumber)\n/* XXH32 */\n# define XXH32 XXH_NAME2(XXH_NAMESPACE, XXH32)\n# define XXH32_createState XXH_NAME2(XXH_NAMESPACE, XXH32_createState)\n# define XXH32_freeState XXH_NAME2(XXH_NAMESPACE, XXH32_freeState)\n# define XXH32_reset XXH_NAME2(XXH_NAMESPACE, XXH32_reset)\n# define XXH32_update XXH_NAME2(XXH_NAMESPACE, XXH32_update)\n# define XXH32_digest XXH_NAME2(XXH_NAMESPACE, XXH32_digest)\n# define XXH32_copyState XXH_NAME2(XXH_NAMESPACE, XXH32_copyState)\n# define XXH32_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH32_canonicalFromHash)\n# define XXH32_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH32_hashFromCanonical)\n/* XXH64 */\n# define XXH64 XXH_NAME2(XXH_NAMESPACE, XXH64)\n# define XXH64_createState XXH_NAME2(XXH_NAMESPACE, XXH64_createState)\n# define XXH64_freeState XXH_NAME2(XXH_NAMESPACE, XXH64_freeState)\n# define XXH64_reset XXH_NAME2(XXH_NAMESPACE, XXH64_reset)\n# define XXH64_update XXH_NAME2(XXH_NAMESPACE, XXH64_update)\n# define XXH64_digest XXH_NAME2(XXH_NAMESPACE, XXH64_digest)\n# define XXH64_copyState XXH_NAME2(XXH_NAMESPACE, XXH64_copyState)\n# define XXH64_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH64_canonicalFromHash)\n# define XXH64_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH64_hashFromCanonical)\n/* XXH3_64bits */\n# define XXH3_64bits XXH_NAME2(XXH_NAMESPACE, XXH3_64bits)\n# define XXH3_64bits_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_withSecret)\n# define XXH3_64bits_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_withSeed)\n# define XXH3_64bits_withSecretandSeed XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_withSecretandSeed)\n# define XXH3_createState XXH_NAME2(XXH_NAMESPACE, XXH3_createState)\n# define XXH3_freeState XXH_NAME2(XXH_NAMESPACE, XXH3_freeState)\n# define XXH3_copyState XXH_NAME2(XXH_NAMESPACE, XXH3_copyState)\n# define XXH3_64bits_reset XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_reset)\n# define XXH3_64bits_reset_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_reset_withSeed)\n# define XXH3_64bits_reset_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_reset_withSecret)\n# define XXH3_64bits_reset_withSecretandSeed XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_reset_withSecretandSeed)\n# define XXH3_64bits_update XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_update)\n# define XXH3_64bits_digest XXH_NAME2(XXH_NAMESPACE, XXH3_64bits_digest)\n# define XXH3_generateSecret XXH_NAME2(XXH_NAMESPACE, XXH3_generateSecret)\n# define XXH3_generateSecret_fromSeed XXH_NAME2(XXH_NAMESPACE, XXH3_generateSecret_fromSeed)\n/* XXH3_128bits */\n# define XXH128 XXH_NAME2(XXH_NAMESPACE, XXH128)\n# define XXH3_128bits XXH_NAME2(XXH_NAMESPACE, XXH3_128bits)\n# define XXH3_128bits_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_withSeed)\n# define XXH3_128bits_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_withSecret)\n# define XXH3_128bits_withSecretandSeed XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_withSecretandSeed)\n# define XXH3_128bits_reset XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_reset)\n# define XXH3_128bits_reset_withSeed XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_reset_withSeed)\n# define XXH3_128bits_reset_withSecret XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_reset_withSecret)\n# define XXH3_128bits_reset_withSecretandSeed XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_reset_withSecretandSeed)\n# define XXH3_128bits_update XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_update)\n# define XXH3_128bits_digest XXH_NAME2(XXH_NAMESPACE, XXH3_128bits_digest)\n# define XXH128_isEqual XXH_NAME2(XXH_NAMESPACE, XXH128_isEqual)\n# define XXH128_cmp XXH_NAME2(XXH_NAMESPACE, XXH128_cmp)\n# define XXH128_canonicalFromHash XXH_NAME2(XXH_NAMESPACE, XXH128_canonicalFromHash)\n# define XXH128_hashFromCanonical XXH_NAME2(XXH_NAMESPACE, XXH128_hashFromCanonical)\n#endif\n\n\n/* *************************************\n* Compiler specifics\n***************************************/\n\n/* specific declaration modes for Windows */\n#if !defined(XXH_INLINE_ALL) && !defined(XXH_PRIVATE_API)\n# if defined(_WIN32) && defined(_MSC_VER) && (defined(XXH_IMPORT) || defined(XXH_EXPORT))\n# ifdef XXH_EXPORT\n# define XXH_PUBLIC_API __declspec(dllexport)\n# elif XXH_IMPORT\n# define XXH_PUBLIC_API __declspec(dllimport)\n# endif\n# else\n# define XXH_PUBLIC_API /* do nothing */\n# endif\n#endif\n\n#if defined (__GNUC__)\n# define XXH_CONSTF __attribute__((__const__))\n# define XXH_PUREF __attribute__((__pure__))\n# define XXH_MALLOCF __attribute__((__malloc__))\n#else\n# define XXH_CONSTF /* disable */\n# define XXH_PUREF\n# define XXH_MALLOCF\n#endif\n\n/* *************************************\n* Version\n***************************************/\n#define XXH_VERSION_MAJOR 0\n#define XXH_VERSION_MINOR 8\n#define XXH_VERSION_RELEASE 3\n/*! @brief Version number, encoded as two digits each */\n#define XXH_VERSION_NUMBER (XXH_VERSION_MAJOR *100*100 + XXH_VERSION_MINOR *100 + XXH_VERSION_RELEASE)\n\n/*!\n * @brief Obtains the xxHash version.\n *\n * This is mostly useful when xxHash is compiled as a shared library,\n * since the returned value comes from the library, as opposed to header file.\n *\n * @return @ref XXH_VERSION_NUMBER of the invoked library.\n */\nXXH_PUBLIC_API XXH_CONSTF unsigned XXH_versionNumber (void);\n\n\n/* ****************************\n* Common basic types\n******************************/\n#include /* size_t */\n/*!\n * @brief Exit code for the streaming API.\n */\ntypedef enum {\n XXH_OK = 0, /*!< OK */\n XXH_ERROR /*!< Error */\n} XXH_errorcode;\n\n\n/*-**********************************************************************\n* 32-bit hash\n************************************************************************/\n#if defined(XXH_DOXYGEN) /* Don't show include */\n/*!\n * @brief An unsigned 32-bit integer.\n *\n * Not necessarily defined to `uint32_t` but functionally equivalent.\n */\ntypedef uint32_t XXH32_hash_t;\n\n#elif !defined (__VMS) \\\n && (defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n# ifdef _AIX\n# include \n# else\n# include \n# endif\n typedef uint32_t XXH32_hash_t;\n\n#else\n# include \n# if UINT_MAX == 0xFFFFFFFFUL\n typedef unsigned int XXH32_hash_t;\n# elif ULONG_MAX == 0xFFFFFFFFUL\n typedef unsigned long XXH32_hash_t;\n# else\n# error \"unsupported platform: need a 32-bit type\"\n# endif\n#endif\n\n/*!\n * @}\n *\n * @defgroup XXH32_family XXH32 family\n * @ingroup public\n * Contains functions used in the classic 32-bit xxHash algorithm.\n *\n * @note\n * XXH32 is useful for older platforms, with no or poor 64-bit performance.\n * Note that the @ref XXH3_family provides competitive speed for both 32-bit\n * and 64-bit systems, and offers true 64/128 bit hash results.\n *\n * @see @ref XXH64_family, @ref XXH3_family : Other xxHash families\n * @see @ref XXH32_impl for implementation details\n * @{\n */\n\n/*!\n * @brief Calculates the 32-bit hash of @p input using xxHash32.\n *\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n * @param seed The 32-bit seed to alter the hash's output predictably.\n *\n * @pre\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return The calculated 32-bit xxHash32 value.\n *\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH32_hash_t XXH32 (const void* input, size_t length, XXH32_hash_t seed);\n\n#ifndef XXH_NO_STREAM\n/*!\n * @typedef struct XXH32_state_s XXH32_state_t\n * @brief The opaque state struct for the XXH32 streaming API.\n *\n * @see XXH32_state_s for details.\n * @see @ref streaming_example \"Streaming Example\"\n */\ntypedef struct XXH32_state_s XXH32_state_t;\n\n/*!\n * @brief Allocates an @ref XXH32_state_t.\n *\n * @return An allocated pointer of @ref XXH32_state_t on success.\n * @return `NULL` on failure.\n *\n * @note Must be freed with XXH32_freeState().\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_MALLOCF XXH32_state_t* XXH32_createState(void);\n/*!\n * @brief Frees an @ref XXH32_state_t.\n *\n * @param statePtr A pointer to an @ref XXH32_state_t allocated with @ref XXH32_createState().\n *\n * @return @ref XXH_OK.\n *\n * @note @p statePtr must be allocated with XXH32_createState().\n *\n * @see @ref streaming_example \"Streaming Example\"\n *\n */\nXXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr);\n/*!\n * @brief Copies one @ref XXH32_state_t to another.\n *\n * @param dst_state The state to copy to.\n * @param src_state The state to copy from.\n * @pre\n * @p dst_state and @p src_state must not be `NULL` and must not overlap.\n */\nXXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* dst_state, const XXH32_state_t* src_state);\n\n/*!\n * @brief Resets an @ref XXH32_state_t to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n * @param seed The 32-bit seed to alter the hash result predictably.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note This function resets and seeds a state. Call it before @ref XXH32_update().\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH32_reset (XXH32_state_t* statePtr, XXH32_hash_t seed);\n\n/*!\n * @brief Consumes a block of @p input to an @ref XXH32_state_t.\n *\n * @param statePtr The state struct to update.\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n * @pre\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note Call this to incrementally consume blocks of data.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH32_update (XXH32_state_t* statePtr, const void* input, size_t length);\n\n/*!\n * @brief Returns the calculated hash value from an @ref XXH32_state_t.\n *\n * @param statePtr The state struct to calculate the hash from.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return The calculated 32-bit xxHash32 value from that state.\n *\n * @note\n * Calling XXH32_digest() will not affect @p statePtr, so you can update,\n * digest, and update again.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_PUREF XXH32_hash_t XXH32_digest (const XXH32_state_t* statePtr);\n#endif /* !XXH_NO_STREAM */\n\n/******* Canonical representation *******/\n\n/*!\n * @brief Canonical (big endian) representation of @ref XXH32_hash_t.\n */\ntypedef struct {\n unsigned char digest[4]; /*!< Hash bytes, big endian */\n} XXH32_canonical_t;\n\n/*!\n * @brief Converts an @ref XXH32_hash_t to a big endian @ref XXH32_canonical_t.\n *\n * @param dst The @ref XXH32_canonical_t pointer to be stored to.\n * @param hash The @ref XXH32_hash_t to be converted.\n *\n * @pre\n * @p dst must not be `NULL`.\n *\n * @see @ref canonical_representation_example \"Canonical Representation Example\"\n */\nXXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash);\n\n/*!\n * @brief Converts an @ref XXH32_canonical_t to a native @ref XXH32_hash_t.\n *\n * @param src The @ref XXH32_canonical_t to convert.\n *\n * @pre\n * @p src must not be `NULL`.\n *\n * @return The converted hash.\n *\n * @see @ref canonical_representation_example \"Canonical Representation Example\"\n */\nXXH_PUBLIC_API XXH_PUREF XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src);\n\n\n/*! @cond Doxygen ignores this part */\n#ifdef __has_attribute\n# define XXH_HAS_ATTRIBUTE(x) __has_attribute(x)\n#else\n# define XXH_HAS_ATTRIBUTE(x) 0\n#endif\n/*! @endcond */\n\n/*! @cond Doxygen ignores this part */\n/*\n * C23 __STDC_VERSION__ number hasn't been specified yet. For now\n * leave as `201711L` (C17 + 1).\n * TODO: Update to correct value when its been specified.\n */\n#define XXH_C23_VN 201711L\n/*! @endcond */\n\n/*! @cond Doxygen ignores this part */\n/* C-language Attributes are added in C23. */\n#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= XXH_C23_VN) && defined(__has_c_attribute)\n# define XXH_HAS_C_ATTRIBUTE(x) __has_c_attribute(x)\n#else\n# define XXH_HAS_C_ATTRIBUTE(x) 0\n#endif\n/*! @endcond */\n\n/*! @cond Doxygen ignores this part */\n#if defined(__cplusplus) && defined(__has_cpp_attribute)\n# define XXH_HAS_CPP_ATTRIBUTE(x) __has_cpp_attribute(x)\n#else\n# define XXH_HAS_CPP_ATTRIBUTE(x) 0\n#endif\n/*! @endcond */\n\n/*! @cond Doxygen ignores this part */\n/*\n * Define XXH_FALLTHROUGH macro for annotating switch case with the 'fallthrough' attribute\n * introduced in CPP17 and C23.\n * CPP17 : https://en.cppreference.com/w/cpp/language/attributes/fallthrough\n * C23 : https://en.cppreference.com/w/c/language/attributes/fallthrough\n */\n#if XXH_HAS_C_ATTRIBUTE(fallthrough) || XXH_HAS_CPP_ATTRIBUTE(fallthrough)\n# define XXH_FALLTHROUGH [[fallthrough]]\n#elif XXH_HAS_ATTRIBUTE(__fallthrough__)\n# define XXH_FALLTHROUGH __attribute__ ((__fallthrough__))\n#else\n# define XXH_FALLTHROUGH /* fallthrough */\n#endif\n/*! @endcond */\n\n/*! @cond Doxygen ignores this part */\n/*\n * Define XXH_NOESCAPE for annotated pointers in public API.\n * https://clang.llvm.org/docs/AttributeReference.html#noescape\n * As of writing this, only supported by clang.\n */\n#if XXH_HAS_ATTRIBUTE(noescape)\n# define XXH_NOESCAPE __attribute__((__noescape__))\n#else\n# define XXH_NOESCAPE\n#endif\n/*! @endcond */\n\n\n/*!\n * @}\n * @ingroup public\n * @{\n */\n\n#ifndef XXH_NO_LONG_LONG\n/*-**********************************************************************\n* 64-bit hash\n************************************************************************/\n#if defined(XXH_DOXYGEN) /* don't include */\n/*!\n * @brief An unsigned 64-bit integer.\n *\n * Not necessarily defined to `uint64_t` but functionally equivalent.\n */\ntypedef uint64_t XXH64_hash_t;\n#elif !defined (__VMS) \\\n && (defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n# ifdef _AIX\n# include \n# else\n# include \n# endif\n typedef uint64_t XXH64_hash_t;\n#else\n# include \n# if defined(__LP64__) && ULONG_MAX == 0xFFFFFFFFFFFFFFFFULL\n /* LP64 ABI says uint64_t is unsigned long */\n typedef unsigned long XXH64_hash_t;\n# else\n /* the following type must have a width of 64-bit */\n typedef unsigned long long XXH64_hash_t;\n# endif\n#endif\n\n/*!\n * @}\n *\n * @defgroup XXH64_family XXH64 family\n * @ingroup public\n * @{\n * Contains functions used in the classic 64-bit xxHash algorithm.\n *\n * @note\n * XXH3 provides competitive speed for both 32-bit and 64-bit systems,\n * and offers true 64/128 bit hash results.\n * It provides better speed for systems with vector processing capabilities.\n */\n\n/*!\n * @brief Calculates the 64-bit hash of @p input using xxHash64.\n *\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n * @param seed The 64-bit seed to alter the hash's output predictably.\n *\n * @pre\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return The calculated 64-bit xxHash64 value.\n *\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t XXH64(XXH_NOESCAPE const void* input, size_t length, XXH64_hash_t seed);\n\n/******* Streaming *******/\n#ifndef XXH_NO_STREAM\n/*!\n * @brief The opaque state struct for the XXH64 streaming API.\n *\n * @see XXH64_state_s for details.\n * @see @ref streaming_example \"Streaming Example\"\n */\ntypedef struct XXH64_state_s XXH64_state_t; /* incomplete type */\n\n/*!\n * @brief Allocates an @ref XXH64_state_t.\n *\n * @return An allocated pointer of @ref XXH64_state_t on success.\n * @return `NULL` on failure.\n *\n * @note Must be freed with XXH64_freeState().\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_MALLOCF XXH64_state_t* XXH64_createState(void);\n\n/*!\n * @brief Frees an @ref XXH64_state_t.\n *\n * @param statePtr A pointer to an @ref XXH64_state_t allocated with @ref XXH64_createState().\n *\n * @return @ref XXH_OK.\n *\n * @note @p statePtr must be allocated with XXH64_createState().\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr);\n\n/*!\n * @brief Copies one @ref XXH64_state_t to another.\n *\n * @param dst_state The state to copy to.\n * @param src_state The state to copy from.\n * @pre\n * @p dst_state and @p src_state must not be `NULL` and must not overlap.\n */\nXXH_PUBLIC_API void XXH64_copyState(XXH_NOESCAPE XXH64_state_t* dst_state, const XXH64_state_t* src_state);\n\n/*!\n * @brief Resets an @ref XXH64_state_t to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n * @param seed The 64-bit seed to alter the hash result predictably.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note This function resets and seeds a state. Call it before @ref XXH64_update().\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH64_reset (XXH_NOESCAPE XXH64_state_t* statePtr, XXH64_hash_t seed);\n\n/*!\n * @brief Consumes a block of @p input to an @ref XXH64_state_t.\n *\n * @param statePtr The state struct to update.\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n * @pre\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note Call this to incrementally consume blocks of data.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH64_update (XXH_NOESCAPE XXH64_state_t* statePtr, XXH_NOESCAPE const void* input, size_t length);\n\n/*!\n * @brief Returns the calculated hash value from an @ref XXH64_state_t.\n *\n * @param statePtr The state struct to calculate the hash from.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return The calculated 64-bit xxHash64 value from that state.\n *\n * @note\n * Calling XXH64_digest() will not affect @p statePtr, so you can update,\n * digest, and update again.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t XXH64_digest (XXH_NOESCAPE const XXH64_state_t* statePtr);\n#endif /* !XXH_NO_STREAM */\n/******* Canonical representation *******/\n\n/*!\n * @brief Canonical (big endian) representation of @ref XXH64_hash_t.\n */\ntypedef struct { unsigned char digest[sizeof(XXH64_hash_t)]; } XXH64_canonical_t;\n\n/*!\n * @brief Converts an @ref XXH64_hash_t to a big endian @ref XXH64_canonical_t.\n *\n * @param dst The @ref XXH64_canonical_t pointer to be stored to.\n * @param hash The @ref XXH64_hash_t to be converted.\n *\n * @pre\n * @p dst must not be `NULL`.\n *\n * @see @ref canonical_representation_example \"Canonical Representation Example\"\n */\nXXH_PUBLIC_API void XXH64_canonicalFromHash(XXH_NOESCAPE XXH64_canonical_t* dst, XXH64_hash_t hash);\n\n/*!\n * @brief Converts an @ref XXH64_canonical_t to a native @ref XXH64_hash_t.\n *\n * @param src The @ref XXH64_canonical_t to convert.\n *\n * @pre\n * @p src must not be `NULL`.\n *\n * @return The converted hash.\n *\n * @see @ref canonical_representation_example \"Canonical Representation Example\"\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t XXH64_hashFromCanonical(XXH_NOESCAPE const XXH64_canonical_t* src);\n\n#ifndef XXH_NO_XXH3\n\n/*!\n * @}\n * ************************************************************************\n * @defgroup XXH3_family XXH3 family\n * @ingroup public\n * @{\n *\n * XXH3 is a more recent hash algorithm featuring:\n * - Improved speed for both small and large inputs\n * - True 64-bit and 128-bit outputs\n * - SIMD acceleration\n * - Improved 32-bit viability\n *\n * Speed analysis methodology is explained here:\n *\n * https://fastcompression.blogspot.com/2019/03/presenting-xxh3.html\n *\n * Compared to XXH64, expect XXH3 to run approximately\n * ~2x faster on large inputs and >3x faster on small ones,\n * exact differences vary depending on platform.\n *\n * XXH3's speed benefits greatly from SIMD and 64-bit arithmetic,\n * but does not require it.\n * Most 32-bit and 64-bit targets that can run XXH32 smoothly can run XXH3\n * at competitive speeds, even without vector support. Further details are\n * explained in the implementation.\n *\n * XXH3 has a fast scalar implementation, but it also includes accelerated SIMD\n * implementations for many common platforms:\n * - AVX512\n * - AVX2\n * - SSE2\n * - ARM NEON\n * - WebAssembly SIMD128\n * - POWER8 VSX\n * - s390x ZVector\n * This can be controlled via the @ref XXH_VECTOR macro, but it automatically\n * selects the best version according to predefined macros. For the x86 family, an\n * automatic runtime dispatcher is included separately in @ref xxh_x86dispatch.c.\n *\n * XXH3 implementation is portable:\n * it has a generic C90 formulation that can be compiled on any platform,\n * all implementations generate exactly the same hash value on all platforms.\n * Starting from v0.8.0, it's also labelled \"stable\", meaning that\n * any future version will also generate the same hash value.\n *\n * XXH3 offers 2 variants, _64bits and _128bits.\n *\n * When only 64 bits are needed, prefer invoking the _64bits variant, as it\n * reduces the amount of mixing, resulting in faster speed on small inputs.\n * It's also generally simpler to manipulate a scalar return type than a struct.\n *\n * The API supports one-shot hashing, streaming mode, and custom secrets.\n */\n\n/*!\n * @ingroup tuning\n * @brief Possible values for @ref XXH_VECTOR.\n *\n * Unless set explicitly, determined automatically.\n */\n# define XXH_SCALAR 0 /*!< Portable scalar version */\n# define XXH_SSE2 1 /*!< SSE2 for Pentium 4, Opteron, all x86_64. */\n# define XXH_AVX2 2 /*!< AVX2 for Haswell and Bulldozer */\n# define XXH_AVX512 3 /*!< AVX512 for Skylake and Icelake */\n# define XXH_NEON 4 /*!< NEON for most ARMv7-A, all AArch64, and WASM SIMD128 */\n# define XXH_VSX 5 /*!< VSX and ZVector for POWER8/z13 (64-bit) */\n# define XXH_SVE 6 /*!< SVE for some ARMv8-A and ARMv9-A */\n# define XXH_LSX 7 /*!< LSX (128-bit SIMD) for LoongArch64 */\n\n\n/*-**********************************************************************\n* XXH3 64-bit variant\n************************************************************************/\n\n/*!\n * @brief Calculates 64-bit unseeded variant of XXH3 hash of @p input.\n *\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n *\n * @pre\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return The calculated 64-bit XXH3 hash value.\n *\n * @note\n * This is equivalent to @ref XXH3_64bits_withSeed() with a seed of `0`, however\n * it may have slightly better performance due to constant propagation of the\n * defaults.\n *\n * @see\n * XXH3_64bits_withSeed(), XXH3_64bits_withSecret(): other seeding variants\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t XXH3_64bits(XXH_NOESCAPE const void* input, size_t length);\n\n/*!\n * @brief Calculates 64-bit seeded variant of XXH3 hash of @p input.\n *\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n * @param seed The 64-bit seed to alter the hash result predictably.\n *\n * @pre\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return The calculated 64-bit XXH3 hash value.\n *\n * @note\n * seed == 0 produces the same results as @ref XXH3_64bits().\n *\n * This variant generates a custom secret on the fly based on default secret\n * altered using the @p seed value.\n *\n * While this operation is decently fast, note that it's not completely free.\n *\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t XXH3_64bits_withSeed(XXH_NOESCAPE const void* input, size_t length, XXH64_hash_t seed);\n\n/*!\n * The bare minimum size for a custom secret.\n *\n * @see\n * XXH3_64bits_withSecret(), XXH3_64bits_reset_withSecret(),\n * XXH3_128bits_withSecret(), XXH3_128bits_reset_withSecret().\n */\n#define XXH3_SECRET_SIZE_MIN 136\n\n/*!\n * @brief Calculates 64-bit variant of XXH3 with a custom \"secret\".\n *\n * @param data The block of data to be hashed, at least @p len bytes in size.\n * @param len The length of @p data, in bytes.\n * @param secret The secret data.\n * @param secretSize The length of @p secret, in bytes.\n *\n * @return The calculated 64-bit XXH3 hash value.\n *\n * @pre\n * The memory between @p data and @p data + @p len must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p data may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * It's possible to provide any blob of bytes as a \"secret\" to generate the hash.\n * This makes it more difficult for an external actor to prepare an intentional collision.\n * The main condition is that @p secretSize *must* be large enough (>= @ref XXH3_SECRET_SIZE_MIN).\n * However, the quality of the secret impacts the dispersion of the hash algorithm.\n * Therefore, the secret _must_ look like a bunch of random bytes.\n * Avoid \"trivial\" or structured data such as repeated sequences or a text document.\n * Whenever in doubt about the \"randomness\" of the blob of bytes,\n * consider employing @ref XXH3_generateSecret() instead (see below).\n * It will generate a proper high entropy secret derived from the blob of bytes.\n * Another advantage of using XXH3_generateSecret() is that\n * it guarantees that all bits within the initial blob of bytes\n * will impact every bit of the output.\n * This is not necessarily the case when using the blob of bytes directly\n * because, when hashing _small_ inputs, only a portion of the secret is employed.\n *\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t XXH3_64bits_withSecret(XXH_NOESCAPE const void* data, size_t len, XXH_NOESCAPE const void* secret, size_t secretSize);\n\n\n/******* Streaming *******/\n#ifndef XXH_NO_STREAM\n/*\n * Streaming requires state maintenance.\n * This operation costs memory and CPU.\n * As a consequence, streaming is slower than one-shot hashing.\n * For better performance, prefer one-shot functions whenever applicable.\n */\n\n/*!\n * @brief The opaque state struct for the XXH3 streaming API.\n *\n * @see XXH3_state_s for details.\n * @see @ref streaming_example \"Streaming Example\"\n */\ntypedef struct XXH3_state_s XXH3_state_t;\nXXH_PUBLIC_API XXH_MALLOCF XXH3_state_t* XXH3_createState(void);\nXXH_PUBLIC_API XXH_errorcode XXH3_freeState(XXH3_state_t* statePtr);\n\n/*!\n * @brief Copies one @ref XXH3_state_t to another.\n *\n * @param dst_state The state to copy to.\n * @param src_state The state to copy from.\n * @pre\n * @p dst_state and @p src_state must not be `NULL` and must not overlap.\n */\nXXH_PUBLIC_API void XXH3_copyState(XXH_NOESCAPE XXH3_state_t* dst_state, XXH_NOESCAPE const XXH3_state_t* src_state);\n\n/*!\n * @brief Resets an @ref XXH3_state_t to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note\n * - This function resets `statePtr` and generate a secret with default parameters.\n * - Call this function before @ref XXH3_64bits_update().\n * - Digest will be equivalent to `XXH3_64bits()`.\n *\n * @see @ref streaming_example \"Streaming Example\"\n *\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_reset(XXH_NOESCAPE XXH3_state_t* statePtr);\n\n/*!\n * @brief Resets an @ref XXH3_state_t with 64-bit seed to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n * @param seed The 64-bit seed to alter the hash result predictably.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note\n * - This function resets `statePtr` and generate a secret from `seed`.\n * - Call this function before @ref XXH3_64bits_update().\n * - Digest will be equivalent to `XXH3_64bits_withSeed()`.\n *\n * @see @ref streaming_example \"Streaming Example\"\n *\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_reset_withSeed(XXH_NOESCAPE XXH3_state_t* statePtr, XXH64_hash_t seed);\n\n/*!\n * @brief Resets an @ref XXH3_state_t with secret data to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n * @param secret The secret data.\n * @param secretSize The length of @p secret, in bytes.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note\n * `secret` is referenced, it _must outlive_ the hash streaming session.\n *\n * Similar to one-shot API, `secretSize` must be >= @ref XXH3_SECRET_SIZE_MIN,\n * and the quality of produced hash values depends on secret's entropy\n * (secret's content should look like a bunch of random bytes).\n * When in doubt about the randomness of a candidate `secret`,\n * consider employing `XXH3_generateSecret()` instead (see below).\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_reset_withSecret(XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* secret, size_t secretSize);\n\n/*!\n * @brief Consumes a block of @p input to an @ref XXH3_state_t.\n *\n * @param statePtr The state struct to update.\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n * @pre\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note Call this to incrementally consume blocks of data.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_64bits_update (XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* input, size_t length);\n\n/*!\n * @brief Returns the calculated XXH3 64-bit hash value from an @ref XXH3_state_t.\n *\n * @param statePtr The state struct to calculate the hash from.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return The calculated XXH3 64-bit hash value from that state.\n *\n * @note\n * Calling XXH3_64bits_digest() will not affect @p statePtr, so you can update,\n * digest, and update again.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t XXH3_64bits_digest (XXH_NOESCAPE const XXH3_state_t* statePtr);\n#endif /* !XXH_NO_STREAM */\n\n/* note : canonical representation of XXH3 is the same as XXH64\n * since they both produce XXH64_hash_t values */\n\n\n/*-**********************************************************************\n* XXH3 128-bit variant\n************************************************************************/\n\n/*!\n * @brief The return value from 128-bit hashes.\n *\n * Stored in little endian order, although the fields themselves are in native\n * endianness.\n */\ntypedef struct {\n XXH64_hash_t low64; /*!< `value & 0xFFFFFFFFFFFFFFFF` */\n XXH64_hash_t high64; /*!< `value >> 64` */\n} XXH128_hash_t;\n\n/*!\n * @brief Calculates 128-bit unseeded variant of XXH3 of @p data.\n *\n * @param data The block of data to be hashed, at least @p length bytes in size.\n * @param len The length of @p data, in bytes.\n *\n * @return The calculated 128-bit variant of XXH3 value.\n *\n * The 128-bit variant of XXH3 has more strength, but it has a bit of overhead\n * for shorter inputs.\n *\n * This is equivalent to @ref XXH3_128bits_withSeed() with a seed of `0`, however\n * it may have slightly better performance due to constant propagation of the\n * defaults.\n *\n * @see XXH3_128bits_withSeed(), XXH3_128bits_withSecret(): other seeding variants\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH128_hash_t XXH3_128bits(XXH_NOESCAPE const void* data, size_t len);\n/*! @brief Calculates 128-bit seeded variant of XXH3 hash of @p data.\n *\n * @param data The block of data to be hashed, at least @p length bytes in size.\n * @param len The length of @p data, in bytes.\n * @param seed The 64-bit seed to alter the hash result predictably.\n *\n * @return The calculated 128-bit variant of XXH3 value.\n *\n * @note\n * seed == 0 produces the same results as @ref XXH3_64bits().\n *\n * This variant generates a custom secret on the fly based on default secret\n * altered using the @p seed value.\n *\n * While this operation is decently fast, note that it's not completely free.\n *\n * @see XXH3_128bits(), XXH3_128bits_withSecret(): other seeding variants\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH128_hash_t XXH3_128bits_withSeed(XXH_NOESCAPE const void* data, size_t len, XXH64_hash_t seed);\n/*!\n * @brief Calculates 128-bit variant of XXH3 with a custom \"secret\".\n *\n * @param data The block of data to be hashed, at least @p len bytes in size.\n * @param len The length of @p data, in bytes.\n * @param secret The secret data.\n * @param secretSize The length of @p secret, in bytes.\n *\n * @return The calculated 128-bit variant of XXH3 value.\n *\n * It's possible to provide any blob of bytes as a \"secret\" to generate the hash.\n * This makes it more difficult for an external actor to prepare an intentional collision.\n * The main condition is that @p secretSize *must* be large enough (>= @ref XXH3_SECRET_SIZE_MIN).\n * However, the quality of the secret impacts the dispersion of the hash algorithm.\n * Therefore, the secret _must_ look like a bunch of random bytes.\n * Avoid \"trivial\" or structured data such as repeated sequences or a text document.\n * Whenever in doubt about the \"randomness\" of the blob of bytes,\n * consider employing @ref XXH3_generateSecret() instead (see below).\n * It will generate a proper high entropy secret derived from the blob of bytes.\n * Another advantage of using XXH3_generateSecret() is that\n * it guarantees that all bits within the initial blob of bytes\n * will impact every bit of the output.\n * This is not necessarily the case when using the blob of bytes directly\n * because, when hashing _small_ inputs, only a portion of the secret is employed.\n *\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH128_hash_t XXH3_128bits_withSecret(XXH_NOESCAPE const void* data, size_t len, XXH_NOESCAPE const void* secret, size_t secretSize);\n\n/******* Streaming *******/\n#ifndef XXH_NO_STREAM\n/*\n * Streaming requires state maintenance.\n * This operation costs memory and CPU.\n * As a consequence, streaming is slower than one-shot hashing.\n * For better performance, prefer one-shot functions whenever applicable.\n *\n * XXH3_128bits uses the same XXH3_state_t as XXH3_64bits().\n * Use already declared XXH3_createState() and XXH3_freeState().\n *\n * All reset and streaming functions have same meaning as their 64-bit counterpart.\n */\n\n/*!\n * @brief Resets an @ref XXH3_state_t to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note\n * - This function resets `statePtr` and generate a secret with default parameters.\n * - Call it before @ref XXH3_128bits_update().\n * - Digest will be equivalent to `XXH3_128bits()`.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_reset(XXH_NOESCAPE XXH3_state_t* statePtr);\n\n/*!\n * @brief Resets an @ref XXH3_state_t with 64-bit seed to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n * @param seed The 64-bit seed to alter the hash result predictably.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note\n * - This function resets `statePtr` and generate a secret from `seed`.\n * - Call it before @ref XXH3_128bits_update().\n * - Digest will be equivalent to `XXH3_128bits_withSeed()`.\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_reset_withSeed(XXH_NOESCAPE XXH3_state_t* statePtr, XXH64_hash_t seed);\n/*!\n * @brief Resets an @ref XXH3_state_t with secret data to begin a new hash.\n *\n * @param statePtr The state struct to reset.\n * @param secret The secret data.\n * @param secretSize The length of @p secret, in bytes.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * `secret` is referenced, it _must outlive_ the hash streaming session.\n * Similar to one-shot API, `secretSize` must be >= @ref XXH3_SECRET_SIZE_MIN,\n * and the quality of produced hash values depends on secret's entropy\n * (secret's content should look like a bunch of random bytes).\n * When in doubt about the randomness of a candidate `secret`,\n * consider employing `XXH3_generateSecret()` instead (see below).\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_reset_withSecret(XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* secret, size_t secretSize);\n\n/*!\n * @brief Consumes a block of @p input to an @ref XXH3_state_t.\n *\n * Call this to incrementally consume blocks of data.\n *\n * @param statePtr The state struct to update.\n * @param input The block of data to be hashed, at least @p length bytes in size.\n * @param length The length of @p input, in bytes.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @note\n * The memory between @p input and @p input + @p length must be valid,\n * readable, contiguous memory. However, if @p length is `0`, @p input may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_128bits_update (XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* input, size_t length);\n\n/*!\n * @brief Returns the calculated XXH3 128-bit hash value from an @ref XXH3_state_t.\n *\n * @param statePtr The state struct to calculate the hash from.\n *\n * @pre\n * @p statePtr must not be `NULL`.\n *\n * @return The calculated XXH3 128-bit hash value from that state.\n *\n * @note\n * Calling XXH3_128bits_digest() will not affect @p statePtr, so you can update,\n * digest, and update again.\n *\n */\nXXH_PUBLIC_API XXH_PUREF XXH128_hash_t XXH3_128bits_digest (XXH_NOESCAPE const XXH3_state_t* statePtr);\n#endif /* !XXH_NO_STREAM */\n\n/* Following helper functions make it possible to compare XXH128_hast_t values.\n * Since XXH128_hash_t is a structure, this capability is not offered by the language.\n * Note: For better performance, these functions can be inlined using XXH_INLINE_ALL */\n\n/*!\n * @brief Check equality of two XXH128_hash_t values\n *\n * @param h1 The 128-bit hash value.\n * @param h2 Another 128-bit hash value.\n *\n * @return `1` if `h1` and `h2` are equal.\n * @return `0` if they are not.\n */\nXXH_PUBLIC_API XXH_PUREF int XXH128_isEqual(XXH128_hash_t h1, XXH128_hash_t h2);\n\n/*!\n * @brief Compares two @ref XXH128_hash_t\n *\n * This comparator is compatible with stdlib's `qsort()`/`bsearch()`.\n *\n * @param h128_1 Left-hand side value\n * @param h128_2 Right-hand side value\n *\n * @return >0 if @p h128_1 > @p h128_2\n * @return =0 if @p h128_1 == @p h128_2\n * @return <0 if @p h128_1 < @p h128_2\n */\nXXH_PUBLIC_API XXH_PUREF int XXH128_cmp(XXH_NOESCAPE const void* h128_1, XXH_NOESCAPE const void* h128_2);\n\n\n/******* Canonical representation *******/\ntypedef struct { unsigned char digest[sizeof(XXH128_hash_t)]; } XXH128_canonical_t;\n\n\n/*!\n * @brief Converts an @ref XXH128_hash_t to a big endian @ref XXH128_canonical_t.\n *\n * @param dst The @ref XXH128_canonical_t pointer to be stored to.\n * @param hash The @ref XXH128_hash_t to be converted.\n *\n * @pre\n * @p dst must not be `NULL`.\n * @see @ref canonical_representation_example \"Canonical Representation Example\"\n */\nXXH_PUBLIC_API void XXH128_canonicalFromHash(XXH_NOESCAPE XXH128_canonical_t* dst, XXH128_hash_t hash);\n\n/*!\n * @brief Converts an @ref XXH128_canonical_t to a native @ref XXH128_hash_t.\n *\n * @param src The @ref XXH128_canonical_t to convert.\n *\n * @pre\n * @p src must not be `NULL`.\n *\n * @return The converted hash.\n * @see @ref canonical_representation_example \"Canonical Representation Example\"\n */\nXXH_PUBLIC_API XXH_PUREF XXH128_hash_t XXH128_hashFromCanonical(XXH_NOESCAPE const XXH128_canonical_t* src);\n\n\n#endif /* !XXH_NO_XXH3 */\n#endif /* XXH_NO_LONG_LONG */\n\n/*!\n * @}\n */\n#endif /* XXHASH_H_5627135585666179 */\n\n\n\n#if defined(XXH_STATIC_LINKING_ONLY) && !defined(XXHASH_H_STATIC_13879238742)\n#define XXHASH_H_STATIC_13879238742\n/* ****************************************************************************\n * This section contains declarations which are not guaranteed to remain stable.\n * They may change in future versions, becoming incompatible with a different\n * version of the library.\n * These declarations should only be used with static linking.\n * Never use them in association with dynamic linking!\n ***************************************************************************** */\n\n/*\n * These definitions are only present to allow static allocation\n * of XXH states, on stack or in a struct, for example.\n * Never **ever** access their members directly.\n */\n\n/*!\n * @internal\n * @brief Structure for XXH32 streaming API.\n *\n * @note This is only defined when @ref XXH_STATIC_LINKING_ONLY,\n * @ref XXH_INLINE_ALL, or @ref XXH_IMPLEMENTATION is defined. Otherwise it is\n * an opaque type. This allows fields to safely be changed.\n *\n * Typedef'd to @ref XXH32_state_t.\n * Do not access the members of this struct directly.\n * @see XXH64_state_s, XXH3_state_s\n */\nstruct XXH32_state_s {\n XXH32_hash_t total_len_32; /*!< Total length hashed, modulo 2^32 */\n XXH32_hash_t large_len; /*!< Whether the hash is >= 16 (handles @ref total_len_32 overflow) */\n XXH32_hash_t acc[4]; /*!< Accumulator lanes */\n unsigned char buffer[16]; /*!< Internal buffer for partial reads. */\n XXH32_hash_t bufferedSize; /*!< Amount of data in @ref buffer */\n XXH32_hash_t reserved; /*!< Reserved field. Do not read nor write to it. */\n}; /* typedef'd to XXH32_state_t */\n\n\n#ifndef XXH_NO_LONG_LONG /* defined when there is no 64-bit support */\n\n/*!\n * @internal\n * @brief Structure for XXH64 streaming API.\n *\n * @note This is only defined when @ref XXH_STATIC_LINKING_ONLY,\n * @ref XXH_INLINE_ALL, or @ref XXH_IMPLEMENTATION is defined. Otherwise it is\n * an opaque type. This allows fields to safely be changed.\n *\n * Typedef'd to @ref XXH64_state_t.\n * Do not access the members of this struct directly.\n * @see XXH32_state_s, XXH3_state_s\n */\nstruct XXH64_state_s {\n XXH64_hash_t total_len; /*!< Total length hashed. This is always 64-bit. */\n XXH64_hash_t acc[4]; /*!< Accumulator lanes */\n unsigned char buffer[32]; /*!< Internal buffer for partial reads.. */\n XXH32_hash_t bufferedSize; /*!< Amount of data in @ref buffer */\n XXH32_hash_t reserved32; /*!< Reserved field, needed for padding anyways*/\n XXH64_hash_t reserved64; /*!< Reserved field. Do not read or write to it. */\n}; /* typedef'd to XXH64_state_t */\n\n#ifndef XXH_NO_XXH3\n\n#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L) /* >= C11 */\n# define XXH_ALIGN(n) _Alignas(n)\n#elif defined(__cplusplus) && (__cplusplus >= 201103L) /* >= C++11 */\n/* In C++ alignas() is a keyword */\n# define XXH_ALIGN(n) alignas(n)\n#elif defined(__GNUC__)\n# define XXH_ALIGN(n) __attribute__ ((aligned(n)))\n#elif defined(_MSC_VER)\n# define XXH_ALIGN(n) __declspec(align(n))\n#else\n# define XXH_ALIGN(n) /* disabled */\n#endif\n\n/* Old GCC versions only accept the attribute after the type in structures. */\n#if !(defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L)) /* C11+ */ \\\n && ! (defined(__cplusplus) && (__cplusplus >= 201103L)) /* >= C++11 */ \\\n && defined(__GNUC__)\n# define XXH_ALIGN_MEMBER(align, type) type XXH_ALIGN(align)\n#else\n# define XXH_ALIGN_MEMBER(align, type) XXH_ALIGN(align) type\n#endif\n\n/*!\n * @brief The size of the internal XXH3 buffer.\n *\n * This is the optimal update size for incremental hashing.\n *\n * @see XXH3_64b_update(), XXH3_128b_update().\n */\n#define XXH3_INTERNALBUFFER_SIZE 256\n\n/*!\n * @internal\n * @brief Default size of the secret buffer (and @ref XXH3_kSecret).\n *\n * This is the size used in @ref XXH3_kSecret and the seeded functions.\n *\n * Not to be confused with @ref XXH3_SECRET_SIZE_MIN.\n */\n#define XXH3_SECRET_DEFAULT_SIZE 192\n\n/*!\n * @internal\n * @brief Structure for XXH3 streaming API.\n *\n * @note This is only defined when @ref XXH_STATIC_LINKING_ONLY,\n * @ref XXH_INLINE_ALL, or @ref XXH_IMPLEMENTATION is defined.\n * Otherwise it is an opaque type.\n * Never use this definition in combination with dynamic library.\n * This allows fields to safely be changed in the future.\n *\n * @note ** This structure has a strict alignment requirement of 64 bytes!! **\n * Do not allocate this with `malloc()` or `new`,\n * it will not be sufficiently aligned.\n * Use @ref XXH3_createState() and @ref XXH3_freeState(), or stack allocation.\n *\n * Typedef'd to @ref XXH3_state_t.\n * Do never access the members of this struct directly.\n *\n * @see XXH3_INITSTATE() for stack initialization.\n * @see XXH3_createState(), XXH3_freeState().\n * @see XXH32_state_s, XXH64_state_s\n */\nstruct XXH3_state_s {\n XXH_ALIGN_MEMBER(64, XXH64_hash_t acc[8]);\n /*!< The 8 accumulators. See @ref XXH32_state_s::v and @ref XXH64_state_s::v */\n XXH_ALIGN_MEMBER(64, unsigned char customSecret[XXH3_SECRET_DEFAULT_SIZE]);\n /*!< Used to store a custom secret generated from a seed. */\n XXH_ALIGN_MEMBER(64, unsigned char buffer[XXH3_INTERNALBUFFER_SIZE]);\n /*!< The internal buffer. @see XXH32_state_s::mem32 */\n XXH32_hash_t bufferedSize;\n /*!< The amount of memory in @ref buffer, @see XXH32_state_s::memsize */\n XXH32_hash_t useSeed;\n /*!< Reserved field. Needed for padding on 64-bit. */\n size_t nbStripesSoFar;\n /*!< Number or stripes processed. */\n XXH64_hash_t totalLen;\n /*!< Total length hashed. 64-bit even on 32-bit targets. */\n size_t nbStripesPerBlock;\n /*!< Number of stripes per block. */\n size_t secretLimit;\n /*!< Size of @ref customSecret or @ref extSecret */\n XXH64_hash_t seed;\n /*!< Seed for _withSeed variants. Must be zero otherwise, @see XXH3_INITSTATE() */\n XXH64_hash_t reserved64;\n /*!< Reserved field. */\n const unsigned char* extSecret;\n /*!< Reference to an external secret for the _withSecret variants, NULL\n * for other variants. */\n /* note: there may be some padding at the end due to alignment on 64 bytes */\n}; /* typedef'd to XXH3_state_t */\n\n#undef XXH_ALIGN_MEMBER\n\n/*!\n * @brief Initializes a stack-allocated `XXH3_state_s`.\n *\n * When the @ref XXH3_state_t structure is merely emplaced on stack,\n * it should be initialized with XXH3_INITSTATE() or a memset()\n * in case its first reset uses XXH3_NNbits_reset_withSeed().\n * This init can be omitted if the first reset uses default or _withSecret mode.\n * This operation isn't necessary when the state is created with XXH3_createState().\n * Note that this doesn't prepare the state for a streaming operation,\n * it's still necessary to use XXH3_NNbits_reset*() afterwards.\n */\n#define XXH3_INITSTATE(XXH3_state_ptr) \\\n do { \\\n XXH3_state_t* tmp_xxh3_state_ptr = (XXH3_state_ptr); \\\n tmp_xxh3_state_ptr->seed = 0; \\\n tmp_xxh3_state_ptr->extSecret = NULL; \\\n } while(0)\n\n\n/*!\n * @brief Calculates the 128-bit hash of @p data using XXH3.\n *\n * @param data The block of data to be hashed, at least @p len bytes in size.\n * @param len The length of @p data, in bytes.\n * @param seed The 64-bit seed to alter the hash's output predictably.\n *\n * @pre\n * The memory between @p data and @p data + @p len must be valid,\n * readable, contiguous memory. However, if @p len is `0`, @p data may be\n * `NULL`. In C++, this also must be *TriviallyCopyable*.\n *\n * @return The calculated 128-bit XXH3 value.\n *\n * @see @ref single_shot_example \"Single Shot Example\" for an example.\n */\nXXH_PUBLIC_API XXH_PUREF XXH128_hash_t XXH128(XXH_NOESCAPE const void* data, size_t len, XXH64_hash_t seed);\n\n\n/* === Experimental API === */\n/* Symbols defined below must be considered tied to a specific library version. */\n\n/*!\n * @brief Derive a high-entropy secret from any user-defined content, named customSeed.\n *\n * @param secretBuffer A writable buffer for derived high-entropy secret data.\n * @param secretSize Size of secretBuffer, in bytes. Must be >= XXH3_SECRET_SIZE_MIN.\n * @param customSeed A user-defined content.\n * @param customSeedSize Size of customSeed, in bytes.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * The generated secret can be used in combination with `*_withSecret()` functions.\n * The `_withSecret()` variants are useful to provide a higher level of protection\n * than 64-bit seed, as it becomes much more difficult for an external actor to\n * guess how to impact the calculation logic.\n *\n * The function accepts as input a custom seed of any length and any content,\n * and derives from it a high-entropy secret of length @p secretSize into an\n * already allocated buffer @p secretBuffer.\n *\n * The generated secret can then be used with any `*_withSecret()` variant.\n * The functions @ref XXH3_128bits_withSecret(), @ref XXH3_64bits_withSecret(),\n * @ref XXH3_128bits_reset_withSecret() and @ref XXH3_64bits_reset_withSecret()\n * are part of this list. They all accept a `secret` parameter\n * which must be large enough for implementation reasons (>= @ref XXH3_SECRET_SIZE_MIN)\n * _and_ feature very high entropy (consist of random-looking bytes).\n * These conditions can be a high bar to meet, so @ref XXH3_generateSecret() can\n * be employed to ensure proper quality.\n *\n * @p customSeed can be anything. It can have any size, even small ones,\n * and its content can be anything, even \"poor entropy\" sources such as a bunch\n * of zeroes. The resulting `secret` will nonetheless provide all required qualities.\n *\n * @pre\n * - @p secretSize must be >= @ref XXH3_SECRET_SIZE_MIN\n * - When @p customSeedSize > 0, supplying NULL as customSeed is undefined behavior.\n *\n * Example code:\n * @code{.c}\n * #include \n * #include \n * #include \n * #define XXH_STATIC_LINKING_ONLY // expose unstable API\n * #include \"xxhash.h\"\n * // Hashes argv[2] using the entropy from argv[1].\n * int main(int argc, char* argv[])\n * {\n * char secret[XXH3_SECRET_SIZE_MIN];\n * if (argv != 3) { return 1; }\n * XXH3_generateSecret(secret, sizeof(secret), argv[1], strlen(argv[1]));\n * XXH64_hash_t h = XXH3_64bits_withSecret(\n * argv[2], strlen(argv[2]),\n * secret, sizeof(secret)\n * );\n * printf(\"%016llx\\n\", (unsigned long long) h);\n * }\n * @endcode\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_generateSecret(XXH_NOESCAPE void* secretBuffer, size_t secretSize, XXH_NOESCAPE const void* customSeed, size_t customSeedSize);\n\n/*!\n * @brief Generate the same secret as the _withSeed() variants.\n *\n * @param secretBuffer A writable buffer of @ref XXH3_SECRET_DEFAULT_SIZE bytes\n * @param seed The 64-bit seed to alter the hash result predictably.\n *\n * The generated secret can be used in combination with\n *`*_withSecret()` and `_withSecretandSeed()` variants.\n *\n * Example C++ `std::string` hash class:\n * @code{.cpp}\n * #include \n * #define XXH_STATIC_LINKING_ONLY // expose unstable API\n * #include \"xxhash.h\"\n * // Slow, seeds each time\n * class HashSlow {\n * XXH64_hash_t seed;\n * public:\n * HashSlow(XXH64_hash_t s) : seed{s} {}\n * size_t operator()(const std::string& x) const {\n * return size_t{XXH3_64bits_withSeed(x.c_str(), x.length(), seed)};\n * }\n * };\n * // Fast, caches the seeded secret for future uses.\n * class HashFast {\n * unsigned char secret[XXH3_SECRET_DEFAULT_SIZE];\n * public:\n * HashFast(XXH64_hash_t s) {\n * XXH3_generateSecret_fromSeed(secret, seed);\n * }\n * size_t operator()(const std::string& x) const {\n * return size_t{\n * XXH3_64bits_withSecret(x.c_str(), x.length(), secret, sizeof(secret))\n * };\n * }\n * };\n * @endcode\n */\nXXH_PUBLIC_API void XXH3_generateSecret_fromSeed(XXH_NOESCAPE void* secretBuffer, XXH64_hash_t seed);\n\n/*!\n * @brief Maximum size of \"short\" key in bytes.\n */\n#define XXH3_MIDSIZE_MAX 240\n\n/*!\n * @brief Calculates 64/128-bit seeded variant of XXH3 hash of @p data.\n *\n * @param data The block of data to be hashed, at least @p len bytes in size.\n * @param len The length of @p data, in bytes.\n * @param secret The secret data.\n * @param secretSize The length of @p secret, in bytes.\n * @param seed The 64-bit seed to alter the hash result predictably.\n *\n * These variants generate hash values using either:\n * - @p seed for \"short\" keys (< @ref XXH3_MIDSIZE_MAX = 240 bytes)\n * - @p secret for \"large\" keys (>= @ref XXH3_MIDSIZE_MAX).\n *\n * This generally benefits speed, compared to `_withSeed()` or `_withSecret()`.\n * `_withSeed()` has to generate the secret on the fly for \"large\" keys.\n * It's fast, but can be perceptible for \"not so large\" keys (< 1 KB).\n * `_withSecret()` has to generate the masks on the fly for \"small\" keys,\n * which requires more instructions than _withSeed() variants.\n * Therefore, _withSecretandSeed variant combines the best of both worlds.\n *\n * When @p secret has been generated by XXH3_generateSecret_fromSeed(),\n * this variant produces *exactly* the same results as `_withSeed()` variant,\n * hence offering only a pure speed benefit on \"large\" input,\n * by skipping the need to regenerate the secret for every large input.\n *\n * Another usage scenario is to hash the secret to a 64-bit hash value,\n * for example with XXH3_64bits(), which then becomes the seed,\n * and then employ both the seed and the secret in _withSecretandSeed().\n * On top of speed, an added benefit is that each bit in the secret\n * has a 50% chance to swap each bit in the output, via its impact to the seed.\n *\n * This is not guaranteed when using the secret directly in \"small data\" scenarios,\n * because only portions of the secret are employed for small data.\n */\nXXH_PUBLIC_API XXH_PUREF XXH64_hash_t\nXXH3_64bits_withSecretandSeed(XXH_NOESCAPE const void* data, size_t len,\n XXH_NOESCAPE const void* secret, size_t secretSize,\n XXH64_hash_t seed);\n\n/*!\n * @brief Calculates 128-bit seeded variant of XXH3 hash of @p data.\n *\n * @param data The memory segment to be hashed, at least @p len bytes in size.\n * @param length The length of @p data, in bytes.\n * @param secret The secret used to alter hash result predictably.\n * @param secretSize The length of @p secret, in bytes (must be >= XXH3_SECRET_SIZE_MIN)\n * @param seed64 The 64-bit seed to alter the hash result predictably.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @see XXH3_64bits_withSecretandSeed(): contract is the same.\n */\nXXH_PUBLIC_API XXH_PUREF XXH128_hash_t\nXXH3_128bits_withSecretandSeed(XXH_NOESCAPE const void* input, size_t length,\n XXH_NOESCAPE const void* secret, size_t secretSize,\n XXH64_hash_t seed64);\n\n#ifndef XXH_NO_STREAM\n/*!\n * @brief Resets an @ref XXH3_state_t with secret data to begin a new hash.\n *\n * @param statePtr A pointer to an @ref XXH3_state_t allocated with @ref XXH3_createState().\n * @param secret The secret data.\n * @param secretSize The length of @p secret, in bytes.\n * @param seed64 The 64-bit seed to alter the hash result predictably.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @see XXH3_64bits_withSecretandSeed(). Contract is identical.\n */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_64bits_reset_withSecretandSeed(XXH_NOESCAPE XXH3_state_t* statePtr,\n XXH_NOESCAPE const void* secret, size_t secretSize,\n XXH64_hash_t seed64);\n\n/*!\n * @brief Resets an @ref XXH3_state_t with secret data to begin a new hash.\n *\n * @param statePtr A pointer to an @ref XXH3_state_t allocated with @ref XXH3_createState().\n * @param secret The secret data.\n * @param secretSize The length of @p secret, in bytes.\n * @param seed64 The 64-bit seed to alter the hash result predictably.\n *\n * @return @ref XXH_OK on success.\n * @return @ref XXH_ERROR on failure.\n *\n * @see XXH3_64bits_withSecretandSeed(). Contract is identical.\n *\n * Note: there was a bug in an earlier version of this function (<= v0.8.2)\n * that would make it generate an incorrect hash value\n * when @p seed == 0 and @p length < XXH3_MIDSIZE_MAX\n * and @p secret is different from XXH3_generateSecret_fromSeed().\n * As stated in the contract, the correct hash result must be\n * the same as XXH3_128bits_withSeed() when @p length <= XXH3_MIDSIZE_MAX.\n * Results generated by this older version are wrong, hence not comparable.\n */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_128bits_reset_withSecretandSeed(XXH_NOESCAPE XXH3_state_t* statePtr,\n XXH_NOESCAPE const void* secret, size_t secretSize,\n XXH64_hash_t seed64);\n\n#endif /* !XXH_NO_STREAM */\n\n#endif /* !XXH_NO_XXH3 */\n#endif /* XXH_NO_LONG_LONG */\n#if defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API)\n# define XXH_IMPLEMENTATION\n#endif\n\n#endif /* defined(XXH_STATIC_LINKING_ONLY) && !defined(XXHASH_H_STATIC_13879238742) */\n\n\n/* ======================================================================== */\n/* ======================================================================== */\n/* ======================================================================== */\n\n\n/*-**********************************************************************\n * xxHash implementation\n *-**********************************************************************\n * xxHash's implementation used to be hosted inside xxhash.c.\n *\n * However, inlining requires implementation to be visible to the compiler,\n * hence be included alongside the header.\n * Previously, implementation was hosted inside xxhash.c,\n * which was then #included when inlining was activated.\n * This construction created issues with a few build and install systems,\n * as it required xxhash.c to be stored in /include directory.\n *\n * xxHash implementation is now directly integrated within xxhash.h.\n * As a consequence, xxhash.c is no longer needed in /include.\n *\n * xxhash.c is still available and is still useful.\n * In a \"normal\" setup, when xxhash is not inlined,\n * xxhash.h only exposes the prototypes and public symbols,\n * while xxhash.c can be built into an object file xxhash.o\n * which can then be linked into the final binary.\n ************************************************************************/\n\n#if ( defined(XXH_INLINE_ALL) || defined(XXH_PRIVATE_API) \\\n || defined(XXH_IMPLEMENTATION) ) && !defined(XXH_IMPLEM_13a8737387)\n# define XXH_IMPLEM_13a8737387\n\n/* *************************************\n* Tuning parameters\n***************************************/\n\n/*!\n * @defgroup tuning Tuning parameters\n * @{\n *\n * Various macros to control xxHash's behavior.\n */\n#ifdef XXH_DOXYGEN\n/*!\n * @brief Define this to disable 64-bit code.\n *\n * Useful if only using the @ref XXH32_family and you have a strict C90 compiler.\n */\n# define XXH_NO_LONG_LONG\n# undef XXH_NO_LONG_LONG /* don't actually */\n/*!\n * @brief Controls how unaligned memory is accessed.\n *\n * By default, access to unaligned memory is controlled by `memcpy()`, which is\n * safe and portable.\n *\n * Unfortunately, on some target/compiler combinations, the generated assembly\n * is sub-optimal.\n *\n * The below switch allow selection of a different access method\n * in the search for improved performance.\n *\n * @par Possible options:\n *\n * - `XXH_FORCE_MEMORY_ACCESS=0` (default): `memcpy`\n * @par\n * Use `memcpy()`. Safe and portable. Note that most modern compilers will\n * eliminate the function call and treat it as an unaligned access.\n *\n * - `XXH_FORCE_MEMORY_ACCESS=1`: `__attribute__((aligned(1)))`\n * @par\n * Depends on compiler extensions and is therefore not portable.\n * This method is safe _if_ your compiler supports it,\n * and *generally* as fast or faster than `memcpy`.\n *\n * - `XXH_FORCE_MEMORY_ACCESS=2`: Direct cast\n * @par\n * Casts directly and dereferences. This method doesn't depend on the\n * compiler, but it violates the C standard as it directly dereferences an\n * unaligned pointer. It can generate buggy code on targets which do not\n * support unaligned memory accesses, but in some circumstances, it's the\n * only known way to get the most performance.\n *\n * - `XXH_FORCE_MEMORY_ACCESS=3`: Byteshift\n * @par\n * Also portable. This can generate the best code on old compilers which don't\n * inline small `memcpy()` calls, and it might also be faster on big-endian\n * systems which lack a native byteswap instruction. However, some compilers\n * will emit literal byteshifts even if the target supports unaligned access.\n *\n *\n * @warning\n * Methods 1 and 2 rely on implementation-defined behavior. Use these with\n * care, as what works on one compiler/platform/optimization level may cause\n * another to read garbage data or even crash.\n *\n * See https://fastcompression.blogspot.com/2015/08/accessing-unaligned-memory.html for details.\n *\n * Prefer these methods in priority order (0 > 3 > 1 > 2)\n */\n# define XXH_FORCE_MEMORY_ACCESS 0\n\n/*!\n * @def XXH_SIZE_OPT\n * @brief Controls how much xxHash optimizes for size.\n *\n * xxHash, when compiled, tends to result in a rather large binary size. This\n * is mostly due to heavy usage to forced inlining and constant folding of the\n * @ref XXH3_family to increase performance.\n *\n * However, some developers prefer size over speed. This option can\n * significantly reduce the size of the generated code. When using the `-Os`\n * or `-Oz` options on GCC or Clang, this is defined to 1 by default,\n * otherwise it is defined to 0.\n *\n * Most of these size optimizations can be controlled manually.\n *\n * This is a number from 0-2.\n * - `XXH_SIZE_OPT` == 0: Default. xxHash makes no size optimizations. Speed\n * comes first.\n * - `XXH_SIZE_OPT` == 1: Default for `-Os` and `-Oz`. xxHash is more\n * conservative and disables hacks that increase code size. It implies the\n * options @ref XXH_NO_INLINE_HINTS == 1, @ref XXH_FORCE_ALIGN_CHECK == 0,\n * and @ref XXH3_NEON_LANES == 8 if they are not already defined.\n * - `XXH_SIZE_OPT` == 2: xxHash tries to make itself as small as possible.\n * Performance may cry. For example, the single shot functions just use the\n * streaming API.\n */\n# define XXH_SIZE_OPT 0\n\n/*!\n * @def XXH_FORCE_ALIGN_CHECK\n * @brief If defined to non-zero, adds a special path for aligned inputs (XXH32()\n * and XXH64() only).\n *\n * This is an important performance trick for architectures without decent\n * unaligned memory access performance.\n *\n * It checks for input alignment, and when conditions are met, uses a \"fast\n * path\" employing direct 32-bit/64-bit reads, resulting in _dramatically\n * faster_ read speed.\n *\n * The check costs one initial branch per hash, which is generally negligible,\n * but not zero.\n *\n * Moreover, it's not useful to generate an additional code path if memory\n * access uses the same instruction for both aligned and unaligned\n * addresses (e.g. x86 and aarch64).\n *\n * In these cases, the alignment check can be removed by setting this macro to 0.\n * Then the code will always use unaligned memory access.\n * Align check is automatically disabled on x86, x64, ARM64, and some ARM chips\n * which are platforms known to offer good unaligned memory accesses performance.\n *\n * It is also disabled by default when @ref XXH_SIZE_OPT >= 1.\n *\n * This option does not affect XXH3 (only XXH32 and XXH64).\n */\n# define XXH_FORCE_ALIGN_CHECK 0\n\n/*!\n * @def XXH_NO_INLINE_HINTS\n * @brief When non-zero, sets all functions to `static`.\n *\n * By default, xxHash tries to force the compiler to inline almost all internal\n * functions.\n *\n * This can usually improve performance due to reduced jumping and improved\n * constant folding, but significantly increases the size of the binary which\n * might not be favorable.\n *\n * Additionally, sometimes the forced inlining can be detrimental to performance,\n * depending on the architecture.\n *\n * XXH_NO_INLINE_HINTS marks all internal functions as static, giving the\n * compiler full control on whether to inline or not.\n *\n * When not optimizing (-O0), using `-fno-inline` with GCC or Clang, or if\n * @ref XXH_SIZE_OPT >= 1, this will automatically be defined.\n */\n# define XXH_NO_INLINE_HINTS 0\n\n/*!\n * @def XXH3_INLINE_SECRET\n * @brief Determines whether to inline the XXH3 withSecret code.\n *\n * When the secret size is known, the compiler can improve the performance\n * of XXH3_64bits_withSecret() and XXH3_128bits_withSecret().\n *\n * However, if the secret size is not known, it doesn't have any benefit. This\n * happens when xxHash is compiled into a global symbol. Therefore, if\n * @ref XXH_INLINE_ALL is *not* defined, this will be defined to 0.\n *\n * Additionally, this defaults to 0 on GCC 12+, which has an issue with function pointers\n * that are *sometimes* force inline on -Og, and it is impossible to automatically\n * detect this optimization level.\n */\n# define XXH3_INLINE_SECRET 0\n\n/*!\n * @def XXH32_ENDJMP\n * @brief Whether to use a jump for `XXH32_finalize`.\n *\n * For performance, `XXH32_finalize` uses multiple branches in the finalizer.\n * This is generally preferable for performance,\n * but depending on exact architecture, a jmp may be preferable.\n *\n * This setting is only possibly making a difference for very small inputs.\n */\n# define XXH32_ENDJMP 0\n\n/*!\n * @internal\n * @brief Redefines old internal names.\n *\n * For compatibility with code that uses xxHash's internals before the names\n * were changed to improve namespacing. There is no other reason to use this.\n */\n# define XXH_OLD_NAMES\n# undef XXH_OLD_NAMES /* don't actually use, it is ugly. */\n\n/*!\n * @def XXH_NO_STREAM\n * @brief Disables the streaming API.\n *\n * When xxHash is not inlined and the streaming functions are not used, disabling\n * the streaming functions can improve code size significantly, especially with\n * the @ref XXH3_family which tends to make constant folded copies of itself.\n */\n# define XXH_NO_STREAM\n# undef XXH_NO_STREAM /* don't actually */\n#endif /* XXH_DOXYGEN */\n/*!\n * @}\n */\n\n#ifndef XXH_FORCE_MEMORY_ACCESS /* can be defined externally, on command line for example */\n /* prefer __packed__ structures (method 1) for GCC\n * < ARMv7 with unaligned access (e.g. Raspbian armhf) still uses byte shifting, so we use memcpy\n * which for some reason does unaligned loads. */\n# if defined(__GNUC__) && !(defined(__ARM_ARCH) && __ARM_ARCH < 7 && defined(__ARM_FEATURE_UNALIGNED))\n# define XXH_FORCE_MEMORY_ACCESS 1\n# endif\n#endif\n\n#ifndef XXH_SIZE_OPT\n /* default to 1 for -Os or -Oz */\n# if (defined(__GNUC__) || defined(__clang__)) && defined(__OPTIMIZE_SIZE__)\n# define XXH_SIZE_OPT 1\n# else\n# define XXH_SIZE_OPT 0\n# endif\n#endif\n\n#ifndef XXH_FORCE_ALIGN_CHECK /* can be defined externally */\n /* don't check on sizeopt, x86, aarch64, or arm when unaligned access is available */\n# if XXH_SIZE_OPT >= 1 || \\\n defined(__i386) || defined(__x86_64__) || defined(__aarch64__) || defined(__ARM_FEATURE_UNALIGNED) \\\n || defined(_M_IX86) || defined(_M_X64) || defined(_M_ARM64) || defined(_M_ARM) /* visual */\n# define XXH_FORCE_ALIGN_CHECK 0\n# else\n# define XXH_FORCE_ALIGN_CHECK 1\n# endif\n#endif\n\n#ifndef XXH_NO_INLINE_HINTS\n# if XXH_SIZE_OPT >= 1 || defined(__NO_INLINE__) /* -O0, -fno-inline */\n# define XXH_NO_INLINE_HINTS 1\n# else\n# define XXH_NO_INLINE_HINTS 0\n# endif\n#endif\n\n#ifndef XXH3_INLINE_SECRET\n# if (defined(__GNUC__) && !defined(__clang__) && __GNUC__ >= 12) \\\n || !defined(XXH_INLINE_ALL)\n# define XXH3_INLINE_SECRET 0\n# else\n# define XXH3_INLINE_SECRET 1\n# endif\n#endif\n\n#ifndef XXH32_ENDJMP\n/* generally preferable for performance */\n# define XXH32_ENDJMP 0\n#endif\n\n/*!\n * @defgroup impl Implementation\n * @{\n */\n\n\n/* *************************************\n* Includes & Memory related functions\n***************************************/\n#if defined(XXH_NO_STREAM)\n/* nothing */\n#elif defined(XXH_NO_STDLIB)\n\n/* When requesting to disable any mention of stdlib,\n * the library loses the ability to invoked malloc / free.\n * In practice, it means that functions like `XXH*_createState()`\n * will always fail, and return NULL.\n * This flag is useful in situations where\n * xxhash.h is integrated into some kernel, embedded or limited environment\n * without access to dynamic allocation.\n */\n\nstatic XXH_CONSTF void* XXH_malloc(size_t s) { (void)s; return NULL; }\nstatic void XXH_free(void* p) { (void)p; }\n\n#else\n\n/*\n * Modify the local functions below should you wish to use\n * different memory routines for malloc() and free()\n */\n#include \n\n/*!\n * @internal\n * @brief Modify this function to use a different routine than malloc().\n */\nstatic XXH_MALLOCF void* XXH_malloc(size_t s) { return malloc(s); }\n\n/*!\n * @internal\n * @brief Modify this function to use a different routine than free().\n */\nstatic void XXH_free(void* p) { free(p); }\n\n#endif /* XXH_NO_STDLIB */\n\n#include \n\n/*!\n * @internal\n * @brief Modify this function to use a different routine than memcpy().\n */\nstatic void* XXH_memcpy(void* dest, const void* src, size_t size)\n{\n return memcpy(dest,src,size);\n}\n\n#include /* ULLONG_MAX */\n\n\n/* *************************************\n* Compiler Specific Options\n***************************************/\n#ifdef _MSC_VER /* Visual Studio warning fix */\n# pragma warning(disable : 4127) /* disable: C4127: conditional expression is constant */\n#endif\n\n#if XXH_NO_INLINE_HINTS /* disable inlining hints */\n# if defined(__GNUC__) || defined(__clang__)\n# define XXH_FORCE_INLINE static __attribute__((__unused__))\n# else\n# define XXH_FORCE_INLINE static\n# endif\n# define XXH_NO_INLINE static\n/* enable inlining hints */\n#elif defined(__GNUC__) || defined(__clang__)\n# define XXH_FORCE_INLINE static __inline__ __attribute__((__always_inline__, __unused__))\n# define XXH_NO_INLINE static __attribute__((__noinline__))\n#elif defined(_MSC_VER) /* Visual Studio */\n# define XXH_FORCE_INLINE static __forceinline\n# define XXH_NO_INLINE static __declspec(noinline)\n#elif defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) /* C99 */\n# define XXH_FORCE_INLINE static inline\n# define XXH_NO_INLINE static\n#else\n# define XXH_FORCE_INLINE static\n# define XXH_NO_INLINE static\n#endif\n\n#if defined(XXH_INLINE_ALL)\n# define XXH_STATIC XXH_FORCE_INLINE\n#else\n# define XXH_STATIC static\n#endif\n\n#if XXH3_INLINE_SECRET\n# define XXH3_WITH_SECRET_INLINE XXH_FORCE_INLINE\n#else\n# define XXH3_WITH_SECRET_INLINE XXH_NO_INLINE\n#endif\n\n#if ((defined(sun) || defined(__sun)) && __cplusplus) /* Solaris includes __STDC_VERSION__ with C++. Tested with GCC 5.5 */\n# define XXH_RESTRICT /* disable */\n#elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L /* >= C99 */\n# define XXH_RESTRICT restrict\n#elif (defined (__GNUC__) && ((__GNUC__ > 3) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1))) \\\n || (defined (__clang__)) \\\n || (defined (_MSC_VER) && (_MSC_VER >= 1400)) \\\n || (defined (__INTEL_COMPILER) && (__INTEL_COMPILER >= 1300))\n/*\n * There are a LOT more compilers that recognize __restrict but this\n * covers the major ones.\n */\n# define XXH_RESTRICT __restrict\n#else\n# define XXH_RESTRICT /* disable */\n#endif\n\n/* *************************************\n* Debug\n***************************************/\n/*!\n * @ingroup tuning\n * @def XXH_DEBUGLEVEL\n * @brief Sets the debugging level.\n *\n * XXH_DEBUGLEVEL is expected to be defined externally, typically via the\n * compiler's command line options. The value must be a number.\n */\n#ifndef XXH_DEBUGLEVEL\n# ifdef DEBUGLEVEL /* backwards compat */\n# define XXH_DEBUGLEVEL DEBUGLEVEL\n# else\n# define XXH_DEBUGLEVEL 0\n# endif\n#endif\n\n#if (XXH_DEBUGLEVEL>=1)\n# include /* note: can still be disabled with NDEBUG */\n# define XXH_ASSERT(c) assert(c)\n#else\n# if defined(__INTEL_COMPILER)\n# define XXH_ASSERT(c) XXH_ASSUME((unsigned char) (c))\n# else\n# define XXH_ASSERT(c) XXH_ASSUME(c)\n# endif\n#endif\n\n/* note: use after variable declarations */\n#ifndef XXH_STATIC_ASSERT\n# if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L) /* C11 */\n# define XXH_STATIC_ASSERT_WITH_MESSAGE(c,m) do { _Static_assert((c),m); } while(0)\n# elif defined(__cplusplus) && (__cplusplus >= 201103L) /* C++11 */\n# define XXH_STATIC_ASSERT_WITH_MESSAGE(c,m) do { static_assert((c),m); } while(0)\n# else\n# define XXH_STATIC_ASSERT_WITH_MESSAGE(c,m) do { struct xxh_sa { char x[(c) ? 1 : -1]; }; } while(0)\n# endif\n# define XXH_STATIC_ASSERT(c) XXH_STATIC_ASSERT_WITH_MESSAGE((c),#c)\n#endif\n\n/*!\n * @internal\n * @def XXH_COMPILER_GUARD(var)\n * @brief Used to prevent unwanted optimizations for @p var.\n *\n * It uses an empty GCC inline assembly statement with a register constraint\n * which forces @p var into a general purpose register (eg eax, ebx, ecx\n * on x86) and marks it as modified.\n *\n * This is used in a few places to avoid unwanted autovectorization (e.g.\n * XXH32_round()). All vectorization we want is explicit via intrinsics,\n * and _usually_ isn't wanted elsewhere.\n *\n * We also use it to prevent unwanted constant folding for AArch64 in\n * XXH3_initCustomSecret_scalar().\n */\n#if defined(__GNUC__) || defined(__clang__)\n# define XXH_COMPILER_GUARD(var) __asm__(\"\" : \"+r\" (var))\n#else\n# define XXH_COMPILER_GUARD(var) ((void)0)\n#endif\n\n/* Specifically for NEON vectors which use the \"w\" constraint, on\n * Clang. */\n#if defined(__clang__) && defined(__ARM_ARCH) && !defined(__wasm__)\n# define XXH_COMPILER_GUARD_CLANG_NEON(var) __asm__(\"\" : \"+w\" (var))\n#else\n# define XXH_COMPILER_GUARD_CLANG_NEON(var) ((void)0)\n#endif\n\n/* *************************************\n* Basic Types\n***************************************/\n#if !defined (__VMS) \\\n && (defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n# ifdef _AIX\n# include \n# else\n# include \n# endif\n typedef uint8_t xxh_u8;\n#else\n typedef unsigned char xxh_u8;\n#endif\ntypedef XXH32_hash_t xxh_u32;\n\n#ifdef XXH_OLD_NAMES\n# warning \"XXH_OLD_NAMES is planned to be removed starting v0.9. If the program depends on it, consider moving away from it by employing newer type names directly\"\n# define BYTE xxh_u8\n# define U8 xxh_u8\n# define U32 xxh_u32\n#endif\n\n/* *** Memory access *** */\n\n/*!\n * @internal\n * @fn xxh_u32 XXH_read32(const void* ptr)\n * @brief Reads an unaligned 32-bit integer from @p ptr in native endianness.\n *\n * Affected by @ref XXH_FORCE_MEMORY_ACCESS.\n *\n * @param ptr The pointer to read from.\n * @return The 32-bit native endian integer from the bytes at @p ptr.\n */\n\n/*!\n * @internal\n * @fn xxh_u32 XXH_readLE32(const void* ptr)\n * @brief Reads an unaligned 32-bit little endian integer from @p ptr.\n *\n * Affected by @ref XXH_FORCE_MEMORY_ACCESS.\n *\n * @param ptr The pointer to read from.\n * @return The 32-bit little endian integer from the bytes at @p ptr.\n */\n\n/*!\n * @internal\n * @fn xxh_u32 XXH_readBE32(const void* ptr)\n * @brief Reads an unaligned 32-bit big endian integer from @p ptr.\n *\n * Affected by @ref XXH_FORCE_MEMORY_ACCESS.\n *\n * @param ptr The pointer to read from.\n * @return The 32-bit big endian integer from the bytes at @p ptr.\n */\n\n/*!\n * @internal\n * @fn xxh_u32 XXH_readLE32_align(const void* ptr, XXH_alignment align)\n * @brief Like @ref XXH_readLE32(), but has an option for aligned reads.\n *\n * Affected by @ref XXH_FORCE_MEMORY_ACCESS.\n * Note that when @ref XXH_FORCE_ALIGN_CHECK == 0, the @p align parameter is\n * always @ref XXH_alignment::XXH_unaligned.\n *\n * @param ptr The pointer to read from.\n * @param align Whether @p ptr is aligned.\n * @pre\n * If @p align == @ref XXH_alignment::XXH_aligned, @p ptr must be 4 byte\n * aligned.\n * @return The 32-bit little endian integer from the bytes at @p ptr.\n */\n\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n/*\n * Manual byteshift. Best for old compilers which don't inline memcpy.\n * We actually directly use XXH_readLE32 and XXH_readBE32.\n */\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))\n\n/*\n * Force direct memory access. Only works on CPU which support unaligned memory\n * access in hardware.\n */\nstatic xxh_u32 XXH_read32(const void* memPtr) { return *(const xxh_u32*) memPtr; }\n\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))\n\n/*\n * __attribute__((aligned(1))) is supported by gcc and clang. Originally the\n * documentation claimed that it only increased the alignment, but actually it\n * can decrease it on gcc, clang, and icc:\n * https://gcc.gnu.org/bugzilla/show_bug.cgi?id=69502,\n * https://gcc.godbolt.org/z/xYez1j67Y.\n */\n#ifdef XXH_OLD_NAMES\ntypedef union { xxh_u32 u32; } __attribute__((__packed__)) unalign;\n#endif\nstatic xxh_u32 XXH_read32(const void* ptr)\n{\n typedef __attribute__((__aligned__(1))) xxh_u32 xxh_unalign32;\n return *((const xxh_unalign32*)ptr);\n}\n\n#else\n\n/*\n * Portable and safe solution. Generally efficient.\n * see: https://fastcompression.blogspot.com/2015/08/accessing-unaligned-memory.html\n */\nstatic xxh_u32 XXH_read32(const void* memPtr)\n{\n xxh_u32 val;\n XXH_memcpy(&val, memPtr, sizeof(val));\n return val;\n}\n\n#endif /* XXH_FORCE_DIRECT_MEMORY_ACCESS */\n\n\n/* *** Endianness *** */\n\n/*!\n * @ingroup tuning\n * @def XXH_CPU_LITTLE_ENDIAN\n * @brief Whether the target is little endian.\n *\n * Defined to 1 if the target is little endian, or 0 if it is big endian.\n * It can be defined externally, for example on the compiler command line.\n *\n * If it is not defined,\n * a runtime check (which is usually constant folded) is used instead.\n *\n * @note\n * This is not necessarily defined to an integer constant.\n *\n * @see XXH_isLittleEndian() for the runtime check.\n */\n#ifndef XXH_CPU_LITTLE_ENDIAN\n/*\n * Try to detect endianness automatically, to avoid the nonstandard behavior\n * in `XXH_isLittleEndian()`\n */\n# if defined(_WIN32) /* Windows is always little endian */ \\\n || defined(__LITTLE_ENDIAN__) \\\n || (defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__)\n# define XXH_CPU_LITTLE_ENDIAN 1\n# elif defined(__BIG_ENDIAN__) \\\n || (defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)\n# define XXH_CPU_LITTLE_ENDIAN 0\n# else\n/*!\n * @internal\n * @brief Runtime check for @ref XXH_CPU_LITTLE_ENDIAN.\n *\n * Most compilers will constant fold this.\n */\nstatic int XXH_isLittleEndian(void)\n{\n /*\n * Portable and well-defined behavior.\n * Don't use static: it is detrimental to performance.\n */\n const union { xxh_u32 u; xxh_u8 c[4]; } one = { 1 };\n return one.c[0];\n}\n# define XXH_CPU_LITTLE_ENDIAN XXH_isLittleEndian()\n# endif\n#endif\n\n\n\n\n/* ****************************************\n* Compiler-specific Functions and Macros\n******************************************/\n#define XXH_GCC_VERSION (__GNUC__ * 100 + __GNUC_MINOR__)\n\n#ifdef __has_builtin\n# define XXH_HAS_BUILTIN(x) __has_builtin(x)\n#else\n# define XXH_HAS_BUILTIN(x) 0\n#endif\n\n\n\n/*\n * C23 and future versions have standard \"unreachable()\".\n * Once it has been implemented reliably we can add it as an\n * additional case:\n *\n * ```\n * #if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= XXH_C23_VN)\n * # include \n * # ifdef unreachable\n * # define XXH_UNREACHABLE() unreachable()\n * # endif\n * #endif\n * ```\n *\n * Note C++23 also has std::unreachable() which can be detected\n * as follows:\n * ```\n * #if defined(__cpp_lib_unreachable) && (__cpp_lib_unreachable >= 202202L)\n * # include \n * # define XXH_UNREACHABLE() std::unreachable()\n * #endif\n * ```\n * NB: `__cpp_lib_unreachable` is defined in the `` header.\n * We don't use that as including `` in `extern \"C\"` blocks\n * doesn't work on GCC12\n */\n\n#if XXH_HAS_BUILTIN(__builtin_unreachable)\n# define XXH_UNREACHABLE() __builtin_unreachable()\n\n#elif defined(_MSC_VER)\n# define XXH_UNREACHABLE() __assume(0)\n\n#else\n# define XXH_UNREACHABLE()\n#endif\n\n#if XXH_HAS_BUILTIN(__builtin_assume)\n# define XXH_ASSUME(c) __builtin_assume(c)\n#else\n# define XXH_ASSUME(c) if (!(c)) { XXH_UNREACHABLE(); }\n#endif\n\n/*!\n * @internal\n * @def XXH_rotl32(x,r)\n * @brief 32-bit rotate left.\n *\n * @param x The 32-bit integer to be rotated.\n * @param r The number of bits to rotate.\n * @pre\n * @p r > 0 && @p r < 32\n * @note\n * @p x and @p r may be evaluated multiple times.\n * @return The rotated result.\n */\n#if !defined(NO_CLANG_BUILTIN) && XXH_HAS_BUILTIN(__builtin_rotateleft32) \\\n && XXH_HAS_BUILTIN(__builtin_rotateleft64)\n# define XXH_rotl32 __builtin_rotateleft32\n# define XXH_rotl64 __builtin_rotateleft64\n#elif XXH_HAS_BUILTIN(__builtin_stdc_rotate_left)\n# define XXH_rotl32 __builtin_stdc_rotate_left\n# define XXH_rotl64 __builtin_stdc_rotate_left\n/* Note: although _rotl exists for minGW (GCC under windows), performance seems poor */\n#elif defined(_MSC_VER)\n# define XXH_rotl32(x,r) _rotl(x,r)\n# define XXH_rotl64(x,r) _rotl64(x,r)\n#else\n# define XXH_rotl32(x,r) (((x) << (r)) | ((x) >> (32 - (r))))\n# define XXH_rotl64(x,r) (((x) << (r)) | ((x) >> (64 - (r))))\n#endif\n\n/*!\n * @internal\n * @fn xxh_u32 XXH_swap32(xxh_u32 x)\n * @brief A 32-bit byteswap.\n *\n * @param x The 32-bit integer to byteswap.\n * @return @p x, byteswapped.\n */\n#if defined(_MSC_VER) /* Visual Studio */\n# define XXH_swap32 _byteswap_ulong\n#elif XXH_GCC_VERSION >= 403\n# define XXH_swap32 __builtin_bswap32\n#else\nstatic xxh_u32 XXH_swap32 (xxh_u32 x)\n{\n return ((x << 24) & 0xff000000 ) |\n ((x << 8) & 0x00ff0000 ) |\n ((x >> 8) & 0x0000ff00 ) |\n ((x >> 24) & 0x000000ff );\n}\n#endif\n\n\n/* ***************************\n* Memory reads\n*****************************/\n\n/*!\n * @internal\n * @brief Enum to indicate whether a pointer is aligned.\n */\ntypedef enum {\n XXH_aligned, /*!< Aligned */\n XXH_unaligned /*!< Possibly unaligned */\n} XXH_alignment;\n\n/*\n * XXH_FORCE_MEMORY_ACCESS==3 is an endian-independent byteshift load.\n *\n * This is ideal for older compilers which don't inline memcpy.\n */\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n\nXXH_FORCE_INLINE xxh_u32 XXH_readLE32(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[0]\n | ((xxh_u32)bytePtr[1] << 8)\n | ((xxh_u32)bytePtr[2] << 16)\n | ((xxh_u32)bytePtr[3] << 24);\n}\n\nXXH_FORCE_INLINE xxh_u32 XXH_readBE32(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[3]\n | ((xxh_u32)bytePtr[2] << 8)\n | ((xxh_u32)bytePtr[1] << 16)\n | ((xxh_u32)bytePtr[0] << 24);\n}\n\n#else\nXXH_FORCE_INLINE xxh_u32 XXH_readLE32(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_read32(ptr) : XXH_swap32(XXH_read32(ptr));\n}\n\nstatic xxh_u32 XXH_readBE32(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_swap32(XXH_read32(ptr)) : XXH_read32(ptr);\n}\n#endif\n\nXXH_FORCE_INLINE xxh_u32\nXXH_readLE32_align(const void* ptr, XXH_alignment align)\n{\n if (align==XXH_unaligned) {\n return XXH_readLE32(ptr);\n } else {\n return XXH_CPU_LITTLE_ENDIAN ? *(const xxh_u32*)ptr : XXH_swap32(*(const xxh_u32*)ptr);\n }\n}\n\n\n/* *************************************\n* Misc\n***************************************/\n/*! @ingroup public */\nXXH_PUBLIC_API unsigned XXH_versionNumber (void) { return XXH_VERSION_NUMBER; }\n\n\n/* *******************************************************************\n* 32-bit hash functions\n*********************************************************************/\n/*!\n * @}\n * @defgroup XXH32_impl XXH32 implementation\n * @ingroup impl\n *\n * Details on the XXH32 implementation.\n * @{\n */\n /* #define instead of static const, to be used as initializers */\n#define XXH_PRIME32_1 0x9E3779B1U /*!< 0b10011110001101110111100110110001 */\n#define XXH_PRIME32_2 0x85EBCA77U /*!< 0b10000101111010111100101001110111 */\n#define XXH_PRIME32_3 0xC2B2AE3DU /*!< 0b11000010101100101010111000111101 */\n#define XXH_PRIME32_4 0x27D4EB2FU /*!< 0b00100111110101001110101100101111 */\n#define XXH_PRIME32_5 0x165667B1U /*!< 0b00010110010101100110011110110001 */\n\n#ifdef XXH_OLD_NAMES\n# define PRIME32_1 XXH_PRIME32_1\n# define PRIME32_2 XXH_PRIME32_2\n# define PRIME32_3 XXH_PRIME32_3\n# define PRIME32_4 XXH_PRIME32_4\n# define PRIME32_5 XXH_PRIME32_5\n#endif\n\n/*!\n * @internal\n * @brief Normal stripe processing routine.\n *\n * This shuffles the bits so that any bit from @p input impacts several bits in\n * @p acc.\n *\n * @param acc The accumulator lane.\n * @param input The stripe of input to mix.\n * @return The mixed accumulator lane.\n */\nstatic xxh_u32 XXH32_round(xxh_u32 acc, xxh_u32 input)\n{\n acc += input * XXH_PRIME32_2;\n acc = XXH_rotl32(acc, 13);\n acc *= XXH_PRIME32_1;\n#if (defined(__SSE4_1__) || defined(__aarch64__) || defined(__wasm_simd128__)) && !defined(XXH_ENABLE_AUTOVECTORIZE)\n /*\n * UGLY HACK:\n * A compiler fence is used to prevent GCC and Clang from\n * autovectorizing the XXH32 loop (pragmas and attributes don't work for some\n * reason) without globally disabling SSE4.1.\n *\n * The reason we want to avoid vectorization is because despite working on\n * 4 integers at a time, there are multiple factors slowing XXH32 down on\n * SSE4:\n * - There's a ridiculous amount of lag from pmulld (10 cycles of latency on\n * newer chips!) making it slightly slower to multiply four integers at\n * once compared to four integers independently. Even when pmulld was\n * fastest, Sandy/Ivy Bridge, it is still not worth it to go into SSE\n * just to multiply unless doing a long operation.\n *\n * - Four instructions are required to rotate,\n * movqda tmp, v // not required with VEX encoding\n * pslld tmp, 13 // tmp <<= 13\n * psrld v, 19 // x >>= 19\n * por v, tmp // x |= tmp\n * compared to one for scalar:\n * roll v, 13 // reliably fast across the board\n * shldl v, v, 13 // Sandy Bridge and later prefer this for some reason\n *\n * - Instruction level parallelism is actually more beneficial here because\n * the SIMD actually serializes this operation: While v1 is rotating, v2\n * can load data, while v3 can multiply. SSE forces them to operate\n * together.\n *\n * This is also enabled on AArch64, as Clang is *very aggressive* in vectorizing\n * the loop. NEON is only faster on the A53, and with the newer cores, it is less\n * than half the speed.\n *\n * Additionally, this is used on WASM SIMD128 because it JITs to the same\n * SIMD instructions and has the same issue.\n */\n XXH_COMPILER_GUARD(acc);\n#endif\n return acc;\n}\n\n/*!\n * @internal\n * @brief Mixes all bits to finalize the hash.\n *\n * The final mix ensures that all input bits have a chance to impact any bit in\n * the output digest, resulting in an unbiased distribution.\n *\n * @param hash The hash to avalanche.\n * @return The avalanched hash.\n */\nstatic xxh_u32 XXH32_avalanche(xxh_u32 hash)\n{\n hash ^= hash >> 15;\n hash *= XXH_PRIME32_2;\n hash ^= hash >> 13;\n hash *= XXH_PRIME32_3;\n hash ^= hash >> 16;\n return hash;\n}\n\n#define XXH_get32bits(p) XXH_readLE32_align(p, align)\n\n/*!\n * @internal\n * @brief Sets up the initial accumulator state for XXH32().\n */\nXXH_FORCE_INLINE void\nXXH32_initAccs(xxh_u32 *acc, xxh_u32 seed)\n{\n XXH_ASSERT(acc != NULL);\n acc[0] = seed + XXH_PRIME32_1 + XXH_PRIME32_2;\n acc[1] = seed + XXH_PRIME32_2;\n acc[2] = seed + 0;\n acc[3] = seed - XXH_PRIME32_1;\n}\n\n/*!\n * @internal\n * @brief Consumes a block of data for XXH32().\n *\n * @return the end input pointer.\n */\nXXH_FORCE_INLINE const xxh_u8 *\nXXH32_consumeLong(\n xxh_u32 *XXH_RESTRICT acc,\n xxh_u8 const *XXH_RESTRICT input,\n size_t len,\n XXH_alignment align\n)\n{\n const xxh_u8* const bEnd = input + len;\n const xxh_u8* const limit = bEnd - 15;\n XXH_ASSERT(acc != NULL);\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(len >= 16);\n do {\n acc[0] = XXH32_round(acc[0], XXH_get32bits(input)); input += 4;\n acc[1] = XXH32_round(acc[1], XXH_get32bits(input)); input += 4;\n acc[2] = XXH32_round(acc[2], XXH_get32bits(input)); input += 4;\n acc[3] = XXH32_round(acc[3], XXH_get32bits(input)); input += 4;\n } while (input < limit);\n\n return input;\n}\n\n/*!\n * @internal\n * @brief Merges the accumulator lanes together for XXH32()\n */\nXXH_FORCE_INLINE XXH_PUREF xxh_u32\nXXH32_mergeAccs(const xxh_u32 *acc)\n{\n XXH_ASSERT(acc != NULL);\n return XXH_rotl32(acc[0], 1) + XXH_rotl32(acc[1], 7)\n + XXH_rotl32(acc[2], 12) + XXH_rotl32(acc[3], 18);\n}\n\n/*!\n * @internal\n * @brief Processes the last 0-15 bytes of @p ptr.\n *\n * There may be up to 15 bytes remaining to consume from the input.\n * This final stage will digest them to ensure that all input bytes are present\n * in the final mix.\n *\n * @param hash The hash to finalize.\n * @param ptr The pointer to the remaining input.\n * @param len The remaining length, modulo 16.\n * @param align Whether @p ptr is aligned.\n * @return The finalized hash.\n * @see XXH64_finalize().\n */\nstatic XXH_PUREF xxh_u32\nXXH32_finalize(xxh_u32 hash, const xxh_u8* ptr, size_t len, XXH_alignment align)\n{\n#define XXH_PROCESS1 do { \\\n hash += (*ptr++) * XXH_PRIME32_5; \\\n hash = XXH_rotl32(hash, 11) * XXH_PRIME32_1; \\\n} while (0)\n\n#define XXH_PROCESS4 do { \\\n hash += XXH_get32bits(ptr) * XXH_PRIME32_3; \\\n ptr += 4; \\\n hash = XXH_rotl32(hash, 17) * XXH_PRIME32_4; \\\n} while (0)\n\n if (ptr==NULL) XXH_ASSERT(len == 0);\n\n /* Compact rerolled version; generally faster */\n if (!XXH32_ENDJMP) {\n len &= 15;\n while (len >= 4) {\n XXH_PROCESS4;\n len -= 4;\n }\n while (len > 0) {\n XXH_PROCESS1;\n --len;\n }\n return XXH32_avalanche(hash);\n } else {\n switch(len&15) /* or switch(bEnd - p) */ {\n case 12: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 8: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 4: XXH_PROCESS4;\n return XXH32_avalanche(hash);\n\n case 13: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 9: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 5: XXH_PROCESS4;\n XXH_PROCESS1;\n return XXH32_avalanche(hash);\n\n case 14: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 10: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 6: XXH_PROCESS4;\n XXH_PROCESS1;\n XXH_PROCESS1;\n return XXH32_avalanche(hash);\n\n case 15: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 11: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 7: XXH_PROCESS4;\n XXH_FALLTHROUGH; /* fallthrough */\n case 3: XXH_PROCESS1;\n XXH_FALLTHROUGH; /* fallthrough */\n case 2: XXH_PROCESS1;\n XXH_FALLTHROUGH; /* fallthrough */\n case 1: XXH_PROCESS1;\n XXH_FALLTHROUGH; /* fallthrough */\n case 0: return XXH32_avalanche(hash);\n }\n XXH_ASSERT(0);\n return hash; /* reaching this point is deemed impossible */\n }\n}\n\n#ifdef XXH_OLD_NAMES\n# define PROCESS1 XXH_PROCESS1\n# define PROCESS4 XXH_PROCESS4\n#else\n# undef XXH_PROCESS1\n# undef XXH_PROCESS4\n#endif\n\n/*!\n * @internal\n * @brief The implementation for @ref XXH32().\n *\n * @param input , len , seed Directly passed from @ref XXH32().\n * @param align Whether @p input is aligned.\n * @return The calculated hash.\n */\nXXH_FORCE_INLINE XXH_PUREF xxh_u32\nXXH32_endian_align(const xxh_u8* input, size_t len, xxh_u32 seed, XXH_alignment align)\n{\n xxh_u32 h32;\n\n if (input==NULL) XXH_ASSERT(len == 0);\n\n if (len>=16) {\n xxh_u32 acc[4];\n XXH32_initAccs(acc, seed);\n\n input = XXH32_consumeLong(acc, input, len, align);\n\n h32 = XXH32_mergeAccs(acc);\n } else {\n h32 = seed + XXH_PRIME32_5;\n }\n\n h32 += (xxh_u32)len;\n\n return XXH32_finalize(h32, input, len&15, align);\n}\n\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API XXH32_hash_t XXH32 (const void* input, size_t len, XXH32_hash_t seed)\n{\n#if !defined(XXH_NO_STREAM) && XXH_SIZE_OPT >= 2\n /* Simple version, good for code maintenance, but unfortunately slow for small inputs */\n XXH32_state_t state;\n XXH32_reset(&state, seed);\n XXH32_update(&state, (const xxh_u8*)input, len);\n return XXH32_digest(&state);\n#else\n if (XXH_FORCE_ALIGN_CHECK) {\n if ((((size_t)input) & 3) == 0) { /* Input is 4-bytes aligned, leverage the speed benefit */\n return XXH32_endian_align((const xxh_u8*)input, len, seed, XXH_aligned);\n } }\n\n return XXH32_endian_align((const xxh_u8*)input, len, seed, XXH_unaligned);\n#endif\n}\n\n\n\n/******* Hash streaming *******/\n#ifndef XXH_NO_STREAM\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API XXH32_state_t* XXH32_createState(void)\n{\n return (XXH32_state_t*)XXH_malloc(sizeof(XXH32_state_t));\n}\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API XXH_errorcode XXH32_freeState(XXH32_state_t* statePtr)\n{\n XXH_free(statePtr);\n return XXH_OK;\n}\n\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API void XXH32_copyState(XXH32_state_t* dstState, const XXH32_state_t* srcState)\n{\n XXH_memcpy(dstState, srcState, sizeof(*dstState));\n}\n\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API XXH_errorcode XXH32_reset(XXH32_state_t* statePtr, XXH32_hash_t seed)\n{\n XXH_ASSERT(statePtr != NULL);\n memset(statePtr, 0, sizeof(*statePtr));\n XXH32_initAccs(statePtr->acc, seed);\n return XXH_OK;\n}\n\n\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH32_update(XXH32_state_t* state, const void* input, size_t len)\n{\n if (input==NULL) {\n XXH_ASSERT(len == 0);\n return XXH_OK;\n }\n\n state->total_len_32 += (XXH32_hash_t)len;\n state->large_len |= (XXH32_hash_t)((len>=16) | (state->total_len_32>=16));\n\n XXH_ASSERT(state->bufferedSize < sizeof(state->buffer));\n if (len < sizeof(state->buffer) - state->bufferedSize) { /* fill in tmp buffer */\n XXH_memcpy(state->buffer + state->bufferedSize, input, len);\n state->bufferedSize += (XXH32_hash_t)len;\n return XXH_OK;\n }\n\n { const xxh_u8* xinput = (const xxh_u8*)input;\n const xxh_u8* const bEnd = xinput + len;\n\n if (state->bufferedSize) { /* non-empty buffer: complete first */\n XXH_memcpy(state->buffer + state->bufferedSize, xinput, sizeof(state->buffer) - state->bufferedSize);\n xinput += sizeof(state->buffer) - state->bufferedSize;\n /* then process one round */\n (void)XXH32_consumeLong(state->acc, state->buffer, sizeof(state->buffer), XXH_aligned);\n state->bufferedSize = 0;\n }\n\n XXH_ASSERT(xinput <= bEnd);\n if ((size_t)(bEnd - xinput) >= sizeof(state->buffer)) {\n /* Process the remaining data */\n xinput = XXH32_consumeLong(state->acc, xinput, (size_t)(bEnd - xinput), XXH_unaligned);\n }\n\n if (xinput < bEnd) {\n /* Copy the leftover to the tmp buffer */\n XXH_memcpy(state->buffer, xinput, (size_t)(bEnd-xinput));\n state->bufferedSize = (unsigned)(bEnd-xinput);\n }\n }\n\n return XXH_OK;\n}\n\n\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API XXH32_hash_t XXH32_digest(const XXH32_state_t* state)\n{\n xxh_u32 h32;\n\n if (state->large_len) {\n h32 = XXH32_mergeAccs(state->acc);\n } else {\n h32 = state->acc[2] /* == seed */ + XXH_PRIME32_5;\n }\n\n h32 += state->total_len_32;\n\n return XXH32_finalize(h32, state->buffer, state->bufferedSize, XXH_aligned);\n}\n#endif /* !XXH_NO_STREAM */\n\n/******* Canonical representation *******/\n\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API void XXH32_canonicalFromHash(XXH32_canonical_t* dst, XXH32_hash_t hash)\n{\n XXH_STATIC_ASSERT(sizeof(XXH32_canonical_t) == sizeof(XXH32_hash_t));\n if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap32(hash);\n XXH_memcpy(dst, &hash, sizeof(*dst));\n}\n/*! @ingroup XXH32_family */\nXXH_PUBLIC_API XXH32_hash_t XXH32_hashFromCanonical(const XXH32_canonical_t* src)\n{\n return XXH_readBE32(src);\n}\n\n\n#ifndef XXH_NO_LONG_LONG\n\n/* *******************************************************************\n* 64-bit hash functions\n*********************************************************************/\n/*!\n * @}\n * @ingroup impl\n * @{\n */\n/******* Memory access *******/\n\ntypedef XXH64_hash_t xxh_u64;\n\n#ifdef XXH_OLD_NAMES\n# define U64 xxh_u64\n#endif\n\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n/*\n * Manual byteshift. Best for old compilers which don't inline memcpy.\n * We actually directly use XXH_readLE64 and XXH_readBE64.\n */\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==2))\n\n/* Force direct memory access. Only works on CPU which support unaligned memory access in hardware */\nstatic xxh_u64 XXH_read64(const void* memPtr)\n{\n return *(const xxh_u64*) memPtr;\n}\n\n#elif (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==1))\n\n/*\n * __attribute__((aligned(1))) is supported by gcc and clang. Originally the\n * documentation claimed that it only increased the alignment, but actually it\n * can decrease it on gcc, clang, and icc:\n * https://gcc.gnu.org/bugzilla/show_bug.cgi?id=69502,\n * https://gcc.godbolt.org/z/xYez1j67Y.\n */\n#ifdef XXH_OLD_NAMES\ntypedef union { xxh_u32 u32; xxh_u64 u64; } __attribute__((__packed__)) unalign64;\n#endif\nstatic xxh_u64 XXH_read64(const void* ptr)\n{\n typedef __attribute__((__aligned__(1))) xxh_u64 xxh_unalign64;\n return *((const xxh_unalign64*)ptr);\n}\n\n#else\n\n/*\n * Portable and safe solution. Generally efficient.\n * see: https://fastcompression.blogspot.com/2015/08/accessing-unaligned-memory.html\n */\nstatic xxh_u64 XXH_read64(const void* memPtr)\n{\n xxh_u64 val;\n XXH_memcpy(&val, memPtr, sizeof(val));\n return val;\n}\n\n#endif /* XXH_FORCE_DIRECT_MEMORY_ACCESS */\n\n#if defined(_MSC_VER) /* Visual Studio */\n# define XXH_swap64 _byteswap_uint64\n#elif XXH_GCC_VERSION >= 403\n# define XXH_swap64 __builtin_bswap64\n#else\nstatic xxh_u64 XXH_swap64(xxh_u64 x)\n{\n return ((x << 56) & 0xff00000000000000ULL) |\n ((x << 40) & 0x00ff000000000000ULL) |\n ((x << 24) & 0x0000ff0000000000ULL) |\n ((x << 8) & 0x000000ff00000000ULL) |\n ((x >> 8) & 0x00000000ff000000ULL) |\n ((x >> 24) & 0x0000000000ff0000ULL) |\n ((x >> 40) & 0x000000000000ff00ULL) |\n ((x >> 56) & 0x00000000000000ffULL);\n}\n#endif\n\n\n/* XXH_FORCE_MEMORY_ACCESS==3 is an endian-independent byteshift load. */\n#if (defined(XXH_FORCE_MEMORY_ACCESS) && (XXH_FORCE_MEMORY_ACCESS==3))\n\nXXH_FORCE_INLINE xxh_u64 XXH_readLE64(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[0]\n | ((xxh_u64)bytePtr[1] << 8)\n | ((xxh_u64)bytePtr[2] << 16)\n | ((xxh_u64)bytePtr[3] << 24)\n | ((xxh_u64)bytePtr[4] << 32)\n | ((xxh_u64)bytePtr[5] << 40)\n | ((xxh_u64)bytePtr[6] << 48)\n | ((xxh_u64)bytePtr[7] << 56);\n}\n\nXXH_FORCE_INLINE xxh_u64 XXH_readBE64(const void* memPtr)\n{\n const xxh_u8* bytePtr = (const xxh_u8 *)memPtr;\n return bytePtr[7]\n | ((xxh_u64)bytePtr[6] << 8)\n | ((xxh_u64)bytePtr[5] << 16)\n | ((xxh_u64)bytePtr[4] << 24)\n | ((xxh_u64)bytePtr[3] << 32)\n | ((xxh_u64)bytePtr[2] << 40)\n | ((xxh_u64)bytePtr[1] << 48)\n | ((xxh_u64)bytePtr[0] << 56);\n}\n\n#else\nXXH_FORCE_INLINE xxh_u64 XXH_readLE64(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_read64(ptr) : XXH_swap64(XXH_read64(ptr));\n}\n\nstatic xxh_u64 XXH_readBE64(const void* ptr)\n{\n return XXH_CPU_LITTLE_ENDIAN ? XXH_swap64(XXH_read64(ptr)) : XXH_read64(ptr);\n}\n#endif\n\nXXH_FORCE_INLINE xxh_u64\nXXH_readLE64_align(const void* ptr, XXH_alignment align)\n{\n if (align==XXH_unaligned)\n return XXH_readLE64(ptr);\n else\n return XXH_CPU_LITTLE_ENDIAN ? *(const xxh_u64*)ptr : XXH_swap64(*(const xxh_u64*)ptr);\n}\n\n\n/******* xxh64 *******/\n/*!\n * @}\n * @defgroup XXH64_impl XXH64 implementation\n * @ingroup impl\n *\n * Details on the XXH64 implementation.\n * @{\n */\n/* #define rather that static const, to be used as initializers */\n#define XXH_PRIME64_1 0x9E3779B185EBCA87ULL /*!< 0b1001111000110111011110011011000110000101111010111100101010000111 */\n#define XXH_PRIME64_2 0xC2B2AE3D27D4EB4FULL /*!< 0b1100001010110010101011100011110100100111110101001110101101001111 */\n#define XXH_PRIME64_3 0x165667B19E3779F9ULL /*!< 0b0001011001010110011001111011000110011110001101110111100111111001 */\n#define XXH_PRIME64_4 0x85EBCA77C2B2AE63ULL /*!< 0b1000010111101011110010100111011111000010101100101010111001100011 */\n#define XXH_PRIME64_5 0x27D4EB2F165667C5ULL /*!< 0b0010011111010100111010110010111100010110010101100110011111000101 */\n\n#ifdef XXH_OLD_NAMES\n# define PRIME64_1 XXH_PRIME64_1\n# define PRIME64_2 XXH_PRIME64_2\n# define PRIME64_3 XXH_PRIME64_3\n# define PRIME64_4 XXH_PRIME64_4\n# define PRIME64_5 XXH_PRIME64_5\n#endif\n\n/*! @copydoc XXH32_round */\nstatic xxh_u64 XXH64_round(xxh_u64 acc, xxh_u64 input)\n{\n acc += input * XXH_PRIME64_2;\n acc = XXH_rotl64(acc, 31);\n acc *= XXH_PRIME64_1;\n#if (defined(__AVX512F__)) && !defined(XXH_ENABLE_AUTOVECTORIZE)\n /*\n * DISABLE AUTOVECTORIZATION:\n * A compiler fence is used to prevent GCC and Clang from\n * autovectorizing the XXH64 loop (pragmas and attributes don't work for some\n * reason) without globally disabling AVX512.\n *\n * Autovectorization of XXH64 tends to be detrimental,\n * though the exact outcome may change depending on exact cpu and compiler version.\n * For information, it has been reported as detrimental for Skylake-X,\n * but possibly beneficial for Zen4.\n *\n * The default is to disable auto-vectorization,\n * but you can select to enable it instead using `XXH_ENABLE_AUTOVECTORIZE` build variable.\n */\n XXH_COMPILER_GUARD(acc);\n#endif\n return acc;\n}\n\nstatic xxh_u64 XXH64_mergeRound(xxh_u64 acc, xxh_u64 val)\n{\n val = XXH64_round(0, val);\n acc ^= val;\n acc = acc * XXH_PRIME64_1 + XXH_PRIME64_4;\n return acc;\n}\n\n/*! @copydoc XXH32_avalanche */\nstatic xxh_u64 XXH64_avalanche(xxh_u64 hash)\n{\n hash ^= hash >> 33;\n hash *= XXH_PRIME64_2;\n hash ^= hash >> 29;\n hash *= XXH_PRIME64_3;\n hash ^= hash >> 32;\n return hash;\n}\n\n\n#define XXH_get64bits(p) XXH_readLE64_align(p, align)\n\n/*!\n * @internal\n * @brief Sets up the initial accumulator state for XXH64().\n */\nXXH_FORCE_INLINE void\nXXH64_initAccs(xxh_u64 *acc, xxh_u64 seed)\n{\n XXH_ASSERT(acc != NULL);\n acc[0] = seed + XXH_PRIME64_1 + XXH_PRIME64_2;\n acc[1] = seed + XXH_PRIME64_2;\n acc[2] = seed + 0;\n acc[3] = seed - XXH_PRIME64_1;\n}\n\n/*!\n * @internal\n * @brief Consumes a block of data for XXH64().\n *\n * @return the end input pointer.\n */\nXXH_FORCE_INLINE const xxh_u8 *\nXXH64_consumeLong(\n xxh_u64 *XXH_RESTRICT acc,\n xxh_u8 const *XXH_RESTRICT input,\n size_t len,\n XXH_alignment align\n)\n{\n const xxh_u8* const bEnd = input + len;\n const xxh_u8* const limit = bEnd - 31;\n XXH_ASSERT(acc != NULL);\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(len >= 32);\n do {\n /* reroll on 32-bit */\n if (sizeof(void *) < sizeof(xxh_u64)) {\n size_t i;\n for (i = 0; i < 4; i++) {\n acc[i] = XXH64_round(acc[i], XXH_get64bits(input));\n input += 8;\n }\n } else {\n acc[0] = XXH64_round(acc[0], XXH_get64bits(input)); input += 8;\n acc[1] = XXH64_round(acc[1], XXH_get64bits(input)); input += 8;\n acc[2] = XXH64_round(acc[2], XXH_get64bits(input)); input += 8;\n acc[3] = XXH64_round(acc[3], XXH_get64bits(input)); input += 8;\n }\n } while (input < limit);\n\n return input;\n}\n\n/*!\n * @internal\n * @brief Merges the accumulator lanes together for XXH64()\n */\nXXH_FORCE_INLINE XXH_PUREF xxh_u64\nXXH64_mergeAccs(const xxh_u64 *acc)\n{\n XXH_ASSERT(acc != NULL);\n {\n xxh_u64 h64 = XXH_rotl64(acc[0], 1) + XXH_rotl64(acc[1], 7)\n + XXH_rotl64(acc[2], 12) + XXH_rotl64(acc[3], 18);\n /* reroll on 32-bit */\n if (sizeof(void *) < sizeof(xxh_u64)) {\n size_t i;\n for (i = 0; i < 4; i++) {\n h64 = XXH64_mergeRound(h64, acc[i]);\n }\n } else {\n h64 = XXH64_mergeRound(h64, acc[0]);\n h64 = XXH64_mergeRound(h64, acc[1]);\n h64 = XXH64_mergeRound(h64, acc[2]);\n h64 = XXH64_mergeRound(h64, acc[3]);\n }\n return h64;\n }\n}\n\n/*!\n * @internal\n * @brief Processes the last 0-31 bytes of @p ptr.\n *\n * There may be up to 31 bytes remaining to consume from the input.\n * This final stage will digest them to ensure that all input bytes are present\n * in the final mix.\n *\n * @param hash The hash to finalize.\n * @param ptr The pointer to the remaining input.\n * @param len The remaining length, modulo 32.\n * @param align Whether @p ptr is aligned.\n * @return The finalized hash\n * @see XXH32_finalize().\n */\nXXH_STATIC XXH_PUREF xxh_u64\nXXH64_finalize(xxh_u64 hash, const xxh_u8* ptr, size_t len, XXH_alignment align)\n{\n if (ptr==NULL) XXH_ASSERT(len == 0);\n len &= 31;\n while (len >= 8) {\n xxh_u64 const k1 = XXH64_round(0, XXH_get64bits(ptr));\n ptr += 8;\n hash ^= k1;\n hash = XXH_rotl64(hash,27) * XXH_PRIME64_1 + XXH_PRIME64_4;\n len -= 8;\n }\n if (len >= 4) {\n hash ^= (xxh_u64)(XXH_get32bits(ptr)) * XXH_PRIME64_1;\n ptr += 4;\n hash = XXH_rotl64(hash, 23) * XXH_PRIME64_2 + XXH_PRIME64_3;\n len -= 4;\n }\n while (len > 0) {\n hash ^= (*ptr++) * XXH_PRIME64_5;\n hash = XXH_rotl64(hash, 11) * XXH_PRIME64_1;\n --len;\n }\n return XXH64_avalanche(hash);\n}\n\n#ifdef XXH_OLD_NAMES\n# define PROCESS1_64 XXH_PROCESS1_64\n# define PROCESS4_64 XXH_PROCESS4_64\n# define PROCESS8_64 XXH_PROCESS8_64\n#else\n# undef XXH_PROCESS1_64\n# undef XXH_PROCESS4_64\n# undef XXH_PROCESS8_64\n#endif\n\n/*!\n * @internal\n * @brief The implementation for @ref XXH64().\n *\n * @param input , len , seed Directly passed from @ref XXH64().\n * @param align Whether @p input is aligned.\n * @return The calculated hash.\n */\nXXH_FORCE_INLINE XXH_PUREF xxh_u64\nXXH64_endian_align(const xxh_u8* input, size_t len, xxh_u64 seed, XXH_alignment align)\n{\n xxh_u64 h64;\n if (input==NULL) XXH_ASSERT(len == 0);\n\n if (len>=32) { /* Process a large block of data */\n xxh_u64 acc[4];\n XXH64_initAccs(acc, seed);\n\n input = XXH64_consumeLong(acc, input, len, align);\n\n h64 = XXH64_mergeAccs(acc);\n } else {\n h64 = seed + XXH_PRIME64_5;\n }\n\n h64 += (xxh_u64) len;\n\n return XXH64_finalize(h64, input, len, align);\n}\n\n\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API XXH64_hash_t XXH64 (XXH_NOESCAPE const void* input, size_t len, XXH64_hash_t seed)\n{\n#if !defined(XXH_NO_STREAM) && XXH_SIZE_OPT >= 2\n /* Simple version, good for code maintenance, but unfortunately slow for small inputs */\n XXH64_state_t state;\n XXH64_reset(&state, seed);\n XXH64_update(&state, (const xxh_u8*)input, len);\n return XXH64_digest(&state);\n#else\n if (XXH_FORCE_ALIGN_CHECK) {\n if ((((size_t)input) & 7)==0) { /* Input is aligned, let's leverage the speed advantage */\n return XXH64_endian_align((const xxh_u8*)input, len, seed, XXH_aligned);\n } }\n\n return XXH64_endian_align((const xxh_u8*)input, len, seed, XXH_unaligned);\n\n#endif\n}\n\n/******* Hash Streaming *******/\n#ifndef XXH_NO_STREAM\n/*! @ingroup XXH64_family*/\nXXH_PUBLIC_API XXH64_state_t* XXH64_createState(void)\n{\n return (XXH64_state_t*)XXH_malloc(sizeof(XXH64_state_t));\n}\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API XXH_errorcode XXH64_freeState(XXH64_state_t* statePtr)\n{\n XXH_free(statePtr);\n return XXH_OK;\n}\n\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API void XXH64_copyState(XXH_NOESCAPE XXH64_state_t* dstState, const XXH64_state_t* srcState)\n{\n XXH_memcpy(dstState, srcState, sizeof(*dstState));\n}\n\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API XXH_errorcode XXH64_reset(XXH_NOESCAPE XXH64_state_t* statePtr, XXH64_hash_t seed)\n{\n XXH_ASSERT(statePtr != NULL);\n memset(statePtr, 0, sizeof(*statePtr));\n XXH64_initAccs(statePtr->acc, seed);\n return XXH_OK;\n}\n\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH64_update (XXH_NOESCAPE XXH64_state_t* state, XXH_NOESCAPE const void* input, size_t len)\n{\n if (input==NULL) {\n XXH_ASSERT(len == 0);\n return XXH_OK;\n }\n\n state->total_len += len;\n\n XXH_ASSERT(state->bufferedSize <= sizeof(state->buffer));\n if (len < sizeof(state->buffer) - state->bufferedSize) { /* fill in tmp buffer */\n XXH_memcpy(state->buffer + state->bufferedSize, input, len);\n state->bufferedSize += (XXH32_hash_t)len;\n return XXH_OK;\n }\n\n { const xxh_u8* xinput = (const xxh_u8*)input;\n const xxh_u8* const bEnd = xinput + len;\n\n if (state->bufferedSize) { /* non-empty buffer => complete first */\n XXH_memcpy(state->buffer + state->bufferedSize, xinput, sizeof(state->buffer) - state->bufferedSize);\n xinput += sizeof(state->buffer) - state->bufferedSize;\n /* and process one round */\n (void)XXH64_consumeLong(state->acc, state->buffer, sizeof(state->buffer), XXH_aligned);\n state->bufferedSize = 0;\n }\n\n XXH_ASSERT(xinput <= bEnd);\n if ((size_t)(bEnd - xinput) >= sizeof(state->buffer)) {\n /* Process the remaining data */\n xinput = XXH64_consumeLong(state->acc, xinput, (size_t)(bEnd - xinput), XXH_unaligned);\n }\n\n if (xinput < bEnd) {\n /* Copy the leftover to the tmp buffer */\n XXH_memcpy(state->buffer, xinput, (size_t)(bEnd-xinput));\n state->bufferedSize = (unsigned)(bEnd-xinput);\n }\n }\n\n return XXH_OK;\n}\n\n\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API XXH64_hash_t XXH64_digest(XXH_NOESCAPE const XXH64_state_t* state)\n{\n xxh_u64 h64;\n\n if (state->total_len >= 32) {\n h64 = XXH64_mergeAccs(state->acc);\n } else {\n h64 = state->acc[2] /*seed*/ + XXH_PRIME64_5;\n }\n\n h64 += (xxh_u64) state->total_len;\n\n return XXH64_finalize(h64, state->buffer, (size_t)state->total_len, XXH_aligned);\n}\n#endif /* !XXH_NO_STREAM */\n\n/******* Canonical representation *******/\n\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API void XXH64_canonicalFromHash(XXH_NOESCAPE XXH64_canonical_t* dst, XXH64_hash_t hash)\n{\n XXH_STATIC_ASSERT(sizeof(XXH64_canonical_t) == sizeof(XXH64_hash_t));\n if (XXH_CPU_LITTLE_ENDIAN) hash = XXH_swap64(hash);\n XXH_memcpy(dst, &hash, sizeof(*dst));\n}\n\n/*! @ingroup XXH64_family */\nXXH_PUBLIC_API XXH64_hash_t XXH64_hashFromCanonical(XXH_NOESCAPE const XXH64_canonical_t* src)\n{\n return XXH_readBE64(src);\n}\n\n#ifndef XXH_NO_XXH3\n\n/* *********************************************************************\n* XXH3\n* New generation hash designed for speed on small keys and vectorization\n************************************************************************ */\n/*!\n * @}\n * @defgroup XXH3_impl XXH3 implementation\n * @ingroup impl\n * @{\n */\n\n/* === Compiler specifics === */\n\n\n#if (defined(__GNUC__) && (__GNUC__ >= 3)) \\\n || (defined(__INTEL_COMPILER) && (__INTEL_COMPILER >= 800)) \\\n || defined(__clang__)\n# define XXH_likely(x) __builtin_expect(x, 1)\n# define XXH_unlikely(x) __builtin_expect(x, 0)\n#else\n# define XXH_likely(x) (x)\n# define XXH_unlikely(x) (x)\n#endif\n\n#ifndef XXH_HAS_INCLUDE\n# ifdef __has_include\n/*\n * Not defined as XXH_HAS_INCLUDE(x) (function-like) because\n * this causes segfaults in Apple Clang 4.2 (on Mac OS X 10.7 Lion)\n */\n# define XXH_HAS_INCLUDE __has_include\n# else\n# define XXH_HAS_INCLUDE(x) 0\n# endif\n#endif\n\n#if defined(__GNUC__) || defined(__clang__)\n# if defined(__ARM_FEATURE_SVE)\n# include \n# endif\n# if defined(__ARM_NEON__) || defined(__ARM_NEON) \\\n || (defined(_M_ARM) && _M_ARM >= 7) \\\n || defined(_M_ARM64) || defined(_M_ARM64EC) \\\n || (defined(__wasm_simd128__) && XXH_HAS_INCLUDE()) /* WASM SIMD128 via SIMDe */\n# define inline __inline__ /* circumvent a clang bug */\n# include \n# undef inline\n# elif defined(__AVX2__)\n# include \n# elif defined(__SSE2__)\n# include \n# elif defined(__loongarch_sx)\n# include \n# endif\n#endif\n\n#if defined(_MSC_VER)\n# include \n#endif\n\n/*\n * One goal of XXH3 is to make it fast on both 32-bit and 64-bit, while\n * remaining a true 64-bit/128-bit hash function.\n *\n * This is done by prioritizing a subset of 64-bit operations that can be\n * emulated without too many steps on the average 32-bit machine.\n *\n * For example, these two lines seem similar, and run equally fast on 64-bit:\n *\n * xxh_u64 x;\n * x ^= (x >> 47); // good\n * x ^= (x >> 13); // bad\n *\n * However, to a 32-bit machine, there is a major difference.\n *\n * x ^= (x >> 47) looks like this:\n *\n * x.lo ^= (x.hi >> (47 - 32));\n *\n * while x ^= (x >> 13) looks like this:\n *\n * // note: funnel shifts are not usually cheap.\n * x.lo ^= (x.lo >> 13) | (x.hi << (32 - 13));\n * x.hi ^= (x.hi >> 13);\n *\n * The first one is significantly faster than the second, simply because the\n * shift is larger than 32. This means:\n * - All the bits we need are in the upper 32 bits, so we can ignore the lower\n * 32 bits in the shift.\n * - The shift result will always fit in the lower 32 bits, and therefore,\n * we can ignore the upper 32 bits in the xor.\n *\n * Thanks to this optimization, XXH3 only requires these features to be efficient:\n *\n * - Usable unaligned access\n * - A 32-bit or 64-bit ALU\n * - If 32-bit, a decent ADC instruction\n * - A 32 or 64-bit multiply with a 64-bit result\n * - For the 128-bit variant, a decent byteswap helps short inputs.\n *\n * The first two are already required by XXH32, and almost all 32-bit and 64-bit\n * platforms which can run XXH32 can run XXH3 efficiently.\n *\n * Thumb-1, the classic 16-bit only subset of ARM's instruction set, is one\n * notable exception.\n *\n * First of all, Thumb-1 lacks support for the UMULL instruction which\n * performs the important long multiply. This means numerous __aeabi_lmul\n * calls.\n *\n * Second of all, the 8 functional registers are just not enough.\n * Setup for __aeabi_lmul, byteshift loads, pointers, and all arithmetic need\n * Lo registers, and this shuffling results in thousands more MOVs than A32.\n *\n * A32 and T32 don't have this limitation. They can access all 14 registers,\n * do a 32->64 multiply with UMULL, and the flexible operand allowing free\n * shifts is helpful, too.\n *\n * Therefore, we do a quick sanity check.\n *\n * If compiling Thumb-1 for a target which supports ARM instructions, we will\n * emit a warning, as it is not a \"sane\" platform to compile for.\n *\n * Usually, if this happens, it is because of an accident and you probably need\n * to specify -march, as you likely meant to compile for a newer architecture.\n *\n * Credit: large sections of the vectorial and asm source code paths\n * have been contributed by @easyaspi314\n */\n#if defined(__thumb__) && !defined(__thumb2__) && defined(__ARM_ARCH_ISA_ARM)\n# warning \"XXH3 is highly inefficient without ARM or Thumb-2.\"\n#endif\n\n/* ==========================================\n * Vectorization detection\n * ========================================== */\n\n#ifdef XXH_DOXYGEN\n/*!\n * @ingroup tuning\n * @brief Overrides the vectorization implementation chosen for XXH3.\n *\n * Can be defined to 0 to disable SIMD or any of the values mentioned in\n * @ref XXH_VECTOR_TYPE.\n *\n * If this is not defined, it uses predefined macros to determine the best\n * implementation.\n */\n# define XXH_VECTOR XXH_SCALAR\n/*!\n * @ingroup tuning\n * @brief Selects the minimum alignment for XXH3's accumulators.\n *\n * When using SIMD, this should match the alignment required for said vector\n * type, so, for example, 32 for AVX2.\n *\n * Default: Auto detected.\n */\n# define XXH_ACC_ALIGN 8\n#endif\n\n/* Actual definition */\n#ifndef XXH_DOXYGEN\n#endif\n\n#ifndef XXH_VECTOR /* can be defined on command line */\n# if defined(__ARM_FEATURE_SVE)\n# define XXH_VECTOR XXH_SVE\n# elif ( \\\n defined(__ARM_NEON__) || defined(__ARM_NEON) /* gcc */ \\\n || defined(_M_ARM) || defined(_M_ARM64) || defined(_M_ARM64EC) /* msvc */ \\\n || (defined(__wasm_simd128__) && XXH_HAS_INCLUDE()) /* wasm simd128 via SIMDe */ \\\n ) && ( \\\n defined(_WIN32) || defined(__LITTLE_ENDIAN__) /* little endian only */ \\\n || (defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__) \\\n )\n# define XXH_VECTOR XXH_NEON\n# elif defined(__AVX512F__)\n# define XXH_VECTOR XXH_AVX512\n# elif defined(__AVX2__)\n# define XXH_VECTOR XXH_AVX2\n# elif defined(__SSE2__) || defined(_M_AMD64) || defined(_M_X64) || (defined(_M_IX86_FP) && (_M_IX86_FP == 2))\n# define XXH_VECTOR XXH_SSE2\n# elif (defined(__PPC64__) && defined(__POWER8_VECTOR__)) \\\n || (defined(__s390x__) && defined(__VEC__)) \\\n && defined(__GNUC__) /* TODO: IBM XL */\n# define XXH_VECTOR XXH_VSX\n# elif defined(__loongarch_sx)\n# define XXH_VECTOR XXH_LSX\n# else\n# define XXH_VECTOR XXH_SCALAR\n# endif\n#endif\n\n/* __ARM_FEATURE_SVE is only supported by GCC & Clang. */\n#if (XXH_VECTOR == XXH_SVE) && !defined(__ARM_FEATURE_SVE)\n# ifdef _MSC_VER\n# pragma warning(once : 4606)\n# else\n# warning \"__ARM_FEATURE_SVE isn't supported. Use SCALAR instead.\"\n# endif\n# undef XXH_VECTOR\n# define XXH_VECTOR XXH_SCALAR\n#endif\n\n/*\n * Controls the alignment of the accumulator,\n * for compatibility with aligned vector loads, which are usually faster.\n */\n#ifndef XXH_ACC_ALIGN\n# if defined(XXH_X86DISPATCH)\n# define XXH_ACC_ALIGN 64 /* for compatibility with avx512 */\n# elif XXH_VECTOR == XXH_SCALAR /* scalar */\n# define XXH_ACC_ALIGN 8\n# elif XXH_VECTOR == XXH_SSE2 /* sse2 */\n# define XXH_ACC_ALIGN 16\n# elif XXH_VECTOR == XXH_AVX2 /* avx2 */\n# define XXH_ACC_ALIGN 32\n# elif XXH_VECTOR == XXH_NEON /* neon */\n# define XXH_ACC_ALIGN 16\n# elif XXH_VECTOR == XXH_VSX /* vsx */\n# define XXH_ACC_ALIGN 16\n# elif XXH_VECTOR == XXH_AVX512 /* avx512 */\n# define XXH_ACC_ALIGN 64\n# elif XXH_VECTOR == XXH_SVE /* sve */\n# define XXH_ACC_ALIGN 64\n# elif XXH_VECTOR == XXH_LSX /* lsx */\n# define XXH_ACC_ALIGN 64\n# endif\n#endif\n\n#if defined(XXH_X86DISPATCH) || XXH_VECTOR == XXH_SSE2 \\\n || XXH_VECTOR == XXH_AVX2 || XXH_VECTOR == XXH_AVX512\n# define XXH_SEC_ALIGN XXH_ACC_ALIGN\n#elif XXH_VECTOR == XXH_SVE\n# define XXH_SEC_ALIGN XXH_ACC_ALIGN\n#else\n# define XXH_SEC_ALIGN 8\n#endif\n\n#if defined(__GNUC__) || defined(__clang__)\n# define XXH_ALIASING __attribute__((__may_alias__))\n#else\n# define XXH_ALIASING /* nothing */\n#endif\n\n/*\n * UGLY HACK:\n * GCC usually generates the best code with -O3 for xxHash.\n *\n * However, when targeting AVX2, it is overzealous in its unrolling resulting\n * in code roughly 3/4 the speed of Clang.\n *\n * There are other issues, such as GCC splitting _mm256_loadu_si256 into\n * _mm_loadu_si128 + _mm256_inserti128_si256. This is an optimization which\n * only applies to Sandy and Ivy Bridge... which don't even support AVX2.\n *\n * That is why when compiling the AVX2 version, it is recommended to use either\n * -O2 -mavx2 -march=haswell\n * or\n * -O2 -mavx2 -mno-avx256-split-unaligned-load\n * for decent performance, or to use Clang instead.\n *\n * Fortunately, we can control the first one with a pragma that forces GCC into\n * -O2, but the other one we can't control without \"failed to inline always\n * inline function due to target mismatch\" warnings.\n */\n#if XXH_VECTOR == XXH_AVX2 /* AVX2 */ \\\n && defined(__GNUC__) && !defined(__clang__) /* GCC, not Clang */ \\\n && defined(__OPTIMIZE__) && XXH_SIZE_OPT <= 0 /* respect -O0 and -Os */\n# pragma GCC push_options\n# pragma GCC optimize(\"-O2\")\n#endif\n\n#if XXH_VECTOR == XXH_NEON\n\n/*\n * UGLY HACK: While AArch64 GCC on Linux does not seem to care, on macOS, GCC -O3\n * optimizes out the entire hashLong loop because of the aliasing violation.\n *\n * However, GCC is also inefficient at load-store optimization with vld1q/vst1q,\n * so the only option is to mark it as aliasing.\n */\ntypedef uint64x2_t xxh_aliasing_uint64x2_t XXH_ALIASING;\n\n/*!\n * @internal\n * @brief `vld1q_u64` but faster and alignment-safe.\n *\n * On AArch64, unaligned access is always safe, but on ARMv7-a, it is only\n * *conditionally* safe (`vld1` has an alignment bit like `movdq[ua]` in x86).\n *\n * GCC for AArch64 sees `vld1q_u8` as an intrinsic instead of a load, so it\n * prohibits load-store optimizations. Therefore, a direct dereference is used.\n *\n * Otherwise, `vld1q_u8` is used with `vreinterpretq_u8_u64` to do a safe\n * unaligned load.\n */\n#if defined(__aarch64__) && defined(__GNUC__) && !defined(__clang__)\nXXH_FORCE_INLINE uint64x2_t XXH_vld1q_u64(void const* ptr) /* silence -Wcast-align */\n{\n return *(xxh_aliasing_uint64x2_t const *)ptr;\n}\n#else\nXXH_FORCE_INLINE uint64x2_t XXH_vld1q_u64(void const* ptr)\n{\n return vreinterpretq_u64_u8(vld1q_u8((uint8_t const*)ptr));\n}\n#endif\n\n/*!\n * @internal\n * @brief `vmlal_u32` on low and high halves of a vector.\n *\n * This is a workaround for AArch64 GCC < 11 which implemented arm_neon.h with\n * inline assembly and were therefore incapable of merging the `vget_{low, high}_u32`\n * with `vmlal_u32`.\n */\n#if defined(__aarch64__) && defined(__GNUC__) && !defined(__clang__) && __GNUC__ < 11\nXXH_FORCE_INLINE uint64x2_t\nXXH_vmlal_low_u32(uint64x2_t acc, uint32x4_t lhs, uint32x4_t rhs)\n{\n /* Inline assembly is the only way */\n __asm__(\"umlal %0.2d, %1.2s, %2.2s\" : \"+w\" (acc) : \"w\" (lhs), \"w\" (rhs));\n return acc;\n}\nXXH_FORCE_INLINE uint64x2_t\nXXH_vmlal_high_u32(uint64x2_t acc, uint32x4_t lhs, uint32x4_t rhs)\n{\n /* This intrinsic works as expected */\n return vmlal_high_u32(acc, lhs, rhs);\n}\n#else\n/* Portable intrinsic versions */\nXXH_FORCE_INLINE uint64x2_t\nXXH_vmlal_low_u32(uint64x2_t acc, uint32x4_t lhs, uint32x4_t rhs)\n{\n return vmlal_u32(acc, vget_low_u32(lhs), vget_low_u32(rhs));\n}\n/*! @copydoc XXH_vmlal_low_u32\n * Assume the compiler converts this to vmlal_high_u32 on aarch64 */\nXXH_FORCE_INLINE uint64x2_t\nXXH_vmlal_high_u32(uint64x2_t acc, uint32x4_t lhs, uint32x4_t rhs)\n{\n return vmlal_u32(acc, vget_high_u32(lhs), vget_high_u32(rhs));\n}\n#endif\n\n/*!\n * @ingroup tuning\n * @brief Controls the NEON to scalar ratio for XXH3\n *\n * This can be set to 2, 4, 6, or 8.\n *\n * ARM Cortex CPUs are _very_ sensitive to how their pipelines are used.\n *\n * For example, the Cortex-A73 can dispatch 3 micro-ops per cycle, but only 2 of those\n * can be NEON. If you are only using NEON instructions, you are only using 2/3 of the CPU\n * bandwidth.\n *\n * This is even more noticeable on the more advanced cores like the Cortex-A76 which\n * can dispatch 8 micro-ops per cycle, but still only 2 NEON micro-ops at once.\n *\n * Therefore, to make the most out of the pipeline, it is beneficial to run 6 NEON lanes\n * and 2 scalar lanes, which is chosen by default.\n *\n * This does not apply to Apple processors or 32-bit processors, which run better with\n * full NEON. These will default to 8. Additionally, size-optimized builds run 8 lanes.\n *\n * This change benefits CPUs with large micro-op buffers without negatively affecting\n * most other CPUs:\n *\n * | Chipset | Dispatch type | NEON only | 6:2 hybrid | Diff. |\n * |:----------------------|:--------------------|----------:|-----------:|------:|\n * | Snapdragon 730 (A76) | 2 NEON/8 micro-ops | 8.8 GB/s | 10.1 GB/s | ~16% |\n * | Snapdragon 835 (A73) | 2 NEON/3 micro-ops | 5.1 GB/s | 5.3 GB/s | ~5% |\n * | Marvell PXA1928 (A53) | In-order dual-issue | 1.9 GB/s | 1.9 GB/s | 0% |\n * | Apple M1 | 4 NEON/8 micro-ops | 37.3 GB/s | 36.1 GB/s | ~-3% |\n *\n * It also seems to fix some bad codegen on GCC, making it almost as fast as clang.\n *\n * When using WASM SIMD128, if this is 2 or 6, SIMDe will scalarize 2 of the lanes meaning\n * it effectively becomes worse 4.\n *\n * @see XXH3_accumulate_512_neon()\n */\n# ifndef XXH3_NEON_LANES\n# if (defined(__aarch64__) || defined(__arm64__) || defined(_M_ARM64) || defined(_M_ARM64EC)) \\\n && !defined(__APPLE__) && XXH_SIZE_OPT <= 0\n# define XXH3_NEON_LANES 6\n# else\n# define XXH3_NEON_LANES XXH_ACC_NB\n# endif\n# endif\n#endif /* XXH_VECTOR == XXH_NEON */\n\n/*\n * VSX and Z Vector helpers.\n *\n * This is very messy, and any pull requests to clean this up are welcome.\n *\n * There are a lot of problems with supporting VSX and s390x, due to\n * inconsistent intrinsics, spotty coverage, and multiple endiannesses.\n */\n#if XXH_VECTOR == XXH_VSX\n/* Annoyingly, these headers _may_ define three macros: `bool`, `vector`,\n * and `pixel`. This is a problem for obvious reasons.\n *\n * These keywords are unnecessary; the spec literally says they are\n * equivalent to `__bool`, `__vector`, and `__pixel` and may be undef'd\n * after including the header.\n *\n * We use pragma push_macro/pop_macro to keep the namespace clean. */\n# pragma push_macro(\"bool\")\n# pragma push_macro(\"vector\")\n# pragma push_macro(\"pixel\")\n/* silence potential macro redefined warnings */\n# undef bool\n# undef vector\n# undef pixel\n\n# if defined(__s390x__)\n# include \n# else\n# include \n# endif\n\n/* Restore the original macro values, if applicable. */\n# pragma pop_macro(\"pixel\")\n# pragma pop_macro(\"vector\")\n# pragma pop_macro(\"bool\")\n\ntypedef __vector unsigned long long xxh_u64x2;\ntypedef __vector unsigned char xxh_u8x16;\ntypedef __vector unsigned xxh_u32x4;\n\n/*\n * UGLY HACK: Similar to aarch64 macOS GCC, s390x GCC has the same aliasing issue.\n */\ntypedef xxh_u64x2 xxh_aliasing_u64x2 XXH_ALIASING;\n\n# ifndef XXH_VSX_BE\n# if defined(__BIG_ENDIAN__) \\\n || (defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__)\n# define XXH_VSX_BE 1\n# elif defined(__VEC_ELEMENT_REG_ORDER__) && __VEC_ELEMENT_REG_ORDER__ == __ORDER_BIG_ENDIAN__\n# warning \"-maltivec=be is not recommended. Please use native endianness.\"\n# define XXH_VSX_BE 1\n# else\n# define XXH_VSX_BE 0\n# endif\n# endif /* !defined(XXH_VSX_BE) */\n\n# if XXH_VSX_BE\n# if defined(__POWER9_VECTOR__) || (defined(__clang__) && defined(__s390x__))\n# define XXH_vec_revb vec_revb\n# else\n/*!\n * A polyfill for POWER9's vec_revb().\n */\nXXH_FORCE_INLINE xxh_u64x2 XXH_vec_revb(xxh_u64x2 val)\n{\n xxh_u8x16 const vByteSwap = { 0x07, 0x06, 0x05, 0x04, 0x03, 0x02, 0x01, 0x00,\n 0x0F, 0x0E, 0x0D, 0x0C, 0x0B, 0x0A, 0x09, 0x08 };\n return vec_perm(val, val, vByteSwap);\n}\n# endif\n# endif /* XXH_VSX_BE */\n\n/*!\n * Performs an unaligned vector load and byte swaps it on big endian.\n */\nXXH_FORCE_INLINE xxh_u64x2 XXH_vec_loadu(const void *ptr)\n{\n xxh_u64x2 ret;\n XXH_memcpy(&ret, ptr, sizeof(xxh_u64x2));\n# if XXH_VSX_BE\n ret = XXH_vec_revb(ret);\n# endif\n return ret;\n}\n\n/*\n * vec_mulo and vec_mule are very problematic intrinsics on PowerPC\n *\n * These intrinsics weren't added until GCC 8, despite existing for a while,\n * and they are endian dependent. Also, their meaning swap depending on version.\n * */\n# if defined(__s390x__)\n /* s390x is always big endian, no issue on this platform */\n# define XXH_vec_mulo vec_mulo\n# define XXH_vec_mule vec_mule\n# elif defined(__clang__) && XXH_HAS_BUILTIN(__builtin_altivec_vmuleuw) && !defined(__ibmxl__)\n/* Clang has a better way to control this, we can just use the builtin which doesn't swap. */\n /* The IBM XL Compiler (which defined __clang__) only implements the vec_* operations */\n# define XXH_vec_mulo __builtin_altivec_vmulouw\n# define XXH_vec_mule __builtin_altivec_vmuleuw\n# else\n/* gcc needs inline assembly */\n/* Adapted from https://github.com/google/highwayhash/blob/master/highwayhash/hh_vsx.h. */\nXXH_FORCE_INLINE xxh_u64x2 XXH_vec_mulo(xxh_u32x4 a, xxh_u32x4 b)\n{\n xxh_u64x2 result;\n __asm__(\"vmulouw %0, %1, %2\" : \"=v\" (result) : \"v\" (a), \"v\" (b));\n return result;\n}\nXXH_FORCE_INLINE xxh_u64x2 XXH_vec_mule(xxh_u32x4 a, xxh_u32x4 b)\n{\n xxh_u64x2 result;\n __asm__(\"vmuleuw %0, %1, %2\" : \"=v\" (result) : \"v\" (a), \"v\" (b));\n return result;\n}\n# endif /* XXH_vec_mulo, XXH_vec_mule */\n#endif /* XXH_VECTOR == XXH_VSX */\n\n#if XXH_VECTOR == XXH_SVE\n#define ACCRND(acc, offset) \\\ndo { \\\n svuint64_t input_vec = svld1_u64(mask, xinput + offset); \\\n svuint64_t secret_vec = svld1_u64(mask, xsecret + offset); \\\n svuint64_t mixed = sveor_u64_x(mask, secret_vec, input_vec); \\\n svuint64_t swapped = svtbl_u64(input_vec, kSwap); \\\n svuint64_t mixed_lo = svextw_u64_x(mask, mixed); \\\n svuint64_t mixed_hi = svlsr_n_u64_x(mask, mixed, 32); \\\n svuint64_t mul = svmad_u64_x(mask, mixed_lo, mixed_hi, swapped); \\\n acc = svadd_u64_x(mask, acc, mul); \\\n} while (0)\n#endif /* XXH_VECTOR == XXH_SVE */\n\n/* prefetch\n * can be disabled, by declaring XXH_NO_PREFETCH build macro */\n#if defined(XXH_NO_PREFETCH)\n# define XXH_PREFETCH(ptr) (void)(ptr) /* disabled */\n#else\n# if XXH_SIZE_OPT >= 1\n# define XXH_PREFETCH(ptr) (void)(ptr)\n# elif defined(_MSC_VER) && (defined(_M_X64) || defined(_M_IX86)) /* _mm_prefetch() not defined outside of x86/x64 */\n# include /* https://msdn.microsoft.com/fr-fr/library/84szxsww(v=vs.90).aspx */\n# define XXH_PREFETCH(ptr) _mm_prefetch((const char*)(ptr), _MM_HINT_T0)\n# elif defined(__GNUC__) && ( (__GNUC__ >= 4) || ( (__GNUC__ == 3) && (__GNUC_MINOR__ >= 1) ) )\n# define XXH_PREFETCH(ptr) __builtin_prefetch((ptr), 0 /* rw==read */, 3 /* locality */)\n# else\n# define XXH_PREFETCH(ptr) (void)(ptr) /* disabled */\n# endif\n#endif /* XXH_NO_PREFETCH */\n\n\n/* ==========================================\n * XXH3 default settings\n * ========================================== */\n\n#define XXH_SECRET_DEFAULT_SIZE 192 /* minimum XXH3_SECRET_SIZE_MIN */\n\n#if (XXH_SECRET_DEFAULT_SIZE < XXH3_SECRET_SIZE_MIN)\n# error \"default keyset is not large enough\"\n#endif\n\n/*! Pseudorandom secret taken directly from FARSH. */\nXXH_ALIGN(64) static const xxh_u8 XXH3_kSecret[XXH_SECRET_DEFAULT_SIZE] = {\n 0xb8, 0xfe, 0x6c, 0x39, 0x23, 0xa4, 0x4b, 0xbe, 0x7c, 0x01, 0x81, 0x2c, 0xf7, 0x21, 0xad, 0x1c,\n 0xde, 0xd4, 0x6d, 0xe9, 0x83, 0x90, 0x97, 0xdb, 0x72, 0x40, 0xa4, 0xa4, 0xb7, 0xb3, 0x67, 0x1f,\n 0xcb, 0x79, 0xe6, 0x4e, 0xcc, 0xc0, 0xe5, 0x78, 0x82, 0x5a, 0xd0, 0x7d, 0xcc, 0xff, 0x72, 0x21,\n 0xb8, 0x08, 0x46, 0x74, 0xf7, 0x43, 0x24, 0x8e, 0xe0, 0x35, 0x90, 0xe6, 0x81, 0x3a, 0x26, 0x4c,\n 0x3c, 0x28, 0x52, 0xbb, 0x91, 0xc3, 0x00, 0xcb, 0x88, 0xd0, 0x65, 0x8b, 0x1b, 0x53, 0x2e, 0xa3,\n 0x71, 0x64, 0x48, 0x97, 0xa2, 0x0d, 0xf9, 0x4e, 0x38, 0x19, 0xef, 0x46, 0xa9, 0xde, 0xac, 0xd8,\n 0xa8, 0xfa, 0x76, 0x3f, 0xe3, 0x9c, 0x34, 0x3f, 0xf9, 0xdc, 0xbb, 0xc7, 0xc7, 0x0b, 0x4f, 0x1d,\n 0x8a, 0x51, 0xe0, 0x4b, 0xcd, 0xb4, 0x59, 0x31, 0xc8, 0x9f, 0x7e, 0xc9, 0xd9, 0x78, 0x73, 0x64,\n 0xea, 0xc5, 0xac, 0x83, 0x34, 0xd3, 0xeb, 0xc3, 0xc5, 0x81, 0xa0, 0xff, 0xfa, 0x13, 0x63, 0xeb,\n 0x17, 0x0d, 0xdd, 0x51, 0xb7, 0xf0, 0xda, 0x49, 0xd3, 0x16, 0x55, 0x26, 0x29, 0xd4, 0x68, 0x9e,\n 0x2b, 0x16, 0xbe, 0x58, 0x7d, 0x47, 0xa1, 0xfc, 0x8f, 0xf8, 0xb8, 0xd1, 0x7a, 0xd0, 0x31, 0xce,\n 0x45, 0xcb, 0x3a, 0x8f, 0x95, 0x16, 0x04, 0x28, 0xaf, 0xd7, 0xfb, 0xca, 0xbb, 0x4b, 0x40, 0x7e,\n};\n\nstatic const xxh_u64 PRIME_MX1 = 0x165667919E3779F9ULL; /*!< 0b0001011001010110011001111001000110011110001101110111100111111001 */\nstatic const xxh_u64 PRIME_MX2 = 0x9FB21C651E98DF25ULL; /*!< 0b1001111110110010000111000110010100011110100110001101111100100101 */\n\n#ifdef XXH_OLD_NAMES\n# define kSecret XXH3_kSecret\n#endif\n\n#ifdef XXH_DOXYGEN\n/*!\n * @brief Calculates a 32-bit to 64-bit long multiply.\n *\n * Implemented as a macro.\n *\n * Wraps `__emulu` on MSVC x86 because it tends to call `__allmul` when it doesn't\n * need to (but it shouldn't need to anyways, it is about 7 instructions to do\n * a 64x64 multiply...). Since we know that this will _always_ emit `MULL`, we\n * use that instead of the normal method.\n *\n * If you are compiling for platforms like Thumb-1 and don't have a better option,\n * you may also want to write your own long multiply routine here.\n *\n * @param x, y Numbers to be multiplied\n * @return 64-bit product of the low 32 bits of @p x and @p y.\n */\nXXH_FORCE_INLINE xxh_u64\nXXH_mult32to64(xxh_u64 x, xxh_u64 y)\n{\n return (x & 0xFFFFFFFF) * (y & 0xFFFFFFFF);\n}\n#elif defined(_MSC_VER) && defined(_M_IX86)\n# define XXH_mult32to64(x, y) __emulu((unsigned)(x), (unsigned)(y))\n#else\n/*\n * Downcast + upcast is usually better than masking on older compilers like\n * GCC 4.2 (especially 32-bit ones), all without affecting newer compilers.\n *\n * The other method, (x & 0xFFFFFFFF) * (y & 0xFFFFFFFF), will AND both operands\n * and perform a full 64x64 multiply -- entirely redundant on 32-bit.\n */\n# define XXH_mult32to64(x, y) ((xxh_u64)(xxh_u32)(x) * (xxh_u64)(xxh_u32)(y))\n#endif\n\n/*!\n * @brief Calculates a 64->128-bit long multiply.\n *\n * Uses `__uint128_t` and `_umul128` if available, otherwise uses a scalar\n * version.\n *\n * @param lhs , rhs The 64-bit integers to be multiplied\n * @return The 128-bit result represented in an @ref XXH128_hash_t.\n */\nstatic XXH128_hash_t\nXXH_mult64to128(xxh_u64 lhs, xxh_u64 rhs)\n{\n /*\n * GCC/Clang __uint128_t method.\n *\n * On most 64-bit targets, GCC and Clang define a __uint128_t type.\n * This is usually the best way as it usually uses a native long 64-bit\n * multiply, such as MULQ on x86_64 or MUL + UMULH on aarch64.\n *\n * Usually.\n *\n * Despite being a 32-bit platform, Clang (and emscripten) define this type\n * despite not having the arithmetic for it. This results in a laggy\n * compiler builtin call which calculates a full 128-bit multiply.\n * In that case it is best to use the portable one.\n * https://github.com/Cyan4973/xxHash/issues/211#issuecomment-515575677\n */\n#if (defined(__GNUC__) || defined(__clang__)) && !defined(__wasm__) \\\n && defined(__SIZEOF_INT128__) \\\n || (defined(_INTEGRAL_MAX_BITS) && _INTEGRAL_MAX_BITS >= 128)\n\n __uint128_t const product = (__uint128_t)lhs * (__uint128_t)rhs;\n XXH128_hash_t r128;\n r128.low64 = (xxh_u64)(product);\n r128.high64 = (xxh_u64)(product >> 64);\n return r128;\n\n /*\n * MSVC for x64's _umul128 method.\n *\n * xxh_u64 _umul128(xxh_u64 Multiplier, xxh_u64 Multiplicand, xxh_u64 *HighProduct);\n *\n * This compiles to single operand MUL on x64.\n */\n#elif (defined(_M_X64) || defined(_M_IA64)) && !defined(_M_ARM64EC)\n\n#ifndef _MSC_VER\n# pragma intrinsic(_umul128)\n#endif\n xxh_u64 product_high;\n xxh_u64 const product_low = _umul128(lhs, rhs, &product_high);\n XXH128_hash_t r128;\n r128.low64 = product_low;\n r128.high64 = product_high;\n return r128;\n\n /*\n * MSVC for ARM64's __umulh method.\n *\n * This compiles to the same MUL + UMULH as GCC/Clang's __uint128_t method.\n */\n#elif defined(_M_ARM64) || defined(_M_ARM64EC)\n\n#ifndef _MSC_VER\n# pragma intrinsic(__umulh)\n#endif\n XXH128_hash_t r128;\n r128.low64 = lhs * rhs;\n r128.high64 = __umulh(lhs, rhs);\n return r128;\n\n#else\n /*\n * Portable scalar method. Optimized for 32-bit and 64-bit ALUs.\n *\n * This is a fast and simple grade school multiply, which is shown below\n * with base 10 arithmetic instead of base 0x100000000.\n *\n * 9 3 // D2 lhs = 93\n * x 7 5 // D2 rhs = 75\n * ----------\n * 1 5 // D2 lo_lo = (93 % 10) * (75 % 10) = 15\n * 4 5 | // D2 hi_lo = (93 / 10) * (75 % 10) = 45\n * 2 1 | // D2 lo_hi = (93 % 10) * (75 / 10) = 21\n * + 6 3 | | // D2 hi_hi = (93 / 10) * (75 / 10) = 63\n * ---------\n * 2 7 | // D2 cross = (15 / 10) + (45 % 10) + 21 = 27\n * + 6 7 | | // D2 upper = (27 / 10) + (45 / 10) + 63 = 67\n * ---------\n * 6 9 7 5 // D4 res = (27 * 10) + (15 % 10) + (67 * 100) = 6975\n *\n * The reasons for adding the products like this are:\n * 1. It avoids manual carry tracking. Just like how\n * (9 * 9) + 9 + 9 = 99, the same applies with this for UINT64_MAX.\n * This avoids a lot of complexity.\n *\n * 2. It hints for, and on Clang, compiles to, the powerful UMAAL\n * instruction available in ARM's Digital Signal Processing extension\n * in 32-bit ARMv6 and later, which is shown below:\n *\n * void UMAAL(xxh_u32 *RdLo, xxh_u32 *RdHi, xxh_u32 Rn, xxh_u32 Rm)\n * {\n * xxh_u64 product = (xxh_u64)*RdLo * (xxh_u64)*RdHi + Rn + Rm;\n * *RdLo = (xxh_u32)(product & 0xFFFFFFFF);\n * *RdHi = (xxh_u32)(product >> 32);\n * }\n *\n * This instruction was designed for efficient long multiplication, and\n * allows this to be calculated in only 4 instructions at speeds\n * comparable to some 64-bit ALUs.\n *\n * 3. It isn't terrible on other platforms. Usually this will be a couple\n * of 32-bit ADD/ADCs.\n */\n\n /* First calculate all of the cross products. */\n xxh_u64 const lo_lo = XXH_mult32to64(lhs & 0xFFFFFFFF, rhs & 0xFFFFFFFF);\n xxh_u64 const hi_lo = XXH_mult32to64(lhs >> 32, rhs & 0xFFFFFFFF);\n xxh_u64 const lo_hi = XXH_mult32to64(lhs & 0xFFFFFFFF, rhs >> 32);\n xxh_u64 const hi_hi = XXH_mult32to64(lhs >> 32, rhs >> 32);\n\n /* Now add the products together. These will never overflow. */\n xxh_u64 const cross = (lo_lo >> 32) + (hi_lo & 0xFFFFFFFF) + lo_hi;\n xxh_u64 const upper = (hi_lo >> 32) + (cross >> 32) + hi_hi;\n xxh_u64 const lower = (cross << 32) | (lo_lo & 0xFFFFFFFF);\n\n XXH128_hash_t r128;\n r128.low64 = lower;\n r128.high64 = upper;\n return r128;\n#endif\n}\n\n/*!\n * @brief Calculates a 64-bit to 128-bit multiply, then XOR folds it.\n *\n * The reason for the separate function is to prevent passing too many structs\n * around by value. This will hopefully inline the multiply, but we don't force it.\n *\n * @param lhs , rhs The 64-bit integers to multiply\n * @return The low 64 bits of the product XOR'd by the high 64 bits.\n * @see XXH_mult64to128()\n */\nstatic xxh_u64\nXXH3_mul128_fold64(xxh_u64 lhs, xxh_u64 rhs)\n{\n XXH128_hash_t product = XXH_mult64to128(lhs, rhs);\n return product.low64 ^ product.high64;\n}\n\n/*! Seems to produce slightly better code on GCC for some reason. */\nXXH_FORCE_INLINE XXH_CONSTF xxh_u64 XXH_xorshift64(xxh_u64 v64, int shift)\n{\n XXH_ASSERT(0 <= shift && shift < 64);\n return v64 ^ (v64 >> shift);\n}\n\n/*\n * This is a fast avalanche stage,\n * suitable when input bits are already partially mixed\n */\nstatic XXH64_hash_t XXH3_avalanche(xxh_u64 h64)\n{\n h64 = XXH_xorshift64(h64, 37);\n h64 *= PRIME_MX1;\n h64 = XXH_xorshift64(h64, 32);\n return h64;\n}\n\n/*\n * This is a stronger avalanche,\n * inspired by Pelle Evensen's rrmxmx\n * preferable when input has not been previously mixed\n */\nstatic XXH64_hash_t XXH3_rrmxmx(xxh_u64 h64, xxh_u64 len)\n{\n /* this mix is inspired by Pelle Evensen's rrmxmx */\n h64 ^= XXH_rotl64(h64, 49) ^ XXH_rotl64(h64, 24);\n h64 *= PRIME_MX2;\n h64 ^= (h64 >> 35) + len ;\n h64 *= PRIME_MX2;\n return XXH_xorshift64(h64, 28);\n}\n\n\n/* ==========================================\n * Short keys\n * ==========================================\n * One of the shortcomings of XXH32 and XXH64 was that their performance was\n * sub-optimal on short lengths. It used an iterative algorithm which strongly\n * favored lengths that were a multiple of 4 or 8.\n *\n * Instead of iterating over individual inputs, we use a set of single shot\n * functions which piece together a range of lengths and operate in constant time.\n *\n * Additionally, the number of multiplies has been significantly reduced. This\n * reduces latency, especially when emulating 64-bit multiplies on 32-bit.\n *\n * Depending on the platform, this may or may not be faster than XXH32, but it\n * is almost guaranteed to be faster than XXH64.\n */\n\n/*\n * At very short lengths, there isn't enough input to fully hide secrets, or use\n * the entire secret.\n *\n * There is also only a limited amount of mixing we can do before significantly\n * impacting performance.\n *\n * Therefore, we use different sections of the secret and always mix two secret\n * samples with an XOR. This should have no effect on performance on the\n * seedless or withSeed variants because everything _should_ be constant folded\n * by modern compilers.\n *\n * The XOR mixing hides individual parts of the secret and increases entropy.\n *\n * This adds an extra layer of strength for custom secrets.\n */\nXXH_FORCE_INLINE XXH_PUREF XXH64_hash_t\nXXH3_len_1to3_64b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(1 <= len && len <= 3);\n XXH_ASSERT(secret != NULL);\n /*\n * len = 1: combined = { input[0], 0x01, input[0], input[0] }\n * len = 2: combined = { input[1], 0x02, input[0], input[1] }\n * len = 3: combined = { input[2], 0x03, input[0], input[1] }\n */\n { xxh_u8 const c1 = input[0];\n xxh_u8 const c2 = input[len >> 1];\n xxh_u8 const c3 = input[len - 1];\n xxh_u32 const combined = ((xxh_u32)c1 << 16) | ((xxh_u32)c2 << 24)\n | ((xxh_u32)c3 << 0) | ((xxh_u32)len << 8);\n xxh_u64 const bitflip = (XXH_readLE32(secret) ^ XXH_readLE32(secret+4)) + seed;\n xxh_u64 const keyed = (xxh_u64)combined ^ bitflip;\n return XXH64_avalanche(keyed);\n }\n}\n\nXXH_FORCE_INLINE XXH_PUREF XXH64_hash_t\nXXH3_len_4to8_64b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(secret != NULL);\n XXH_ASSERT(4 <= len && len <= 8);\n seed ^= (xxh_u64)XXH_swap32((xxh_u32)seed) << 32;\n { xxh_u32 const input1 = XXH_readLE32(input);\n xxh_u32 const input2 = XXH_readLE32(input + len - 4);\n xxh_u64 const bitflip = (XXH_readLE64(secret+8) ^ XXH_readLE64(secret+16)) - seed;\n xxh_u64 const input64 = input2 + (((xxh_u64)input1) << 32);\n xxh_u64 const keyed = input64 ^ bitflip;\n return XXH3_rrmxmx(keyed, len);\n }\n}\n\nXXH_FORCE_INLINE XXH_PUREF XXH64_hash_t\nXXH3_len_9to16_64b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(secret != NULL);\n XXH_ASSERT(9 <= len && len <= 16);\n { xxh_u64 const bitflip1 = (XXH_readLE64(secret+24) ^ XXH_readLE64(secret+32)) + seed;\n xxh_u64 const bitflip2 = (XXH_readLE64(secret+40) ^ XXH_readLE64(secret+48)) - seed;\n xxh_u64 const input_lo = XXH_readLE64(input) ^ bitflip1;\n xxh_u64 const input_hi = XXH_readLE64(input + len - 8) ^ bitflip2;\n xxh_u64 const acc = len\n + XXH_swap64(input_lo) + input_hi\n + XXH3_mul128_fold64(input_lo, input_hi);\n return XXH3_avalanche(acc);\n }\n}\n\nXXH_FORCE_INLINE XXH_PUREF XXH64_hash_t\nXXH3_len_0to16_64b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n XXH_ASSERT(len <= 16);\n { if (XXH_likely(len > 8)) return XXH3_len_9to16_64b(input, len, secret, seed);\n if (XXH_likely(len >= 4)) return XXH3_len_4to8_64b(input, len, secret, seed);\n if (len) return XXH3_len_1to3_64b(input, len, secret, seed);\n return XXH64_avalanche(seed ^ (XXH_readLE64(secret+56) ^ XXH_readLE64(secret+64)));\n }\n}\n\n/*\n * DISCLAIMER: There are known *seed-dependent* multicollisions here due to\n * multiplication by zero, affecting hashes of lengths 17 to 240.\n *\n * However, they are very unlikely.\n *\n * Keep this in mind when using the unseeded XXH3_64bits() variant: As with all\n * unseeded non-cryptographic hashes, it does not attempt to defend itself\n * against specially crafted inputs, only random inputs.\n *\n * Compared to classic UMAC where a 1 in 2^31 chance of 4 consecutive bytes\n * cancelling out the secret is taken an arbitrary number of times (addressed\n * in XXH3_accumulate_512), this collision is very unlikely with random inputs\n * and/or proper seeding:\n *\n * This only has a 1 in 2^63 chance of 8 consecutive bytes cancelling out, in a\n * function that is only called up to 16 times per hash with up to 240 bytes of\n * input.\n *\n * This is not too bad for a non-cryptographic hash function, especially with\n * only 64 bit outputs.\n *\n * The 128-bit variant (which trades some speed for strength) is NOT affected\n * by this, although it is always a good idea to use a proper seed if you care\n * about strength.\n */\nXXH_FORCE_INLINE xxh_u64 XXH3_mix16B(const xxh_u8* XXH_RESTRICT input,\n const xxh_u8* XXH_RESTRICT secret, xxh_u64 seed64)\n{\n#if defined(__GNUC__) && !defined(__clang__) /* GCC, not Clang */ \\\n && defined(__i386__) && defined(__SSE2__) /* x86 + SSE2 */ \\\n && !defined(XXH_ENABLE_AUTOVECTORIZE) /* Define to disable like XXH32 hack */\n /*\n * UGLY HACK:\n * GCC for x86 tends to autovectorize the 128-bit multiply, resulting in\n * slower code.\n *\n * By forcing seed64 into a register, we disrupt the cost model and\n * cause it to scalarize. See `XXH32_round()`\n *\n * FIXME: Clang's output is still _much_ faster -- On an AMD Ryzen 3600,\n * XXH3_64bits @ len=240 runs at 4.6 GB/s with Clang 9, but 3.3 GB/s on\n * GCC 9.2, despite both emitting scalar code.\n *\n * GCC generates much better scalar code than Clang for the rest of XXH3,\n * which is why finding a more optimal codepath is an interest.\n */\n XXH_COMPILER_GUARD(seed64);\n#endif\n { xxh_u64 const input_lo = XXH_readLE64(input);\n xxh_u64 const input_hi = XXH_readLE64(input+8);\n return XXH3_mul128_fold64(\n input_lo ^ (XXH_readLE64(secret) + seed64),\n input_hi ^ (XXH_readLE64(secret+8) - seed64)\n );\n }\n}\n\n/* For mid range keys, XXH3 uses a Mum-hash variant. */\nXXH_FORCE_INLINE XXH_PUREF XXH64_hash_t\nXXH3_len_17to128_64b(const xxh_u8* XXH_RESTRICT input, size_t len,\n const xxh_u8* XXH_RESTRICT secret, size_t secretSize,\n XXH64_hash_t seed)\n{\n XXH_ASSERT(secretSize >= XXH3_SECRET_SIZE_MIN); (void)secretSize;\n XXH_ASSERT(16 < len && len <= 128);\n\n { xxh_u64 acc = len * XXH_PRIME64_1;\n#if XXH_SIZE_OPT >= 1\n /* Smaller and cleaner, but slightly slower. */\n unsigned int i = (unsigned int)(len - 1) / 32;\n do {\n acc += XXH3_mix16B(input+16 * i, secret+32*i, seed);\n acc += XXH3_mix16B(input+len-16*(i+1), secret+32*i+16, seed);\n } while (i-- != 0);\n#else\n if (len > 32) {\n if (len > 64) {\n if (len > 96) {\n acc += XXH3_mix16B(input+48, secret+96, seed);\n acc += XXH3_mix16B(input+len-64, secret+112, seed);\n }\n acc += XXH3_mix16B(input+32, secret+64, seed);\n acc += XXH3_mix16B(input+len-48, secret+80, seed);\n }\n acc += XXH3_mix16B(input+16, secret+32, seed);\n acc += XXH3_mix16B(input+len-32, secret+48, seed);\n }\n acc += XXH3_mix16B(input+0, secret+0, seed);\n acc += XXH3_mix16B(input+len-16, secret+16, seed);\n#endif\n return XXH3_avalanche(acc);\n }\n}\n\nXXH_NO_INLINE XXH_PUREF XXH64_hash_t\nXXH3_len_129to240_64b(const xxh_u8* XXH_RESTRICT input, size_t len,\n const xxh_u8* XXH_RESTRICT secret, size_t secretSize,\n XXH64_hash_t seed)\n{\n XXH_ASSERT(secretSize >= XXH3_SECRET_SIZE_MIN); (void)secretSize;\n XXH_ASSERT(128 < len && len <= XXH3_MIDSIZE_MAX);\n\n #define XXH3_MIDSIZE_STARTOFFSET 3\n #define XXH3_MIDSIZE_LASTOFFSET 17\n\n { xxh_u64 acc = len * XXH_PRIME64_1;\n xxh_u64 acc_end;\n unsigned int const nbRounds = (unsigned int)len / 16;\n unsigned int i;\n XXH_ASSERT(128 < len && len <= XXH3_MIDSIZE_MAX);\n for (i=0; i<8; i++) {\n acc += XXH3_mix16B(input+(16*i), secret+(16*i), seed);\n }\n /* last bytes */\n acc_end = XXH3_mix16B(input + len - 16, secret + XXH3_SECRET_SIZE_MIN - XXH3_MIDSIZE_LASTOFFSET, seed);\n XXH_ASSERT(nbRounds >= 8);\n acc = XXH3_avalanche(acc);\n#if defined(__clang__) /* Clang */ \\\n && (defined(__ARM_NEON) || defined(__ARM_NEON__)) /* NEON */ \\\n && !defined(XXH_ENABLE_AUTOVECTORIZE) /* Define to disable */\n /*\n * UGLY HACK:\n * Clang for ARMv7-A tries to vectorize this loop, similar to GCC x86.\n * In everywhere else, it uses scalar code.\n *\n * For 64->128-bit multiplies, even if the NEON was 100% optimal, it\n * would still be slower than UMAAL (see XXH_mult64to128).\n *\n * Unfortunately, Clang doesn't handle the long multiplies properly and\n * converts them to the nonexistent \"vmulq_u64\" intrinsic, which is then\n * scalarized into an ugly mess of VMOV.32 instructions.\n *\n * This mess is difficult to avoid without turning autovectorization\n * off completely, but they are usually relatively minor and/or not\n * worth it to fix.\n *\n * This loop is the easiest to fix, as unlike XXH32, this pragma\n * _actually works_ because it is a loop vectorization instead of an\n * SLP vectorization.\n */\n #pragma clang loop vectorize(disable)\n#endif\n for (i=8 ; i < nbRounds; i++) {\n /*\n * Prevents clang for unrolling the acc loop and interleaving with this one.\n */\n XXH_COMPILER_GUARD(acc);\n acc_end += XXH3_mix16B(input+(16*i), secret+(16*(i-8)) + XXH3_MIDSIZE_STARTOFFSET, seed);\n }\n return XXH3_avalanche(acc + acc_end);\n }\n}\n\n\n/* ======= Long Keys ======= */\n\n#define XXH_STRIPE_LEN 64\n#define XXH_SECRET_CONSUME_RATE 8 /* nb of secret bytes consumed at each accumulation */\n#define XXH_ACC_NB (XXH_STRIPE_LEN / sizeof(xxh_u64))\n\n#ifdef XXH_OLD_NAMES\n# define STRIPE_LEN XXH_STRIPE_LEN\n# define ACC_NB XXH_ACC_NB\n#endif\n\n#ifndef XXH_PREFETCH_DIST\n# ifdef __clang__\n# define XXH_PREFETCH_DIST 320\n# else\n# if (XXH_VECTOR == XXH_AVX512)\n# define XXH_PREFETCH_DIST 512\n# else\n# define XXH_PREFETCH_DIST 384\n# endif\n# endif /* __clang__ */\n#endif /* XXH_PREFETCH_DIST */\n\n/*\n * These macros are to generate an XXH3_accumulate() function.\n * The two arguments select the name suffix and target attribute.\n *\n * The name of this symbol is XXH3_accumulate_() and it calls\n * XXH3_accumulate_512_().\n *\n * It may be useful to hand implement this function if the compiler fails to\n * optimize the inline function.\n */\n#define XXH3_ACCUMULATE_TEMPLATE(name) \\\nvoid \\\nXXH3_accumulate_##name(xxh_u64* XXH_RESTRICT acc, \\\n const xxh_u8* XXH_RESTRICT input, \\\n const xxh_u8* XXH_RESTRICT secret, \\\n size_t nbStripes) \\\n{ \\\n size_t n; \\\n for (n = 0; n < nbStripes; n++ ) { \\\n const xxh_u8* const in = input + n*XXH_STRIPE_LEN; \\\n XXH_PREFETCH(in + XXH_PREFETCH_DIST); \\\n XXH3_accumulate_512_##name( \\\n acc, \\\n in, \\\n secret + n*XXH_SECRET_CONSUME_RATE); \\\n } \\\n}\n\n\nXXH_FORCE_INLINE void XXH_writeLE64(void* dst, xxh_u64 v64)\n{\n if (!XXH_CPU_LITTLE_ENDIAN) v64 = XXH_swap64(v64);\n XXH_memcpy(dst, &v64, sizeof(v64));\n}\n\n/* Several intrinsic functions below are supposed to accept __int64 as argument,\n * as documented in https://software.intel.com/sites/landingpage/IntrinsicsGuide/ .\n * However, several environments do not define __int64 type,\n * requiring a workaround.\n */\n#if !defined (__VMS) \\\n && (defined (__cplusplus) \\\n || (defined (__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L) /* C99 */) )\n typedef int64_t xxh_i64;\n#else\n /* the following type must have a width of 64-bit */\n typedef long long xxh_i64;\n#endif\n\n\n/*\n * XXH3_accumulate_512 is the tightest loop for long inputs, and it is the most optimized.\n *\n * It is a hardened version of UMAC, based off of FARSH's implementation.\n *\n * This was chosen because it adapts quite well to 32-bit, 64-bit, and SIMD\n * implementations, and it is ridiculously fast.\n *\n * We harden it by mixing the original input to the accumulators as well as the product.\n *\n * This means that in the (relatively likely) case of a multiply by zero, the\n * original input is preserved.\n *\n * On 128-bit inputs, we swap 64-bit pairs when we add the input to improve\n * cross-pollination, as otherwise the upper and lower halves would be\n * essentially independent.\n *\n * This doesn't matter on 64-bit hashes since they all get merged together in\n * the end, so we skip the extra step.\n *\n * Both XXH3_64bits and XXH3_128bits use this subroutine.\n */\n\n#if (XXH_VECTOR == XXH_AVX512) \\\n || (defined(XXH_DISPATCH_AVX512) && XXH_DISPATCH_AVX512 != 0)\n\n#ifndef XXH_TARGET_AVX512\n# define XXH_TARGET_AVX512 /* disable attribute target */\n#endif\n\nXXH_FORCE_INLINE XXH_TARGET_AVX512 void\nXXH3_accumulate_512_avx512(void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n __m512i* const xacc = (__m512i *) acc;\n XXH_ASSERT((((size_t)acc) & 63) == 0);\n XXH_STATIC_ASSERT(XXH_STRIPE_LEN == sizeof(__m512i));\n\n {\n /* data_vec = input[0]; */\n __m512i const data_vec = _mm512_loadu_si512 (input);\n /* key_vec = secret[0]; */\n __m512i const key_vec = _mm512_loadu_si512 (secret);\n /* data_key = data_vec ^ key_vec; */\n __m512i const data_key = _mm512_xor_si512 (data_vec, key_vec);\n /* data_key_lo = data_key >> 32; */\n __m512i const data_key_lo = _mm512_srli_epi64 (data_key, 32);\n /* product = (data_key & 0xffffffff) * (data_key_lo & 0xffffffff); */\n __m512i const product = _mm512_mul_epu32 (data_key, data_key_lo);\n /* xacc[0] += swap(data_vec); */\n __m512i const data_swap = _mm512_shuffle_epi32(data_vec, (_MM_PERM_ENUM)_MM_SHUFFLE(1, 0, 3, 2));\n __m512i const sum = _mm512_add_epi64(*xacc, data_swap);\n /* xacc[0] += product; */\n *xacc = _mm512_add_epi64(product, sum);\n }\n}\nXXH_FORCE_INLINE XXH_TARGET_AVX512 XXH3_ACCUMULATE_TEMPLATE(avx512)\n\n/*\n * XXH3_scrambleAcc: Scrambles the accumulators to improve mixing.\n *\n * Multiplication isn't perfect, as explained by Google in HighwayHash:\n *\n * // Multiplication mixes/scrambles bytes 0-7 of the 64-bit result to\n * // varying degrees. In descending order of goodness, bytes\n * // 3 4 2 5 1 6 0 7 have quality 228 224 164 160 100 96 36 32.\n * // As expected, the upper and lower bytes are much worse.\n *\n * Source: https://github.com/google/highwayhash/blob/0aaf66b/highwayhash/hh_avx2.h#L291\n *\n * Since our algorithm uses a pseudorandom secret to add some variance into the\n * mix, we don't need to (or want to) mix as often or as much as HighwayHash does.\n *\n * This isn't as tight as XXH3_accumulate, but still written in SIMD to avoid\n * extraction.\n *\n * Both XXH3_64bits and XXH3_128bits use this subroutine.\n */\n\nXXH_FORCE_INLINE XXH_TARGET_AVX512 void\nXXH3_scrambleAcc_avx512(void* XXH_RESTRICT acc, const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 63) == 0);\n XXH_STATIC_ASSERT(XXH_STRIPE_LEN == sizeof(__m512i));\n { __m512i* const xacc = (__m512i*) acc;\n const __m512i prime32 = _mm512_set1_epi32((int)XXH_PRIME32_1);\n\n /* xacc[0] ^= (xacc[0] >> 47) */\n __m512i const acc_vec = *xacc;\n __m512i const shifted = _mm512_srli_epi64 (acc_vec, 47);\n /* xacc[0] ^= secret; */\n __m512i const key_vec = _mm512_loadu_si512 (secret);\n __m512i const data_key = _mm512_ternarylogic_epi32(key_vec, acc_vec, shifted, 0x96 /* key_vec ^ acc_vec ^ shifted */);\n\n /* xacc[0] *= XXH_PRIME32_1; */\n __m512i const data_key_hi = _mm512_srli_epi64 (data_key, 32);\n __m512i const prod_lo = _mm512_mul_epu32 (data_key, prime32);\n __m512i const prod_hi = _mm512_mul_epu32 (data_key_hi, prime32);\n *xacc = _mm512_add_epi64(prod_lo, _mm512_slli_epi64(prod_hi, 32));\n }\n}\n\nXXH_FORCE_INLINE XXH_TARGET_AVX512 void\nXXH3_initCustomSecret_avx512(void* XXH_RESTRICT customSecret, xxh_u64 seed64)\n{\n XXH_STATIC_ASSERT((XXH_SECRET_DEFAULT_SIZE & 63) == 0);\n XXH_STATIC_ASSERT(XXH_SEC_ALIGN == 64);\n XXH_ASSERT(((size_t)customSecret & 63) == 0);\n (void)(&XXH_writeLE64);\n { int const nbRounds = XXH_SECRET_DEFAULT_SIZE / sizeof(__m512i);\n __m512i const seed_pos = _mm512_set1_epi64((xxh_i64)seed64);\n __m512i const seed = _mm512_mask_sub_epi64(seed_pos, 0xAA, _mm512_set1_epi8(0), seed_pos);\n\n const __m512i* const src = (const __m512i*) ((const void*) XXH3_kSecret);\n __m512i* const dest = ( __m512i*) customSecret;\n int i;\n XXH_ASSERT(((size_t)src & 63) == 0); /* control alignment */\n XXH_ASSERT(((size_t)dest & 63) == 0);\n for (i=0; i < nbRounds; ++i) {\n dest[i] = _mm512_add_epi64(_mm512_load_si512(src + i), seed);\n } }\n}\n\n#endif\n\n#if (XXH_VECTOR == XXH_AVX2) \\\n || (defined(XXH_DISPATCH_AVX2) && XXH_DISPATCH_AVX2 != 0)\n\n#ifndef XXH_TARGET_AVX2\n# define XXH_TARGET_AVX2 /* disable attribute target */\n#endif\n\nXXH_FORCE_INLINE XXH_TARGET_AVX2 void\nXXH3_accumulate_512_avx2( void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 31) == 0);\n { __m256i* const xacc = (__m256i *) acc;\n /* Unaligned. This is mainly for pointer arithmetic, and because\n * _mm256_loadu_si256 requires a const __m256i * pointer for some reason. */\n const __m256i* const xinput = (const __m256i *) input;\n /* Unaligned. This is mainly for pointer arithmetic, and because\n * _mm256_loadu_si256 requires a const __m256i * pointer for some reason. */\n const __m256i* const xsecret = (const __m256i *) secret;\n\n size_t i;\n for (i=0; i < XXH_STRIPE_LEN/sizeof(__m256i); i++) {\n /* data_vec = xinput[i]; */\n __m256i const data_vec = _mm256_loadu_si256 (xinput+i);\n /* key_vec = xsecret[i]; */\n __m256i const key_vec = _mm256_loadu_si256 (xsecret+i);\n /* data_key = data_vec ^ key_vec; */\n __m256i const data_key = _mm256_xor_si256 (data_vec, key_vec);\n /* data_key_lo = data_key >> 32; */\n __m256i const data_key_lo = _mm256_srli_epi64 (data_key, 32);\n /* product = (data_key & 0xffffffff) * (data_key_lo & 0xffffffff); */\n __m256i const product = _mm256_mul_epu32 (data_key, data_key_lo);\n /* xacc[i] += swap(data_vec); */\n __m256i const data_swap = _mm256_shuffle_epi32(data_vec, _MM_SHUFFLE(1, 0, 3, 2));\n __m256i const sum = _mm256_add_epi64(xacc[i], data_swap);\n /* xacc[i] += product; */\n xacc[i] = _mm256_add_epi64(product, sum);\n } }\n}\nXXH_FORCE_INLINE XXH_TARGET_AVX2 XXH3_ACCUMULATE_TEMPLATE(avx2)\n\nXXH_FORCE_INLINE XXH_TARGET_AVX2 void\nXXH3_scrambleAcc_avx2(void* XXH_RESTRICT acc, const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 31) == 0);\n { __m256i* const xacc = (__m256i*) acc;\n /* Unaligned. This is mainly for pointer arithmetic, and because\n * _mm256_loadu_si256 requires a const __m256i * pointer for some reason. */\n const __m256i* const xsecret = (const __m256i *) secret;\n const __m256i prime32 = _mm256_set1_epi32((int)XXH_PRIME32_1);\n\n size_t i;\n for (i=0; i < XXH_STRIPE_LEN/sizeof(__m256i); i++) {\n /* xacc[i] ^= (xacc[i] >> 47) */\n __m256i const acc_vec = xacc[i];\n __m256i const shifted = _mm256_srli_epi64 (acc_vec, 47);\n __m256i const data_vec = _mm256_xor_si256 (acc_vec, shifted);\n /* xacc[i] ^= xsecret; */\n __m256i const key_vec = _mm256_loadu_si256 (xsecret+i);\n __m256i const data_key = _mm256_xor_si256 (data_vec, key_vec);\n\n /* xacc[i] *= XXH_PRIME32_1; */\n __m256i const data_key_hi = _mm256_srli_epi64 (data_key, 32);\n __m256i const prod_lo = _mm256_mul_epu32 (data_key, prime32);\n __m256i const prod_hi = _mm256_mul_epu32 (data_key_hi, prime32);\n xacc[i] = _mm256_add_epi64(prod_lo, _mm256_slli_epi64(prod_hi, 32));\n }\n }\n}\n\nXXH_FORCE_INLINE XXH_TARGET_AVX2 void XXH3_initCustomSecret_avx2(void* XXH_RESTRICT customSecret, xxh_u64 seed64)\n{\n XXH_STATIC_ASSERT((XXH_SECRET_DEFAULT_SIZE & 31) == 0);\n XXH_STATIC_ASSERT((XXH_SECRET_DEFAULT_SIZE / sizeof(__m256i)) == 6);\n XXH_STATIC_ASSERT(XXH_SEC_ALIGN <= 64);\n (void)(&XXH_writeLE64);\n XXH_PREFETCH(customSecret);\n { __m256i const seed = _mm256_set_epi64x((xxh_i64)(0U - seed64), (xxh_i64)seed64, (xxh_i64)(0U - seed64), (xxh_i64)seed64);\n\n const __m256i* const src = (const __m256i*) ((const void*) XXH3_kSecret);\n __m256i* dest = ( __m256i*) customSecret;\n\n# if defined(__GNUC__) || defined(__clang__)\n /*\n * On GCC & Clang, marking 'dest' as modified will cause the compiler:\n * - do not extract the secret from sse registers in the internal loop\n * - use less common registers, and avoid pushing these reg into stack\n */\n XXH_COMPILER_GUARD(dest);\n# endif\n XXH_ASSERT(((size_t)src & 31) == 0); /* control alignment */\n XXH_ASSERT(((size_t)dest & 31) == 0);\n\n /* GCC -O2 need unroll loop manually */\n dest[0] = _mm256_add_epi64(_mm256_load_si256(src+0), seed);\n dest[1] = _mm256_add_epi64(_mm256_load_si256(src+1), seed);\n dest[2] = _mm256_add_epi64(_mm256_load_si256(src+2), seed);\n dest[3] = _mm256_add_epi64(_mm256_load_si256(src+3), seed);\n dest[4] = _mm256_add_epi64(_mm256_load_si256(src+4), seed);\n dest[5] = _mm256_add_epi64(_mm256_load_si256(src+5), seed);\n }\n}\n\n#endif\n\n/* x86dispatch always generates SSE2 */\n#if (XXH_VECTOR == XXH_SSE2) || defined(XXH_X86DISPATCH)\n\n#ifndef XXH_TARGET_SSE2\n# define XXH_TARGET_SSE2 /* disable attribute target */\n#endif\n\nXXH_FORCE_INLINE XXH_TARGET_SSE2 void\nXXH3_accumulate_512_sse2( void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n /* SSE2 is just a half-scale version of the AVX2 version. */\n XXH_ASSERT((((size_t)acc) & 15) == 0);\n { __m128i* const xacc = (__m128i *) acc;\n /* Unaligned. This is mainly for pointer arithmetic, and because\n * _mm_loadu_si128 requires a const __m128i * pointer for some reason. */\n const __m128i* const xinput = (const __m128i *) input;\n /* Unaligned. This is mainly for pointer arithmetic, and because\n * _mm_loadu_si128 requires a const __m128i * pointer for some reason. */\n const __m128i* const xsecret = (const __m128i *) secret;\n\n size_t i;\n for (i=0; i < XXH_STRIPE_LEN/sizeof(__m128i); i++) {\n /* data_vec = xinput[i]; */\n __m128i const data_vec = _mm_loadu_si128 (xinput+i);\n /* key_vec = xsecret[i]; */\n __m128i const key_vec = _mm_loadu_si128 (xsecret+i);\n /* data_key = data_vec ^ key_vec; */\n __m128i const data_key = _mm_xor_si128 (data_vec, key_vec);\n /* data_key_lo = data_key >> 32; */\n __m128i const data_key_lo = _mm_shuffle_epi32 (data_key, _MM_SHUFFLE(0, 3, 0, 1));\n /* product = (data_key & 0xffffffff) * (data_key_lo & 0xffffffff); */\n __m128i const product = _mm_mul_epu32 (data_key, data_key_lo);\n /* xacc[i] += swap(data_vec); */\n __m128i const data_swap = _mm_shuffle_epi32(data_vec, _MM_SHUFFLE(1,0,3,2));\n __m128i const sum = _mm_add_epi64(xacc[i], data_swap);\n /* xacc[i] += product; */\n xacc[i] = _mm_add_epi64(product, sum);\n } }\n}\nXXH_FORCE_INLINE XXH_TARGET_SSE2 XXH3_ACCUMULATE_TEMPLATE(sse2)\n\nXXH_FORCE_INLINE XXH_TARGET_SSE2 void\nXXH3_scrambleAcc_sse2(void* XXH_RESTRICT acc, const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 15) == 0);\n { __m128i* const xacc = (__m128i*) acc;\n /* Unaligned. This is mainly for pointer arithmetic, and because\n * _mm_loadu_si128 requires a const __m128i * pointer for some reason. */\n const __m128i* const xsecret = (const __m128i *) secret;\n const __m128i prime32 = _mm_set1_epi32((int)XXH_PRIME32_1);\n\n size_t i;\n for (i=0; i < XXH_STRIPE_LEN/sizeof(__m128i); i++) {\n /* xacc[i] ^= (xacc[i] >> 47) */\n __m128i const acc_vec = xacc[i];\n __m128i const shifted = _mm_srli_epi64 (acc_vec, 47);\n __m128i const data_vec = _mm_xor_si128 (acc_vec, shifted);\n /* xacc[i] ^= xsecret[i]; */\n __m128i const key_vec = _mm_loadu_si128 (xsecret+i);\n __m128i const data_key = _mm_xor_si128 (data_vec, key_vec);\n\n /* xacc[i] *= XXH_PRIME32_1; */\n __m128i const data_key_hi = _mm_shuffle_epi32 (data_key, _MM_SHUFFLE(0, 3, 0, 1));\n __m128i const prod_lo = _mm_mul_epu32 (data_key, prime32);\n __m128i const prod_hi = _mm_mul_epu32 (data_key_hi, prime32);\n xacc[i] = _mm_add_epi64(prod_lo, _mm_slli_epi64(prod_hi, 32));\n }\n }\n}\n\nXXH_FORCE_INLINE XXH_TARGET_SSE2 void XXH3_initCustomSecret_sse2(void* XXH_RESTRICT customSecret, xxh_u64 seed64)\n{\n XXH_STATIC_ASSERT((XXH_SECRET_DEFAULT_SIZE & 15) == 0);\n (void)(&XXH_writeLE64);\n { int const nbRounds = XXH_SECRET_DEFAULT_SIZE / sizeof(__m128i);\n\n# if defined(_MSC_VER) && defined(_M_IX86) && _MSC_VER < 1900\n /* MSVC 32bit mode does not support _mm_set_epi64x before 2015 */\n XXH_ALIGN(16) const xxh_i64 seed64x2[2] = { (xxh_i64)seed64, (xxh_i64)(0U - seed64) };\n __m128i const seed = _mm_load_si128((__m128i const*)seed64x2);\n# else\n __m128i const seed = _mm_set_epi64x((xxh_i64)(0U - seed64), (xxh_i64)seed64);\n# endif\n int i;\n\n const void* const src16 = XXH3_kSecret;\n __m128i* dst16 = (__m128i*) customSecret;\n# if defined(__GNUC__) || defined(__clang__)\n /*\n * On GCC & Clang, marking 'dest' as modified will cause the compiler:\n * - do not extract the secret from sse registers in the internal loop\n * - use less common registers, and avoid pushing these reg into stack\n */\n XXH_COMPILER_GUARD(dst16);\n# endif\n XXH_ASSERT(((size_t)src16 & 15) == 0); /* control alignment */\n XXH_ASSERT(((size_t)dst16 & 15) == 0);\n\n for (i=0; i < nbRounds; ++i) {\n dst16[i] = _mm_add_epi64(_mm_load_si128((const __m128i *)src16+i), seed);\n } }\n}\n\n#endif\n\n#if (XXH_VECTOR == XXH_NEON)\n\n/* forward declarations for the scalar routines */\nXXH_FORCE_INLINE void\nXXH3_scalarRound(void* XXH_RESTRICT acc, void const* XXH_RESTRICT input,\n void const* XXH_RESTRICT secret, size_t lane);\n\nXXH_FORCE_INLINE void\nXXH3_scalarScrambleRound(void* XXH_RESTRICT acc,\n void const* XXH_RESTRICT secret, size_t lane);\n\n/*!\n * @internal\n * @brief The bulk processing loop for NEON and WASM SIMD128.\n *\n * The NEON code path is actually partially scalar when running on AArch64. This\n * is to optimize the pipelining and can have up to 15% speedup depending on the\n * CPU, and it also mitigates some GCC codegen issues.\n *\n * @see XXH3_NEON_LANES for configuring this and details about this optimization.\n *\n * NEON's 32-bit to 64-bit long multiply takes a half vector of 32-bit\n * integers instead of the other platforms which mask full 64-bit vectors,\n * so the setup is more complicated than just shifting right.\n *\n * Additionally, there is an optimization for 4 lanes at once noted below.\n *\n * Since, as stated, the most optimal amount of lanes for Cortexes is 6,\n * there needs to be *three* versions of the accumulate operation used\n * for the remaining 2 lanes.\n *\n * WASM's SIMD128 uses SIMDe's arm_neon.h polyfill because the intrinsics overlap\n * nearly perfectly.\n */\n\nXXH_FORCE_INLINE void\nXXH3_accumulate_512_neon( void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 15) == 0);\n XXH_STATIC_ASSERT(XXH3_NEON_LANES > 0 && XXH3_NEON_LANES <= XXH_ACC_NB && XXH3_NEON_LANES % 2 == 0);\n { /* GCC for darwin arm64 does not like aliasing here */\n xxh_aliasing_uint64x2_t* const xacc = (xxh_aliasing_uint64x2_t*) acc;\n /* We don't use a uint32x4_t pointer because it causes bus errors on ARMv7. */\n uint8_t const* xinput = (const uint8_t *) input;\n uint8_t const* xsecret = (const uint8_t *) secret;\n\n size_t i;\n#ifdef __wasm_simd128__\n /*\n * On WASM SIMD128, Clang emits direct address loads when XXH3_kSecret\n * is constant propagated, which results in it converting it to this\n * inside the loop:\n *\n * a = v128.load(XXH3_kSecret + 0 + $secret_offset, offset = 0)\n * b = v128.load(XXH3_kSecret + 16 + $secret_offset, offset = 0)\n * ...\n *\n * This requires a full 32-bit address immediate (and therefore a 6 byte\n * instruction) as well as an add for each offset.\n *\n * Putting an asm guard prevents it from folding (at the cost of losing\n * the alignment hint), and uses the free offset in `v128.load` instead\n * of adding secret_offset each time which overall reduces code size by\n * about a kilobyte and improves performance.\n */\n XXH_COMPILER_GUARD(xsecret);\n#endif\n /* Scalar lanes use the normal scalarRound routine */\n for (i = XXH3_NEON_LANES; i < XXH_ACC_NB; i++) {\n XXH3_scalarRound(acc, input, secret, i);\n }\n i = 0;\n /* 4 NEON lanes at a time. */\n for (; i+1 < XXH3_NEON_LANES / 2; i+=2) {\n /* data_vec = xinput[i]; */\n uint64x2_t data_vec_1 = XXH_vld1q_u64(xinput + (i * 16));\n uint64x2_t data_vec_2 = XXH_vld1q_u64(xinput + ((i+1) * 16));\n /* key_vec = xsecret[i]; */\n uint64x2_t key_vec_1 = XXH_vld1q_u64(xsecret + (i * 16));\n uint64x2_t key_vec_2 = XXH_vld1q_u64(xsecret + ((i+1) * 16));\n /* data_swap = swap(data_vec) */\n uint64x2_t data_swap_1 = vextq_u64(data_vec_1, data_vec_1, 1);\n uint64x2_t data_swap_2 = vextq_u64(data_vec_2, data_vec_2, 1);\n /* data_key = data_vec ^ key_vec; */\n uint64x2_t data_key_1 = veorq_u64(data_vec_1, key_vec_1);\n uint64x2_t data_key_2 = veorq_u64(data_vec_2, key_vec_2);\n\n /*\n * If we reinterpret the 64x2 vectors as 32x4 vectors, we can use a\n * de-interleave operation for 4 lanes in 1 step with `vuzpq_u32` to\n * get one vector with the low 32 bits of each lane, and one vector\n * with the high 32 bits of each lane.\n *\n * The intrinsic returns a double vector because the original ARMv7-a\n * instruction modified both arguments in place. AArch64 and SIMD128 emit\n * two instructions from this intrinsic.\n *\n * [ dk11L | dk11H | dk12L | dk12H ] -> [ dk11L | dk12L | dk21L | dk22L ]\n * [ dk21L | dk21H | dk22L | dk22H ] -> [ dk11H | dk12H | dk21H | dk22H ]\n */\n uint32x4x2_t unzipped = vuzpq_u32(\n vreinterpretq_u32_u64(data_key_1),\n vreinterpretq_u32_u64(data_key_2)\n );\n /* data_key_lo = data_key & 0xFFFFFFFF */\n uint32x4_t data_key_lo = unzipped.val[0];\n /* data_key_hi = data_key >> 32 */\n uint32x4_t data_key_hi = unzipped.val[1];\n /*\n * Then, we can split the vectors horizontally and multiply which, as for most\n * widening intrinsics, have a variant that works on both high half vectors\n * for free on AArch64. A similar instruction is available on SIMD128.\n *\n * sum = data_swap + (u64x2) data_key_lo * (u64x2) data_key_hi\n */\n uint64x2_t sum_1 = XXH_vmlal_low_u32(data_swap_1, data_key_lo, data_key_hi);\n uint64x2_t sum_2 = XXH_vmlal_high_u32(data_swap_2, data_key_lo, data_key_hi);\n /*\n * Clang reorders\n * a += b * c; // umlal swap.2d, dkl.2s, dkh.2s\n * c += a; // add acc.2d, acc.2d, swap.2d\n * to\n * c += a; // add acc.2d, acc.2d, swap.2d\n * c += b * c; // umlal acc.2d, dkl.2s, dkh.2s\n *\n * While it would make sense in theory since the addition is faster,\n * for reasons likely related to umlal being limited to certain NEON\n * pipelines, this is worse. A compiler guard fixes this.\n */\n XXH_COMPILER_GUARD_CLANG_NEON(sum_1);\n XXH_COMPILER_GUARD_CLANG_NEON(sum_2);\n /* xacc[i] = acc_vec + sum; */\n xacc[i] = vaddq_u64(xacc[i], sum_1);\n xacc[i+1] = vaddq_u64(xacc[i+1], sum_2);\n }\n /* Operate on the remaining NEON lanes 2 at a time. */\n for (; i < XXH3_NEON_LANES / 2; i++) {\n /* data_vec = xinput[i]; */\n uint64x2_t data_vec = XXH_vld1q_u64(xinput + (i * 16));\n /* key_vec = xsecret[i]; */\n uint64x2_t key_vec = XXH_vld1q_u64(xsecret + (i * 16));\n /* acc_vec_2 = swap(data_vec) */\n uint64x2_t data_swap = vextq_u64(data_vec, data_vec, 1);\n /* data_key = data_vec ^ key_vec; */\n uint64x2_t data_key = veorq_u64(data_vec, key_vec);\n /* For two lanes, just use VMOVN and VSHRN. */\n /* data_key_lo = data_key & 0xFFFFFFFF; */\n uint32x2_t data_key_lo = vmovn_u64(data_key);\n /* data_key_hi = data_key >> 32; */\n uint32x2_t data_key_hi = vshrn_n_u64(data_key, 32);\n /* sum = data_swap + (u64x2) data_key_lo * (u64x2) data_key_hi; */\n uint64x2_t sum = vmlal_u32(data_swap, data_key_lo, data_key_hi);\n /* Same Clang workaround as before */\n XXH_COMPILER_GUARD_CLANG_NEON(sum);\n /* xacc[i] = acc_vec + sum; */\n xacc[i] = vaddq_u64 (xacc[i], sum);\n }\n }\n}\nXXH_FORCE_INLINE XXH3_ACCUMULATE_TEMPLATE(neon)\n\nXXH_FORCE_INLINE void\nXXH3_scrambleAcc_neon(void* XXH_RESTRICT acc, const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 15) == 0);\n\n { xxh_aliasing_uint64x2_t* xacc = (xxh_aliasing_uint64x2_t*) acc;\n uint8_t const* xsecret = (uint8_t const*) secret;\n\n size_t i;\n /* WASM uses operator overloads and doesn't need these. */\n#ifndef __wasm_simd128__\n /* { prime32_1, prime32_1 } */\n uint32x2_t const kPrimeLo = vdup_n_u32(XXH_PRIME32_1);\n /* { 0, prime32_1, 0, prime32_1 } */\n uint32x4_t const kPrimeHi = vreinterpretq_u32_u64(vdupq_n_u64((xxh_u64)XXH_PRIME32_1 << 32));\n#endif\n\n /* AArch64 uses both scalar and neon at the same time */\n for (i = XXH3_NEON_LANES; i < XXH_ACC_NB; i++) {\n XXH3_scalarScrambleRound(acc, secret, i);\n }\n for (i=0; i < XXH3_NEON_LANES / 2; i++) {\n /* xacc[i] ^= (xacc[i] >> 47); */\n uint64x2_t acc_vec = xacc[i];\n uint64x2_t shifted = vshrq_n_u64(acc_vec, 47);\n uint64x2_t data_vec = veorq_u64(acc_vec, shifted);\n\n /* xacc[i] ^= xsecret[i]; */\n uint64x2_t key_vec = XXH_vld1q_u64(xsecret + (i * 16));\n uint64x2_t data_key = veorq_u64(data_vec, key_vec);\n /* xacc[i] *= XXH_PRIME32_1 */\n#ifdef __wasm_simd128__\n /* SIMD128 has multiply by u64x2, use it instead of expanding and scalarizing */\n xacc[i] = data_key * XXH_PRIME32_1;\n#else\n /*\n * Expanded version with portable NEON intrinsics\n *\n * lo(x) * lo(y) + (hi(x) * lo(y) << 32)\n *\n * prod_hi = hi(data_key) * lo(prime) << 32\n *\n * Since we only need 32 bits of this multiply a trick can be used, reinterpreting the vector\n * as a uint32x4_t and multiplying by { 0, prime, 0, prime } to cancel out the unwanted bits\n * and avoid the shift.\n */\n uint32x4_t prod_hi = vmulq_u32 (vreinterpretq_u32_u64(data_key), kPrimeHi);\n /* Extract low bits for vmlal_u32 */\n uint32x2_t data_key_lo = vmovn_u64(data_key);\n /* xacc[i] = prod_hi + lo(data_key) * XXH_PRIME32_1; */\n xacc[i] = vmlal_u32(vreinterpretq_u64_u32(prod_hi), data_key_lo, kPrimeLo);\n#endif\n }\n }\n}\n#endif\n\n#if (XXH_VECTOR == XXH_VSX)\n\nXXH_FORCE_INLINE void\nXXH3_accumulate_512_vsx( void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n /* presumed aligned */\n xxh_aliasing_u64x2* const xacc = (xxh_aliasing_u64x2*) acc;\n xxh_u8 const* const xinput = (xxh_u8 const*) input; /* no alignment restriction */\n xxh_u8 const* const xsecret = (xxh_u8 const*) secret; /* no alignment restriction */\n xxh_u64x2 const v32 = { 32, 32 };\n size_t i;\n for (i = 0; i < XXH_STRIPE_LEN / sizeof(xxh_u64x2); i++) {\n /* data_vec = xinput[i]; */\n xxh_u64x2 const data_vec = XXH_vec_loadu(xinput + 16*i);\n /* key_vec = xsecret[i]; */\n xxh_u64x2 const key_vec = XXH_vec_loadu(xsecret + 16*i);\n xxh_u64x2 const data_key = data_vec ^ key_vec;\n /* shuffled = (data_key << 32) | (data_key >> 32); */\n xxh_u32x4 const shuffled = (xxh_u32x4)vec_rl(data_key, v32);\n /* product = ((xxh_u64x2)data_key & 0xFFFFFFFF) * ((xxh_u64x2)shuffled & 0xFFFFFFFF); */\n xxh_u64x2 const product = XXH_vec_mulo((xxh_u32x4)data_key, shuffled);\n /* acc_vec = xacc[i]; */\n xxh_u64x2 acc_vec = xacc[i];\n acc_vec += product;\n\n /* swap high and low halves */\n#ifdef __s390x__\n acc_vec += vec_permi(data_vec, data_vec, 2);\n#else\n acc_vec += vec_xxpermdi(data_vec, data_vec, 2);\n#endif\n xacc[i] = acc_vec;\n }\n}\nXXH_FORCE_INLINE XXH3_ACCUMULATE_TEMPLATE(vsx)\n\nXXH_FORCE_INLINE void\nXXH3_scrambleAcc_vsx(void* XXH_RESTRICT acc, const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 15) == 0);\n\n { xxh_aliasing_u64x2* const xacc = (xxh_aliasing_u64x2*) acc;\n const xxh_u8* const xsecret = (const xxh_u8*) secret;\n /* constants */\n xxh_u64x2 const v32 = { 32, 32 };\n xxh_u64x2 const v47 = { 47, 47 };\n xxh_u32x4 const prime = { XXH_PRIME32_1, XXH_PRIME32_1, XXH_PRIME32_1, XXH_PRIME32_1 };\n size_t i;\n for (i = 0; i < XXH_STRIPE_LEN / sizeof(xxh_u64x2); i++) {\n /* xacc[i] ^= (xacc[i] >> 47); */\n xxh_u64x2 const acc_vec = xacc[i];\n xxh_u64x2 const data_vec = acc_vec ^ (acc_vec >> v47);\n\n /* xacc[i] ^= xsecret[i]; */\n xxh_u64x2 const key_vec = XXH_vec_loadu(xsecret + 16*i);\n xxh_u64x2 const data_key = data_vec ^ key_vec;\n\n /* xacc[i] *= XXH_PRIME32_1 */\n /* prod_lo = ((xxh_u64x2)data_key & 0xFFFFFFFF) * ((xxh_u64x2)prime & 0xFFFFFFFF); */\n xxh_u64x2 const prod_even = XXH_vec_mule((xxh_u32x4)data_key, prime);\n /* prod_hi = ((xxh_u64x2)data_key >> 32) * ((xxh_u64x2)prime >> 32); */\n xxh_u64x2 const prod_odd = XXH_vec_mulo((xxh_u32x4)data_key, prime);\n xacc[i] = prod_odd + (prod_even << v32);\n } }\n}\n\n#endif\n\n#if (XXH_VECTOR == XXH_SVE)\n\nXXH_FORCE_INLINE void\nXXH3_accumulate_512_sve( void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n uint64_t *xacc = (uint64_t *)acc;\n const uint64_t *xinput = (const uint64_t *)(const void *)input;\n const uint64_t *xsecret = (const uint64_t *)(const void *)secret;\n svuint64_t kSwap = sveor_n_u64_z(svptrue_b64(), svindex_u64(0, 1), 1);\n uint64_t element_count = svcntd();\n if (element_count >= 8) {\n svbool_t mask = svptrue_pat_b64(SV_VL8);\n svuint64_t vacc = svld1_u64(mask, xacc);\n ACCRND(vacc, 0);\n svst1_u64(mask, xacc, vacc);\n } else if (element_count == 2) { /* sve128 */\n svbool_t mask = svptrue_pat_b64(SV_VL2);\n svuint64_t acc0 = svld1_u64(mask, xacc + 0);\n svuint64_t acc1 = svld1_u64(mask, xacc + 2);\n svuint64_t acc2 = svld1_u64(mask, xacc + 4);\n svuint64_t acc3 = svld1_u64(mask, xacc + 6);\n ACCRND(acc0, 0);\n ACCRND(acc1, 2);\n ACCRND(acc2, 4);\n ACCRND(acc3, 6);\n svst1_u64(mask, xacc + 0, acc0);\n svst1_u64(mask, xacc + 2, acc1);\n svst1_u64(mask, xacc + 4, acc2);\n svst1_u64(mask, xacc + 6, acc3);\n } else {\n svbool_t mask = svptrue_pat_b64(SV_VL4);\n svuint64_t acc0 = svld1_u64(mask, xacc + 0);\n svuint64_t acc1 = svld1_u64(mask, xacc + 4);\n ACCRND(acc0, 0);\n ACCRND(acc1, 4);\n svst1_u64(mask, xacc + 0, acc0);\n svst1_u64(mask, xacc + 4, acc1);\n }\n}\n\nXXH_FORCE_INLINE void\nXXH3_accumulate_sve(xxh_u64* XXH_RESTRICT acc,\n const xxh_u8* XXH_RESTRICT input,\n const xxh_u8* XXH_RESTRICT secret,\n size_t nbStripes)\n{\n if (nbStripes != 0) {\n uint64_t *xacc = (uint64_t *)acc;\n const uint64_t *xinput = (const uint64_t *)(const void *)input;\n const uint64_t *xsecret = (const uint64_t *)(const void *)secret;\n svuint64_t kSwap = sveor_n_u64_z(svptrue_b64(), svindex_u64(0, 1), 1);\n uint64_t element_count = svcntd();\n if (element_count >= 8) {\n svbool_t mask = svptrue_pat_b64(SV_VL8);\n svuint64_t vacc = svld1_u64(mask, xacc + 0);\n do {\n /* svprfd(svbool_t, void *, enum svfprop); */\n svprfd(mask, xinput + 128, SV_PLDL1STRM);\n ACCRND(vacc, 0);\n xinput += 8;\n xsecret += 1;\n nbStripes--;\n } while (nbStripes != 0);\n\n svst1_u64(mask, xacc + 0, vacc);\n } else if (element_count == 2) { /* sve128 */\n svbool_t mask = svptrue_pat_b64(SV_VL2);\n svuint64_t acc0 = svld1_u64(mask, xacc + 0);\n svuint64_t acc1 = svld1_u64(mask, xacc + 2);\n svuint64_t acc2 = svld1_u64(mask, xacc + 4);\n svuint64_t acc3 = svld1_u64(mask, xacc + 6);\n do {\n svprfd(mask, xinput + 128, SV_PLDL1STRM);\n ACCRND(acc0, 0);\n ACCRND(acc1, 2);\n ACCRND(acc2, 4);\n ACCRND(acc3, 6);\n xinput += 8;\n xsecret += 1;\n nbStripes--;\n } while (nbStripes != 0);\n\n svst1_u64(mask, xacc + 0, acc0);\n svst1_u64(mask, xacc + 2, acc1);\n svst1_u64(mask, xacc + 4, acc2);\n svst1_u64(mask, xacc + 6, acc3);\n } else {\n svbool_t mask = svptrue_pat_b64(SV_VL4);\n svuint64_t acc0 = svld1_u64(mask, xacc + 0);\n svuint64_t acc1 = svld1_u64(mask, xacc + 4);\n do {\n svprfd(mask, xinput + 128, SV_PLDL1STRM);\n ACCRND(acc0, 0);\n ACCRND(acc1, 4);\n xinput += 8;\n xsecret += 1;\n nbStripes--;\n } while (nbStripes != 0);\n\n svst1_u64(mask, xacc + 0, acc0);\n svst1_u64(mask, xacc + 4, acc1);\n }\n }\n}\n\n#endif\n\n#if (XXH_VECTOR == XXH_LSX)\n#define _LSX_SHUFFLE(z, y, x, w) (((z) << 6) | ((y) << 4) | ((x) << 2) | (w))\n\nXXH_FORCE_INLINE void\nXXH3_accumulate_512_lsx( void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 15) == 0);\n {\n __m128i* const xacc = (__m128i *) acc;\n const __m128i* const xinput = (const __m128i *) input;\n const __m128i* const xsecret = (const __m128i *) secret;\n\n for (size_t i = 0; i < XXH_STRIPE_LEN / sizeof(__m128i); i++) {\n /* data_vec = xinput[i]; */\n __m128i const data_vec = __lsx_vld(xinput + i, 0);\n /* key_vec = xsecret[i]; */\n __m128i const key_vec = __lsx_vld(xsecret + i, 0);\n /* data_key = data_vec ^ key_vec; */\n __m128i const data_key = __lsx_vxor_v(data_vec, key_vec);\n /* data_key_lo = data_key >> 32; */\n __m128i const data_key_lo = __lsx_vsrli_d(data_key, 32);\n // __m128i const data_key_lo = __lsx_vsrli_d(data_key, 32);\n /* product = (data_key & 0xffffffff) * (data_key_lo & 0xffffffff); */\n __m128i const product = __lsx_vmulwev_d_wu(data_key, data_key_lo);\n /* xacc[i] += swap(data_vec); */\n __m128i const data_swap = __lsx_vshuf4i_w(data_vec, _LSX_SHUFFLE(1, 0, 3, 2));\n __m128i const sum = __lsx_vadd_d(xacc[i], data_swap);\n /* xacc[i] += product; */\n xacc[i] = __lsx_vadd_d(product, sum);\n }\n }\n}\nXXH_FORCE_INLINE XXH3_ACCUMULATE_TEMPLATE(lsx)\n\nXXH_FORCE_INLINE void\nXXH3_scrambleAcc_lsx(void* XXH_RESTRICT acc, const void* XXH_RESTRICT secret)\n{\n XXH_ASSERT((((size_t)acc) & 15) == 0);\n {\n __m128i* const xacc = (__m128i*) acc;\n const __m128i* const xsecret = (const __m128i *) secret;\n const __m128i prime32 = __lsx_vreplgr2vr_w((int)XXH_PRIME32_1);\n\n for (size_t i = 0; i < XXH_STRIPE_LEN / sizeof(__m128i); i++) {\n /* xacc[i] ^= (xacc[i] >> 47) */\n __m128i const acc_vec = xacc[i];\n __m128i const shifted = __lsx_vsrli_d(acc_vec, 47);\n __m128i const data_vec = __lsx_vxor_v(acc_vec, shifted);\n /* xacc[i] ^= xsecret[i]; */\n __m128i const key_vec = __lsx_vld(xsecret + i, 0);\n __m128i const data_key = __lsx_vxor_v(data_vec, key_vec);\n\n /* xacc[i] *= XXH_PRIME32_1; */\n __m128i const data_key_hi = __lsx_vsrli_d(data_key, 32);\n __m128i const prod_lo = __lsx_vmulwev_d_wu(data_key, prime32);\n __m128i const prod_hi = __lsx_vmulwev_d_wu(data_key_hi, prime32);\n xacc[i] = __lsx_vadd_d(prod_lo, __lsx_vslli_d(prod_hi, 32));\n }\n }\n}\n\n#endif\n\n/* scalar variants - universal */\n\n#if defined(__aarch64__) && (defined(__GNUC__) || defined(__clang__))\n/*\n * In XXH3_scalarRound(), GCC and Clang have a similar codegen issue, where they\n * emit an excess mask and a full 64-bit multiply-add (MADD X-form).\n *\n * While this might not seem like much, as AArch64 is a 64-bit architecture, only\n * big Cortex designs have a full 64-bit multiplier.\n *\n * On the little cores, the smaller 32-bit multiplier is used, and full 64-bit\n * multiplies expand to 2-3 multiplies in microcode. This has a major penalty\n * of up to 4 latency cycles and 2 stall cycles in the multiply pipeline.\n *\n * Thankfully, AArch64 still provides the 32-bit long multiply-add (UMADDL) which does\n * not have this penalty and does the mask automatically.\n */\nXXH_FORCE_INLINE xxh_u64\nXXH_mult32to64_add64(xxh_u64 lhs, xxh_u64 rhs, xxh_u64 acc)\n{\n xxh_u64 ret;\n /* note: %x = 64-bit register, %w = 32-bit register */\n __asm__(\"umaddl %x0, %w1, %w2, %x3\" : \"=r\" (ret) : \"r\" (lhs), \"r\" (rhs), \"r\" (acc));\n return ret;\n}\n#else\nXXH_FORCE_INLINE xxh_u64\nXXH_mult32to64_add64(xxh_u64 lhs, xxh_u64 rhs, xxh_u64 acc)\n{\n return XXH_mult32to64((xxh_u32)lhs, (xxh_u32)rhs) + acc;\n}\n#endif\n\n/*!\n * @internal\n * @brief Scalar round for @ref XXH3_accumulate_512_scalar().\n *\n * This is extracted to its own function because the NEON path uses a combination\n * of NEON and scalar.\n */\nXXH_FORCE_INLINE void\nXXH3_scalarRound(void* XXH_RESTRICT acc,\n void const* XXH_RESTRICT input,\n void const* XXH_RESTRICT secret,\n size_t lane)\n{\n xxh_u64* xacc = (xxh_u64*) acc;\n xxh_u8 const* xinput = (xxh_u8 const*) input;\n xxh_u8 const* xsecret = (xxh_u8 const*) secret;\n XXH_ASSERT(lane < XXH_ACC_NB);\n XXH_ASSERT(((size_t)acc & (XXH_ACC_ALIGN-1)) == 0);\n {\n xxh_u64 const data_val = XXH_readLE64(xinput + lane * 8);\n xxh_u64 const data_key = data_val ^ XXH_readLE64(xsecret + lane * 8);\n xacc[lane ^ 1] += data_val; /* swap adjacent lanes */\n xacc[lane] = XXH_mult32to64_add64(data_key /* & 0xFFFFFFFF */, data_key >> 32, xacc[lane]);\n }\n}\n\n/*!\n * @internal\n * @brief Processes a 64 byte block of data using the scalar path.\n */\nXXH_FORCE_INLINE void\nXXH3_accumulate_512_scalar(void* XXH_RESTRICT acc,\n const void* XXH_RESTRICT input,\n const void* XXH_RESTRICT secret)\n{\n size_t i;\n /* ARM GCC refuses to unroll this loop, resulting in a 24% slowdown on ARMv6. */\n#if defined(__GNUC__) && !defined(__clang__) \\\n && (defined(__arm__) || defined(__thumb2__)) \\\n && defined(__ARM_FEATURE_UNALIGNED) /* no unaligned access just wastes bytes */ \\\n && XXH_SIZE_OPT <= 0\n# pragma GCC unroll 8\n#endif\n for (i=0; i < XXH_ACC_NB; i++) {\n XXH3_scalarRound(acc, input, secret, i);\n }\n}\nXXH_FORCE_INLINE XXH3_ACCUMULATE_TEMPLATE(scalar)\n\n/*!\n * @internal\n * @brief Scalar scramble step for @ref XXH3_scrambleAcc_scalar().\n *\n * This is extracted to its own function because the NEON path uses a combination\n * of NEON and scalar.\n */\nXXH_FORCE_INLINE void\nXXH3_scalarScrambleRound(void* XXH_RESTRICT acc,\n void const* XXH_RESTRICT secret,\n size_t lane)\n{\n xxh_u64* const xacc = (xxh_u64*) acc; /* presumed aligned */\n const xxh_u8* const xsecret = (const xxh_u8*) secret; /* no alignment restriction */\n XXH_ASSERT((((size_t)acc) & (XXH_ACC_ALIGN-1)) == 0);\n XXH_ASSERT(lane < XXH_ACC_NB);\n {\n xxh_u64 const key64 = XXH_readLE64(xsecret + lane * 8);\n xxh_u64 acc64 = xacc[lane];\n acc64 = XXH_xorshift64(acc64, 47);\n acc64 ^= key64;\n acc64 *= XXH_PRIME32_1;\n xacc[lane] = acc64;\n }\n}\n\n/*!\n * @internal\n * @brief Scrambles the accumulators after a large chunk has been read\n */\nXXH_FORCE_INLINE void\nXXH3_scrambleAcc_scalar(void* XXH_RESTRICT acc, const void* XXH_RESTRICT secret)\n{\n size_t i;\n for (i=0; i < XXH_ACC_NB; i++) {\n XXH3_scalarScrambleRound(acc, secret, i);\n }\n}\n\nXXH_FORCE_INLINE void\nXXH3_initCustomSecret_scalar(void* XXH_RESTRICT customSecret, xxh_u64 seed64)\n{\n /*\n * We need a separate pointer for the hack below,\n * which requires a non-const pointer.\n * Any decent compiler will optimize this out otherwise.\n */\n const xxh_u8* kSecretPtr = XXH3_kSecret;\n XXH_STATIC_ASSERT((XXH_SECRET_DEFAULT_SIZE & 15) == 0);\n\n#if defined(__GNUC__) && defined(__aarch64__)\n /*\n * UGLY HACK:\n * GCC and Clang generate a bunch of MOV/MOVK pairs for aarch64, and they are\n * placed sequentially, in order, at the top of the unrolled loop.\n *\n * While MOVK is great for generating constants (2 cycles for a 64-bit\n * constant compared to 4 cycles for LDR), it fights for bandwidth with\n * the arithmetic instructions.\n *\n * I L S\n * MOVK\n * MOVK\n * MOVK\n * MOVK\n * ADD\n * SUB STR\n * STR\n * By forcing loads from memory (as the asm line causes the compiler to assume\n * that XXH3_kSecretPtr has been changed), the pipelines are used more\n * efficiently:\n * I L S\n * LDR\n * ADD LDR\n * SUB STR\n * STR\n *\n * See XXH3_NEON_LANES for details on the pipsline.\n *\n * XXH3_64bits_withSeed, len == 256, Snapdragon 835\n * without hack: 2654.4 MB/s\n * with hack: 3202.9 MB/s\n */\n XXH_COMPILER_GUARD(kSecretPtr);\n#endif\n { int const nbRounds = XXH_SECRET_DEFAULT_SIZE / 16;\n int i;\n for (i=0; i < nbRounds; i++) {\n /*\n * The asm hack causes the compiler to assume that kSecretPtr aliases with\n * customSecret, and on aarch64, this prevented LDP from merging two\n * loads together for free. Putting the loads together before the stores\n * properly generates LDP.\n */\n xxh_u64 lo = XXH_readLE64(kSecretPtr + 16*i) + seed64;\n xxh_u64 hi = XXH_readLE64(kSecretPtr + 16*i + 8) - seed64;\n XXH_writeLE64((xxh_u8*)customSecret + 16*i, lo);\n XXH_writeLE64((xxh_u8*)customSecret + 16*i + 8, hi);\n } }\n}\n\n\ntypedef void (*XXH3_f_accumulate)(xxh_u64* XXH_RESTRICT, const xxh_u8* XXH_RESTRICT, const xxh_u8* XXH_RESTRICT, size_t);\ntypedef void (*XXH3_f_scrambleAcc)(void* XXH_RESTRICT, const void*);\ntypedef void (*XXH3_f_initCustomSecret)(void* XXH_RESTRICT, xxh_u64);\n\n\n#if (XXH_VECTOR == XXH_AVX512)\n\n#define XXH3_accumulate_512 XXH3_accumulate_512_avx512\n#define XXH3_accumulate XXH3_accumulate_avx512\n#define XXH3_scrambleAcc XXH3_scrambleAcc_avx512\n#define XXH3_initCustomSecret XXH3_initCustomSecret_avx512\n\n#elif (XXH_VECTOR == XXH_AVX2)\n\n#define XXH3_accumulate_512 XXH3_accumulate_512_avx2\n#define XXH3_accumulate XXH3_accumulate_avx2\n#define XXH3_scrambleAcc XXH3_scrambleAcc_avx2\n#define XXH3_initCustomSecret XXH3_initCustomSecret_avx2\n\n#elif (XXH_VECTOR == XXH_SSE2)\n\n#define XXH3_accumulate_512 XXH3_accumulate_512_sse2\n#define XXH3_accumulate XXH3_accumulate_sse2\n#define XXH3_scrambleAcc XXH3_scrambleAcc_sse2\n#define XXH3_initCustomSecret XXH3_initCustomSecret_sse2\n\n#elif (XXH_VECTOR == XXH_NEON)\n\n#define XXH3_accumulate_512 XXH3_accumulate_512_neon\n#define XXH3_accumulate XXH3_accumulate_neon\n#define XXH3_scrambleAcc XXH3_scrambleAcc_neon\n#define XXH3_initCustomSecret XXH3_initCustomSecret_scalar\n\n#elif (XXH_VECTOR == XXH_VSX)\n\n#define XXH3_accumulate_512 XXH3_accumulate_512_vsx\n#define XXH3_accumulate XXH3_accumulate_vsx\n#define XXH3_scrambleAcc XXH3_scrambleAcc_vsx\n#define XXH3_initCustomSecret XXH3_initCustomSecret_scalar\n\n#elif (XXH_VECTOR == XXH_SVE)\n#define XXH3_accumulate_512 XXH3_accumulate_512_sve\n#define XXH3_accumulate XXH3_accumulate_sve\n#define XXH3_scrambleAcc XXH3_scrambleAcc_scalar\n#define XXH3_initCustomSecret XXH3_initCustomSecret_scalar\n\n#elif (XXH_VECTOR == XXH_LSX)\n#define XXH3_accumulate_512 XXH3_accumulate_512_lsx\n#define XXH3_accumulate XXH3_accumulate_lsx\n#define XXH3_scrambleAcc XXH3_scrambleAcc_lsx\n#define XXH3_initCustomSecret XXH3_initCustomSecret_scalar\n\n#else /* scalar */\n\n#define XXH3_accumulate_512 XXH3_accumulate_512_scalar\n#define XXH3_accumulate XXH3_accumulate_scalar\n#define XXH3_scrambleAcc XXH3_scrambleAcc_scalar\n#define XXH3_initCustomSecret XXH3_initCustomSecret_scalar\n\n#endif\n\n#if XXH_SIZE_OPT >= 1 /* don't do SIMD for initialization */\n# undef XXH3_initCustomSecret\n# define XXH3_initCustomSecret XXH3_initCustomSecret_scalar\n#endif\n\nXXH_FORCE_INLINE void\nXXH3_hashLong_internal_loop(xxh_u64* XXH_RESTRICT acc,\n const xxh_u8* XXH_RESTRICT input, size_t len,\n const xxh_u8* XXH_RESTRICT secret, size_t secretSize,\n XXH3_f_accumulate f_acc,\n XXH3_f_scrambleAcc f_scramble)\n{\n size_t const nbStripesPerBlock = (secretSize - XXH_STRIPE_LEN) / XXH_SECRET_CONSUME_RATE;\n size_t const block_len = XXH_STRIPE_LEN * nbStripesPerBlock;\n size_t const nb_blocks = (len - 1) / block_len;\n\n size_t n;\n\n XXH_ASSERT(secretSize >= XXH3_SECRET_SIZE_MIN);\n\n for (n = 0; n < nb_blocks; n++) {\n f_acc(acc, input + n*block_len, secret, nbStripesPerBlock);\n f_scramble(acc, secret + secretSize - XXH_STRIPE_LEN);\n }\n\n /* last partial block */\n XXH_ASSERT(len > XXH_STRIPE_LEN);\n { size_t const nbStripes = ((len - 1) - (block_len * nb_blocks)) / XXH_STRIPE_LEN;\n XXH_ASSERT(nbStripes <= (secretSize / XXH_SECRET_CONSUME_RATE));\n f_acc(acc, input + nb_blocks*block_len, secret, nbStripes);\n\n /* last stripe */\n { const xxh_u8* const p = input + len - XXH_STRIPE_LEN;\n#define XXH_SECRET_LASTACC_START 7 /* not aligned on 8, last secret is different from acc & scrambler */\n XXH3_accumulate_512(acc, p, secret + secretSize - XXH_STRIPE_LEN - XXH_SECRET_LASTACC_START);\n } }\n}\n\nXXH_FORCE_INLINE xxh_u64\nXXH3_mix2Accs(const xxh_u64* XXH_RESTRICT acc, const xxh_u8* XXH_RESTRICT secret)\n{\n return XXH3_mul128_fold64(\n acc[0] ^ XXH_readLE64(secret),\n acc[1] ^ XXH_readLE64(secret+8) );\n}\n\nstatic XXH_PUREF XXH64_hash_t\nXXH3_mergeAccs(const xxh_u64* XXH_RESTRICT acc, const xxh_u8* XXH_RESTRICT secret, xxh_u64 start)\n{\n xxh_u64 result64 = start;\n size_t i = 0;\n\n for (i = 0; i < 4; i++) {\n result64 += XXH3_mix2Accs(acc+2*i, secret + 16*i);\n#if defined(__clang__) /* Clang */ \\\n && (defined(__arm__) || defined(__thumb__)) /* ARMv7 */ \\\n && (defined(__ARM_NEON) || defined(__ARM_NEON__)) /* NEON */ \\\n && !defined(XXH_ENABLE_AUTOVECTORIZE) /* Define to disable */\n /*\n * UGLY HACK:\n * Prevent autovectorization on Clang ARMv7-a. Exact same problem as\n * the one in XXH3_len_129to240_64b. Speeds up shorter keys > 240b.\n * XXH3_64bits, len == 256, Snapdragon 835:\n * without hack: 2063.7 MB/s\n * with hack: 2560.7 MB/s\n */\n XXH_COMPILER_GUARD(result64);\n#endif\n }\n\n return XXH3_avalanche(result64);\n}\n\n/* do not align on 8, so that the secret is different from the accumulator */\n#define XXH_SECRET_MERGEACCS_START 11\n\nstatic XXH_PUREF XXH64_hash_t\nXXH3_finalizeLong_64b(const xxh_u64* XXH_RESTRICT acc, const xxh_u8* XXH_RESTRICT secret, xxh_u64 len)\n{\n return XXH3_mergeAccs(acc, secret + XXH_SECRET_MERGEACCS_START, len * XXH_PRIME64_1);\n}\n\n#define XXH3_INIT_ACC { XXH_PRIME32_3, XXH_PRIME64_1, XXH_PRIME64_2, XXH_PRIME64_3, \\\n XXH_PRIME64_4, XXH_PRIME32_2, XXH_PRIME64_5, XXH_PRIME32_1 }\n\nXXH_FORCE_INLINE XXH64_hash_t\nXXH3_hashLong_64b_internal(const void* XXH_RESTRICT input, size_t len,\n const void* XXH_RESTRICT secret, size_t secretSize,\n XXH3_f_accumulate f_acc,\n XXH3_f_scrambleAcc f_scramble)\n{\n XXH_ALIGN(XXH_ACC_ALIGN) xxh_u64 acc[XXH_ACC_NB] = XXH3_INIT_ACC;\n\n XXH3_hashLong_internal_loop(acc, (const xxh_u8*)input, len, (const xxh_u8*)secret, secretSize, f_acc, f_scramble);\n\n /* converge into final hash */\n XXH_STATIC_ASSERT(sizeof(acc) == 64);\n XXH_ASSERT(secretSize >= sizeof(acc) + XXH_SECRET_MERGEACCS_START);\n return XXH3_finalizeLong_64b(acc, (const xxh_u8*)secret, (xxh_u64)len);\n}\n\n/*\n * It's important for performance to transmit secret's size (when it's static)\n * so that the compiler can properly optimize the vectorized loop.\n * This makes a big performance difference for \"medium\" keys (<1 KB) when using AVX instruction set.\n * When the secret size is unknown, or on GCC 12 where the mix of NO_INLINE and FORCE_INLINE\n * breaks -Og, this is XXH_NO_INLINE.\n */\nXXH3_WITH_SECRET_INLINE XXH64_hash_t\nXXH3_hashLong_64b_withSecret(const void* XXH_RESTRICT input, size_t len,\n XXH64_hash_t seed64, const xxh_u8* XXH_RESTRICT secret, size_t secretLen)\n{\n (void)seed64;\n return XXH3_hashLong_64b_internal(input, len, secret, secretLen, XXH3_accumulate, XXH3_scrambleAcc);\n}\n\n/*\n * It's preferable for performance that XXH3_hashLong is not inlined,\n * as it results in a smaller function for small data, easier to the instruction cache.\n * Note that inside this no_inline function, we do inline the internal loop,\n * and provide a statically defined secret size to allow optimization of vector loop.\n */\nXXH_NO_INLINE XXH_PUREF XXH64_hash_t\nXXH3_hashLong_64b_default(const void* XXH_RESTRICT input, size_t len,\n XXH64_hash_t seed64, const xxh_u8* XXH_RESTRICT secret, size_t secretLen)\n{\n (void)seed64; (void)secret; (void)secretLen;\n return XXH3_hashLong_64b_internal(input, len, XXH3_kSecret, sizeof(XXH3_kSecret), XXH3_accumulate, XXH3_scrambleAcc);\n}\n\n/*\n * XXH3_hashLong_64b_withSeed():\n * Generate a custom key based on alteration of default XXH3_kSecret with the seed,\n * and then use this key for long mode hashing.\n *\n * This operation is decently fast but nonetheless costs a little bit of time.\n * Try to avoid it whenever possible (typically when seed==0).\n *\n * It's important for performance that XXH3_hashLong is not inlined. Not sure\n * why (uop cache maybe?), but the difference is large and easily measurable.\n */\nXXH_FORCE_INLINE XXH64_hash_t\nXXH3_hashLong_64b_withSeed_internal(const void* input, size_t len,\n XXH64_hash_t seed,\n XXH3_f_accumulate f_acc,\n XXH3_f_scrambleAcc f_scramble,\n XXH3_f_initCustomSecret f_initSec)\n{\n#if XXH_SIZE_OPT <= 0\n if (seed == 0)\n return XXH3_hashLong_64b_internal(input, len,\n XXH3_kSecret, sizeof(XXH3_kSecret),\n f_acc, f_scramble);\n#endif\n { XXH_ALIGN(XXH_SEC_ALIGN) xxh_u8 secret[XXH_SECRET_DEFAULT_SIZE];\n f_initSec(secret, seed);\n return XXH3_hashLong_64b_internal(input, len, secret, sizeof(secret),\n f_acc, f_scramble);\n }\n}\n\n/*\n * It's important for performance that XXH3_hashLong is not inlined.\n */\nXXH_NO_INLINE XXH64_hash_t\nXXH3_hashLong_64b_withSeed(const void* XXH_RESTRICT input, size_t len,\n XXH64_hash_t seed, const xxh_u8* XXH_RESTRICT secret, size_t secretLen)\n{\n (void)secret; (void)secretLen;\n return XXH3_hashLong_64b_withSeed_internal(input, len, seed,\n XXH3_accumulate, XXH3_scrambleAcc, XXH3_initCustomSecret);\n}\n\n\ntypedef XXH64_hash_t (*XXH3_hashLong64_f)(const void* XXH_RESTRICT, size_t,\n XXH64_hash_t, const xxh_u8* XXH_RESTRICT, size_t);\n\nXXH_FORCE_INLINE XXH64_hash_t\nXXH3_64bits_internal(const void* XXH_RESTRICT input, size_t len,\n XXH64_hash_t seed64, const void* XXH_RESTRICT secret, size_t secretLen,\n XXH3_hashLong64_f f_hashLong)\n{\n XXH_ASSERT(secretLen >= XXH3_SECRET_SIZE_MIN);\n /*\n * If an action is to be taken if `secretLen` condition is not respected,\n * it should be done here.\n * For now, it's a contract pre-condition.\n * Adding a check and a branch here would cost performance at every hash.\n * Also, note that function signature doesn't offer room to return an error.\n */\n if (len <= 16)\n return XXH3_len_0to16_64b((const xxh_u8*)input, len, (const xxh_u8*)secret, seed64);\n if (len <= 128)\n return XXH3_len_17to128_64b((const xxh_u8*)input, len, (const xxh_u8*)secret, secretLen, seed64);\n if (len <= XXH3_MIDSIZE_MAX)\n return XXH3_len_129to240_64b((const xxh_u8*)input, len, (const xxh_u8*)secret, secretLen, seed64);\n return f_hashLong(input, len, seed64, (const xxh_u8*)secret, secretLen);\n}\n\n\n/* === Public entry point === */\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH64_hash_t XXH3_64bits(XXH_NOESCAPE const void* input, size_t length)\n{\n return XXH3_64bits_internal(input, length, 0, XXH3_kSecret, sizeof(XXH3_kSecret), XXH3_hashLong_64b_default);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH64_hash_t\nXXH3_64bits_withSecret(XXH_NOESCAPE const void* input, size_t length, XXH_NOESCAPE const void* secret, size_t secretSize)\n{\n return XXH3_64bits_internal(input, length, 0, secret, secretSize, XXH3_hashLong_64b_withSecret);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH64_hash_t\nXXH3_64bits_withSeed(XXH_NOESCAPE const void* input, size_t length, XXH64_hash_t seed)\n{\n return XXH3_64bits_internal(input, length, seed, XXH3_kSecret, sizeof(XXH3_kSecret), XXH3_hashLong_64b_withSeed);\n}\n\nXXH_PUBLIC_API XXH64_hash_t\nXXH3_64bits_withSecretandSeed(XXH_NOESCAPE const void* input, size_t length, XXH_NOESCAPE const void* secret, size_t secretSize, XXH64_hash_t seed)\n{\n if (length <= XXH3_MIDSIZE_MAX)\n return XXH3_64bits_internal(input, length, seed, XXH3_kSecret, sizeof(XXH3_kSecret), NULL);\n return XXH3_hashLong_64b_withSecret(input, length, seed, (const xxh_u8*)secret, secretSize);\n}\n\n\n/* === XXH3 streaming === */\n#ifndef XXH_NO_STREAM\n/*\n * Malloc's a pointer that is always aligned to @align.\n *\n * This must be freed with `XXH_alignedFree()`.\n *\n * malloc typically guarantees 16 byte alignment on 64-bit systems and 8 byte\n * alignment on 32-bit. This isn't enough for the 32 byte aligned loads in AVX2\n * or on 32-bit, the 16 byte aligned loads in SSE2 and NEON.\n *\n * This underalignment previously caused a rather obvious crash which went\n * completely unnoticed due to XXH3_createState() not actually being tested.\n * Credit to RedSpah for noticing this bug.\n *\n * The alignment is done manually: Functions like posix_memalign or _mm_malloc\n * are avoided: To maintain portability, we would have to write a fallback\n * like this anyways, and besides, testing for the existence of library\n * functions without relying on external build tools is impossible.\n *\n * The method is simple: Overallocate, manually align, and store the offset\n * to the original behind the returned pointer.\n *\n * Align must be a power of 2 and 8 <= align <= 128.\n */\nstatic XXH_MALLOCF void* XXH_alignedMalloc(size_t s, size_t align)\n{\n XXH_ASSERT(align <= 128 && align >= 8); /* range check */\n XXH_ASSERT((align & (align-1)) == 0); /* power of 2 */\n XXH_ASSERT(s != 0 && s < (s + align)); /* empty/overflow */\n { /* Overallocate to make room for manual realignment and an offset byte */\n xxh_u8* base = (xxh_u8*)XXH_malloc(s + align);\n if (base != NULL) {\n /*\n * Get the offset needed to align this pointer.\n *\n * Even if the returned pointer is aligned, there will always be\n * at least one byte to store the offset to the original pointer.\n */\n size_t offset = align - ((size_t)base & (align - 1)); /* base % align */\n /* Add the offset for the now-aligned pointer */\n xxh_u8* ptr = base + offset;\n\n XXH_ASSERT((size_t)ptr % align == 0);\n\n /* Store the offset immediately before the returned pointer. */\n ptr[-1] = (xxh_u8)offset;\n return ptr;\n }\n return NULL;\n }\n}\n/*\n * Frees an aligned pointer allocated by XXH_alignedMalloc(). Don't pass\n * normal malloc'd pointers, XXH_alignedMalloc has a specific data layout.\n */\nstatic void XXH_alignedFree(void* p)\n{\n if (p != NULL) {\n xxh_u8* ptr = (xxh_u8*)p;\n /* Get the offset byte we added in XXH_malloc. */\n xxh_u8 offset = ptr[-1];\n /* Free the original malloc'd pointer */\n xxh_u8* base = ptr - offset;\n XXH_free(base);\n }\n}\n/*! @ingroup XXH3_family */\n/*!\n * @brief Allocate an @ref XXH3_state_t.\n *\n * @return An allocated pointer of @ref XXH3_state_t on success.\n * @return `NULL` on failure.\n *\n * @note Must be freed with XXH3_freeState().\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH3_state_t* XXH3_createState(void)\n{\n XXH3_state_t* const state = (XXH3_state_t*)XXH_alignedMalloc(sizeof(XXH3_state_t), 64);\n if (state==NULL) return NULL;\n XXH3_INITSTATE(state);\n return state;\n}\n\n/*! @ingroup XXH3_family */\n/*!\n * @brief Frees an @ref XXH3_state_t.\n *\n * @param statePtr A pointer to an @ref XXH3_state_t allocated with @ref XXH3_createState().\n *\n * @return @ref XXH_OK.\n *\n * @note Must be allocated with XXH3_createState().\n *\n * @see @ref streaming_example \"Streaming Example\"\n */\nXXH_PUBLIC_API XXH_errorcode XXH3_freeState(XXH3_state_t* statePtr)\n{\n XXH_alignedFree(statePtr);\n return XXH_OK;\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API void\nXXH3_copyState(XXH_NOESCAPE XXH3_state_t* dst_state, XXH_NOESCAPE const XXH3_state_t* src_state)\n{\n XXH_memcpy(dst_state, src_state, sizeof(*dst_state));\n}\n\nstatic void\nXXH3_reset_internal(XXH3_state_t* statePtr,\n XXH64_hash_t seed,\n const void* secret, size_t secretSize)\n{\n size_t const initStart = offsetof(XXH3_state_t, bufferedSize);\n size_t const initLength = offsetof(XXH3_state_t, nbStripesPerBlock) - initStart;\n XXH_ASSERT(offsetof(XXH3_state_t, nbStripesPerBlock) > initStart);\n XXH_ASSERT(statePtr != NULL);\n /* set members from bufferedSize to nbStripesPerBlock (excluded) to 0 */\n memset((char*)statePtr + initStart, 0, initLength);\n statePtr->acc[0] = XXH_PRIME32_3;\n statePtr->acc[1] = XXH_PRIME64_1;\n statePtr->acc[2] = XXH_PRIME64_2;\n statePtr->acc[3] = XXH_PRIME64_3;\n statePtr->acc[4] = XXH_PRIME64_4;\n statePtr->acc[5] = XXH_PRIME32_2;\n statePtr->acc[6] = XXH_PRIME64_5;\n statePtr->acc[7] = XXH_PRIME32_1;\n statePtr->seed = seed;\n statePtr->useSeed = (seed != 0);\n statePtr->extSecret = (const unsigned char*)secret;\n XXH_ASSERT(secretSize >= XXH3_SECRET_SIZE_MIN);\n statePtr->secretLimit = secretSize - XXH_STRIPE_LEN;\n statePtr->nbStripesPerBlock = statePtr->secretLimit / XXH_SECRET_CONSUME_RATE;\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_64bits_reset(XXH_NOESCAPE XXH3_state_t* statePtr)\n{\n if (statePtr == NULL) return XXH_ERROR;\n XXH3_reset_internal(statePtr, 0, XXH3_kSecret, XXH_SECRET_DEFAULT_SIZE);\n return XXH_OK;\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_64bits_reset_withSecret(XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* secret, size_t secretSize)\n{\n if (statePtr == NULL) return XXH_ERROR;\n XXH3_reset_internal(statePtr, 0, secret, secretSize);\n if (secret == NULL) return XXH_ERROR;\n if (secretSize < XXH3_SECRET_SIZE_MIN) return XXH_ERROR;\n return XXH_OK;\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_64bits_reset_withSeed(XXH_NOESCAPE XXH3_state_t* statePtr, XXH64_hash_t seed)\n{\n if (statePtr == NULL) return XXH_ERROR;\n if (seed==0) return XXH3_64bits_reset(statePtr);\n if ((seed != statePtr->seed) || (statePtr->extSecret != NULL))\n XXH3_initCustomSecret(statePtr->customSecret, seed);\n XXH3_reset_internal(statePtr, seed, NULL, XXH_SECRET_DEFAULT_SIZE);\n return XXH_OK;\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_64bits_reset_withSecretandSeed(XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* secret, size_t secretSize, XXH64_hash_t seed64)\n{\n if (statePtr == NULL) return XXH_ERROR;\n if (secret == NULL) return XXH_ERROR;\n if (secretSize < XXH3_SECRET_SIZE_MIN) return XXH_ERROR;\n XXH3_reset_internal(statePtr, seed64, secret, secretSize);\n statePtr->useSeed = 1; /* always, even if seed64==0 */\n return XXH_OK;\n}\n\n/*!\n * @internal\n * @brief Processes a large input for XXH3_update() and XXH3_digest_long().\n *\n * Unlike XXH3_hashLong_internal_loop(), this can process data that overlaps a block.\n *\n * @param acc Pointer to the 8 accumulator lanes\n * @param nbStripesSoFarPtr In/out pointer to the number of leftover stripes in the block*\n * @param nbStripesPerBlock Number of stripes in a block\n * @param input Input pointer\n * @param nbStripes Number of stripes to process\n * @param secret Secret pointer\n * @param secretLimit Offset of the last block in @p secret\n * @param f_acc Pointer to an XXH3_accumulate implementation\n * @param f_scramble Pointer to an XXH3_scrambleAcc implementation\n * @return Pointer past the end of @p input after processing\n */\nXXH_FORCE_INLINE const xxh_u8 *\nXXH3_consumeStripes(xxh_u64* XXH_RESTRICT acc,\n size_t* XXH_RESTRICT nbStripesSoFarPtr, size_t nbStripesPerBlock,\n const xxh_u8* XXH_RESTRICT input, size_t nbStripes,\n const xxh_u8* XXH_RESTRICT secret, size_t secretLimit,\n XXH3_f_accumulate f_acc,\n XXH3_f_scrambleAcc f_scramble)\n{\n const xxh_u8* initialSecret = secret + *nbStripesSoFarPtr * XXH_SECRET_CONSUME_RATE;\n /* Process full blocks */\n if (nbStripes >= (nbStripesPerBlock - *nbStripesSoFarPtr)) {\n /* Process the initial partial block... */\n size_t nbStripesThisIter = nbStripesPerBlock - *nbStripesSoFarPtr;\n\n do {\n /* Accumulate and scramble */\n f_acc(acc, input, initialSecret, nbStripesThisIter);\n f_scramble(acc, secret + secretLimit);\n input += nbStripesThisIter * XXH_STRIPE_LEN;\n nbStripes -= nbStripesThisIter;\n /* Then continue the loop with the full block size */\n nbStripesThisIter = nbStripesPerBlock;\n initialSecret = secret;\n } while (nbStripes >= nbStripesPerBlock);\n *nbStripesSoFarPtr = 0;\n }\n /* Process a partial block */\n if (nbStripes > 0) {\n f_acc(acc, input, initialSecret, nbStripes);\n input += nbStripes * XXH_STRIPE_LEN;\n *nbStripesSoFarPtr += nbStripes;\n }\n /* Return end pointer */\n return input;\n}\n\n#ifndef XXH3_STREAM_USE_STACK\n# if XXH_SIZE_OPT <= 0 && !defined(__clang__) /* clang doesn't need additional stack space */\n# define XXH3_STREAM_USE_STACK 1\n# endif\n#endif\n/*\n * Both XXH3_64bits_update and XXH3_128bits_update use this routine.\n */\nXXH_FORCE_INLINE XXH_errorcode\nXXH3_update(XXH3_state_t* XXH_RESTRICT const state,\n const xxh_u8* XXH_RESTRICT input, size_t len,\n XXH3_f_accumulate f_acc,\n XXH3_f_scrambleAcc f_scramble)\n{\n if (input==NULL) {\n XXH_ASSERT(len == 0);\n return XXH_OK;\n }\n\n XXH_ASSERT(state != NULL);\n { const xxh_u8* const bEnd = input + len;\n const unsigned char* const secret = (state->extSecret == NULL) ? state->customSecret : state->extSecret;\n#if defined(XXH3_STREAM_USE_STACK) && XXH3_STREAM_USE_STACK >= 1\n /* For some reason, gcc and MSVC seem to suffer greatly\n * when operating accumulators directly into state.\n * Operating into stack space seems to enable proper optimization.\n * clang, on the other hand, doesn't seem to need this trick */\n XXH_ALIGN(XXH_ACC_ALIGN) xxh_u64 acc[8];\n XXH_memcpy(acc, state->acc, sizeof(acc));\n#else\n xxh_u64* XXH_RESTRICT const acc = state->acc;\n#endif\n state->totalLen += len;\n XXH_ASSERT(state->bufferedSize <= XXH3_INTERNALBUFFER_SIZE);\n\n /* small input : just fill in tmp buffer */\n if (len <= XXH3_INTERNALBUFFER_SIZE - state->bufferedSize) {\n XXH_memcpy(state->buffer + state->bufferedSize, input, len);\n state->bufferedSize += (XXH32_hash_t)len;\n return XXH_OK;\n }\n\n /* total input is now > XXH3_INTERNALBUFFER_SIZE */\n #define XXH3_INTERNALBUFFER_STRIPES (XXH3_INTERNALBUFFER_SIZE / XXH_STRIPE_LEN)\n XXH_STATIC_ASSERT(XXH3_INTERNALBUFFER_SIZE % XXH_STRIPE_LEN == 0); /* clean multiple */\n\n /*\n * Internal buffer is partially filled (always, except at beginning)\n * Complete it, then consume it.\n */\n if (state->bufferedSize) {\n size_t const loadSize = XXH3_INTERNALBUFFER_SIZE - state->bufferedSize;\n XXH_memcpy(state->buffer + state->bufferedSize, input, loadSize);\n input += loadSize;\n XXH3_consumeStripes(acc,\n &state->nbStripesSoFar, state->nbStripesPerBlock,\n state->buffer, XXH3_INTERNALBUFFER_STRIPES,\n secret, state->secretLimit,\n f_acc, f_scramble);\n state->bufferedSize = 0;\n }\n XXH_ASSERT(input < bEnd);\n if (bEnd - input > XXH3_INTERNALBUFFER_SIZE) {\n size_t nbStripes = (size_t)(bEnd - 1 - input) / XXH_STRIPE_LEN;\n input = XXH3_consumeStripes(acc,\n &state->nbStripesSoFar, state->nbStripesPerBlock,\n input, nbStripes,\n secret, state->secretLimit,\n f_acc, f_scramble);\n XXH_memcpy(state->buffer + sizeof(state->buffer) - XXH_STRIPE_LEN, input - XXH_STRIPE_LEN, XXH_STRIPE_LEN);\n\n }\n /* Some remaining input (always) : buffer it */\n XXH_ASSERT(input < bEnd);\n XXH_ASSERT(bEnd - input <= XXH3_INTERNALBUFFER_SIZE);\n XXH_ASSERT(state->bufferedSize == 0);\n XXH_memcpy(state->buffer, input, (size_t)(bEnd-input));\n state->bufferedSize = (XXH32_hash_t)(bEnd-input);\n#if defined(XXH3_STREAM_USE_STACK) && XXH3_STREAM_USE_STACK >= 1\n /* save stack accumulators into state */\n XXH_memcpy(state->acc, acc, sizeof(acc));\n#endif\n }\n\n return XXH_OK;\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_64bits_update(XXH_NOESCAPE XXH3_state_t* state, XXH_NOESCAPE const void* input, size_t len)\n{\n return XXH3_update(state, (const xxh_u8*)input, len,\n XXH3_accumulate, XXH3_scrambleAcc);\n}\n\n\nXXH_FORCE_INLINE void\nXXH3_digest_long (XXH64_hash_t* acc,\n const XXH3_state_t* state,\n const unsigned char* secret)\n{\n xxh_u8 lastStripe[XXH_STRIPE_LEN];\n const xxh_u8* lastStripePtr;\n\n /*\n * Digest on a local copy. This way, the state remains unaltered, and it can\n * continue ingesting more input afterwards.\n */\n XXH_memcpy(acc, state->acc, sizeof(state->acc));\n if (state->bufferedSize >= XXH_STRIPE_LEN) {\n /* Consume remaining stripes then point to remaining data in buffer */\n size_t const nbStripes = (state->bufferedSize - 1) / XXH_STRIPE_LEN;\n size_t nbStripesSoFar = state->nbStripesSoFar;\n XXH3_consumeStripes(acc,\n &nbStripesSoFar, state->nbStripesPerBlock,\n state->buffer, nbStripes,\n secret, state->secretLimit,\n XXH3_accumulate, XXH3_scrambleAcc);\n lastStripePtr = state->buffer + state->bufferedSize - XXH_STRIPE_LEN;\n } else { /* bufferedSize < XXH_STRIPE_LEN */\n /* Copy to temp buffer */\n size_t const catchupSize = XXH_STRIPE_LEN - state->bufferedSize;\n XXH_ASSERT(state->bufferedSize > 0); /* there is always some input buffered */\n XXH_memcpy(lastStripe, state->buffer + sizeof(state->buffer) - catchupSize, catchupSize);\n XXH_memcpy(lastStripe + catchupSize, state->buffer, state->bufferedSize);\n lastStripePtr = lastStripe;\n }\n /* Last stripe */\n XXH3_accumulate_512(acc,\n lastStripePtr,\n secret + state->secretLimit - XXH_SECRET_LASTACC_START);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH64_hash_t XXH3_64bits_digest (XXH_NOESCAPE const XXH3_state_t* state)\n{\n const unsigned char* const secret = (state->extSecret == NULL) ? state->customSecret : state->extSecret;\n if (state->totalLen > XXH3_MIDSIZE_MAX) {\n XXH_ALIGN(XXH_ACC_ALIGN) XXH64_hash_t acc[XXH_ACC_NB];\n XXH3_digest_long(acc, state, secret);\n return XXH3_finalizeLong_64b(acc, secret, (xxh_u64)state->totalLen);\n }\n /* totalLen <= XXH3_MIDSIZE_MAX: digesting a short input */\n if (state->useSeed)\n return XXH3_64bits_withSeed(state->buffer, (size_t)state->totalLen, state->seed);\n return XXH3_64bits_withSecret(state->buffer, (size_t)(state->totalLen),\n secret, state->secretLimit + XXH_STRIPE_LEN);\n}\n#endif /* !XXH_NO_STREAM */\n\n\n/* ==========================================\n * XXH3 128 bits (a.k.a XXH128)\n * ==========================================\n * XXH3's 128-bit variant has better mixing and strength than the 64-bit variant,\n * even without counting the significantly larger output size.\n *\n * For example, extra steps are taken to avoid the seed-dependent collisions\n * in 17-240 byte inputs (See XXH3_mix16B and XXH128_mix32B).\n *\n * This strength naturally comes at the cost of some speed, especially on short\n * lengths. Note that longer hashes are about as fast as the 64-bit version\n * due to it using only a slight modification of the 64-bit loop.\n *\n * XXH128 is also more oriented towards 64-bit machines. It is still extremely\n * fast for a _128-bit_ hash on 32-bit (it usually clears XXH64).\n */\n\nXXH_FORCE_INLINE XXH_PUREF XXH128_hash_t\nXXH3_len_1to3_128b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n /* A doubled version of 1to3_64b with different constants. */\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(1 <= len && len <= 3);\n XXH_ASSERT(secret != NULL);\n /*\n * len = 1: combinedl = { input[0], 0x01, input[0], input[0] }\n * len = 2: combinedl = { input[1], 0x02, input[0], input[1] }\n * len = 3: combinedl = { input[2], 0x03, input[0], input[1] }\n */\n { xxh_u8 const c1 = input[0];\n xxh_u8 const c2 = input[len >> 1];\n xxh_u8 const c3 = input[len - 1];\n xxh_u32 const combinedl = ((xxh_u32)c1 <<16) | ((xxh_u32)c2 << 24)\n | ((xxh_u32)c3 << 0) | ((xxh_u32)len << 8);\n xxh_u32 const combinedh = XXH_rotl32(XXH_swap32(combinedl), 13);\n xxh_u64 const bitflipl = (XXH_readLE32(secret) ^ XXH_readLE32(secret+4)) + seed;\n xxh_u64 const bitfliph = (XXH_readLE32(secret+8) ^ XXH_readLE32(secret+12)) - seed;\n xxh_u64 const keyed_lo = (xxh_u64)combinedl ^ bitflipl;\n xxh_u64 const keyed_hi = (xxh_u64)combinedh ^ bitfliph;\n XXH128_hash_t h128;\n h128.low64 = XXH64_avalanche(keyed_lo);\n h128.high64 = XXH64_avalanche(keyed_hi);\n return h128;\n }\n}\n\nXXH_FORCE_INLINE XXH_PUREF XXH128_hash_t\nXXH3_len_4to8_128b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(secret != NULL);\n XXH_ASSERT(4 <= len && len <= 8);\n seed ^= (xxh_u64)XXH_swap32((xxh_u32)seed) << 32;\n { xxh_u32 const input_lo = XXH_readLE32(input);\n xxh_u32 const input_hi = XXH_readLE32(input + len - 4);\n xxh_u64 const input_64 = input_lo + ((xxh_u64)input_hi << 32);\n xxh_u64 const bitflip = (XXH_readLE64(secret+16) ^ XXH_readLE64(secret+24)) + seed;\n xxh_u64 const keyed = input_64 ^ bitflip;\n\n /* Shift len to the left to ensure it is even, this avoids even multiplies. */\n XXH128_hash_t m128 = XXH_mult64to128(keyed, XXH_PRIME64_1 + (len << 2));\n\n m128.high64 += (m128.low64 << 1);\n m128.low64 ^= (m128.high64 >> 3);\n\n m128.low64 = XXH_xorshift64(m128.low64, 35);\n m128.low64 *= PRIME_MX2;\n m128.low64 = XXH_xorshift64(m128.low64, 28);\n m128.high64 = XXH3_avalanche(m128.high64);\n return m128;\n }\n}\n\nXXH_FORCE_INLINE XXH_PUREF XXH128_hash_t\nXXH3_len_9to16_128b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n XXH_ASSERT(input != NULL);\n XXH_ASSERT(secret != NULL);\n XXH_ASSERT(9 <= len && len <= 16);\n { xxh_u64 const bitflipl = (XXH_readLE64(secret+32) ^ XXH_readLE64(secret+40)) - seed;\n xxh_u64 const bitfliph = (XXH_readLE64(secret+48) ^ XXH_readLE64(secret+56)) + seed;\n xxh_u64 const input_lo = XXH_readLE64(input);\n xxh_u64 input_hi = XXH_readLE64(input + len - 8);\n XXH128_hash_t m128 = XXH_mult64to128(input_lo ^ input_hi ^ bitflipl, XXH_PRIME64_1);\n /*\n * Put len in the middle of m128 to ensure that the length gets mixed to\n * both the low and high bits in the 128x64 multiply below.\n */\n m128.low64 += (xxh_u64)(len - 1) << 54;\n input_hi ^= bitfliph;\n /*\n * Add the high 32 bits of input_hi to the high 32 bits of m128, then\n * add the long product of the low 32 bits of input_hi and XXH_PRIME32_2 to\n * the high 64 bits of m128.\n *\n * The best approach to this operation is different on 32-bit and 64-bit.\n */\n if (sizeof(void *) < sizeof(xxh_u64)) { /* 32-bit */\n /*\n * 32-bit optimized version, which is more readable.\n *\n * On 32-bit, it removes an ADC and delays a dependency between the two\n * halves of m128.high64, but it generates an extra mask on 64-bit.\n */\n m128.high64 += (input_hi & 0xFFFFFFFF00000000ULL) + XXH_mult32to64((xxh_u32)input_hi, XXH_PRIME32_2);\n } else {\n /*\n * 64-bit optimized (albeit more confusing) version.\n *\n * Uses some properties of addition and multiplication to remove the mask:\n *\n * Let:\n * a = input_hi.lo = (input_hi & 0x00000000FFFFFFFF)\n * b = input_hi.hi = (input_hi & 0xFFFFFFFF00000000)\n * c = XXH_PRIME32_2\n *\n * a + (b * c)\n * Inverse Property: x + y - x == y\n * a + (b * (1 + c - 1))\n * Distributive Property: x * (y + z) == (x * y) + (x * z)\n * a + (b * 1) + (b * (c - 1))\n * Identity Property: x * 1 == x\n * a + b + (b * (c - 1))\n *\n * Substitute a, b, and c:\n * input_hi.hi + input_hi.lo + ((xxh_u64)input_hi.lo * (XXH_PRIME32_2 - 1))\n *\n * Since input_hi.hi + input_hi.lo == input_hi, we get this:\n * input_hi + ((xxh_u64)input_hi.lo * (XXH_PRIME32_2 - 1))\n */\n m128.high64 += input_hi + XXH_mult32to64((xxh_u32)input_hi, XXH_PRIME32_2 - 1);\n }\n /* m128 ^= XXH_swap64(m128 >> 64); */\n m128.low64 ^= XXH_swap64(m128.high64);\n\n { /* 128x64 multiply: h128 = m128 * XXH_PRIME64_2; */\n XXH128_hash_t h128 = XXH_mult64to128(m128.low64, XXH_PRIME64_2);\n h128.high64 += m128.high64 * XXH_PRIME64_2;\n\n h128.low64 = XXH3_avalanche(h128.low64);\n h128.high64 = XXH3_avalanche(h128.high64);\n return h128;\n } }\n}\n\n/*\n * Assumption: `secret` size is >= XXH3_SECRET_SIZE_MIN\n */\nXXH_FORCE_INLINE XXH_PUREF XXH128_hash_t\nXXH3_len_0to16_128b(const xxh_u8* input, size_t len, const xxh_u8* secret, XXH64_hash_t seed)\n{\n XXH_ASSERT(len <= 16);\n { if (len > 8) return XXH3_len_9to16_128b(input, len, secret, seed);\n if (len >= 4) return XXH3_len_4to8_128b(input, len, secret, seed);\n if (len) return XXH3_len_1to3_128b(input, len, secret, seed);\n { XXH128_hash_t h128;\n xxh_u64 const bitflipl = XXH_readLE64(secret+64) ^ XXH_readLE64(secret+72);\n xxh_u64 const bitfliph = XXH_readLE64(secret+80) ^ XXH_readLE64(secret+88);\n h128.low64 = XXH64_avalanche(seed ^ bitflipl);\n h128.high64 = XXH64_avalanche( seed ^ bitfliph);\n return h128;\n } }\n}\n\n/*\n * A bit slower than XXH3_mix16B, but handles multiply by zero better.\n */\nXXH_FORCE_INLINE XXH128_hash_t\nXXH128_mix32B(XXH128_hash_t acc, const xxh_u8* input_1, const xxh_u8* input_2,\n const xxh_u8* secret, XXH64_hash_t seed)\n{\n acc.low64 += XXH3_mix16B (input_1, secret+0, seed);\n acc.low64 ^= XXH_readLE64(input_2) + XXH_readLE64(input_2 + 8);\n acc.high64 += XXH3_mix16B (input_2, secret+16, seed);\n acc.high64 ^= XXH_readLE64(input_1) + XXH_readLE64(input_1 + 8);\n return acc;\n}\n\n\nXXH_FORCE_INLINE XXH_PUREF XXH128_hash_t\nXXH3_len_17to128_128b(const xxh_u8* XXH_RESTRICT input, size_t len,\n const xxh_u8* XXH_RESTRICT secret, size_t secretSize,\n XXH64_hash_t seed)\n{\n XXH_ASSERT(secretSize >= XXH3_SECRET_SIZE_MIN); (void)secretSize;\n XXH_ASSERT(16 < len && len <= 128);\n\n { XXH128_hash_t acc;\n acc.low64 = len * XXH_PRIME64_1;\n acc.high64 = 0;\n\n#if XXH_SIZE_OPT >= 1\n {\n /* Smaller, but slightly slower. */\n unsigned int i = (unsigned int)(len - 1) / 32;\n do {\n acc = XXH128_mix32B(acc, input+16*i, input+len-16*(i+1), secret+32*i, seed);\n } while (i-- != 0);\n }\n#else\n if (len > 32) {\n if (len > 64) {\n if (len > 96) {\n acc = XXH128_mix32B(acc, input+48, input+len-64, secret+96, seed);\n }\n acc = XXH128_mix32B(acc, input+32, input+len-48, secret+64, seed);\n }\n acc = XXH128_mix32B(acc, input+16, input+len-32, secret+32, seed);\n }\n acc = XXH128_mix32B(acc, input, input+len-16, secret, seed);\n#endif\n { XXH128_hash_t h128;\n h128.low64 = acc.low64 + acc.high64;\n h128.high64 = (acc.low64 * XXH_PRIME64_1)\n + (acc.high64 * XXH_PRIME64_4)\n + ((len - seed) * XXH_PRIME64_2);\n h128.low64 = XXH3_avalanche(h128.low64);\n h128.high64 = (XXH64_hash_t)0 - XXH3_avalanche(h128.high64);\n return h128;\n }\n }\n}\n\nXXH_NO_INLINE XXH_PUREF XXH128_hash_t\nXXH3_len_129to240_128b(const xxh_u8* XXH_RESTRICT input, size_t len,\n const xxh_u8* XXH_RESTRICT secret, size_t secretSize,\n XXH64_hash_t seed)\n{\n XXH_ASSERT(secretSize >= XXH3_SECRET_SIZE_MIN); (void)secretSize;\n XXH_ASSERT(128 < len && len <= XXH3_MIDSIZE_MAX);\n\n { XXH128_hash_t acc;\n unsigned i;\n acc.low64 = len * XXH_PRIME64_1;\n acc.high64 = 0;\n /*\n * We set as `i` as offset + 32. We do this so that unchanged\n * `len` can be used as upper bound. This reaches a sweet spot\n * where both x86 and aarch64 get simple agen and good codegen\n * for the loop.\n */\n for (i = 32; i < 160; i += 32) {\n acc = XXH128_mix32B(acc,\n input + i - 32,\n input + i - 16,\n secret + i - 32,\n seed);\n }\n acc.low64 = XXH3_avalanche(acc.low64);\n acc.high64 = XXH3_avalanche(acc.high64);\n /*\n * NB: `i <= len` will duplicate the last 32-bytes if\n * len % 32 was zero. This is an unfortunate necessity to keep\n * the hash result stable.\n */\n for (i=160; i <= len; i += 32) {\n acc = XXH128_mix32B(acc,\n input + i - 32,\n input + i - 16,\n secret + XXH3_MIDSIZE_STARTOFFSET + i - 160,\n seed);\n }\n /* last bytes */\n acc = XXH128_mix32B(acc,\n input + len - 16,\n input + len - 32,\n secret + XXH3_SECRET_SIZE_MIN - XXH3_MIDSIZE_LASTOFFSET - 16,\n (XXH64_hash_t)0 - seed);\n\n { XXH128_hash_t h128;\n h128.low64 = acc.low64 + acc.high64;\n h128.high64 = (acc.low64 * XXH_PRIME64_1)\n + (acc.high64 * XXH_PRIME64_4)\n + ((len - seed) * XXH_PRIME64_2);\n h128.low64 = XXH3_avalanche(h128.low64);\n h128.high64 = (XXH64_hash_t)0 - XXH3_avalanche(h128.high64);\n return h128;\n }\n }\n}\n\nstatic XXH_PUREF XXH128_hash_t\nXXH3_finalizeLong_128b(const xxh_u64* XXH_RESTRICT acc, const xxh_u8* XXH_RESTRICT secret, size_t secretSize, xxh_u64 len)\n{\n XXH128_hash_t h128;\n h128.low64 = XXH3_finalizeLong_64b(acc, secret, len);\n h128.high64 = XXH3_mergeAccs(acc, secret + secretSize\n - XXH_STRIPE_LEN - XXH_SECRET_MERGEACCS_START,\n ~(len * XXH_PRIME64_2));\n return h128;\n}\n\nXXH_FORCE_INLINE XXH128_hash_t\nXXH3_hashLong_128b_internal(const void* XXH_RESTRICT input, size_t len,\n const xxh_u8* XXH_RESTRICT secret, size_t secretSize,\n XXH3_f_accumulate f_acc,\n XXH3_f_scrambleAcc f_scramble)\n{\n XXH_ALIGN(XXH_ACC_ALIGN) xxh_u64 acc[XXH_ACC_NB] = XXH3_INIT_ACC;\n\n XXH3_hashLong_internal_loop(acc, (const xxh_u8*)input, len, secret, secretSize, f_acc, f_scramble);\n\n /* converge into final hash */\n XXH_STATIC_ASSERT(sizeof(acc) == 64);\n XXH_ASSERT(secretSize >= sizeof(acc) + XXH_SECRET_MERGEACCS_START);\n return XXH3_finalizeLong_128b(acc, secret, secretSize, (xxh_u64)len);\n}\n\n/*\n * It's important for performance that XXH3_hashLong() is not inlined.\n */\nXXH_NO_INLINE XXH_PUREF XXH128_hash_t\nXXH3_hashLong_128b_default(const void* XXH_RESTRICT input, size_t len,\n XXH64_hash_t seed64,\n const void* XXH_RESTRICT secret, size_t secretLen)\n{\n (void)seed64; (void)secret; (void)secretLen;\n return XXH3_hashLong_128b_internal(input, len, XXH3_kSecret, sizeof(XXH3_kSecret),\n XXH3_accumulate, XXH3_scrambleAcc);\n}\n\n/*\n * It's important for performance to pass @p secretLen (when it's static)\n * to the compiler, so that it can properly optimize the vectorized loop.\n *\n * When the secret size is unknown, or on GCC 12 where the mix of NO_INLINE and FORCE_INLINE\n * breaks -Og, this is XXH_NO_INLINE.\n */\nXXH3_WITH_SECRET_INLINE XXH128_hash_t\nXXH3_hashLong_128b_withSecret(const void* XXH_RESTRICT input, size_t len,\n XXH64_hash_t seed64,\n const void* XXH_RESTRICT secret, size_t secretLen)\n{\n (void)seed64;\n return XXH3_hashLong_128b_internal(input, len, (const xxh_u8*)secret, secretLen,\n XXH3_accumulate, XXH3_scrambleAcc);\n}\n\nXXH_FORCE_INLINE XXH128_hash_t\nXXH3_hashLong_128b_withSeed_internal(const void* XXH_RESTRICT input, size_t len,\n XXH64_hash_t seed64,\n XXH3_f_accumulate f_acc,\n XXH3_f_scrambleAcc f_scramble,\n XXH3_f_initCustomSecret f_initSec)\n{\n if (seed64 == 0)\n return XXH3_hashLong_128b_internal(input, len,\n XXH3_kSecret, sizeof(XXH3_kSecret),\n f_acc, f_scramble);\n { XXH_ALIGN(XXH_SEC_ALIGN) xxh_u8 secret[XXH_SECRET_DEFAULT_SIZE];\n f_initSec(secret, seed64);\n return XXH3_hashLong_128b_internal(input, len, (const xxh_u8*)secret, sizeof(secret),\n f_acc, f_scramble);\n }\n}\n\n/*\n * It's important for performance that XXH3_hashLong is not inlined.\n */\nXXH_NO_INLINE XXH128_hash_t\nXXH3_hashLong_128b_withSeed(const void* input, size_t len,\n XXH64_hash_t seed64, const void* XXH_RESTRICT secret, size_t secretLen)\n{\n (void)secret; (void)secretLen;\n return XXH3_hashLong_128b_withSeed_internal(input, len, seed64,\n XXH3_accumulate, XXH3_scrambleAcc, XXH3_initCustomSecret);\n}\n\ntypedef XXH128_hash_t (*XXH3_hashLong128_f)(const void* XXH_RESTRICT, size_t,\n XXH64_hash_t, const void* XXH_RESTRICT, size_t);\n\nXXH_FORCE_INLINE XXH128_hash_t\nXXH3_128bits_internal(const void* input, size_t len,\n XXH64_hash_t seed64, const void* XXH_RESTRICT secret, size_t secretLen,\n XXH3_hashLong128_f f_hl128)\n{\n XXH_ASSERT(secretLen >= XXH3_SECRET_SIZE_MIN);\n /*\n * If an action is to be taken if `secret` conditions are not respected,\n * it should be done here.\n * For now, it's a contract pre-condition.\n * Adding a check and a branch here would cost performance at every hash.\n */\n if (len <= 16)\n return XXH3_len_0to16_128b((const xxh_u8*)input, len, (const xxh_u8*)secret, seed64);\n if (len <= 128)\n return XXH3_len_17to128_128b((const xxh_u8*)input, len, (const xxh_u8*)secret, secretLen, seed64);\n if (len <= XXH3_MIDSIZE_MAX)\n return XXH3_len_129to240_128b((const xxh_u8*)input, len, (const xxh_u8*)secret, secretLen, seed64);\n return f_hl128(input, len, seed64, secret, secretLen);\n}\n\n\n/* === Public XXH128 API === */\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH128_hash_t XXH3_128bits(XXH_NOESCAPE const void* input, size_t len)\n{\n return XXH3_128bits_internal(input, len, 0,\n XXH3_kSecret, sizeof(XXH3_kSecret),\n XXH3_hashLong_128b_default);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH128_hash_t\nXXH3_128bits_withSecret(XXH_NOESCAPE const void* input, size_t len, XXH_NOESCAPE const void* secret, size_t secretSize)\n{\n return XXH3_128bits_internal(input, len, 0,\n (const xxh_u8*)secret, secretSize,\n XXH3_hashLong_128b_withSecret);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH128_hash_t\nXXH3_128bits_withSeed(XXH_NOESCAPE const void* input, size_t len, XXH64_hash_t seed)\n{\n return XXH3_128bits_internal(input, len, seed,\n XXH3_kSecret, sizeof(XXH3_kSecret),\n XXH3_hashLong_128b_withSeed);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH128_hash_t\nXXH3_128bits_withSecretandSeed(XXH_NOESCAPE const void* input, size_t len, XXH_NOESCAPE const void* secret, size_t secretSize, XXH64_hash_t seed)\n{\n if (len <= XXH3_MIDSIZE_MAX)\n return XXH3_128bits_internal(input, len, seed, XXH3_kSecret, sizeof(XXH3_kSecret), NULL);\n return XXH3_hashLong_128b_withSecret(input, len, seed, secret, secretSize);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH128_hash_t\nXXH128(XXH_NOESCAPE const void* input, size_t len, XXH64_hash_t seed)\n{\n return XXH3_128bits_withSeed(input, len, seed);\n}\n\n\n/* === XXH3 128-bit streaming === */\n#ifndef XXH_NO_STREAM\n/*\n * All initialization and update functions are identical to 64-bit streaming variant.\n * The only difference is the finalization routine.\n */\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_128bits_reset(XXH_NOESCAPE XXH3_state_t* statePtr)\n{\n return XXH3_64bits_reset(statePtr);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_128bits_reset_withSecret(XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* secret, size_t secretSize)\n{\n return XXH3_64bits_reset_withSecret(statePtr, secret, secretSize);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_128bits_reset_withSeed(XXH_NOESCAPE XXH3_state_t* statePtr, XXH64_hash_t seed)\n{\n return XXH3_64bits_reset_withSeed(statePtr, seed);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_128bits_reset_withSecretandSeed(XXH_NOESCAPE XXH3_state_t* statePtr, XXH_NOESCAPE const void* secret, size_t secretSize, XXH64_hash_t seed)\n{\n return XXH3_64bits_reset_withSecretandSeed(statePtr, secret, secretSize, seed);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_128bits_update(XXH_NOESCAPE XXH3_state_t* state, XXH_NOESCAPE const void* input, size_t len)\n{\n return XXH3_64bits_update(state, input, len);\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH128_hash_t XXH3_128bits_digest (XXH_NOESCAPE const XXH3_state_t* state)\n{\n const unsigned char* const secret = (state->extSecret == NULL) ? state->customSecret : state->extSecret;\n if (state->totalLen > XXH3_MIDSIZE_MAX) {\n XXH_ALIGN(XXH_ACC_ALIGN) XXH64_hash_t acc[XXH_ACC_NB];\n XXH3_digest_long(acc, state, secret);\n XXH_ASSERT(state->secretLimit + XXH_STRIPE_LEN >= sizeof(acc) + XXH_SECRET_MERGEACCS_START);\n return XXH3_finalizeLong_128b(acc, secret, state->secretLimit + XXH_STRIPE_LEN, (xxh_u64)state->totalLen);\n }\n /* len <= XXH3_MIDSIZE_MAX : short code */\n if (state->useSeed)\n return XXH3_128bits_withSeed(state->buffer, (size_t)state->totalLen, state->seed);\n return XXH3_128bits_withSecret(state->buffer, (size_t)(state->totalLen),\n secret, state->secretLimit + XXH_STRIPE_LEN);\n}\n#endif /* !XXH_NO_STREAM */\n/* 128-bit utility functions */\n\n#include /* memcmp, memcpy */\n\n/* return : 1 is equal, 0 if different */\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API int XXH128_isEqual(XXH128_hash_t h1, XXH128_hash_t h2)\n{\n /* note : XXH128_hash_t is compact, it has no padding byte */\n return !(memcmp(&h1, &h2, sizeof(h1)));\n}\n\n/* This prototype is compatible with stdlib's qsort().\n * @return : >0 if *h128_1 > *h128_2\n * <0 if *h128_1 < *h128_2\n * =0 if *h128_1 == *h128_2 */\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API int XXH128_cmp(XXH_NOESCAPE const void* h128_1, XXH_NOESCAPE const void* h128_2)\n{\n XXH128_hash_t const h1 = *(const XXH128_hash_t*)h128_1;\n XXH128_hash_t const h2 = *(const XXH128_hash_t*)h128_2;\n int const hcmp = (h1.high64 > h2.high64) - (h2.high64 > h1.high64);\n /* note : bets that, in most cases, hash values are different */\n if (hcmp) return hcmp;\n return (h1.low64 > h2.low64) - (h2.low64 > h1.low64);\n}\n\n\n/*====== Canonical representation ======*/\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API void\nXXH128_canonicalFromHash(XXH_NOESCAPE XXH128_canonical_t* dst, XXH128_hash_t hash)\n{\n XXH_STATIC_ASSERT(sizeof(XXH128_canonical_t) == sizeof(XXH128_hash_t));\n if (XXH_CPU_LITTLE_ENDIAN) {\n hash.high64 = XXH_swap64(hash.high64);\n hash.low64 = XXH_swap64(hash.low64);\n }\n XXH_memcpy(dst, &hash.high64, sizeof(hash.high64));\n XXH_memcpy((char*)dst + sizeof(hash.high64), &hash.low64, sizeof(hash.low64));\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH128_hash_t\nXXH128_hashFromCanonical(XXH_NOESCAPE const XXH128_canonical_t* src)\n{\n XXH128_hash_t h;\n h.high64 = XXH_readBE64(src);\n h.low64 = XXH_readBE64(src->digest + 8);\n return h;\n}\n\n\n\n/* ==========================================\n * Secret generators\n * ==========================================\n */\n#define XXH_MIN(x, y) (((x) > (y)) ? (y) : (x))\n\nXXH_FORCE_INLINE void XXH3_combine16(void* dst, XXH128_hash_t h128)\n{\n XXH_writeLE64( dst, XXH_readLE64(dst) ^ h128.low64 );\n XXH_writeLE64( (char*)dst+8, XXH_readLE64((char*)dst+8) ^ h128.high64 );\n}\n\n/*! @ingroup XXH3_family */\nXXH_PUBLIC_API XXH_errorcode\nXXH3_generateSecret(XXH_NOESCAPE void* secretBuffer, size_t secretSize, XXH_NOESCAPE const void* customSeed, size_t customSeedSize)\n{\n#if (XXH_DEBUGLEVEL >= 1)\n XXH_ASSERT(secretBuffer != NULL);\n XXH_ASSERT(secretSize >= XXH3_SECRET_SIZE_MIN);\n#else\n /* production mode, assert() are disabled */\n if (secretBuffer == NULL) return XXH_ERROR;\n if (secretSize < XXH3_SECRET_SIZE_MIN) return XXH_ERROR;\n#endif\n\n if (customSeedSize == 0) {\n customSeed = XXH3_kSecret;\n customSeedSize = XXH_SECRET_DEFAULT_SIZE;\n }\n#if (XXH_DEBUGLEVEL >= 1)\n XXH_ASSERT(customSeed != NULL);\n#else\n if (customSeed == NULL) return XXH_ERROR;\n#endif\n\n /* Fill secretBuffer with a copy of customSeed - repeat as needed */\n { size_t pos = 0;\n while (pos < secretSize) {\n size_t const toCopy = XXH_MIN((secretSize - pos), customSeedSize);\n memcpy((char*)secretBuffer + pos, customSeed, toCopy);\n pos += toCopy;\n } }\n\n { size_t const nbSeg16 = secretSize / 16;\n size_t n;\n XXH128_canonical_t scrambler;\n XXH128_canonicalFromHash(&scrambler, XXH128(customSeed, customSeedSize, 0));\n for (n=0; n\n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 10\n\nAC_DEFUN([AX_AC_APPEND_TO_FILE],[\nAC_REQUIRE([AX_FILE_ESCAPES])\nm4_esyscmd(\nAX_FILE_ESCAPES\n[\nprintf \"%s\" \"$2\" >> \"$1\"\n])\n])\n" }, { "path": "m4/ax_ac_print_to_file.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_ac_print_to_file.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_AC_PRINT_TO_FILE([FILE],[DATA])\n#\n# DESCRIPTION\n#\n# Writes the specified data to the specified file when Autoconf is run. If\n# you want to print to a file when configure is run use AX_PRINT_TO_FILE\n# instead.\n#\n# LICENSE\n#\n# Copyright (c) 2009 Allan Caffee \n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 10\n\nAC_DEFUN([AX_AC_PRINT_TO_FILE],[\nm4_esyscmd(\nAC_REQUIRE([AX_FILE_ESCAPES])\n[\nprintf \"%s\" \"$2\" > \"$1\"\n])\n])\n" }, { "path": "m4/ax_add_am_macro_static.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_add_am_macro_static.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_ADD_AM_MACRO_STATIC([RULE])\n#\n# DESCRIPTION\n#\n# Adds the specified rule to $AMINCLUDE.\n#\n# LICENSE\n#\n# Copyright (c) 2009 Tom Howard \n# Copyright (c) 2009 Allan Caffee \n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 8\n\nAC_DEFUN([AX_ADD_AM_MACRO_STATIC],[\n AC_REQUIRE([AX_AM_MACROS_STATIC])\n AX_AC_APPEND_TO_FILE(AMINCLUDE_STATIC,[$1])\n])\n" }, { "path": "m4/ax_am_macros_static.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_am_macros_static.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_AM_MACROS_STATIC\n#\n# DESCRIPTION\n#\n# Adds support for macros that create Automake rules. You must manually\n# add the following line\n#\n# include $(top_srcdir)/aminclude_static.am\n#\n# to your Makefile.am files.\n#\n# LICENSE\n#\n# Copyright (c) 2009 Tom Howard \n# Copyright (c) 2009 Allan Caffee \n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 11\n\nAC_DEFUN([AMINCLUDE_STATIC],[aminclude_static.am])\n\nAC_DEFUN([AX_AM_MACROS_STATIC],\n[\nAX_AC_PRINT_TO_FILE(AMINCLUDE_STATIC,[\n# ]AMINCLUDE_STATIC[ generated automatically by Autoconf\n# from AX_AM_MACROS_STATIC on ]m4_esyscmd([LC_ALL=C date])[\n])\n])\n" }, { "path": "m4/ax_check_compile_flag.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_check_compile_flag.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_CHECK_COMPILE_FLAG(FLAG, [ACTION-SUCCESS], [ACTION-FAILURE], [EXTRA-FLAGS], [INPUT])\n#\n# DESCRIPTION\n#\n# Check whether the given FLAG works with the current language's compiler\n# or gives an error. (Warnings, however, are ignored)\n#\n# ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on\n# success/failure.\n#\n# If EXTRA-FLAGS is defined, it is added to the current language's default\n# flags (e.g. CFLAGS) when the check is done. The check is thus made with\n# the flags: \"CFLAGS EXTRA-FLAGS FLAG\". This can for example be used to\n# force the compiler to issue an error when a bad flag is given.\n#\n# INPUT gives an alternative input source to AC_COMPILE_IFELSE.\n#\n# NOTE: Implementation based on AX_CFLAGS_GCC_OPTION. Please keep this\n# macro in sync with AX_CHECK_{PREPROC,LINK}_FLAG.\n#\n# LICENSE\n#\n# Copyright (c) 2008 Guido U. Draheim \n# Copyright (c) 2011 Maarten Bosmans \n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 6\n\nAC_DEFUN([AX_CHECK_COMPILE_FLAG],\n[AC_PREREQ(2.64)dnl for _AC_LANG_PREFIX and AS_VAR_IF\nAS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_[]_AC_LANG_ABBREV[]flags_$4_$1])dnl\nAC_CACHE_CHECK([whether _AC_LANG compiler accepts $1], CACHEVAR, [\n ax_check_save_flags=$[]_AC_LANG_PREFIX[]FLAGS\n _AC_LANG_PREFIX[]FLAGS=\"$[]_AC_LANG_PREFIX[]FLAGS $4 $1\"\n AC_COMPILE_IFELSE([m4_default([$5],[AC_LANG_PROGRAM()])],\n [AS_VAR_SET(CACHEVAR,[yes])],\n [AS_VAR_SET(CACHEVAR,[no])])\n _AC_LANG_PREFIX[]FLAGS=$ax_check_save_flags])\nAS_VAR_IF(CACHEVAR,yes,\n [m4_default([$2], :)],\n [m4_default([$3], :)])\nAS_VAR_POPDEF([CACHEVAR])dnl\n])dnl AX_CHECK_COMPILE_FLAGS\n" }, { "path": "m4/ax_code_coverage.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_code_coverage.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_CODE_COVERAGE()\n#\n# DESCRIPTION\n#\n# Defines CODE_COVERAGE_CPPFLAGS, CODE_COVERAGE_CFLAGS,\n# CODE_COVERAGE_CXXFLAGS and CODE_COVERAGE_LIBS which should be included\n# in the CPPFLAGS, CFLAGS CXXFLAGS and LIBS/LIBADD variables of every\n# build target (program or library) which should be built with code\n# coverage support. Also add rules using AX_ADD_AM_MACRO_STATIC; and\n# $enable_code_coverage which can be used in subsequent configure output.\n# CODE_COVERAGE_ENABLED is defined and substituted, and corresponds to the\n# value of the --enable-code-coverage option, which defaults to being\n# disabled.\n#\n# Test also for gcov program and create GCOV variable that could be\n# substituted.\n#\n# Note that all optimization flags in CFLAGS must be disabled when code\n# coverage is enabled.\n#\n# Usage example:\n#\n# configure.ac:\n#\n# AX_CODE_COVERAGE\n#\n# Makefile.am:\n#\n# include $(top_srcdir)/aminclude_static.am\n#\n# my_program_LIBS = ... $(CODE_COVERAGE_LIBS) ...\n# my_program_CPPFLAGS = ... $(CODE_COVERAGE_CPPFLAGS) ...\n# my_program_CFLAGS = ... $(CODE_COVERAGE_CFLAGS) ...\n# my_program_CXXFLAGS = ... $(CODE_COVERAGE_CXXFLAGS) ...\n#\n# clean-local: code-coverage-clean\n# distclean-local: code-coverage-dist-clean\n#\n# This results in a \"check-code-coverage\" rule being added to any\n# Makefile.am which do \"include $(top_srcdir)/aminclude_static.am\"\n# (assuming the module has been configured with --enable-code-coverage).\n# Running `make check-code-coverage` in that directory will run the\n# module's test suite (`make check`) and build a code coverage report\n# detailing the code which was touched, then print the URI for the report.\n#\n# This code was derived from Makefile.decl in GLib, originally licensed\n# under LGPLv2.1+.\n#\n# LICENSE\n#\n# Copyright (c) 2012, 2016 Philip Withnall\n# Copyright (c) 2012 Xan Lopez\n# Copyright (c) 2012 Christian Persch\n# Copyright (c) 2012 Paolo Borelli\n# Copyright (c) 2012 Dan Winship\n# Copyright (c) 2015,2018 Bastien ROUCARIES\n#\n# This library is free software; you can redistribute it and/or modify it\n# under the terms of the GNU Lesser General Public License as published by\n# the Free Software Foundation; either version 2.1 of the License, or (at\n# your option) any later version.\n#\n# This library is distributed in the hope that it will be useful, but\n# WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser\n# General Public License for more details.\n#\n# You should have received a copy of the GNU Lesser General Public License\n# along with this program. If not, see .\n\n#serial 34\n\nm4_define(_AX_CODE_COVERAGE_RULES,[\nAX_ADD_AM_MACRO_STATIC([\n# Code coverage\n#\n# Optional:\n# - CODE_COVERAGE_DIRECTORY: Top-level directory for code coverage reporting.\n# Multiple directories may be specified, separated by whitespace.\n# (Default: \\$(top_builddir))\n# - CODE_COVERAGE_OUTPUT_FILE: Filename and path for the .info file generated\n# by lcov for code coverage. (Default:\n# \\$(PACKAGE_NAME)-\\$(PACKAGE_VERSION)-coverage.info)\n# - CODE_COVERAGE_OUTPUT_DIRECTORY: Directory for generated code coverage\n# reports to be created. (Default:\n# \\$(PACKAGE_NAME)-\\$(PACKAGE_VERSION)-coverage)\n# - CODE_COVERAGE_BRANCH_COVERAGE: Set to 1 to enforce branch coverage,\n# set to 0 to disable it and leave empty to stay with the default.\n# (Default: empty)\n# - CODE_COVERAGE_LCOV_SHOPTS_DEFAULT: Extra options shared between both lcov\n# instances. (Default: based on $CODE_COVERAGE_BRANCH_COVERAGE)\n# - CODE_COVERAGE_LCOV_SHOPTS: Extra options to shared between both lcov\n# instances. (Default: $CODE_COVERAGE_LCOV_SHOPTS_DEFAULT)\n# - CODE_COVERAGE_LCOV_OPTIONS_GCOVPATH: --gcov-tool pathtogcov\n# - CODE_COVERAGE_LCOV_OPTIONS_DEFAULT: Extra options to pass to the\n# collecting lcov instance. (Default: $CODE_COVERAGE_LCOV_OPTIONS_GCOVPATH)\n# - CODE_COVERAGE_LCOV_OPTIONS: Extra options to pass to the collecting lcov\n# instance. (Default: $CODE_COVERAGE_LCOV_OPTIONS_DEFAULT)\n# - CODE_COVERAGE_LCOV_RMOPTS_DEFAULT: Extra options to pass to the filtering\n# lcov instance. (Default: empty)\n# - CODE_COVERAGE_LCOV_RMOPTS: Extra options to pass to the filtering lcov\n# instance. (Default: $CODE_COVERAGE_LCOV_RMOPTS_DEFAULT)\n# - CODE_COVERAGE_GENHTML_OPTIONS_DEFAULT: Extra options to pass to the\n# genhtml instance. (Default: based on $CODE_COVERAGE_BRANCH_COVERAGE)\n# - CODE_COVERAGE_GENHTML_OPTIONS: Extra options to pass to the genhtml\n# instance. (Default: $CODE_COVERAGE_GENHTML_OPTIONS_DEFAULT)\n# - CODE_COVERAGE_IGNORE_PATTERN: Extra glob pattern of files to ignore\n#\n# The generated report will be titled using the \\$(PACKAGE_NAME) and\n# \\$(PACKAGE_VERSION). In order to add the current git hash to the title,\n# use the git-version-gen script, available online.\n# Optional variables\n# run only on top dir\nif CODE_COVERAGE_ENABLED\n ifeq (\\$(abs_builddir), \\$(abs_top_builddir))\nCODE_COVERAGE_DIRECTORY ?= \\$(top_builddir)\nCODE_COVERAGE_OUTPUT_FILE ?= \\$(PACKAGE_NAME)-\\$(PACKAGE_VERSION)-coverage.info\nCODE_COVERAGE_OUTPUT_DIRECTORY ?= \\$(PACKAGE_NAME)-\\$(PACKAGE_VERSION)-coverage\n\nCODE_COVERAGE_BRANCH_COVERAGE ?=\nCODE_COVERAGE_LCOV_SHOPTS_DEFAULT ?= \\$(if \\$(CODE_COVERAGE_BRANCH_COVERAGE),\\\n--rc lcov_branch_coverage=\\$(CODE_COVERAGE_BRANCH_COVERAGE))\nCODE_COVERAGE_LCOV_SHOPTS ?= \\$(CODE_COVERAGE_LCOV_SHOPTS_DEFAULT)\nCODE_COVERAGE_LCOV_OPTIONS_GCOVPATH ?= --gcov-tool \\\"\\$(GCOV)\\\"\nCODE_COVERAGE_LCOV_OPTIONS_DEFAULT ?= \\$(CODE_COVERAGE_LCOV_OPTIONS_GCOVPATH)\nCODE_COVERAGE_LCOV_OPTIONS ?= \\$(CODE_COVERAGE_LCOV_OPTIONS_DEFAULT)\nCODE_COVERAGE_LCOV_RMOPTS_DEFAULT ?=\nCODE_COVERAGE_LCOV_RMOPTS ?= \\$(CODE_COVERAGE_LCOV_RMOPTS_DEFAULT)\nCODE_COVERAGE_GENHTML_OPTIONS_DEFAULT ?=\\\n\\$(if \\$(CODE_COVERAGE_BRANCH_COVERAGE),\\\n--rc genhtml_branch_coverage=\\$(CODE_COVERAGE_BRANCH_COVERAGE))\nCODE_COVERAGE_GENHTML_OPTIONS ?= \\$(CODE_COVERAGE_GENHTML_OPTIONS_DEFAULT)\nCODE_COVERAGE_IGNORE_PATTERN ?=\n\nGITIGNOREFILES := \\$(GITIGNOREFILES) \\$(CODE_COVERAGE_OUTPUT_FILE) \\$(CODE_COVERAGE_OUTPUT_DIRECTORY)\ncode_coverage_v_lcov_cap = \\$(code_coverage_v_lcov_cap_\\$(V))\ncode_coverage_v_lcov_cap_ = \\$(code_coverage_v_lcov_cap_\\$(AM_DEFAULT_VERBOSITY))\ncode_coverage_v_lcov_cap_0 = @echo \\\" LCOV --capture\\\" \\$(CODE_COVERAGE_OUTPUT_FILE);\ncode_coverage_v_lcov_ign = \\$(code_coverage_v_lcov_ign_\\$(V))\ncode_coverage_v_lcov_ign_ = \\$(code_coverage_v_lcov_ign_\\$(AM_DEFAULT_VERBOSITY))\ncode_coverage_v_lcov_ign_0 = @echo \\\" LCOV --remove /tmp/*\\\" \\$(CODE_COVERAGE_IGNORE_PATTERN);\ncode_coverage_v_genhtml = \\$(code_coverage_v_genhtml_\\$(V))\ncode_coverage_v_genhtml_ = \\$(code_coverage_v_genhtml_\\$(AM_DEFAULT_VERBOSITY))\ncode_coverage_v_genhtml_0 = @echo \\\" GEN \\\" \\\"\\$(CODE_COVERAGE_OUTPUT_DIRECTORY)\\\";\ncode_coverage_quiet = \\$(code_coverage_quiet_\\$(V))\ncode_coverage_quiet_ = \\$(code_coverage_quiet_\\$(AM_DEFAULT_VERBOSITY))\ncode_coverage_quiet_0 = --quiet\n\n# sanitizes the test-name: replaces with underscores: dashes and dots\ncode_coverage_sanitize = \\$(subst -,_,\\$(subst .,_,\\$(1)))\n\n# Use recursive makes in order to ignore errors during check\ncheck-code-coverage:\n\t-\\$(AM_V_at)\\$(MAKE) \\$(AM_MAKEFLAGS) -k check\n\t\\$(AM_V_at)\\$(MAKE) \\$(AM_MAKEFLAGS) code-coverage-capture\n\n# Capture code coverage data\ncode-coverage-capture: code-coverage-capture-hook\n\t\\$(code_coverage_v_lcov_cap)\\$(LCOV) \\$(code_coverage_quiet) \\$(addprefix --directory ,\\$(CODE_COVERAGE_DIRECTORY)) --capture --output-file \\\"\\$(CODE_COVERAGE_OUTPUT_FILE).tmp\\\" --test-name \\\"\\$(call code_coverage_sanitize,\\$(PACKAGE_NAME)-\\$(PACKAGE_VERSION))\\\" --no-checksum --compat-libtool \\$(CODE_COVERAGE_LCOV_SHOPTS) \\$(CODE_COVERAGE_LCOV_OPTIONS)\n\t\\$(code_coverage_v_lcov_ign)\\$(LCOV) \\$(code_coverage_quiet) \\$(addprefix --directory ,\\$(CODE_COVERAGE_DIRECTORY)) --remove \\\"\\$(CODE_COVERAGE_OUTPUT_FILE).tmp\\\" \\\"/tmp/*\\\" \\$(CODE_COVERAGE_IGNORE_PATTERN) --output-file \\\"\\$(CODE_COVERAGE_OUTPUT_FILE)\\\" \\$(CODE_COVERAGE_LCOV_SHOPTS) \\$(CODE_COVERAGE_LCOV_RMOPTS)\n\t-@rm -f \\\"\\$(CODE_COVERAGE_OUTPUT_FILE).tmp\\\"\n\t\\$(code_coverage_v_genhtml)LANG=C \\$(GENHTML) \\$(code_coverage_quiet) \\$(addprefix --prefix ,\\$(CODE_COVERAGE_DIRECTORY)) --output-directory \\\"\\$(CODE_COVERAGE_OUTPUT_DIRECTORY)\\\" --title \\\"\\$(PACKAGE_NAME)-\\$(PACKAGE_VERSION) Code Coverage\\\" --legend --show-details \\\"\\$(CODE_COVERAGE_OUTPUT_FILE)\\\" \\$(CODE_COVERAGE_GENHTML_OPTIONS)\n\t@echo \\\"file://\\$(abs_builddir)/\\$(CODE_COVERAGE_OUTPUT_DIRECTORY)/index.html\\\"\n\ncode-coverage-clean:\n\t-\\$(LCOV) --directory \\$(top_builddir) -z\n\t-rm -rf \\\"\\$(CODE_COVERAGE_OUTPUT_FILE)\\\" \\\"\\$(CODE_COVERAGE_OUTPUT_FILE).tmp\\\" \\\"\\$(CODE_COVERAGE_OUTPUT_DIRECTORY)\\\"\n\t-find . \\\\( -name \\\"*.gcda\\\" -o -name \\\"*.gcno\\\" -o -name \\\"*.gcov\\\" \\\\) -delete\n\ncode-coverage-dist-clean:\n\nA][M_DISTCHECK_CONFIGURE_FLAGS := \\$(A][M_DISTCHECK_CONFIGURE_FLAGS) --disable-code-coverage\n else # ifneq (\\$(abs_builddir), \\$(abs_top_builddir))\ncheck-code-coverage:\n\ncode-coverage-capture: code-coverage-capture-hook\n\ncode-coverage-clean:\n\ncode-coverage-dist-clean:\n endif # ifeq (\\$(abs_builddir), \\$(abs_top_builddir))\nelse #! CODE_COVERAGE_ENABLED\n# Use recursive makes in order to ignore errors during check\ncheck-code-coverage:\n\t@echo \\\"Need to reconfigure with --enable-code-coverage\\\"\n# Capture code coverage data\ncode-coverage-capture: code-coverage-capture-hook\n\t@echo \\\"Need to reconfigure with --enable-code-coverage\\\"\n\ncode-coverage-clean:\n\ncode-coverage-dist-clean:\n\nendif #CODE_COVERAGE_ENABLED\n# Hook rule executed before code-coverage-capture, overridable by the user\ncode-coverage-capture-hook:\n\n.PHONY: check-code-coverage code-coverage-capture code-coverage-dist-clean code-coverage-clean code-coverage-capture-hook\n])\n])\n\nAC_DEFUN([_AX_CODE_COVERAGE_ENABLED],[\n\tAX_CHECK_GNU_MAKE([],[AC_MSG_ERROR([not using GNU make that is needed for coverage])])\n\tAC_REQUIRE([AX_ADD_AM_MACRO_STATIC])\n\t# check for gcov\n\tAC_CHECK_TOOL([GCOV],\n\t\t [$_AX_CODE_COVERAGE_GCOV_PROG_WITH],\n\t\t [:])\n\tAS_IF([test \"X$GCOV\" = \"X:\"],\n\t [AC_MSG_ERROR([gcov is needed to do coverage])])\n\tAC_SUBST([GCOV])\n\n\tdnl Check if gcc is being used\n\tAS_IF([ test \"$GCC\" = \"no\" ], [\n\t\tAC_MSG_ERROR([not compiling with gcc, which is required for gcov code coverage])\n\t ])\n\n\tAC_CHECK_PROG([LCOV], [lcov], [lcov])\n\tAC_CHECK_PROG([GENHTML], [genhtml], [genhtml])\n\n\tAS_IF([ test x\"$LCOV\" = x ], [\n\t\tAC_MSG_ERROR([To enable code coverage reporting you must have lcov installed])\n\t ])\n\n\tAS_IF([ test x\"$GENHTML\" = x ], [\n\t\tAC_MSG_ERROR([Could not find genhtml from the lcov package])\n\t])\n\n\tdnl Build the code coverage flags\n\tdnl Define CODE_COVERAGE_LDFLAGS for backwards compatibility\n\tCODE_COVERAGE_CPPFLAGS=\"-DNDEBUG\"\n\tCODE_COVERAGE_CFLAGS=\"-O0 -g -fprofile-arcs -ftest-coverage\"\n\tCODE_COVERAGE_CXXFLAGS=\"-O0 -g -fprofile-arcs -ftest-coverage\"\n\tCODE_COVERAGE_LIBS=\"-lgcov\"\n\n\tAC_SUBST([CODE_COVERAGE_CPPFLAGS])\n\tAC_SUBST([CODE_COVERAGE_CFLAGS])\n\tAC_SUBST([CODE_COVERAGE_CXXFLAGS])\n\tAC_SUBST([CODE_COVERAGE_LIBS])\n])\n\nAC_DEFUN([AX_CODE_COVERAGE],[\n\tdnl Check for --enable-code-coverage\n\n\t# allow to override gcov location\n\tAC_ARG_WITH([gcov],\n\t [AS_HELP_STRING([--with-gcov[=GCOV]], [use given GCOV for coverage (GCOV=gcov).])],\n\t [_AX_CODE_COVERAGE_GCOV_PROG_WITH=$with_gcov],\n\t [_AX_CODE_COVERAGE_GCOV_PROG_WITH=gcov])\n\n\tAC_MSG_CHECKING([whether to build with code coverage support])\n\tAC_ARG_ENABLE([code-coverage],\n\t AS_HELP_STRING([--enable-code-coverage],\n\t [Whether to enable code coverage support]),,\n\t enable_code_coverage=no)\n\n\tAM_CONDITIONAL([CODE_COVERAGE_ENABLED], [test \"x$enable_code_coverage\" = xyes])\n\tAC_SUBST([CODE_COVERAGE_ENABLED], [$enable_code_coverage])\n\tAC_MSG_RESULT($enable_code_coverage)\n\n\tAS_IF([ test \"x$enable_code_coverage\" = xyes ], [\n\t\t_AX_CODE_COVERAGE_ENABLED\n\t ])\n\n\t_AX_CODE_COVERAGE_RULES\n])\n" }, { "path": "m4/ax_cxx_compile_stdcxx.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_CXX_COMPILE_STDCXX(VERSION, [ext|noext], [mandatory|optional])\n#\n# DESCRIPTION\n#\n# Check for baseline language coverage in the compiler for the specified\n# version of the C++ standard. If necessary, add switches to CXX and\n# CXXCPP to enable support. VERSION may be '11', '14', '17', or '20' for\n# the respective C++ standard version.\n#\n# The second argument, if specified, indicates whether you insist on an\n# extended mode (e.g. -std=gnu++11) or a strict conformance mode (e.g.\n# -std=c++11). If neither is specified, you get whatever works, with\n# preference for no added switch, and then for an extended mode.\n#\n# The third argument, if specified 'mandatory' or if left unspecified,\n# indicates that baseline support for the specified C++ standard is\n# required and that the macro should error out if no mode with that\n# support is found. If specified 'optional', then configuration proceeds\n# regardless, after defining HAVE_CXX${VERSION} if and only if a\n# supporting mode is found.\n#\n# LICENSE\n#\n# Copyright (c) 2008 Benjamin Kosnik \n# Copyright (c) 2012 Zack Weinberg \n# Copyright (c) 2013 Roy Stogner \n# Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov \n# Copyright (c) 2015 Paul Norman \n# Copyright (c) 2015 Moritz Klammler \n# Copyright (c) 2016, 2018 Krzesimir Nowak \n# Copyright (c) 2019 Enji Cooper \n# Copyright (c) 2020 Jason Merrill \n# Copyright (c) 2021 Jörn Heusipp \n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 15\n\ndnl This macro is based on the code from the AX_CXX_COMPILE_STDCXX_11 macro\ndnl (serial version number 13).\n\nAC_DEFUN([AX_CXX_COMPILE_STDCXX], [dnl\n m4_if([$1], [11], [ax_cxx_compile_alternatives=\"11 0x\"],\n [$1], [14], [ax_cxx_compile_alternatives=\"14 1y\"],\n [$1], [17], [ax_cxx_compile_alternatives=\"17 1z\"],\n [$1], [20], [ax_cxx_compile_alternatives=\"20\"],\n [m4_fatal([invalid first argument `$1' to AX_CXX_COMPILE_STDCXX])])dnl\n m4_if([$2], [], [],\n [$2], [ext], [],\n [$2], [noext], [],\n [m4_fatal([invalid second argument `$2' to AX_CXX_COMPILE_STDCXX])])dnl\n m4_if([$3], [], [ax_cxx_compile_cxx$1_required=true],\n [$3], [mandatory], [ax_cxx_compile_cxx$1_required=true],\n [$3], [optional], [ax_cxx_compile_cxx$1_required=false],\n [m4_fatal([invalid third argument `$3' to AX_CXX_COMPILE_STDCXX])])\n AC_LANG_PUSH([C++])dnl\n ac_success=no\n\n m4_if([$2], [], [dnl\n AC_CACHE_CHECK(whether $CXX supports C++$1 features by default,\n\t\t ax_cv_cxx_compile_cxx$1,\n [AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],\n [ax_cv_cxx_compile_cxx$1=yes],\n [ax_cv_cxx_compile_cxx$1=no])])\n if test x$ax_cv_cxx_compile_cxx$1 = xyes; then\n ac_success=yes\n fi])\n\n m4_if([$2], [noext], [], [dnl\n if test x$ac_success = xno; then\n for alternative in ${ax_cxx_compile_alternatives}; do\n switch=\"-std=gnu++${alternative}\"\n cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])\n AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,\n $cachevar,\n [ac_save_CXX=\"$CXX\"\n CXX=\"$CXX $switch\"\n AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],\n [eval $cachevar=yes],\n [eval $cachevar=no])\n CXX=\"$ac_save_CXX\"])\n if eval test x\\$$cachevar = xyes; then\n CXX=\"$CXX $switch\"\n if test -n \"$CXXCPP\" ; then\n CXXCPP=\"$CXXCPP $switch\"\n fi\n ac_success=yes\n break\n fi\n done\n fi])\n\n m4_if([$2], [ext], [], [dnl\n if test x$ac_success = xno; then\n dnl HP's aCC needs +std=c++11 according to:\n dnl http://h21007.www2.hp.com/portal/download/files/unprot/aCxx/PDF_Release_Notes/769149-001.pdf\n dnl Cray's crayCC needs \"-h std=c++11\"\n for alternative in ${ax_cxx_compile_alternatives}; do\n for switch in -std=c++${alternative} +std=c++${alternative} \"-h std=c++${alternative}\"; do\n cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])\n AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,\n $cachevar,\n [ac_save_CXX=\"$CXX\"\n CXX=\"$CXX $switch\"\n AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],\n [eval $cachevar=yes],\n [eval $cachevar=no])\n CXX=\"$ac_save_CXX\"])\n if eval test x\\$$cachevar = xyes; then\n CXX=\"$CXX $switch\"\n if test -n \"$CXXCPP\" ; then\n CXXCPP=\"$CXXCPP $switch\"\n fi\n ac_success=yes\n break\n fi\n done\n if test x$ac_success = xyes; then\n break\n fi\n done\n fi])\n AC_LANG_POP([C++])\n if test x$ax_cxx_compile_cxx$1_required = xtrue; then\n if test x$ac_success = xno; then\n AC_MSG_ERROR([*** A compiler with support for C++$1 language features is required.])\n fi\n fi\n if test x$ac_success = xno; then\n HAVE_CXX$1=0\n AC_MSG_NOTICE([No compiler with C++$1 support was found])\n else\n HAVE_CXX$1=1\n AC_DEFINE(HAVE_CXX$1,1,\n [define if the compiler supports basic C++$1 syntax])\n fi\n AC_SUBST(HAVE_CXX$1)\n])\n\n\ndnl Test body for checking C++11 support\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_11],\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_11\n)\n\ndnl Test body for checking C++14 support\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_14],\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_11\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_14\n)\n\ndnl Test body for checking C++17 support\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_17],\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_11\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_14\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_17\n)\n\ndnl Test body for checking C++20 support\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_20],\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_11\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_14\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_17\n _AX_CXX_COMPILE_STDCXX_testbody_new_in_20\n)\n\n\ndnl Tests for new features in C++11\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_11], [[\n\n// If the compiler admits that it is not ready for C++11, why torture it?\n// Hopefully, this will speed up the test.\n\n#ifndef __cplusplus\n\n#error \"This is not a C++ compiler\"\n\n// MSVC always sets __cplusplus to 199711L in older versions; newer versions\n// only set it correctly if /Zc:__cplusplus is specified as well as a\n// /std:c++NN switch:\n// https://devblogs.microsoft.com/cppblog/msvc-now-correctly-reports-__cplusplus/\n#elif __cplusplus < 201103L && !defined _MSC_VER\n\n#error \"This is not a C++11 compiler\"\n\n#else\n\nnamespace cxx11\n{\n\n namespace test_static_assert\n {\n\n template \n struct check\n {\n static_assert(sizeof(int) <= sizeof(T), \"not big enough\");\n };\n\n }\n\n namespace test_final_override\n {\n\n struct Base\n {\n virtual ~Base() {}\n virtual void f() {}\n };\n\n struct Derived : public Base\n {\n virtual ~Derived() override {}\n virtual void f() override {}\n };\n\n }\n\n namespace test_double_right_angle_brackets\n {\n\n template < typename T >\n struct check {};\n\n typedef check single_type;\n typedef check> double_type;\n typedef check>> triple_type;\n typedef check>>> quadruple_type;\n\n }\n\n namespace test_decltype\n {\n\n int\n f()\n {\n int a = 1;\n decltype(a) b = 2;\n return a + b;\n }\n\n }\n\n namespace test_type_deduction\n {\n\n template < typename T1, typename T2 >\n struct is_same\n {\n static const bool value = false;\n };\n\n template < typename T >\n struct is_same\n {\n static const bool value = true;\n };\n\n template < typename T1, typename T2 >\n auto\n add(T1 a1, T2 a2) -> decltype(a1 + a2)\n {\n return a1 + a2;\n }\n\n int\n test(const int c, volatile int v)\n {\n static_assert(is_same::value == true, \"\");\n static_assert(is_same::value == false, \"\");\n static_assert(is_same::value == false, \"\");\n auto ac = c;\n auto av = v;\n auto sumi = ac + av + 'x';\n auto sumf = ac + av + 1.0;\n static_assert(is_same::value == true, \"\");\n static_assert(is_same::value == true, \"\");\n static_assert(is_same::value == true, \"\");\n static_assert(is_same::value == false, \"\");\n static_assert(is_same::value == true, \"\");\n return (sumf > 0.0) ? sumi : add(c, v);\n }\n\n }\n\n namespace test_noexcept\n {\n\n int f() { return 0; }\n int g() noexcept { return 0; }\n\n static_assert(noexcept(f()) == false, \"\");\n static_assert(noexcept(g()) == true, \"\");\n\n }\n\n namespace test_constexpr\n {\n\n template < typename CharT >\n unsigned long constexpr\n strlen_c_r(const CharT *const s, const unsigned long acc) noexcept\n {\n return *s ? strlen_c_r(s + 1, acc + 1) : acc;\n }\n\n template < typename CharT >\n unsigned long constexpr\n strlen_c(const CharT *const s) noexcept\n {\n return strlen_c_r(s, 0UL);\n }\n\n static_assert(strlen_c(\"\") == 0UL, \"\");\n static_assert(strlen_c(\"1\") == 1UL, \"\");\n static_assert(strlen_c(\"example\") == 7UL, \"\");\n static_assert(strlen_c(\"another\\0example\") == 7UL, \"\");\n\n }\n\n namespace test_rvalue_references\n {\n\n template < int N >\n struct answer\n {\n static constexpr int value = N;\n };\n\n answer<1> f(int&) { return answer<1>(); }\n answer<2> f(const int&) { return answer<2>(); }\n answer<3> f(int&&) { return answer<3>(); }\n\n void\n test()\n {\n int i = 0;\n const int c = 0;\n static_assert(decltype(f(i))::value == 1, \"\");\n static_assert(decltype(f(c))::value == 2, \"\");\n static_assert(decltype(f(0))::value == 3, \"\");\n }\n\n }\n\n namespace test_uniform_initialization\n {\n\n struct test\n {\n static const int zero {};\n static const int one {1};\n };\n\n static_assert(test::zero == 0, \"\");\n static_assert(test::one == 1, \"\");\n\n }\n\n namespace test_lambdas\n {\n\n void\n test1()\n {\n auto lambda1 = [](){};\n auto lambda2 = lambda1;\n lambda1();\n lambda2();\n }\n\n int\n test2()\n {\n auto a = [](int i, int j){ return i + j; }(1, 2);\n auto b = []() -> int { return '0'; }();\n auto c = [=](){ return a + b; }();\n auto d = [&](){ return c; }();\n auto e = [a, &b](int x) mutable {\n const auto identity = [](int y){ return y; };\n for (auto i = 0; i < a; ++i)\n a += b--;\n return x + identity(a + b);\n }(0);\n return a + b + c + d + e;\n }\n\n int\n test3()\n {\n const auto nullary = [](){ return 0; };\n const auto unary = [](int x){ return x; };\n using nullary_t = decltype(nullary);\n using unary_t = decltype(unary);\n const auto higher1st = [](nullary_t f){ return f(); };\n const auto higher2nd = [unary](nullary_t f1){\n return [unary, f1](unary_t f2){ return f2(unary(f1())); };\n };\n return higher1st(nullary) + higher2nd(nullary)(unary);\n }\n\n }\n\n namespace test_variadic_templates\n {\n\n template \n struct sum;\n\n template \n struct sum\n {\n static constexpr auto value = N0 + sum::value;\n };\n\n template <>\n struct sum<>\n {\n static constexpr auto value = 0;\n };\n\n static_assert(sum<>::value == 0, \"\");\n static_assert(sum<1>::value == 1, \"\");\n static_assert(sum<23>::value == 23, \"\");\n static_assert(sum<1, 2>::value == 3, \"\");\n static_assert(sum<5, 5, 11>::value == 21, \"\");\n static_assert(sum<2, 3, 5, 7, 11, 13>::value == 41, \"\");\n\n }\n\n // http://stackoverflow.com/questions/13728184/template-aliases-and-sfinae\n // Clang 3.1 fails with headers of libstd++ 4.8.3 when using std::function\n // because of this.\n namespace test_template_alias_sfinae\n {\n\n struct foo {};\n\n template\n using member = typename T::member_type;\n\n template\n void func(...) {}\n\n template\n void func(member*) {}\n\n void test();\n\n void test() { func(0); }\n\n }\n\n} // namespace cxx11\n\n#endif // __cplusplus >= 201103L\n\n]])\n\n\ndnl Tests for new features in C++14\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_14], [[\n\n// If the compiler admits that it is not ready for C++14, why torture it?\n// Hopefully, this will speed up the test.\n\n#ifndef __cplusplus\n\n#error \"This is not a C++ compiler\"\n\n#elif __cplusplus < 201402L && !defined _MSC_VER\n\n#error \"This is not a C++14 compiler\"\n\n#else\n\nnamespace cxx14\n{\n\n namespace test_polymorphic_lambdas\n {\n\n int\n test()\n {\n const auto lambda = [](auto&&... args){\n const auto istiny = [](auto x){\n return (sizeof(x) == 1UL) ? 1 : 0;\n };\n const int aretiny[] = { istiny(args)... };\n return aretiny[0];\n };\n return lambda(1, 1L, 1.0f, '1');\n }\n\n }\n\n namespace test_binary_literals\n {\n\n constexpr auto ivii = 0b0000000000101010;\n static_assert(ivii == 42, \"wrong value\");\n\n }\n\n namespace test_generalized_constexpr\n {\n\n template < typename CharT >\n constexpr unsigned long\n strlen_c(const CharT *const s) noexcept\n {\n auto length = 0UL;\n for (auto p = s; *p; ++p)\n ++length;\n return length;\n }\n\n static_assert(strlen_c(\"\") == 0UL, \"\");\n static_assert(strlen_c(\"x\") == 1UL, \"\");\n static_assert(strlen_c(\"test\") == 4UL, \"\");\n static_assert(strlen_c(\"another\\0test\") == 7UL, \"\");\n\n }\n\n namespace test_lambda_init_capture\n {\n\n int\n test()\n {\n auto x = 0;\n const auto lambda1 = [a = x](int b){ return a + b; };\n const auto lambda2 = [a = lambda1(x)](){ return a; };\n return lambda2();\n }\n\n }\n\n namespace test_digit_separators\n {\n\n constexpr auto ten_million = 100'000'000;\n static_assert(ten_million == 100000000, \"\");\n\n }\n\n namespace test_return_type_deduction\n {\n\n auto f(int& x) { return x; }\n decltype(auto) g(int& x) { return x; }\n\n template < typename T1, typename T2 >\n struct is_same\n {\n static constexpr auto value = false;\n };\n\n template < typename T >\n struct is_same\n {\n static constexpr auto value = true;\n };\n\n int\n test()\n {\n auto x = 0;\n static_assert(is_same::value, \"\");\n static_assert(is_same::value, \"\");\n return x;\n }\n\n }\n\n} // namespace cxx14\n\n#endif // __cplusplus >= 201402L\n\n]])\n\n\ndnl Tests for new features in C++17\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_17], [[\n\n// If the compiler admits that it is not ready for C++17, why torture it?\n// Hopefully, this will speed up the test.\n\n#ifndef __cplusplus\n\n#error \"This is not a C++ compiler\"\n\n#elif __cplusplus < 201703L && !defined _MSC_VER\n\n#error \"This is not a C++17 compiler\"\n\n#else\n\n#include \n#include \n#include \n\nnamespace cxx17\n{\n\n namespace test_constexpr_lambdas\n {\n\n constexpr int foo = [](){return 42;}();\n\n }\n\n namespace test::nested_namespace::definitions\n {\n\n }\n\n namespace test_fold_expression\n {\n\n template\n int multiply(Args... args)\n {\n return (args * ... * 1);\n }\n\n template\n bool all(Args... args)\n {\n return (args && ...);\n }\n\n }\n\n namespace test_extended_static_assert\n {\n\n static_assert (true);\n\n }\n\n namespace test_auto_brace_init_list\n {\n\n auto foo = {5};\n auto bar {5};\n\n static_assert(std::is_same, decltype(foo)>::value);\n static_assert(std::is_same::value);\n }\n\n namespace test_typename_in_template_template_parameter\n {\n\n template typename X> struct D;\n\n }\n\n namespace test_fallthrough_nodiscard_maybe_unused_attributes\n {\n\n int f1()\n {\n return 42;\n }\n\n [[nodiscard]] int f2()\n {\n [[maybe_unused]] auto unused = f1();\n\n switch (f1())\n {\n case 17:\n f1();\n [[fallthrough]];\n case 42:\n f1();\n }\n return f1();\n }\n\n }\n\n namespace test_extended_aggregate_initialization\n {\n\n struct base1\n {\n int b1, b2 = 42;\n };\n\n struct base2\n {\n base2() {\n b3 = 42;\n }\n int b3;\n };\n\n struct derived : base1, base2\n {\n int d;\n };\n\n derived d1 {{1, 2}, {}, 4}; // full initialization\n derived d2 {{}, {}, 4}; // value-initialized bases\n\n }\n\n namespace test_general_range_based_for_loop\n {\n\n struct iter\n {\n int i;\n\n int& operator* ()\n {\n return i;\n }\n\n const int& operator* () const\n {\n return i;\n }\n\n iter& operator++()\n {\n ++i;\n return *this;\n }\n };\n\n struct sentinel\n {\n int i;\n };\n\n bool operator== (const iter& i, const sentinel& s)\n {\n return i.i == s.i;\n }\n\n bool operator!= (const iter& i, const sentinel& s)\n {\n return !(i == s);\n }\n\n struct range\n {\n iter begin() const\n {\n return {0};\n }\n\n sentinel end() const\n {\n return {5};\n }\n };\n\n void f()\n {\n range r {};\n\n for (auto i : r)\n {\n [[maybe_unused]] auto v = i;\n }\n }\n\n }\n\n namespace test_lambda_capture_asterisk_this_by_value\n {\n\n struct t\n {\n int i;\n int foo()\n {\n return [*this]()\n {\n return i;\n }();\n }\n };\n\n }\n\n namespace test_enum_class_construction\n {\n\n enum class byte : unsigned char\n {};\n\n byte foo {42};\n\n }\n\n namespace test_constexpr_if\n {\n\n template \n int f ()\n {\n if constexpr(cond)\n {\n return 13;\n }\n else\n {\n return 42;\n }\n }\n\n }\n\n namespace test_selection_statement_with_initializer\n {\n\n int f()\n {\n return 13;\n }\n\n int f2()\n {\n if (auto i = f(); i > 0)\n {\n return 3;\n }\n\n switch (auto i = f(); i + 4)\n {\n case 17:\n return 2;\n\n default:\n return 1;\n }\n }\n\n }\n\n namespace test_template_argument_deduction_for_class_templates\n {\n\n template \n struct pair\n {\n pair (T1 p1, T2 p2)\n : m1 {p1},\n m2 {p2}\n {}\n\n T1 m1;\n T2 m2;\n };\n\n void f()\n {\n [[maybe_unused]] auto p = pair{13, 42u};\n }\n\n }\n\n namespace test_non_type_auto_template_parameters\n {\n\n template \n struct B\n {};\n\n B<5> b1;\n B<'a'> b2;\n\n }\n\n namespace test_structured_bindings\n {\n\n int arr[2] = { 1, 2 };\n std::pair pr = { 1, 2 };\n\n auto f1() -> int(&)[2]\n {\n return arr;\n }\n\n auto f2() -> std::pair&\n {\n return pr;\n }\n\n struct S\n {\n int x1 : 2;\n volatile double y1;\n };\n\n S f3()\n {\n return {};\n }\n\n auto [ x1, y1 ] = f1();\n auto& [ xr1, yr1 ] = f1();\n auto [ x2, y2 ] = f2();\n auto& [ xr2, yr2 ] = f2();\n const auto [ x3, y3 ] = f3();\n\n }\n\n namespace test_exception_spec_type_system\n {\n\n struct Good {};\n struct Bad {};\n\n void g1() noexcept;\n void g2();\n\n template\n Bad\n f(T*, T*);\n\n template\n Good\n f(T1*, T2*);\n\n static_assert (std::is_same_v);\n\n }\n\n namespace test_inline_variables\n {\n\n template void f(T)\n {}\n\n template inline T g(T)\n {\n return T{};\n }\n\n template<> inline void f<>(int)\n {}\n\n template<> int g<>(int)\n {\n return 5;\n }\n\n }\n\n} // namespace cxx17\n\n#endif // __cplusplus < 201703L && !defined _MSC_VER\n\n]])\n\n\ndnl Tests for new features in C++20\n\nm4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_20], [[\n\n#ifndef __cplusplus\n\n#error \"This is not a C++ compiler\"\n\n#elif __cplusplus < 202002L && !defined _MSC_VER\n\n#error \"This is not a C++20 compiler\"\n\n#else\n\n#include \n\nnamespace cxx20\n{\n\n// As C++20 supports feature test macros in the standard, there is no\n// immediate need to actually test for feature availability on the\n// Autoconf side.\n\n} // namespace cxx20\n\n#endif // __cplusplus < 202002L && !defined _MSC_VER\n\n]])\n" }, { "path": "m4/ax_file_escapes.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_file_escapes.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_FILE_ESCAPES\n#\n# DESCRIPTION\n#\n# Writes the specified data to the specified file.\n#\n# LICENSE\n#\n# Copyright (c) 2008 Tom Howard \n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 8\n\nAC_DEFUN([AX_FILE_ESCAPES],[\nAX_DOLLAR=\"\\$\"\nAX_SRB=\"\\\\135\"\nAX_SLB=\"\\\\133\"\nAX_BS=\"\\\\\\\\\"\nAX_DQ=\"\\\"\"\n])\n" }, { "path": "m4/ax_gcc_builtin.m4", "content": "# ===========================================================================\n# https://www.gnu.org/software/autoconf-archive/ax_gcc_builtin.html\n# ===========================================================================\n#\n# SYNOPSIS\n#\n# AX_GCC_BUILTIN(BUILTIN)\n#\n# DESCRIPTION\n#\n# This macro checks if the compiler supports one of GCC's built-in\n# functions; many other compilers also provide those same built-ins.\n#\n# The BUILTIN parameter is the name of the built-in function.\n#\n# If BUILTIN is supported define HAVE_. Keep in mind that since\n# builtins usually start with two underscores they will be copied over\n# into the HAVE_ definition (e.g. HAVE___BUILTIN_EXPECT for\n# __builtin_expect()).\n#\n# The macro caches its result in the ax_cv_have_ variable (e.g.\n# ax_cv_have___builtin_expect).\n#\n# The macro currently supports the following built-in functions:\n#\n# __builtin_assume_aligned\n# __builtin_bswap16\n# __builtin_bswap32\n# __builtin_bswap64\n# __builtin_choose_expr\n# __builtin___clear_cache\n# __builtin_clrsb\n# __builtin_clrsbl\n# __builtin_clrsbll\n# __builtin_clz\n# __builtin_clzl\n# __builtin_clzll\n# __builtin_complex\n# __builtin_constant_p\n# __builtin_ctz\n# __builtin_ctzl\n# __builtin_ctzll\n# __builtin_expect\n# __builtin_ffs\n# __builtin_ffsl\n# __builtin_ffsll\n# __builtin_fpclassify\n# __builtin_huge_val\n# __builtin_huge_valf\n# __builtin_huge_vall\n# __builtin_inf\n# __builtin_infd128\n# __builtin_infd32\n# __builtin_infd64\n# __builtin_inff\n# __builtin_infl\n# __builtin_isinf_sign\n# __builtin_nan\n# __builtin_nand128\n# __builtin_nand32\n# __builtin_nand64\n# __builtin_nanf\n# __builtin_nanl\n# __builtin_nans\n# __builtin_nansf\n# __builtin_nansl\n# __builtin_object_size\n# __builtin_parity\n# __builtin_parityl\n# __builtin_parityll\n# __builtin_popcount\n# __builtin_popcountl\n# __builtin_popcountll\n# __builtin_powi\n# __builtin_powif\n# __builtin_powil\n# __builtin_prefetch\n# __builtin_trap\n# __builtin_types_compatible_p\n# __builtin_unreachable\n#\n# Unsupported built-ins will be tested with an empty parameter set and the\n# result of the check might be wrong or meaningless so use with care.\n#\n# LICENSE\n#\n# Copyright (c) 2013 Gabriele Svelto \n#\n# Copying and distribution of this file, with or without modification, are\n# permitted in any medium without royalty provided the copyright notice\n# and this notice are preserved. This file is offered as-is, without any\n# warranty.\n\n#serial 6\n\nAC_DEFUN([AX_GCC_BUILTIN], [\n AS_VAR_PUSHDEF([ac_var], [ax_cv_have_$1])\n\n AC_CACHE_CHECK([for $1], [ac_var], [\n AC_LINK_IFELSE([AC_LANG_PROGRAM([], [\n m4_case([$1],\n [__builtin_assume_aligned], [$1(\"\", 0)],\n [__builtin_bswap16], [$1(0)],\n [__builtin_bswap32], [$1(0)],\n [__builtin_bswap64], [$1(0)],\n [__builtin_choose_expr], [$1(0, 0, 0)],\n [__builtin___clear_cache], [$1(\"\", \"\")],\n [__builtin_clrsb], [$1(0)],\n [__builtin_clrsbl], [$1(0)],\n [__builtin_clrsbll], [$1(0)],\n [__builtin_clz], [$1(0)],\n [__builtin_clzl], [$1(0)],\n [__builtin_clzll], [$1(0)],\n [__builtin_complex], [$1(0.0, 0.0)],\n [__builtin_constant_p], [$1(0)],\n [__builtin_ctz], [$1(0)],\n [__builtin_ctzl], [$1(0)],\n [__builtin_ctzll], [$1(0)],\n [__builtin_expect], [$1(0, 0)],\n [__builtin_ffs], [$1(0)],\n [__builtin_ffsl], [$1(0)],\n [__builtin_ffsll], [$1(0)],\n [__builtin_fpclassify], [$1(0, 1, 2, 3, 4, 0.0)],\n [__builtin_huge_val], [$1()],\n [__builtin_huge_valf], [$1()],\n [__builtin_huge_vall], [$1()],\n [__builtin_inf], [$1()],\n [__builtin_infd128], [$1()],\n [__builtin_infd32], [$1()],\n [__builtin_infd64], [$1()],\n [__builtin_inff], [$1()],\n [__builtin_infl], [$1()],\n [__builtin_isinf_sign], [$1(0.0)],\n [__builtin_nan], [$1(\"\")],\n [__builtin_nand128], [$1(\"\")],\n [__builtin_nand32], [$1(\"\")],\n [__builtin_nand64], [$1(\"\")],\n [__builtin_nanf], [$1(\"\")],\n [__builtin_nanl], [$1(\"\")],\n [__builtin_nans], [$1(\"\")],\n [__builtin_nansf], [$1(\"\")],\n [__builtin_nansl], [$1(\"\")],\n [__builtin_object_size], [$1(\"\", 0)],\n [__builtin_parity], [$1(0)],\n [__builtin_parityl], [$1(0)],\n [__builtin_parityll], [$1(0)],\n [__builtin_popcount], [$1(0)],\n [__builtin_popcountl], [$1(0)],\n [__builtin_popcountll], [$1(0)],\n [__builtin_powi], [$1(0, 0)],\n [__builtin_powif], [$1(0, 0)],\n [__builtin_powil], [$1(0, 0)],\n [__builtin_prefetch], [$1(\"\")],\n [__builtin_trap], [$1()],\n [__builtin_types_compatible_p], [$1(int, int)],\n [__builtin_unreachable], [$1()],\n [m4_warn([syntax], [Unsupported built-in $1, the test may fail])\n $1()]\n )\n ])],\n [AS_VAR_SET([ac_var], [yes])],\n [AS_VAR_SET([ac_var], [no])])\n ])\n\n AS_IF([test yes = AS_VAR_GET([ac_var])],\n [AC_DEFINE_UNQUOTED(AS_TR_CPP(HAVE_$1), 1,\n [Define to 1 if the system has the `$1' built-in function])], [])\n\n AS_VAR_POPDEF([ac_var])\n])\n" }, { "path": "src/AGLTable.hpp", "content": "/*************************************************************************\n** AGLTable.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n/* The following table provides a compact mapping from PostScript character names\n * to Unicode points. Instead of using the character names directly it maps the\n * hash values (xxhash32) of the names to the corresponding code points.\n * The character mapping is derived from the Adobe Glyph List (AGL):\n * https://github.com/adobe-type-tools/agl-aglfn\n * http://tug.ctan.org/macros/latex/contrib/pdfx/glyphtounicode-cmr.tex */\n\n#include \n\nstruct HashCodepointPair {\n\tuint32_t hash;\n\tuint32_t codepoint;\n};\n\nstd::array hash2unicode {{\n\t{0x001cf4a9, 0x0118}, // Eogonek\n\t{0x003b11fb, 0x055f}, // abbreviationmarkarmenian\n\t{0x0050a316, 0x0444}, // afii10086\n\t{0x0066ddfe, 0x03a5}, // Upsilon\n\t{0x0067a87d, 0x0026}, // ampersand\n\t{0x007399ea, 0x2118}, // weierstrass\n\t{0x009a8cbc, 0x30c8}, // tokatakana\n\t{0x00a8ecc1, 0xfb93}, // gaffinalarabic\n\t{0x00b0f8d6, 0x05b2}, // hatafpatahwidehebrew\n\t{0x00b1b890, 0x2486}, // nineteenparen\n\t{0x00b92975, 0x05a7}, // dargalefthebrew\n\t{0x00c458a3, 0x2154}, // twothirds\n\t{0x00e73988, 0x09b8}, // sabengali\n\t{0x00f475c4, 0x03ee}, // Deicoptic\n\t{0x00fa9974, 0x0303}, // tildecmb\n\t{0x01012c9a, 0x05b4}, // hiriq\n\t{0x0107d6e3, 0x0933}, // lladeva\n\t{0x01127238, 0x3237}, // ideographiccongratulationparen\n\t{0x011abc50, 0x0547}, // Shaarmenian\n\t{0x01297545, 0x25aa}, // H18543\n\t{0x012d44bc, 0x05d6}, // afii57670\n\t{0x013044fb, 0x2205}, // emptyset\n\t{0x01422ce1, 0x0486}, // psilipneumatacyrilliccmb\n\t{0x01571757, 0xfe6b}, // atsmall\n\t{0x01678eeb, 0x066b}, // decimalseparatorpersian\n\t{0x018643fe, 0x091a}, // cadeva\n\t{0x019e6772, 0x3148}, // cieuckorean\n\t{0x019fa822, 0x05de}, // mem\n\t{0x01cfa7b3, 0x0a3e}, // aamatragurmukhi\n\t{0x01d7c979, 0x3007}, // ideographiczero\n\t{0x020d70ad, 0x278b}, // twocircleinversesansserif\n\t{0x0239eab1, 0x3131}, // kiyeokkorean\n\t{0x023b0c79, 0xff87}, // nukatakanahalfwidth\n\t{0x023deac8, 0x3183}, // yesieungpansioskorean\n\t{0x02409db2, 0x1ed1}, // ocircumflexacute\n\t{0x02574652, 0x0e1b}, // poplathai\n\t{0x025b8acc, 0x0a47}, // eematragurmukhi\n\t{0x02610d57, 0x2668}, // hotsprings\n\t{0x0292f83b, 0x0e11}, // thonangmonthothai\n\t{0x0293c9db, 0xff49}, // imonospace\n\t{0x029e63cc, 0x21e7}, // arrowupwhite\n\t{0x02a32a9d, 0x0275}, // obarred\n\t{0x02a97908, 0x09f7}, // fournumeratorbengali\n\t{0x02abe0be, 0x2556}, // SF210000\n\t{0x02acd87a, 0x2461}, // twocircle\n\t{0x02bb8927, 0x0154}, // Racute\n\t{0x02bd043f, 0x3392}, // mhzsquare\n\t{0x02bdc138, 0x304a}, // ohiragana\n\t{0x02c40de7, 0xffe6}, // wonmonospace\n\t{0x02dab625, 0x310c}, // lbopomofo\n\t{0x02df8edf, 0x30e7}, // yosmallkatakana\n\t{0x02e3dfc8, 0x3062}, // dihiragana\n\t{0x0306380d, 0xff35}, // Umonospace\n\t{0x03170204, 0x0495}, // ghemiddlehookcyrillic\n\t{0x03182c9f, 0x25b4}, // blackuppointingsmalltriangle\n\t{0x0319d343, 0x329e}, // ideographicprintcircle\n\t{0x031ad266, 0x331e}, // kooposquare\n\t{0x03274b72, 0x0018}, // controlCAN\n\t{0x0334c4d5, 0x0aa7}, // dhagujarati\n\t{0x03396436, 0x1ed0}, // Ocircumflexacute\n\t{0x033b64c4, 0x047f}, // otcyrillic\n\t{0x033e74dc, 0x1e44}, // Ndotaccent\n\t{0x034ec8b1, 0x30b0}, // gukatakana\n\t{0x037b5e30, 0x00b9}, // onesuperior\n\t{0x03993e60, 0xff57}, // wmonospace\n\t{0x03a136c3, 0x0e0b}, // sosothai\n\t{0x03b0103c, 0x2270}, // notlessnorequal\n\t{0x03c2a8d8, 0x1eb3}, // abrevehookabove\n\t{0x03d234c7, 0xfea7}, // khahinitialarabic\n\t{0x03f4da1a, 0x05b8}, // qamatsnarrowhebrew\n\t{0x0410b525, 0x0138}, // kgreenlandic\n\t{0x0433eb22, 0x014e}, // Obreve\n\t{0x043f3fc5, 0x040a}, // afii10059\n\t{0x044589fe, 0x0646}, // afii57446\n\t{0x044ba421, 0x0585}, // oharmenian\n\t{0x0454dddc, 0x0432}, // afii10067\n\t{0x048b164e, 0x01c3}, // clickretroflex\n\t{0x048e8b97, 0x0161}, // scaron\n\t{0x0491732e, 0x3186}, // yeorinhieuhkorean\n\t{0x049c65ac, 0x2121}, // telephone\n\t{0x04a45907, 0x041a}, // afii10028\n\t{0x04c4d94b, 0x05b5}, // tsere1e\n\t{0x04c8ee7d, 0x042d}, // Ereversedcyrillic\n\t{0x04de1db0, 0x0950}, // omdeva\n\t{0x04f4d676, 0x0027}, // quotesingle\n\t{0x0500f909, 0x0407}, // Yicyrillic\n\t{0x0503fcb5, 0x00b1}, // plusminus\n\t{0x05116c6a, 0x30fc}, // prolongedkana\n\t{0x05302abd, 0x2025}, // twodotleader\n\t{0x053ece0c, 0x3050}, // guhiragana\n\t{0x05574c05, 0x09a3}, // nnabengali\n\t{0x056bac6c, 0x30a3}, // ismallkatakana\n\t{0x058218bb, 0x0386}, // Alphatonos\n\t{0x058691a9, 0x33d2}, // squarelog\n\t{0x059c61cd, 0x0436}, // zhecyrillic\n\t{0x059eb4a3, 0x2085}, // fiveinferior\n\t{0x05a47299, 0x320d}, // hieuhparenkorean\n\t{0x05a53e96, 0x0282}, // shook\n\t{0x05b0f8c3, 0x02b5}, // rhookturnedsuperior\n\t{0x05cee53c, 0x201d}, // quotedblright\n\t{0x05de47fd, 0x1e7f}, // vdotbelow\n\t{0x05e340f3, 0x1e70}, // Tcircumflexbelow\n\t{0x05e8321d, 0x0325}, // ringbelowcmb\n\t{0x05ec5d36, 0x2471}, // eighteencircle\n\t{0x05f03fff, 0x0ae0}, // rrvocalicgujarati\n\t{0x060beb03, 0x0175}, // wcircumflex\n\t{0x061ad8fc, 0x24ca}, // Ucircle\n\t{0x0642035b, 0x0010}, // controlDLE\n\t{0x0646584a, 0x003d}, // equal\n\t{0x064874b1, 0x05d3}, // afii57667\n\t{0x066433cf, 0x20a4}, // lira\n\t{0x06823c6b, 0xfb4d}, // kafrafehebrew\n\t{0x06894954, 0xff5e}, // asciitildemonospace\n\t{0x069a405d, 0x00e6}, // ae\n\t{0x06b00ffc, 0x0101}, // amacron\n\t{0x06b72f51, 0x27e8}, // angbracketleftbig\n\t{0x06be8647, 0x0442}, // afii10084\n\t{0x06ec3366, 0xfe42}, // cornerbracketrightvertical\n\t{0x0700a693, 0x0475}, // izhitsacyrillic\n\t{0x07019244, 0xfb02}, // fl\n\t{0x07072da3, 0x2299}, // circleot\n\t{0x07099ef9, 0xfeae}, // rehfinalarabic\n\t{0x0710dd39, 0x02de}, // rhotichookmod\n\t{0x074aba74, 0x09af}, // yabengali\n\t{0x07562010, 0x09bc}, // nuktabengali\n\t{0x075a830a, 0x21e6}, // arrowleftwhite\n\t{0x076312db, 0x2497}, // sixteenperiod\n\t{0x0767cf10, 0x1ea8}, // Acircumflexhookabove\n\t{0x076c3b34, 0x1ec3}, // ecircumflexhookabove\n\t{0x076dbf41, 0x05b7}, // patah11\n\t{0x07726745, 0x0e25}, // lolingthai\n\t{0x078184fa, 0x00f7}, // divide\n\t{0x0790751c, 0x2466}, // sevencircle\n\t{0x0793d50d, 0x30bb}, // sekatakana\n\t{0x07a1ce35, 0x0906}, // aadeva\n\t{0x07ab20a8, 0x0ab3}, // llagujarati\n\t{0x07e20c30, 0x017b}, // Zdot\n\t{0x07e38c67, 0x33bb}, // nwsquare\n\t{0x081dd122, 0x0a38}, // sagurmukhi\n\t{0x082543e5, 0x33a0}, // cmsquaredsquare\n\t{0x083d0b54, 0x3227}, // eightideographicparen\n\t{0x08429fa7, 0x2591}, // ltshade\n\t{0x084b888b, 0x311a}, // abopomofo\n\t{0x085499c4, 0x0925}, // thadeva\n\t{0x086a99d9, 0x01af}, // Uhorn\n\t{0x087038eb, 0xfb20}, // ayinaltonehebrew\n\t{0x089d739a, 0x005a}, // Z\n\t{0x08a131c8, 0x096d}, // sevendeva\n\t{0x08a6b099, 0x02a6}, // ts\n\t{0x08b5de5a, 0x038a}, // Iotatonos\n\t{0x08b78f6b, 0xff86}, // nikatakanahalfwidth\n\t{0x08d57b6a, 0x0019}, // controlEM\n\t{0x08ddb521, 0x3226}, // sevenideographicparen\n\t{0x092aa224, 0x0a90}, // aigujarati\n\t{0x092cd86d, 0x03d6}, // omega1\n\t{0x09310ab8, 0x027f}, // rfishhookreversed\n\t{0x094ceadc, 0x0047}, // G\n\t{0x09751504, 0x038c}, // Omicrontonos\n\t{0x09790f28, 0x33be}, // kwsquare\n\t{0x09853aa3, 0x01c1}, // clicklateral\n\t{0x09a03740, 0xfe5b}, // braceleftsmall\n\t{0x09a4b050, 0x0ae8}, // twogujarati\n\t{0x09d4b5eb, 0x3388}, // calsquare\n\t{0x09f2217d, 0x00a9}, // copyright\n\t{0x09f9df24, 0x1e0c}, // Ddotbelow\n\t{0x0a040d76, 0x098a}, // uubengali\n\t{0x0a1d800c, 0x0291}, // zcurl\n\t{0x0a3b8eb5, 0x044b}, // yericyrillic\n\t{0x0a46f2f1, 0x0284}, // dotlessjstrokehook\n\t{0x0a5cb3b1, 0x30d6}, // bukatakana\n\t{0x0a5ff1a8, 0xff6b}, // osmallkatakanahalfwidth\n\t{0x0a67f8fb, 0x24b2}, // wparen\n\t{0x0a704676, 0xfccc}, // lammeeminitialarabic\n\t{0x0a8ba8e8, 0x0112}, // Emacron\n\t{0x0a9b47dd, 0x306f}, // hahiragana\n\t{0x0aa2156d, 0xfc0c}, // tehhahisolatedarabic\n\t{0x0abb4ec1, 0x0441}, // afii10083\n\t{0x0adbba15, 0x21c0}, // harpoonrightbarbup\n\t{0x0ae79191, 0x01e1}, // adotmacron\n\t{0x0af77d49, 0x09ea}, // fourbengali\n\t{0x0b367d7a, 0x0421}, // Escyrillic\n\t{0x0b4b7082, 0xff62}, // cornerbracketlefthalfwidth\n\t{0x0b6abf22, 0x20aa}, // sheqel\n\t{0x0b7f2b2d, 0x0a5a}, // ghhagurmukhi\n\t{0x0b92d660, 0x32a6}, // ideographiclowcircle\n\t{0x0b9e2621, 0x2665}, // heartsuitblack\n\t{0x0ba5f00c, 0x03cc}, // omicrontonos\n\t{0x0bae12ff, 0xff2a}, // Jmonospace\n\t{0x0bd4abb3, 0x0254}, // oopen\n\t{0x0bd8d304, 0x3215}, // ieungaparenkorean\n\t{0x0bdad647, 0x0970}, // abbreviationsigndeva\n\t{0x0bdb550e, 0x0669}, // ninehackarabic\n\t{0x0be3cda3, 0x1e0b}, // ddotaccent\n\t{0x0bf8ed4a, 0x09f2}, // rupeemarkbengali\n\t{0x0bfa9d4e, 0x05b6}, // afii57795\n\t{0x0c138c8e, 0x308f}, // wahiragana\n\t{0x0c17017e, 0x02a5}, // dzcurl\n\t{0x0c19fd92, 0x037a}, // ypogegrammeni\n\t{0x0c255ae5, 0x0553}, // Piwrarmenian\n\t{0x0c356707, 0x0625}, // afii57413\n\t{0x0c678de3, 0x032a}, // bridgebelowcmb\n\t{0x0c810887, 0x0a88}, // iigujarati\n\t{0x0c83c594, 0x1e63}, // sdotbelow\n\t{0x0c8f5261, 0x0164}, // Tcaron\n\t{0x0cacee48, 0xfba8}, // hehinitialaltonearabic\n\t{0x0cbb507c, 0x3036}, // circlepostalmark\n\t{0x0cd99820, 0x05c0}, // paseqhebrew\n\t{0x0cdb81c4, 0x24a2}, // gparen\n\t{0x0ce8bb7e, 0x30d5}, // hukatakana\n\t{0x0cf04968, 0x02be}, // ringhalfright\n\t{0x0d0eb2f0, 0x315d}, // weokorean\n\t{0x0d21bb72, 0x2550}, // SF430000\n\t{0x0d47308f, 0x05d4}, // he\n\t{0x0d747cfe, 0x04c3}, // Kahookcyrillic\n\t{0x0d932b5b, 0x30d2}, // hikatakana\n\t{0x0da4d862, 0x05b6}, // segol13\n\t{0x0db7d6e4, 0x05d4}, // hehebrew\n\t{0x0dc03ecb, 0x0a9c}, // jagujarati\n\t{0x0dd6f75d, 0x09f6}, // threenumeratorbengali\n\t{0x0de664af, 0x01fa}, // Aringacute\n\t{0x0deddd7b, 0x017a}, // zacute\n\t{0x0df6966e, 0x1e4f}, // otildedieresis\n\t{0x0e0870a7, 0x2713}, // checkmark\n\t{0x0e0aefc5, 0x05af}, // masoracirclehebrew\n\t{0x0e15512a, 0xff43}, // cmonospace\n\t{0x0e157c7d, 0x0166}, // Tbar\n\t{0x0e34eac4, 0x06ba}, // afii57514\n\t{0x0e359de3, 0x332b}, // paasentosquare\n\t{0x0e35e57d, 0x01f4}, // Gacute\n\t{0x0e6ec8aa, 0x0a40}, // iimatragurmukhi\n\t{0x0e8140cb, 0x2318}, // propellor\n\t{0x0e8e8ac7, 0x25aa}, // blacksmallsquare\n\t{0x0e8ed92c, 0x05b3}, // hatafqamatsquarterhebrew\n\t{0x0e9c1a93, 0x0149}, // quoterightn\n\t{0x0eb0ce00, 0xff30}, // Pmonospace\n\t{0x0ec7e019, 0xfc4b}, // noonjeemisolatedarabic\n\t{0x0ed8b040, 0x33b5}, // nvsquare\n\t{0x0edd0c59, 0x0e35}, // saraiithai\n\t{0x0ee06289, 0x05b0}, // shevaquarterhebrew\n\t{0x0efc1459, 0x09b6}, // shabengali\n\t{0x0f02712c, 0x00ea}, // ecircumflex\n\t{0x0f066e82, 0x33b3}, // mssquare\n\t{0x0f1a6991, 0x24c4}, // Ocircle\n\t{0x0f2768b1, 0x05b1}, // hatafsegolwidehebrew\n\t{0x0f332d5e, 0x002e}, // period\n\t{0x0f35dd15, 0x04b0}, // Ustraightstrokecyrillic\n\t{0x0f432338, 0x0020}, // space\n\t{0x0f433f21, 0xff7d}, // sukatakanahalfwidth\n\t{0x0f610d68, 0x1e53}, // omacronacute\n\t{0x0f61debf, 0x33b9}, // mvmegasquare\n\t{0x0f8de5e5, 0xff4b}, // kmonospace\n\t{0x0f984d6e, 0xfec0}, // dadmedialarabic\n\t{0x0fcfb12d, 0x016c}, // Ubreve\n\t{0x0fdfc487, 0x02a8}, // tccurl\n\t{0x0ff64b0b, 0x0665}, // fivehackarabic\n\t{0x1001b5d7, 0xfc48}, // meemmeemisolatedarabic\n\t{0x100f790a, 0x20ac}, // Euro\n\t{0x101477b7, 0x216a}, // Elevenroman\n\t{0x1030f103, 0x0918}, // ghadeva\n\t{0x103612b8, 0x2287}, // supersetorequal\n\t{0x10459048, 0x2217}, // asteriskmath\n\t{0x10529f46, 0x0e59}, // ninethai\n\t{0x10656b29, 0x042a}, // afii10044\n\t{0x10659a4d, 0x0041}, // A\n\t{0x106ab99c, 0x0943}, // rvocalicvowelsigndeva\n\t{0x10827219, 0x01e4}, // Gstroke\n\t{0x1087cbb6, 0x318d}, // araeakorean\n\t{0x10c49213, 0x094d}, // viramadeva\n\t{0x10c6b04c, 0xfee8}, // noonmedialarabic\n\t{0x10e1204e, 0x224c}, // allequal\n\t{0x1112335e, 0x0e24}, // ruthai\n\t{0x1113e9a7, 0x0a87}, // igujarati\n\t{0x11140e23, 0xff50}, // pmonospace\n\t{0x112533be, 0x0446}, // tsecyrillic\n\t{0x1128968b, 0x03dc}, // Digammagreek\n\t{0x113f9725, 0x1ea1}, // adotbelow\n\t{0x11572f90, 0x3240}, // ideographicfestivalparen\n\t{0x1159e298, 0x2484}, // seventeenparen\n\t{0x115b5935, 0xff78}, // kukatakanahalfwidth\n\t{0x115c3cb2, 0x3179}, // kapyeounssangpieupkorean\n\t{0x11672a1e, 0x3051}, // kehiragana\n\t{0x1179ac42, 0x00a0}, // nbspace\n\t{0x1198b8ba, 0x05f1}, // vavyodhebrew\n\t{0x11adf5a7, 0x24a9}, // nparen\n\t{0x11aeb63a, 0x2272}, // lessorequivalent\n\t{0x11ba40f5, 0x05ea}, // tavhebrew\n\t{0x11c11092, 0x1e2c}, // Itildebelow\n\t{0x11c8e4b3, 0x2660}, // spadesuitblack\n\t{0x11d3eac3, 0x3060}, // dahiragana\n\t{0x11d67798, 0xfb33}, // daletdagesh\n\t{0x11e401c1, 0x05d6}, // zayin\n\t{0x1216fef8, 0x328e}, // ideographmetalcircle\n\t{0x1219f723, 0xff6e}, // yosmallkatakanahalfwidth\n\t{0x1224d569, 0xfee4}, // meemmedialarabic\n\t{0x1228548c, 0x05d0}, // alefhebrew\n\t{0x1233afe9, 0x30df}, // mikatakana\n\t{0x123a07fe, 0x05e6}, // tsadihebrew\n\t{0x1242de49, 0x042b}, // Yericyrillic\n\t{0x1246d709, 0x315f}, // wikorean\n\t{0x126c42a3, 0x21d0}, // arrowleftdbl\n\t{0x1278a8d5, 0x3087}, // yosmallhiragana\n\t{0x129b0140, 0x0445}, // afii10087\n\t{0x12a29be8, 0x03c5}, // upsilon\n\t{0x12bdd9c7, 0x21a6}, // mapsto\n\t{0x12d3e8f7, 0x30c0}, // dakatakana\n\t{0x12def4bb, 0xfeba}, // sadfinalarabic\n\t{0x12e22bb8, 0x33c2}, // amsquare\n\t{0x1329e467, 0x0311}, // breveinvertedcmb\n\t{0x132b7bd0, 0x2a04}, // unionmultitext\n\t{0x132e0697, 0x01b3}, // Yhook\n\t{0x134d9c31, 0x304c}, // gahiragana\n\t{0x13597fb3, 0x04d9}, // afii10846\n\t{0x135d6341, 0x33c8}, // dbsquare\n\t{0x13635045, 0x0300}, // gravecmb\n\t{0x1369554a, 0x207f}, // nsuperior\n\t{0x1376f153, 0x0403}, // afii10052\n\t{0x1384d3da, 0x05b4}, // hiriqnarrowhebrew\n\t{0x13868087, 0x0636}, // afii57430\n\t{0x138fca68, 0x0a30}, // ragurmukhi\n\t{0x13a69297, 0x0917}, // gadeva\n\t{0x13bcc567, 0x25d1}, // circlewithrighthalfblack\n\t{0x13ccaf5f, 0x3061}, // tihiragana\n\t{0x13dc1f9e, 0x05b1}, // hatafsegol\n\t{0x13e2dbb5, 0x1e3a}, // Llinebelow\n\t{0x140e7a7e, 0x0551}, // Coarmenian\n\t{0x14117f5a, 0x1e77}, // ucircumflexbelow\n\t{0x141d63ad, 0x1eda}, // Ohornacute\n\t{0x142c024d, 0x013a}, // lacute\n\t{0x143d707c, 0x05a6}, // merkhakefulalefthebrew\n\t{0x146c75cf, 0x3275}, // ieungacirclekorean\n\t{0x146f18bb, 0xfb36}, // zayindagesh\n\t{0x147a2240, 0x1e81}, // wgrave\n\t{0x1486cc9b, 0x054b}, // Jheharmenian\n\t{0x14ac715c, 0x2473}, // twentycircle\n\t{0x14b421a5, 0x0638}, // zaharabic\n\t{0x14c795cf, 0x0051}, // Q\n\t{0x14d1cd4b, 0x2284}, // notsubset\n\t{0x14d2cd8a, 0x012f}, // iogonek\n\t{0x14f2bc91, 0x1eab}, // acircumflextilde\n\t{0x15045632, 0x05d1}, // bet\n\t{0x1505dc02, 0x3083}, // yasmallhiragana\n\t{0x152785c0, 0x30a1}, // asmallkatakana\n\t{0x15642935, 0x23a9}, // braceleftbt\n\t{0x1564e3f1, 0x05b9}, // holam26\n\t{0x15771621, 0x042c}, // Softsigncyrillic\n\t{0x159ac6ab, 0x0591}, // etnahtafoukhlefthebrew\n\t{0x159b9dc9, 0x24c6}, // Qcircle\n\t{0x15d1c25e, 0x04bf}, // chedescenderabkhasiancyrillic\n\t{0x15dd6b0c, 0x25d9}, // whitecircleinverse\n\t{0x15f64606, 0x33c5}, // cdsquare\n\t{0x15f8ec13, 0x037e}, // questiongreek\n\t{0x1602acd3, 0xff38}, // Xmonospace\n\t{0x1610c2ad, 0x3181}, // yesieungkorean\n\t{0x16393f6d, 0xfef6}, // lamalefmaddaabovefinalarabic\n\t{0x164a5cd1, 0x0058}, // X\n\t{0x165341dd, 0x02e0}, // gammasuperior\n\t{0x167b1fac, 0xfebc}, // sadmedialarabic\n\t{0x168b9d05, 0x04d5}, // aiecyrillic\n\t{0x169cceb3, 0x005b}, // bracketleft\n\t{0x16ad260d, 0x0253}, // bhook\n\t{0x16b23c67, 0x3135}, // nieuncieuckorean\n\t{0x16ba0a7a, 0x30a9}, // osmallkatakana\n\t{0x16d5ac91, 0x3018}, // whitetortoiseshellbracketleft\n\t{0x16f9045d, 0x0a16}, // khagurmukhi\n\t{0x17093caa, 0x01e3}, // aemacron\n\t{0x170fc75c, 0x306c}, // nuhiragana\n\t{0x171b516a, 0x0a39}, // hagurmukhi\n\t{0x17301afd, 0x3023}, // threehangzhou\n\t{0x173c8456, 0x338b}, // nfsquare\n\t{0x178d45ae, 0x337e}, // meizierasquare\n\t{0x17a9e49b, 0x322a}, // ideographicmoonparen\n\t{0x17ad5313, 0x09ab}, // phabengali\n\t{0x17da2afa, 0x0335}, // strokeshortoverlaycmb\n\t{0x17deda0e, 0x00ed}, // iacute\n\t{0x17e36acb, 0x05b8}, // qamats\n\t{0x17ef9c62, 0x0a05}, // agurmukhi\n\t{0x180419cd, 0xfc62}, // shaddakasraarabic\n\t{0x18120be8, 0x200b}, // zerowidthspace\n\t{0x18175789, 0x05b3}, // hatafqamatswidehebrew\n\t{0x181f5c91, 0x091f}, // ttadeva\n\t{0x182bd096, 0x0148}, // ncaron\n\t{0x183028bb, 0x04da}, // Schwadieresiscyrillic\n\t{0x1840ed9a, 0xfea0}, // jeemmedialarabic\n\t{0x18492236, 0x0e5a}, // angkhankhuthai\n\t{0x1855a5e3, 0xfe5f}, // numbersignsmall\n\t{0x185b816d, 0x0146}, // ncommaaccent\n\t{0x187ab455, 0x0e42}, // saraothai\n\t{0x1885706c, 0x3157}, // okorean\n\t{0x18923bff, 0x2135}, // aleph\n\t{0x18a5c10a, 0x2584}, // dnblock\n\t{0x18a72a69, 0xfb3a}, // finalkafdageshhebrew\n\t{0x18b82c53, 0x045c}, // afii10109\n\t{0x18c46fec, 0x033c}, // seagullbelowcmb\n\t{0x18d47bfd, 0x3298}, // ideographiclaborcircle\n\t{0x18dbddd2, 0x0993}, // obengali\n\t{0x18df8652, 0x2286}, // subsetorequal\n\t{0x18ea53c7, 0x0663}, // afii57395\n\t{0x18ec3f78, 0x05e8}, // afii57688\n\t{0x18f0d507, 0xfe9f}, // jeeminitialarabic\n\t{0x190a56aa, 0xfe5a}, // parenrightsmall\n\t{0x1920c2c2, 0xff65}, // middledotkatakanahalfwidth\n\t{0x192c8826, 0x2283}, // superset\n\t{0x1940b4fd, 0x2251}, // geometricallyequal\n\t{0x19427103, 0x2a01}, // circleplustext\n\t{0x1946a31f, 0x05ae}, // zinorhebrew\n\t{0x194ec3dd, 0xfb38}, // tetdageshhebrew\n\t{0x195fdeed, 0x3013}, // getamark\n\t{0x197f461f, 0x1e03}, // bdotaccent\n\t{0x1994a487, 0x0481}, // koppacyrillic\n\t{0x19985117, 0x339a}, // nmsquare\n\t{0x19a1a98b, 0x00ad}, // sfthyphen\n\t{0x19ad4aac, 0xfef2}, // yehfinalarabic\n\t{0x19b22272, 0x3269}, // chieuchcirclekorean\n\t{0x19b344e4, 0x0123}, // gcedilla\n\t{0x19b3f208, 0x05b8}, // qamats27\n\t{0x19d833fe, 0x02ba}, // dblprimemod\n\t{0x19dea593, 0x0428}, // afii10042\n\t{0x19f7c320, 0x04d1}, // abrevecyrillic\n\t{0x19fa29b1, 0x327f}, // koreanstandardsymbol\n\t{0x1a00d3da, 0x032b}, // dblarchinvertedbelowcmb\n\t{0x1a260946, 0x0447}, // checyrillic\n\t{0x1a287ed9, 0x0922}, // ddhadeva\n\t{0x1a3b33cb, 0xfed7}, // qafinitialarabic\n\t{0x1a3bf649, 0x05b2}, // hatafpatahhebrew\n\t{0x1a4f3484, 0x0913}, // odeva\n\t{0x1a533d39, 0x0306}, // brevecmb\n\t{0x1ac76244, 0x0425}, // Khacyrillic\n\t{0x1ac90440, 0x010f}, // dcaron\n\t{0x1b240a74, 0x00d8}, // Oslash\n\t{0x1b2b4015, 0xfe65}, // greatersmall\n\t{0x1b33167a, 0xfe3e}, // dblanglebracketrightvertical\n\t{0x1b342691, 0x017c}, // zdot\n\t{0x1b39339b, 0x253c}, // SF050000\n\t{0x1b3f9c21, 0x1e72}, // Udieresisbelow\n\t{0x1b4399b2, 0x04c7}, // Enhookcyrillic\n\t{0x1b5874ea, 0x091b}, // chadeva\n\t{0x1b8c8992, 0x2122}, // trademark\n\t{0x1ba72293, 0xff03}, // numbersignmonospace\n\t{0x1bbb8fb3, 0x0477}, // izhitsadblgravecyrillic\n\t{0x1bcb2bfd, 0x337d}, // taisyouerasquare\n\t{0x1be98812, 0x24d4}, // ecircle\n\t{0x1c079308, 0x09cc}, // auvowelsignbengali\n\t{0x1c16ebae, 0x0126}, // Hbar\n\t{0x1c2631dd, 0x3385}, // KBsquare\n\t{0x1c56e166, 0xfd3f}, // parenrightaltonearabic\n\t{0x1c94529b, 0x21b5}, // carriagereturn\n\t{0x1cb10674, 0x0a27}, // dhagurmukhi\n\t{0x1cb5367a, 0x0532}, // Benarmenian\n\t{0x1cdb3e05, 0x2514}, // SF020000\n\t{0x1ce17c08, 0xfea6}, // khahfinalarabic\n\t{0x1ce29209, 0x02cc}, // verticallinelowmod\n\t{0x1ce40996, 0xff3b}, // bracketleftmonospace\n\t{0x1cf31612, 0x0598}, // zarqahebrew\n\t{0x1d2559c8, 0x03b9}, // iota\n\t{0x1d25e3ef, 0x043c}, // emcyrillic\n\t{0x1d420ccb, 0x0430}, // afii10065\n\t{0x1d954d85, 0x09a4}, // tabengali\n\t{0x1da7ae8c, 0x00d7}, // multiply\n\t{0x1db92094, 0x053d}, // Xeharmenian\n\t{0x1dbbea92, 0x02e6}, // tonebarhighmod\n\t{0x1dbc2a14, 0x2245}, // congruent\n\t{0x1dbe86c5, 0x246d}, // fourteencircle\n\t{0x1dc0644e, 0x2012}, // figuredash\n\t{0x1ded853e, 0x01cc}, // nj\n\t{0x1df7638a, 0x00e4}, // adieresis\n\t{0x1dfc2837, 0x217a}, // elevenroman\n\t{0x1e0312fa, 0x0290}, // zretroflexhook\n\t{0x1e1332fd, 0x0287}, // tturned\n\t{0x1e25355a, 0x0461}, // omegacyrillic\n\t{0x1e38c8d8, 0x012a}, // Imacron\n\t{0x1e56afb4, 0xfc61}, // shaddadammaarabic\n\t{0x1e645fd0, 0x00b2}, // twosuperior\n\t{0x1e6cddcb, 0x0563}, // gimarmenian\n\t{0x1e7c9862, 0x338f}, // squarekg\n\t{0x1e82a7c3, 0x2302}, // house\n\t{0x1e860782, 0x0983}, // visargabengali\n\t{0x1e917582, 0x09a2}, // ddhabengali\n\t{0x1ea7d113, 0x031c}, // ringhalfleftbelowcmb\n\t{0x1eae034a, 0x3122}, // anbopomofo\n\t{0x1eae1716, 0x0434}, // afii10069\n\t{0x1edf9913, 0x1e16}, // Emacronacute\n\t{0x1ef123d5, 0x0413}, // Gecyrillic\n\t{0x1f06ae25, 0xfb31}, // betdageshhebrew\n\t{0x1f1df6d1, 0x3381}, // nasquare\n\t{0x1f2383d4, 0x0004}, // controlEOT\n\t{0x1f2a4214, 0xfdfa}, // sallallahoualayhewasallamarabic\n\t{0x1f60dad4, 0x05e8}, // reshhebrew\n\t{0x1f686fbe, 0xff2c}, // Lmonospace\n\t{0x1f90aeb4, 0xff7b}, // sakatakanahalfwidth\n\t{0x1f93ce2b, 0xff33}, // Smonospace\n\t{0x1f9b52d4, 0x0323}, // dotbelowcmb\n\t{0x1faa2fdf, 0x203e}, // overline\n\t{0x1faf20cc, 0x02b9}, // primemod\n\t{0x1fba9d24, 0x1e4a}, // Ncircumflexbelow\n\t{0x1fc00e7e, 0x0050}, // P\n\t{0x1fc99492, 0x3126}, // erbopomofo\n\t{0x1feea4ab, 0x0623}, // afii57411\n\t{0x20061138, 0x1e02}, // Bdotaccent\n\t{0x200e9513, 0x030f}, // dblgravecmb\n\t{0x201a6676, 0x2310}, // logicalnotreversed\n\t{0x201e3ee9, 0x0310}, // candrabinducmb\n\t{0x2024cfd1, 0x0475}, // afii10196\n\t{0x2038e6d5, 0x307a}, // pehiragana\n\t{0x205d0ec7, 0x03a0}, // Pi\n\t{0x207bf81e, 0xff84}, // tokatakanahalfwidth\n\t{0x2086c569, 0x00d2}, // Ograve\n\t{0x208b3b40, 0xfed0}, // ghainmedialarabic\n\t{0x209bfca6, 0x24d5}, // fcircle\n\t{0x20a31ebd, 0x2489}, // twoperiod\n\t{0x20abefc1, 0x0385}, // dialytikatonos\n\t{0x20b8cfa5, 0x0443}, // afii10085\n\t{0x20bc528f, 0x2042}, // asterism\n\t{0x20ca67b9, 0x09a1}, // ddabengali\n\t{0x20ce09b9, 0xfb7b}, // tchehfinalarabic\n\t{0x20dd36ea, 0x207e}, // parenrightsuperior\n\t{0x20e840a0, 0x30d4}, // pikatakana\n\t{0x2111e869, 0x092a}, // padeva\n\t{0x21185c0e, 0x028e}, // yturned\n\t{0x2130f98f, 0x0aa0}, // tthagujarati\n\t{0x215fc096, 0x000d}, // controlCR\n\t{0x21622652, 0x249e}, // cparen\n\t{0x21669982, 0x0181}, // Bhook\n\t{0x217143de, 0x05b3}, // hatafqamats34\n\t{0x2173a28b, 0x0295}, // glottalstopreversed\n\t{0x218d5b62, 0x3232}, // ideographichaveparen\n\t{0x21b37808, 0x2477}, // fourparen\n\t{0x21bef9d7, 0x0e06}, // khorakhangthai\n\t{0x21c0f31f, 0x013b}, // Lcommaaccent\n\t{0x21ce0071, 0x2179}, // tenroman\n\t{0x21d28f9e, 0x05e9}, // shin\n\t{0x21f74f30, 0x043e}, // afii10080\n\t{0x2203033d, 0x019d}, // Nhookleft\n\t{0x22037801, 0x044b}, // afii10093\n\t{0x220f1331, 0x05db}, // kafhebrew\n\t{0x2221c36b, 0x06f6}, // sixpersian\n\t{0x22351581, 0x059f}, // qarneyparahebrew\n\t{0x223cb30f, 0xfc9f}, // behmeeminitialarabic\n\t{0x225099c3, 0x3149}, // ssangcieuckorean\n\t{0x22542ce4, 0x2207}, // nabla\n\t{0x22702420, 0x3153}, // eokorean\n\t{0x2274db8f, 0xff08}, // parenleftmonospace\n\t{0x2282e86d, 0x00fa}, // uacute\n\t{0x22a883d2, 0x25c7}, // whitediamond\n\t{0x22c93a2b, 0x338d}, // mugsquare\n\t{0x22e3ac9e, 0xff4c}, // lmonospace\n\t{0x2320c842, 0x0277}, // omegalatinclosed\n\t{0x2324e69c, 0x2665}, // heart\n\t{0x2351e945, 0x0a8a}, // uugujarati\n\t{0x2356706f, 0x0541}, // Jaarmenian\n\t{0x23679572, 0x1ef1}, // uhorndotbelow\n\t{0x236d79e4, 0x301e}, // quotedblprime\n\t{0x237979f3, 0xff73}, // ukatakanahalfwidth\n\t{0x23947e9f, 0x0266}, // hhook\n\t{0x23b6327c, 0x304f}, // kuhiragana\n\t{0x23b9408d, 0x2208}, // element\n\t{0x23d291f5, 0x0639}, // ainarabic\n\t{0x23d42e51, 0xff0b}, // plusmonospace\n\t{0x23e15f1c, 0xff90}, // mikatakanahalfwidth\n\t{0x23e70b3f, 0x0664}, // afii57396\n\t{0x23e9f46b, 0xff80}, // takatakanahalfwidth\n\t{0x23ea33c4, 0x30f1}, // wekatakana\n\t{0x23f0f542, 0xff2f}, // Omonospace\n\t{0x2415f58f, 0x3069}, // dohiragana\n\t{0x2419b09a, 0x038f}, // Omegatonos\n\t{0x241b0583, 0x0a9e}, // nyagujarati\n\t{0x241f6494, 0x3105}, // bbopomofo\n\t{0x2459d6f7, 0x0aea}, // fourgujarati\n\t{0x24688db0, 0x02c1}, // glottalstopreversedmod\n\t{0x24776c38, 0x0343}, // koroniscmb\n\t{0x2479e0d2, 0x3021}, // onehangzhou\n\t{0x249dd6ee, 0x0665}, // afii57397\n\t{0x24c0efcc, 0x316d}, // rieulyeorinhieuhkorean\n\t{0x24ccbd1b, 0x09e6}, // zerobengali\n\t{0x24d11d48, 0x02c2}, // arrowheadleftmod\n\t{0x24d6b19b, 0xfee7}, // nooninitialarabic\n\t{0x24deab24, 0x25a4}, // squarehorizontalfill\n\t{0x24e9b4e5, 0x21e4}, // arrowtableft\n\t{0x24f5be18, 0x0308}, // dieresiscmb\n\t{0x2527d2da, 0x300c}, // cornerbracketleft\n\t{0x252ef6ac, 0x01de}, // Adieresismacron\n\t{0x253f33be, 0x006e}, // n\n\t{0x2543ce81, 0x05c1}, // shindothebrew\n\t{0x254b8857, 0x0929}, // nnnadeva\n\t{0x25725d01, 0x0496}, // Zhedescendercyrillic\n\t{0x2592eb8c, 0x1e39}, // ldotbelowmacron\n\t{0x25a29a9e, 0x000a}, // controlLF\n\t{0x25bfabf1, 0x056c}, // liwnarmenian\n\t{0x25c22a8d, 0x0927}, // dhadeva\n\t{0x25c3f8ae, 0xff3e}, // asciicircummonospace\n\t{0x25ca4638, 0x0576}, // nowarmenian\n\t{0x25d83051, 0x0e19}, // nonuthai\n\t{0x25e64388, 0x1ee5}, // udotbelow\n\t{0x25eb8755, 0xff34}, // Tmonospace\n\t{0x25ef68be, 0x0103}, // abreve\n\t{0x25f0117e, 0x095f}, // yyadeva\n\t{0x2614c40e, 0x0aaf}, // yagujarati\n\t{0x262be20f, 0x0471}, // psicyrillic\n\t{0x2637caf5, 0x0932}, // ladeva\n\t{0x263e0b92, 0x09ac}, // babengali\n\t{0x2652690c, 0x3137}, // tikeutkorean\n\t{0x265be8ad, 0x01cf}, // Icaron\n\t{0x265fdad4, 0x05b8}, // qamatshebrew\n\t{0x26621b4d, 0x0072}, // r\n\t{0x2669a6cb, 0x211c}, // Rfraktur\n\t{0x26837556, 0x0048}, // H\n\t{0x26a72a71, 0x3188}, // yoyaekorean\n\t{0x26ab6d3a, 0x1ed9}, // ocircumflexdotbelow\n\t{0x26af8089, 0x304e}, // gihiragana\n\t{0x26b9c1d9, 0x0e30}, // saraathai\n\t{0x26c43ea8, 0x0911}, // ocandradeva\n\t{0x26caa803, 0x21d4}, // arrowdblboth\n\t{0x26cb382e, 0x23ab}, // bracerighttp\n\t{0x26f6f992, 0x04e4}, // Idieresiscyrillic\n\t{0x26fb496b, 0x3351}, // rittorusquare\n\t{0x27075678, 0x012e}, // Iogonek\n\t{0x2731451f, 0x0408}, // afii10057\n\t{0x273977ae, 0x0435}, // afii10070\n\t{0x27487450, 0x007e}, // asciitilde\n\t{0x275654ea, 0x099b}, // chabengali\n\t{0x275a3e46, 0x09a0}, // tthabengali\n\t{0x275a5b3b, 0x1ee1}, // ohorntilde\n\t{0x27607db6, 0x05b4}, // hiriq2d\n\t{0x27a2d18f, 0x05b9}, // holam32\n\t{0x27b7bf17, 0x031f}, // plusbelowcmb\n\t{0x27b7cc70, 0xfb2d}, // shindageshsindothebrew\n\t{0x27d62d65, 0x200d}, // afii301\n\t{0x27d8dd28, 0x00e8}, // egrave\n\t{0x27e6d9df, 0x0271}, // mhook\n\t{0x27f31ec3, 0x3271}, // rieulacirclekorean\n\t{0x283f3216, 0x2075}, // fivesuperior\n\t{0x28898020, 0x0281}, // Rsmallinverted\n\t{0x288edd59, 0x24cc}, // Wcircle\n\t{0x28d9fe2f, 0x0e41}, // saraaethai\n\t{0x28dd4931, 0x3234}, // ideographicnameparen\n\t{0x28e31924, 0x0a6c}, // sixgurmukhi\n\t{0x28e4057d, 0xfc58}, // yehmeemisolatedarabic\n\t{0x28f71acd, 0x0633}, // afii57427\n\t{0x290ed42e, 0x1e18}, // Ecircumflexbelow\n\t{0x29287ce1, 0x03d2}, // Upsilon1\n\t{0x29346ac3, 0x2021}, // daggerdbl\n\t{0x29371ded, 0x1e8f}, // ydotaccent\n\t{0x29734fd7, 0x092d}, // bhadeva\n\t{0x298e1b46, 0x01ea}, // Oogonek\n\t{0x29958ce9, 0x0005}, // controlENQ\n\t{0x29a8f130, 0x04d4}, // Aiecyrillic\n\t{0x29ab0eda, 0x0146}, // ncedilla\n\t{0x29c07bd0, 0x305e}, // zohiragana\n\t{0x29d0597d, 0x262f}, // yinyang\n\t{0x29d51dd2, 0x06d1}, // yehthreedotsbelowarabic\n\t{0x29d5f944, 0x03e4}, // Feicoptic\n\t{0x29e31b8f, 0x05b1}, // hatafsegolhebrew\n\t{0x29e6e487, 0x30cc}, // nukatakana\n\t{0x29e7f6bb, 0x0035}, // five\n\t{0x2a0fca4c, 0x3085}, // yusmallhiragana\n\t{0x2a239937, 0x0375}, // numeralsignlowergreek\n\t{0x2a28d54e, 0x30aa}, // okatakana\n\t{0x2a619f09, 0x2660}, // spade\n\t{0x2a645de3, 0x3091}, // wehiragana\n\t{0x2a64e363, 0x226e}, // notless\n\t{0x2a6a5dc5, 0x3088}, // yohiragana\n\t{0x2a72414c, 0x0e44}, // saraaimaimalaithai\n\t{0x2a8e7779, 0x0ad0}, // omgujarati\n\t{0x2ac0e180, 0x33a6}, // kmcubedsquare\n\t{0x2ac17d0f, 0x00f3}, // oacute\n\t{0x2ae749c7, 0x00e1}, // aacute\n\t{0x2ae8215f, 0x001d}, // controlGS\n\t{0x2ae8c5a6, 0x21c4}, // arrowrightoverleft\n\t{0x2aedcd2c, 0x09fa}, // issharbengali\n\t{0x2afb134c, 0xfb03}, // ffi\n\t{0x2b27655e, 0x261c}, // pointingindexleftwhite\n\t{0x2b3ff353, 0x2557}, // SF250000\n\t{0x2b42ad49, 0xfe55}, // colonsmall\n\t{0x2b5ac1a6, 0x0045}, // E\n\t{0x2b84f841, 0x30a6}, // ukatakana\n\t{0x2b91651d, 0x0319}, // righttackbelowcmb\n\t{0x2b93dd53, 0x0661}, // afii57393\n\t{0x2b9750e3, 0x2200}, // universal\n\t{0x2b9c968a, 0x0315}, // commaaboverightcmb\n\t{0x2bb5189c, 0x25e3}, // blacklowerlefttriangle\n\t{0x2bd253b1, 0x09bf}, // ivowelsignbengali\n\t{0x2be6415c, 0x05b3}, // hatafqamatshebrew\n\t{0x2beb7c62, 0x013c}, // lcommaaccent\n\t{0x2c0f9c0b, 0x0912}, // oshortdeva\n\t{0x2c15e9f4, 0x091c}, // jadeva\n\t{0x2c1b74f9, 0x2262}, // notidentical\n\t{0x2c4944e4, 0x0393}, // Gamma\n\t{0x2c91b61a, 0x0640}, // kashidaautonosidebearingarabic\n\t{0x2c964b66, 0x334a}, // miribaarusquare\n\t{0x2cb17e35, 0xfec6}, // zahfinalarabic\n\t{0x2cd9d9ec, 0xfc6d}, // behnoonfinalarabic\n\t{0x2cdfcd2a, 0x30cb}, // nikatakana\n\t{0x2cf9daf5, 0x3228}, // nineideographicparen\n\t{0x2d2e3883, 0x2190}, // arrowleft\n\t{0x2d329c65, 0xfb3c}, // lameddageshhebrew\n\t{0x2d39ea69, 0x019e}, // nlegrightlong\n\t{0x2d3b565d, 0x05ea}, // afii57690\n\t{0x2d456f79, 0x25e2}, // blacklowerrighttriangle\n\t{0x2d52bd2b, 0x3326}, // dorusquare\n\t{0x2d84140a, 0x0293}, // ezhcurl\n\t{0x2d8d5b1d, 0x33d0}, // lmsquare\n\t{0x2d95d169, 0x3155}, // yeokorean\n\t{0x2d975eca, 0xfb04}, // ffl\n\t{0x2d9ae85a, 0x0661}, // onehackarabic\n\t{0x2d9b14ff, 0xfb6d}, // vehmedialarabic\n\t{0x2da2ea79, 0x313d}, // rieulsioskorean\n\t{0x2daa1b6f, 0x090a}, // uudeva\n\t{0x2e04353d, 0x1ea9}, // acircumflexhookabove\n\t{0x2e043b05, 0xff0a}, // asteriskmonospace\n\t{0x2e10a2b1, 0x0374}, // numeralsigngreek\n\t{0x2e1eaa7d, 0xfb49}, // shindagesh\n\t{0x2e2c25c0, 0x0392}, // Beta\n\t{0x2e356485, 0x09c2}, // uuvowelsignbengali\n\t{0x2e4224af, 0x05e4}, // afii57684\n\t{0x2e5e0023, 0x0a20}, // tthagurmukhi\n\t{0x2e647759, 0x33d6}, // molsquare\n\t{0x2e7c6436, 0x3048}, // ehiragana\n\t{0x2e915a9d, 0xfe3b}, // blacklenticularbracketleftvertical\n\t{0x2e9e14a6, 0x0454}, // ecyrillic\n\t{0x2e9ef541, 0x0192}, // florin\n\t{0x2ea8b970, 0x327a}, // phieuphacirclekorean\n\t{0x2eb22aa1, 0x01dc}, // udieresisgrave\n\t{0x2eb3bdc7, 0x027e}, // rfishhook\n\t{0x2eb455b0, 0x25b6}, // blackrightpointingtriangle\n\t{0x2ec430ea, 0x0078}, // x\n\t{0x2ec8352a, 0x0143}, // Nacute\n\t{0x2eea1838, 0x0170}, // Uhungarumlaut\n\t{0x2efaa14d, 0x3015}, // tortoiseshellbracketright\n\t{0x2f06c380, 0x0a91}, // ocandragujarati\n\t{0x2f0e722f, 0x0021}, // exclam\n\t{0x2f14e4ad, 0x0183}, // btopbar\n\t{0x2f22b335, 0x305f}, // tahiragana\n\t{0x2f247a45, 0x00b5}, // mu\n\t{0x2f42e9c9, 0x0405}, // afii10054\n\t{0x2f4b01e9, 0x03e0}, // Sampigreek\n\t{0x2f51a2a5, 0x0591}, // etnahtahebrew\n\t{0x2f5af1cc, 0xfec4}, // tahmedialarabic\n\t{0x2f5c74c9, 0x30a4}, // ikatakana\n\t{0x2f5e2692, 0x033f}, // dbloverlinecmb\n\t{0x2f7e3ce0, 0xfb35}, // vavdagesh65\n\t{0x2f7fe7da, 0x04ea}, // Obarreddieresiscyrillic\n\t{0x2f8f84ed, 0x3019}, // whitetortoiseshellbracketright\n\t{0x2f9c7ff4, 0x221f}, // orthogonal\n\t{0x2fa13b0c, 0x0309}, // hookcmb\n\t{0x2fa6d960, 0x0e05}, // khokhonthai\n\t{0x2fb88e89, 0x0492}, // Ghestrokecyrillic\n\t{0x2fe066dc, 0x24c8}, // Scircle\n\t{0x2ff9eee3, 0x3231}, // ideographicstockparen\n\t{0x30132e73, 0x2474}, // oneparen\n\t{0x302d72c2, 0xfb2b}, // shinsindothebrew\n\t{0x3033e257, 0x0416}, // Zhecyrillic\n\t{0x3034a6d0, 0x0213}, // rinvertedbreve\n\t{0x3043436d, 0x0208}, // Idblgrave\n\t{0x3046485b, 0x0a41}, // umatragurmukhi\n\t{0x30585e10, 0x0631}, // reharabic\n\t{0x305b2089, 0x006d}, // m\n\t{0x305dc9d7, 0x2480}, // thirteenparen\n\t{0x3097f64c, 0x010c}, // Ccaron\n\t{0x30b4b18c, 0x0e28}, // sosalathai\n\t{0x30c0161e, 0x01d3}, // Ucaron\n\t{0x30c9bc6e, 0x0a1e}, // nyagurmukhi\n\t{0x30cd38cb, 0x33d8}, // pmsquare\n\t{0x30d25d42, 0x2089}, // nineinferior\n\t{0x30eada85, 0x2219}, // bulletoperator\n\t{0x30f64fef, 0x20aa}, // sheqelhebrew\n\t{0x310a4774, 0x337f}, // corporationsquare\n\t{0x31158bc3, 0x339f}, // mmsquaredsquare\n\t{0x3116a838, 0x0647}, // heharabic\n\t{0x312db4ff, 0x2040}, // tie\n\t{0x313237dd, 0xff32}, // Rmonospace\n\t{0x313f3c20, 0x09df}, // yyabengali\n\t{0x3154a912, 0x04ab}, // esdescendercyrillic\n\t{0x31f1489a, 0x0643}, // afii57443\n\t{0x31f928de, 0x05df}, // finalnun\n\t{0x31fab77d, 0x1eea}, // Uhorngrave\n\t{0x3207407e, 0x046b}, // yusbigcyrillic\n\t{0x3238fa28, 0x3004}, // jis\n\t{0x323ea229, 0x33ac}, // gpasquare\n\t{0x324496b3, 0x33bf}, // mwmegasquare\n\t{0x3248fa12, 0xfe5e}, // tortoiseshellbracketrightsmall\n\t{0x324bc39e, 0x22da}, // lessequalorgreater\n\t{0x3266451e, 0x30f2}, // wokatakana\n\t{0x326ca1fd, 0x013f}, // Ldot\n\t{0x32930f95, 0x046f}, // ksicyrillic\n\t{0x329a975f, 0x0a0a}, // uugurmukhi\n\t{0x329ed55c, 0x04e1}, // dzeabkhasiancyrillic\n\t{0x32d855b8, 0x0ae9}, // threegujarati\n\t{0x32e77f07, 0x22c2}, // intersectiontext\n\t{0x32fd46a7, 0x041e}, // afii10032\n\t{0x32fe41c6, 0x0667}, // afii57399\n\t{0x330263f2, 0x3136}, // nieunhieuhkorean\n\t{0x3303dbcb, 0x04b2}, // Hadescendercyrillic\n\t{0x33042de7, 0x1e90}, // Zcircumflex\n\t{0x335e3259, 0x3022}, // twohangzhou\n\t{0x336106b8, 0x05d7}, // afii57671\n\t{0x33821f87, 0x05e2}, // ayinhebrew\n\t{0x33849fcd, 0x304d}, // kihiragana\n\t{0x339cb29c, 0x03cb}, // upsilondieresis\n\t{0x339dfd30, 0x2200}, // forall\n\t{0x33a4598f, 0x0e10}, // thothanthai\n\t{0x33dd39ff, 0x0437}, // zecyrillic\n\t{0x33ea63c8, 0x24df}, // pcircle\n\t{0x33f59002, 0x0285}, // eshsquatreversed\n\t{0x340746a2, 0xff4a}, // jmonospace\n\t{0x3425ba3a, 0x056d}, // xeharmenian\n\t{0x342d52b5, 0x25cb}, // whitecircle\n\t{0x34399add, 0x0034}, // four\n\t{0x343b0ff5, 0x1e8b}, // xdotaccent\n\t{0x343f59f3, 0x0437}, // afii10073\n\t{0x344b950b, 0x031d}, // uptackbelowcmb\n\t{0x34515ec0, 0x01ca}, // NJ\n\t{0x345791f2, 0x027c}, // rlongleg\n\t{0x346086da, 0x2286}, // reflexsubset\n\t{0x3463147c, 0x1e69}, // sdotbelowdotaccent\n\t{0x3490ad97, 0x047a}, // Omegaroundcyrillic\n\t{0x34a7b989, 0x006f}, // o\n\t{0x34a88183, 0x2640}, // female\n\t{0x34b5f401, 0x016a}, // Umacron\n\t{0x34bab99c, 0x24e0}, // qcircle\n\t{0x34c88fb4, 0x2312}, // arc\n\t{0x34c908a5, 0x1eb4}, // Abrevetilde\n\t{0x34df3d1c, 0x00a1}, // exclamdown\n\t{0x34e969fb, 0x05a0}, // telishagedolahebrew\n\t{0x34f9cd37, 0x010b}, // cdot\n\t{0x35188ac4, 0xfeac}, // thalfinalarabic\n\t{0x351bf85e, 0x0257}, // dhook\n\t{0x351e7136, 0x0482}, // thousandcyrillic\n\t{0x352bce90, 0x00a3}, // sterling\n\t{0x35378756, 0x2591}, // shadelight\n\t{0x35440d94, 0x040c}, // Kjecyrillic\n\t{0x354dad21, 0x0129}, // itilde\n\t{0x35514624, 0x00d6}, // Odieresis\n\t{0x3596098d, 0xfb9f}, // noonghunnafinalarabic\n\t{0x359e9c03, 0x0418}, // Iicyrillic\n\t{0x359f6846, 0x1ebc}, // Etilde\n\t{0x35a9ba78, 0x0a95}, // kagujarati\n\t{0x35b65af3, 0x33af}, // radoverssquaredsquare\n\t{0x35ce2a2d, 0x066a}, // afii57381\n\t{0x35ddec6f, 0x00eb}, // edieresis\n\t{0x35e5fe3b, 0x3118}, // cbopomofo\n\t{0x3613bad2, 0x011b}, // ecaron\n\t{0x361cb4c9, 0xfb6b}, // vehfinalarabic\n\t{0x361e70b8, 0x0043}, // C\n\t{0x362459fb, 0xfe97}, // tehinitialarabic\n\t{0x362c9d3a, 0x02b0}, // hsuperior\n\t{0x36678fdf, 0x2326}, // deleteright\n\t{0x3676afc0, 0x0ac9}, // ocandravowelsigngujarati\n\t{0x368bf72e, 0x0038}, // eight\n\t{0x36aaad0e, 0x307b}, // hohiragana\n\t{0x36d3bc14, 0x0491}, // afii10098\n\t{0x36d54fb7, 0x015a}, // Sacute\n\t{0x37117bac, 0x059b}, // tevirlefthebrew\n\t{0x372986de, 0x05f3}, // gereshhebrew\n\t{0x373e5e3f, 0xff27}, // Gmonospace\n\t{0x37866f5c, 0x00df}, // germandbls\n\t{0x37a73b5a, 0xfee0}, // lammedialarabic\n\t{0x37a77cc1, 0x030b}, // hungarumlautcmb\n\t{0x37b36429, 0xff68}, // ismallkatakanahalfwidth\n\t{0x37b7557e, 0x001c}, // controlFS\n\t{0x37c2175b, 0xfcca}, // lamhahinitialarabic\n\t{0x37c23820, 0x24c5}, // Pcircle\n\t{0x37d669b4, 0x090e}, // eshortdeva\n\t{0x37e460db, 0x308d}, // rohiragana\n\t{0x37e5061e, 0x04a3}, // endescendercyrillic\n\t{0x37f67ca7, 0x029a}, // eopenclosed\n\t{0x381040c4, 0x310d}, // gbopomofo\n\t{0x381640e0, 0xffe3}, // macronmonospace\n\t{0x381c7e4d, 0x1ece}, // Ohookabove\n\t{0x38201bde, 0x0961}, // llvocalicdeva\n\t{0x38291591, 0x0e2e}, // honokhukthai\n\t{0x3839681b, 0x3055}, // sahiragana\n\t{0x3863c9a6, 0x208e}, // parenrightinferior\n\t{0x386cda71, 0x01f0}, // jcaron\n\t{0x38746563, 0x01b0}, // uhorn\n\t{0x38880d1d, 0x0198}, // Khook\n\t{0x38885f68, 0x091d}, // jhadeva\n\t{0x388ccfdd, 0x30e3}, // yasmallkatakana\n\t{0x3896be1c, 0x0025}, // percent\n\t{0x38a80af1, 0x306d}, // nehiragana\n\t{0x38bcbef5, 0x05b7}, // afii57798\n\t{0x38bebcf5, 0x2552}, // SF510000\n\t{0x38ce8c39, 0x059a}, // yetivhebrew\n\t{0x38cea50a, 0x24d6}, // gcircle\n\t{0x38d9b559, 0x3003}, // dittomark\n\t{0x38de4662, 0x1e7c}, // Vtilde\n\t{0x38e73ed2, 0x01c0}, // clickdental\n\t{0x38efc9e4, 0x04a6}, // Pemiddlehookcyrillic\n\t{0x391e728b, 0x099a}, // cabengali\n\t{0x392c00af, 0x3305}, // intisquare\n\t{0x3934b5de, 0x0e43}, // saraaimaimuanthai\n\t{0x3946429a, 0x3010}, // blacklenticularbracketleft\n\t{0x396642a3, 0x322d}, // ideographicwoodparen\n\t{0x396b44dd, 0x0a3c}, // nuktagurmukhi\n\t{0x396d8b52, 0x0930}, // radeva\n\t{0x3989511a, 0xfc5e}, // shaddadammatanarabic\n\t{0x39918d40, 0x30b6}, // zakatakana\n\t{0x399ac15a, 0x0283}, // esh\n\t{0x39aa6d90, 0x0a83}, // visargagujarati\n\t{0x39b06752, 0x004a}, // J\n\t{0x39d0b19b, 0x00ae}, // registered\n\t{0x39d5a1b1, 0x019c}, // Mturned\n\t{0x39e226d5, 0x05e3}, // afii57683\n\t{0x39f864d5, 0x2462}, // threecircle\n\t{0x39fd88e8, 0x05a8}, // qadmahebrew\n\t{0x3a029acd, 0x338e}, // squaremg\n\t{0x3a0e66b8, 0x1ee6}, // Uhookabove\n\t{0x3a1089b2, 0x0073}, // s\n\t{0x3a3b69ae, 0x317c}, // siostikeutkorean\n\t{0x3a3c0e00, 0xff9d}, // nkatakanahalfwidth\n\t{0x3a40856d, 0x25a0}, // blacksquare\n\t{0x3a7498f3, 0x05e2}, // ayin\n\t{0x3a777405, 0x0945}, // ecandravowelsigndeva\n\t{0x3a846086, 0xff9c}, // wakatakanahalfwidth\n\t{0x3aa3cfcb, 0x0960}, // rrvocalicdeva\n\t{0x3ab26d21, 0x062f}, // dalarabic\n\t{0x3ade6670, 0x0440}, // afii10082\n\t{0x3afe4407, 0x25a9}, // squarediagonalcrosshatchfill\n\t{0x3b0367b4, 0x0a6b}, // fivegurmukhi\n\t{0x3b43910b, 0x0e36}, // sarauethai\n\t{0x3b4774fb, 0xfb35}, // vavdageshhebrew\n\t{0x3b6394a8, 0x30e0}, // mukatakana\n\t{0x3b722aff, 0x02bf}, // ringhalfleft\n\t{0x3b86faf7, 0x1e31}, // kacute\n\t{0x3b8c9510, 0x0926}, // dadeva\n\t{0x3b8f536a, 0x0564}, // daarmenian\n\t{0x3b919910, 0x02b4}, // rturnedsuperior\n\t{0x3b92b9ea, 0x1e4b}, // ncircumflexbelow\n\t{0x3b9a0136, 0x2468}, // ninecircle\n\t{0x3b9a26e8, 0x0637}, // taharabic\n\t{0x3bf4dcc7, 0xfea3}, // hahinitialarabic\n\t{0x3bf5a3f3, 0x301d}, // quotedblprimereversed\n\t{0x3c2679f3, 0x25c3}, // whiteleftpointingsmalltriangle\n\t{0x3c4101c7, 0x0a2b}, // phagurmukhi\n\t{0x3c47c401, 0x0196}, // Iotaafrican\n\t{0x3c5c7654, 0x0910}, // aideva\n\t{0x3c6261b4, 0x322e}, // ideographicmetalparen\n\t{0x3c6e58f4, 0x05d5}, // vavhebrew\n\t{0x3c89c6b7, 0x2192}, // arrowright\n\t{0x3c9425ca, 0x0666}, // sixhackarabic\n\t{0x3c9b6897, 0xff0e}, // periodmonospace\n\t{0x3ca31461, 0x01d1}, // Ocaron\n\t{0x3ca4227b, 0x0120}, // Gdot\n\t{0x3ca9c5ab, 0x0345}, // ypogegrammenigreekcmb\n\t{0x3cb5e1bf, 0x3146}, // ssangsioskorean\n\t{0x3cb6098f, 0x25b9}, // whiterightpointingsmalltriangle\n\t{0x3ccd3832, 0xfc60}, // shaddafathaarabic\n\t{0x3cfd6c60, 0x305a}, // zuhiragana\n\t{0x3cfe2d05, 0x018f}, // Schwa\n\t{0x3d0581a8, 0x313c}, // rieulpieupkorean\n\t{0x3d200141, 0x30c9}, // dokatakana\n\t{0x3d25bc32, 0x2116}, // numero\n\t{0x3d292466, 0x05b1}, // hatafsegol17\n\t{0x3d30abad, 0x0279}, // rturned\n\t{0x3d3a35a3, 0x0252}, // ascriptturned\n\t{0x3d3c2f4b, 0x309d}, // iterationhiragana\n\t{0x3d44ad12, 0x3210}, // tikeutaparenkorean\n\t{0x3d4a2f11, 0x0187}, // Chook\n\t{0x3d50ceda, 0x21a8}, // arrowupdnbse\n\t{0x3d59a63c, 0x30e2}, // mokatakana\n\t{0x3d6d45f8, 0x0688}, // ddalarabic\n\t{0x3d794ead, 0x04c8}, // enhookcyrillic\n\t{0x3d888246, 0x300d}, // cornerbracketright\n\t{0x3d93ad95, 0x0171}, // uhungarumlaut\n\t{0x3d987773, 0x03c6}, // phi\n\t{0x3da1e076, 0xfb2a}, // shinshindot\n\t{0x3da24bf2, 0x004d}, // M\n\t{0x3da45134, 0xff3d}, // bracketrightmonospace\n\t{0x3dac6cb7, 0x212e}, // estimated\n\t{0x3db24f7f, 0x04eb}, // obarreddieresiscyrillic\n\t{0x3ddbfa17, 0xfe64}, // lesssmall\n\t{0x3de84dee, 0x3387}, // GBsquare\n\t{0x3de8cd4d, 0x02c9}, // firsttonechinese\n\t{0x3deb36dc, 0x0570}, // hoarmenian\n\t{0x3e08b864, 0x1e1c}, // Ecedillabreve\n\t{0x3e2966c3, 0x25a7}, // squareupperlefttolowerrightfill\n\t{0x3e2ad069, 0x0125}, // hcircumflex\n\t{0x3e2b18e7, 0x05d2}, // gimelhebrew\n\t{0x3e2ddf1a, 0x00fb}, // ucircumflex\n\t{0x3e4b0d7f, 0x2478}, // fiveparen\n\t{0x3e5c6b2e, 0x2086}, // sixinferior\n\t{0x3e78c213, 0x03f3}, // yotgreek\n\t{0x3e7bef16, 0x063a}, // ghainarabic\n\t{0x3e9c0cab, 0x0e0d}, // yoyingthai\n\t{0x3ea9e6c5, 0x044e}, // afii10096\n\t{0x3ec30c4d, 0x0168}, // Utilde\n\t{0x3ed6d505, 0x3108}, // fbopomofo\n\t{0x3edc9801, 0x031e}, // downtackbelowcmb\n\t{0x3edf2653, 0x04ba}, // Shhacyrillic\n\t{0x3edfbd48, 0x0959}, // khhadeva\n\t{0x3ee5a28f, 0x0342}, // perispomenigreekcmb\n\t{0x3ef2c5ca, 0x05df}, // finalnunhebrew\n\t{0x3efcef55, 0x09a7}, // dhabengali\n\t{0x3f19d4d4, 0x30e5}, // yusmallkatakana\n\t{0x3f35ecb4, 0x0a0f}, // eegurmukhi\n\t{0x3f36dce9, 0x061b}, // afii57403\n\t{0x3f5ead94, 0x0456}, // icyrillic\n\t{0x3f61f37a, 0x1ea3}, // ahookabove\n\t{0x3f76f3d1, 0x0214}, // Udblgrave\n\t{0x3f817391, 0x314b}, // khieukhkorean\n\t{0x3f8b0c34, 0x30c7}, // dekatakana\n\t{0x3fa4349b, 0x0e1d}, // fofathai\n\t{0x3fa5f151, 0x03de}, // Koppagreek\n\t{0x3fbf7ccb, 0x01ae}, // Tretroflexhook\n\t{0x3fddfa91, 0x22ce}, // curlyor\n\t{0x3fe060fb, 0x0147}, // Ncaron\n\t{0x3fe534eb, 0x0e12}, // thophuthaothai\n\t{0x4016947c, 0x246b}, // twelvecircle\n\t{0x401a74d3, 0x06f3}, // threepersian\n\t{0x40663d0c, 0xfeb2}, // seenfinalarabic\n\t{0x4069b3b1, 0x24ab}, // pparen\n\t{0x407a7b83, 0x0531}, // Aybarmenian\n\t{0x407de2ef, 0x06d5}, // afii57534\n\t{0x40882350, 0x0305}, // overlinecmb\n\t{0x4096d7d2, 0x006a}, // j\n\t{0x409d1b5a, 0xff97}, // rakatakanahalfwidth\n\t{0x40b0365e, 0x092f}, // yadeva\n\t{0x40e21552, 0x30de}, // makatakana\n\t{0x40eb54f4, 0x046d}, // yusbigiotifiedcyrillic\n\t{0x413f6e7c, 0x05b4}, // hiriq21\n\t{0x4144d56c, 0x016d}, // ubreve\n\t{0x414507c4, 0x05b9}, // holamnarrowhebrew\n\t{0x414a0074, 0x3336}, // hekutaarusquare\n\t{0x4156a20e, 0xfb06}, // s_t\n\t{0x4156eb7c, 0x3123}, // enbopomofo\n\t{0x415d9061, 0xff42}, // bmonospace\n\t{0x415fae27, 0x0398}, // Theta\n\t{0x4161c806, 0x09e1}, // llvocalicbengali\n\t{0x416a2ede, 0x0e04}, // khokhwaithai\n\t{0x4178dd24, 0x2243}, // asymptoticallyequal\n\t{0x41a22b2c, 0x007c}, // bar\n\t{0x41a40813, 0xff2d}, // Mmonospace\n\t{0x41a4780c, 0x0472}, // afii10147\n\t{0x41c544c2, 0x1ee7}, // uhookabove\n\t{0x41c76cd5, 0x05d7}, // het\n\t{0x41cb5b30, 0x02db}, // ogonek\n\t{0x41da6e39, 0x098c}, // lvocalicbengali\n\t{0x41e154b7, 0x1edd}, // ohorngrave\n\t{0x41e44ef7, 0x0aaa}, // pagujarati\n\t{0x41efdfc2, 0x33c1}, // mohmsquare\n\t{0x42320627, 0x2495}, // fourteenperiod\n\t{0x4235d221, 0xfecf}, // ghaininitialarabic\n\t{0x423f9221, 0x05a7}, // dargahebrew\n\t{0x4247685c, 0x01ff}, // oslashacute\n\t{0x4252dd77, 0x02c7}, // caron\n\t{0x42716524, 0x0069}, // i\n\t{0x42737aaf, 0x3081}, // mehiragana\n\t{0x427d3f50, 0x04a9}, // haabkhasiancyrillic\n\t{0x42803db2, 0x0030}, // zero\n\t{0x42813ae4, 0x1e24}, // Hdotbelow\n\t{0x428fedda, 0xfb44}, // pedagesh\n\t{0x42bba9f5, 0x30f0}, // wikatakana\n\t{0x42bc1b07, 0x25c4}, // triaglf\n\t{0x42bed72c, 0x33c0}, // kohmsquare\n\t{0x42bf360e, 0x1e6e}, // Tlinebelow\n\t{0x42d74152, 0x0578}, // voarmenian\n\t{0x42e554b2, 0x013b}, // Lcedilla\n\t{0x42ed7ca6, 0x0698}, // jeharabic\n\t{0x42f02b62, 0xfb95}, // gafmedialarabic\n\t{0x42f35290, 0x0064}, // d\n\t{0x42fb2842, 0x3120}, // aubopomofo\n\t{0x42fc57be, 0x3110}, // jbopomofo\n\t{0x42fd43ba, 0x044c}, // afii10094\n\t{0x42fdb31a, 0x0070}, // p\n\t{0x4305bc9e, 0x0920}, // tthadeva\n\t{0x4306eed3, 0x015d}, // scircumflex\n\t{0x430c20fb, 0x215e}, // seveneighths\n\t{0x430ddad4, 0xff20}, // atmonospace\n\t{0x431e0706, 0x00dc}, // Udieresis\n\t{0x43221a39, 0x1e91}, // zcircumflex\n\t{0x4328cb01, 0x339d}, // squarecm\n\t{0x432e75ab, 0x055d}, // commaarmenian\n\t{0x43399322, 0x026c}, // lbelt\n\t{0x434b10a7, 0x0a86}, // aagujarati\n\t{0x435f906e, 0xfb3e}, // memdageshhebrew\n\t{0x436008b6, 0x3064}, // tuhiragana\n\t{0x436f4b68, 0xfeaa}, // dalfinalarabic\n\t{0x439bf74d, 0xff8b}, // hikatakanahalfwidth\n\t{0x43a7e4d1, 0x0635}, // afii57429\n\t{0x43d0d1da, 0x0627}, // afii57415\n\t{0x43d651b4, 0x2663}, // clubsuitblack\n\t{0x43d755d6, 0x2212}, // minus\n\t{0x43dfb761, 0x0592}, // segoltahebrew\n\t{0x4405f04b, 0x05be}, // afii57645\n\t{0x4425746a, 0x0a18}, // ghagurmukhi\n\t{0x44317cf4, 0x2662}, // diamondsuitwhite\n\t{0x443620cd, 0x00fe}, // thorn\n\t{0x444b0abf, 0x0467}, // yuslittlecyrillic\n\t{0x444f60e7, 0x007f}, // controlDEL\n\t{0x445a3b6e, 0x0447}, // afii10089\n\t{0x4461957b, 0x041c}, // Emcyrillic\n\t{0x4464a19f, 0x0acb}, // ovowelsigngujarati\n\t{0x4483f355, 0x300f}, // whitecornerbracketright\n\t{0x4487c491, 0x3342}, // hoonsquare\n\t{0x4492e703, 0x0624}, // afii57412\n\t{0x44979567, 0x0a25}, // thagurmukhi\n\t{0x449b4678, 0xfec3}, // tahinitialarabic\n\t{0x44a78c72, 0x1eef}, // uhorntilde\n\t{0x44b414b4, 0xff0c}, // commamonospace\n\t{0x44d687fa, 0x1e06}, // Blinebelow\n\t{0x45116064, 0x2592}, // shade\n\t{0x453aa0af, 0x09f0}, // ramiddlediagonalbengali\n\t{0x4546a724, 0x05d0}, // afii57664\n\t{0x454cef44, 0x2642}, // mars\n\t{0x455bcfc1, 0x041d}, // afii10031\n\t{0x457de97e, 0x3184}, // kapyeounphieuphkorean\n\t{0x457e9e97, 0x1ee8}, // Uhornacute\n\t{0x459f0c78, 0x23a7}, // bracelefttp\n\t{0x45b3d9fd, 0x0a22}, // ddhagurmukhi\n\t{0x45b6c88f, 0x029b}, // Gsmallhook\n\t{0x45b98e95, 0x2163}, // Fourroman\n\t{0x45c29649, 0x1ef4}, // Ydotbelow\n\t{0x45c5ae6b, 0x0165}, // tcaron\n\t{0x45d73e08, 0x0a09}, // ugurmukhi\n\t{0x45e50e5b, 0x0384}, // tonos\n\t{0x45f6e82c, 0x057f}, // tiwnarmenian\n\t{0x45f7d5e0, 0x2084}, // fourinferior\n\t{0x46038ece, 0x00b6}, // paragraph\n\t{0x460c35ae, 0x05b8}, // qamats10\n\t{0x460ca9f0, 0x30e8}, // yokatakana\n\t{0x4611c6d0, 0x000b}, // controlVT\n\t{0x461bc854, 0x0194}, // Gammaafrican\n\t{0x46271982, 0x23ac}, // bracerightmid\n\t{0x4652be4f, 0x1e6d}, // tdotbelow\n\t{0x46541398, 0x0111}, // dmacron\n\t{0x465ea2f8, 0x3202}, // tikeutparenkorean\n\t{0x46611d40, 0x05bb}, // qubuts31\n\t{0x466452b7, 0x321b}, // hieuhaparenkorean\n\t{0x467a9a55, 0x055b}, // emphasismarkarmenian\n\t{0x46ab407a, 0x322b}, // ideographicfireparen\n\t{0x46ab921d, 0x3076}, // buhiragana\n\t{0x46ba3911, 0x1e45}, // ndotaccent\n\t{0x46bce40e, 0xfb4f}, // aleflamedhebrew\n\t{0x46c4dd5b, 0x0433}, // afii10068\n\t{0x46ca3a49, 0x2791}, // eightcircleinversesansserif\n\t{0x46e3006c, 0x055c}, // exclamarmenian\n\t{0x46f10ed2, 0x222a}, // union\n\t{0x46f3948a, 0x05d1}, // bethebrew\n\t{0x46f5f918, 0x05c3}, // afii57658\n\t{0x46f9c8ca, 0x2195}, // arrowupdn\n\t{0x470d662e, 0x042e}, // IUcyrillic\n\t{0x470da4b8, 0x0453}, // gjecyrillic\n\t{0x471d219d, 0x00f4}, // ocircumflex\n\t{0x472c971d, 0x1e4d}, // otildeacute\n\t{0x47542f2d, 0x0107}, // cacute\n\t{0x47849b51, 0x05e5}, // finaltsadi\n\t{0x478eb915, 0x014f}, // obreve\n\t{0x47b12f1d, 0x3009}, // anglebracketright\n\t{0x47b78334, 0x09a5}, // thabengali\n\t{0x47ee62a0, 0x04f1}, // udieresiscyrillic\n\t{0x480265ce, 0x06f2}, // twopersian\n\t{0x48175191, 0x0130}, // Idotaccent\n\t{0x481e50de, 0xfb32}, // gimeldagesh\n\t{0x4825c60d, 0x02c3}, // arrowheadrightmod\n\t{0x482626d7, 0x09ee}, // eightbengali\n\t{0x4826d3e4, 0x3391}, // khzsquare\n\t{0x48270352, 0x1e42}, // Mdotbelow\n\t{0x4848966d, 0x05b2}, // hatafpatah\n\t{0x485d5052, 0x057d}, // seharmenian\n\t{0x48908e05, 0xff28}, // Hmonospace\n\t{0x48a3aad1, 0x1ec8}, // Ihookabove\n\t{0x48adcc47, 0x0160}, // Scaron\n\t{0x48b11825, 0x1e3f}, // macute\n\t{0x48b31eb3, 0x02a3}, // dzaltone\n\t{0x48bbab6b, 0x1e68}, // Sdotbelowdotaccent\n\t{0x48d0cd97, 0x0460}, // Omegacyrillic\n\t{0x48ed1289, 0x3180}, // ssangieungkorean\n\t{0x48f1ea86, 0x007c}, // verticalbar\n\t{0x49188fb6, 0x261d}, // pointingindexupwhite\n\t{0x491e8c30, 0x2562}, // SF200000\n\t{0x4928f75b, 0x1e3d}, // lcircumflexbelow\n\t{0x49299271, 0x1eee}, // Uhorntilde\n\t{0x49314f7c, 0x1e96}, // hlinebelow\n\t{0x493c6957, 0x01ec}, // Oogonekmacron\n\t{0x497b2a29, 0x03c8}, // psi\n\t{0x49877605, 0x1ecf}, // ohookabove\n\t{0x49a6c904, 0x00d5}, // Otilde\n\t{0x49a8fbe4, 0x227a}, // precedes\n\t{0x49b28bf6, 0x011f}, // gbreve\n\t{0x49c941c8, 0x0630}, // thalarabic\n\t{0x49cf949f, 0x0011}, // controlDC1\n\t{0x49d53679, 0x053e}, // Caarmenian\n\t{0x49e41b40, 0x0117}, // edotaccent\n\t{0x4a059748, 0x2329}, // angleleft\n\t{0x4a0a939e, 0x02dc}, // ilde\n\t{0x4a0dc7cd, 0x0273}, // nhookretroflex\n\t{0x4a1b8688, 0x0a8f}, // egujarati\n\t{0x4a67a4cd, 0x33c6}, // coverkgsquare\n\t{0x4a6dc3e0, 0x017c}, // zdotaccent\n\t{0x4a8f25d9, 0x0134}, // Jcircumflex\n\t{0x4a911686, 0x042a}, // Hardsigncyrillic\n\t{0x4aa9a643, 0x220c}, // notcontains\n\t{0x4ab871b2, 0x05a9}, // telishaqetanahebrew\n\t{0x4ad4b644, 0x066c}, // thousandsseparatorpersian\n\t{0x4adaae02, 0x30bc}, // zekatakana\n\t{0x4b13bfc7, 0x261f}, // pointingindexdownwhite\n\t{0x4b146e46, 0x0076}, // v\n\t{0x4b1cfc1b, 0x0052}, // R\n\t{0x4b69c8eb, 0x3200}, // kiyeokparenkorean\n\t{0x4b7a4380, 0x326b}, // thieuthcirclekorean\n\t{0x4b8cb1d3, 0x315a}, // oekorean\n\t{0x4b904ad7, 0x09ec}, // sixbengali\n\t{0x4bc3db0d, 0xfe8e}, // aleffinalarabic\n\t{0x4bcb1484, 0x0997}, // gabengali\n\t{0x4bf3941c, 0x04e7}, // odieresiscyrillic\n\t{0x4c1231bd, 0xfebe}, // dadfinalarabic\n\t{0x4c224e3d, 0x0216}, // Uinvertedbreve\n\t{0x4c31d446, 0x05b6}, // segolwidehebrew\n\t{0x4c330dc7, 0x2303}, // control\n\t{0x4c539c26, 0xff45}, // emonospace\n\t{0x4c550d84, 0x0286}, // eshcurl\n\t{0x4c63022b, 0x00ac}, // logicalnot\n\t{0x4c636f96, 0xfe4c}, // overlinedblwavy\n\t{0x4ca2293a, 0x0549}, // Chaarmenian\n\t{0x4ca721bb, 0x24d9}, // jcircle\n\t{0x4cbb6976, 0x054c}, // Raarmenian\n\t{0x4cc2766b, 0x0474}, // Izhitsacyrillic\n\t{0x4ccaa98f, 0x0292}, // ezh\n\t{0x4cda32dd, 0x2592}, // shademedium\n\t{0x4cf1d7c1, 0xfb2c}, // shindageshshindot\n\t{0x4d08f8de, 0x278c}, // threecircleinversesansserif\n\t{0x4d18f1c3, 0x01e5}, // gstroke\n\t{0x4d3fee14, 0x2207}, // gradient\n\t{0x4d5e2eea, 0x09c7}, // evowelsignbengali\n\t{0x4d66ad61, 0x0259}, // schwa\n\t{0x4d6f0f44, 0x03b6}, // zeta\n\t{0x4d76cbca, 0x0939}, // hadeva\n\t{0x4da2ea17, 0x30f7}, // vakatakana\n\t{0x4dad3b1f, 0xff47}, // gmonospace\n\t{0x4db4092d, 0x05b2}, // hatafpatahquarterhebrew\n\t{0x4dc635ef, 0x03c2}, // sigmafinal\n\t{0x4dd49001, 0x04ae}, // Ustraightcyrillic\n\t{0x4dd4e51e, 0x05e3}, // finalpe\n\t{0x4ddb0ff8, 0x3014}, // tortoiseshellbracketleft\n\t{0x4ddbe970, 0x0054}, // T\n\t{0x4ddd9ef4, 0x3296}, // ideographicfinancialcircle\n\t{0x4dedf33d, 0xff8d}, // hekatakanahalfwidth\n\t{0x4def9c7c, 0x2327}, // clear\n\t{0x4dfb4b2a, 0x247b}, // eightparen\n\t{0x4e03617a, 0x0ac1}, // uvowelsigngujarati\n\t{0x4e0fdced, 0x0a2d}, // bhagurmukhi\n\t{0x4e1cdd9c, 0x247d}, // tenparen\n\t{0x4e63a83b, 0x0642}, // qafarabic\n\t{0x4e7d8096, 0xff53}, // smonospace\n\t{0x4e8356bc, 0x0108}, // Ccircumflex\n\t{0x4eb853e7, 0x3384}, // kasquare\n\t{0x4ec3d2dc, 0xfccb}, // lamkhahinitialarabic\n\t{0x4ec752cf, 0x2022}, // bullet\n\t{0x4ef94777, 0x323b}, // ideographicstudyparen\n\t{0x4efcaf3c, 0x01ff}, // ostrokeacute\n\t{0x4f1d81af, 0x05bb}, // qubuts\n\t{0x4f1d9a74, 0x1e15}, // emacrongrave\n\t{0x4f1fbad2, 0x33b2}, // mussquare\n\t{0x4f238367, 0x0270}, // mlonglegturned\n\t{0x4f23d8fd, 0xfeda}, // kaffinalarabic\n\t{0x4f2d09de, 0x0662}, // twohackarabic\n\t{0x4f2efda5, 0xff07}, // quotesinglemonospace\n\t{0x4f30c414, 0x01c6}, // dzcaron\n\t{0x4f4be9c8, 0x3129}, // iubopomofo\n\t{0x4f6c2078, 0x00e5}, // aring\n\t{0x4f9b207b, 0x06c1}, // hehaltonearabic\n\t{0x4f9deafc, 0x03c4}, // tau\n\t{0x4fb92256, 0x216b}, // Twelveroman\n\t{0x4fdd1a2b, 0x300a}, // dblanglebracketleft\n\t{0x4feaecfe, 0x22c3}, // uniontext\n\t{0x5004c9ab, 0x09ed}, // sevenbengali\n\t{0x50166be8, 0x049a}, // Kadescendercyrillic\n\t{0x501dd48e, 0x2229}, // intersection\n\t{0x5024fa7b, 0x260f}, // whitetelephone\n\t{0x502bdceb, 0x3290}, // ideographsuncircle\n\t{0x503133b5, 0x0009}, // controlHT\n\t{0x507713d7, 0x2a02}, // circlemultiplytext\n\t{0x50794cf3, 0x255d}, // SF260000\n\t{0x508090a0, 0xff82}, // tukatakanahalfwidth\n\t{0x50993bc3, 0x05dd}, // finalmemhebrew\n\t{0x509ec6af, 0x0490}, // Gheupturncyrillic\n\t{0x50a87245, 0x05b9}, // holamwidehebrew\n\t{0x50be3a5b, 0x3189}, // yoikorean\n\t{0x50cc5524, 0x00be}, // threequarters\n\t{0x50cc8cef, 0x24a3}, // hparen\n\t{0x50fb6106, 0x30c1}, // tikatakana\n\t{0x510f444c, 0x0662}, // afii57394\n\t{0x511118c0, 0x05b8}, // qamatsqatanquarterhebrew\n\t{0x51250a43, 0x0ab9}, // hagujarati\n\t{0x5125d1fa, 0x25a1}, // whitesquare\n\t{0x513a52c9, 0x2510}, // SF030000\n\t{0x51439af3, 0x064e}, // afii57454\n\t{0x5147986a, 0xff5b}, // braceleftmonospace\n\t{0x514d7298, 0x3238}, // ideographiclaborparen\n\t{0x515692ea, 0x0414}, // Decyrillic\n\t{0x51616742, 0x328c}, // ideographwatercircle\n\t{0x51817d65, 0xfca1}, // tehjeeminitialarabic\n\t{0x51969939, 0x03ba}, // kappa\n\t{0x51ca7ab6, 0x00f6}, // odieresis\n\t{0x51cbc424, 0x014d}, // omacron\n\t{0x51d34569, 0x00e9}, // eacute\n\t{0x51e6847c, 0x05b2}, // hatafpatah16\n\t{0x51ed3cb2, 0x00af}, // macron\n\t{0x51f006ea, 0x24af}, // tparen\n\t{0x51f3c5bb, 0x2082}, // twoinferior\n\t{0x51fee10e, 0x2210}, // coproducttext\n\t{0x52099e7d, 0x3267}, // ieungcirclekorean\n\t{0x5241ded3, 0x0428}, // Shacyrillic\n\t{0x5247cafc, 0x0691}, // afii57513\n\t{0x524c924c, 0x02d6}, // plusmod\n\t{0x525a3324, 0x2606}, // whitestar\n\t{0x5282fafa, 0x0e09}, // chochingthai\n\t{0x528afecc, 0xfb89}, // ddalfinalarabic\n\t{0x52beac4f, 0x25bf}, // whitedownpointingsmalltriangle\n\t{0x52e15cc8, 0x24b6}, // Acircle\n\t{0x52f72574, 0x3322}, // sentisquare\n\t{0x530e1856, 0x05dd}, // finalmem\n\t{0x531472bf, 0x05bb}, // qubutswidehebrew\n\t{0x531963a3, 0x0a73}, // uragurmukhi\n\t{0x531c6e1f, 0x315b}, // yokorean\n\t{0x532f469f, 0x093d}, // avagrahadeva\n\t{0x533e9388, 0x02bc}, // afii57929\n\t{0x537b0d36, 0x0466}, // Yuslittlecyrillic\n\t{0x53b3b784, 0xfb4a}, // tavdagesh\n\t{0x53ca8524, 0x099d}, // jhabengali\n\t{0x53d8dfb9, 0x3115}, // shbopomofo\n\t{0x53e66e1a, 0x0476}, // Izhitsadblgravecyrillic\n\t{0x53f49c2a, 0x066c}, // thousandsseparatorarabic\n\t{0x53f951b5, 0x056f}, // kenarmenian\n\t{0x540493c8, 0x03b1}, // alpha\n\t{0x540c5f40, 0x0552}, // Yiwnarmenian\n\t{0x542576f9, 0x0a07}, // igurmukhi\n\t{0x542f1e7a, 0x0151}, // ohungarumlaut\n\t{0x54761f15, 0x0631}, // afii57425\n\t{0x54820079, 0x04df}, // zedieresiscyrillic\n\t{0x548a6dde, 0x0451}, // iocyrillic\n\t{0x5494ff15, 0x053c}, // Liwnarmenian\n\t{0x54cc0e6b, 0x0212}, // Rinvertedbreve\n\t{0x54dfda54, 0xfe44}, // whitecornerbracketrightvertical\n\t{0x54f8c0f2, 0x1e78}, // Utildeacute\n\t{0x55003750, 0x05b0}, // shevanarrowhebrew\n\t{0x55021a5a, 0x0644}, // lamarabic\n\t{0x550a9f23, 0x0452}, // djecyrillic\n\t{0x550d7456, 0x0061}, // a\n\t{0x5512ec97, 0x0067}, // g\n\t{0x552e72ea, 0x1e8d}, // xdieresis\n\t{0x5532b75e, 0x3044}, // ihiragana\n\t{0x554f67fa, 0x1e4e}, // Otildedieresis\n\t{0x556bcf7c, 0xff1f}, // questionmonospace\n\t{0x5575c7a8, 0x09a8}, // nabengali\n\t{0x557f8e27, 0x1ee0}, // Ohorntilde\n\t{0x558d2385, 0x0318}, // lefttackbelowcmb\n\t{0x55aa99d5, 0xfe3f}, // anglebracketleftvertical\n\t{0x55b44317, 0x1ef2}, // Ygrave\n\t{0x55c6e8cd, 0x0aac}, // bagujarati\n\t{0x55e74cbe, 0x23a6}, // bracketrightbt\n\t{0x55e81ebb, 0x3124}, // angbopomofo\n\t{0x56000715, 0x33b0}, // pssquare\n\t{0x560f90ad, 0x25e4}, // blackupperlefttriangle\n\t{0x56200891, 0x092b}, // phadeva\n\t{0x56217879, 0x0596}, // tipehalefthebrew\n\t{0x56362764, 0x24d0}, // acircle\n\t{0x565aa859, 0x30a8}, // ekatakana\n\t{0x565d95fc, 0x3109}, // dbopomofo\n\t{0x56a0101f, 0x04ac}, // Tedescendercyrillic\n\t{0x56d036b9, 0x000f}, // controlSI\n\t{0x56deae12, 0x0102}, // Abreve\n\t{0x57050efe, 0x0145}, // Ncommaaccent\n\t{0x5708e98e, 0x3154}, // ekorean\n\t{0x5713d355, 0x2790}, // sevencircleinversesansserif\n\t{0x575226bc, 0x239f}, // parenrightex\n\t{0x57687403, 0x0e08}, // chochanthai\n\t{0x576959da, 0x04b7}, // chedescendercyrillic\n\t{0x577fdcc5, 0x033a}, // bridgeinvertedbelowcmb\n\t{0x578594f4, 0x0e47}, // maitaikhuthai\n\t{0x579e8de2, 0x2074}, // foursuperior\n\t{0x57a10bfe, 0x0435}, // iecyrillic\n\t{0x57c4d153, 0xfb1f}, // yodyodpatahhebrew\n\t{0x57c8c90f, 0x313b}, // rieulmieumkorean\n\t{0x57cea503, 0xff17}, // sevenmonospace\n\t{0x57fc3d5e, 0x255b}, // SF280000\n\t{0x58064efc, 0x0448}, // shacyrillic\n\t{0x580bc6b8, 0x2320}, // integraltop\n\t{0x580e0aa6, 0x005e}, // asciicircum\n\t{0x5817c838, 0x3141}, // mieumkorean\n\t{0x581d6ffc, 0x1ef8}, // Ytilde\n\t{0x58246165, 0x0152}, // OE\n\t{0x582e4f2f, 0x02a1}, // glottalstopstroke\n\t{0x58408a1e, 0x2321}, // integralbottom\n\t{0x584e8397, 0x263a}, // whitesmilingface\n\t{0x5855c496, 0x0465}, // eiotifiedcyrillic\n\t{0x587d22eb, 0x208d}, // parenleftinferior\n\t{0x58a61c85, 0x1e9a}, // arighthalfring\n\t{0x58ab0a67, 0x0544}, // Menarmenian\n\t{0x58ba15a9, 0x24c9}, // Tcircle\n\t{0x58c52193, 0x221a}, // radical\n\t{0x58df0572, 0x0301}, // acutecmb\n\t{0x58dfd388, 0x3187}, // yoyakorean\n\t{0x58e61a1f, 0x05e8}, // resh\n\t{0x58ea1dd9, 0x0650}, // afii57456\n\t{0x593b3f38, 0x0aa1}, // ddagujarati\n\t{0x5951351c, 0x0109}, // ccircumflex\n\t{0x59664498, 0xff21}, // Amonospace\n\t{0x597231b2, 0x1e00}, // Aringbelow\n\t{0x598309ec, 0x1edc}, // Ohorngrave\n\t{0x598631c5, 0x24c1}, // Lcircle\n\t{0x59b5003e, 0x3274}, // siosacirclekorean\n\t{0x59b9b187, 0x0075}, // u\n\t{0x59be0f3a, 0xff7f}, // sokatakanahalfwidth\n\t{0x59c46f70, 0x3299}, // ideographicsecretcircle\n\t{0x59c80d40, 0x2482}, // fifteenparen\n\t{0x59d6d87b, 0xff74}, // ekatakanahalfwidth\n\t{0x59d7f689, 0x3393}, // ghzsquare\n\t{0x59eccfd0, 0x05a3}, // munahlefthebrew\n\t{0x5a1aca3c, 0xfe34}, // wavyunderscorevertical\n\t{0x5a24f67c, 0x03b4}, // delta\n\t{0x5a3b6461, 0xfeb8}, // sheenmedialarabic\n\t{0x5a532aa6, 0x0586}, // feharmenian\n\t{0x5a575dc4, 0x0582}, // yiwnarmenian\n\t{0x5a62c8e8, 0x005c}, // backslash\n\t{0x5a8d2a4a, 0x09c3}, // rvocalicvowelsignbengali\n\t{0x5a963c7c, 0x0e02}, // khokhaithai\n\t{0x5acd345c, 0x339c}, // squaremm\n\t{0x5af634c5, 0x059e}, // gershayimaccenthebrew\n\t{0x5b041347, 0x0581}, // coarmenian\n\t{0x5b0fd985, 0x0360}, // tildedoublecmb\n\t{0x5b1907c0, 0x30a5}, // usmallkatakana\n\t{0x5b1da33a, 0x2206}, // increment\n\t{0x5b1dbca0, 0x0aa6}, // dagujarati\n\t{0x5b426364, 0x30cf}, // hakatakana\n\t{0x5b426591, 0xfeb7}, // sheeninitialarabic\n\t{0x5b46f9e7, 0x2080}, // zeroinferior\n\t{0x5b54a5c3, 0x05e1}, // afii57681\n\t{0x5b5f52e7, 0x0421}, // afii10035\n\t{0x5b6ab184, 0x25ef}, // largecircle\n\t{0x5b6f6c30, 0x0003}, // controlETX\n\t{0x5b720455, 0x014c}, // Omacron\n\t{0x5b72ad21, 0x03d5}, // phi1\n\t{0x5b785975, 0x02a7}, // tesh\n\t{0x5b7a64f2, 0x0597}, // reviahebrew\n\t{0x5bbfa15f, 0x25c4}, // blackleftpointingpointer\n\t{0x5bc1fa37, 0xfb47}, // qofdageshhebrew\n\t{0x5be94211, 0xff24}, // Dmonospace\n\t{0x5beb1e0f, 0x24cf}, // Zcircle\n\t{0x5bf0ba5d, 0xfb04}, // f_f_l\n\t{0x5c0e8b47, 0x0426}, // afii10040\n\t{0x5c185e06, 0x0250}, // aturned\n\t{0x5c299659, 0x250c}, // SF010000\n\t{0x5c337c81, 0xff8a}, // hakatakanahalfwidth\n\t{0x5c3478b9, 0xff3a}, // Zmonospace\n\t{0x5c349e9d, 0x30c5}, // dukatakana\n\t{0x5c352033, 0x092c}, // badeva\n\t{0x5c3b9279, 0x307e}, // mahiragana\n\t{0x5c3eecc5, 0x2561}, // SF190000\n\t{0x5c4a060e, 0x0e29}, // sorusithai\n\t{0x5c6b0ced, 0x05b8}, // qamats33\n\t{0x5c71c76c, 0x24b8}, // Ccircle\n\t{0x5c7f4966, 0x01b8}, // Ezhreversed\n\t{0x5c97be88, 0x0a2a}, // pagurmukhi\n\t{0x5c9a7487, 0x30ec}, // rekatakana\n\t{0x5ca0edc2, 0x01e7}, // gcaron\n\t{0x5cad2e17, 0x0679}, // tteharabic\n\t{0x5cb64e9e, 0x0150}, // Ohungarumlaut\n\t{0x5cb98a11, 0x05e9}, // afii57689\n\t{0x5cc203b0, 0x09eb}, // fivebengali\n\t{0x5cde4fa9, 0xff39}, // Ymonospace\n\t{0x5ce216d6, 0x02bb}, // commaturnedmod\n\t{0x5ce89c18, 0x028c}, // vturned\n\t{0x5cee9de2, 0x333b}, // peezisquare\n\t{0x5d053ab9, 0x334d}, // meetorusquare\n\t{0x5d06b34a, 0x01f5}, // gacute\n\t{0x5d185c29, 0x0aec}, // sixgujarati\n\t{0x5d23e967, 0x019a}, // lbar\n\t{0x5d24fed7, 0x047d}, // omegatitlocyrillic\n\t{0x5d26ca2e, 0x0996}, // khabengali\n\t{0x5d32256c, 0x25c6}, // blackdiamond\n\t{0x5d333915, 0x2234}, // therefore\n\t{0x5d42ce05, 0x30c2}, // dikatakana\n\t{0x5d590cb1, 0x05bb}, // qubutsnarrowhebrew\n\t{0x5d71a05b, 0x0017}, // controlETB\n\t{0x5d85b369, 0x05b8}, // qamats29\n\t{0x5d8c507f, 0xfb47}, // qofdagesh\n\t{0x5da58253, 0x30d0}, // bakatakana\n\t{0x5dba07ed, 0x22a5}, // perpendicular\n\t{0x5dbeec87, 0x01cd}, // Acaron\n\t{0x5de3b63c, 0x09cb}, // ovowelsignbengali\n\t{0x5e0aac56, 0x0200}, // Adblgrave\n\t{0x5e1c8dfa, 0x05b0}, // sheva2e\n\t{0x5e27fa57, 0xff6d}, // yusmallkatakanahalfwidth\n\t{0x5e36a670, 0xfe33}, // underscorevertical\n\t{0x5e483ddc, 0x3277}, // chieuchacirclekorean\n\t{0x5e4f2fbb, 0x1e65}, // sacutedotaccent\n\t{0x5ea7176f, 0x02d9}, // dotaccent\n\t{0x5edd1e19, 0xff25}, // Emonospace\n\t{0x5edd9086, 0x003a}, // colon\n\t{0x5eddf92b, 0x0044}, // D\n\t{0x5ee2af9c, 0x0e58}, // eightthai\n\t{0x5f03252d, 0x0136}, // Kcedilla\n\t{0x5f0ec9e9, 0x039a}, // Kappa\n\t{0x5f1bf33a, 0x1e17}, // emacronacute\n\t{0x5f4a5f07, 0x0abe}, // aavowelsigngujarati\n\t{0x5f5c5d5f, 0x041b}, // Elcyrillic\n\t{0x5f63748c, 0x03e6}, // Kheicoptic\n\t{0x5f7dc76d, 0x033b}, // squarebelowcmb\n\t{0x5f881d5c, 0x3160}, // yukorean\n\t{0x5f8f63e2, 0x24a0}, // eparen\n\t{0x5f99c0ac, 0x01ad}, // thook\n\t{0x5fa5f5cc, 0xfefa}, // lamalefhamzabelowfinalarabic\n\t{0x5fb56903, 0x095d}, // rhadeva\n\t{0x5fbeac33, 0x028b}, // vhook\n\t{0x5fe9065e, 0x042e}, // afii10048\n\t{0x6037ae88, 0x1ef3}, // ygrave\n\t{0x603b5882, 0x2287}, // reflexsuperset\n\t{0x603b9d93, 0x00d3}, // Oacute\n\t{0x603ff393, 0x1e6c}, // Tdotbelow\n\t{0x60753fe5, 0x066d}, // afii63167\n\t{0x607c93ed, 0x01b2}, // Vhook\n\t{0x60a46930, 0x0197}, // Istroke\n\t{0x60a4c80a, 0x30ee}, // wasmallkatakana\n\t{0x60ac2314, 0x25cc}, // dottedcircle\n\t{0x60ba7236, 0x000e}, // controlSO\n\t{0x60d57bed, 0x0aa4}, // tagujarati\n\t{0x60e1bf57, 0x1e0d}, // ddotbelow\n\t{0x60ebe651, 0x1ed8}, // Ocircumflexdotbelow\n\t{0x60f5a9fa, 0x03b7}, // eta\n\t{0x6106119c, 0xff37}, // Wmonospace\n\t{0x610b31e6, 0x01f1}, // DZ\n\t{0x6114c811, 0x1ef0}, // Uhorndotbelow\n\t{0x6121a3f6, 0x0e4d}, // nikhahitthai\n\t{0x61239a5a, 0x01c2}, // clickalveolar\n\t{0x6143b142, 0x1e67}, // scarondotaccent\n\t{0x61503571, 0x027b}, // rhookturned\n\t{0x6154bc05, 0x043b}, // afii10077\n\t{0x617c687c, 0x01a2}, // Oi\n\t{0x6198a771, 0xfef3}, // alefmaksurainitialarabic\n\t{0x61a21109, 0x01c9}, // lj\n\t{0x61a2d0df, 0x258c}, // lfblock\n\t{0x61a6f1a4, 0x0264}, // ramshorn\n\t{0x61b4ed39, 0x25ba}, // triagrt\n\t{0x61b7afbf, 0x05b5}, // tserenarrowhebrew\n\t{0x61b9f022, 0x04c4}, // kahookcyrillic\n\t{0x61ce131a, 0x0647}, // afii57470\n\t{0x61d46fc2, 0x1ed6}, // Ocircumflextilde\n\t{0x61d7bcdb, 0x1e57}, // pdotaccent\n\t{0x61e75298, 0x0417}, // afii10025\n\t{0x61f36361, 0x06f8}, // eightpersian\n\t{0x61fe712f, 0x20a4}, // afii08941\n\t{0x621057dd, 0x1ef5}, // ydotbelow\n\t{0x62127977, 0x266a}, // musicalnote\n\t{0x62161c15, 0x05da}, // finalkafhebrew\n\t{0x6229838d, 0x05d0}, // alef\n\t{0x62447ae3, 0x0314}, // commareversedabovecmb\n\t{0x6248b5e6, 0x33dd}, // wbsquare\n\t{0x625320aa, 0x30b2}, // gekatakana\n\t{0x6260c6fc, 0x0589}, // periodarmenian\n\t{0x6265e881, 0x2266}, // lessoverequal\n\t{0x626cbaa4, 0x01bf}, // wynn\n\t{0x62724d89, 0x09ad}, // bhabengali\n\t{0x62896f4a, 0x05f2}, // yodyodhebrew\n\t{0x628a5951, 0xff56}, // vmonospace\n\t{0x62a11b25, 0x1e87}, // wdotaccent\n\t{0x62accaf5, 0x239d}, // parenleftbt\n\t{0x62b2cd2d, 0x00c2}, // Acircumflex\n\t{0x62b6e7ac, 0x01a5}, // phook\n\t{0x62c361d5, 0x05e2}, // afii57682\n\t{0x62c52689, 0x05d5}, // afii57669\n\t{0x62ca59ed, 0x03aa}, // Iotadieresis\n\t{0x62cfccee, 0x017d}, // Zcaron\n\t{0x62d27ffc, 0x0567}, // eharmenian\n\t{0x62f7161d, 0x3020}, // postalmarkface\n\t{0x630680b1, 0x1e20}, // Gmacron\n\t{0x63070542, 0x0401}, // afii10023\n\t{0x630758ff, 0x317e}, // sioscieuckorean\n\t{0x632ae410, 0x0acc}, // auvowelsigngujarati\n\t{0x634ac34b, 0x2297}, // timescircle\n\t{0x634e42e5, 0xff2b}, // Kmonospace\n\t{0x635a9554, 0x04e5}, // idieresiscyrillic\n\t{0x636fabd5, 0x093c}, // nuktadeva\n\t{0x637ae7ca, 0x0344}, // dialytikatonoscmb\n\t{0x637d3539, 0x00bc}, // onequarter\n\t{0x6389d9bb, 0x0641}, // afii57441\n\t{0x63a82931, 0x0297}, // cstretched\n\t{0x63d84bb6, 0x2281}, // notsucceeds\n\t{0x63dfed74, 0x311f}, // eibopomofo\n\t{0x63e274d2, 0xfc0b}, // tehjeemisolatedarabic\n\t{0x63e60b13, 0x0149}, // napostrophe\n\t{0x63f6cd8f, 0x049d}, // kaverticalstrokecyrillic\n\t{0x642b78c5, 0x1ed5}, // ocircumflexhookabove\n\t{0x642e193e, 0x0469}, // yuslittleiotifiedcyrillic\n\t{0x6434f04a, 0xfd88}, // lammeemhahinitialarabic\n\t{0x64468e36, 0x0e18}, // thothongthai\n\t{0x64517fe8, 0x004b}, // K\n\t{0x6453c78e, 0x064e}, // fathalowarabic\n\t{0x6460d798, 0x3025}, // fivehangzhou\n\t{0x646b157e, 0x3242}, // ideographicselfparen\n\t{0x646c5c19, 0x0ab5}, // vagujarati\n\t{0x647eca4f, 0x09ae}, // mabengali\n\t{0x64a1b76b, 0x30fa}, // vokatakana\n\t{0x64d00b32, 0x0114}, // Ebreve\n\t{0x64d7a402, 0x0e40}, // saraethai\n\t{0x64d94f4a, 0x0e01}, // kokaithai\n\t{0x64e7dff2, 0x09c4}, // rrvocalicvowelsignbengali\n\t{0x64eb016b, 0x2245}, // approximatelyequal\n\t{0x64fd7a48, 0x2078}, // eightsuperior\n\t{0x650678be, 0x02cb}, // fourthtonechinese\n\t{0x65070663, 0x0459}, // ljecyrillic\n\t{0x6510d99a, 0x0938}, // sadeva\n\t{0x651d5722, 0x04c2}, // zhebrevecyrillic\n\t{0x6525cdb1, 0x00ad}, // softhyphen\n\t{0x6543f12c, 0x01d5}, // Udieresismacron\n\t{0x654d08a0, 0x0e3a}, // phinthuthai\n\t{0x657ffabd, 0x22ee}, // ellipsisvertical\n\t{0x6598fbfe, 0x3112}, // xbopomofo\n\t{0x65a5bd1b, 0x24e1}, // rcircle\n\t{0x65be15d1, 0x0a08}, // iigurmukhi\n\t{0x65c095c5, 0x200e}, // afii299\n\t{0x65cc1f56, 0x0545}, // Yiarmenian\n\t{0x662a6586, 0x23a0}, // parenrightbt\n\t{0x662a831c, 0x1eeb}, // uhorngrave\n\t{0x663a2c1a, 0x3300}, // apaatosquare\n\t{0x6642f834, 0x0361}, // breveinverteddoublecmb\n\t{0x665bba62, 0x2017}, // dbllowline\n\t{0x665e930f, 0x3264}, // mieumcirclekorean\n\t{0x666ae75e, 0x0159}, // rcaron\n\t{0x666e8927, 0xfc4e}, // noonmeemisolatedarabic\n\t{0x666faf51, 0xfba5}, // hehhamzaabovefinalarabic\n\t{0x6689dbc7, 0x33cb}, // HPsquare\n\t{0x668e9764, 0x30a2}, // akatakana\n\t{0x66bb979c, 0x246c}, // thirteencircle\n\t{0x66c590a5, 0x2236}, // ratio\n\t{0x66e9c5c7, 0x3084}, // yahiragana\n\t{0x66ef8fdf, 0x040f}, // afii10145\n\t{0x66fb9b49, 0x33c9}, // gysquare\n\t{0x67188e74, 0x0066}, // f\n\t{0x6740a4ac, 0x25cf}, // H18533\n\t{0x67427e4a, 0x2079}, // ninesuperior\n\t{0x674a0210, 0x02b6}, // Rsmallinvertedsuperior\n\t{0x674c80b7, 0x03da}, // Stigmagreek\n\t{0x67569fa6, 0x05b5}, // tsere\n\t{0x6758c83c, 0x2588}, // block\n\t{0x6776a85a, 0x0ac7}, // evowelsigngujarati\n\t{0x6779be95, 0x3113}, // zhbopomofo\n\t{0x6785194b, 0x221f}, // rightangle\n\t{0x679d9205, 0x02c5}, // arrowheaddownmod\n\t{0x679dcadd, 0x0e54}, // fourthai\n\t{0x679ffc49, 0x2024}, // onedotenleader\n\t{0x67ea250f, 0x1e2d}, // itildebelow\n\t{0x67ebcea4, 0x3209}, // chieuchparenkorean\n\t{0x67f3db47, 0x3073}, // bihiragana\n\t{0x67f3ecac, 0xfb4b}, // afii57700\n\t{0x67f7f220, 0x309c}, // semivoicedmarkkana\n\t{0x67fa1db6, 0x203a}, // guilsinglright\n\t{0x68070609, 0x0916}, // khadeva\n\t{0x6808ec86, 0x02d8}, // breve\n\t{0x6811e3e1, 0x0404}, // Ecyrillic\n\t{0x6814026d, 0x02c8}, // verticallinemod\n\t{0x682b08dd, 0x01ac}, // Thook\n\t{0x6853e235, 0x0652}, // sukunarabic\n\t{0x685932be, 0xfe36}, // parenrightvertical\n\t{0x68a76955, 0x00c7}, // Ccedilla\n\t{0x68b3215e, 0x0339}, // ringhalfrightbelowcmb\n\t{0x68b98a65, 0x0679}, // afii57511\n\t{0x68ccd1d8, 0x3212}, // mieumaparenkorean\n\t{0x68eb418e, 0x3011}, // blacklenticularbracketright\n\t{0x690f8118, 0x320b}, // thieuthparenkorean\n\t{0x692bc1f7, 0x0a42}, // uumatragurmukhi\n\t{0x693ccd9c, 0x0432}, // vecyrillic\n\t{0x6962e430, 0x0322}, // hookretroflexbelowcmb\n\t{0x6977f4b7, 0xff05}, // percentmonospace\n\t{0x697925af, 0x05d2}, // gimel\n\t{0x697feb80, 0x030d}, // verticallineabovecmb\n\t{0x6991a62a, 0x0935}, // vadeva\n\t{0x699d525a, 0x0111}, // dcroat\n\t{0x69aabc4d, 0x06af}, // gafarabic\n\t{0x69d31152, 0x0e51}, // onethai\n\t{0x69faaae4, 0x33a7}, // moverssquare\n\t{0x6a104703, 0x2569}, // SF400000\n\t{0x6a16e743, 0xfef0}, // alefmaksurafinalarabic\n\t{0x6a3d8bdc, 0x0a99}, // ngagujarati\n\t{0x6a511868, 0x03a7}, // Chi\n\t{0x6a5f0a3f, 0x334e}, // yaadosquare\n\t{0x6a721907, 0xfecc}, // ainmedialarabic\n\t{0x6a8d644d, 0x1ead}, // acircumflexdotbelow\n\t{0x6a972227, 0x0401}, // Iocyrillic\n\t{0x6a988d53, 0x2035}, // primereversed\n\t{0x6a9b2b92, 0x0414}, // afii10021\n\t{0x6aa62850, 0x0662}, // twoarabic\n\t{0x6aa82ca6, 0x3218}, // khieukhaparenkorean\n\t{0x6abb1490, 0x005d}, // bracketright\n\t{0x6ad19d29, 0xfb1f}, // doubleyodpatahhebrew\n\t{0x6b214948, 0xff6f}, // tusmallkatakanahalfwidth\n\t{0x6b2d374c, 0xfcdd}, // yehmeeminitialarabic\n\t{0x6b3f02ab, 0x211e}, // prescription\n\t{0x6b58bab9, 0x0963}, // llvocalicvowelsigndeva\n\t{0x6b83db74, 0x2295}, // circleplus\n\t{0x6b85cd6e, 0x00a4}, // currency\n\t{0x6b8b924f, 0x30d8}, // hekatakana\n\t{0x6b908b1b, 0x09e7}, // onebengali\n\t{0x6b98f18c, 0x212b}, // angstrom\n\t{0x6b9adcc4, 0x25cf}, // blackcircle\n\t{0x6b9f4fbe, 0x0940}, // iivowelsigndeva\n\t{0x6baa5ba4, 0x03ce}, // omegatonos\n\t{0x6bbd76c8, 0x0936}, // shadeva\n\t{0x6bca6ff5, 0xfe4a}, // overlinecenterline\n\t{0x6bd59d12, 0x0915}, // kadeva\n\t{0x6bd609d3, 0x00f0}, // eth\n\t{0x6be13af7, 0x2199}, // arrowdownleft\n\t{0x6bf10a81, 0x2015}, // horizontalbar\n\t{0x6c0e37b1, 0x30ce}, // nokatakana\n\t{0x6c11086e, 0x0a1c}, // jagurmukhi\n\t{0x6c180b9f, 0x0462}, // Yatcyrillic\n\t{0x6c429460, 0xfb40}, // nundageshhebrew\n\t{0x6c5c9da6, 0x0457}, // yicyrillic\n\t{0x6c781e8a, 0x25bd}, // whitedownpointingtriangle\n\t{0x6c8584d5, 0x3065}, // duhiragana\n\t{0x6c95b865, 0x0941}, // uvowelsigndeva\n\t{0x6c98a67f, 0x0479}, // ukcyrillic\n\t{0x6cbb9b7a, 0xfe5d}, // tortoiseshellbracketleftsmall\n\t{0x6cce2d3d, 0x0aa5}, // thagujarati\n\t{0x6cce7f58, 0x043b}, // elcyrillic\n\t{0x6d02864a, 0x049c}, // Kaverticalstrokecyrillic\n\t{0x6d1b554b, 0x0982}, // anusvarabengali\n\t{0x6d3fc0d7, 0x040f}, // Dzhecyrillic\n\t{0x6d519305, 0x2169}, // Tenroman\n\t{0x6d63a915, 0x02bc}, // apostrophemod\n\t{0x6d6c6ece, 0x307f}, // mihiragana\n\t{0x6d794da3, 0x0057}, // W\n\t{0x6d7a8d87, 0x00fd}, // yacute\n\t{0x6d88930b, 0x044a}, // afii10092\n\t{0x6d89653d, 0x24e8}, // ycircle\n\t{0x6d8f5cd4, 0xff95}, // yukatakanahalfwidth\n\t{0x6d931b7f, 0x255c}, // SF270000\n\t{0x6d9b9c3e, 0x05dc}, // afii57676\n\t{0x6dd186b9, 0x0575}, // yiarmenian\n\t{0x6ddcf118, 0x22a4}, // tackdown\n\t{0x6ddd69da, 0x05b1}, // hatafsegolquarterhebrew\n\t{0x6df68266, 0x0388}, // Epsilontonos\n\t{0x6df8e451, 0x2203}, // existential\n\t{0x6dfa6cea, 0x0a66}, // zerogurmukhi\n\t{0x6dff449c, 0xff79}, // kekatakanahalfwidth\n\t{0x6e002bb5, 0xfb05}, // longs_t\n\t{0x6e298b2c, 0x3380}, // paampssquare\n\t{0x6e2b4011, 0x2213}, // minusplus\n\t{0x6e2e0a97, 0xfe66}, // equalsmall\n\t{0x6e53b9b3, 0xfb00}, // ff\n\t{0x6e5f0868, 0x30ed}, // rokatakana\n\t{0x6e7cf223, 0x3071}, // pahiragana\n\t{0x6e81816d, 0x1e5d}, // rdotbelowmacron\n\t{0x6e897228, 0x0324}, // dieresisbelowcmb\n\t{0x6e8ccbbb, 0xfb48}, // reshdageshhebrew\n\t{0x6eb16a59, 0x2166}, // Sevenroman\n\t{0x6eb40b0d, 0x04db}, // schwadieresiscyrillic\n\t{0x6eba69ba, 0xfe9e}, // jeemfinalarabic\n\t{0x6ebb53ea, 0x2261}, // equivalence\n\t{0x6ecb4ba4, 0x0449}, // afii10091\n\t{0x6ecc1f68, 0x25bc}, // triagdn\n\t{0x6ed918ed, 0xfcd1}, // meemmeeminitialarabic\n\t{0x6ee27b35, 0x0321}, // hookpalatalizedbelowcmb\n\t{0x6f028e08, 0x0571}, // jaarmenian\n\t{0x6f1f2583, 0x25ce}, // bullseye\n\t{0x6f2573bb, 0x30eb}, // rukatakana\n\t{0x6f4833d3, 0x0a5c}, // rragurmukhi\n\t{0x6f57587a, 0x227b}, // succeeds\n\t{0x6f64edc9, 0x054f}, // Tiwnarmenian\n\t{0x6f6b6e30, 0x0e0e}, // dochadathai\n\t{0x6f75692f, 0x0ac8}, // aivowelsigngujarati\n\t{0x6f7744aa, 0x2196}, // arrowupleft\n\t{0x6fae2151, 0x0aef}, // ninegujarati\n\t{0x6fbeef2a, 0x044d}, // ereversedcyrillic\n\t{0x6fc01d9f, 0x00f8}, // oslash\n\t{0x702ecc19, 0x3054}, // gohiragana\n\t{0x70534c83, 0x05a4}, // mahapakhlefthebrew\n\t{0x7061d5ad, 0x255a}, // SF380000\n\t{0x707057b4, 0xfb2e}, // alefpatahhebrew\n\t{0x7070c1c4, 0x0333}, // dbllowlinecmb\n\t{0x7077f8df, 0x0163}, // tcommaaccent\n\t{0x708cf64a, 0x0944}, // rrvocalicvowelsigndeva\n\t{0x709b2bbe, 0x0056}, // V\n\t{0x70a0d365, 0xfeee}, // wawfinalarabic\n\t{0x70a7b34b, 0x05b5}, // tsere12\n\t{0x70c1bcae, 0x1ede}, // Ohornhookabove\n\t{0x70d74f05, 0x04b1}, // ustraightstrokecyrillic\n\t{0x70d8442c, 0xff3c}, // backslashmonospace\n\t{0x70e9d43c, 0x2202}, // partialdiff\n\t{0x70f78dac, 0x24b5}, // zparen\n\t{0x70f8a40d, 0x05b8}, // afii57797\n\t{0x71062567, 0xfeea}, // hehfinalalttwoarabic\n\t{0x710fbfc8, 0x0179}, // Zacute\n\t{0x712afb91, 0x310b}, // nbopomofo\n\t{0x7138408a, 0x04cc}, // chekhakassiancyrillic\n\t{0x71411a8f, 0x3156}, // yekorean\n\t{0x7154079a, 0x1e50}, // Omacrongrave\n\t{0x715a0e07, 0xfef4}, // alefmaksuramedialarabic\n\t{0x715aaa7e, 0x0122}, // Gcommaaccent\n\t{0x71693ad6, 0x0919}, // ngadeva\n\t{0x718d2f07, 0xff16}, // sixmonospace\n\t{0x71a4a95d, 0x1eaa}, // Acircumflextilde\n\t{0x71b12b2f, 0x01e0}, // Adotmacron\n\t{0x71b2c74d, 0x00b7}, // periodcentered\n\t{0x71b2e09c, 0x0e32}, // saraaathai\n\t{0x71e104c6, 0x3041}, // asmallhiragana\n\t{0x71ebf117, 0x0640}, // afii57440\n\t{0x7222af0c, 0x25cb}, // circle\n\t{0x722d9aa3, 0x2153}, // onethird\n\t{0x72446324, 0x3164}, // hangulfiller\n\t{0x7256dcb9, 0x0ac2}, // uuvowelsigngujarati\n\t{0x725da2a5, 0x0548}, // Voarmenian\n\t{0x7274464b, 0x0e31}, // maihanakatthai\n\t{0x7276cdf0, 0x02d7}, // minusmod\n\t{0x7278753d, 0x04d7}, // iebrevecyrillic\n\t{0x728cf068, 0x020f}, // oinvertedbreve\n\t{0x728f761b, 0x3111}, // qbopomofo\n\t{0x72b3c6a8, 0x00b4}, // acute\n\t{0x72ba7ff6, 0x3093}, // nhiragana\n\t{0x72c6f1c4, 0xff5c}, // barmonospace\n\t{0x72c8f209, 0x0136}, // Kcommaaccent\n\t{0x72e33f41, 0x0419}, // afii10027\n\t{0x72f1f5cf, 0x0438}, // iicyrillic\n\t{0x72fc7974, 0x2111}, // Ifraktur\n\t{0x72fd959a, 0x002a}, // asterisk\n\t{0x73032cb1, 0x3268}, // cieuccirclekorean\n\t{0x731be3b3, 0x3140}, // rieulhieuhkorean\n\t{0x73200dbd, 0x0e20}, // phosamphaothai\n\t{0x7322d42e, 0x24b9}, // Dcircle\n\t{0x73282fcd, 0x1ee3}, // ohorndotbelow\n\t{0x732cf2ca, 0x2485}, // eighteenparen\n\t{0x7338db3a, 0x066b}, // decimalseparatorarabic\n\t{0x73392eb6, 0x1ed4}, // Ocircumflexhookabove\n\t{0x733b0480, 0xfe94}, // tehmarbutafinalarabic\n\t{0x734f6c6b, 0x3090}, // wihiragana\n\t{0x7375cb46, 0x0686}, // tcheharabic\n\t{0x73843708, 0x0434}, // decyrillic\n\t{0x7387f092, 0x2088}, // eightinferior\n\t{0x73b2bbd4, 0xfe63}, // hyphensmall\n\t{0x73b70a88, 0x05d8}, // afii57672\n\t{0x73b7c451, 0x095a}, // ghhadeva\n\t{0x73c5e60b, 0x004e}, // N\n\t{0x73ee6902, 0x0965}, // dbldanda\n\t{0x73f5578c, 0x093f}, // ivowelsigndeva\n\t{0x74030714, 0x311c}, // ebopomofo\n\t{0x7411ab47, 0x00ba}, // ordmasculine\n\t{0x74144417, 0x311e}, // aibopomofo\n\t{0x74157df0, 0x0667}, // sevenhackarabic\n\t{0x741e8130, 0x00cf}, // Idieresis\n\t{0x7435abfe, 0x057c}, // raarmenian\n\t{0x743d1e25, 0x0456}, // afii10103\n\t{0x745c44bf, 0x02e3}, // xsuperior\n\t{0x746e784f, 0xff48}, // hmonospace\n\t{0x7476bb3d, 0x21d2}, // dblarrowright\n\t{0x74814589, 0x05b9}, // holam19\n\t{0x748db30c, 0x33b1}, // nssquare\n\t{0x7495de6c, 0x0008}, // controlBS\n\t{0x74a2fb64, 0x2280}, // notprecedes\n\t{0x74abeab2, 0x05ac}, // iluyhebrew\n\t{0x74b1cbfb, 0x22c5}, // dotmath\n\t{0x74caf1a5, 0x01b4}, // yhook\n\t{0x74d74b92, 0x2209}, // notelement\n\t{0x74f1fca9, 0x01db}, // Udieresisgrave\n\t{0x7506e8c8, 0x24d1}, // bcircle\n\t{0x751253a5, 0x2168}, // Nineroman\n\t{0x7544678b, 0x307d}, // pohiragana\n\t{0x754982de, 0x06a4}, // veharabic\n\t{0x755a250b, 0x09dd}, // rhabengali\n\t{0x755f707c, 0x1ebf}, // ecircumflexacute\n\t{0x75841530, 0x2002}, // enspace\n\t{0x75907eb0, 0x322c}, // ideographicwaterparen\n\t{0x759ddc3d, 0x3068}, // tohiragana\n\t{0x759f9daf, 0x00c4}, // Adieresis\n\t{0x75aa325f, 0x3047}, // esmallhiragana\n\t{0x75b73269, 0x27e9}, // angbracketrightbig\n\t{0x75b9e64d, 0xff46}, // fmonospace\n\t{0x75bf74c1, 0x0a59}, // khhagurmukhi\n\t{0x75f4d85d, 0x0a2c}, // bagurmukhi\n\t{0x7603459c, 0x094c}, // auvowelsigndeva\n\t{0x760d83de, 0x222b}, // integral\n\t{0x7612320f, 0x3273}, // pieupacirclekorean\n\t{0x76186d8e, 0x01f3}, // dz\n\t{0x7619aedc, 0xfb4c}, // betrafehebrew\n\t{0x762dd6ce, 0x2260}, // notequal\n\t{0x763e1836, 0x30c4}, // tukatakana\n\t{0x7656c681, 0x01c4}, // DZcaron\n\t{0x767695a3, 0xfed4}, // fehmedialarabic\n\t{0x76811ae6, 0x0169}, // utilde\n\t{0x7681e1d4, 0xfe9b}, // thehinitialarabic\n\t{0x76a40aac, 0x001e}, // controlRS\n\t{0x76a57fc1, 0x0117}, // edot\n\t{0x76aa35a2, 0x1e27}, // hdieresis\n\t{0x76abdb93, 0xfb41}, // samekhdageshhebrew\n\t{0x76af2566, 0x05c1}, // afii57804\n\t{0x76b279b9, 0x1e76}, // Ucircumflexbelow\n\t{0x76be5e67, 0x0389}, // Etatonos\n\t{0x76ec167e, 0x3128}, // ubopomofo\n\t{0x76ee8ef9, 0x326a}, // khieukhcirclekorean\n\t{0x76fa92ba, 0x2225}, // parallel\n\t{0x7722080a, 0x21e2}, // arrowdashright\n\t{0x772d6b37, 0x3294}, // ideographnamecircle\n\t{0x774eb078, 0x0328}, // ogonekcmb\n\t{0x774fe771, 0x064d}, // kasratanarabic\n\t{0x7752bcc4, 0x239e}, // parenrighttp\n\t{0x775a46a9, 0xffe0}, // centmonospace\n\t{0x77651620, 0x007b}, // braceleft\n\t{0x776629fd, 0x044a}, // hardsigncyrillic\n\t{0x7766a0eb, 0x041e}, // Ocyrillic\n\t{0x776cd4d6, 0x1e89}, // wdotbelow\n\t{0x77741a8d, 0x0473}, // fitacyrillic\n\t{0x7782c966, 0x1e46}, // Ndotbelow\n\t{0x7786e0a6, 0x246f}, // sixteencircle\n\t{0x779ce17f, 0x0390}, // iotadieresistonos\n\t{0x77a6f721, 0x2165}, // Sixroman\n\t{0x77aefb3f, 0x3027}, // sevenhangzhou\n\t{0x77b3e914, 0x3106}, // pbopomofo\n\t{0x77d27346, 0x0110}, // Dcroat\n\t{0x77e1d263, 0x0442}, // tecyrillic\n\t{0x77ee824a, 0xfba7}, // hehfinalaltonearabic\n\t{0x77f415ae, 0x03eb}, // gangiacoptic\n\t{0x77f608a5, 0x00ec}, // igrave\n\t{0x78151b28, 0x04f8}, // Yerudieresiscyrillic\n\t{0x781b1710, 0x3175}, // pieupsiostikeutkorean\n\t{0x782f5323, 0x2297}, // circlemultiply\n\t{0x783bb2b4, 0xfeea}, // hehfinalarabic\n\t{0x7849decd, 0x05f0}, // vavvavhebrew\n\t{0x7865471d, 0x30f8}, // vikatakana\n\t{0x7868522a, 0x0172}, // Uogonek\n\t{0x78728968, 0x0e3f}, // bahtthai\n\t{0x7877a9ea, 0x05d9}, // yodhebrew\n\t{0x7878b2f0, 0x323c}, // ideographicsuperviseparen\n\t{0x788e7d3e, 0x05b3}, // hatafqamats\n\t{0x78965447, 0x0593}, // shalshelethebrew\n\t{0x78d4db12, 0x032e}, // brevebelowcmb\n\t{0x78da6d23, 0x046e}, // Ksicyrillic\n\t{0x78f4df25, 0x04d9}, // schwacyrillic\n\t{0x79042ee6, 0x30e9}, // rakatakana\n\t{0x79116479, 0x0039}, // nine\n\t{0x7919f419, 0x0416}, // afii10024\n\t{0x792d6db9, 0x0272}, // nhookleft\n\t{0x793801c3, 0x3158}, // wakorean\n\t{0x79577113, 0x2565}, // SF480000\n\t{0x795917d1, 0x0583}, // piwrarmenian\n\t{0x79638654, 0x1ecd}, // odotbelow\n\t{0x796eb2f8, 0x3389}, // kcalsquare\n\t{0x796edb96, 0x0387}, // anoteleia\n\t{0x797aa124, 0x0445}, // khacyrillic\n\t{0x7980bc25, 0x00c5}, // Aring\n\t{0x7987b173, 0x03e8}, // Horicoptic\n\t{0x79961e28, 0x20a7}, // peseta\n\t{0x79c6a044, 0xfe3a}, // tortoiseshellbracketrightvertical\n\t{0x79d35b17, 0x3229}, // tenideographicparen\n\t{0x79dfa961, 0xfb2d}, // shindageshsindot\n\t{0x79e5e3c1, 0x0e2f}, // paiyannoithai\n\t{0x79fc5691, 0x24ce}, // Ycircle\n\t{0x7a196523, 0x0451}, // afii10071\n\t{0x7a29214e, 0x006c}, // l\n\t{0x7a32a546, 0x202d}, // afii61574\n\t{0x7a3f45e9, 0x0ab8}, // sagujarati\n\t{0x7a49bde9, 0xfca4}, // tehmeeminitialarabic\n\t{0x7a49dc21, 0xfee2}, // meemfinalarabic\n\t{0x7a56cace, 0x33a1}, // squaremsquared\n\t{0x7a6cfa6a, 0x0a3f}, // imatragurmukhi\n\t{0x7a75be4d, 0x2559}, // SF490000\n\t{0x7a8736f8, 0x320c}, // phieuphparenkorean\n\t{0x7aa071da, 0x0217}, // uinvertedbreve\n\t{0x7aa95d24, 0xfb34}, // hedageshhebrew\n\t{0x7aac463a, 0x0669}, // afii57401\n\t{0x7ab8ba14, 0x1ebe}, // Ecircumflexacute\n\t{0x7ad78099, 0x05b5}, // afii57794\n\t{0x7b074f4f, 0x062c}, // jeemarabic\n\t{0x7b0aca00, 0x3315}, // kiroguramusquare\n\t{0x7b443626, 0x3331}, // birusquare\n\t{0x7b5e0418, 0xff10}, // zeromonospace\n\t{0x7b7b9d4d, 0x0424}, // afii10038\n\t{0x7b80aee5, 0x05bb}, // qubutsquarterhebrew\n\t{0x7b8c3862, 0x02b8}, // ysuperior\n\t{0x7bac8f33, 0x0016}, // controlSYN\n\t{0x7bc269dd, 0x0040}, // at\n\t{0x7bd5ca88, 0x33ca}, // hasquare\n\t{0x7bd8b82b, 0x3005}, // ideographiciterationmark\n\t{0x7c301325, 0x0472}, // Fitacyrillic\n\t{0x7c3f4566, 0x00e7}, // ccedilla\n\t{0x7c4777ca, 0xfcc9}, // lamjeeminitialarabic\n\t{0x7c4f7ece, 0x0ab2}, // lagujarati\n\t{0x7c53c130, 0x0a13}, // oogurmukhi\n\t{0x7c613499, 0x2566}, // SF410000\n\t{0x7c8ffdc8, 0x24e7}, // xcircle\n\t{0x7c903e9b, 0x1ec7}, // ecircumflexdotbelow\n\t{0x7cb539e8, 0x096e}, // eightdeva\n\t{0x7cc006ef, 0x222c}, // dblintegral\n\t{0x7cdf3e4a, 0x0a2f}, // yagurmukhi\n\t{0x7cf2e5f4, 0x0029}, // parenright\n\t{0x7cf2ebbd, 0xff96}, // yokatakanahalfwidth\n\t{0x7cf8ce2e, 0x3394}, // thzsquare\n\t{0x7d32ca29, 0x0127}, // hbar\n\t{0x7d44a576, 0x24b1}, // vparen\n\t{0x7d4ddd33, 0x2554}, // SF390000\n\t{0x7d86a046, 0xff93}, // mokatakanahalfwidth\n\t{0x7d8bc7c0, 0x255f}, // SF370000\n\t{0x7d981506, 0x0a9f}, // ttagujarati\n\t{0x7dc79678, 0x062a}, // afii57418\n\t{0x7dc79708, 0x223c}, // tildeoperator\n\t{0x7dc7cd45, 0x33b6}, // muvsquare\n\t{0x7dcf75fb, 0x223c}, // similar\n\t{0x7dd21a95, 0x30b5}, // sakatakana\n\t{0x7dd63b6c, 0x1ec1}, // ecircumflexgrave\n\t{0x7de5edf4, 0x05b9}, // afii57806\n\t{0x7df90cb9, 0x249c}, // aparen\n\t{0x7e46df3d, 0x30d7}, // pukatakana\n\t{0x7e4f805e, 0x3067}, // dehiragana\n\t{0x7e5c9fda, 0x042f}, // IAcyrillic\n\t{0x7e701b6d, 0xff0d}, // hyphenmonospace\n\t{0x7e739224, 0x3046}, // uhiragana\n\t{0x7ebf5260, 0x0031}, // one\n\t{0x7eddac19, 0x09f4}, // onenumeratorbengali\n\t{0x7f43cdd7, 0x0ab0}, // ragujarati\n\t{0x7f56c599, 0x0141}, // Lslash\n\t{0x7f5b3579, 0x1e74}, // Utildebelow\n\t{0x7f630a55, 0x1ef9}, // ytilde\n\t{0x7f7aa31e, 0x0648}, // afii57448\n\t{0x7f82e2ff, 0x098f}, // ebengali\n\t{0x7f851974, 0x0568}, // etarmenian\n\t{0x7f92fe37, 0x066d}, // asteriskarabic\n\t{0x7f97f320, 0x301c}, // wavedash\n\t{0x7f99701f, 0xfb2a}, // shinshindothebrew\n\t{0x7fbd4335, 0x2309}, // ceilingrightbig\n\t{0x7ff2087d, 0x01df}, // adieresismacron\n\t{0x7ffdad4c, 0x326e}, // kiyeokacirclekorean\n\t{0x801f311e, 0x1ebb}, // ehookabove\n\t{0x8020003f, 0x05e9}, // shinhebrew\n\t{0x8027a085, 0x03d2}, // Upsilonhooksymbol\n\t{0x8029e67d, 0x049b}, // kadescendercyrillic\n\t{0x803a882f, 0x0a8b}, // rvocalicgujarati\n\t{0x80417827, 0x33a9}, // pasquare\n\t{0x8048e51c, 0x24e6}, // wcircle\n\t{0x80690312, 0x0155}, // racute\n\t{0x8076b638, 0xfedf}, // laminitialarabic\n\t{0x80792dfa, 0x0478}, // Ukcyrillic\n\t{0x8082c40e, 0x251c}, // SF080000\n\t{0x8086d5c5, 0x0490}, // afii10050\n\t{0x80890e42, 0x0316}, // gravebelowcmb\n\t{0x808de596, 0x2492}, // elevenperiod\n\t{0x808eef1b, 0x0068}, // h\n\t{0x80b21ab0, 0x00f5}, // otilde\n\t{0x80b54bce, 0x3170}, // mieumpansioskorean\n\t{0x80c36a57, 0x0480}, // Koppacyrillic\n\t{0x80f8e4b8, 0x017f}, // slong\n\t{0x80fb86d5, 0x00ff}, // ydieresis\n\t{0x810ea19f, 0x02bd}, // afii64937\n\t{0x810f1d5a, 0x30c6}, // tekatakana\n\t{0x812767fa, 0x0555}, // Oharmenian\n\t{0x8140027d, 0x24d3}, // dcircle\n\t{0x815134d6, 0x00cd}, // Iacute\n\t{0x81589a47, 0x2220}, // angle\n\t{0x81658581, 0x0207}, // einvertedbreve\n\t{0x816871c9, 0x1ec2}, // Ecircumflexhookabove\n\t{0x8169da43, 0x0483}, // titlocyrilliccmb\n\t{0x8170d563, 0x256b}, // SF530000\n\t{0x817f112a, 0x1e37}, // ldotbelow\n\t{0x817f9471, 0x1e92}, // Zdotbelow\n\t{0x81806da2, 0x328d}, // ideographwoodcircle\n\t{0x8184073f, 0x053b}, // Iniarmenian\n\t{0x818aac3d, 0x3165}, // ssangnieunkorean\n\t{0x81b94a51, 0x3233}, // ideographicsocietyparen\n\t{0x81e18c26, 0x30c3}, // tusmallkatakana\n\t{0x81eec5b0, 0x320e}, // kiyeokaparenkorean\n\t{0x8215ea5e, 0x02b2}, // jsuperior\n\t{0x82173176, 0x05d9}, // afii57673\n\t{0x8218cc3e, 0x039c}, // Mu\n\t{0x822cf82c, 0x3070}, // bahiragana\n\t{0x8230e7a0, 0x32a7}, // ideographicleftcircle\n\t{0x823da9d2, 0x0413}, // afii10020\n\t{0x825a2038, 0x3045}, // usmallhiragana\n\t{0x8260fa87, 0x1ea5}, // acircumflexacute\n\t{0x8272e0b5, 0x249b}, // twentyperiod\n\t{0x827d6960, 0xff40}, // gravemonospace\n\t{0x828072a0, 0x2666}, // diamond\n\t{0x8281c05a, 0x00b5}, // mu1\n\t{0x8291bd7d, 0x248e}, // sevenperiod\n\t{0x82ab3b91, 0x03a3}, // Sigma\n\t{0x82b182a5, 0x057e}, // vewarmenian\n\t{0x82b58e6a, 0x1e94}, // Zlinebelow\n\t{0x82b5e1a0, 0x266b}, // eighthnotebeamed\n\t{0x82b5fc2f, 0x05bc}, // afii57807\n\t{0x82c39f59, 0x1e62}, // Sdotbelow\n\t{0x82c3da09, 0x0a1a}, // cagurmukhi\n\t{0x82d03f46, 0x056e}, // caarmenian\n\t{0x82d4758a, 0x25e6}, // whitebullet\n\t{0x82db51c1, 0x05b6}, // segolnarrowhebrew\n\t{0x82dffbf3, 0xfe9c}, // thehmedialarabic\n\t{0x8322270c, 0x1e49}, // nlinebelow\n\t{0x832d9a03, 0x263b}, // invsmileface\n\t{0x83393d74, 0xfef7}, // lamalefhamzaaboveisolatedarabic\n\t{0x83589346, 0x1eb0}, // Abrevegrave\n\t{0x837601e2, 0x0ae7}, // onegujarati\n\t{0x8377c3f2, 0x026b}, // lmiddletilde\n\t{0x837a2830, 0x2113}, // lsquare\n\t{0x837c1552, 0x2172}, // threeroman\n\t{0x8388f2be, 0x00c9}, // Eacute\n\t{0x83a89a03, 0x045f}, // dzhecyrillic\n\t{0x83aeaef2, 0x1e23}, // hdotaccent\n\t{0x83c5c486, 0x05e7}, // afii57687\n\t{0x83cd4320, 0x0565}, // echarmenian\n\t{0x83e3c3a4, 0x3075}, // huhiragana\n\t{0x83f86a79, 0x339e}, // squarekm\n\t{0x83fc4077, 0x0037}, // seven\n\t{0x83fe9093, 0x0441}, // escyrillic\n\t{0x840c8507, 0x0313}, // commaabovecmb\n\t{0x8411d0c3, 0x1e3e}, // Macute\n\t{0x84132896, 0x0140}, // ldot\n\t{0x841d72ff, 0x02e4}, // glottalstopreversedsuperior\n\t{0x841d9ceb, 0x0572}, // ghadarmenian\n\t{0x8424a64d, 0x05b5}, // tserewidehebrew\n\t{0x843c7aca, 0x323f}, // ideographicallianceparen\n\t{0x8445bb28, 0x0905}, // adeva\n\t{0x8459e5f4, 0x2248}, // approxequal\n\t{0x84776c26, 0x329d}, // ideographicexcellentcircle\n\t{0x847d9b8a, 0x1ec5}, // ecircumflextilde\n\t{0x847ed2d4, 0x0540}, // Hoarmenian\n\t{0x8487ed37, 0x0621}, // hamzaarabic\n\t{0x848baa07, 0xfc5f}, // shaddakasratanarabic\n\t{0x8494dfda, 0x05b1}, // hatafsegol24\n\t{0x8498dbae, 0xfe86}, // wawhamzaabovefinalarabic\n\t{0x849b0297, 0x1e2e}, // Idieresisacute\n\t{0x84a67fee, 0x323a}, // ideographiccallparen\n\t{0x84b1d089, 0x0430}, // acyrillic\n\t{0x84de35f4, 0x0210}, // Rdblgrave\n\t{0x84e0b580, 0x04ef}, // umacroncyrillic\n\t{0x8501599a, 0x30f6}, // kesmallkatakana\n\t{0x85103d59, 0xfb39}, // yoddagesh\n\t{0x853a4f53, 0x217b}, // twelveroman\n\t{0x855c805d, 0xff1a}, // colonmonospace\n\t{0x856013c8, 0x248a}, // threeperiod\n\t{0x8567c154, 0x01bc}, // Tonefive\n\t{0x85a6c8bc, 0x310a}, // tbopomofo\n\t{0x85b41716, 0x201a}, // quotesinglbase\n\t{0x85b6b018, 0x2228}, // logicalor\n\t{0x85c83eb6, 0xff77}, // kikatakanahalfwidth\n\t{0x85ce16f4, 0x05da}, // afii57674\n\t{0x85e92466, 0x2282}, // propersubset\n\t{0x85ee23d7, 0x311b}, // obopomofo\n\t{0x85f325ac, 0x064c}, // dammatanaltonearabic\n\t{0x85f47ad1, 0x0660}, // zerohackarabic\n\t{0x85f89b18, 0x3049}, // osmallhiragana\n\t{0x86129c18, 0x2209}, // notelementof\n\t{0x861e8048, 0xff54}, // tmonospace\n\t{0x861ef200, 0x1e75}, // utildebelow\n\t{0x8654695b, 0x0020}, // spacehackarabic\n\t{0x865c7659, 0x0312}, // commaturnedabovecmb\n\t{0x8665f7ab, 0x201b}, // quotereversed\n\t{0x8686768e, 0x093e}, // aavowelsigndeva\n\t{0x8694e2ae, 0x3132}, // ssangkiyeokkorean\n\t{0x8699e716, 0x09ef}, // ninebengali\n\t{0x869fef4c, 0x064b}, // afii57451\n\t{0x86a662d1, 0x05e7}, // qofhebrew\n\t{0x86a80595, 0x0535}, // Echarmenian\n\t{0x86c2d4a4, 0x01ef}, // ezhcaron\n\t{0x86d0b880, 0x01c7}, // LJ\n\t{0x86d66230, 0x04ad}, // tedescendercyrillic\n\t{0x86e222a0, 0x05d9}, // yod\n\t{0x86eea6f9, 0x03a4}, // Tau\n\t{0x870315b6, 0x30e1}, // mekatakana\n\t{0x8713ac2f, 0xfb4b}, // vavholam\n\t{0x87634c8c, 0x05bd}, // siluqhebrew\n\t{0x877afbbb, 0xfb35}, // afii57723\n\t{0x877f7c7a, 0xfeb4}, // seenmedialarabic\n\t{0x8787b92b, 0x02c0}, // glottalstopmod\n\t{0x87a041c7, 0x0446}, // afii10088\n\t{0x87a4b30d, 0x263c}, // compass\n\t{0x87b6c8ba, 0x00c3}, // Atilde\n\t{0x87bb7ac5, 0x020b}, // iinvertedbreve\n\t{0x87e03b4f, 0x0642}, // afii57442\n\t{0x87e97d46, 0x04dd}, // zhedieresiscyrillic\n\t{0x87ef58ab, 0xfe30}, // twodotleadervertical\n\t{0x87fc47e5, 0x24d2}, // ccircle\n\t{0x88044bf5, 0x2167}, // Eightroman\n\t{0x880a9911, 0x1e34}, // Klinebelow\n\t{0x881905a5, 0x0e22}, // yoyakthai\n\t{0x881a4ba0, 0x0931}, // rradeva\n\t{0x88264250, 0x1e71}, // tcircumflexbelow\n\t{0x8826a561, 0x03cd}, // upsilontonos\n\t{0x883bae04, 0x248c}, // fiveperiod\n\t{0x8841d986, 0x30b8}, // zikatakana\n\t{0x8853f322, 0x339b}, // mumsquare\n\t{0x885dcb80, 0x00a7}, // section\n\t{0x886c5d13, 0x0636}, // dadarabic\n\t{0x8876a700, 0x1e98}, // wring\n\t{0x888833ba, 0x02e7}, // tonebarmidmod\n\t{0x888e1142, 0x026d}, // lhookretroflex\n\t{0x88a12621, 0x05d4}, // afii57668\n\t{0x88b6884b, 0x06f7}, // sevenpersian\n\t{0x88c2fc70, 0x0a6a}, // fourgurmukhi\n\t{0x88c96d26, 0xfb4a}, // tavdages\n\t{0x88cc32a3, 0x1ef6}, // Yhookabove\n\t{0x88da326f, 0x0546}, // Nowarmenian\n\t{0x88e4df33, 0x1e1b}, // etildebelow\n\t{0x88e6eee8, 0x3119}, // sbopomofo\n\t{0x88ea0124, 0x0949}, // ocandravowelsigndeva\n\t{0x88f38eed, 0x21d0}, // arrowdblleft\n\t{0x88f62270, 0x314f}, // akorean\n\t{0x88fdc1bb, 0x308e}, // wasmallhiragana\n\t{0x88fdcf2e, 0x039e}, // Xi\n\t{0x893a8f13, 0x09b9}, // habengali\n\t{0x89468742, 0x0e1f}, // fofanthai\n\t{0x897340ea, 0x3207}, // ieungparenkorean\n\t{0x897854cd, 0x060c}, // afii57388\n\t{0x897adc4f, 0x0128}, // Itilde\n\t{0x89aa67b7, 0x2161}, // Tworoman\n\t{0x89ace505, 0xff06}, // ampersandmonospace\n\t{0x89d8daae, 0x25c9}, // fisheye\n\t{0x89e05206, 0x0022}, // quotedbl\n\t{0x89e2c74b, 0x062d}, // afii57421\n\t{0x89ed1e17, 0x3171}, // kapyeounmieumkorean\n\t{0x89f4c981, 0x02dc}, // tilde\n\t{0x89f7042b, 0xfe38}, // bracerightvertical\n\t{0x89fc7dc4, 0x05bf}, // rafehebrew\n\t{0x8a1958e1, 0x03d1}, // theta1\n\t{0x8a27f623, 0x030e}, // dblverticallineabovecmb\n\t{0x8a36e0e0, 0x0a89}, // ugujarati\n\t{0x8a64ee32, 0x23a2}, // bracketleftex\n\t{0x8a743e71, 0x3279}, // thieuthacirclekorean\n\t{0x8a7ff438, 0x0632}, // zainarabic\n\t{0x8ab11ede, 0x0907}, // ideva\n\t{0x8ab50af4, 0xfedb}, // kafinitialarabic\n\t{0x8ac9c3df, 0x00cb}, // Edieresis\n\t{0x8ae82e18, 0x05c2}, // sindothebrew\n\t{0x8aebef01, 0x064f}, // afii57455\n\t{0x8af00e69, 0x3396}, // mlsquare\n\t{0x8af0299d, 0x2465}, // sixcircle\n\t{0x8af3a8ba, 0x1e55}, // pacute\n\t{0x8afdb385, 0x05b2}, // hatafpatahnarrowhebrew\n\t{0x8b04e879, 0x0573}, // cheharmenian\n\t{0x8b2ea84b, 0x045f}, // afii10193\n\t{0x8b336b03, 0x33c3}, // bqsquare\n\t{0x8b3d9ff3, 0x313a}, // rieulkiyeokkorean\n\t{0x8b46ba2c, 0x1e10}, // Dcedilla\n\t{0x8b5fbe71, 0x0209}, // idblgrave\n\t{0x8b6e36e5, 0x0001}, // controlSTX\n\t{0x8b91eefb, 0x0135}, // jcircumflex\n\t{0x8ba07e30, 0x3236}, // ideographicfinancialparen\n\t{0x8ba61ca6, 0x0170}, // Udblacute\n\t{0x8bb0c7c5, 0x04a4}, // Enghecyrillic\n\t{0x8bb9fe95, 0x1e35}, // klinebelow\n\t{0x8bc6e552, 0x027a}, // rlonglegturned\n\t{0x8bd60707, 0x33ce}, // squarekmcapital\n\t{0x8bdd4dfa, 0x05a1}, // pazerhebrew\n\t{0x8be0aeeb, 0x1e28}, // Hcedilla\n\t{0x8bf3f9ec, 0x0aed}, // sevengujarati\n\t{0x8bfc7ed2, 0x02e9}, // tonebarextralowmod\n\t{0x8c09cf1f, 0x0251}, // ascript\n\t{0x8c169f16, 0x0a4c}, // aumatragurmukhi\n\t{0x8c1a91ec, 0x1ed2}, // Ocircumflexgrave\n\t{0x8c21575a, 0x2175}, // sixroman\n\t{0x8c3dc32f, 0x0632}, // afii57426\n\t{0x8c5fd3c7, 0x05dd}, // afii57677\n\t{0x8c7614fd, 0x0046}, // F\n\t{0x8c789c98, 0x0255}, // ccurl\n\t{0x8c7eba77, 0x3114}, // chbopomofo\n\t{0x8c941f03, 0x0639}, // afii57433\n\t{0x8c9c3f66, 0x0e37}, // saraueethai\n\t{0x8cb6cb59, 0xfb6c}, // vehinitialarabic\n\t{0x8cbe2a76, 0x0951}, // udattadeva\n\t{0x8cc838c1, 0x099f}, // ttabengali\n\t{0x8ccab94e, 0x311d}, // ehbopomofo\n\t{0x8cd2ceac, 0x322f}, // ideographicearthparen\n\t{0x8cdd7a5e, 0xfefb}, // lamalefisolatedarabic\n\t{0x8cfeaaad, 0x04b4}, // Tetsecyrillic\n\t{0x8d0e3bcc, 0x0162}, // Tcommaaccent\n\t{0x8d15f0f9, 0x01d8}, // udieresisacute\n\t{0x8d17055f, 0xff23}, // Cmonospace\n\t{0x8d2183aa, 0x00ee}, // icircumflex\n\t{0x8d24b8c2, 0x0457}, // afii10104\n\t{0x8d262f6a, 0x33ad}, // radsquare\n\t{0x8d3bc051, 0x1eb1}, // abrevegrave\n\t{0x8d430411, 0x0288}, // tretroflexhook\n\t{0x8d4c7b99, 0x0473}, // afii10195\n\t{0x8d557bba, 0xfe98}, // tehmedialarabic\n\t{0x8d5ae6d4, 0x0440}, // ercyrillic\n\t{0x8d62c566, 0x21e0}, // arrowdashleft\n\t{0x8d7f2614, 0x2164}, // Fiveroman\n\t{0x8db3e76c, 0x1e97}, // tdieresis\n\t{0x8dbd6f57, 0xffe1}, // sterlingmonospace\n\t{0x8dc41abc, 0x1e33}, // kdotbelow\n\t{0x8de51633, 0x1ed7}, // ocircumflextilde\n\t{0x8df7afeb, 0x0968}, // twodeva\n\t{0x8e0d9fbd, 0x0337}, // solidusshortoverlaycmb\n\t{0x8e2538f6, 0x0420}, // Ercyrillic\n\t{0x8e325301, 0x0133}, // ij\n\t{0x8e3386c6, 0x0439}, // iishortcyrillic\n\t{0x8e360b54, 0x027d}, // rhook\n\t{0x8e40b292, 0x01fb}, // aringacute\n\t{0x8e467ab5, 0x1ecc}, // Odotbelow\n\t{0x8e474342, 0x1e2a}, // Hbrevebelow\n\t{0x8e5ae93f, 0x0909}, // udeva\n\t{0x8e5f575a, 0x0458}, // jecyrillic\n\t{0x8e5f7ac5, 0x01d2}, // ocaron\n\t{0x8e6f5aa1, 0x3074}, // pihiragana\n\t{0x8e757f60, 0x308a}, // rihiragana\n\t{0x8e7aa1b5, 0x207c}, // equalsuperior\n\t{0x8e8e0711, 0x042f}, // afii10049\n\t{0x8e91af6c, 0x3000}, // ideographicspace\n\t{0x8ec9ea4f, 0xfb40}, // nundagesh\n\t{0x8eca9ee8, 0x045c}, // kjecyrillic\n\t{0x8ed1765d, 0xff36}, // Vmonospace\n\t{0x8ed539a2, 0x278a}, // onecircleinversesansserif\n\t{0x8f084bdd, 0x3204}, // mieumparenkorean\n\t{0x8f19bc84, 0x0e4a}, // maitrithai\n\t{0x8f289d06, 0x0444}, // efcyrillic\n\t{0x8f28eae1, 0x013f}, // Ldotaccent\n\t{0x8f4b9c51, 0x0404}, // afii10053\n\t{0x8f505863, 0x04f2}, // Uhungarumlautcyrillic\n\t{0x8f52df2f, 0x0256}, // dtail\n\t{0x8f5e284f, 0xfed6}, // qaffinalarabic\n\t{0x8f760fbe, 0x25e5}, // blackupperrighttriangle\n\t{0x8f7f3f67, 0x0645}, // afii57445\n\t{0x8f89b56f, 0x05b8}, // qamatsqatanhebrew\n\t{0x8fa69b6c, 0x0331}, // macronbelowcmb\n\t{0x8fbba331, 0x0205}, // edblgrave\n\t{0x8fc968d8, 0x01b9}, // ezhreversed\n\t{0x8fce94ba, 0x0395}, // Epsilon\n\t{0x8fd18473, 0x2593}, // shadedark\n\t{0x8fe2c390, 0x0e53}, // threethai\n\t{0x8fe329b9, 0x266c}, // beamedsixteenthnotes\n\t{0x8fe85541, 0x0637}, // afii57431\n\t{0x8ff897b6, 0x0042}, // B\n\t{0x900e8281, 0x1e3b}, // llinebelow\n\t{0x900fb5c0, 0x0144}, // nacute\n\t{0x902443c2, 0xfe52}, // periodsmall\n\t{0x9024a760, 0x029d}, // jcrossedtail\n\t{0x90307534, 0x3059}, // suhiragana\n\t{0x9059f738, 0x00b7}, // middot\n\t{0x906746a4, 0xff75}, // okatakanahalfwidth\n\t{0x907d968c, 0x0a9b}, // chagujarati\n\t{0x90872973, 0x0538}, // Etarmenian\n\t{0x9098fbd4, 0x0002}, // controlSOT\n\t{0x90995fc1, 0x1e09}, // ccedillaacute\n\t{0x90a162b6, 0x05b4}, // hiriqwidehebrew\n\t{0x90b86ad8, 0x30dd}, // pokatakana\n\t{0x90b9c076, 0xff0f}, // slashmonospace\n\t{0x90c2be85, 0x0268}, // istroke\n\t{0x910a1b16, 0x03f1}, // rhosymbolgreek\n\t{0x9132f814, 0xff22}, // Bmonospace\n\t{0x9134ebbc, 0x01cb}, // Nj\n\t{0x913ff5ff, 0x3125}, // engbopomofo\n\t{0x9141d43c, 0x2126}, // Ohm\n\t{0x914ce494, 0x05e6}, // afii57686\n\t{0x9166eec8, 0x33ba}, // pwsquare\n\t{0x916cdeb8, 0xfed2}, // fehfinalarabic\n\t{0x917f2f3f, 0x0438}, // afii10074\n\t{0x9181b388, 0x01eb}, // oogonek\n\t{0x9184e24f, 0x30ab}, // kakatakana\n\t{0x919f5679, 0x00ca}, // Ecircumflex\n\t{0x91acc220, 0xff91}, // mukatakanahalfwidth\n\t{0x91accd4b, 0x0937}, // ssadeva\n\t{0x91c3e17e, 0x05f2}, // afii57718\n\t{0x91d99037, 0x1eb9}, // edotbelow\n\t{0x91de3939, 0x064f}, // dammalowarabic\n\t{0x91e65480, 0x0abf}, // ivowelsigngujarati\n\t{0x91eaac20, 0x3214}, // siosaparenkorean\n\t{0x920dae79, 0x039f}, // Omicron\n\t{0x9215b042, 0x3147}, // ieungkorean\n\t{0x9220d7f0, 0xff69}, // usmallkatakanahalfwidth\n\t{0x923767e3, 0x3133}, // kiyeoksioskorean\n\t{0x9239e7fb, 0x062b}, // theharabic\n\t{0x923bf3d0, 0x0330}, // tildebelowcmb\n\t{0x926b691e, 0x0100}, // Amacron\n\t{0x92aa52d3, 0x30fb}, // dotkatakana\n\t{0x92e2ffd9, 0x21e8}, // arrowrightwhite\n\t{0x92f283dc, 0x25d8}, // bulletinverse\n\t{0x92f96dbe, 0x1e56}, // Pdotaccent\n\t{0x930724f6, 0x06ba}, // noonghunnaarabic\n\t{0x930c1a0b, 0x001b}, // controlESC\n\t{0x932512ee, 0x03ea}, // Gangiacoptic\n\t{0x9330a2fc, 0x0336}, // strokelongoverlaycmb\n\t{0x934b1595, 0x062d}, // haharabic\n\t{0x93959445, 0x263a}, // smileface\n\t{0x939a56c4, 0x03ad}, // epsilontonos\n\t{0x939b5eb8, 0xfe92}, // behmedialarabic\n\t{0x93bca3b6, 0x099e}, // nyabengali\n\t{0x93e00dc4, 0x2193}, // arrowdown\n\t{0x93eef318, 0x0263}, // gammalatinsmall\n\t{0x9404d5fc, 0x33d5}, // squaremil\n\t{0x941a6b5f, 0x0a23}, // nnagurmukhi\n\t{0x941b20fa, 0xfe4b}, // overlinewavy\n\t{0x942ad1c7, 0x09be}, // aavowelsignbengali\n\t{0x9453959c, 0x24bd}, // Hcircle\n\t{0x9464bc2e, 0x1e66}, // Scarondotaccent\n\t{0x94724b66, 0x21bc}, // harpoonleftbarbup\n\t{0x94803386, 0x09d7}, // aulengthmarkbengali\n\t{0x948a9ce4, 0x05de}, // afii57678\n\t{0x949bc805, 0x01da}, // udieresiscaron\n\t{0x94ae0441, 0x0410}, // Acyrillic\n\t{0x94b7f6ea, 0x0463}, // yatcyrillic\n\t{0x94c36e74, 0x3261}, // nieuncirclekorean\n\t{0x94c9571f, 0x25ac}, // blackrectangle\n\t{0x94d13d1c, 0xfe39}, // tortoiseshellbracketleftvertical\n\t{0x94d74b96, 0x1e64}, // Sacutedotaccent\n\t{0x94e6f584, 0x3058}, // zihiragana\n\t{0x94ee5ae7, 0x2792}, // ninecircleinversesansserif\n\t{0x94f9a508, 0x3265}, // pieupcirclekorean\n\t{0x9518a20d, 0x30d9}, // bekatakana\n\t{0x951a0238, 0xfdf2}, // lamlamhehisolatedarabic\n\t{0x951ae869, 0x09dc}, // rrabengali\n\t{0x952cce64, 0x04ee}, // Umacroncyrillic\n\t{0x952ec009, 0x0988}, // iibengali\n\t{0x953a0a51, 0x2211}, // summation\n\t{0x954a8776, 0x03d1}, // thetasymbolgreek\n\t{0x95526ac8, 0x2500}, // SF100000\n\t{0x9559e176, 0x05b7}, // patah2a\n\t{0x955dbbe7, 0x23aa}, // braceex\n\t{0x957765bc, 0xfe8a}, // yehhamzaabovefinalarabic\n\t{0x958830cb, 0x2669}, // quarternote\n\t{0x9588e4f1, 0xff99}, // rukatakanahalfwidth\n\t{0x959cf6c1, 0x203b}, // referencemark\n\t{0x95af6475, 0x05e3}, // finalpehebrew\n\t{0x95aff05f, 0x03ca}, // iotadieresis\n\t{0x95b3bc07, 0xfb46}, // tsadidagesh\n\t{0x95bed968, 0x0e15}, // totaothai\n\t{0x95cabf3f, 0x21cf}, // arrowrightdblstroke\n\t{0x95d7e2f4, 0x0032}, // two\n\t{0x95ed768c, 0x05e0}, // nun\n\t{0x960140f0, 0x2496}, // fifteenperiod\n\t{0x961b2e15, 0x1e6f}, // tlinebelow\n\t{0x96220dd7, 0x318a}, // yuyeokorean\n\t{0x962b0c72, 0x3323}, // sentosquare\n\t{0x9638605a, 0x0669}, // ninearabic\n\t{0x967b01ac, 0x05b9}, // holamhebrew\n\t{0x967d0326, 0x3134}, // nieunkorean\n\t{0x96a5e022, 0x25d9}, // invcircle\n\t{0x96b677d5, 0x0153}, // oe\n\t{0x96c05d98, 0x01f2}, // Dz\n\t{0x96c1ab16, 0x247f}, // twelveparen\n\t{0x96d9cc68, 0x0427}, // Checyrillic\n\t{0x96fd8ec6, 0x1e7a}, // Umacrondieresis\n\t{0x9711eb31, 0x21aa}, // arrowhookleft\n\t{0x9741ad45, 0x05bf}, // rafe\n\t{0x975dc1dc, 0x32a5}, // ideographiccentrecircle\n\t{0x9776a4ba, 0x0007}, // controlBEL\n\t{0x977737b3, 0x0265}, // hturned\n\t{0x9778a35b, 0x0562}, // benarmenian\n\t{0x977e0dfa, 0x25d0}, // circlewithlefthalfblack\n\t{0x97843a2e, 0x09f8}, // denominatorminusonenumeratorbengali\n\t{0x978c8c89, 0x03ac}, // alphatonos\n\t{0x97ae16ea, 0x23a1}, // bracketlefttp\n\t{0x97b3e7db, 0x24c3}, // Ncircle\n\t{0x97e45478, 0x05b6}, // segol2c\n\t{0x97ea0cb5, 0x04d8}, // Schwacyrillic\n\t{0x97ebb44e, 0x015f}, // scedilla\n\t{0x97f03f9c, 0x0419}, // Iishortcyrillic\n\t{0x97f6721e, 0x05bf}, // afii57841\n\t{0x980e76a2, 0x1e32}, // Kdotbelow\n\t{0x98148d7b, 0xff14}, // fourmonospace\n\t{0x981fc90b, 0x0a1b}, // chagurmukhi\n\t{0x982585a7, 0x260e}, // telephoneblack\n\t{0x982718e0, 0x003c}, // less\n\t{0x982eb09a, 0x0e5b}, // khomutthai\n\t{0x9853033e, 0x04b5}, // tetsecyrillic\n\t{0x987e6d13, 0x0411}, // Becyrillic\n\t{0x9896e370, 0x0402}, // afii10051\n\t{0x98b02dc0, 0x0a48}, // aimatragurmukhi\n\t{0x98d74b1c, 0x01c8}, // Lj\n\t{0x98d9aba5, 0x03ae}, // etatonos\n\t{0x98eba766, 0x018b}, // Dtopbar\n\t{0x98f4783f, 0x24ac}, // qparen\n\t{0x98f4b751, 0x0651}, // afii57457\n\t{0x99104281, 0x02e5}, // tonebarextrahighmod\n\t{0x99235205, 0x05dc}, // lamedhebrew\n\t{0x994ebac3, 0x05c0}, // afii57842\n\t{0x99725844, 0x0320}, // minusbelowcmb\n\t{0x9982855c, 0x0686}, // afii57507\n\t{0x99830dc7, 0x062c}, // afii57420\n\t{0x99863852, 0x03ed}, // shimacoptic\n\t{0x99997c4f, 0x3314}, // kirosquare\n\t{0x999c619c, 0x3078}, // hehiragana\n\t{0x999f4db4, 0x05b4}, // afii57793\n\t{0x99cca883, 0xff04}, // dollarmonospace\n\t{0x99e63f81, 0x0962}, // lvocalicvowelsigndeva\n\t{0x9a069ea3, 0x2267}, // greateroverequal\n\t{0x9a098276, 0xfea2}, // hahfinalarabic\n\t{0x9a157ece, 0x246a}, // elevencircle\n\t{0x9a1c929d, 0x043c}, // afii10078\n\t{0x9a310f17, 0xff51}, // qmonospace\n\t{0x9a3391f5, 0x0190}, // Eopen\n\t{0x9a464a33, 0x0174}, // Wcircumflex\n\t{0x9a50ec2e, 0x05b6}, // segolquarterhebrew\n\t{0x9a7aab21, 0x05c3}, // sofpasuqhebrew\n\t{0x9ac6c137, 0x0e0f}, // topatakthai\n\t{0x9aea680b, 0x3029}, // ninehangzhou\n\t{0x9af6d63b, 0x054a}, // Peharmenian\n\t{0x9b09b61d, 0x0a10}, // aigurmukhi\n\t{0x9b0db21d, 0x0402}, // Djecyrillic\n\t{0x9b100042, 0x0e21}, // momathai\n\t{0x9b29e68e, 0x0278}, // philatin\n\t{0x9b3ff954, 0x0e56}, // sixthai\n\t{0x9b5a3eb3, 0x0626}, // afii57414\n\t{0x9b712e01, 0x1eba}, // Ehookabove\n\t{0x9b73811a, 0x2227}, // logicaland\n\t{0x9b76648b, 0x041f}, // afii10033\n\t{0x9b7712b3, 0x1e5a}, // Rdotbelow\n\t{0x9b8591a5, 0x30ca}, // nakatakana\n\t{0x9b950b60, 0x095e}, // fadeva\n\t{0x9ba02025, 0x01e9}, // kcaron\n\t{0x9bca0720, 0x1e93}, // zdotbelow\n\t{0x9bcccde6, 0x0e4e}, // yamakkanthai\n\t{0x9bd59a36, 0x300e}, // whitecornerbracketleft\n\t{0x9bdb98a4, 0x1e5e}, // Rlinebelow\n\t{0x9be54046, 0x0e0a}, // chochangthai\n\t{0x9bfe067d, 0x0405}, // Dzecyrillic\n\t{0x9c14c866, 0x0484}, // palatalizationcyrilliccmb\n\t{0x9c1ff986, 0x05f1}, // afii57717\n\t{0x9c30e64e, 0x0121}, // gdot\n\t{0x9c3d076c, 0x002d}, // hyphen\n\t{0x9c5df589, 0x03b2}, // beta\n\t{0x9c5e488c, 0x05d3}, // dalethebrew\n\t{0x9c743ddb, 0x3239}, // ideographicrepresentparen\n\t{0x9cc9b890, 0x2a00}, // circledottext\n\t{0x9cd2074a, 0x0a36}, // shagurmukhi\n\t{0x9ce0dacf, 0xfebb}, // sadinitialarabic\n\t{0x9ce3d2fe, 0x06d2}, // afii57519\n\t{0x9ce9cdfc, 0x0408}, // Jecyrillic\n\t{0x9ce9f027, 0x0426}, // Tsecyrillic\n\t{0x9cf54095, 0x20aa}, // newsheqelsign\n\t{0x9d1b1141, 0x25d8}, // invbullet\n\t{0x9d1ed2c0, 0x0120}, // Gdotaccent\n\t{0x9d25f804, 0x0294}, // glottalstop\n\t{0x9d3a5187, 0x03bb}, // lambda\n\t{0x9d4507ca, 0x00a0}, // nonbreakingspace\n\t{0x9d4ea24d, 0x045a}, // njecyrillic\n\t{0x9d5ba323, 0x3145}, // sioskorean\n\t{0x9d5eb9a4, 0x001f}, // controlUS\n\t{0x9d662219, 0x332a}, // haitusquare\n\t{0x9d760ad7, 0x3318}, // guramusquare\n\t{0x9d770652, 0x1e2b}, // hbrevebelow\n\t{0x9db9ebc8, 0x30ba}, // zukatakana\n\t{0x9dee7277, 0x2015}, // afii00208\n\t{0x9df531bb, 0x059b}, // tevirhebrew\n\t{0x9e021469, 0x22cf}, // curlyand\n\t{0x9e062707, 0x02a2}, // glottalstopstrokereversed\n\t{0x9e0bf218, 0x02b1}, // hhooksuperior\n\t{0x9e0d1458, 0x02c4}, // arrowheadupmod\n\t{0x9e1247f8, 0x0033}, // three\n\t{0x9e248728, 0x3053}, // kohiragana\n\t{0x9e2d5a68, 0x053f}, // Kenarmenian\n\t{0x9e5de325, 0x222e}, // contourintegral\n\t{0x9e65e800, 0x248b}, // fourperiod\n\t{0x9e98d52c, 0x2483}, // sixteenparen\n\t{0x9ea14168, 0x05b7}, // patahquarterhebrew\n\t{0x9ea23fe1, 0x00f1}, // ntilde\n\t{0x9eac193b, 0x00ef}, // idieresis\n\t{0x9eb5aea3, 0x3142}, // pieupkorean\n\t{0x9ebea1a0, 0x3150}, // aekorean\n\t{0x9ee7bbd1, 0x094b}, // ovowelsigndeva\n\t{0x9eedaba9, 0x0113}, // emacron\n\t{0x9f023815, 0x20ac}, // euro\n\t{0x9f30fc87, 0xfec2}, // tahfinalarabic\n\t{0x9f37894c, 0x040e}, // afii10062\n\t{0x9f53036c, 0x0a19}, // ngagurmukhi\n\t{0x9f65cf71, 0x1e25}, // hdotbelow\n\t{0x9f69147e, 0x1e61}, // sdotaccent\n\t{0x9f6f9105, 0x0433}, // gecyrillic\n\t{0x9f739695, 0x04f9}, // yerudieresiscyrillic\n\t{0x9f79f6eb, 0xfb33}, // daletdageshhebrew\n\t{0x9f8cff14, 0x003e}, // greater\n\t{0x9f94b2e4, 0x04a1}, // kabashkircyrillic\n\t{0x9fa5f7ad, 0x0e49}, // maithothai\n\t{0x9fc7ffac, 0x05b4}, // hiriqhebrew\n\t{0x9fd406b1, 0xfed8}, // qafmedialarabic\n\t{0x9fd7c50e, 0x05bb}, // afii57796\n\t{0x9fdfc7a1, 0x00b0}, // degree\n\t{0x9ffeaad9, 0x01ed}, // oogonekmacron\n\t{0xa0144bc6, 0xfc8d}, // noonnoonfinalarabic\n\t{0xa0166e3d, 0x3159}, // waekorean\n\t{0xa016fb2d, 0x016b}, // umacron\n\t{0xa0286aa8, 0x1e04}, // Bdotbelow\n\t{0xa03db58b, 0x02d2}, // ringhalfrightcentered\n\t{0xa05ccf71, 0x05e1}, // samekhhebrew\n\t{0xa069fd2d, 0x012b}, // imacron\n\t{0xa08ca5a7, 0x2491}, // tenperiod\n\t{0xa0a317f9, 0x0574}, // menarmenian\n\t{0xa0c2ffe3, 0x247a}, // sevenparen\n\t{0xa0e40fac, 0x337b}, // heiseierasquare\n\t{0xa0e487b8, 0x33cd}, // KKsquare\n\t{0xa0ee672b, 0x3143}, // ssangpieupkorean\n\t{0xa100bc11, 0x043e}, // ocyrillic\n\t{0xa10462a8, 0x0394}, // Deltagreek\n\t{0xa11f6f39, 0x0071}, // q\n\t{0xa12507ea, 0x2177}, // eightroman\n\t{0xa12d2230, 0x05b5}, // tsere2b\n\t{0xa134a191, 0xff11}, // onemonospace\n\t{0xa14f5367, 0x05b0}, // sheva15\n\t{0xa157c7c6, 0x0643}, // kafarabic\n\t{0xa15811a3, 0x061f}, // questionarabic\n\t{0xa1697005, 0x0015}, // controlNAK\n\t{0xa16fa8a4, 0x22a3}, // tackleft\n\t{0xa1703e0a, 0x3219}, // thieuthaparenkorean\n\t{0xa1850262, 0x05c2}, // afii57803\n\t{0xa1a14a63, 0x1eb8}, // Edotbelow\n\t{0xa1ed89db, 0x0202}, // Ainvertedbreve\n\t{0xa20cadbf, 0x0062}, // b\n\t{0xa20ea9da, 0x24aa}, // oparen\n\t{0xa212ed2d, 0x0e38}, // sarauthai\n\t{0xa2448aa1, 0x01e6}, // Gcaron\n\t{0xa2543878, 0x326f}, // nieunacirclekorean\n\t{0xa254ebdd, 0xfb3e}, // memdagesh\n\t{0xa259bfe7, 0xff19}, // ninemonospace\n\t{0xa262edc1, 0xfe49}, // overlinedashed\n\t{0xa26bc10f, 0x061b}, // semicolonarabic\n\t{0xa27876ee, 0xfe35}, // parenleftvertical\n\t{0xa28a5f58, 0xfec8}, // zahmedialarabic\n\t{0xa28ba8ac, 0x317d}, // siospieupkorean\n\t{0xa2972ad9, 0x2305}, // projective\n\t{0xa2be0dd9, 0x062b}, // afii57419\n\t{0xa2c2120e, 0x0e52}, // twothai\n\t{0xa2d967e3, 0x2083}, // threeinferior\n\t{0xa2e1fb7a, 0x221e}, // infinity\n\t{0xa2f62d95, 0x306e}, // nohiragana\n\t{0xa3004c6f, 0x092e}, // madeva\n\t{0xa316ccc6, 0x2044}, // fraction\n\t{0xa32a4538, 0xfb1f}, // afii57705\n\t{0xa334b2d1, 0x043d}, // afii10079\n\t{0xa34b5d2f, 0x0e57}, // seventhai\n\t{0xa36dbdee, 0x30db}, // hokatakana\n\t{0xa386d6fe, 0x3327}, // tonsquare\n\t{0xa3903917, 0x3270}, // tikeutacirclekorean\n\t{0xa39b2570, 0xfefc}, // lamaleffinalarabic\n\t{0xa3b51a89, 0x0597}, // reviamugrashhebrew\n\t{0xa3cc74fa, 0x3056}, // zahiragana\n\t{0xa3d9a90d, 0x0499}, // zedescendercyrillic\n\t{0xa3e95215, 0xfef9}, // lamalefhamzabelowisolatedarabic\n\t{0xa3ec709c, 0x0569}, // toarmenian\n\t{0xa3fbf1d9, 0x0497}, // zhedescendercyrillic\n\t{0xa3fe88d1, 0x0104}, // Aogonek\n\t{0xa40369ed, 0x32a9}, // ideographicmedicinecircle\n\t{0xa4259ac9, 0xff76}, // kakatakanahalfwidth\n\t{0xa43cdc2e, 0xfb44}, // pedageshhebrew\n\t{0xa446d45f, 0x3224}, // fiveideographicparen\n\t{0xa450f946, 0x0454}, // afii10101\n\t{0xa456f11e, 0x09e8}, // twobengali\n\t{0xa457c062, 0x30ad}, // kikatakana\n\t{0xa45b3183, 0x0aeb}, // fivegujarati\n\t{0xa45b7f21, 0x010e}, // Dcaron\n\t{0xa4627c0f, 0x0204}, // Edblgrave\n\t{0xa478f921, 0x09e0}, // rrvocalicbengali\n\t{0xa4863185, 0x30f4}, // vukatakana\n\t{0xa4922e7c, 0x0341}, // acutetonecmb\n\t{0xa4aa1092, 0x05b1}, // hatafsegol30\n\t{0xa4aa8935, 0xff58}, // xmonospace\n\t{0xa4af8f73, 0x2282}, // subset\n\t{0xa4decb10, 0x0a72}, // irigurmukhi\n\t{0xa50a3a99, 0x0630}, // afii57424\n\t{0xa50cf621, 0xff7e}, // sekatakanahalfwidth\n\t{0xa512e58d, 0xff83}, // tekatakanahalfwidth\n\t{0xa517b724, 0xfee6}, // noonfinalarabic\n\t{0xa52168e0, 0x2325}, // option\n\t{0xa54253fb, 0x05e7}, // qof\n\t{0xa545c2a6, 0xfb2a}, // afii57694\n\t{0xa553cf3e, 0x003b}, // semicolon\n\t{0xa56dfce7, 0x0e03}, // khokhuatthai\n\t{0xa58382dd, 0x0137}, // kcedilla\n\t{0xa5b93826, 0x2555}, // SF220000\n\t{0xa5ecbdaa, 0x03b5}, // epsilon\n\t{0xa6056425, 0x05b8}, // qamatswidehebrew\n\t{0xa60745ee, 0x2250}, // approaches\n\t{0xa6281f81, 0x0142}, // lslash\n\t{0xa62afc92, 0x0534}, // Daarmenian\n\t{0xa6454b66, 0x2498}, // seventeenperiod\n\t{0xa64723d6, 0x30af}, // kukatakana\n\t{0xa6522894, 0x24da}, // kcircle\n\t{0xa652cff2, 0x24a8}, // mparen\n\t{0xa65ca284, 0x314d}, // phieuphkorean\n\t{0xa65ea7b9, 0x00ab}, // guillemotleft\n\t{0xa6644796, 0xfc94}, // yehnoonfinalarabic\n\t{0xa66b3ab3, 0x00b8}, // cedilla\n\t{0xa675e0d6, 0x0156}, // Rcommaaccent\n\t{0xa683217b, 0x0ab7}, // ssagujarati\n\t{0xa6a017fd, 0x0415}, // Iecyrillic\n\t{0xa6ae34a8, 0x3028}, // eighthangzhou\n\t{0xa6b19efc, 0x0591}, // etnahtafoukhhebrew\n\t{0xa6b46028, 0xff72}, // ikatakanahalfwidth\n\t{0xa6bd2b95, 0x1e6b}, // tdotaccent\n\t{0xa6c10839, 0x0431}, // becyrillic\n\t{0xa6e68e9f, 0x0966}, // zerodeva\n\t{0xa6f16c03, 0x03c2}, // sigma1\n\t{0xa6f2df0d, 0x0a32}, // lagurmukhi\n\t{0xa716a470, 0x2464}, // fivecircle\n\t{0xa71dfe13, 0x1ea2}, // Ahookabove\n\t{0xa73026ce, 0x007a}, // z\n\t{0xa73199c0, 0x05bb}, // qubutshebrew\n\t{0xa731e944, 0x0411}, // afii10018\n\t{0xa7320cb3, 0x3139}, // rieulkorean\n\t{0xa74014fc, 0x003f}, // question\n\t{0xa745be27, 0x2308}, // ceilingleftbig\n\t{0xa74cd67a, 0x025f}, // jdotlessstroke\n\t{0xa756caf5, 0x04d2}, // Adieresiscyrillic\n\t{0xa7769b7a, 0x22c1}, // logicalortext\n\t{0xa7895d88, 0x252c}, // SF060000\n\t{0xa796d5bb, 0x0267}, // henghook\n\t{0xa7bff3d5, 0x032c}, // caronbelowcmb\n\t{0xa7dcd836, 0xfb68}, // ttehinitialarabic\n\t{0xa7e01c26, 0x01a7}, // Tonetwo\n\t{0xa7e7d702, 0x05b8}, // qamats1a\n\t{0xa7edca33, 0x25b7}, // whiterightpointingtriangle\n\t{0xa7fb6ee6, 0x226f}, // notgreater\n\t{0xa7fe97d8, 0x3166}, // nieuntikeutkorean\n\t{0xa815fa8a, 0x309e}, // voicediterationhiragana\n\t{0xa819fe3e, 0x315e}, // wekorean\n\t{0xa81ee743, 0x0542}, // Ghadarmenian\n\t{0xa826b713, 0xfeb6}, // sheenfinalarabic\n\t{0xa842618b, 0x025b}, // eopen\n\t{0xa84fdde5, 0x0340}, // gravetonecmb\n\t{0xa851c76f, 0x05a5}, // merkhahebrew\n\t{0xa8547bdd, 0x0455}, // afii10102\n\t{0xa8665e8d, 0x05b1}, // afii57801\n\t{0xa877e561, 0x2642}, // male\n\t{0xa8982f3b, 0x09b2}, // labengali\n\t{0xa8a24959, 0x00d0}, // Eth\n\t{0xa8b6c7f5, 0x0a2e}, // magurmukhi\n\t{0xa8b7f35e, 0x06c1}, // haaltonearabic\n\t{0xa8bb13d5, 0x0a70}, // tippigurmukhi\n\t{0xa8ccc65c, 0x3316}, // kiromeetorusquare\n\t{0xa8db2b93, 0x017e}, // zcaron\n\t{0xa93204a5, 0x03a6}, // Phi\n\t{0xa9350b3f, 0x20a1}, // colonmonetary\n\t{0xa93a2a4f, 0x1e47}, // ndotbelow\n\t{0xa94e0303, 0x33ab}, // mpasquare\n\t{0xa94eeaee, 0x01aa}, // eshreversedloop\n\t{0xa95e2711, 0x1e21}, // gmacron\n\t{0xa96cef91, 0x3169}, // rieulkiyeoksioskorean\n\t{0xa981562d, 0x0668}, // eightarabic\n\t{0xa98e771c, 0x0634}, // sheenarabic\n\t{0xa9985803, 0x30dc}, // bokatakana\n\t{0xa99c94c2, 0x01be}, // glottalinvertedstroke\n\t{0xa9a0932f, 0x2077}, // sevensuperior\n\t{0xa9af18f2, 0x30b4}, // gokatakana\n\t{0xa9c0b182, 0x2264}, // lessequal\n\t{0xaa13efde, 0x007d}, // braceright\n\t{0xaa4e278b, 0x0967}, // onedeva\n\t{0xaa51d75f, 0x2476}, // threeparen\n\t{0xaa69d0f1, 0x256c}, // SF440000\n\t{0xaa863ce3, 0x0629}, // tehmarbutaarabic\n\t{0xaa8c5eeb, 0x03e5}, // feicoptic\n\t{0xaa96b9dc, 0x0665}, // fivearabic\n\t{0xaaabcf5c, 0x04b9}, // cheverticalstrokecyrillic\n\t{0xaab6b9a5, 0x0211}, // rdblgrave\n\t{0xaabfed05, 0xff85}, // nakatakanahalfwidth\n\t{0xaac3a76a, 0x0559}, // ringhalfleftarmenian\n\t{0xaac3adf0, 0x3121}, // oubopomofo\n\t{0xaacaffc4, 0x2162}, // Threeroman\n\t{0xaad54f7c, 0x3002}, // ideographicperiod\n\t{0xaaf6eb21, 0x01ce}, // acaron\n\t{0xab0b499a, 0x099c}, // jabengali\n\t{0xab126f69, 0x5344}, // twentyhangzhou\n\t{0xab1f1bb7, 0x05df}, // afii57679\n\t{0xab24577f, 0x0667}, // sevenarabic\n\t{0xab2b4200, 0x2105}, // careof\n\t{0xab3b4b27, 0x24e2}, // scircle\n\t{0xab808d1e, 0x2087}, // seveninferior\n\t{0xab8a6656, 0x01d0}, // icaron\n\t{0xaba55a59, 0xfb32}, // gimeldageshhebrew\n\t{0xabb7eb8f, 0x2081}, // oneinferior\n\t{0xabd373e8, 0x055e}, // questionarmenian\n\t{0xac05d874, 0x1e84}, // Wdieresis\n\t{0xac259f58, 0x0448}, // afii10090\n\t{0xac2c323e, 0x0191}, // Fhook\n\t{0xac32a034, 0x316f}, // mieumsioskorean\n\t{0xac483cb3, 0x338c}, // mufsquare\n\t{0xac4f1094, 0x059c}, // gereshaccenthebrew\n\t{0xac50a082, 0x33a3}, // mmcubedsquare\n\t{0xac5faca7, 0x230b}, // floorrightbig\n\t{0xac67aca2, 0x045b}, // tshecyrillic\n\t{0xacb92bab, 0x0691}, // rreharabic\n\t{0xacd00f05, 0x21c6}, // arrowleftoverright\n\t{0xacd11e18, 0x2010}, // hyphentwo\n\t{0xace7d07a, 0x0921}, // ddadeva\n\t{0xacfcbdb9, 0x3042}, // ahiragana\n\t{0xad01f787, 0xff1d}, // equalmonospace\n\t{0xad1b58f9, 0x0595}, // zaqefgadolhebrew\n\t{0xad29738f, 0x05f4}, // gershayimhebrew\n\t{0xad33f4b3, 0x04c1}, // Zhebrevecyrillic\n\t{0xad37f8e0, 0x0a24}, // tagurmukhi\n\t{0xad38bc31, 0x2194}, // arrowboth\n\t{0xad5fe438, 0x0924}, // tadeva\n\t{0xad781e89, 0x200c}, // afii61664\n\t{0xad8ff38a, 0x0a21}, // ddagurmukhi\n\t{0xadb1b19e, 0x0206}, // Einvertedbreve\n\t{0xadb53f6b, 0xfbaf}, // yehbarreefinalarabic\n\t{0xadbea3e4, 0x20aa}, // afii57636\n\t{0xadc3ff5e, 0x0649}, // afii57449\n\t{0xadf402a9, 0x0989}, // ubengali\n\t{0xadf4d422, 0x0625}, // alefhamzabelowarabic\n\t{0xae04e5ad, 0x0a15}, // kagurmukhi\n\t{0xae1f7b0a, 0x2076}, // sixsuperior\n\t{0xae23dd7b, 0x1eaf}, // abreveacute\n\t{0xae30147f, 0x0908}, // iideva\n\t{0xae56317c, 0x24ae}, // sparen\n\t{0xae6f7e74, 0x031b}, // horncmb\n\t{0xae7c975f, 0x249a}, // nineteenperiod\n\t{0xae8f4e4c, 0x0406}, // afii10055\n\t{0xaeb06274, 0x0423}, // Ucyrillic\n\t{0xaec173e8, 0x03b8}, // theta\n\t{0xaee16fb6, 0xfe4f}, // underscorewavy\n\t{0xaef4b475, 0x1edf}, // ohornhookabove\n\t{0xaef8393d, 0x0664}, // fourarabic\n\t{0xaf01f370, 0x278e}, // fivecircleinversesansserif\n\t{0xaf2073fd, 0x2103}, // centigrade\n\t{0xaf3552ce, 0x3072}, // hihiragana\n\t{0xaf36c6b1, 0x30cd}, // nekatakana\n\t{0xaf4df0df, 0xfc0e}, // tehmeemisolatedarabic\n\t{0xaf5710c9, 0x00c0}, // Agrave\n\t{0xaf5b123d, 0x032d}, // circumflexbelowcmb\n\t{0xaf5ce08f, 0x00e0}, // agrave\n\t{0xaf788850, 0x00fc}, // udieresis\n\t{0xaf7abcb1, 0x05b9}, // holam\n\t{0xaf8a8524, 0x0455}, // dzecyrillic\n\t{0xafa14924, 0x33d3}, // lxsquare\n\t{0xafaa365c, 0x30be}, // zokatakana\n\t{0xafb28009, 0x03e2}, // Sheicoptic\n\t{0xafb8e89a, 0x0a68}, // twogurmukhi\n\t{0xafbbfcac, 0xff71}, // akatakanahalfwidth\n\t{0xafbd0738, 0x305d}, // sohiragana\n\t{0xafc9b657, 0x0e17}, // thothahanthai\n\t{0xb000150a, 0xfe96}, // tehfinalarabic\n\t{0xb01f8020, 0x0666}, // sixarabic\n\t{0xb026a3ef, 0x30b3}, // kokatakana\n\t{0xb0309f24, 0xfee3}, // meeminitialarabic\n\t{0xb032be97, 0x047b}, // omegaroundcyrillic\n\t{0xb033a837, 0x0079}, // y\n\t{0xb03640f2, 0x2252}, // approxequalorimage\n\t{0xb0522c01, 0x278f}, // sixcircleinversesansserif\n\t{0xb0791aaf, 0x09f3}, // rupeesignbengali\n\t{0xb0a20aff, 0x22db}, // greaterequalorless\n\t{0xb0c33454, 0x028a}, // upsilonlatin\n\t{0xb0efaba6, 0x0a97}, // gagujarati\n\t{0xb107bdf6, 0x304b}, // kahiragana\n\t{0xb1240d86, 0x0474}, // afii10148\n\t{0xb145d406, 0x327b}, // hieuhacirclekorean\n\t{0xb169c9ac, 0x1eed}, // uhornhookabove\n\t{0xb1722e49, 0x3006}, // ideographicclose\n\t{0xb199f9f3, 0x314a}, // chieuchkorean\n\t{0xb1a83745, 0x246e}, // fifteencircle\n\t{0xb1a9eaa4, 0x1eb7}, // abrevedotbelow\n\t{0xb1b08c26, 0x2020}, // dagger\n\t{0xb1b2e578, 0xff13}, // threemonospace\n\t{0xb1c3eac2, 0x1e8c}, // Xdieresis\n\t{0xb1e18633, 0x0e2d}, // oangthai\n\t{0xb1eda93c, 0x09e2}, // lvocalicvowelsignbengali\n\t{0xb1fa6226, 0x0a9a}, // cagujarati\n\t{0xb225a8bc, 0x0947}, // evowelsigndeva\n\t{0xb243894e, 0x21d1}, // arrowdblup\n\t{0xb25639c1, 0x2534}, // SF070000\n\t{0xb2566e08, 0x064d}, // afii57453\n\t{0xb256786e, 0x03f2}, // sigmalunatesymbolgreek\n\t{0xb25b34dc, 0x0e1a}, // bobaimaithai\n\t{0xb26943db, 0x0420}, // afii10034\n\t{0xb27e91f4, 0x01bb}, // twostroke\n\t{0xb27fe618, 0xfb03}, // f_f_i\n\t{0xb290d64a, 0xfe88}, // alefhamzabelowfinalarabic\n\t{0xb2bbd0d4, 0xfeb0}, // zainfinalarabic\n\t{0xb2cc02c2, 0x1e38}, // Ldotbelowmacron\n\t{0xb2d79f3e, 0x00f9}, // ugrave\n\t{0xb2d7f27b, 0x0652}, // afii57458\n\t{0xb2d95c63, 0x2518}, // SF040000\n\t{0xb2f3aff0, 0x0946}, // eshortvowelsigndeva\n\t{0xb3178333, 0x00da}, // Uacute\n\t{0xb321fe9c, 0x21e3}, // arrowdashdown\n\t{0xb3329e90, 0x313e}, // rieulthieuthkorean\n\t{0xb33c41bc, 0x018c}, // dtopbar\n\t{0xb340e2fe, 0x04a5}, // enghecyrillic\n\t{0xb341da2f, 0x1e36}, // Ldotbelow\n\t{0xb345c512, 0xfea4}, // hahmedialarabic\n\t{0xb369c9bd, 0x2423}, // blank\n\t{0xb36f3f4e, 0x054d}, // Seharmenian\n\t{0xb3880287, 0x05d6}, // zayinhebrew\n\t{0xb38b59bc, 0x0ac0}, // iivowelsigngujarati\n\t{0xb3a3592e, 0x21e5}, // arrowtabright\n\t{0xb3dbcf55, 0x323d}, // ideographicenterpriseparen\n\t{0xb3e6b497, 0x03c9}, // omega\n\t{0xb3ed41be, 0x328f}, // ideographearthcircle\n\t{0xb3f4ae6c, 0x1e9e}, // germandblS\n\t{0xb40169ac, 0x05b0}, // sheva22\n\t{0xb405e3e3, 0x0439}, // afii10075\n\t{0xb41baecc, 0x2487}, // twentyparen\n\t{0xb427632e, 0x05b3}, // hatafqamats1b\n\t{0xb4344c30, 0x090f}, // edeva\n\t{0xb43bb55a, 0x3263}, // rieulcirclekorean\n\t{0xb448d464, 0x0391}, // Alpha\n\t{0xb457e11d, 0xfb00}, // f_f\n\t{0xb45a5763, 0x201b}, // quoteleftreversed\n\t{0xb45ef9b7, 0x03c0}, // pi\n\t{0xb497903a, 0x01dd}, // eturned\n\t{0xb4a55071, 0x1e7d}, // vtilde\n\t{0xb4a6b289, 0x2235}, // because\n\t{0xb4a7f99d, 0x0954}, // acutedeva\n\t{0xb4a9d27d, 0x05d2}, // afii57666\n\t{0xb4c0dc86, 0x0e48}, // maiekthai\n\t{0xb4c2484c, 0x05dc}, // lamed\n\t{0xb4c667bc, 0xff61}, // periodhalfwidth\n\t{0xb4c72b2a, 0x0215}, // udblgrave\n\t{0xb4e21f31, 0x2198}, // arrowdownright\n\t{0xb500deca, 0x1e41}, // mdotaccent\n\t{0xb510d684, 0x1e80}, // Wgrave\n\t{0xb526b685, 0x22bf}, // righttriangle\n\t{0xb52e7c1d, 0x091e}, // nyadeva\n\t{0xb53ca7e2, 0x326c}, // phieuphcirclekorean\n\t{0xb58e59d7, 0x24ad}, // rparen\n\t{0xb5af274f, 0x064a}, // afii57450\n\t{0xb5b94593, 0x010d}, // ccaron\n\t{0xb5c458a3, 0x05b8}, // qamatsqatanwidehebrew\n\t{0xb5f24e31, 0xff5a}, // zmonospace\n\t{0xb600bed1, 0x3024}, // fourhangzhou\n\t{0xb6052cdb, 0x010b}, // cdotaccent\n\t{0xb61c54b4, 0x24e4}, // ucircle\n\t{0xb64312f2, 0x00a2}, // cent\n\t{0xb6443d26, 0x0622}, // afii57410\n\t{0xb647ed9e, 0x01d7}, // Udieresisacute\n\t{0xb652184e, 0x0e4b}, // maichattawathai\n\t{0xb6588f1c, 0x247c}, // nineparen\n\t{0xb66bf9b9, 0x33dc}, // svsquare\n\t{0xb673fbb5, 0x038e}, // Upsilontonos\n\t{0xb67e35c8, 0x0121}, // gdotaccent\n\t{0xb6bb2a6b, 0x0116}, // Edot\n\t{0xb6d45c54, 0xff7a}, // kokatakanahalfwidth\n\t{0xb6f322b3, 0x05e5}, // afii57685\n\t{0xb6f9554e, 0x3205}, // pieupparenkorean\n\t{0xb6f9c67c, 0x0464}, // Eiotifiedcyrillic\n\t{0xb6fea9e7, 0xff3f}, // underscoremonospace\n\t{0xb70f3f60, 0xff4e}, // nmonospace\n\t{0xb711b601, 0x039d}, // Nu\n\t{0xb719922a, 0x067e}, // afii57506\n\t{0xb71d84e2, 0x3167}, // nieunsioskorean\n\t{0xb726c42e, 0xfb49}, // shindageshhebrew\n\t{0xb72e5846, 0x1edb}, // ohornacute\n\t{0xb73606f5, 0x0463}, // afii10194\n\t{0xb7400632, 0x33aa}, // kpasquare\n\t{0xb747ebc8, 0x2310}, // revlogicalnot\n\t{0xb755a24e, 0x310e}, // kbopomofo\n\t{0xb7934eea, 0x01c5}, // Dzcaron\n\t{0xb7affc1f, 0x0418}, // afii10026\n\t{0xb7b78fdd, 0x2463}, // fourcircle\n\t{0xb7bd89d3, 0x0491}, // gheupturncyrillic\n\t{0xb7d20c6c, 0x215c}, // threeeighths\n\t{0xb7e9bb2b, 0x30fe}, // voicediterationkatakana\n\t{0xb80991a9, 0x04d6}, // Iebrevecyrillic\n\t{0xb81d8e8c, 0xfb31}, // betdagesh\n\t{0xb855cda8, 0x3397}, // dlsquare\n\t{0xb85a6427, 0x0650}, // kasraarabic\n\t{0xb8632720, 0x0e07}, // ngonguthai\n\t{0xb879d78f, 0xfe32}, // endashvertical\n\t{0xb894f4d6, 0x01a0}, // Ohorn\n\t{0xb8972176, 0x04bb}, // shhacyrillic\n\t{0xb89948ac, 0x0a93}, // ogujarati\n\t{0xb8be7e03, 0x2039}, // guilsinglleft\n\t{0xb8fa96e6, 0x0110}, // Dslash\n\t{0xb8ff412c, 0xfef8}, // lamalefhamzaabovefinalarabic\n\t{0xb902d285, 0x053a}, // Zhearmenian\n\t{0xb90dcf8c, 0xff6a}, // esmallkatakanahalfwidth\n\t{0xb910864a, 0x2032}, // minute\n\t{0xb921c241, 0xfeca}, // ainfinalarabic\n\t{0xb92ccc5d, 0x2469}, // tencircle\n\t{0xb9305b2b, 0x3174}, // pieupsioskiyeokkorean\n\t{0xb96268cb, 0x00de}, // Thorn\n\t{0xb9808b18, 0x09c1}, // uvowelsignbengali\n\t{0xb9927e88, 0x3382}, // muasquare\n\t{0xb99f8f9e, 0xfeeb}, // hehinitialarabic\n\t{0xb9b2e314, 0x0498}, // Zedescendercyrillic\n\t{0xb9b4563d, 0x24b3}, // xparen\n\t{0xb9c5eece, 0x05bc}, // dageshhebrew\n\t{0xb9d8b5d9, 0xfba4}, // hehhamzaaboveisolatedarabic\n\t{0xb9dbedd2, 0x317b}, // siosnieunkorean\n\t{0xb9e5ea71, 0x314c}, // thieuthkorean\n\t{0xb9e8b13e, 0x25a0}, // filledbox\n\t{0xb9f42560, 0x0964}, // danda\n\t{0xb9f5b462, 0x0990}, // aibengali\n\t{0xba1bcecd, 0x0176}, // Ycircumflex\n\t{0xba1f80d6, 0x21e1}, // arrowdashup\n\t{0xba21ad27, 0xfb3a}, // finalkafdagesh\n\t{0xba4eb5f9, 0x0055}, // U\n\t{0xba544632, 0x05db}, // afii57675\n\t{0xba5871eb, 0x033e}, // tildeverticalcmb\n\t{0xba60a3b8, 0x0902}, // anusvaradeva\n\t{0xba7e1049, 0x01d9}, // Udieresiscaron\n\t{0xba8d69d2, 0x232a}, // angleright\n\t{0xbaa24d97, 0x05e0}, // afii57680\n\t{0xbaa7aa4c, 0xfedc}, // kafmedialarabic\n\t{0xbac7de75, 0x1ed3}, // ocircumflexgrave\n\t{0xbad44ddc, 0x004f}, // O\n\t{0xbad7d685, 0x04b8}, // Cheverticalstrokecyrillic\n\t{0xbad97612, 0x03af}, // iotatonos\n\t{0xbadf80e2, 0x06f5}, // fivepersian\n\t{0xbafeb301, 0x0422}, // Tecyrillic\n\t{0xbb28e2ea, 0x1eb2}, // Abrevehookabove\n\t{0xbb30f37e, 0x0218}, // Scommaaccent\n\t{0xbb6353b2, 0x0332}, // lowlinecmb\n\t{0xbb72d76e, 0x0139}, // Lacute\n\t{0xbb906e01, 0x3266}, // sioscirclekorean\n\t{0xbb970588, 0x266f}, // musicsharpsign\n\t{0xbba252f7, 0x0106}, // Cacute\n\t{0xbbae7b40, 0x3172}, // pieupkiyeokkorean\n\t{0xbbb9d0f4, 0x0934}, // llladeva\n\t{0xbbd8677b, 0x330d}, // karoriisquare\n\t{0xbbdbcb55, 0x0a6f}, // ninegurmukhi\n\t{0xbbdc86be, 0xfb2b}, // shinsindot\n\t{0xbc0d2781, 0x0a1f}, // ttagurmukhi\n\t{0xbc1b1166, 0x2558}, // SF500000\n\t{0xbc280da2, 0x1e79}, // utildeacute\n\t{0xbc3510eb, 0x317f}, // pansioskorean\n\t{0xbc45cf9a, 0x02a4}, // dezh\n\t{0xbc75336c, 0x21a9}, // arrowhookright\n\t{0xbc78e14f, 0x24b0}, // uparen\n\t{0xbcd2c61b, 0x064c}, // dammatanarabic\n\t{0xbd0f6f71, 0x004c}, // L\n\t{0xbd1a9441, 0x3235}, // ideographicspecialparen\n\t{0xbd1abdb6, 0x0184}, // Tonesix\n\t{0xbd2d2e5f, 0x054e}, // Vewarmenian\n\t{0xbd30ce0c, 0x2641}, // earth\n\t{0xbd4d0860, 0x320a}, // khieukhparenkorean\n\t{0xbd54bd2d, 0x3208}, // cieucparenkorean\n\t{0xbd569183, 0x0182}, // Btopbar\n\t{0xbd5dbcc1, 0x0151}, // odblacute\n\t{0xbd5ee257, 0x01b7}, // Ezh\n\t{0xbd85b57b, 0x21a8}, // arrowupdownbase\n\t{0xbd8f8d24, 0x064b}, // fathatanarabic\n\t{0xbd906fab, 0x041f}, // Pecyrillic\n\t{0xbd98b80f, 0x25c8}, // whitediamondcontainingblacksmalldiamond\n\t{0xbdc1280a, 0x24be}, // Icircle\n\t{0xbdd372da, 0x318b}, // yuyekorean\n\t{0xbde8281d, 0x3276}, // cieucacirclekorean\n\t{0xbe3e45cf, 0xfb58}, // pehinitialarabic\n\t{0xbe663ca6, 0x2470}, // seventeencircle\n\t{0xbe7a58ae, 0x3203}, // rieulparenkorean\n\t{0xbea937fd, 0x25bc}, // blackdownpointingtriangle\n\t{0xbec6916e, 0x011c}, // Gcircumflex\n\t{0xbedd6640, 0x00d9}, // Ugrave\n\t{0xbf12496a, 0x0985}, // abengali\n\t{0xbf156070, 0x04e2}, // Imacroncyrillic\n\t{0xbf26dc61, 0x041d}, // Encyrillic\n\t{0xbf2dca30, 0x3082}, // mohiragana\n\t{0xbf3cff90, 0x0425}, // afii10039\n\t{0xbf5cef43, 0x01ee}, // Ezhcaron\n\t{0xbf673175, 0x01fd}, // aeacute\n\t{0xbf87a284, 0x00bf}, // questiondown\n\t{0xbf897387, 0x2273}, // greaterorequivalent\n\t{0xbf8f3598, 0x25a6}, // squareorthogonalcrosshatchfill\n\t{0xbf934ed3, 0x04e0}, // Dzeabkhasiancyrillic\n\t{0xbf97194e, 0x010a}, // Cdot\n\t{0xbf9bc7bd, 0xfb59}, // pehmedialarabic\n\t{0xbf9c1926, 0x0627}, // alefarabic\n\t{0xbfc69ab7, 0xff18}, // eightmonospace\n\t{0xbfd3ede4, 0x0396}, // Zeta\n\t{0xbffa52a3, 0x33c7}, // cosquare\n\t{0xc006a810, 0x062a}, // teharabic\n\t{0xc008508a, 0xff1c}, // lessmonospace\n\t{0xc00a3b07, 0x24bc}, // Gcircle\n\t{0xc0126352, 0x0661}, // onearabic\n\t{0xc03e102c, 0x3012}, // postalmark\n\t{0xc059a094, 0x0626}, // yehhamzaabovearabic\n\t{0xc0668ba8, 0x202e}, // afii61575\n\t{0xc07e7e42, 0x24a6}, // kparen\n\t{0xc084bd84, 0x1e29}, // hcedilla\n\t{0xc092fb91, 0x1e95}, // zlinebelow\n\t{0xc09823db, 0x016f}, // uring\n\t{0xc09889a1, 0x1e11}, // dcedilla\n\t{0xc0a2bc69, 0x2564}, // SF470000\n\t{0xc0a93f4f, 0x0e2c}, // lochulathai\n\t{0xc0bd9f90, 0x094a}, // oshortvowelsigndeva\n\t{0xc0c043bd, 0x3008}, // anglebracketleft\n\t{0xc0c1496c, 0x029e}, // kturned\n\t{0xc0cbe66a, 0x33b7}, // mvsquare\n\t{0xc0d444a4, 0x3220}, // oneideographicparen\n\t{0xc0dcb90f, 0x062e}, // khaharabic\n\t{0xc0efe98c, 0x2191}, // arrowup\n\t{0xc0fb3832, 0x25ab}, // H18551\n\t{0xc131664b, 0x30e4}, // yakatakana\n\t{0xc1425417, 0x317a}, // sioskiyeokkorean\n\t{0xc1641f79, 0xfe4d}, // lowlinedashed\n\t{0xc1835ca2, 0x02d3}, // ringhalfleftcentered\n\t{0xc191ae65, 0x0470}, // Psicyrillic\n\t{0xc1aa3399, 0x2a06}, // unionsqtext\n\t{0xc1c1cd87, 0xff2e}, // Nmonospace\n\t{0xc1d325d6, 0x05d8}, // tet\n\t{0xc1e02cdd, 0x0594}, // zaqefqatanhebrew\n\t{0xc1e3fd2d, 0x05d5}, // vav\n\t{0xc1e4c743, 0x3057}, // sihiragana\n\t{0xc1ec1451, 0x03c3}, // sigma\n\t{0xc1f9ede7, 0x05a3}, // munahhebrew\n\t{0xc2089a04, 0x05b7}, // patah1d\n\t{0xc21675c5, 0x0317}, // acutebelowcmb\n\t{0xc21e92b6, 0x2265}, // greaterequal\n\t{0xc2352e98, 0x0554}, // Keharmenian\n\t{0xc25217c2, 0xfeff}, // zerowidthjoiner\n\t{0xc25a58a0, 0x0a28}, // nagurmukhi\n\t{0xc25a7d39, 0x2663}, // club\n\t{0xc2658d7c, 0x3395}, // mulsquare\n\t{0xc26d6fce, 0x20a9}, // won\n\t{0xc283f2c3, 0x03bc}, // mugreek\n\t{0xc29c269a, 0x326d}, // hieuhcirclekorean\n\t{0xc2c391b3, 0x25b2}, // triagup\n\t{0xc2d0d165, 0x0137}, // kcommaaccent\n\t{0xc2db7e0f, 0x04a0}, // Kabashkircyrillic\n\t{0xc327f9ff, 0x239b}, // parenlefttp\n\t{0xc32ea721, 0x061f}, // afii57407\n\t{0xc36634d0, 0x09f9}, // sixteencurrencydenominatorbengali\n\t{0xc3722d19, 0x23ad}, // bracerightbt\n\t{0xc3751bae, 0x25ab}, // whitesmallsquare\n\t{0xc375a046, 0x05b0}, // shevahebrew\n\t{0xc391e9a8, 0xfe50}, // commasmall\n\t{0xc3c94bba, 0x306a}, // nahiragana\n\t{0xc3d9dd70, 0xfe43}, // whitecornerbracketleftvertical\n\t{0xc3df4586, 0x0903}, // visargadeva\n\t{0xc3eb9abd, 0x02c6}, // circumflex\n\t{0xc3edb597, 0x24bb}, // Fcircle\n\t{0xc3f1c1ff, 0x00e3}, // atilde\n\t{0xc3f76044, 0xff7c}, // sikatakanahalfwidth\n\t{0xc3f8f5bb, 0x04e3}, // imacroncyrillic\n\t{0xc3fbb2ce, 0x025e}, // eopenreversedclosed\n\t{0xc4004762, 0x328a}, // ideographmooncircle\n\t{0xc4289b41, 0x25a5}, // squareverticalfill\n\t{0xc43e9d0c, 0x1e26}, // Hdieresis\n\t{0xc4494fb1, 0x098b}, // rvocalicbengali\n\t{0xc459127a, 0x2174}, // fiveroman\n\t{0xc460226d, 0xfb34}, // hedagesh\n\t{0xc4607843, 0x25ca}, // lozenge\n\t{0xc4991f6f, 0x03d0}, // betasymbolgreek\n\t{0xc49bedba, 0x1e22}, // Hdotaccent\n\t{0xc4bd396f, 0xff98}, // rikatakanahalfwidth\n\t{0xc4cf0400, 0x0ac3}, // rvocalicvowelsigngujarati\n\t{0xc4d48fb7, 0x0a06}, // aagurmukhi\n\t{0xc510ccfb, 0x0327}, // cedillacmb\n\t{0xc51e03d1, 0x0e2a}, // sosuathai\n\t{0xc5233a99, 0xff41}, // amonospace\n\t{0xc52d9608, 0x0409}, // afii10058\n\t{0xc541abe3, 0x0409}, // Ljecyrillic\n\t{0xc560e83e, 0x1e4c}, // Otildeacute\n\t{0xc575fbd8, 0x3303}, // aarusquare\n\t{0xc577ce75, 0xff5d}, // bracerightmonospace\n\t{0xc579feb1, 0x03bf}, // omicron\n\t{0xc5904240, 0x1ee9}, // uhornacute\n\t{0xc594a84a, 0x0a85}, // agujarati\n\t{0xc5a57fbd, 0x0178}, // Ydieresis\n\t{0xc5b52809, 0x25ac}, // filledrect\n\t{0xc5c558c0, 0x2593}, // dkshade\n\t{0xc5df0b88, 0x0aae}, // magujarati\n\t{0xc5e2935b, 0x30bf}, // takatakana\n\t{0xc616ce34, 0x1e83}, // wacute\n\t{0xc618c356, 0x005f}, // underscore\n\t{0xc6231f67, 0x3117}, // zbopomofo\n\t{0xc62d494f, 0x042b}, // afii10045\n\t{0xc65b9029, 0x0012}, // controlDC2\n\t{0xc65e4473, 0x0300}, // gravecomb\n\t{0xc6649ea6, 0x263b}, // blacksmilingface\n\t{0xc6730a47, 0x3230}, // ideographicsunparen\n\t{0xc6a18663, 0x2173}, // fourroman\n\t{0xc6a33bcf, 0x23a4}, // bracketrighttp\n\t{0xc6bb9cde, 0x03c1}, // rho\n\t{0xc6c2ca67, 0x0537}, // Eharmenian\n\t{0xc6db1db1, 0x0a94}, // augujarati\n\t{0xc6ddc5a6, 0x0334}, // tildeoverlaycmb\n\t{0xc6e9fa39, 0x064a}, // yeharabic\n\t{0xc6fbfdac, 0x025a}, // schwahook\n\t{0xc703d8e7, 0x33b8}, // kvsquare\n\t{0xc71e49b3, 0x23a5}, // bracketrightex\n\t{0xc74688aa, 0x24dc}, // mcircle\n\t{0xc74a8cc7, 0x05b5}, // tserequarterhebrew\n\t{0xc74f4c99, 0x0298}, // bilabialclick\n\t{0xc7515b37, 0x0132}, // IJ\n\t{0xc755c80f, 0xff67}, // asmallkatakanahalfwidth\n\t{0xc75bc6a7, 0x01e8}, // Kcaron\n\t{0xc7618f62, 0x05b3}, // hatafqamats28\n\t{0xc76816e4, 0x0566}, // zaarmenian\n\t{0xc76c439e, 0x0115}, // ebreve\n\t{0xc76ec8b2, 0x0e1c}, // phophungthai\n\t{0xc77c2828, 0x2206}, // Delta\n\t{0xc786ef31, 0x095b}, // zadeva\n\t{0xc78887c7, 0x1e08}, // Ccedillaacute\n\t{0xc78fe323, 0x0698}, // afii57508\n\t{0xc798936b, 0xfc73}, // tehnoonfinalarabic\n\t{0xc7b3573a, 0x1e2f}, // idieresisacute\n\t{0xc7daee30, 0x09b7}, // ssabengali\n\t{0xc7e20869, 0x0aee}, // eightgujarati\n\t{0xc7ed01af, 0x33a5}, // mcubedsquare\n\t{0xc7f07bcf, 0x248f}, // eightperiod\n\t{0xc7f0b4c8, 0x0406}, // Icyrillic\n\t{0xc7fb5fe5, 0x05b2}, // afii57800\n\t{0xc812d1b7, 0x041b}, // afii10029\n\t{0xc82c0a32, 0x026f}, // mturned\n\t{0xc834804d, 0x2475}, // twoparen\n\t{0xc8488aa4, 0x05b0}, // shevawidehebrew\n\t{0xc84db89c, 0x2013}, // endash\n\t{0xc85fce80, 0x0901}, // candrabindudeva\n\t{0xc86d3a57, 0xff31}, // Qmonospace\n\t{0xc875e6fd, 0x040c}, // afii10061\n\t{0xc88f7d57, 0x05b3}, // hatafqamatsnarrowhebrew\n\t{0xc89d4f1f, 0x0006}, // controlACK\n\t{0xc8ae6fb2, 0x0e26}, // luthai\n\t{0xc8b50d48, 0x21d4}, // dblarrowleft\n\t{0xc8c2c42c, 0x0162}, // Tcedilla\n\t{0xc8c687a4, 0xfb4b}, // vavholamhebrew\n\t{0xc8cf912e, 0xfe59}, // parenleftsmall\n\t{0xc8fcce82, 0x0424}, // Efcyrillic\n\t{0xc8fdfe4b, 0x0914}, // audeva\n\t{0xc9315b90, 0x0338}, // soliduslongoverlaycmb\n\t{0xc93304ec, 0x2176}, // sevenroman\n\t{0xc9366418, 0x1e7e}, // Vdotbelow\n\t{0xc948d9f2, 0x01fe}, // Oslashacute\n\t{0xc948dd49, 0x0417}, // Zecyrillic\n\t{0xc94ac55a, 0xfb4e}, // perafehebrew\n\t{0xc94ceb7c, 0x1eca}, // Idotbelow\n\t{0xc956ff7e, 0x1e7b}, // umacrondieresis\n\t{0xc997284d, 0x03d3}, // Upsilonacutehooksymbolgreek\n\t{0xc997d626, 0xfe3d}, // dblanglebracketleftvertical\n\t{0xc9d02325, 0x2283}, // propersuperset\n\t{0xc9d7e9b6, 0x064c}, // afii57452\n\t{0xc9d96803, 0x3278}, // khieukhacirclekorean\n\t{0xc9e8cf5f, 0xfebf}, // dadinitialarabic\n\t{0xc9ea8b89, 0x305b}, // sehiragana\n\t{0xc9eb1227, 0x321c}, // cieucuparenkorean\n\t{0xca07e9ca, 0x02dd}, // hungarumlaut\n\t{0xca0b3331, 0x1e5f}, // rlinebelow\n\t{0xca2dd9fa, 0x2590}, // rtblock\n\t{0xca5ed753, 0x0269}, // iotalatin\n\t{0xca65e972, 0x0646}, // noonarabic\n\t{0xca9389a5, 0xa75b}, // roundr\n\t{0xcab40374, 0x1e1f}, // fdotaccent\n\t{0xcabe62a6, 0x0e16}, // thothungthai\n\t{0xcac3bcb6, 0x33a8}, // moverssquaredsquare\n\t{0xcac4b1a9, 0x32a8}, // ideographicrightcircle\n\t{0xcad1f345, 0x01bd}, // tonefive\n\t{0xcae44cee, 0x0013}, // controlDC3\n\t{0xcaf66d1c, 0x33b4}, // pvsquare\n\t{0xcb1a38a0, 0x226b}, // muchgreater\n\t{0xcb1b6c03, 0x0a5e}, // fagurmukhi\n\t{0xcb1e3324, 0x042d}, // afii10047\n\t{0xcb267db3, 0x3221}, // twoideographicparen\n\t{0xcb281438, 0x33ae}, // radoverssquare\n\t{0xcb2edf2d, 0x220f}, // product\n\t{0xcb4fc444, 0x03f0}, // kappasymbolgreek\n\t{0xcb56efb7, 0x015c}, // Scircumflex\n\t{0xcb5b537a, 0x0412}, // afii10019\n\t{0xcb669b9c, 0x1ee2}, // Ohorndotbelow\n\t{0xcb72660a, 0xff1e}, // greatermonospace\n\t{0xcb75245d, 0x1e48}, // Nlinebelow\n\t{0xcb88e590, 0x013c}, // lcedilla\n\t{0xcb8bc7f1, 0x002b}, // plus\n\t{0xcbada403, 0x0429}, // Shchacyrillic\n\t{0xcc11d7b0, 0x000c}, // controlFF\n\t{0xcc261604, 0x04a2}, // Endescendercyrillic\n\t{0xcc3139de, 0x33d1}, // squareln\n\t{0xcc3accb9, 0x05d8}, // tethebrew\n\t{0xcc3b7b5c, 0x0649}, // alefmaksuraarabic\n\t{0xcc447b1d, 0x0296}, // glottalstopinverted\n\t{0xcc8c13e9, 0x25c0}, // blackleftpointingtriangle\n\t{0xcc993e5c, 0x025c}, // eopenreversed\n\t{0xcca8fd16, 0x09e3}, // llvocalicvowelsignbengali\n\t{0xccaa74e1, 0xfb7d}, // tchehmedialarabic\n\t{0xccac0ec6, 0x300b}, // dblanglebracketright\n\t{0xccc389ea, 0xfb30}, // alefdageshhebrew\n\t{0xccc85a27, 0x0a81}, // candrabindugujarati\n\t{0xcd07b41d, 0x05bc}, // dagesh\n\t{0xcd30953c, 0x203c}, // exclamdbl\n\t{0xcd37d58c, 0x24e3}, // tcircle\n\t{0xcd415c99, 0x0e55}, // fivethai\n\t{0xcd499038, 0x33a2}, // kmsquaredsquare\n\t{0xcd54eec2, 0x06f4}, // fourpersian\n\t{0xcd5fb77d, 0x0185}, // tonesix\n\t{0xcd64e087, 0x266b}, // musicalnotedbl\n\t{0xcd75d5eb, 0x2551}, // SF240000\n\t{0xcd7ce3d0, 0x24a7}, // lparen\n\t{0xcd85d846, 0x1eec}, // Uhornhookabove\n\t{0xcd9d27ad, 0x24c7}, // Rcircle\n\t{0xcd9f5a2c, 0x0028}, // parenleft\n\t{0xcda0c667, 0x2018}, // quoteleft\n\t{0xcdae6ea2, 0xff59}, // ymonospace\n\t{0xcdbb64f4, 0x2105}, // afii61248\n\t{0xcdd2cfab, 0x24b4}, // yparen\n\t{0xcdd44c7f, 0x33a4}, // cmcubedsquare\n\t{0xcde56fe0, 0x05b6}, // segol\n\t{0xcdea4ff0, 0x03d4}, // Upsilondieresishooksymbolgreek\n\t{0xcdf0bcd8, 0x0e1e}, // phophanthai\n\t{0xcdfd40ec, 0x0180}, // bstroke\n\t{0xce074882, 0x0668}, // afii57400\n\t{0xce4d2d1e, 0x2563}, // SF230000\n\t{0xce6d06c6, 0x0aab}, // phagujarati\n\t{0xce6f0d59, 0x3272}, // mieumacirclekorean\n\t{0xce79a056, 0x3339}, // herutusquare\n\t{0xce8dac39, 0x25a8}, // squareupperrighttolowerleftfill\n\t{0xce942ad9, 0x09a6}, // dabengali\n\t{0xcea39f20, 0x02d5}, // downtackmod\n\t{0xcedf2a68, 0x0157}, // rcedilla\n\t{0xcee9759d, 0x043a}, // afii10076\n\t{0xcef01870, 0x0171}, // udblacute\n\t{0xcef10e83, 0x046a}, // Yusbigcyrillic\n\t{0xcef67881, 0x200c}, // zerowidthnonjoiner\n\t{0xcf235874, 0x030c}, // caroncmb\n\t{0xcf4c6b71, 0x02d4}, // uptackmod\n\t{0xcf6550b0, 0xfb4a}, // tavdageshhebrew\n\t{0xcf6a5e7c, 0x323e}, // ideographicresourceparen\n\t{0xcf738908, 0x011d}, // gcircumflex\n\t{0xcf848334, 0x0453}, // afii10100\n\t{0xcf8cbf6b, 0x0195}, // hv\n\t{0xcf9b96b5, 0x03bd}, // nu\n\t{0xcfb1da5d, 0xff89}, // nokatakanahalfwidth\n\t{0xcfc386a6, 0x00db}, // Ucircumflex\n\t{0xcfc400d6, 0x06d2}, // yehbarreearabic\n\t{0xcfd8a703, 0xfe61}, // asterisksmall\n\t{0xcfe519cb, 0x309b}, // voicedmarkkana\n\t{0xcfe64e44, 0x0668}, // eighthackarabic\n\t{0xcff88b7d, 0x05b8}, // qamatsqatannarrowhebrew\n\t{0xd0096386, 0x25b3}, // whiteuppointingtriangle\n\t{0xd0227bd1, 0x0199}, // khook\n\t{0xd02a9cfe, 0x0105}, // aogonek\n\t{0xd031b297, 0x24e9}, // zcircle\n\t{0xd03ef2b0, 0x316b}, // rieulpieupsioskorean\n\t{0xd0417b9a, 0x0494}, // Ghemiddlehookcyrillic\n\t{0xd044dddd, 0x0a9d}, // jhagujarati\n\t{0xd04ad0f0, 0x263c}, // sun\n\t{0xd04cc01e, 0x0561}, // aybarmenian\n\t{0xd0511b87, 0x0e4c}, // thanthakhatthai\n\t{0xd056aca3, 0xff9a}, // rekatakanahalfwidth\n\t{0xd06b6bb7, 0x096a}, // fourdeva\n\t{0xd07a803b, 0x09aa}, // pabengali\n\t{0xd0847e20, 0x05c4}, // upperdothebrew\n\t{0xd087e60f, 0x0158}, // Rcaron\n\t{0xd0897bb6, 0x0579}, // chaarmenian\n\t{0xd0c5df61, 0x05b4}, // hiriq14\n\t{0xd0ce4edc, 0x09e9}, // threebengali\n\t{0xd0d6e6c0, 0xff6c}, // yasmallkatakanahalfwidth\n\t{0xd0e3648a, 0xfd3e}, // parenleftaltonearabic\n\t{0xd133ff70, 0x01a1}, // ohorn\n\t{0xd1373ca2, 0x0648}, // wawarabic\n\t{0xd13d9bf5, 0xfe37}, // braceleftvertical\n\t{0xd13faec5, 0x05e1}, // samekh\n\t{0xd14fc185, 0x045b}, // afii10108\n\t{0xd17987dd, 0x0543}, // Cheharmenian\n\t{0xd18447d8, 0x0663}, // threearabic\n\t{0xd18966b1, 0x0a82}, // anusvaragujarati\n\t{0xd18d83de, 0x0aa3}, // nnagujarati\n\t{0xd190d310, 0x0a35}, // vagurmukhi\n\t{0xd191827c, 0x0e39}, // sarauuthai\n\t{0xd1acdf44, 0xfb94}, // gafinitialarabic\n\t{0xd1d7231f, 0x04bc}, // Cheabkhasiancyrillic\n\t{0xd1d9da71, 0x30ea}, // rikatakana\n\t{0xd2337241, 0x05b6}, // segol1f\n\t{0xd247ef8b, 0x3243}, // ideographicreachparen\n\t{0xd254c368, 0x0443}, // ucyrillic\n\t{0xd2658bcb, 0x05b9}, // holamquarterhebrew\n\t{0xd26b0e16, 0x2321}, // integralbt\n\t{0xd26ef570, 0x310f}, // hbopomofo\n\t{0xd293868c, 0x019b}, // lambdastroke\n\t{0xd297cb79, 0x30b7}, // sikatakana\n\t{0xd2b4c516, 0x30da}, // pekatakana\n\t{0xd2c0e1bc, 0x0150}, // Odblacute\n\t{0xd2cbfc99, 0x05b7}, // patahhebrew\n\t{0xd2e2a716, 0x03ec}, // Shimacoptic\n\t{0xd2eaddf5, 0x0633}, // seenarabic\n\t{0xd2f253f5, 0xfe40}, // anglebracketrightvertical\n\t{0xd2f3cdf3, 0x1e0e}, // Dlinebelow\n\t{0xd304784a, 0x05d3}, // dalet\n\t{0xd308b167, 0x1e5b}, // rdotbelow\n\t{0xd310fcc1, 0x04e9}, // obarredcyrillic\n\t{0xd3145153, 0xfeec}, // hehmedialarabic\n\t{0xd326ec6d, 0x2237}, // proportion\n\t{0xd3342503, 0x30bd}, // sokatakana\n\t{0xd33cb244, 0x02cd}, // macronlowmod\n\t{0xd35ba6fb, 0x04be}, // Chedescenderabkhasiancyrillic\n\t{0xd3730282, 0xff64}, // ideographiccommaleft\n\t{0xd3797e0f, 0x24db}, // lcircle\n\t{0xd37b4bcb, 0x041c}, // afii10030\n\t{0xd3a5ba29, 0x062e}, // afii57422\n\t{0xd3c22da1, 0x01b5}, // Zstroke\n\t{0xd3c6a66e, 0x05e4}, // pe\n\t{0xd3cfef4c, 0x0427}, // afii10041\n\t{0xd3e84c23, 0x201c}, // quotedblleft\n\t{0xd421361f, 0x067e}, // peharabic\n\t{0xd4273f62, 0x30fd}, // iterationkatakana\n\t{0xd44f2d4c, 0xff9b}, // rokatakanahalfwidth\n\t{0xd45c6c89, 0x3079}, // behiragana\n\t{0xd467b0a3, 0x0131}, // dotlessi\n\t{0xd48c064b, 0x0599}, // pashtahebrew\n\t{0xd48dad4d, 0x01e2}, // AEmacron\n\t{0xd4b2bb68, 0x0145}, // Ncedilla\n\t{0xd4d3eb56, 0x255e}, // SF360000\n\t{0xd4e86e58, 0x1ef7}, // yhookabove\n\t{0xd4e92fa8, 0x0623}, // alefhamzaabovearabic\n\t{0xd514a0e0, 0x318c}, // yuikorean\n\t{0xd5189135, 0x1e73}, // udieresisbelow\n\t{0xd52f1d8f, 0x24cb}, // Vcircle\n\t{0xd54b71bd, 0x0a6e}, // eightgurmukhi\n\t{0xd574af4c, 0x318e}, // araeaekorean\n\t{0xd57a206a, 0x00f2}, // ograve\n\t{0xd58ee561, 0x04f3}, // uhungarumlautcyrillic\n\t{0xd5b6f4bf, 0x3163}, // ikorean\n\t{0xd5b7a706, 0x1e13}, // dcircumflexbelow\n\t{0xd5da03ab, 0x0123}, // gcommaaccent\n\t{0xd5dc1f0e, 0x24a5}, // jparen\n\t{0xd5e6a2b4, 0x200f}, // afii300\n\t{0xd6067104, 0x05bd}, // siluqlefthebrew\n\t{0xd6180af1, 0x0023}, // numbersign\n\t{0xd6191adc, 0x02ce}, // gravelowmod\n\t{0xd6480a61, 0x0e46}, // maiyamokthai\n\t{0xd65815d1, 0x04f5}, // chedieresiscyrillic\n\t{0xd6674587, 0xfea8}, // khahmedialarabic\n\t{0xd66f3b98, 0x1ebd}, // etilde\n\t{0xd67d357f, 0x0e23}, // roruathai\n\t{0xd67dc19d, 0x1e05}, // bdotbelow\n\t{0xd682be7e, 0xfe54}, // semicolonsmall\n\t{0xd689f58d, 0x0024}, // dollar\n\t{0xd68be98a, 0xff8f}, // makatakanahalfwidth\n\t{0xd6a99b0e, 0x05aa}, // yerahbenyomolefthebrew\n\t{0xd6c4c66e, 0x3262}, // tikeutcirclekorean\n\t{0xd6c7e5a6, 0x03b0}, // upsilondieresistonos\n\t{0xd6df6252, 0xfef4}, // yehmedialarabic\n\t{0xd6e234de, 0x044d}, // afii10095\n\t{0xd7151c8a, 0x040b}, // afii10060\n\t{0xd71af0cf, 0x00af}, // overscore\n\t{0xd72c6112, 0x0036}, // six\n\t{0xd73b3901, 0x02da}, // ring\n\t{0xd7425de1, 0x0a1d}, // jhagurmukhi\n\t{0xd771b953, 0x3107}, // mbopomofo\n\t{0xd7a40cc3, 0x315c}, // ukorean\n\t{0xd7b7f8a3, 0x3094}, // vuhiragana\n\t{0xd7b8c7af, 0x05b8}, // qamatsquarterhebrew\n\t{0xd7bf0d2a, 0x308b}, // ruhiragana\n\t{0xd7cebade, 0x01b1}, // Upsilonafrican\n\t{0xd7d268b5, 0x314e}, // hieuhkorean\n\t{0xd7ece605, 0x2553}, // SF520000\n\t{0xd813ab1a, 0x3176}, // pieupcieuckorean\n\t{0xd816387d, 0x2178}, // nineroman\n\t{0xd8171429, 0x013e}, // lcaron\n\t{0xd817c39d, 0x0664}, // fourhackarabic\n\t{0xd824acfb, 0x05de}, // memhebrew\n\t{0xd849e14d, 0x3052}, // gehiragana\n\t{0xd84afb0a, 0x00d1}, // Ntilde\n\t{0xd85534fc, 0x02ca}, // secondtonechinese\n\t{0xd8708805, 0x01ba}, // ezhtail\n\t{0xd890928b, 0x0053}, // S\n\t{0xd893adf8, 0x0580}, // reharmenian\n\t{0xd8964f73, 0x043d}, // encyrillic\n\t{0xd89879e8, 0x2116}, // afii61352\n\t{0xd8a1ab6d, 0x03ab}, // Upsilondieresis\n\t{0xd8b1d2bf, 0x0177}, // ycircumflex\n\t{0xd8faed0d, 0x30ef}, // wakatakana\n\t{0xd9038cdb, 0x32a4}, // ideographichighcircle\n\t{0xd90a7039, 0x06af}, // afii57509\n\t{0xd91584cd, 0xfe31}, // emdashvertical\n\t{0xd92072b9, 0x0493}, // ghestrokecyrillic\n\t{0xd92d9608, 0x0acd}, // viramagujarati\n\t{0xd9321a82, 0xfb01}, // f_i\n\t{0xd932c15c, 0x30ac}, // gakatakana\n\t{0xd93c2940, 0x33cf}, // ktsquare\n\t{0xd94d846e, 0x321a}, // phieuphaparenkorean\n\t{0xd94faf13, 0x0188}, // chook\n\t{0xd95c2f59, 0x04bd}, // cheabkhasiancyrillic\n\t{0xd9697a13, 0x328b}, // ideographfirecircle\n\t{0xd98cc91f, 0x0307}, // dotaccentcmb\n\t{0xd991004f, 0x0e4f}, // fongmanthai\n\t{0xd99e3976, 0x249f}, // dparen\n\t{0xd9ba695c, 0xff70}, // katahiraprolongmarkhalfwidth\n\t{0xd9d63664, 0x0189}, // Dafrican\n\t{0xd9e83df4, 0x096b}, // fivedeva\n\t{0xd9eba56d, 0x03b3}, // gamma\n\t{0xda15411c, 0x0304}, // macroncmb\n\t{0xda2037e1, 0x1e01}, // aringbelow\n\t{0xda3670ae, 0x3347}, // mansyonsquare\n\t{0xda39b9df, 0x013d}, // Lcaron\n\t{0xda48ff7e, 0x00bb}, // guillemotright\n\t{0xda4e1891, 0x228b}, // supersetnotequal\n\t{0xda55d0f3, 0x0a69}, // threegurmukhi\n\t{0xda620e6e, 0xfca2}, // tehhahinitialarabic\n\t{0xda734cc8, 0x232b}, // deleteleft\n\t{0xda85eaa3, 0x2070}, // zerosuperior\n\t{0xda94576a, 0x0999}, // ngabengali\n\t{0xda94a677, 0x0634}, // afii57428\n\t{0xda99b3d7, 0x30d1}, // pakatakana\n\t{0xdab46527, 0x21e9}, // arrowdownwhite\n\t{0xdac4a95a, 0x002f}, // slash\n\t{0xdac8670b, 0x011e}, // Gbreve\n\t{0xdad5813e, 0x24bf}, // Jcircle\n\t{0xdaf9ae21, 0x03e7}, // kheicoptic\n\t{0xdb00acb2, 0x04dc}, // Zhedieresiscyrillic\n\t{0xdb07430c, 0x1eac}, // Acircumflexdotbelow\n\t{0xdb15243d, 0xfb38}, // tetdagesh\n\t{0xdb180684, 0x059d}, // gereshmuqdamhebrew\n\t{0xdb19f222, 0x1e30}, // Kacute\n\t{0xdb36c0cb, 0x00c1}, // Aacute\n\t{0xdb46a061, 0x044f}, // afii10097\n\t{0xdb4843d8, 0x0140}, // ldotaccent\n\t{0xdb491e12, 0x3201}, // nieunparenkorean\n\t{0xdb4ecb82, 0x06a4}, // afii57505\n\t{0xdb5fdfb2, 0x09cd}, // viramabengali\n\t{0xdb9c2f74, 0x3063}, // tusmallhiragana\n\t{0xdb9dda85, 0xfb3b}, // kafdageshhebrew\n\t{0xdba170e8, 0x0998}, // ghabengali\n\t{0xdbae2c8c, 0x2277}, // greaterorless\n\t{0xdbc3c473, 0x001a}, // controlSUB\n\t{0xdbc6ef9a, 0x05b2}, // hatafpatah23\n\t{0xdbc71338, 0xff01}, // exclammonospace\n\t{0xdbcb0069, 0x338a}, // pfsquare\n\t{0xdbf12380, 0x2460}, // onecircle\n\t{0xdc0071a3, 0xfb46}, // tsadidageshhebrew\n\t{0xdc05ec50, 0x30f5}, // kasmallkatakana\n\t{0xdc0ad3ae, 0x012d}, // ibreve\n\t{0xdc0c240d, 0xff9e}, // voicedmarkkanahalfwidth\n\t{0xdc0c9e85, 0xff9f}, // semivoicedmarkkanahalfwidth\n\t{0xdc3d7ac8, 0x04a7}, // pemiddlehookcyrillic\n\t{0xdc41d3b3, 0x05ab}, // olehebrew\n\t{0xdc54447c, 0x307c}, // bohiragana\n\t{0xdc6ca9b3, 0x0584}, // keharmenian\n\t{0xdc7756d1, 0x0077}, // w\n\t{0xdc7d1de8, 0xfba9}, // hehmedialaltonearabic\n\t{0xdc7f6ca5, 0x0624}, // wawhamzaabovearabic\n\t{0xdcc5c006, 0x055a}, // apostrophearmenian\n\t{0xdce03f6b, 0x261e}, // pointingindexrightwhite\n\t{0xdcefaeeb, 0x228a}, // subsetnotequal\n\t{0xdd07775c, 0x3223}, // fourideographicparen\n\t{0xdd07a474, 0x00b3}, // threesuperior\n\t{0xdd21d4c1, 0x039b}, // Lambda\n\t{0xdd2fee63, 0x0aad}, // bhagujarati\n\t{0xdd4e62a4, 0x0a96}, // khagujarati\n\t{0xdd55f861, 0x2560}, // SF420000\n\t{0xdd64bab7, 0x3080}, // muhiragana\n\t{0xdd68d3ef, 0x00a5}, // yen\n\t{0xdd8a8538, 0x0a26}, // dagurmukhi\n\t{0xdd9a009b, 0x2016}, // dblverticalbar\n\t{0xdda2fef7, 0x33db}, // srsquare\n\t{0xdda8f1e0, 0x33d4}, // mbsquare\n\t{0xddd89deb, 0xff4d}, // mmonospace\n\t{0xdde406ed, 0x23a8}, // braceleftmid\n\t{0xddfdd08a, 0x30a7}, // esmallkatakana\n\t{0xddfea657, 0x0049}, // I\n\t{0xddffcb32, 0x1e60}, // Sdotaccent\n\t{0xde111430, 0x2271}, // notgreaternorequal\n\t{0xde159412, 0x2605}, // blackstar\n\t{0xde3de1bb, 0xfede}, // lamfinalarabic\n\t{0xde4643cf, 0x0ac5}, // ecandravowelsigngujarati\n\t{0xde5450d1, 0xff88}, // nekatakanahalfwidth\n\t{0xde6c8dd1, 0x2223}, // divides\n\t{0xde91c7ac, 0xfb35}, // vavdagesh\n\t{0xdea63325, 0x0e0c}, // chochoethai\n\t{0xdea93241, 0x0385}, // dieresistonos\n\t{0xdeab4b8b, 0x05ad}, // dehihebrew\n\t{0xdebc4010, 0xfcd5}, // noonmeeminitialarabic\n\t{0xdebf0df4, 0x05f0}, // afii57716\n\t{0xdecde878, 0x1e52}, // Omacronacute\n\t{0xdee80462, 0xffe5}, // yenmonospace\n\t{0xdee969b3, 0x3001}, // ideographiccomma\n\t{0xdef14eee, 0x020e}, // Oinvertedbreve\n\t{0xdef351c2, 0x020c}, // Odblgrave\n\t{0xdef92b6a, 0x3349}, // mirisquare\n\t{0xdf08e8b4, 0xff15}, // fivemonospace\n\t{0xdf09c757, 0x0186}, // Oopen\n\t{0xdf1ee74b, 0xff81}, // tikatakanahalfwidth\n\t{0xdf243dad, 0x044c}, // softsigncyrillic\n\t{0xdf46fba9, 0x01a4}, // Phook\n\t{0xdf80589a, 0x3217}, // chieuchaparenkorean\n\t{0xdf8c6402, 0x0e45}, // lakkhangyaothai\n\t{0xdf9eaf7a, 0x33bc}, // muwsquare\n\t{0xdfad5d93, 0x22c0}, // logicalandtext\n\t{0xdfaf476d, 0x0167}, // tbar\n\t{0xdfb9632c, 0x3144}, // pieupsioskorean\n\t{0xdff819d0, 0xfe8c}, // yehhamzaabovemedialarabic\n\t{0xdffe3761, 0x1e14}, // Emacrongrave\n\t{0xe0130535, 0x316c}, // rieulpansioskorean\n\t{0xe019189f, 0x0994}, // aubengali\n\t{0xe0197d92, 0x0a4b}, // oomatragurmukhi\n\t{0xe0343a59, 0x0323}, // dotbelowcomb\n\t{0xe03a2368, 0x019f}, // Ocenteredtilde\n\t{0xe0489c79, 0x017f}, // longs\n\t{0xe0560cdf, 0x1e19}, // ecircumflexbelow\n\t{0xe065671a, 0x1e0a}, // Ddotaccent\n\t{0xe07dfee5, 0x04f4}, // Chedieresiscyrillic\n\t{0xe0800244, 0xfb69}, // ttehmedialarabic\n\t{0xe0987417, 0x24dd}, // ncircle\n\t{0xe0ac4869, 0x3225}, // sixideographicparen\n\t{0xe0c42e1f, 0x3357}, // wattosquare\n\t{0xe0cf3aca, 0x1e1d}, // ecedillabreve\n\t{0xe0d114bf, 0x04b6}, // Chedescendercyrillic\n\t{0xe0dbd3b5, 0x2494}, // thirteenperiod\n\t{0xe0ec0106, 0x05a6}, // merkhakefulahebrew\n\t{0xe0ec7a9f, 0x01a6}, // yr\n\t{0xe0f957bb, 0x0644}, // afii57444\n\t{0xe10a53c6, 0x0aa8}, // nagujarati\n\t{0xe13f2d93, 0x3026}, // sixhangzhou\n\t{0xe173c1f2, 0x1e12}, // Dcircumflexbelow\n\t{0xe180ca73, 0x1e43}, // mdotbelow\n\t{0xe1b37094, 0x0629}, // afii57417\n\t{0xe1bbda55, 0x040e}, // Ushortcyrillic\n\t{0xe1bf1035, 0x0536}, // Zaarmenian\n\t{0xe20234a2, 0x012c}, // Ibreve\n\t{0xe20c937f, 0x041a}, // Kacyrillic\n\t{0xe20deadd, 0x047c}, // Omegatitlocyrillic\n\t{0xe2234dec, 0xff52}, // rmonospace\n\t{0xe22682ea, 0x3260}, // kiyeokcirclekorean\n\t{0xe22a6510, 0x1e8e}, // Ydotaccent\n\t{0xe23968a4, 0x04b3}, // hadescendercyrillic\n\t{0xe25773d9, 0x04d3}, // adieresiscyrillic\n\t{0xe259edda, 0x0628}, // afii57416\n\t{0xe25f57e9, 0xfe9a}, // thehfinalarabic\n\t{0xe26168f6, 0x1e82}, // Wacute\n\t{0xe28a564c, 0x044f}, // iacyrillic\n\t{0xe28eea2e, 0x1e51}, // omacrongrave\n\t{0xe2924f7e, 0x0a67}, // onegurmukhi\n\t{0xe2a7b092, 0x3213}, // pieupaparenkorean\n\t{0xe2b99909, 0x0e14}, // dodekthai\n\t{0xe2cfeeb5, 0x0301}, // acutecomb\n\t{0xe2eccaa5, 0x0059}, // Y\n\t{0xe2ef1bbf, 0x2197}, // arrowupright\n\t{0xe2fc74df, 0x0533}, // Gimarmenian\n\t{0xe2ff3ec5, 0xfb8d}, // rrehfinalarabic\n\t{0xe2ffc4d4, 0x2661}, // heartsuitwhite\n\t{0xe3356dd7, 0x1e54}, // Pacute\n\t{0xe35f1369, 0xfe5c}, // bracerightsmall\n\t{0xe3708e14, 0xfed3}, // fehinitialarabic\n\t{0xe37c75f9, 0x03c7}, // chi\n\t{0xe38423f1, 0x01ab}, // tpalatalhook\n\t{0xe387ebf8, 0xff94}, // yakatakanahalfwidth\n\t{0xe39adf52, 0x05b7}, // patahnarrowhebrew\n\t{0xe39bb5ba, 0x0258}, // ereversed\n\t{0xe3a00fb0, 0x0aa2}, // ddhagujarati\n\t{0xe3a0394c, 0x05b3}, // afii57802\n\t{0xe3bf40b5, 0x21c5}, // arrowupleftofdown\n\t{0xe3cbb73f, 0x0459}, // afii10106\n\t{0xe3cddac1, 0x0621}, // hamzalowarabic\n\t{0xe3d5ad06, 0x1ec0}, // Ecircumflexgrave\n\t{0xe3dd99f7, 0x0596}, // tipehahebrew\n\t{0xe3fae787, 0x0587}, // echyiwnarmenian\n\t{0xe3fe00d6, 0x2170}, // oneroman\n\t{0xe401701f, 0x3016}, // whitelenticularbracketleft\n\t{0xe41d9109, 0x3089}, // rahiragana\n\t{0xe424f4cb, 0x0969}, // threedeva\n\t{0xe42a588e, 0x0e27}, // wowaenthai\n\t{0xe42a6647, 0x0a71}, // addakgurmukhi\n\t{0xe433c6bf, 0x042c}, // afii10046\n\t{0xe44aea0b, 0x0219}, // scommaaccent\n\t{0xe44ed7aa, 0x2481}, // fourteenparen\n\t{0xe468e60e, 0x33bd}, // mwsquare\n\t{0xe47b4b2e, 0xfecb}, // aininitialarabic\n\t{0xe4896ee4, 0x09c0}, // iivowelsignbengali\n\t{0xe4924345, 0xff63}, // cornerbracketrighthalfwidth\n\t{0xe49ba568, 0x090c}, // lvocalicdeva\n\t{0xe4a8920f, 0x0014}, // controlDC4\n\t{0xe4c6b94a, 0x0550}, // Reharmenian\n\t{0xe4c91eec, 0x1ea7}, // acircumflexgrave\n\t{0xe4d0a5c5, 0x2171}, // tworoman\n\t{0xe4de0824, 0x090b}, // rvocalicdeva\n\t{0xe4e78bbf, 0x0e33}, // saraamthai\n\t{0xe4e90251, 0xfb41}, // samekhdagesh\n\t{0xe4f1acea, 0x24d7}, // hcircle\n\t{0xe5034999, 0xff55}, // umonospace\n\t{0xe504c22f, 0x01a9}, // Esh\n\t{0xe506e1eb, 0x2493}, // twelveperiod\n\t{0xe5107e85, 0xff92}, // mekatakanahalfwidth\n\t{0xe5116fc8, 0x2472}, // nineteencircle\n\t{0xe514f37f, 0x03be}, // xi\n\t{0xe51bd3a3, 0x0163}, // tcedilla\n\t{0xe5287de7, 0x3173}, // pieuptikeutkorean\n\t{0xe5322bbf, 0x25b2}, // blackuppointingtriangle\n\t{0xe5431590, 0x2296}, // minuscircle\n\t{0xe54a2cdd, 0x201e}, // quotedblbase\n\t{0xe5694805, 0x3161}, // eukorean\n\t{0xe56f3e08, 0x1e9b}, // slongdotaccent\n\t{0xe5779de7, 0x0666}, // afii57398\n\t{0xe578bf9d, 0x066d}, // asteriskaltonearabic\n\t{0xe5850206, 0x2226}, // notparallel\n\t{0xe59889e5, 0x014b}, // eng\n\t{0xe59f1c1d, 0x2664}, // spadesuitwhite\n\t{0xe59f1f71, 0x2203}, // thereexists\n\t{0xe5dca65a, 0x04aa}, // Esdescendercyrillic\n\t{0xe5e0ac19, 0x0a74}, // ekonkargurmukhi\n\t{0xe5eb1828, 0x25e6}, // openbullet\n\t{0xe5f403ac, 0x0981}, // candrabindubengali\n\t{0xe5f51e2d, 0x0156}, // Rcedilla\n\t{0xe61a323e, 0x21d2}, // arrowdblright\n\t{0xe61dad29, 0x017b}, // Zdotaccent\n\t{0xe62fb889, 0x2524}, // SF090000\n\t{0xe6699f03, 0x025d}, // eopenreversedhook\n\t{0xe6743f55, 0x011a}, // Ecaron\n\t{0xe6861695, 0x018a}, // Dhook\n\t{0xe68d35b4, 0x0436}, // afii10072\n\t{0xe68e2cfd, 0x306b}, // nihiragana\n\t{0xe6910141, 0x06f1}, // onepersian\n\t{0xe6936418, 0xfb2f}, // alefqamatshebrew\n\t{0xe6a0587d, 0x3222}, // threeideographicparen\n\t{0xe6a445c8, 0xfcd2}, // noonjeeminitialarabic\n\t{0xe6b00dbd, 0x060c}, // commaarabic\n\t{0xe6bd7d55, 0x04f0}, // Udieresiscyrillic\n\t{0xe6beeaab, 0x2667}, // clubsuitwhite\n\t{0xe6d26878, 0x0663}, // threehackarabic\n\t{0xe6eee43a, 0x031a}, // leftangleabovecmb\n\t{0xe70bdf5d, 0x1e85}, // wdieresis\n\t{0xe72762a6, 0x3127}, // ibopomofo\n\t{0xe74e8d5b, 0x02d0}, // colontriangularmod\n\t{0xe75de72d, 0x0a4d}, // halantgurmukhi\n\t{0xe796e6c1, 0x032f}, // breveinvertedbelowcmb\n\t{0xe7a9201c, 0x24e5}, // vcircle\n\t{0xe7abb869, 0x05b0}, // sheva115\n\t{0xe7f3b395, 0x24d8}, // icircle\n\t{0xe80a2426, 0x3116}, // rbopomofo\n\t{0xe80eec90, 0x0942}, // uuvowelsigndeva\n\t{0xe832e25c, 0x03ef}, // deicoptic\n\t{0xe836846a, 0x20a1}, // colonsign\n\t{0xe8445eb9, 0x05e5}, // finaltsadihebrew\n\t{0xe84e29b1, 0xfef5}, // lamalefmaddaaboveisolatedarabic\n\t{0xe853fc35, 0x3177}, // pieupthieuthkorean\n\t{0xe871a9d4, 0x03e3}, // sheicoptic\n\t{0xe872f83d, 0x02a0}, // qhook\n\t{0xe87409fd, 0xfe8b}, // yehhamzaaboveinitialarabic\n\t{0xe885d69b, 0x1e58}, // Rdotaccent\n\t{0xe893423b, 0x202c}, // afii61573\n\t{0xe894f25c, 0x03a1}, // Rho\n\t{0xe89d944f, 0x043a}, // kacyrillic\n\t{0xe8aff9ae, 0x24b7}, // Bcircle\n\t{0xe8d4db79, 0x2320}, // integraltp\n\t{0xe8d6bd29, 0x0621}, // afii57409\n\t{0xe8ec3154, 0x2490}, // nineperiod\n\t{0xe8ef5782, 0x3092}, // wohiragana\n\t{0xe8f0c584, 0x05d1}, // afii57665\n\t{0xe8f5ca9b, 0x05b1}, // hatafsegolnarrowhebrew\n\t{0xe8f7e9bf, 0x320f}, // nieunaparenkorean\n\t{0xe903bc23, 0xfb36}, // zayindageshhebrew\n\t{0xe90424fe, 0x2479}, // sixparen\n\t{0xe927829f, 0x0953}, // gravedeva\n\t{0xe92a9522, 0x0060}, // grave\n\t{0xe93b2c93, 0x09c8}, // aivowelsignbengali\n\t{0xe9598c36, 0x018e}, // Ereversed\n\t{0xe96c43a5, 0x00d4}, // Ocircumflex\n\t{0xe977a63b, 0x0591}, // etnahtalefthebrew\n\t{0xe9860674, 0x2467}, // eightcircle\n\t{0xe994ec07, 0x1e88}, // Wdotbelow\n\t{0xe9955c1b, 0x2109}, // fahrenheit\n\t{0xe997ce80, 0x03d6}, // pisymbolgreek\n\t{0xe9b8fb39, 0x256a}, // SF540000\n\t{0xe9c5c9e3, 0x0928}, // nadeva\n\t{0xe9dc1b2b, 0x3162}, // yikorean\n\t{0xe9f5bb0b, 0x1e40}, // Mdotaccent\n\t{0xe9fd5bd7, 0x02d1}, // colontriangularhalfmod\n\t{0xe9fe0986, 0xfe91}, // behinitialarabic\n\t{0xea0e9b0d, 0x3077}, // puhiragana\n\t{0xea11b5f2, 0x05d7}, // hethebrew\n\t{0xea281c50, 0xfb3b}, // kafdagesh\n\t{0xea281f0f, 0xfb43}, // pefinaldageshhebrew\n\t{0xea4521ba, 0x1e99}, // yring\n\t{0xea469ad4, 0x0641}, // feharabic\n\t{0xea4bf6ca, 0x25b5}, // whiteuppointingsmalltriangle\n\t{0xea505c24, 0x006b}, // k\n\t{0xea723c32, 0x05b7}, // patahwidehebrew\n\t{0xea828d24, 0x0ac4}, // rrvocalicvowelsigngujarati\n\t{0xea8df8fe, 0xff09}, // parenrightmonospace\n\t{0xeaaa8586, 0x05b6}, // segolhebrew\n\t{0xeabb8dad, 0xfeb3}, // seeninitialarabic\n\t{0xeabdd2cd, 0xff02}, // quotedblmonospace\n\t{0xeacd0b4a, 0xfb1f}, // doubleyodpatah\n\t{0xeade9ba5, 0x2113}, // afii61289\n\t{0xeb0445d5, 0x043f}, // afii10081\n\t{0xeb095515, 0x0452}, // afii10099\n\t{0xeb4a0523, 0x056a}, // zhearmenian\n\t{0xeb4fdea3, 0xfc08}, // behmeemisolatedarabic\n\t{0xeb576d94, 0x21de}, // pageup\n\t{0xeb701704, 0x2014}, // emdash\n\t{0xeb71d801, 0x30f3}, // nkatakana\n\t{0xebeccb02, 0x00dd}, // Yacute\n\t{0xec20a331, 0x096c}, // sixdeva\n\t{0xec450aad, 0x3211}, // rieulaparenkorean\n\t{0xec4fc0c5, 0x0173}, // uogonek\n\t{0xec78ec45, 0x05a4}, // mahapakhhebrew\n\t{0xec820a21, 0x05b4}, // hiriqquarterhebrew\n\t{0xec8ae366, 0x0987}, // ibengali\n\t{0xec967081, 0x040a}, // Njecyrillic\n\t{0xecad584f, 0x01a8}, // tonetwo\n\t{0xecc21039, 0x0a98}, // ghagujarati\n\t{0xecce5cae, 0x056b}, // iniarmenian\n\t{0xecd385c5, 0x03a8}, // Psi\n\t{0xecda4c6b, 0x0622}, // alefmaddaabovearabic\n\t{0xecddb27b, 0x23d0}, // vextendsingle\n\t{0xecddb519, 0x05db}, // kaf\n\t{0xecef01e0, 0x1e59}, // rdotaccent\n\t{0xed102125, 0x24c0}, // Kcircle\n\t{0xed1afc7c, 0x05b2}, // hatafpatah2f\n\t{0xed2b4a43, 0x00aa}, // ordfeminine\n\t{0xed4bb321, 0x313f}, // rieulphieuphkorean\n\t{0xed65e3bb, 0x057a}, // peharmenian\n\t{0xed729d82, 0x049e}, // Kastrokecyrillic\n\t{0xed796a9e, 0x0407}, // afii10056\n\t{0xed8b66db, 0x040b}, // Tshecyrillic\n\t{0xed9bf511, 0x063a}, // afii57434\n\t{0xedfaec74, 0xfe69}, // dollarsmall\n\t{0xee22e47f, 0x00bd}, // onehalf\n\t{0xee3352d3, 0x05b0}, // afii57799\n\t{0xee339d2e, 0x2025}, // twodotenleader\n\t{0xee421e32, 0x0660}, // zeroarabic\n\t{0xee6c8858, 0x3168}, // nieunpansioskorean\n\t{0xee7a31f8, 0x220b}, // suchthat\n\t{0xee8d09d6, 0xff12}, // twomonospace\n\t{0xee900f0f, 0x0462}, // afii10146\n\t{0xee9f1e99, 0x02b7}, // wsuperior\n\t{0xeeb00f1b, 0x0063}, // c\n\t{0xeeb5ef47, 0x24c2}, // Mcircle\n\t{0xeeda5b48, 0x00a6}, // brokenbar\n\t{0xeeeef128, 0x062f}, // afii57423\n\t{0xeeef7f7c, 0x01b6}, // zstroke\n\t{0xef03e03f, 0x32a3}, // ideographiccorrectcircle\n\t{0xef22f61a, 0x06f0}, // zeropersian\n\t{0xef24cf3c, 0x00a8}, // dieresis\n\t{0xef2800a0, 0x00cc}, // Igrave\n\t{0xef33d78e, 0x25a1}, // H22073\n\t{0xef3a179c, 0x020a}, // Iinvertedbreve\n\t{0xef636ee0, 0x05da}, // finalkaf\n\t{0xefa03eab, 0x00c6}, // AE\n\t{0xefc57067, 0x0260}, // ghook\n\t{0xefd65ddd, 0x2033}, // second\n\t{0xefd69119, 0x044e}, // iucyrillic\n\t{0xefd88572, 0x1ecb}, // idotbelow\n\t{0xefe0e3fd, 0xfb01}, // fi\n\t{0xeff59b38, 0x0397}, // Eta\n\t{0xeff843d0, 0x25a3}, // squarewhitewithsmallblack\n\t{0xf00181f3, 0x305c}, // zehiragana\n\t{0xf00455e8, 0x1e86}, // Wdotaccent\n\t{0xf0045976, 0x3178}, // kapyeounpieupkorean\n\t{0xf0213847, 0x3383}, // masquare\n\t{0xf0248bca, 0x0640}, // tatweelarabic\n\t{0xf029041c, 0x3017}, // whitelenticularbracketright\n\t{0xf0412bb8, 0x04d0}, // Abrevecyrillic\n\t{0xf04a093b, 0xff66}, // wokatakanahalfwidth\n\t{0xf04c3677, 0xfe62}, // plussmall\n\t{0xf04d9cf4, 0x308c}, // rehiragana\n\t{0xf064a013, 0x047e}, // Otcyrillic\n\t{0xf0673e49, 0x096f}, // ninedeva\n\t{0xf0757f39, 0x030a}, // ringcmb\n\t{0xf08a28a9, 0xfe4e}, // lowlinecenterline\n\t{0xf09092b0, 0x3185}, // ssanghieuhkorean\n\t{0xf091911a, 0x223d}, // reversedtilde\n\t{0xf098620b, 0x066a}, // percentarabic\n\t{0xf0a5507a, 0x03d5}, // phisymbolgreek\n\t{0xf0ac995b, 0x337c}, // syouwaerasquare\n\t{0xf0b806fd, 0xfb7c}, // tchehinitialarabic\n\t{0xf0c10455, 0x0645}, // meemarabic\n\t{0xf0d79471, 0x0201}, // adblgrave\n\t{0xf0e2f076, 0x04cb}, // Chekhakassiancyrillic\n\t{0xf0ec6a42, 0x0302}, // circumflexcmb\n\t{0xf0f2a82b, 0x1e8a}, // Xdotaccent\n\t{0xf0fcc511, 0x3398}, // klsquare\n\t{0xf1116d2e, 0xfe41}, // cornerbracketleftvertical\n\t{0xf1200f87, 0x05e6}, // tsadi\n\t{0xf13a2d0d, 0x0119}, // eogonek\n\t{0xf1410096, 0x1e1a}, // Etildebelow\n\t{0xf144c7a3, 0x249d}, // bparen\n\t{0xf15ab600, 0x05bb}, // qubuts18\n\t{0xf16238a6, 0x04de}, // Zedieresiscyrillic\n\t{0xf1aad12e, 0x0638}, // afii57432\n\t{0xf1b08e52, 0x20ab}, // dong\n\t{0xf1b0be56, 0x20a2}, // cruzeiro\n\t{0xf1b5f5d1, 0x05b5}, // tserehebrew\n\t{0xf1dd7830, 0x033d}, // xabovecmb\n\t{0xf1ddaa7d, 0x0995}, // kabengali\n\t{0xf1e94d64, 0x064e}, // fathaarabic\n\t{0xf1eb4f66, 0x0116}, // Edotaccent\n\t{0xf1f78ce7, 0x226a}, // muchless\n\t{0xf2118c6c, 0x0635}, // sadarabic\n\t{0xf232181a, 0x2640}, // venus\n\t{0xf237f0f1, 0xff29}, // Imonospace\n\t{0xf23a5b68, 0x0130}, // Idot\n\t{0xf24a3a6b, 0x05b8}, // qamats1c\n\t{0xf2558e7a, 0x230a}, // floorleftbig\n\t{0xf2620ee8, 0x1e07}, // blinebelow\n\t{0xf26e5910, 0x045e}, // ushortcyrillic\n\t{0xf2b4963c, 0x09b0}, // rabengali\n\t{0xf2b826ec, 0x0449}, // shchacyrillic\n\t{0xf2c1d44e, 0x05be}, // maqafhebrew\n\t{0xf2c69081, 0x016e}, // Uring\n\t{0xf2dd8deb, 0x248d}, // sixperiod\n\t{0xf2e23a0c, 0xfb57}, // pehfinalarabic\n\t{0xf2e7f536, 0x0329}, // verticallinebelowcmb\n\t{0xf2f52e6c, 0x00ce}, // Icircumflex\n\t{0xf2f6e905, 0x24cd}, // Xcircle\n\t{0xf3086f4b, 0x2030}, // perthousand\n\t{0xf311fe21, 0xfece}, // ghainfinalarabic\n\t{0xf315dbae, 0xfe3c}, // blacklenticularbracketrightvertical\n\t{0xf336d994, 0xfef3}, // yehinitialarabic\n\t{0xf3527249, 0xfb67}, // ttehfinalarabic\n\t{0xf3935843, 0xff26}, // Fmonospace\n\t{0xf399cd14, 0x0074}, // t\n\t{0xf3c08521, 0x0431}, // afii10066\n\t{0xf3ce4ef0, 0x014a}, // Eng\n\t{0xf3cfe996, 0x05b8}, // qamatsde\n\t{0xf3ef0654, 0x2160}, // Oneroman\n\t{0xf41c3e87, 0x3182}, // yesieungsioskorean\n\t{0xf4266df0, 0x2253}, // imageorapproximatelyequal\n\t{0xf4584280, 0x05ea}, // tav\n\t{0xf4637345, 0x207a}, // plussuperior\n\t{0xf467a09a, 0x3066}, // tehiragana\n\t{0xf4728f62, 0x06f9}, // ninepersian\n\t{0xf47778a3, 0x0958}, // qadeva\n\t{0xf47c7f06, 0x05a5}, // merkhalefthebrew\n\t{0xf498c20b, 0xfb2c}, // shindageshshindothebrew\n\t{0xf4a2e6c9, 0xff8e}, // hokatakanahalfwidth\n\t{0xf4bd2095, 0xfb02}, // f_l\n\t{0xf4c721dd, 0x0415}, // afii10022\n\t{0xf4d1afd1, 0x015b}, // sacute\n\t{0xf4d731e8, 0x0e2b}, // hohipthai\n\t{0xf4d7dcfe, 0x05b0}, // sheva\n\t{0xf4ea5918, 0x0423}, // afii10037\n\t{0xf4f5b85f, 0x05bd}, // afii57839\n\t{0xf4fec4c5, 0x2026}, // ellipsis\n\t{0xf4fecbee, 0x3152}, // yaekorean\n\t{0xf526b2bc, 0x09f5}, // twonumeratorbengali\n\t{0xf53d898f, 0x0122}, // Gcedilla\n\t{0xf54df907, 0x02e8}, // tonebarlowmod\n\t{0xf573def2, 0x25ba}, // blackrightpointingpointer\n\t{0xf573f1ec, 0x24a4}, // iparen\n\t{0xf59704d9, 0xff4f}, // omonospace\n\t{0xf59943f5, 0x01d4}, // ucaron\n\t{0xf59f95da, 0x0399}, // Iota\n\t{0xf5a6729d, 0x247e}, // elevenparen\n\t{0xf5ab4f6d, 0x0458}, // afii10105\n\t{0xf5c2a87b, 0x0a14}, // augurmukhi\n\t{0xf5c40812, 0x2019}, // quoteright\n\t{0xf5cad972, 0x1ea6}, // Acircumflexgrave\n\t{0xf5e83826, 0x0986}, // aabengali\n\t{0xf5f606a8, 0x316e}, // mieumpieupkorean\n\t{0xf5f79af6, 0x23a3}, // bracketleftbt\n\t{0xf5fe99ee, 0x2017}, // underscoredbl\n\t{0xf61328eb, 0x2580}, // upblock\n\t{0xf61a2336, 0x0157}, // rcommaaccent\n\t{0xf6228c58, 0x20a3}, // franc\n\t{0xf6271ec7, 0x0429}, // afii10043\n\t{0xf630815e, 0x0577}, // shaarmenian\n\t{0xf64f0a5d, 0x30f9}, // vekatakana\n\t{0xf64f6666, 0xff44}, // dmonospace\n\t{0xf6545660, 0x3333}, // huiitosquare\n\t{0xf655e1cb, 0x316a}, // rieultikeutkorean\n\t{0xf66aa028, 0x215d}, // fiveeighths\n\t{0xf67e1ed1, 0x01a3}, // oi\n\t{0xf6886180, 0x3216}, // cieucaparenkorean\n\t{0xf68c8679, 0x3043}, // ismallhiragana\n\t{0xf68fb68d, 0x215b}, // oneeighth\n\t{0xf6909b76, 0x24a1}, // fparen\n\t{0xf6b386e5, 0x1e3c}, // Lcircumflexbelow\n\t{0xf6c0ec85, 0x1e5c}, // Rdotbelowmacron\n\t{0xf6f2a8b6, 0x0289}, // ubar\n\t{0xf7114d7b, 0x2502}, // SF110000\n\t{0xf7440454, 0x045e}, // afii10110\n\t{0xf757213f, 0x01d6}, // udieresismacron\n\t{0xf779fd74, 0x1ea0}, // Adotbelow\n\t{0xf7887f64, 0x24ba}, // Ecircle\n\t{0xf7994ed0, 0x0a6d}, // sevengurmukhi\n\t{0xf7c65164, 0x266d}, // musicflatsign\n\t{0xf7d4f2e3, 0x1e1e}, // Fdotaccent\n\t{0xf7ddf3cd, 0x0a17}, // gagurmukhi\n\t{0xf7de3a36, 0x3086}, // yuhiragana\n\t{0xf7edf1a3, 0x0403}, // Gjecyrillic\n\t{0xf7fe7207, 0x279e}, // arrowrightheavy\n\t{0xf7fec616, 0x1ec4}, // Ecircumflextilde\n\t{0xf81e4626, 0x0a02}, // bindigurmukhi\n\t{0xf8245f14, 0x30e6}, // yukatakana\n\t{0xf82ad190, 0x05e4}, // pehebrew\n\t{0xf8376f18, 0x0410}, // afii10017\n\t{0xf885c738, 0x30d3}, // bikatakana\n\t{0xf8868f94, 0xff8c}, // hukatakanahalfwidth\n\t{0xf8892150, 0x04a8}, // Haabkhasiancyrillic\n\t{0xf89be814, 0x0abc}, // nuktagujarati\n\t{0xf8e483f7, 0x1eb5}, // abrevetilde\n\t{0xf8ef289b, 0x21df}, // pagedown\n\t{0xf90377b2, 0x3151}, // yakorean\n\t{0xf90f516b, 0x0a5b}, // zagurmukhi\n\t{0xf9190810, 0x0203}, // ainvertedbreve\n\t{0xf929be43, 0x0ab6}, // shagujarati\n\t{0xf93a01ea, 0xfe6a}, // percentsmall\n\t{0xf952cde5, 0x1eae}, // Abreveacute\n\t{0xf95ad1c7, 0x0065}, // e\n\t{0xf95b34b0, 0x0660}, // afii57392\n\t{0xf976011b, 0x3399}, // fmsquare\n\t{0xf99ebcf4, 0x25c1}, // whiteleftpointingtriangle\n\t{0xf9bdabb3, 0x00e2}, // acircumflex\n\t{0xf9d67642, 0x00c8}, // Egrave\n\t{0xf9e5170b, 0x1eb6}, // Abrevedotbelow\n\t{0xf9e8161d, 0x3206}, // siosparenkorean\n\t{0xf9eeaebc, 0x002c}, // comma\n\t{0xf9f4a348, 0x2279}, // notgreaternorless\n\t{0xf9f6f2fe, 0xfe84}, // alefhamzaabovefinalarabic\n\t{0xf9f909db, 0x09f1}, // ralowerdiagonalbengali\n\t{0xfa1f37f7, 0x207d}, // parenleftsuperior\n\t{0xfa3ebdeb, 0xfb8b}, // jehfinalarabic\n\t{0xfa46e08a, 0x010a}, // Cdotaccent\n\t{0xfa6e953f, 0x0e13}, // nonenthai\n\t{0xfa7aad8b, 0x0e34}, // saraithai\n\t{0xfa85b29d, 0x0ae6}, // zerogujarati\n\t{0xfa8f771c, 0xfe82}, // alefmaddaabovefinalarabic\n\t{0xfa932832, 0x1ec9}, // ihookabove\n\t{0xfa9cd43f, 0x2488}, // oneperiod\n\t{0xfa9f7510, 0x1e6a}, // Tdotaccent\n\t{0xfaa7f693, 0xff1b}, // semicolonmonospace\n\t{0xfab3dba6, 0x3138}, // ssangtikeutkorean\n\t{0xfac03db8, 0x015e}, // Scedilla\n\t{0xfac092ef, 0x24de}, // ocircle\n\t{0xfad44b21, 0x278d}, // fourcircleinversesansserif\n\t{0xfadde282, 0x0539}, // Toarmenian\n\t{0xfaf8abd4, 0x05bb}, // qubuts25\n\t{0xfb0a35fb, 0xfb2b}, // afii57695\n\t{0xfb0e1bad, 0x2567}, // SF450000\n\t{0xfb1373b2, 0x30b9}, // sukatakana\n\t{0xfb161300, 0x049f}, // kastrokecyrillic\n\t{0xfb206015, 0x30b1}, // kekatakana\n\t{0xfb2465d5, 0x0468}, // Yuslittleiotifiedcyrillic\n\t{0xfb3e0b48, 0x01fc}, // AEacute\n\t{0xfb4678bc, 0xfe90}, // behfinalarabic\n\t{0xfb5bf4b4, 0x02cf}, // acutelowmod\n\t{0xfb5cfdc8, 0x095c}, // dddhadeva\n\t{0xfb764dd2, 0x21d3}, // arrowdbldown\n\t{0xfb7c1fd7, 0x0485}, // dasiapneumatacyrilliccmb\n\t{0xfbcf44c4, 0x018d}, // deltaturned\n\t{0xfbd1b93f, 0x33c4}, // squarecc\n\t{0xfbd50511, 0x04e8}, // Obarredcyrillic\n\t{0xfbf1fcde, 0x03e9}, // horicoptic\n\t{0xfc161b2f, 0x2499}, // eighteenperiod\n\t{0xfc18556b, 0x02bd}, // commareversedmod\n\t{0xfc1a2c97, 0x046c}, // Yusbigiotifiedcyrillic\n\t{0xfc2caf5c, 0x2285}, // notsuperset\n\t{0xfc3393bc, 0x0124}, // Hcircumflex\n\t{0xfc3a32c2, 0x0a8d}, // ecandragujarati\n\t{0xfc75d31c, 0x1ec6}, // Ecircumflexdotbelow\n\t{0xfc7e1ef8, 0x0952}, // anudattadeva\n\t{0xfc7ea01a, 0x04e6}, // Odieresiscyrillic\n\t{0xfc8020b6, 0xfb39}, // yoddageshhebrew\n\t{0xfc828b2d, 0x1ee4}, // Udotbelow\n\t{0xfc9cf271, 0x020d}, // odblgrave\n\t{0xfce47bc6, 0x05b7}, // patah\n\t{0xfce8ddc1, 0x1e0f}, // dlinebelow\n\t{0xfce9ddb5, 0x05aa}, // yerahbenyomohebrew\n\t{0xfcf6e2a9, 0x21ea}, // capslock\n\t{0xfd00e31a, 0x0303}, // tildecomb\n\t{0xfd0eac29, 0x0261}, // gscript\n\t{0xfd1397ce, 0x0412}, // Vecyrillic\n\t{0xfd166ead, 0x05e0}, // nunhebrew\n\t{0xfd2c8feb, 0x1ea4}, // Acircumflexacute\n\t{0xfd5ace9a, 0x057b}, // jheharmenian\n\t{0xfd6ac237, 0x221d}, // proportional\n\t{0xfd77296d, 0x04af}, // ustraightcyrillic\n\t{0xfd891a4c, 0x0948}, // aivowelsigndeva\n\t{0xfd8944f5, 0x0309}, // hookabovecomb\n\t{0xfd89977d, 0x0e50}, // zerothai\n\t{0xfd93a170, 0x239c}, // parenleftex\n\t{0xfd99bb06, 0xfb3c}, // lameddagesh\n\t{0xfdb6c57c, 0x2215}, // divisionslash\n\t{0xfdbbbec8, 0x090d}, // ecandradeva\n\t{0xfdc83f1f, 0x028d}, // wturned\n\t{0xfdd37935, 0x0422}, // afii10036\n\t{0xfdec640d, 0x0640}, // kashidaautoarabic\n\t{0xfdf32442, 0x3390}, // Hzsquare\n\t{0xfdf4c83e, 0x026e}, // lezh\n\t{0xfe3d55df, 0x064f}, // dammaarabic\n\t{0xfe407199, 0x2276}, // lessorgreater\n\t{0xfe7515f3, 0x03a9}, // Omegagreek\n\t{0xfe779a6a, 0x045a}, // afii10107\n\t{0xfea7088a, 0x0628}, // beharabic\n\t{0xfeb66fd9, 0xfec7}, // zahinitialarabic\n\t{0xfeb7f263, 0x0556}, // Feharmenian\n\t{0xfec7bc3b, 0x0651}, // shaddaarabic\n\t{0xfee2004d, 0x01fe}, // Ostrokeacute\n\t{0xfee5f25e, 0x2126}, // Omega\n\t{0xfee9d86c, 0x2295}, // pluscircle\n\t{0xfef651f8, 0x0688}, // afii57512\n\t{0xff5dadf4, 0x0193}, // Ghook\n\t{0xff81c116, 0x21cd}, // arrowleftdblstroke\n\t{0xff8c00d8, 0x3386}, // MBsquare\n\t{0xff8f2931, 0x30ae}, // gikatakana\n\t{0xff90fc92, 0x0923}, // nnadeva\n\t{0xff94689d, 0x04c0}, // palochkacyrillic\n\t{0xffe38169, 0x043f}, // pecyrillic\n\t{0xfffadc30, 0x2568}, // SF460000\n}};\n" }, { "path": "src/BasicDVIReader.cpp", "content": "/*************************************************************************\n** BasicDVIReader.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \"BasicDVIReader.hpp\"\n\nusing namespace std;\n\n\nBasicDVIReader::BasicDVIReader (std::istream &is) : StreamReader(is), _dviVersion(DVI_NONE)\n{\n}\n\n\nvoid BasicDVIReader::throwDVIException(const string &msg) const {\n\tthrow DVIException(msg + \" at position \" + to_string(tellg()));\n}\n\n\n/** Evaluates the next DVI command, and computes the corresponding handler.\n * @param[out] handler handler for current DVI command\n * @param[out] param the handler must be called with this parameter\n * @return opcode of current DVI command */\nint BasicDVIReader::evalCommand (CommandHandler &handler, int ¶m) {\n\tstruct DVICommand {\n\t\tCommandHandler handler;\n\t\tint length; // number of parameter bytes\n\t};\n\n\t/* Each cmdFOO command reads the necessary number of bytes from the stream, so executeCommand\n\tdoesn't need to know the exact DVI command format. Some cmdFOO methods are used for multiple\n\tDVI commands because they only differ in length of their parameters. */\n\tstatic const DVICommand commands[] = {\n\t\t{&BasicDVIReader::cmdSetChar, 1}, {&BasicDVIReader::cmdSetChar, 2}, // 128-129\n\t\t{&BasicDVIReader::cmdSetChar, 3}, {&BasicDVIReader::cmdSetChar, 4}, // 130-131\n\t\t{&BasicDVIReader::cmdSetRule, 8}, // 132\n\t\t{&BasicDVIReader::cmdPutChar, 1}, {&BasicDVIReader::cmdPutChar, 2}, // 133-134\n\t\t{&BasicDVIReader::cmdPutChar, 3}, {&BasicDVIReader::cmdPutChar, 4}, // 135-136\n\t\t{&BasicDVIReader::cmdPutRule, 8}, // 137\n\t\t{&BasicDVIReader::cmdNop, 0}, // 138\n\t\t{&BasicDVIReader::cmdBop, 44}, {&BasicDVIReader::cmdEop, 0}, // 139-140\n\t\t{&BasicDVIReader::cmdPush, 0}, {&BasicDVIReader::cmdPop, 0}, // 141-142\n\t\t{&BasicDVIReader::cmdRight, 1}, {&BasicDVIReader::cmdRight, 2}, // 143-144\n\t\t{&BasicDVIReader::cmdRight, 3}, {&BasicDVIReader::cmdRight, 4}, // 145-146\n\t\t{&BasicDVIReader::cmdW0, 0}, // 147\n\t\t{&BasicDVIReader::cmdW, 1}, {&BasicDVIReader::cmdW, 2}, // 148-149\n\t\t{&BasicDVIReader::cmdW, 3}, {&BasicDVIReader::cmdW, 4}, // 150-151\n\t\t{&BasicDVIReader::cmdX0, 0}, // 152\n\t\t{&BasicDVIReader::cmdX, 1}, {&BasicDVIReader::cmdX, 2}, // 153-154\n\t\t{&BasicDVIReader::cmdX, 3}, {&BasicDVIReader::cmdX, 4}, // 155-156\n\t\t{&BasicDVIReader::cmdDown, 1}, {&BasicDVIReader::cmdDown, 2}, // 157-158\n\t\t{&BasicDVIReader::cmdDown, 3}, {&BasicDVIReader::cmdDown, 4}, // 159-160\n\t\t{&BasicDVIReader::cmdY0, 0}, // 161\n\t\t{&BasicDVIReader::cmdY, 1}, {&BasicDVIReader::cmdY, 2}, // 162-163\n\t\t{&BasicDVIReader::cmdY, 3}, {&BasicDVIReader::cmdY, 4}, // 164-165\n\t\t{&BasicDVIReader::cmdZ0, 0}, // 166\n\t\t{&BasicDVIReader::cmdZ, 1}, {&BasicDVIReader::cmdZ, 2}, // 167-168\n\t\t{&BasicDVIReader::cmdZ, 3}, {&BasicDVIReader::cmdZ, 4}, // 169-170\n\n\t\t{&BasicDVIReader::cmdFontNum, 1}, {&BasicDVIReader::cmdFontNum, 2}, // 235-236\n\t\t{&BasicDVIReader::cmdFontNum, 3}, {&BasicDVIReader::cmdFontNum, 4}, // 237-238\n\t\t{&BasicDVIReader::cmdXXX, 1}, {&BasicDVIReader::cmdXXX, 2}, // 239-240\n\t\t{&BasicDVIReader::cmdXXX, 3}, {&BasicDVIReader::cmdXXX, 4}, // 241-242\n\t\t{&BasicDVIReader::cmdFontDef, 1}, {&BasicDVIReader::cmdFontDef, 2}, // 243-244\n\t\t{&BasicDVIReader::cmdFontDef, 3}, {&BasicDVIReader::cmdFontDef, 4}, // 245-246\n\t\t{&BasicDVIReader::cmdPre, 0}, {&BasicDVIReader::cmdPost, 0}, // 247-248\n\t\t{&BasicDVIReader::cmdPostPost, 0}, // 249\n\t};\n\n\tconst int opcode = readByte();\n\tif (!isStreamValid() || opcode < 0) // at end of file\n\t\tthrow DVIPrematureEOFException();\n\n\tint num_param_bytes = 0;\n\tparam = -1;\n\tif (opcode >= OP_SETCHAR0 && opcode <= OP_SETCHAR127) {\n\t\thandler = &BasicDVIReader::cmdSetChar0;\n\t\tparam = opcode;\n\t}\n\telse if (opcode >= OP_FNTNUM0 && opcode <= OP_FNTNUM63) {\n\t\thandler = &BasicDVIReader::cmdFontNum0;\n\t\tparam = opcode-OP_FNTNUM0;\n\t}\n\telse if (evalXDVOpcode(opcode, handler))\n\t\tnum_param_bytes = 0;\n\telse if (_dviVersion == DVI_PTEX && opcode == OP_DIR) { // direction command set by pTeX?\n\t\thandler = &BasicDVIReader::cmdDir;\n\t\tnum_param_bytes = 1;\n\t}\n\telse if (opcode > OP_POSTPOST)\n\t\tthrowDVIException(\"undefined DVI command (opcode \" + to_string(opcode) + \")\");\n\telse {\n\t\tconst int offset = opcode < OP_FNTNUM0 ? OP_SET1 : (OP_FNTNUM63+1)-(OP_FNTNUM0-OP_SET1);\n\t\thandler = commands[opcode-offset].handler;\n\t\tnum_param_bytes = commands[opcode-offset].length;\n\t}\n\tif (param < 0)\n\t\tparam = num_param_bytes;\n\treturn opcode;\n}\n\n\n/** Checks if a given opcode belongs to an XDV extension.\n * @param[in] op the opcode to check\n * @param[out] handler corresponding command handler if opcode is valid */\nbool BasicDVIReader::evalXDVOpcode (int op, CommandHandler &handler) const {\n\tstatic const struct {\n\t\tint min, max; // minimal and maximal opcode in XDV section\n\t} xdvranges[] = {\n\t\t{251, 254}, // XDV5\n\t\t{252, 253}, // XDV6\n\t\t{252, 254}, // XDV7\n\t};\n\tint index = _dviVersion-DVI_XDV5;\n\tif (_dviVersion < DVI_XDV5 || _dviVersion > DVI_XDV7 || op < xdvranges[index].min || op > xdvranges[index].max)\n\t\treturn false;\n\n\tstatic const CommandHandler handlers[] = {\n\t\t&BasicDVIReader::cmdXPic, // 251 (XDV5 only)\n\t\t&BasicDVIReader::cmdXFontDef, // 252\n\t\t&BasicDVIReader::cmdXGlyphArray, // 253\n\t\t&BasicDVIReader::cmdXTextAndGlyphs, // 254 (XDV7 only)\n\t\t&BasicDVIReader::cmdXGlyphString // 254 (XDV5 only)\n\t};\n\tindex = op-251;\n\tif (_dviVersion == DVI_XDV5 && op == 254)\n\t\tindex++;\n\thandler = handlers[index];\n\treturn true;\n}\n\n\n/** Reads a single DVI command from the current position of the input stream and calls the\n * corresponding cmdFOO method.\n * @return opcode of the executed command */\nint BasicDVIReader::executeCommand () {\n\tCommandHandler handler;\n\tint param; // parameter of handler\n\tint opcode = evalCommand(handler, param);\n\t(this->*handler)(param);\n\treturn opcode;\n}\n\n\nvoid BasicDVIReader::executePreamble () {\n\tclearStream();\n\tif (isStreamValid()) {\n\t\tseek(0);\n\t\tif (readByte() == OP_PRE) {\n\t\t\tcmdPre(0);\n\t\t\treturn;\n\t\t}\n\t}\n\tthrowDVIException(\"invalid DVI file (missing preamble)\");\n}\n\n\n/** Moves stream pointer to begin of postamble */\nvoid BasicDVIReader::goToPostamble () {\n\tclearStream();\n\tif (!isStreamValid())\n\t\tthrowDVIException(\"invalid DVI file (missing postamble)\");\n\n\tseek(-1, ios::end); // stream pointer to last byte\n\tint count=0;\n\twhile (peek() == DVI_FILL) { // skip fill bytes\n\t\tseek(-1, ios::cur);\n\t\tcount++;\n\t}\n\tif (count < 4) // the standard requires at least 4 trailing fill bytes\n\t\tthrowDVIException(\"missing fill bytes at end of file\");\n\n\tseek(-4, ios::cur); // now at first byte of q (pointer to begin of postamble)\n\tuint32_t q = readUnsigned(4); // pointer to begin of postamble\n\tseek(q); // now at begin of postamble\n}\n\n\n/** Reads and executes the commands of the postamble. */\nvoid BasicDVIReader::executePostamble () {\n\tgoToPostamble();\n\twhile (executeCommand() != OP_POSTPOST); // executes all commands until post_post (= 249) is reached\n}\n\n\nvoid BasicDVIReader::executePostPost () {\n\tclearStream(); // reset all status bits\n\tif (!isStreamValid())\n\t\tthrowDVIException(\"invalid DVI file (missing postpost)\");\n\n\tseek(-1, ios::end); // stream pointer to last byte\n\tint count=0;\n\twhile (peek() == DVI_FILL) { // count trailing fill bytes\n\t\tseek(-1, ios::cur);\n\t\tcount++;\n\t}\n\tif (count < 4) // the standard requires at least 4 trailing fill bytes\n\t\tthrowDVIException(\"missing fill bytes at end of file\");\n\n\tsetDVIVersion((DVIVersion)readUnsigned(1));\n}\n\n\nvoid BasicDVIReader::executeFontDefs () {\n\tgoToPostamble();\n\tseek(1+28, ios::cur); // now on first fontdef or postpost\n\tif (peek() != OP_POSTPOST)\n\t\twhile (executeCommand() != OP_POSTPOST);\n}\n\n\n/** Collects and records the file offsets of all bop commands. */\nvector BasicDVIReader::collectBopOffsets () {\n\tstd::vector bopOffsets;\n\tgoToPostamble();\n\tbopOffsets.push_back(tell()); // also add offset of postamble\n\treadByte(); // skip post command\n\tuint32_t offset = readUnsigned(4); // offset of final bop\n\twhile (int32_t(offset) != -1) { // not yet on first bop?\n\t\tbopOffsets.push_back(offset); // record offset\n\t\tseek(offset); // now on previous bop\n\t\tif (readByte() != OP_BOP)\n\t\t\tthrowDVIException(\"bop offset at \"+to_string(offset)+\" doesn't point to bop command\" );\n\t\tseek(40, ios::cur); // skip the 10 \\count values => now on offset of previous bop\n\t\tuint32_t prevOffset = readUnsigned(4);\n\t\tif ((prevOffset >= offset && int32_t(prevOffset) != -1))\n\t\t\tthrowDVIException(\"invalid bop offset at \"+to_string(tell()-static_cast(4)));\n\t\toffset = prevOffset;\n\t}\n\tstd::reverse(bopOffsets.begin(), bopOffsets.end());\n\treturn bopOffsets;\n}\n\n\nvoid BasicDVIReader::executeAllPages () {\n\tif (_dviVersion == DVI_NONE)\n\t\texecutePostPost(); // get version ID from post_post\n\tseek(0); // go to preamble\n\twhile (executeCommand() != OP_POST); // execute all commands until postamble is reached\n}\n\n\nvoid BasicDVIReader::setDVIVersion (DVIVersion version) {\n\t_dviVersion = max(_dviVersion, version);\n\tswitch (_dviVersion) {\n\t\tcase DVI_STANDARD:\n\t\tcase DVI_PTEX:\n\t\tcase DVI_XDV5:\n\t\tcase DVI_XDV6:\n\t\tcase DVI_XDV7:\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrowDVIException(\"DVI version \" + to_string(_dviVersion) + \" not supported\");\n\t}\n}\n\n/////////////////////////////////////\n\n/** Executes preamble command.\n * Format: pre i[1] num[4] den[4] mag[4] k[1] x[k] */\nvoid BasicDVIReader::cmdPre (int) {\n\tsetDVIVersion((DVIVersion)readUnsigned(1)); // identification number\n\tseek(12, ios::cur); // skip numerator, denominator, and mag factor\n\tuint32_t k = readUnsigned(1); // length of following comment\n\tseek(k, ios::cur); // skip comment\n}\n\n\n/** Executes postamble command.\n * Format: post p[4] num[4] den[4] mag[4] l[4] u[4] s[2] t[2] */\nvoid BasicDVIReader::cmdPost (int) {\n\tseek(28, ios::cur);\n}\n\n\n/** Executes postpost command.\n * Format: postpost q[4] i[1] 223's[>= 4] */\nvoid BasicDVIReader::cmdPostPost (int) {\n\tseek(4, ios::cur);\n\tsetDVIVersion((DVIVersion)readUnsigned(1)); // identification byte\n\twhile (readUnsigned(1) == DVI_FILL); // skip fill bytes (223), eof bit should be set now\n}\n\n\n/** Executes bop (begin of page) command.\n * Format: bop c0[+4] ... c9[+4] p[+4] */\nvoid BasicDVIReader::cmdBop (int) {seek(44, ios::cur);}\nvoid BasicDVIReader::cmdEop (int) {}\nvoid BasicDVIReader::cmdPush (int) {}\nvoid BasicDVIReader::cmdPop (int) {}\nvoid BasicDVIReader::cmdSetChar0 (int) {}\nvoid BasicDVIReader::cmdSetChar (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdPutChar (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdSetRule (int) {seek(8, ios::cur);}\nvoid BasicDVIReader::cmdPutRule (int) {seek(8, ios::cur);}\nvoid BasicDVIReader::cmdRight (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdDown (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdX0 (int) {}\nvoid BasicDVIReader::cmdY0 (int) {}\nvoid BasicDVIReader::cmdW0 (int) {}\nvoid BasicDVIReader::cmdZ0 (int) {}\nvoid BasicDVIReader::cmdX (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdY (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdW (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdZ (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdNop (int) {}\nvoid BasicDVIReader::cmdDir (int) {seek(1, ios::cur);}\nvoid BasicDVIReader::cmdFontNum0 (int) {}\nvoid BasicDVIReader::cmdFontNum (int len) {seek(len, ios::cur);}\nvoid BasicDVIReader::cmdXXX (int len) {seek(readUnsigned(len), ios::cur);}\n\n\n/** Executes fontdef command.\n * Format: fontdef k[len] c[4] s[4] d[4] a[1] l[1] n[a+l]\n * @param[in] len size of font number variable (in bytes) */\nvoid BasicDVIReader::cmdFontDef (int len) {\n\tseek(len+12, ios::cur); // skip font number\n\tuint32_t pathlen = readUnsigned(1); // length of font path\n\tuint32_t namelen = readUnsigned(1); // length of font name\n\tseek(pathlen+namelen, ios::cur);\n}\n\n\n/** XDV extension: include image or pdf file.\n * parameters: box[1] matrix[4][6] p[2] len[2] path[l] */\nvoid BasicDVIReader::cmdXPic (int) {\n\tseek(1+24+2, ios::cur);\n\tuint16_t len = readUnsigned(2);\n\tseek(len, ios::cur);\n}\n\n\nvoid BasicDVIReader::cmdXFontDef (int) {\n\tseek(4+4, ios::cur);\n\tuint16_t flags = readUnsigned(2);\n\tuint8_t len = readUnsigned(1);\n\tif (_dviVersion == DVI_XDV5)\n\t\tlen += readUnsigned(1)+readUnsigned(1);\n\tseek(len, ios::cur);\n\tif (_dviVersion >= DVI_XDV6)\n\t\tseek(4, ios::cur); // skip subfont index\n\tif (flags & 0x0200) // colored?\n\t\tseek(4, ios::cur);\n\tif (flags & 0x1000) // extend?\n\t\tseek(4, ios::cur);\n\tif (flags & 0x2000) // slant?\n\t\tseek(4, ios::cur);\n\tif (flags & 0x4000) // embolden?\n\t\tseek(4, ios::cur);\n\tif ((flags & 0x0800) && (_dviVersion == DVI_XDV5)) { // variations?\n\t\tuint16_t num_variations = readSigned(2);\n\t\tseek(4*num_variations, ios::cur);\n\t}\n}\n\n\n/** XDV extension: prints an array of characters where each character\n * can take independent x and y coordinates.\n * parameters: w[4] n[2] xy[(4+4)n] g[2n] */\nvoid BasicDVIReader::cmdXGlyphArray (int) {\n\tseek(4, ios::cur);\n\tuint16_t num_glyphs = readUnsigned(2);\n\tseek(10*num_glyphs, ios::cur);\n}\n\n\n/** XDV extension: prints an array/string of characters where each character\n * can take independent x coordinates whereas all share a single y coordinate.\n * parameters: w[4] n[2] x[4n] y[4] g[2n] */\nvoid BasicDVIReader::cmdXGlyphString (int) {\n\tseek(4, ios::cur);\n\tuint16_t num_glyphs = readUnsigned(2);\n\tseek(6*num_glyphs, ios::cur);\n}\n\n\n/** XDV extension: Same as cmdXGlyphArray plus a leading array of UTF-16 characters\n * that specify the \"actual text\" represented by the glyphs to be printed. It usually\n * contains the text with special characters (like ligatures) expanded so that it\n * can be used for text search, plain text copy & paste etc. This XDV command was\n * introduced with XeTeX 0.99995 and can be triggered by \\\\XeTeXgenerateactualtext1.\n * parameters: l[2] t[2l] w[4] n[2] xy[8n] g[2n] */\nvoid BasicDVIReader::cmdXTextAndGlyphs (int) {\n\tuint16_t l = readUnsigned(2);\n\tseek(2*l, ios::cur);\n\tcmdXGlyphArray(0);\n}\n" }, { "path": "src/BasicDVIReader.hpp", "content": "/*************************************************************************\n** BasicDVIReader.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef BASICDVIREADER_HPP\n#define BASICDVIREADER_HPP\n\n#include \n\n#include \"Matrix.hpp\"\n#include \"MessageException.hpp\"\n#include \"StreamReader.hpp\"\n\nstruct DVIException : MessageException {\n\texplicit DVIException (const std::string &msg) : MessageException(msg) {}\n};\n\n\nstruct DVIPrematureEOFException : DVIException {\n\texplicit DVIPrematureEOFException () : DVIException(\"premature end of DVI stream\") {}\n};\n\n\n/** This class provides the basic functionality to read a DVI file.\n * It just skips all DVI commands and apply any semantic to it. The latter must\n * be realized by deriving a separate class that implements the cmdXXX template\n * methods. These are low-level functions that represent the DVI commands and\n * require to read and evaluate the correct portion of data from the DVI stream.\n * Since the DVI commands are almost skipped by advancing the file pointer,\n * running through a DVI file is pretty fast. */\nclass BasicDVIReader : public StreamReader {\n\tprotected:\n\t\tusing CommandHandler = void (BasicDVIReader::*)(int);\n\t\tenum DVIVersion {DVI_NONE=0, DVI_STANDARD=2, DVI_PTEX=3, DVI_XDV5=5, DVI_XDV6=6, DVI_XDV7=7};\n\t\tconst uint8_t OP_SETCHAR0=0, OP_SETCHAR127=127, OP_SET1=128, OP_BOP=139, OP_EOP=140, OP_FNTNUM0=171,\n\t\t\tOP_FNTNUM63=234, OP_PRE=247, OP_POST=248, OP_POSTPOST=249, OP_DIR=255, DVI_FILL=223;\n\n\tpublic:\n\t\texplicit BasicDVIReader (std::istream &is);\n\t\tvirtual void executeAllPages ();\n\t\tvirtual void executeFontDefs ();\n\t\tvirtual double getXPos () const {return 0;}\n\t\tvirtual double getYPos () const {return 0;}\n\t\tvirtual void finishLine () {}\n\t\tvirtual void translateToX (double x) {}\n\t\tvirtual void translateToY (double y) {}\n\t\tvirtual int stackDepth () const {return 0;}\n\t\tvirtual Matrix getPageTransformation () const {return Matrix(1);}\n\t\tvirtual unsigned currentPageNumber () const {return 0;}\n\n\tprotected:\n\t\tvoid throwDVIException (const std::string &msg) const;\n\t\tvoid setDVIVersion (DVIVersion version);\n\t\tDVIVersion getDVIVersion () const {return _dviVersion;}\n\t\tvirtual int evalCommand (CommandHandler &handler, int ¶m);\n\t\tvirtual int executeCommand ();\n\t\tvoid executePreamble ();\n\t\tvoid executePostamble ();\n\t\tvoid executePostPost ();\n\t\tvoid goToPostamble ();\n\t\tstd::vector collectBopOffsets ();\n\t\tbool evalXDVOpcode (int op, CommandHandler &handler) const;\n\n\t\t// The following template methods represent the single DVI commands. They\n\t\t// must read the correct chunk of data from the input stream in order to\n\t\t// process the DVI file correctly.\n\t\tvirtual void cmdSetChar0 (int c);\n\t\tvirtual void cmdSetChar (int len);\n\t\tvirtual void cmdPutChar (int len);\n\t\tvirtual void cmdSetRule (int len);\n\t\tvirtual void cmdPutRule (int len);\n\t\tvirtual void cmdNop (int len);\n\t\tvirtual void cmdBop (int len);\n\t\tvirtual void cmdEop (int len);\n\t\tvirtual void cmdPush (int len);\n\t\tvirtual void cmdPop (int len);\n\t\tvirtual void cmdDir (int len);\n\t\tvirtual void cmdRight (int len);\n\t\tvirtual void cmdDown (int len);\n\t\tvirtual void cmdX0 (int len);\n\t\tvirtual void cmdY0 (int len);\n\t\tvirtual void cmdW0 (int len);\n\t\tvirtual void cmdZ0 (int len);\n\t\tvirtual void cmdX (int len);\n\t\tvirtual void cmdY (int len);\n\t\tvirtual void cmdW (int len);\n\t\tvirtual void cmdZ (int len);\n\t\tvirtual void cmdFontDef (int len);\n\t\tvirtual void cmdFontNum0 (int n);\n\t\tvirtual void cmdFontNum (int len);\n\t\tvirtual void cmdXXX (int len);\n\t\tvirtual void cmdPre (int len);\n\t\tvirtual void cmdPost (int len);\n\t\tvirtual void cmdPostPost (int len);\n\t\tvirtual void cmdXFontDef (int len); // XDV only\n\t\tvirtual void cmdXGlyphArray (int len); // XDV only\n\t\tvirtual void cmdXGlyphString (int len); // XDV version 5 only\n\t\tvirtual void cmdXPic (int len); // XDV version 5 only\n\t\tvirtual void cmdXTextAndGlyphs (int len); // XDV version 7 only\n\n\tprivate:\n\t\tDVIVersion _dviVersion; ///< DVI version of file being processed\n};\n\n#endif\n" }, { "path": "src/Bezier.cpp", "content": "/*************************************************************************\n** Bezier.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \"algorithm.hpp\"\n#include \"Bezier.hpp\"\n#include \"Matrix.hpp\"\n#include \"utility.hpp\"\n\nusing namespace std;\n\nQuadBezier::QuadBezier () {\n\t_points[0] = _points[1] = _points[2] = DPair(0, 0);\n}\n\n\nQuadBezier::QuadBezier (const DPair &p0, const DPair &p1, const DPair &p2) {\n\tsetPoints(p0, p1, p2);\n}\n\n\nvoid QuadBezier::setPoints(const DPair &p0, const DPair &p1, const DPair &p2) {\n\t_points[0] = p0;\n\t_points[1] = p1;\n\t_points[2] = p2;\n}\n\n\n/** Returns the value (curve point) at t. */\nDPair QuadBezier::valueAt (double t) const {\n\tconst double s = 1-t;\n\treturn _points[0]*s*s + _points[1]*2.0*s*t + _points[2]*t*t;\n}\n\n\n/** Returns the value of the first derivative of the curve at t. */\nDPair QuadBezier::derivativeAt (double t) const {\n\treturn _points[0]*(2*t-2) + _points[1]*(2-4*t) + _points[2]*(2*t);\n}\n\n\n/** Returns the arc length of the curve from 0 to t. */\ndouble QuadBezier::arclen (double t) const {\n\treturn math::integral(0, t, 20, [this](double t) -> double {\n\t\tDPair deriv = derivativeAt(t);\n\t\treturn sqrt(deriv.x()*deriv.x() + deriv.y()*deriv.y());\n\t});\n}\n\n\n////////////////////////////////////////////////////////////////////////////////\n\n\nCubicBezier::CubicBezier () {\n\t_points[0] = _points[1] = _points[2] = _points[3] = DPair(0, 0);\n}\n\n\nCubicBezier::CubicBezier (const DPair &p0, const DPair &p1, const DPair &p2, const DPair &p3) {\n\tsetPoints(p0, p1, p2, p3);\n}\n\n\n/** Creates a subcurve of a given Bézier curve.\n * @param[in] source original curve to be clipped\n * @param[in] t0 'time' parameter \\f$\\in[0,1]\\f$ of source curve where the subcurve starts\n * @param[in] t1 'time' parameter \\f$\\in[0,1]\\f$ of source curve where the subcurve ends */\nCubicBezier::CubicBezier (const CubicBezier &source, double t0, double t1) {\n\tif (t0 == t1)\n\t\t_points[0] = _points[1] = _points[2] = _points[3] = source.valueAt(t0);\n\telse {\n\t\tif (t0 > t1)\n\t\t\tswap(t0, t1);\n\t\tif (t0 == 0)\n\t\t\tsource.subdivide(t1, this, nullptr);\n\t\telse if (t1 == 1)\n\t\t\tsource.subdivide(t0, nullptr, this);\n\t\telse {\n\t\t\tCubicBezier subcurve;\n\t\t\tsource.subdivide(t0, nullptr, &subcurve);\n\t\t\tsubcurve.subdivide((t1-t0)/(1-t0), this, nullptr);\n\t\t}\n\t}\n}\n\n\n/** Creates a cubic Bézier from a quadratic one. */\nCubicBezier::CubicBezier (const QuadBezier &qbezier) {\n\tconst DPair &p0 = qbezier.point(0);\n\tconst DPair &p1 = qbezier.point(1);\n\tconst DPair &p2 = qbezier.point(2);\n\tsetPoints(p0, p0+(p1-p0)*2.0/3.0, p2+(p1-p2)*2.0/3.0, p2);\n}\n\n\nvoid CubicBezier::setPoints(const DPair &p0, const DPair &p1, const DPair &p2, const DPair &p3) {\n\t_points[0] = p0;\n\t_points[1] = p1;\n\t_points[2] = p2;\n\t_points[3] = p3;\n}\n\n\nvoid CubicBezier::reverse() {\n\tswap(_points[0], _points[3]);\n\tswap(_points[1], _points[2]);\n}\n\n\nDPair CubicBezier::valueAt (double t) const {\n\tconst double s = 1-t;\n\treturn _points[0]*s*s*s + _points[1]*3.0*s*s*t + _points[2]*3.0*s*t*t + _points[3]*t*t*t;\n}\n\n\n/** Returns a value of the Bézier curve's blossom representation. */\nDPair CubicBezier::blossomValue (double u, double v, double w) const {\n\tconst double uv = u*v;\n\tconst double uw = u*w;\n\tconst double vw = v*w;\n\tconst double uvw = u*v*w;\n\treturn _points[0]*(1.0-u-v-w+uv+uw+vw-uvw)\n\t\t+_points[1]*(u+v+w-2.0*(uv+uw+vw)+3.0*uvw)\n\t\t+_points[2]*(uv+uw+vw-3.0*uvw)\n\t\t+_points[3]*uvw;\n}\n\n\n/** Splits the curve at t into two sub-curves. */\nvoid CubicBezier::subdivide (double t, CubicBezier *bezier1, CubicBezier *bezier2) const {\n\tconst double s = 1-t;\n\tDPair p01 = _points[0]*s + _points[1]*t;\n\tDPair p12 = _points[1]*s + _points[2]*t;\n\tDPair p23 = _points[2]*s + _points[3]*t;\n\tDPair p012 = p01*s + p12*t;\n\tDPair p123 = p12*s + p23*t;\n\tDPair p0123 = p012*s + p123*t;\n\tif (bezier1)\n\t\tbezier1->setPoints(_points[0], p01, p012, p0123);\n\tif (bezier2)\n\t\tbezier2->setPoints(p0123, p123, p23, _points[3]);\n}\n\n\n/** Approximates the current Bézier curve by a sequence of line segments.\n * This is done by subdividing the curve several times using De Casteljau's algorithm.\n * If a sub-curve is almost flat, i.e. \\f$\\sum\\limits_{k=0}^2 |p_{k+1}-p_k| - |p_3-p_0| < \\delta\\f$,\n * the curve is not further subdivided.\n * @param[in] delta threshold where to stop further subdivisions (see description above)\n * @param[out] p the resulting sequence of points defining the start/end points of the line segments\n * @param[out] t corresponding curve parameters of the approximated points p: \\f$ b(t_i)=p_i \\f$\n * @return number of points in vector p */\nint CubicBezier::approximate (double delta, std::vector &p, vector *t) const {\n\tp.push_back(_points[0]);\n\tif (t)\n\t\tt->push_back(0);\n\treturn approximate(delta, 0, 1, p, t);\n}\n\n\nint CubicBezier::approximate (double delta, double t0, double t1, vector &p, vector *t) const {\n\t// compute distance of adjacent control points\n\tconst double l01 = (_points[1]-_points[0]).length();\n\tconst double l12 = (_points[2]-_points[1]).length();\n\tconst double l23 = (_points[3]-_points[2]).length();\n\tconst double l03 = (_points[3]-_points[0]).length();\n\tif (l01+l12+l23-l03 < delta) { // is curve flat enough?\n\t\tp.push_back(_points[3]); // => store endpoint\n\t\tif (t)\n\t\t\tt->push_back(t1);\n\t}\n\telse {\n\t\t// subdivide curve at b(0.5) and approximate the resulting parts separately\n\t\tCubicBezier b1, b2;\n\t\tsubdivide(0.5, &b1, &b2);\n\t\tdouble tmid = (t0+t1)/2;\n\t\tb1.approximate(delta, t0, tmid, p, t);\n\t\tb2.approximate(delta, tmid, t1, p, t);\n\t}\n\treturn static_cast(p.size());\n}\n\n\n/** Returns the signed area of the triangle (p1, p2, p3). */\nstatic inline double signed_area (const DPair &p1, const DPair &p2, const DPair &p3) {\n\treturn ((p2.x()-p1.x())*(p3.y()-p1.y()) - (p3.x()-p1.x())*(p2.y()-p1.y()))/2.0;\n}\n\n\nstatic inline double dot_prod (const DPair &p1, const DPair &p2) {\n\treturn p1.x()*p2.x() + p1.y()*p2.y();\n}\n\n\n/** Returns true if p3 is located between p1 and p2, i.e. p3 lays almost on the line\n * between p1 and p2. */\nstatic bool between (const DPair &p1, const DPair &p2, const DPair &p3, double delta) {\n\tdouble sqr_dist = dot_prod(p2-p1, p2-p1);\n\tdouble factor = sqr_dist == 0.0 ? 1.0 : sqr_dist;\n\tdouble area2 = abs(signed_area(p1, p2, p3));\n\treturn area2*area2/factor < delta // does p3 lay almost on the line through p1 and p2...\n\t\t&& min(p1.x(), p2.x()) <= p3.x() // ...and on or inside the rectangle spanned by p1 and p2?\n\t\t&& max(p1.x(), p2.x()) >= p3.x()\n\t\t&& min(p1.y(), p2.y()) <= p3.y()\n\t\t&& max(p1.y(), p2.y()) >= p3.y();\n}\n\n\nstatic inline bool near (const DPair &p1, const DPair &p2, double delta) {\n\tDPair diff = p2-p1;\n\treturn abs(diff.x()) < delta && abs(diff.y()) < delta;\n}\n\n\n/** Tries to reduce the degree of the Bézier curve. This only works if the number of\n * control points can be reduces without changing the shape of the curve significantly.\n * @param[in] delta deviation tolerance\n * @param[in] p control points of the reduced curve\n * @return degree of the reduced curve */\nint CubicBezier::reduceDegree (double delta, vector &p) const {\n\tp.clear();\n\tif (near(_points[0], _points[1], delta) && near(_points[0], _points[2], delta) && near(_points[0], _points[3], delta))\n\t\tp.push_back(_points[0]);\n\telse if (between(_points[0], _points[3], _points[1], delta) && between(_points[0], _points[3], _points[2], delta)) {\n\t\tp.push_back(_points[0]);\n\t\tp.push_back(_points[3]);\n\t}\n\telse if (near((_points[1]-_points[0])*1.5+_points[0], (_points[2]-_points[3])*1.5+_points[3], delta)) {\n\t\tp.push_back(_points[0]);\n\t\tp.push_back((_points[1]-_points[0])*1.5 + _points[0]);\n\t\tp.push_back(_points[3]);\n\t}\n\telse {\n\t\tp.resize(4);\n\t\tfor (int i=0; i < 4; i++)\n\t\t\tp[i] = _points[i];\n\t}\n\treturn static_cast(p.size()-1);\n}\n\n\n/** Approximates the cubic Bézier curve by a sequence of quadratic ones.\n * @param[in] precision specifies the precision of the approximation\n * @param[out] splitParams parameters t where the curve was split\n * @return map containing the split parameters t_n together with the qudratic curves */\nvector CubicBezier::toQuadBeziers (double precision, vector *splitParams) const {\n\tvector qbeziers;\n\ttoQuadBeziers(0, 1, precision, qbeziers, splitParams);\n\treturn qbeziers;\n}\n\n\n/** Returns the \"mid-point approximation\" of this cubic Bézier. */\nQuadBezier CubicBezier::midpointApproximation () const {\n\t DPair p0 = (_points[1]*3.0 - _points[0])/2.0;\n\t DPair p1 = (_points[2]*3.0 - _points[3])/2.0;\n\t return {_points[0], (p0+p1)/2.0, _points[3]};\n}\n\n\n/** Approximates a segment of a cubic Bézier curve by a sequence of quadratic curves.\n * The quadratic segments are computed by adaptive subdivision of the cubic curve\n * as described at http://www.caffeineowl.com/graphics/2d/vectorial/cubic2quad01.html\n * @param[in] t0 curve parameter of the segment's start point\n * @param[in] t1 curve parameter of the segment's end point\n * @param[in] precision maximum allowed distance between the curve points b(t) and the\n * \tcorresponding approximated point c(t) on the quadratic curve\n * @param[out] qbeziers the resulting quadratic curves sorted in ascending order by their split points\n * @param[out] startParams the start parameters t[k] of the curves qbeziers[k] relative to *this. */\nvoid CubicBezier::toQuadBeziers (double t0, double t1, double precision, vector &qbeziers, vector *startParams) const {\n\t// If -p0+3p1-3p2+p3 = 0, the degree of the curve is <= 2 and it's not necessary do any approximation.\n\t// In this case, the control point of the quadratic Bézier curve is (-p0+3p1)/2 = (3p2-p3)/2.\n\t// Otherwise, the distance d between q1:=(-p0+3p1)/2 and q2:=(3p2-p3)/2 is != 0.\n\t// Now we compute the quadratic Bézier with start point p0, end point p3, and control point (q1+q2)/2,\n\t// the \"mid-point approximation\" (MPA) of b.\n\t// The maximal distance between the points of the original curve b and the corresponding ones\n\t// on the MPA is d*sqrt(3)/18. The same computations can be done for the cubic curves we get\n\t// when subdividing b at a parameter t. The maximal distance of these curves to their MPA\n\t// is t^3*d*sqrt(3)/18.\n\t// Based on the formula for this distance we compute the split point tmax for a given precision\n\t// and check 3 cases:\n\t// * tmax >= 1: curve is quadratic, return MPA of b\n\t// * tmax >= 0.5: split b at t=0.5, return the MPAs of both segments\n\t// * tmax < 0.5: split b at tmax and 1-tmax, return the MPAs of the first and third segment,\n\t// recurse the algorithm for the middle segment\n\tDPair q1 = (_points[1]*3.0 - _points[0])/2.0;\n\tDPair q2 = (_points[2]*3.0 - _points[3])/2.0;\n\tdouble dist = (q2-q1).length();\n\tdouble tmax3 = 18.0/sqrt(3.0)*precision/dist; // the cube of tmax\n\tif (tmax3 >= 1.0) {\n\t\t// curve is already quadratic, no subdivision necessary, return MPA\n\t\tqbeziers.emplace_back(_points[0], (q1+q2)/2.0, _points[3]);\n\t\tif (startParams)\n\t\t\tstartParams->push_back(t0);\n\t}\n\telse if (tmax3 >= 0.125) { // tmax >= 0.5\n\t\t// split the curve at t=0.5 and compute the MPA for both segments\n\t\tCubicBezier cbezier1, cbezier2;\n\t\tsubdivide(0.5, &cbezier1, &cbezier2);\n\t\tqbeziers.emplace_back(cbezier1.midpointApproximation());\n\t\tqbeziers.emplace_back(cbezier2.midpointApproximation());\n\t\tif (startParams) {\n\t\t\tstartParams->push_back(t0);\n\t\t\tstartParams->push_back((t0+t1)/2);\n\t\t}\n\t}\n\telse { // tmax < 0.5\n\t\tdouble tmax = cbrt(tmax3);\n\t\tdouble smax = 1.0-tmax;\n\t\tdouble dt = t1-t0;\n\t\t// first segment can be approximated by its MPA\n\t\tqbeziers.emplace_back(CubicBezier(*this, 0, tmax).midpointApproximation());\n\t\tif (startParams)\n\t\t\tstartParams->push_back(t0);\n\t\t// recurse for middle segment\n\t\tCubicBezier(*this, tmax, smax).toQuadBeziers(t0+tmax*dt, t0+smax*dt, precision, qbeziers, startParams);\n\t\t// third segment can be approximated by its MPA\n\t\tqbeziers.emplace_back(CubicBezier(*this, smax, 1).midpointApproximation());\n\t\tif (startParams)\n\t\t\tstartParams->push_back(smax);\n\t}\n}\n\n\n/** Try to solve the quadratic equation ax^2 + bx + c = 0. */\nstatic bool solve_quadratic_equation (double a, double b, double c, double &x1, double &x2) {\n\tif (a == 0) {\n\t\tif (b == 0)\n\t\t\treturn false;\n\t\tx1 = x2 = -c/b;\n\t}\n\telse {\n\t\tdouble discr = b*b - 4*a*c;\n\t\tif (discr < 0)\n\t\t\treturn false;\n\t\tdouble p = -b/a/2;\n\t\tdouble r = sqrt(discr)/a/2;\n\t\tx1 = p+r;\n\t\tx2 = p-r;\n\t}\n\treturn true;\n}\n\n\n/** Returns a tight bounding box parallel to the x- and y-axis. */\nBoundingBox CubicBezier::getBBox () const {\n\tBoundingBox bbox;\n\t// coefficients of the derivative\n\tDPair pa = _points[3] - _points[2]*3.0 + _points[1]*3.0 - _points[0];\n\tDPair pb = (_points[2]-_points[1]*2.0+_points[0])*2.0;\n\tDPair pc = _points[1]-_points[0];\n\n\t// compute extrema for t > 0 and t < 1\n\tdouble t1, t2;\n\tif (solve_quadratic_equation(pa.x(), pb.x(), pc.x(), t1, t2)) {\n\t\tif (t1 > 0.001 && t1 < 0.999)\n\t\t\tbbox.embed(valueAt(t1));\n\t\tif (t1 != t2 && t2 > 0.001 && t2 < 0.999)\n\t\t\tbbox.embed(valueAt(t2));\n\t}\n\tif (solve_quadratic_equation(pa.y(), pb.y(), pc.y(), t1, t2)) {\n\t\tif (t1 > 0.001 && t1 < 0.999)\n\t\t\tbbox.embed(valueAt(t1));\n\t\tif (t1 != t2 && t2 > 0.001 && t2 < 0.999)\n\t\t\tbbox.embed(valueAt(t2));\n\t}\n\tbbox.embed(_points[0]);\n\tbbox.embed(_points[3]);\n\treturn bbox;\n}\n\n\nCubicBezier& CubicBezier::transform (const Matrix &matrix) {\n\talgo::transform(_points, begin(_points), [&matrix](const DPair &p) {\n\t\treturn matrix * p;\n\t});\n\treturn *this;\n}\n\n" }, { "path": "src/Bezier.hpp", "content": "/*************************************************************************\n** Bezier.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef BEZIER_HPP\n#define BEZIER_HPP\n\n#include \n#include \"BoundingBox.hpp\"\n#include \"Pair.hpp\"\n\nclass Matrix;\n\nclass QuadBezier {\n\tpublic:\n\t\tQuadBezier ();\n\t\tQuadBezier (const DPair &p0, const DPair &p1, const DPair &p2);\n\t\tvoid setPoints (const DPair &p0, const DPair &p1, const DPair &p2);\n\t\tconst DPair& point (int i) const {return _points[i];}\n\t\tDPair valueAt (double t) const;\n\t\tDPair derivativeAt (double t) const;\n\t\tdouble arclen (double t=1.0) const;\n\n\tprivate:\n\t\tDPair _points[3];\n};\n\n\nclass CubicBezier {\n\tpublic:\n\t\tCubicBezier ();\n\t\t//CubicBezier (const DPair &p0, const DPair &p1, const DPair &p2);\n\t\tCubicBezier (const DPair &p0, const DPair &p1, const DPair &p2, const DPair &p3);\n\t\tCubicBezier (double x0, double y0, double x1, double y1, double x2, double y2, double x3, double y3);\n\t\tCubicBezier (const CubicBezier &source, double t0, double t1);\n\t\texplicit CubicBezier (const QuadBezier &qbezier);\n\t\tvoid setPoints (const DPair &p0, const DPair &p1, const DPair &p2, const DPair &p3);\n\t\tvoid reverse ();\n\t\tDPair valueAt (double t) const;\n\t\tDPair blossomValue (double u, double v, double w) const;\n\t\tvoid subdivide (double t, CubicBezier *bezier1, CubicBezier *bezier2) const;\n\t\tCubicBezier& transform (const Matrix &matrix);\n\t\tint approximate (double delta, std::vector &p, std::vector *t=nullptr) const;\n\t\tconst DPair& point (int i) const {return _points[i];}\n\t\tint reduceDegree (double delta, std::vector &p) const;\n\t\tstd::vector toQuadBeziers (double delta, std::vector *startParams=nullptr) const;\n\t\tBoundingBox getBBox () const;\n\n\tprotected:\n\t\tint approximate (double delta, double t0, double t1, std::vector &p, std::vector *t) const;\n\t\tvoid toQuadBeziers (double t0, double t1, double precision, std::vector &qbeziers, std::vector *startParams) const;\n\t\tQuadBezier midpointApproximation () const;\n\n\tprivate:\n\t\tDPair _points[4];\n};\n\n#endif\n" }, { "path": "src/BgColorSpecialHandler.cpp", "content": "/*************************************************************************\n** BgColorSpecialHandler.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \"algorithm.hpp\"\n#include \"BgColorSpecialHandler.hpp\"\n#include \"ColorSpecialHandler.hpp\"\n#include \"SpecialActions.hpp\"\n\nusing namespace std;\n\n\n/** Collect all background color changes while preprocessing the DVI file.\n * We need them in order to apply the correct background colors even if\n * not all but only selected DVI pages are converted. */\nvoid BgColorSpecialHandler::preprocess (const string&, std::istream &is, SpecialActions &actions) {\n\tColor color = ColorSpecialHandler::readColor(is);\n\tif (_pageColors.empty() || _pageColors.back().second != color) {\n\t\tunsigned pageno = actions.getCurrentPageNumber();\n\t\tif (!_pageColors.empty() && _pageColors.back().first == pageno)\n\t\t\t_pageColors.back().second = color;\n\t\telse\n\t\t\t_pageColors.emplace_back(pageno, color);\n\t}\n}\n\n\nbool BgColorSpecialHandler::process (const string&, istream&, SpecialActions&) {\n\treturn true;\n}\n\n\nvoid BgColorSpecialHandler::dviBeginPage (unsigned pageno, SpecialActions &actions) {\n\t// Ensure that the background color of the preceding page is set as the\n\t// default background color of the current page because this special affects\n\t// the current and all subsequent pages until the next change.\n\t// See the documentation of the color package, section 3.5.\n\tif (_pageColors.empty())\n\t\treturn;\n\t// find number of page with bg color change not lower than the current one\n\tauto it = algo::lower_bound(_pageColors, PageColor(pageno, Color::BLACK));\n\tif (it != _pageColors.end() && it->first == pageno)\n\t\tactions.setBgColor(it->second);\n\telse if (it != _pageColors.begin())\n\t\tactions.setBgColor((--it)->second);\n}\n\n\nvector BgColorSpecialHandler::prefixes () const {\n\tvector pfx {\"background\"};\n\treturn pfx;\n}\n" }, { "path": "src/BgColorSpecialHandler.hpp", "content": "/*************************************************************************\n** BgColorSpecialHandler.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef BGCOLORSPECIALHANDLER_HPP\n#define BGCOLORSPECIALHANDLER_HPP\n\n#include \n#include \"Color.hpp\"\n#include \"SpecialHandler.hpp\"\n\n\nclass BgColorSpecialHandler : public SpecialHandler {\n\tpublic:\n\t\tvoid preprocess (const std::string &prefix, std::istream &is, SpecialActions &actions) override;\n\t\tbool process (const std::string &prefix, std::istream &is, SpecialActions &actions) override;\n\t\tconst char* info () const override {return \"background color special\";}\n\t\tconst char* name () const override {return handlerName();}\n\t\tstatic const char* handlerName () {return \"bgcolor\";}\n\t\tstd::vector prefixes () const override;\n\n\tprotected:\n\t\tvoid dviBeginPage (unsigned pageno, SpecialActions &actions) override;\n\n\tprivate:\n\t\tusing PageColor = std::pair; // page number and color\n\t\tstd::vector _pageColors;\n};\n\n#endif\n" }, { "path": "src/Bitmap.cpp", "content": "/*************************************************************************\n** Bitmap.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \n#include \"Bitmap.hpp\"\n\nusing namespace std;\n\n\n/** Constructs a Bitmap */\nBitmap::Bitmap (int minx, int maxx, int miny , int maxy) {\n\tresize(minx, maxx, miny, maxy);\n}\n\n\n/** Resizes the bitmap and clears all pixels.\n * @param[in] minx index of leftmost pixel column\n * @param[in] maxx index of rightmost pixel column\n * @param[in] miny index of bottom row\n * @param[in] maxy index of top row */\nvoid Bitmap::resize (int minx, int maxx, int miny , int maxy) {\n\t_rows = abs(maxy-miny)+1;\n\t_cols = abs(maxx-minx)+1;\n\t_xshift = minx;\n\t_yshift = miny;\n\t_bpr = _cols/8 + (_cols % 8 ? 1 : 0); // bytes per row\n\t_bytes.resize(_rows*_bpr);\n\tstd::fill(_bytes.begin(), _bytes.end(), 0);\n}\n\n\n/** Sets n pixels of row r to 1 starting at pixel c.\n * @param[in] row number of row\n * @param[in] col number of column (pixel)\n * @param[in] n number of bits to be set */\nvoid Bitmap::setBits (int row, int col, int n) {\n\trow -= _yshift;\n\tcol -= _xshift;\n\tuint8_t *byte = &_bytes[row*_bpr + col/8];\n\tif (byte < &_bytes[0])\n\t\treturn;\n\tconst uint8_t *maxptr = &_bytes[0]+_bytes.size()-1;\n\twhile (n > 0 && byte <= maxptr) {\n\t\tint b = 7 - col%8; // number of leftmost bit in current byte to be set\n\t\tint m = min(n, b+1); // number of bits to be set in current byte\n\t\tint bitseq = (1 << m)-1; // sequence of n set bits (bits 0..n-1 are set)\n\t\tbitseq <<= b-m+1; // move bit sequence so that bit b is the leftmost set bit\n\t\t*byte |= uint8_t(bitseq); // apply bit sequence to current byte\n\t\tbyte++;\n\t\tn -= m;\n\t\tcol += m;\n\t}\n}\n\n\nvoid Bitmap::forAllPixels (Callback &data) const {\n\tfor (int row=0; row < _rows ; row++) {\n\t\tfor (int col=0; col < _bpr; col++) {\n\t\t\tuint8_t byte = _bytes[row*_bpr+col];\n\t\t\tint x;\n\t\t\tfor (int b=7; (b >= 0) && ((x = 8*col+(7-b)) < _cols); b--)\n\t\t\t\tdata.pixel(x, row, bool(byte & (1 << b)), *this);\n\t\t}\n\t}\n\tdata.finish();\n}\n\n\nclass BBoxCallback : public Bitmap::Callback {\n\tpublic:\n\t\tint minx () const {return _minx;}\n\t\tint miny () const {return _miny;}\n\t\tint maxx () const {return _maxx;}\n\t\tint maxy () const {return _maxy;}\n\t\tbool empty () const {return !_changed;}\n\n\t\tvoid pixel (int x, int y, bool set, const Bitmap&) override {\n\t\t\tif (set) {\n\t\t\t\t_minx = min(_minx, x);\n\t\t\t\t_miny = min(_miny, y);\n\t\t\t\t_maxx = max(_maxx, x);\n\t\t\t\t_maxy = max(_maxy, y);\n\t\t\t\t_changed = true;\n\t\t\t}\n\t\t}\n\n\t\tvoid finish () override {\n\t\t\tif (empty())\n\t\t\t\t_minx = _miny = 0;\n\t\t}\n\n\tprivate:\n\t\tbool _changed = false;\n\t\tint _minx = numeric_limits::max(), _miny=_minx;\n\t\tint _maxx = 0, _maxy = 0;\n};\n\n\n/** Computes the bounding box that spans all set pixels. */\nbool Bitmap::getBBox (int &minx, int &miny, int &maxx, int &maxy) const {\n\tBBoxCallback bboxCallback;\n\tforAllPixels(bboxCallback);\n\tminx = bboxCallback.minx();\n\tminy = bboxCallback.miny();\n\tmaxx = bboxCallback.maxx();\n\tmaxy = bboxCallback.maxy();\n\treturn !bboxCallback.empty();\n}\n\n\n/** Computes width and height of the bounding box that spans all set pixels. */\nvoid Bitmap::getExtent (int &w, int &h) const {\n\tint minx, miny, maxx, maxy;\n\tif (getBBox(minx, miny, maxx, maxy)) {\n\t\tw = maxx-minx+1;\n\t\th = maxy-miny+1;\n\t}\n\telse\n\t\tw = h = 0;\n}\n\n\n#if 0\nostream& Bitmap::write (ostream &os) const {\n\tfor (int r=_rows-1; r >= 0 ; r--) {\n\t\tfor (int c=0; c < _bpr; c++) {\n\t\t\tuint8_t byte = _bytes[r*_bpr+c];\n\t\t\tfor (int b=128; b; b>>=1)\n\t\t\t\tos << (byte & b ? '*' : '-');\n\t\t\tos << ' ';\n\t\t}\n\t\tos << endl;\n\t}\n\treturn os;\n}\n#endif\n" }, { "path": "src/Bitmap.hpp", "content": "/*************************************************************************\n** Bitmap.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef BITMAP_HPP\n#define BITMAP_HPP\n\n#include \n#include \n#include \n\n\nclass Bitmap {\n\tpublic:\n\t\tstruct Callback {\n\t\t\tvirtual ~Callback() =default;\n\t\t\tvirtual void pixel (int x, int y, bool set, Bitmap &bm) {}\n\t\t\tvirtual void pixel (int x, int y, bool set, const Bitmap &bm) {}\n\t\t\tvirtual void finish () {}\n\t\t};\n\n\tpublic:\n\t\tBitmap () =default;\n\t\tBitmap (int minx, int maxx, int miny , int maxy);\n\t\tvoid resize (int minx, int maxx, int miny , int maxy);\n\t\tvoid setBits(int row, int col, int n);\n\t\tconst uint8_t* rowPtr (int row) const {return &_bytes[row*_bpr];}\n\t\tint height () const {return _rows;}\n\t\tint width () const {return _cols;}\n\t\tint xshift () const {return _xshift;}\n\t\tint yshift () const {return _yshift;}\n\t\tint bytesPerRow () const {return _bpr;}\n\t\tbool empty () const {return (!_rows && !_cols) || _bytes.empty();}\n\t\tbool getBBox (int &minx, int &miny, int &maxx, int &maxy) const;\n\t\tvoid getExtent (int &w, int &h) const;\n\t\tvoid forAllPixels (Callback &callback) const;\n\n\t\ttemplate \n\t\tint copy (std::vector &target, bool vflip=false) const;\n\n//\t\ttemplate \n//\t\tvoid write (std::ostream &os, const std::vector &v) const;\n\n//\t\tstd::ostream& write (std::ostream &os) const;\n\n\tprivate:\n\t\tint _rows=0, _cols=0; ///< number of rows, columns\n\t\tint _xshift=0, _yshift=0; ///< horizontal/vertical shift\n\t\tint _bpr=0; ///< number of bytes per row\n\t\tstd::vector _bytes;\n};\n\n\n/** Copies the bitmap to a new target area and reorganizes the bits.\n * @tparam T component type of target vector\n * @param[out] target points to first T of new bitmap (must be deleted after usage)\n * @param[in] vflip true if the new bitmap should be flipped vertically\n * @return number of Ts per row */\ntemplate \nint Bitmap::copy (std::vector &target, bool vflip) const {\n\tconst int s = sizeof(T);\n\tconst int tpr = _bpr/s + (_bpr%s ? 1 : 0); // number of Ts per row\n\ttarget.resize(_rows*tpr);\n\tfor (int r=0; r < _rows; r++) {\n\t\tint targetrow = vflip ? _rows-r-1 : r;\n\t\tfor (int b=0; b < _bpr; b++) {\n\t\t\tT &t = target[targetrow*tpr + b/s];\n\t\t\tT chunk = static_cast(_bytes[r*_bpr+b]) << (8*(s-1-b%s));\n\t\t\tif (b % s == 0)\n\t\t\t\tt = chunk;\n\t\t\telse\n\t\t\t\tt |= chunk;\n\t\t}\n\t}\n\treturn tpr;\n}\n\n\n/*\ntemplate \nvoid Bitmap::write (std::ostream &os, const std::vector &v) const {\n\tconst int s = sizeof(T);\n\tconst int tpr = _bpr/s + (_bpr%s ? 1 : 0); // number of Ts per row\n\tfor (int r=_rows-1; r >= 0; r--) {\n\t\tfor (int t=0; t < tpr; t++) {\n\t\t\tfor (T b=(T)1<<(8*s-1); b; b>>=1)\n\t\t\t\tos << ((v[r*tpr+t] & b) ? '*' : '-');\n\t\t\tos << ' ';\n\t\t}\n\t\tos << std::endl;\n\t}\n}*/\n\n#endif\n" }, { "path": "src/BoundingBox.cpp", "content": "/*************************************************************************\n** BoundingBox.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \"algorithm.hpp\"\n#include \"BoundingBox.hpp\"\n#include \"Matrix.hpp\"\n#include \"utility.hpp\"\n#include \"SVGTree.hpp\"\n#include \"XMLNode.hpp\"\n#include \"XMLString.hpp\"\n\nusing namespace std;\n\n\nBoundingBox::BoundingBox ()\n\t: _ulx(0), _uly(0), _lrx(0), _lry(0), _valid(false), _locked(false)\n{\n}\n\n\nBoundingBox::BoundingBox (double ulxx, double ulyy, double lrxx, double lryy)\n\t: _ulx(min(ulxx,lrxx)), _uly(min(ulyy,lryy)),\n\t _lrx(max(ulxx,lrxx)), _lry(max(ulyy,lryy)),\n\t _valid(true), _locked(false)\n{\n}\n\n\nBoundingBox::BoundingBox (const DPair &p1, const DPair &p2)\n\t: _ulx(min(p1.x(), p2.x())), _uly(min(p1.y(), p2.y())),\n\t _lrx(max(p1.x(), p2.x())), _lry(max(p1.y(), p2.y())),\n\t _valid(true), _locked(false)\n{\n}\n\n\nBoundingBox::BoundingBox (const Length &ulxx, const Length &ulyy, const Length &lrxx, const Length &lryy)\n\t: _ulx(min(ulxx.bp(),lrxx.bp())), _uly(min(ulyy.bp(),lryy.bp())),\n\t _lrx(max(ulxx.bp(),lrxx.bp())), _lry(max(ulyy.bp(),lryy.bp())),\n\t _valid(true), _locked(false)\n{\n}\n\n\nBoundingBox::BoundingBox (const string &boxstr)\n\t: _ulx(0), _uly(0), _lrx(0), _lry(0), _valid(false), _locked(false)\n{\n\tset(boxstr);\n}\n\n\n/** Extracts a sequence of length values from a string like \"5cm, 2.4in, 0pt\".\n * @param[in] boxstr whitespace and/or comma separated string of lengths.\n * @return the extracted lengths */\nvector BoundingBox::extractLengths (string boxstr) {\n\tvector lengths;\n\tboxstr = util::replace(boxstr, \",\", \" \");\n\tboxstr = util::normalize_space(boxstr);\n\tvector lengthStrings = util::split(boxstr, \" \");\n\talgo::copy_if(lengthStrings, back_inserter(lengths), std::not1(util::IsEmptyString()));\n\treturn lengths;\n}\n\n\n/** Sets or modifies the bounding box. If 'boxstr' consists of 4 length values,\n * they denote the absolute position of two diagonal corners of the box. In case\n * of a single length value l the current box is enlarged by adding (-l,-l) the upper\n * left and (l,l) to the lower right corner.\n * @param[in] boxstr whitespace and/or comma separated string of lengths. */\nvoid BoundingBox::set (const string &boxstr) {\n\tvector coord = extractLengths(boxstr);\n\tset(coord);\n}\n\n\nvoid BoundingBox::set (const std::vector &coord) {\n\tswitch (coord.size()) {\n\t\tcase 1:\n\t\t\t_ulx -= coord[0].bp();\n\t\t\t_uly -= coord[0].bp();\n\t\t\t_lrx += coord[0].bp();\n\t\t\t_lry += coord[0].bp();\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\t_ulx -= coord[0].bp();\n\t\t\t_uly -= coord[1].bp();\n\t\t\t_lrx += coord[0].bp();\n\t\t\t_lry += coord[1].bp();\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\t_ulx = min(coord[0].bp(), coord[2].bp());\n\t\t\t_uly = min(coord[1].bp(), coord[3].bp());\n\t\t\t_lrx = max(coord[0].bp(), coord[2].bp());\n\t\t\t_lry = max(coord[1].bp(), coord[3].bp());\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tthrow BoundingBoxException(\"1, 2 or 4 length parameters expected\");\n\t}\n\t_valid = true;\n}\n\n\n/** Enlarges the box so that point (x,y) is enclosed. */\nvoid BoundingBox::embed (double x, double y) {\n\tif (!_locked) {\n\t\tif (_valid) {\n\t\t\tif (x < _ulx)\n\t\t\t\t_ulx = x;\n\t\t\telse if (x > _lrx)\n\t\t\t\t_lrx = x;\n\t\t\tif (y < _uly)\n\t\t\t\t_uly = y;\n\t\t\telse if (y > _lry)\n\t\t\t\t_lry = y;\n\t\t}\n\t\telse {\n\t\t\t_ulx = _lrx = x;\n\t\t\t_uly = _lry = y;\n\t\t\t_valid = true;\n\t\t}\n\t}\n}\n\n\n/** Enlarges the box so that the given bounding box is enclosed. */\nvoid BoundingBox::embed (const BoundingBox &bbox) {\n\tif (!_locked && bbox._valid) {\n\t\tif (_valid) {\n\t\t\tembed(bbox._ulx, bbox._uly);\n\t\t\tembed(bbox._lrx, bbox._lry);\n\t\t}\n\t\telse {\n\t\t\t_ulx = bbox._ulx;\n\t\t\t_uly = bbox._uly;\n\t\t\t_lrx = bbox._lrx;\n\t\t\t_lry = bbox._lry;\n\t\t\t_valid = true;\n\t\t}\n\t}\n}\n\n\n/** Embeds a virtual circle into the box and enlarges it accordingly.\n * @param[in] c center of the circle\n * @param[in] r radius of the circle */\nvoid BoundingBox::embed (const DPair &c, double r) {\n\tembed(BoundingBox(c.x()-r, c.y()-r, c.x()+r, c.y()+r));\n}\n\n\n/** Expands the box in all four directions by a given value. */\nvoid BoundingBox::expand (double m) {\n\tif (!_locked) {\n\t\t_ulx -= m;\n\t\t_uly -= m;\n\t\t_lrx += m;\n\t\t_lry += m;\n\t}\n}\n\n\n/** Intersects the current box with bbox and applies the result to *this.\n * If both boxes are disjoint, *this is not altered.\n * @param[in] bbox box to intersect with\n * @return false if *this is locked or both boxes are disjoint */\nbool BoundingBox::intersect (const BoundingBox &bbox) {\n\t// check if the two boxes are disjoint\n\tif (_locked || _lrx < bbox._ulx || _lry < bbox._uly || _ulx > bbox._lrx || _uly > bbox._lry)\n\t\treturn false;\n\t// not disjoint: compute the intersection\n\t_ulx = max(_ulx, bbox._ulx);\n\t_uly = max(_uly, bbox._uly);\n\t_lrx = min(_lrx, bbox._lrx);\n\t_lry = min(_lry, bbox._lry);\n\treturn true;\n}\n\n\nvoid BoundingBox::operator += (const BoundingBox &bbox) {\n\tif (!_locked) {\n\t\t_ulx += bbox._ulx;\n\t\t_uly += bbox._uly;\n\t\t_lrx += bbox._lrx;\n\t\t_lry += bbox._lry;\n\t}\n}\n\n\nstatic inline bool almost_equal (double v1, double v2) {\n\treturn abs(v1-v2) < 1e-10;\n}\n\n\nbool BoundingBox::operator == (const BoundingBox &bbox) const {\n\treturn _valid && bbox._valid\n\t\t&& almost_equal(_ulx, bbox._ulx)\n\t\t&& almost_equal(_uly, bbox._uly)\n\t\t&& almost_equal(_lrx, bbox._lrx)\n\t\t&& almost_equal(_lry, bbox._lry);\n}\n\n\nvoid BoundingBox::scale (double sx, double sy) {\n\tif (!_locked) {\n\t\t_ulx *= sx;\n\t\t_lrx *= sx;\n\t\tif (sx < 0)\tswap(_ulx, _lrx);\n\t\t_uly *= sy;\n\t\t_lry *= sy;\n\t\tif (sy < 0)\tswap(_uly, _lry);\n\t}\n}\n\n\nvoid BoundingBox::transform (const Matrix &tm) {\n\tif (!_locked) {\n\t\tDPair ul = tm * DPair(_ulx, _uly);\n\t\tDPair lr = tm * DPair(_lrx, _lry);\n\t\tDPair ll = tm * DPair(_ulx, _lry);\n\t\tDPair ur = tm * DPair(_lrx, _uly);\n\t\t_ulx = min(min(ul.x(), lr.x()), min(ur.x(), ll.x()));\n\t\t_uly = min(min(ul.y(), lr.y()), min(ur.y(), ll.y()));\n\t\t_lrx = max(max(ul.x(), lr.x()), max(ur.x(), ll.x()));\n\t\t_lry = max(max(ul.y(), lr.y()), max(ur.y(), ll.y()));\n\t}\n}\n\n\nstring BoundingBox::svgViewBoxString () const {\n\tostringstream oss;\n\toss << XMLString(_ulx) << ' ' << XMLString(_uly) << ' ' << XMLString(width()) << ' ' << XMLString(height());\n\treturn oss.str();\n}\n\n\nostream& BoundingBox::write (ostream &os) const {\n\tos << '(' << _ulx << \", \" << _uly << \", \" << _lrx << \", \" << _lry << ')';\n\tif (!_valid)\n\t\tos << \" (invalid)\";\n\telse if (_locked)\n\t\tos << \" (locked)\";\n\treturn os;\n}\n\n\nunique_ptr BoundingBox::createSVGRect () const {\n\tauto rect = util::make_unique(\"rect\");\n\trect->addAttribute(\"x\", minX());\n\trect->addAttribute(\"y\", minY());\n\trect->addAttribute(\"width\", width());\n\trect->addAttribute(\"height\", height());\n\trect->addAttribute(\"fill\", \"none\");\n\treturn rect;\n}\n\n\nunique_ptr BoundingBox::createSVGPath () const {\n\tGraphicsPath path;\n\tpath.rect(minX(), minY(), maxX(), maxY());\n\tostringstream oss;\n\tpath.writeSVG(oss, SVGTree::RELATIVE_PATH_CMDS);\n\tauto pathElem = util::make_unique(\"path\");\n\tpathElem->addAttribute(\"d\", oss.str());\n\treturn pathElem;\n}\n" }, { "path": "src/BoundingBox.hpp", "content": "/*************************************************************************\n** BoundingBox.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef BOUNDINGBOX_HPP\n#define BOUNDINGBOX_HPP\n\n#include \n#include \n#include \n#include \n#include \"Length.hpp\"\n#include \"MessageException.hpp\"\n#include \"Pair.hpp\"\n\n\nclass Matrix;\nclass XMLElement;\n\n\nstruct BoundingBoxException : MessageException {\n\texplicit BoundingBoxException (const std::string &msg) : MessageException(msg) {}\n};\n\n\nclass BoundingBox {\n\tpublic:\n\t\tBoundingBox ();\n\t\tBoundingBox (double ulxx, double ulyy, double lrxx, double lryy);\n\t\tBoundingBox (const DPair &p1, const DPair &p2);\n\t\tBoundingBox (const Length &ulxx, const Length &ulyy, const Length &lrxx, const Length &lryy);\n\t\texplicit BoundingBox (const std::string &boxstr);\n\t\tvoid set (const std::string &boxstr);\n\t\tvoid set (const std::vector &lengths);\n\t\tvoid embed (double x, double y);\n\t\tvoid embed (const BoundingBox &bb);\n\t\tvoid embed (const DPair &p) {embed(p.x(), p.y());}\n\t\tvoid embed (const DPair &c, double r);\n\n\t\tstatic std::vector extractLengths (std::string boxstr);\n\n\t\ttemplate \n\t\tvoid embed (const Pair &p) {embed(p.x(), p.y());}\n\n\t\tvoid expand (double m);\n\t\tbool intersect (const BoundingBox &bbox);\n\t\tdouble minX () const {return _ulx;}\n\t\tdouble minY () const {return _uly;}\n\t\tdouble maxX () const {return _lrx;}\n\t\tdouble maxY () const {return _lry;}\n\t\tdouble width () const {return _lrx-_ulx;}\n\t\tdouble height () const {return _lry-_uly;}\n\t\tbool valid() const {return _valid;}\n\t\tbool locked() const {return _locked;}\n\t\tvoid lock () {_locked = true;}\n\t\tvoid unlock () {_locked = false;}\n\t\tvoid invalidate () {_valid = false;}\n\t\tvoid operator += (const BoundingBox &bbox);\n\t\tbool operator == (const BoundingBox &bbox) const;\n\t\tbool operator != (const BoundingBox &bbox) const {return !(*this == bbox);}\n\t\tvoid scale (double sx, double sy);\n\t\tvoid transform (const Matrix &tm);\n\t\tstd::string svgViewBoxString () const;\n\t\tstd::ostream& write (std::ostream &os) const;\n\t\tstd::unique_ptr createSVGRect () const;\n\t\tstd::unique_ptr createSVGPath () const;\n\n\tprivate:\n\t\tdouble _ulx, _uly; ///< coordinates of upper left vertex (in PS point units)\n\t\tdouble _lrx, _lry; ///< coordinates of lower right vertex (in PS point units)\n\t\tbool _valid : 1; ///< true if the box coordinates are properly set\n\t\tbool _locked : 1; ///< if true, the box data is read-only\n};\n\n\ninline std::ostream& operator << (std::ostream &os, const BoundingBox &bbox) {\n\treturn bbox.write(os);\n}\n\n#endif\n" }, { "path": "src/CLCommandLine.cpp", "content": "/*************************************************************************\n** CLCommandLine.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \"algorithm.hpp\"\n#include \"CLCommandLine.hpp\"\n#include \"version.hpp\"\n\nusing namespace CL;\nusing namespace std;\n\n\nCommandLine::CommandLine (const char *summary, const char *usage, const char *copyright)\n\t: _summary(summary), _usage(usage), _copyright(copyright)\n{\n}\n\n\nvoid CommandLine::parse (int argc, char **argv) {\n\tbool filesOnly = false;\n\tfor (int i=1; i < argc; i++) {\n\t\tistringstream iss(argv[i]);\n\t\tif (filesOnly || iss.peek() != '-')\n\t\t\t_files.emplace_back(argv[i]);\n\t\telse {\n\t\t\tiss.get(); // skip dash\n\t\t\tif (iss.peek() < 0)\n\t\t\t\t_singleDashParsed = true;\n\t\t\telse if (iss.peek() != '-')\n\t\t\t\tparseShortOption(iss, argc, argv, i);\n\t\t\telse {\n\t\t\t\tiss.get(); // skip dash\n\t\t\t\tif (iss.peek() == EOF) // \"--\" only, no following option name?\n\t\t\t\t\tfilesOnly = true; // treat all following options as filenames\n\t\t\t\telse\n\t\t\t\t\tparseLongOption(iss);\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nstatic void error (const Option &option, bool shortname, const string &msg) {\n\tostringstream oss;\n\toss << \"option \";\n\tif (shortname)\n\t\toss << '-' << option.shortName();\n\telse\n\t\toss << \"--\" << option.longName();\n\toss << \": \" << msg;\n\tthrow CommandLineException(oss.str());\n}\n\n\nstatic void type_error (const Option &option, bool shortname) {\n\tostringstream oss;\n\tswitch (option.argMode()) {\n\t\tcase Option::ArgMode::NONE:\n\t\t\terror(option, shortname, \"no argument expected\");\n\t\t\tbreak;\n\t\tcase Option::ArgMode::OPTIONAL:\n\t\t\toss << \"optional argument \";\n\t\t\tif (!option.argName().empty())\n\t\t\t\toss << \"'\" << option.argName() << \"' \";\n\t\t\toss << \"must be of \"+option.typeString()+\" type\";\n\t\t\terror(option, shortname, oss.str());\n\t\t\tbreak;\n\t\tdefault:\n\t\t\toss << option.typeString()+\" argument \";\n\t\t\tif (!option.argName().empty())\n\t\t\t\toss << \"'\" << option.argName() << \"' \";\n\t\t\toss << \"expected\";\n\t\t\terror(option, shortname, oss.str());\n\t}\n}\n\n\nvoid CommandLine::parseShortOption (istringstream &iss, int argc, char **argv, int &argn) const {\n\tbool combined = false;\n\tdo {\n\t\tchar shortname = static_cast(iss.get());\n\t\tif (!isalnum(shortname))\n\t\t\tthrow CommandLineException(string(\"syntax error: -\")+shortname);\n\t\tif (Option *option = lookupOption(shortname)) {\n\t\t\tif (!combined || option->argMode() == Option::ArgMode::NONE) {\n\t\t\t\tif (option->argMode() == Option::ArgMode::REQUIRED && strlen(argv[argn]) == 2) { // required argument separated by whitespace?\n\t\t\t\t\tif (argn+1 < argc && argv[argn+1][0] != '-') {\n\t\t\t\t\t\tiss.clear(); // reset error flags\n\t\t\t\t\t\tiss.str(argv[++argn]); // continue parsing with next command-line field\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!option->parse(iss, false))\n\t\t\t\t\ttype_error(*option, true);\n\t\t\t\tif (option->argMode() == Option::ArgMode::NONE)\n\t\t\t\t\tcombined = true;\n\t\t\t}\n\t\t\telse\n\t\t\t\tthrow CommandLineException(string(\"option -\")+ shortname + \" must be given separately\");\n\t\t}\n\t\telse\n\t\t\tthrow CommandLineException(string(\"unknown option -\")+shortname);\n\t}\n\twhile (combined && !iss.eof());\n}\n\n\nvoid CommandLine::parseLongOption (istream &is) const {\n\tstring optname;\n\twhile (isalnum(is.peek()) || (!optname.empty() && is.peek() == '-'))\n\t\toptname += char(is.get());\n\tif (optname.empty())\n\t\tthrow CommandLineException(\"unexpected character '\" + string(1, is.peek()) + \"' after '--'\");\n\tvector options = lookupOption(optname);\n\tif (options.empty())\n\t\tthrow CommandLineException(\"unknown option --\"+optname);\n\tif (options.size() == 1) {\n\t\tif (!options[0]->parse(is, true))\n\t\t\ttype_error(*options[0], false);\n\t}\n\telse { // is partially given option ambiguous?\n\t\talgo::sort(options, [](const Option *opt1, const Option *opt2) {\n\t\t\treturn opt1->longName() < opt2->longName();\n\t\t});\n\t\tstring msg = \"option --\" + optname + \" is ambiguous (\";\n\t\tmsg = algo::accumulate(options, msg, [](const string &str, const Option *opt) {\n\t\t\treturn str + opt->longName() + \", \";\n\t\t});\n\t\tmsg.pop_back();\n\t\tmsg.back() = ')';\n\t\tthrow CommandLineException(msg);\n\t}\n}\n\n\n/** Returns all options that match the given long name. */\nvector CommandLine::lookupOption (const string &optname) const {\n\tvector matches;\n\tauto len = optname.length();\n\tfor (OptSectPair optsect : options()) {\n\t\tif (optsect.first->longName() == optname) { // exact match?\n\t\t\tmatches.clear();\n\t\t\tmatches.push_back(optsect.first);\n\t\t\tbreak;\n\t\t}\n\t\tif (optsect.first->longName().substr(0, len) == optname) // partial match?\n\t\t\tmatches.push_back(optsect.first);\n\t}\n\treturn matches;\n}\n\n\n/** Returns the option that match the given short name. */\nOption* CommandLine::lookupOption (char optchar) const {\n\tauto it = algo::find_if(options(), [&](const OptSectPair &optsect) {\n\t\treturn optsect.first->shortName() == optchar;\n\t});\n\treturn (it != options().end()) ? it->first : nullptr;\n}\n\n\n/** Prints help text including summary of options.\n * @param[in] os output stream the help text is printed to\n * @param[in] mode output mode (0=section, 1=sorted by short options, 2=sorted by long options) */\nvoid CommandLine::help (ostream &os, int mode) const {\n\tos << PROGRAM_NAME << ' '<< PROGRAM_VERSION << \"\\n\\n\";\n\tos << _summary << \"\\n\\n\";\n\t// print usage info\n\tstring usage = _usage;\n\tint count=0;\n\twhile (!usage.empty()) {\n\t\tauto pos = usage.find('\\n');\n\t\tos << (count++ == 0 ? \"Usage: \" : \" \") << PROGRAM_NAME << ' ' << usage.substr(0, pos) << '\\n';\n\t\tif (pos != string::npos)\n\t\t\tusage = usage.substr(pos+1);\n\t\telse\n\t\t\tusage.clear();\n\t}\n\tif (mode > 0)\n\t\tos << '\\n';\n\n\t// compute width of first column of help output\n\tunordered_map> linecols;\n\tsize_t col1width=0;\n\tfor (const OptSectPair &ospair : options()) {\n\t\tstring::size_type pos;\n\t\tstring line = ospair.first->helpline();\n\t\tif ((pos = line.find('\\t')) != string::npos) {\n\t\t\tlinecols.emplace(ospair.first, pair(line.substr(0, pos), line.substr(pos+1)));\n\t\t\tcol1width = max(col1width, pos);\n\t\t}\n\t}\n\tif (mode > 0) {\n\t\tauto isless = +[](const OptSectPair &p1, const OptSectPair &p2) {\n\t\t\treturn p1.first->longName() < p2.first->longName();\n\t\t};\n\t\tif (mode == 1) {\n\t\t\tisless = [](const OptSectPair &p1, const OptSectPair &p2) {\n\t\t\t\tchar c1 = p1.first->shortName(), c2 = p2.first->shortName();\n\t\t\t\tif (c1 == c2)\n\t\t\t\t\treturn p1.first->longName() < p2.first->longName();\n\t\t\t\tif (tolower(c1) == tolower(c2))\n\t\t\t\t\treturn c1 > c2; // lower case before upper case letters\n\t\t\t\treturn tolower(c1) < tolower(c2);\n\t\t\t};\n\t\t}\n\t\talgo::sort(options(), isless);\n\t}\n\n\t// print summary of options\n\tcol1width += 2;\n\tint sectno=-1;\n\tfor (const OptSectPair &ospair : options()) {\n\t\tif (mode == 0 && ospair.second != sectno) { // first option in current section?\n\t\t\tsectno = ospair.second;\n\t\t\tif (section(sectno))\n\t\t\t\tos << '\\n' << section(sectno) << \":\\n\";\n\t\t}\n\t\tOption *opt = ospair.first;\n\t\tos << \" \" << setw(col1width) << left << linecols[opt].first;\n\t\tos << setw(0) << linecols[opt].second << '\\n';\n\t}\n\tos << '\\n' << _copyright << '\\n';\n}\n" }, { "path": "src/CLCommandLine.hpp", "content": "/*************************************************************************\n** CLCommandLine.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CL_COMMANDLINE_HPP\n#define CL_COMMANDLINE_HPP\n\n#include \n#include \n#include \n#include \n#include \n#include \"CLOption.hpp\"\n#include \"MessageException.hpp\"\n\nnamespace CL {\n\nclass CommandLine {\n\tpublic:\n\t\tCommandLine (const char *summary, const char *usage, const char *copyright);\n\t\tvirtual ~CommandLine () =default;\n\t\tvoid parse (int argc, char **argv);\n\t\tvoid help (std::ostream &os, int mode=0) const;\n\t\tvoid addFilename (const std::string &fname) {_files.emplace_back(fname);}\n\t\tbool singleDashGiven () const {return _singleDashParsed;}\n\t\tconst std::vector& filenames () const {return _files;}\n\n\tprotected:\n\t\tusing OptSectPair = std::pair;\n\t\tvoid parseShortOption (std::istringstream &is, int argc, char **argv, int &argn) const;\n\t\tvoid parseLongOption (std::istream &is) const;\n\t\tvirtual std::vector& options () const =0;\n\t\tvirtual const char* section (size_t n) const {return nullptr;}\n\t\tOption* lookupOption (char optchar) const;\n\t\tstd::vector lookupOption (const std::string &optname) const;\n\n\tprivate:\n\t\tconst char *_summary;\n\t\tconst char *_usage;\n\t\tconst char *_copyright;\n\t\tbool _singleDashParsed=false; ///< true if a single '-' w/o a following char was parsed\n\t\tstd::vector _files;\n};\n\n\nstruct CommandLineException : MessageException {\n\texplicit CommandLineException (const std::string &msg) : MessageException(msg) {}\n};\n\n} // namespace CL\n\n#endif\n\n" }, { "path": "src/CLOption.hpp", "content": "/*************************************************************************\n** CLOption.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CL_OPTION_HPP\n#define CL_OPTION_HPP\n\n#include \n#include \n#include \n\nnamespace CL {\n\nclass Option {\n\tfriend class CommandLine;\n\tpublic:\n\t\tenum class ArgMode {NONE, OPTIONAL, REQUIRED};\n\n\tpublic:\n\t\tOption (const char *longname, char shortname, const char *summary)\n\t\t\t: _shortName(shortname), _longName(longname), _summary(summary), _given(false) {}\n\n\t\tvirtual ~Option () = default;\n\t\tvirtual std::string typeString () const {return \"\";}\n\t\tvirtual ArgMode argMode () const {return ArgMode::NONE;}\n\t\tvirtual bool given () const {return _given;}\n\t\tvirtual char shortName () const {return _shortName;}\n\t\tvirtual std::string longName () const {return _longName;}\n\t\tvirtual std::string summary () const {return _summary;}\n\t\tvirtual std::string argName () const {return \"\";}\n\t\tvirtual std::string valueString () const {return \"\";}\n\n\t\tvirtual std::string helpline () const {\n\t\t\tstd::string line;\n\t\t\tif (_shortName != '\\0')\n\t\t\t\tline = std::string(\"-\") + _shortName + \", \";\n\t\t\telse\n\t\t\t\tline = \" \";\n\t\t\tline += \"--\" + std::string(_longName);\n\t\t\tif (!argName().empty()) {\n\t\t\t\tif (argMode() == ArgMode::OPTIONAL)\n\t\t\t\t\tline += '[';\n\t\t\t\tline += '=';\n\t\t\t\tline += argName();\n\t\t\t\tif (argMode() == ArgMode::OPTIONAL)\n\t\t\t\t\tline += ']';\n\t\t\t}\n\t\t\tif (_summary) {\n\t\t\t\tline += '\\t';\n\t\t\t\tline += _summary;\n\t\t\t}\n\t\t\tif (argMode() != ArgMode::NONE && !valueString().empty())\n\t\t\t\tline += std::string(\" [\") + valueString() + \"]\";\n\t\t\treturn line;\n\t\t}\n\n\tprotected:\n\t\tvirtual bool parse (std::istream &is, bool longopt) {\n\t\t\tif (is.eof())\n\t\t\t\treturn given(argMode() != ArgMode::REQUIRED);\n\t\t\tif (argMode() == ArgMode::OPTIONAL && is.peek() == ' ')\n\t\t\t\treturn given(false);\n\t\t\tif (longopt && is.get() != '=')\n\t\t\t\treturn given(false);\n\t\t\treturn given(parseValue(is));\n\t\t}\n\n\t\tvirtual bool parseValue (std::istream &is) {\n\t\t\treturn is.peek() == EOF || argMode() == ArgMode::NONE;\n\t\t}\n\n\t\tbool given (bool val) {return _given = val;}\n\n\tprivate:\n\t\tchar _shortName;\n\t\tconst char *_longName;\n\t\tconst char*_summary;\n\t\tbool _given;\n};\n\n\ntemplate \nconstexpr const char* typeString () {return \"unknown\";}\n\ntemplate<> constexpr const char* typeString () {return \"boolean\";}\ntemplate<> constexpr const char* typeString () {return \"integer\";}\ntemplate<> constexpr const char* typeString () {return \"non-negative integer\";}\ntemplate<> constexpr const char* typeString () {return \"floating point\";}\ntemplate<> constexpr const char* typeString () {return \"string\";}\n\ntemplate \nT parseValue (std::istream &is) {\n\tT value;\n\tis >> value;\n\treturn value;\n}\n\ntemplate<>\ninline std::string parseValue (std::istream &is) {\n\tis >> std::ws;\n\tstd::string str;\n\tstd::getline(is, str);\n\treturn str;\n}\n\n\ntemplate \nclass TypedOption : public Option {\n\tpublic:\n\t\tTypedOption (const char *longName, char shortName, const char *argName, T val, const char *summary)\n\t\t\t: Option(longName, shortName, summary), _argName(argName), _value(std::move(val)) {}\n\n\t\tTypedOption (const char *longName, char shortName, const char *argName, const char *summary)\n\t\t\t: Option(longName, shortName, summary), _argName(argName), _value() {}\n\n\t\tT value () const {return _value;}\n\t\tstd::string typeString () const override {return CL::typeString();}\n\t\tstd::string argName() const override {return _argName ? _argName : \"\";}\n\n\t\tstd::string valueString () const override {\n\t\t\tstd::ostringstream oss;\n\t\t\toss << _value;\n\t\t\treturn oss.str();\n\t\t}\n\n\t\tArgMode argMode () const override {return mode;}\n\n\tprotected:\n\t\tbool parseValue (std::istream &is) override {\n\t\t\tT value = CL::parseValue(is);\n\t\t\tif (!is.fail())\n\t\t\t\t_value = std::move(value);\n\t\t\treturn !is.fail() || (argMode() == ArgMode::OPTIONAL && is.eof());\n\t\t}\n\n\tprivate:\n\t\tconst char *_argName;\n\t\tT _value;\n};\n\n\ntemplate \nclass TypedOption : public Option {\n\tpublic:\n\t\tTypedOption (const char *longName, char shortName, const char *argName, bool val, const char *summary)\n\t\t\t: Option(longName, shortName, summary), _argName(argName), _value(val) {}\n\n\t\tTypedOption (const char *longName, char shortName, const char *argName, const char *summary)\n\t\t\t: Option(longName, shortName, summary), _argName(argName), _value(false) {}\n\n\t\tbool value () const {return _value;}\n\t\tstd::string valueString () const override {return _value ? \"yes\" : \"no\";}\n\t\tArgMode argMode () const override {return mode;}\n\t\tstd::string typeString () const override {return CL::typeString();}\n\t\tstd::string argName() const override {return _argName ? _argName : \"\";}\n\n\tprotected:\n\t\tbool parseValue (std::istream &is) override {\n\t\t\tstd::string str;\n\t\t\tis >> str;\n\t\t\tif (is.fail())\n\t\t\t\treturn argMode() != ArgMode::REQUIRED;\n\t\t\tif (str == \"yes\" || str == \"y\" || str == \"true\" || str == \"1\")\n\t\t\t\t_value = true;\n\t\t\telse if (str == \"no\" || str == \"n\" || str == \"false\" || str == \"0\")\n\t\t\t\t_value = false;\n\t\t\telse\n\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\n\tprivate:\n\t\tconst char *_argName;\n\t\tbool _value;\n};\n\n} // namespace CL\n\n#endif\n" }, { "path": "src/CMap.cpp", "content": "/*************************************************************************\n** CMap.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \"algorithm.hpp\"\n#include \"CMap.hpp\"\n#include \"CMapManager.hpp\"\n#include \"FileFinder.hpp\"\n#include \"Unicode.hpp\"\n\nusing namespace std;\n\n\nconst char* CMap::path () const {\n\treturn FileFinder::instance().lookup(name(), \"cmap\", false);\n}\n\n\nconst FontEncoding* CMap::findCompatibleBaseFontMap (const PhysicalFont *font, CharMapID &charmapID) const {\n\treturn CMapManager::instance().findCompatibleBaseFontMap(font, this, charmapID);\n}\n\n//////////////////////////////////////////////////////////////////////\n\nvoid SegmentedCMap::addCIDRange (uint32_t first, uint32_t last, uint32_t cid) {\n\tif (uint32_t cp = Unicode::fromSurrogate(first)) // is 'first' a surrogate?\n\t\tfirst = cp;\n\tif (uint32_t cp = Unicode::fromSurrogate(last)) // is 'last' a surrogate?\n\t\tlast = cp;\n\t_cidranges.addRange(first, last, cid);\n}\n\n\nvoid SegmentedCMap::addBFRange (uint32_t first, uint32_t last, uint32_t chrcode) {\n\tif (uint32_t cp = Unicode::fromSurrogate(chrcode)) // is 'chrcode' a surrogate?\n\t\tchrcode = cp;\n\t_bfranges.addRange(first, last, chrcode);\n}\n\n\n/** Returns the RO (Registry-Ordering) string of the CMap. */\nstring SegmentedCMap::getROString() const {\n\tif (_registry.empty() || _ordering.empty())\n\t\treturn \"\";\n\treturn _registry + \"-\" + _ordering;\n}\n\n\nbool SegmentedCMap::mapsToUnicode () const {\n\tvector encstrings = {\"UTF8\", \"UTF16\", \"UCS2\", \"UCS4\", \"UCS32\"};\n\treturn algo::any_of(encstrings, [&](const string& s) {\n\t\tauto pos = _filename.find(s);\n\t\treturn (pos != string::npos && (pos == 0 || _filename[pos-1] == '-'));\n\t});\n}\n\n\n/** Returns the CID for a given character code. */\nuint32_t SegmentedCMap::cid (uint32_t c) const {\n\tif (_cidranges.valueExists(c))\n\t\treturn _cidranges.valueAt(c);\n\tif (_basemap)\n\t\treturn _basemap->cid(c);\n\treturn 0;\n}\n\n\n/** Returns the character code of a base font for a given CID. */\nuint32_t SegmentedCMap::bfcode (uint32_t cid) const {\n\tif (_bfranges.valueExists(cid))\n\t\treturn _bfranges.valueAt(cid);\n\tif (_basemap)\n\t\treturn _basemap->bfcode(cid);\n\treturn 0;\n}\n\n\nvoid SegmentedCMap::write (ostream &os) const {\n\t_cidranges.write(os);\n}\n" }, { "path": "src/CMap.hpp", "content": "/*************************************************************************\n** CMap.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CMAP_HPP\n#define CMAP_HPP\n\n#include \n#include \n#include \n#include \"FontEncoding.hpp\"\n#include \"RangeMap.hpp\"\n\n\nstruct CMap : NamedFontEncoding {\n\tvirtual bool vertical () const =0;\n\tvirtual bool mapsToCID () const =0;\n\tvirtual uint32_t cid (uint32_t c) const =0;\n\tvirtual uint32_t bfcode (uint32_t cid) const =0;\n\tvirtual std::string getROString () const =0;\n\tconst char* path () const override;\n\tconst FontEncoding* findCompatibleBaseFontMap (const PhysicalFont *font, CharMapID &charmapID) const override;\n\tbool mapsToCharIndex () const override {return mapsToCID();}\n\n\tCharacter decode (uint32_t c) const override {\n\t\tif (mapsToCID())\n\t\t\treturn Character(Character::INDEX, cid(c));\n\t\treturn Character(Character::CHRCODE, bfcode(c));\n\t}\n};\n\n\nstruct IdentityCMap : CMap {\n\tuint32_t cid (uint32_t c) const override {return c;}\n\tuint32_t bfcode (uint32_t cid) const override {return 0;}\n\tstd::string getROString () const override {return \"Adobe-Identity\";}\n\tbool mapsToCID() const override {return true;}\n};\n\n\nstruct IdentityHCMap : IdentityCMap {\n\tbool vertical () const override {return false;}\n\tconst char* name () const override {return \"Identity-H\";}\n};\n\n\nstruct IdentityVCMap : IdentityCMap {\n\tbool vertical () const override {return true;}\n\tconst char* name () const override {return \"Identity-V\";}\n};\n\n\nstruct UnicodeCMap : CMap {\n\tbool vertical () const override {return false;}\n\tconst char* name () const override {return \"unicode\";}\n\tbool mapsToCID () const override {return false;}\n\tconst char* path () const override {return nullptr;}\n\tuint32_t cid (uint32_t c) const override {return c;}\n\tuint32_t bfcode (uint32_t cid) const override {return cid;}\n\tstd::string getROString () const override {return \"\";}\n\tbool mapsToUnicode () const override {return true;}\n};\n\n\nclass SegmentedCMap : public CMap {\n\tfriend class CMapReader;\n\n\tpublic:\n\t\texplicit SegmentedCMap (std::string fname) : _filename(std::move(fname)) {}\n\t\tconst char* name () const override {return _filename.c_str();}\n\t\tuint32_t cid (uint32_t c) const override;\n\t\tuint32_t bfcode (uint32_t cid) const override;\n\t\tvoid addCIDRange (uint32_t first, uint32_t last, uint32_t cid);\n\t\tvoid addBFRange (uint32_t first, uint32_t last, uint32_t chrcode);\n\t\tvoid write (std::ostream &os) const;\n\t\tbool vertical () const override {return _vertical;}\n\t\tbool mapsToCID () const override {return _mapsToCID;}\n\t\tsize_t numCIDRanges () const {return _cidranges.numRanges();}\n\t\tsize_t numBFRanges () const {return _bfranges.numRanges();}\n\t\tstd::string getROString () const override;\n\t\tbool mapsToUnicode () const override;\n\n\tprivate:\n\t\tstd::string _filename;\n\t\tstd::string _registry;\n\t\tstd::string _ordering;\n\t\tstd::string _cmaptype;\n\t\tCMap *_basemap = nullptr;\n\t\tbool _vertical = false;\n\t\tbool _mapsToCID = true; // true: chrcode->CID, false: CID->charcode\n\t\tRangeMap _cidranges;\n\t\tRangeMap _bfranges;\n};\n\n#endif\n" }, { "path": "src/CMapManager.cpp", "content": "/*************************************************************************\n** CMapManager.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \"CMap.hpp\"\n#include \"CMapManager.hpp\"\n#include \"CMapReader.hpp\"\n#include \"FileFinder.hpp\"\n#include \"Font.hpp\"\n#include \"Message.hpp\"\n\nusing namespace std;\n\n\nCMapManager& CMapManager::instance () {\n\tstatic CMapManager cmm;\n\treturn cmm;\n}\n\n\n/** Loads a cmap and returns the corresponding object. */\nCMap* CMapManager::lookup (const string &name) {\n\tauto it = _cmaps.find(name);\n\tif (it != _cmaps.end())\n\t\treturn it->second.get();\n\n\tif (_includedCMaps.find(name) != _includedCMaps.end()) {\n\t\t_level = 0;\n\t\tthrow CMapReaderException(\"circular reference of CMap \" + name);\n\t}\n\n\tunique_ptr cmap_ptr;\n\tif (name == \"Identity-H\")\n\t\tcmap_ptr = util::make_unique();\n\telse if (name == \"Identity-V\")\n\t\tcmap_ptr = util::make_unique();\n\telse if (name == \"unicode\")\n\t\tcmap_ptr = util::make_unique();\n\tif (cmap_ptr) {\n\t\tCMap *ret = cmap_ptr.get();\n\t\t_cmaps[name] = std::move(cmap_ptr);\n\t\treturn ret;\n\t}\n\t// Load cmap data of file and also process all cmaps referenced by operator \"usecmap\".\n\t// This can lead to a sequence of further calls of lookup(). In order to prevent infinite loops\n\t// due to (disallowed) circular cmap inclusions, we keep track of all cmaps processed during\n\t// a sequence of inclusions.\n\t_includedCMaps.insert(name); // save name of current cmap being processed\n\t_level++; // increase nesting level\n\tCMap *ret=nullptr;\n\ttry {\n\t\tCMapReader reader;\n\t\tif (!(cmap_ptr = reader.read(name))) {\n\t\t\t_level = 1;\n\t\t\tMessage::wstream(true) << \"CMap file '\" << name << \"' not found\\n\";\n\t\t}\n\t\tret = cmap_ptr.get();\n\t\t_cmaps[name] = std::move(cmap_ptr);\n\t}\n\tcatch (const CMapReaderException &e) {\n\t\tMessage::estream(true) << \"CMap file \" << name << \": \" << e.what() << \"\\n\";\n\t}\n\tif (--_level == 0) // back again at initial nesting level?\n\t\t_includedCMaps.clear(); // => names of included cmaps are no longer needed\n\treturn ret;\n}\n\n\n/** Looks for a base font CMap and a compatible encoding table in a given font. The CMap describe\n * the mapping from CIDs to character codes where the latter are relative to the encoding table\n * identified by charmapID.\n * cmap:X->CID, bfmap:CID->Y, enctable:Y->CharCode\n * @param[in] font look for available encoding tables in this font\n * @param[in] cmap take the source registry-ordering pair from this CMap\n * @param[out] charmapID ID of the compatible character map found in the given font\n * @return base font CMap that maps from CIDs to character codes */\nconst CMap* CMapManager::findCompatibleBaseFontMap (const PhysicalFont *font, const CMap *cmap, CharMapID &charmapID) {\n\tif (!font || !cmap)\n\t\treturn nullptr;\n\n\tstruct CharMapIDToEncName {\n\t\tCharMapID id;\n\t\tconst char *encname;\n\t};\n\tconst array encodings {{\n\t\t{CharMapID::WIN_UCS4, \"UCS4\"},\n\t\t{CharMapID::WIN_UCS2, \"UCS2\"},\n\t\t{CharMapID::WIN_SHIFTJIS, \"90ms-RKSJ\"},\n\t\t{CharMapID::WIN_PRC, \"GBK-EUC\"},\n\t\t{CharMapID::WIN_BIG5, \"ETen-B5\"},\n\t\t{CharMapID::WIN_WANSUNG, \"KSCms-UHC\"},\n\t\t{CharMapID::MAC_JAPANESE, \"90pv-RKSJ\"},\n\t\t{CharMapID::MAC_TRADCHINESE, \"B5pc\"},\n\t\t{CharMapID::MAC_SIMPLCHINESE, \"GBpc-EUC\"},\n\t\t{CharMapID::MAC_KOREAN, \"KSCpc-EUC\"}\n\t}};\n\n\t// get IDs of all available charmaps in font\n\tvector charmapIDs;\n\tfont->collectCharMapIDs(charmapIDs);\n\n\n\t// try to find a compatible encoding CMap\n\tconst bool is_unicode_map = cmap->mapsToUnicode();\n\tconst string ro = cmap->getROString();\n\tfor (const CharMapIDToEncName &enc : encodings) {\n\t\tfor (const CharMapID &id : charmapIDs) {\n\t\t\tif (enc.id == id) {\n\t\t\t\tstring cmapname = ro+\"-\"+enc.encname;\n\t\t\t\tif (is_unicode_map || FileFinder::instance().lookup(cmapname, \"cmap\", false)) {\n\t\t\t\t\tcharmapID = enc.id;\n\t\t\t\t\treturn is_unicode_map ? cmap : lookup(cmapname);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nullptr;\n}\n\n" }, { "path": "src/CMapManager.hpp", "content": "/*************************************************************************\n** CMapManager.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CMAPMANAGER_HPP\n#define CMAPMANAGER_HPP\n\n#include \n#include \n#include \n#include \n#include \"CharMapID.hpp\"\n\nstruct CMap;\nstruct FontEncoding;\nclass FontEncodingPair;\nclass PhysicalFont;\n\nclass CMapManager\n{\n\tpublic:\n\t\tCMap* lookup (const std::string &name);\n\t\tconst CMap* findCompatibleBaseFontMap (const PhysicalFont *font, const CMap *cmap, CharMapID &charmapID);\n\t\tstatic CMapManager& instance ();\n\n\tprotected:\n\t\tCMapManager () : _level(0) {}\n\n\tprivate:\n\t\tstd::unordered_map> _cmaps; ///< loaded cmaps\n\t\tstd::unordered_set _includedCMaps; ///< names of cmaps loaded by \"usecmap\"\n\t\tint _level; ///< current inclusion depth; >0 if a cmap loaded by \"usecmap\" is being processed\n};\n\n#endif\n" }, { "path": "src/CMapReader.cpp", "content": "/*************************************************************************\n** CMapReader.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \n#include \"algorithm.hpp\"\n#include \"CMap.hpp\"\n#include \"CMapManager.hpp\"\n#include \"CMapReader.hpp\"\n#include \"FileFinder.hpp\"\n#include \"InputReader.hpp\"\n#include \"utility.hpp\"\n\nusing namespace std;\n\n\n/** Reads a cmap file and returns the corresponding CMap object.\n * @param fname[in] name/path of cmap file\n * @return CMap object representing the read data, or 0 if file could not be read */\nunique_ptr CMapReader::read (const string &fname) {\n\tif (const char *path = FileFinder::instance().lookup(fname, \"cmap\", false)) {\n\t\tifstream ifs(path);\n\t\tif (ifs)\n\t\t\treturn read(ifs, fname);\n\t}\n\t_tokens.clear();\n\treturn {};\n}\n\n\n/** Reads cmap data from a given stream and returns the corresponding CMap object.\n * @param[in] is cmap data input stream\n * @param[in] name name of CMap to be read\n * @return CMap object representing the read data, or 0 if file could not be read */\nunique_ptr CMapReader::read (std::istream& is, const string &name) {\n\t_tokens.clear();\n\t_cmap = util::make_unique(name);\n\tStreamInputReader ir(is);\n\ttry {\n\t\twhile (ir) {\n\t\t\tToken token(ir);\n\t\t\tif (token.type() == Token::Type::END)\n\t\t\t\tbreak;\n\t\t\tif (_inCMap) {\n\t\t\t\tif (token.type() == Token::Type::OPERATOR)\n\t\t\t\t\texecuteOperator(token.strvalue(), ir);\n\t\t\t\telse\n\t\t\t\t\t_tokens.push_back(token);\n\t\t\t}\n\t\t\telse if (token.type() == Token::Type::OPERATOR && token.strvalue() == \"begincmap\")\n\t\t\t\t_inCMap = true;\n\t\t}\n\t}\n\tcatch (CMapReaderException &) {\n\t\t_cmap.reset();\n\t\tthrow;\n\t}\n\treturn std::move(_cmap);\n}\n\n\n/** Executes a PS operator from the CMap file.\n * @param[in] opname name of operator to execute\n * @param[in] ir reader object used to read the CMap stream */\nvoid CMapReader::executeOperator (const string &opname, InputReader &ir) {\n\tstruct Operator {\n\t\tconst char *name;\n\t\tvoid (CMapReader::*handler)(InputReader&);\n\t};\n\tconstexpr array operators {{\n\t\t{\"beginbfchar\", &CMapReader::op_beginbfchar},\n\t\t{\"beginbfrange\", &CMapReader::op_beginbfrange},\n\t\t{\"begincidchar\", &CMapReader::op_begincidchar},\n\t\t{\"begincidrange\", &CMapReader::op_begincidrange},\n\t\t{\"def\", &CMapReader::op_def},\n\t\t{\"endcmap\", &CMapReader::op_endcmap},\n\t\t{\"usecmap\", &CMapReader::op_usecmap},\n\t}};\n\tauto it = algo::find_if(operators, [&](const Operator &op) {\n\t\treturn op.name == opname;\n\t});\n\tif (it != operators.end())\n\t\t(this->*it->handler)(ir);\n\t_tokens.clear();\n}\n\n\nvoid CMapReader::op_def (InputReader&) {\n\tsize_t size = _tokens.size();\n\tif (size >= 2) {\n\t\tconst string val = popToken().strvalue();\n\t\tconst string name = popToken().strvalue();\n\t\tif (name == \"WMode\") {\n\t\t\tif (val == \"0\" || val == \"1\")\n\t\t\t\t_cmap->_vertical = (val == \"1\");\n\t\t\telse\n\t\t\t\tthrow CMapReaderException(\"invalid WMode (0 or 1 expected)\");\n\t\t}\n\t\telse if (name == \"CMapType\")\n\t\t\t_cmap->_cmaptype = val;\n\t\telse if (name == \"Registry\")\n\t\t\t_cmap->_registry = val;\n\t\telse if (name == \"Ordering\")\n\t\t\t_cmap->_ordering = val;\n\t}\n}\n\n\nvoid CMapReader::op_endcmap (InputReader &) {\n\t_inCMap = false;\n}\n\n\nvoid CMapReader::op_usecmap (InputReader &) {\n\tif (_tokens.empty())\n\t\tthrow CMapReaderException(\"stack underflow while processing usecmap\");\n\telse {\n\t\tconst string name = popToken().strvalue();\n\t\tif ((_cmap->_basemap = CMapManager::instance().lookup(name)) == nullptr)\n\t\t\tthrow CMapReaderException(\"CMap file '\"+name+\"' not found\");\n\t}\n}\n\n\nstatic uint32_t parse_hexentry (InputReader &ir) {\n\tir.skipSpace();\n\tif (ir.get() != '<')\n\t\tthrow CMapReaderException(\"invalid range entry ('<' expected)\");\n\tunsigned val;\n\tif (!ir.parseUInt(16, val))\n\t\tthrow CMapReaderException(\"invalid range entry (hexadecimal value expected)\");\n\tif (ir.get() != '>')\n\t\tthrow CMapReaderException(\"invalid range entry ('>' expected)\");\n\treturn uint32_t(val);\n}\n\n\nvoid CMapReader::parseCIDChars (InputReader &ir, bool isRange) {\n\tif (!_tokens.empty() && _tokens.back().type() == Token::Type::NUMBER) {\n\t\tir.skipSpace();\n\t\tint num_entries = static_cast(popToken().numvalue());\n\t\twhile (num_entries > 0 && ir.peek() == '<') {\n\t\t\tuint32_t first = parse_hexentry(ir);\n\t\t\tuint32_t last = first;\n\t\t\tif (isRange)\n\t\t\t\tlast = parse_hexentry(ir);\n\t\t\tir.skipSpace();\n\t\t\tuint32_t cid;\n\t\t\tif (!ir.parseUInt(cid))\n\t\t\t\tthrow CMapReaderException(\"invalid char entry (decimal value expected)\");\n\t\t\t_cmap->addCIDRange(first, last, cid);\n\t\t\tir.skipSpace();\n\t\t}\n\t}\n}\n\n\nvoid CMapReader::op_begincidchar (InputReader &ir) {\n\tparseCIDChars(ir, false);\n}\n\n\nvoid CMapReader::op_begincidrange (InputReader &ir) {\n\tparseCIDChars(ir, true);\n}\n\n\nvoid CMapReader::op_beginbfrange (InputReader &ir) {\n\tif (!_tokens.empty() && _tokens.back().type() == Token::Type::NUMBER) {\n\t\tir.skipSpace();\n\t\tint num_entries = static_cast(popToken().numvalue());\n\t\twhile (num_entries > 0 && ir.peek() == '<') {\n\t\t\tuint32_t first = parse_hexentry(ir);\n\t\t\tuint32_t last = parse_hexentry(ir);\n\t\t\tuint32_t chrcode = parse_hexentry(ir);\n\t\t\t_cmap->addBFRange(first, last, chrcode);\n\t\t\tir.skipSpace();\n\t\t}\n\t\t_cmap->_mapsToCID = false;\n\t}\n}\n\n\nvoid CMapReader::op_beginbfchar (InputReader &ir) {\n\tif (!_tokens.empty() && _tokens.back().type() == Token::Type::NUMBER) {\n\t\tir.skipSpace();\n\t\tint num_entries = static_cast(popToken().numvalue());\n\t\twhile (num_entries > 0 && ir.peek() == '<') {\n\t\t\tuint32_t cid = parse_hexentry(ir);\n\t\t\tir.skipSpace();\n\t\t\tif (ir.peek() == '/')\n\t\t\t\tthrow CMapReaderException(\"mapping of named characters is not supported\");\n\t\t\tuint32_t chrcode = parse_hexentry(ir);\n\t\t\t_cmap->addBFRange(cid, cid, chrcode);\n\t\t\tir.skipSpace();\n\t\t}\n\t\t_cmap->_mapsToCID = false;\n\t}\n}\n\n////////////////////////////////////////////////////////////////////////////////////\n\nCMapReader::Token::Token (InputReader &ir) {\n\tscan(ir);\n}\n\n\n/** Reads the next characters from the input stream to create a token. */\nvoid CMapReader::Token::scan (InputReader &ir) {\n\tir.skipSpace();\n\twhile (ir.peek() == '%') { // comment?\n\t\twhile (ir.peek() != '\\n') // => skip until end of line\n\t\t\tir.get();\n\t\tir.skipSpace();\n\t}\n\tir.skipSpace();\n\tif (ir.eof())\n\t\t_type = Type::END;\n\telse if (ir.peek() == '/') { // PS name?\n\t\tir.get();\n\t\twhile (!strchr(\"[]{}<>\", ir.peek()) && !isspace(ir.peek()))\n\t\t\t_value += ir.get();\n\t\t_type = Type::NAME;\n\t}\n\telse if (ir.peek() == '(') { // string?\n\t\tir.get();\n\t\tint level=0;\n\t\twhile (ir.peek() != ')' || level > 0) {\n\t\t\tif (ir.peek() == '(')\n\t\t\t\tlevel++;\n\t\t\telse if (ir.peek() == ')' && level > 0)\n\t\t\t\tlevel--;\n\t\t\t_value += ir.get();\n\t\t}\n\t\tir.get(); // skip ')'\n\t\t_type = Type::STRING;\n\t}\n\telse if (strchr(\"[]{}<>\", ir.peek())) { // PS delimiter\n\t\t_value = ir.get();\n\t\t_type = Type::DELIM;\n\t}\n\telse if (isdigit(ir.peek())) { // number?\n\t\tdouble val;\n\t\tif (ir.parseDouble(val)) {\n\t\t\t_value = util::to_string(val);\n\t\t\t_type = Type::NUMBER;\n\t\t}\n\t}\n\telse {\n\t\twhile (!strchr(\"[]{}<>\", ir.peek()) && !isspace(ir.peek()))\n\t\t\t_value += ir.get();\n\t\t_type = Type::OPERATOR;\n\t}\n}\n" }, { "path": "src/CMapReader.hpp", "content": "/*************************************************************************\n** CMapReader.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CMAPREADER_HPP\n#define CMAPREADER_HPP\n\n#include \n#include \n#include \n#include \n#include \n#include \"MessageException.hpp\"\n\n\nstruct CMap;\nclass InputReader;\n\nclass CMapReader {\n\tclass Token\t{\n\t\tpublic:\n\t\t\tenum class Type {UNKNOWN, END, DELIM, NUMBER, STRING, NAME, OPERATOR};\n\n\t\tpublic:\n\t\t\texplicit Token (InputReader &ir);\n\t\t\tvoid scan (InputReader &ir);\n\t\t\tType type () const {return _type;}\n\t\t\tconst std::string& strvalue () const {return _value;}\n\t\t\tdouble numvalue () const {return std::atof(_value.c_str());}\n\n\t\tprivate:\n\t\t\tType _type;\n\t\t\tstd::string _value;\n\t};\n\n\tpublic:\n\t\tstd::unique_ptr read (const std::string &fname);\n\t\tstd::unique_ptr read (std::istream &is, const std::string &name);\n\n\tprotected:\n\t\tToken popToken () {Token t=_tokens.back(); _tokens.pop_back(); return t;}\n\t\tvoid executeOperator (const std::string &op, InputReader &ir);\n\t\tvoid parseCIDChars (InputReader &ir, bool isRange);\n\t\tvoid op_beginbfchar (InputReader &ir);\n\t\tvoid op_beginbfrange (InputReader &ir);\n\t\tvoid op_begincidchar (InputReader &ir);\n\t\tvoid op_begincidrange (InputReader &ir);\n\t\tvoid op_def (InputReader &ir);\n\t\tvoid op_endcmap (InputReader &ir);\n\t\tvoid op_usecmap (InputReader &ir);\n\n\tprivate:\n\t\tstd::unique_ptr _cmap; ///< pointer to CMap being read\n\t\tstd::vector _tokens; ///< stack of tokens to be processed\n\t\tbool _inCMap=false; ///< true if operator begincmap has been executed\n};\n\n\nstruct CMapReaderException : MessageException {\n\texplicit CMapReaderException (const std::string &msg) : MessageException(msg) {}\n};\n\n#endif\n" }, { "path": "src/Calculator.cpp", "content": "/*************************************************************************\n** Calculator.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \n#include \"Calculator.hpp\"\n\nusing namespace std;\n\n/** Evaluates a given arithmetic expression and returns its value.\n * The evaluator is implemented as a recursive descent parser.\n * @param[in] is reads expression from this stream\n * @return expression value */\ndouble Calculator::eval (istream &is) const {\n\tdouble ret = expr(is, false);\n\ttry {\n\t\t// check if expression has been fully evaluated (next token is of type bool)\n\t\tmpark::get(lookAhead(is));\n\t}\n\tcatch (mpark::bad_variant_access &) {\n\t\tthrow CalculatorException(\"expression syntax error\");\n\t}\n\treturn ret;\n}\n\n\n/** Evaluates a given arithmetic expression and returns its value.\n * @param[in] expr expression to evaluate\n * @return expression value */\ndouble Calculator::eval (const string &expr) const {\n\tistringstream iss;\n\tiss.str(expr);\n\treturn eval(iss);\n}\n\n\n/** Evaluates the root rule of the expression grammar. */\ndouble Calculator::expr (istream &is, bool skip) const { // expr:\n\tdouble left = term(is, skip);\n\tbool ready=false;\n\twhile (!ready) {\n\t\tToken token = lookAhead(is);\n\t\tchar *op = mpark::get_if(&token);\n\t\tif (!op)\n\t\t\tready = true;\n\t\telse {\n\t\t\tswitch (*op) {\n\t\t\t\tcase '+': left += term(is, true); break; // term '+' term => $1 + $3\n\t\t\t\tcase '-': left -= term(is, true); break; // term '-' term => $1 - $3\n\t\t\t\tdefault : ready = true;\n\t\t\t}\n\t\t}\n\t}\n\treturn left; // term => $1\n}\n\n\ndouble Calculator::term (istream &is, bool skip) const { // term:\n\tdouble left = prim(is, skip);\n\tbool ready=false;\n\twhile (!ready) {\n\t\tToken token = lookAhead(is);\n\t\tchar *op = mpark::get_if(&token);\n\t\tif (!op)\n\t\t\tready = true;\n\t\telse {\n\t\t\tswitch (*op) {\n\t\t\t\tcase '*': left *= prim(is, true); break; // prim '*' prim => $1 * $3\n\t\t\t\tcase '(': left *= prim(is, false); break; // prim '(' prim => $1 * $3\n\t\t\t\tcase '/': { // prim '/' prim => $1 / $3\n\t\t\t\t\tdouble denom = prim(is, true);\n\t\t\t\t\tif (denom == 0)\n\t\t\t\t\t\tthrow CalculatorException(\"division by zero\");\n\t\t\t\t\tleft /= denom;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase '%': { // prim '%' prim => $1 mod $3\n\t\t\t\t\tdouble denom = prim(is, true);\n\t\t\t\t\tif (denom == 0)\n\t\t\t\t\t\tthrow CalculatorException(\"division by zero\");\n\t\t\t\t\tleft -= denom * floor(left / denom);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t\tready = true;\n\t\t\t}\n\t\t}\n\t}\n\treturn left;\n}\n\n\n/** Evaluates a primary expression of the grammar which doesn't contain any binary operators. */\ndouble Calculator::prim (istream &is, bool skip) const { // prim:\n\tif (skip)\n\t\tlex(is);\n\tToken token = lookAhead(is);\n\tif (mpark::get_if(&token)) { // NUMBER => $1\n\t\tdouble ret = mpark::get(lex(is));\n\t\ttoken = lookAhead(is);\n\t\tif (mpark::get_if(&token)) // NUMBER STRING => $1 * $2\n\t\t\tret *= getVariable(mpark::get(lex(is)));\n\t\treturn ret;\n\t}\n\tif (mpark::get_if(&token)) // STRING => getVariable($1)\n\t\treturn getVariable(mpark::get(lex(is)));\n\tif (char *op = mpark::get_if(&token)) {\n\t\tswitch (*op) {\n\t\t\tcase '-': // '-' prim => -$2\n\t\t\t\treturn -prim(is, true);\n\t\t\tcase '(': { // '(' expr ')' => $2\n\t\t\t\tdouble e = expr(is, true);\n\t\t\t\ttry {\n\t\t\t\t\tif (mpark::get(lookAhead(is)) != ')')\n\t\t\t\t\t\tthrow CalculatorException(\"')' expected\");\n\t\t\t\t}\n\t\t\t\tcatch (mpark::bad_variant_access &) {\n\t\t\t\t\tthrow CalculatorException(\"')' expected\");\n\t\t\t\t}\n\t\t\t\tis.get(); // skip processed char\n\t\t\t\treturn e;\n\t\t\t}\n\t\t}\n\t}\n\tthrow CalculatorException(\"primary expression expected\");\n}\n\n\n/** Returns the value of a previously defined variable. If there\n * is no variable of the given name, a CalculatorException is thrown.\n * @param[in] name name of variable\n * @return assigned value */\ndouble Calculator::getVariable (const string &name) const {\n\tauto it = _variables.find(name);\n\tif (it == _variables.end())\n\t\tthrow CalculatorException(\"undefined variable '\" + name + \"'\");\n\treturn it->second;\n}\n\n\n/** Determines the type of the next token without swallowing it. That means\n * the same token will be read again next time. The value of the returned token\n * object is only set for character tokens and should be considered undefined\n * for the other types. */\nCalculator::Token Calculator::lookAhead (istream &is) {\n\tis >> ws;\n\tint c = is.peek();\n\tif (is.eof())\n\t\treturn false;\n\tif (isdigit(c) || c == '.')\n\t\treturn double(0);\n\tif (isalpha(c))\n\t\treturn string();\n\treturn char(c);\n}\n\n\n/** Reads and swallows the next token. The returned Token object is represented by\n * a variant and thus contains both its type and value.\n * @param[in] is next token is read from this stream\n * @return the read token */\nCalculator::Token Calculator::lex (istream &is) {\n\tToken token = lookAhead(is);\n\tif (mpark::get_if(&token))\n\t\tis.get(); // token already contains the value from look ahead\n\telse if (mpark::get_if(&token)) {\n\t\tstring str;\n\t\twhile (isdigit(is.peek()) || is.peek() == '.')\n\t\t\tstr += char(is.get());\n\t\ttry {\n\t\t\ttoken.emplace(stod(str));\n\t\t}\n\t\tcatch (const exception&) {\n\t\t\tthrow CalculatorException(\"invalid number: \"+str);\n\t\t}\n\t}\n\telse if (mpark::get_if(&token)) {\n\t\tstring name;\n\t\twhile (isalpha(is.peek()))\n\t\t\tname += char(is.get());\n\t\ttoken.emplace(name);\n\t}\n\treturn token;\n}\n" }, { "path": "src/Calculator.hpp", "content": "/*************************************************************************\n** Calculator.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CALCULATOR_HPP\n#define CALCULATOR_HPP\n\n#include \n#include \n#include \n#include \n#include \"MessageException.hpp\"\n\nstruct CalculatorException : MessageException {\n\texplicit CalculatorException (const std::string &msg) : MessageException(msg) {}\n};\n\nclass Calculator {\n\tpublic:\n\t\tdouble eval (std::istream &is) const;\n\t\tdouble eval (const std::string &expr) const;\n\t\tvoid setVariable (const std::string &name, double value) {_variables[name] = value;}\n\t\tdouble getVariable (const std::string &name) const;\n\n\tprotected:\n\t\tdouble expr (std::istream &is, bool skip) const;\n\t\tdouble term (std::istream &is, bool skip) const;\n\t\tdouble prim (std::istream &is, bool skip) const;\n\n\t\tusing Token = mpark::variant;\n\t\tstatic Token lex (std::istream &is);\n\t\tstatic Token lookAhead (std::istream &is);\n\n\tprivate:\n\t\tstd::map _variables;\n};\n\n#endif\n" }, { "path": "src/CharMapID.cpp", "content": "/*************************************************************************\n** CharMapID.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \"CharMapID.hpp\"\n\nconst CharMapID CharMapID::NONE(0, 0);\nconst CharMapID CharMapID::WIN_SYMBOL(3, 0);\nconst CharMapID CharMapID::WIN_UCS2(3, 1);\nconst CharMapID CharMapID::WIN_SHIFTJIS(3, 2);\nconst CharMapID CharMapID::WIN_PRC(3, 3);\nconst CharMapID CharMapID::WIN_BIG5(3, 4);\nconst CharMapID CharMapID::WIN_WANSUNG(3, 5);\nconst CharMapID CharMapID::WIN_JOHAB(3, 6);\nconst CharMapID CharMapID::WIN_UCS4(3, 10);\n\nconst CharMapID CharMapID::MAC_JAPANESE(1, 1);\nconst CharMapID CharMapID::MAC_TRADCHINESE(1, 2);\nconst CharMapID CharMapID::MAC_KOREAN(1, 3);\nconst CharMapID CharMapID::MAC_SIMPLCHINESE(1, 25);\n" }, { "path": "src/CharMapID.hpp", "content": "/*************************************************************************\n** CharMapID.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CHARMAPID_HPP\n#define CHARMAPID_HPP\n\n#include \n\n/** Represents a character map of a font. */\nstruct CharMapID {\n\tCharMapID () noexcept =default;\n\tCharMapID (uint8_t plf_id, uint8_t enc_id) noexcept : platform_id(plf_id), encoding_id(enc_id) {}\n\n\tbool operator == (const CharMapID &ids) const {\n\t\treturn platform_id == ids.platform_id && encoding_id == ids.encoding_id;\n\t}\n\n\tbool operator != (const CharMapID &ids) const {\n\t\treturn platform_id != ids.platform_id || encoding_id != ids.encoding_id;\n\t}\n\n\tbool valid () const {return platform_id != 0 && encoding_id != 0;}\n\n\tstatic const CharMapID NONE;\n\tstatic const CharMapID WIN_SYMBOL;\n\tstatic const CharMapID WIN_UCS2;\n\tstatic const CharMapID WIN_SHIFTJIS;\n\tstatic const CharMapID WIN_PRC;\n\tstatic const CharMapID WIN_BIG5;\n\tstatic const CharMapID WIN_WANSUNG;\n\tstatic const CharMapID WIN_JOHAB;\n\tstatic const CharMapID WIN_UCS4;\n\tstatic const CharMapID MAC_JAPANESE;\n\tstatic const CharMapID MAC_TRADCHINESE;\n\tstatic const CharMapID MAC_SIMPLCHINESE;\n\tstatic const CharMapID MAC_KOREAN;\n\n\tuint8_t platform_id=0;\n\tuint8_t encoding_id=0;\n};\n\n#endif\n" }, { "path": "src/Character.hpp", "content": "/*************************************************************************\n** Character.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef CHARACTER_HPP\n#define CHARACTER_HPP\n\n#include \n\nclass Character {\n\tpublic:\n\t\tenum Type {CHRCODE, INDEX, NAME};\n\t\texplicit Character (const char *name) : _type(NAME), _name(name) {}\n\t\tCharacter (Type type, uint32_t val) : _type(type), _number(val) {}\n\t\tCharacter (Type type, const Character &c) : _type(type), _number(c.type() != NAME ? c._number : 0) {}\n\t\tType type () const {return _type;}\n\t\tconst char* name () const {return _name;}\n\t\tuint32_t number () const {return _number;}\n\n\tprivate:\n\t\tType _type;\n\t\tunion {\n\t\t\tuint32_t _number;\n\t\t\tconst char *_name;\n\t\t};\n};\n\n#endif\n\n" }, { "path": "src/Color.cpp", "content": "/*************************************************************************\n** Color.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"algorithm.hpp\"\n#include \"Color.hpp\"\n#include \"utility.hpp\"\n\nusing namespace std;\n\nbool Color::SUPPRESS_COLOR_NAMES = true;\n\nconst Color Color::BLACK(uint32_t(0));\nconst Color Color::WHITE(uint8_t(255), uint8_t(255), uint8_t(255));\n\n\ninline uint8_t double_to_byte (double v) {\n\tv = max(0.0, min(1.0, v));\n\treturn uint8_t(round(255.0*v));\n}\n\n\n/** Reads n double values from input stream is. The values may be\n * separated by whitespace and/or commas. */\nstatic valarray read_doubles (istream &is, int n) {\n\tvalarray values(n);\n\tfor (double &val : values) {\n\t\tis >> ws;\n\t\tif (!util::read_double(is, val))\n\t\t\tval = 0;\n\t\tis >> ws;\n\t\tif (is.peek() == ',') {\n\t\t\tis.get();\n\t\t\tis >> ws;\n\t\t}\n\t}\n\treturn values;\n}\n\n\n/** Creates a color object from a string specifying the color. It can\n * either be a PS color name or one of the color functions rgb(r,g,b),\n * cmyk(c,m,y,k) where the parameters are numbers in the interval\n * from 0 to 1. */\nColor::Color (const string &colorstr) {\n\tif (colorstr.substr(0, 4) == \"rgb(\") {\n\t\tistringstream iss(colorstr.substr(4));\n\t\tsetRGB(read_doubles(iss, 3));\n\t}\n\telse if (colorstr.substr(0, 5) == \"cmyk(\") {\n\t\tistringstream iss(colorstr.substr(5));\n\t\tsetCMYK(read_doubles(iss, 4));\n\t}\n\telse if (!setPSName(colorstr, false))\n\t\tsetGray(uint8_t(0));\n}\n\n\nColor::Color (const valarray &values, ColorSpace cs) noexcept : _cspace(cs) {\n\tint n = numComponents(cs);\n\tint i=0;\n\t_value = 0;\n\tfor (int shift=(n-1)*8; shift >= 0; shift-=8)\n\t\t_value |= double_to_byte(values[i++]) << shift;\n}\n\n\nvoid Color::setRGB (uint8_t r, uint8_t g, uint8_t b) {\n\t_value = (r << 16) | (g << 8) | b;\n\t_cspace = ColorSpace::RGB;\n}\n\n\nvoid Color::setRGB (double r, double g, double b) {\n\tsetRGB(double_to_byte(r), double_to_byte(g), double_to_byte(b));\n}\n\n\n/** Sets the color value according to a given hex RGB string of the\n * form \"#123456\" or \"#123\" where the latter is expanded to \"#112233\".\n * The leading '#' character is optional.\n * @param[in] hexString the RGB hex string\n * @return true if the color value was assigned successfully */\nbool Color::setRGBHexString (string hexString) {\n\tif (!hexString.empty()) {\n\t\tif (hexString[0] == '#')\n\t\t\thexString = hexString.substr(1);\n\t\tif (hexString.length() == 3) {\n\t\t\t// expand short form \"123\" to \"112233\"\n\t\t\thexString.resize(6);\n\t\t\thexString[5] = hexString[4] = hexString[2];\n\t\t\thexString[3] = hexString[2] = hexString[1];\n\t\t\thexString[1] = hexString[0];\n\t\t}\n\t\tif (hexString.length() == 6) {\n\t\t\ttry {\n\t\t\t\t_value = stoi(hexString, nullptr, 16);\n\t\t\t\t_cspace = ColorSpace::RGB;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tcatch (...) {\n\t\t\t}\n\t\t}\n\t}\n\treturn false;\n}\n\n\n/** Expects a PostScript color name and sets the color accordingly.\n * @param[in] name PS color name\n * @param[in] case_sensitive if true, upper/lower case spelling is significant\n * @return true if color name could be applied properly */\nbool Color::setPSName (string name, bool case_sensitive) {\n\t_cspace = ColorSpace::RGB;\n\tif (name[0] == '#') {\n\t\tchar *p=nullptr;\n\t\t_value = uint32_t(strtol(name.c_str()+1, &p, 16));\n\t\twhile (isspace(*p))\n\t\t\tp++;\n\t\treturn (*p == 0 && _value <= 0xFFFFFF);\n\t}\n\n\tstruct ColorConstant {\n\t\tconst char *name;\n\t\tconst uint32_t rgb;\n\t};\n\t// converted color constants from color.pro\n\tstatic constexpr array constants {{\n\t\t{\"Apricot\", 0xFFAD7A},\n\t\t{\"Aquamarine\", 0x2DFFB2},\n\t\t{\"Bittersweet\", 0xC10200},\n\t\t{\"Black\", 0x000000},\n\t\t{\"Blue\", 0x0000FF},\n\t\t{\"BlueGreen\", 0x26FFAA},\n\t\t{\"BlueViolet\", 0x190CF4},\n\t\t{\"BrickRed\", 0xB70000},\n\t\t{\"Brown\", 0x660000},\n\t\t{\"BurntOrange\", 0xFF7C00},\n\t\t{\"CadetBlue\", 0x606DC4},\n\t\t{\"CarnationPink\", 0xFF5EFF},\n\t\t{\"Cerulean\", 0x0FE2FF},\n\t\t{\"CornflowerBlue\", 0x59DDFF},\n\t\t{\"Cyan\", 0x00FFFF},\n\t\t{\"Dandelion\", 0xFFB528},\n\t\t{\"DarkOrchid\", 0x9932CC},\n\t\t{\"Emerald\", 0x00FF7F},\n\t\t{\"ForestGreen\", 0x00E000},\n\t\t{\"Fuchsia\", 0x7202EA},\n\t\t{\"Goldenrod\", 0xFFE528},\n\t\t{\"Gray\", 0x7F7F7F},\n\t\t{\"Green\", 0x00FF00},\n\t\t{\"GreenYellow\", 0xD8FF4F},\n\t\t{\"JungleGreen\", 0x02FF7A},\n\t\t{\"Lavender\", 0xFF84FF},\n\t\t{\"LimeGreen\", 0x7FFF00},\n\t\t{\"Magenta\", 0xFF00FF},\n\t\t{\"Mahogany\", 0xA50000},\n\t\t{\"Maroon\", 0xAD0000},\n\t\t{\"Melon\", 0xFF897F},\n\t\t{\"MidnightBlue\", 0x007091},\n\t\t{\"Mulberry\", 0xA314F9},\n\t\t{\"NavyBlue\", 0x0F75FF},\n\t\t{\"OliveGreen\", 0x009900},\n\t\t{\"Orange\", 0xFF6321},\n\t\t{\"OrangeRed\", 0xFF007F},\n\t\t{\"Orchid\", 0xAD5BFF},\n\t\t{\"Peach\", 0xFF7F4C},\n\t\t{\"Periwinkle\", 0x6D72FF},\n\t\t{\"PineGreen\", 0x00BF28},\n\t\t{\"Plum\", 0x7F00FF},\n\t\t{\"ProcessBlue\", 0x0AFFFF},\n\t\t{\"Purple\", 0x8C23FF},\n\t\t{\"RawSienna\", 0x8C0000},\n\t\t{\"Red\", 0xFF0000},\n\t\t{\"RedOrange\", 0xFF3A21},\n\t\t{\"RedViolet\", 0x9600A8},\n\t\t{\"Rhodamine\", 0xFF2DFF},\n\t\t{\"RoyalBlue\", 0x007FFF},\n\t\t{\"RoyalPurple\", 0x3F19FF},\n\t\t{\"RubineRed\", 0xFF00DD},\n\t\t{\"Salmon\", 0xFF779E},\n\t\t{\"SeaGreen\", 0x4FFF7F},\n\t\t{\"Sepia\", 0x4C0000},\n\t\t{\"SkyBlue\", 0x60FFE0},\n\t\t{\"SpringGreen\", 0xBCFF3D},\n\t\t{\"Tan\", 0xDB9370},\n\t\t{\"TealBlue\", 0x1EF9A3},\n\t\t{\"Thistle\", 0xE068FF},\n\t\t{\"Turquoise\", 0x26FFCC},\n\t\t{\"Violet\", 0x351EFF},\n\t\t{\"VioletRed\", 0xFF30FF},\n\t\t{\"White\", 0xFFFFFF},\n\t\t{\"WildStrawberry\", 0xFF0A9B},\n\t\t{\"Yellow\", 0xFFFF00},\n\t\t{\"YellowGreen\", 0x8EFF42},\n\t\t{\"YellowOrange\", 0xFF9300},\n\t}};\n\tif (case_sensitive) {\n\t\tconst ColorConstant cmppair = {name.c_str(), 0};\n\t\tauto it = algo::lower_bound(constants, cmppair, [](const ColorConstant &c1, const ColorConstant &c2) {\n\t\t\treturn strcmp(c1.name, c2.name) < 0;\n\t\t});\n\t\tif (it != constants.end() && it->name == name) {\n\t\t\t_value = it->rgb;\n\t\t\treturn true;\n\t\t}\n\t}\n\telse {\n\t\tname = util::tolower(name);\n\t\tauto it = algo::find_if(constants, [&](const ColorConstant &cc) {\n\t\t\treturn name == util::tolower(cc.name);\n\t\t});\n\t\tif (it != constants.end()) {\n\t\t\t_value = it->rgb;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\nvoid Color::setHSB (double h, double s, double b) {\n\tvalarray hsb(3), rgb(3);\n\thsb[0] = h;\n\thsb[1] = s;\n\thsb[2] = b;\n\tHSB2RGB(hsb, rgb);\n\tsetRGB(rgb);\n}\n\n\nvoid Color::setCMYK (uint8_t c, uint8_t m, uint8_t y, uint8_t k) {\n\t_value = (c << 24) | (m << 16) | (y << 8) | k;\n\t_cspace = ColorSpace::CMYK;\n}\n\n\nvoid Color::setCMYK (double c, double m, double y, double k) {\n\tsetCMYK(double_to_byte(c), double_to_byte(m), double_to_byte(y), double_to_byte(k));\n}\n\n\nvoid Color::setCMYK (const std::valarray &cmyk) {\n\tsetCMYK(cmyk[0], cmyk[1], cmyk[2], cmyk[3]);\n}\n\n\nvoid Color::set (ColorSpace colorSpace, VectorIterator &it) {\n\tswitch (colorSpace) {\n\t\tcase ColorSpace::GRAY: setGray(*it++); break;\n\t\tcase ColorSpace::RGB : setRGB(*it, *(it+1), *(it+2)); it+=3; break;\n\t\tcase ColorSpace::LAB : setLab(*it, *(it+1), *(it+2)); it+=3; break;\n\t\tcase ColorSpace::CMYK: setCMYK(*it, *(it+1), *(it+2), *(it+3)); it+=4; break;\n\t\tdefault: ;\n\t}\n}\n\n\nColor Color::operator *= (double c) {\n\tif (abs(c) < 0.001)\n\t\t_value &= 0xff000000;\n\telse if (abs(c-trunc(c)) < 0.999) {\n\t\tuint32_t value=0;\n\t\tfor (int i=0; i < 4; i++) {\n\t\t\tvalue |= lround((_value & 0xff)*c) << (8*i);\n\t\t\t_value >>= 8;\n\t\t}\n\t\t_value = value;\n\t}\n\treturn *this;\n}\n\n\n/** Returns an RGB string representing the color. Depending on the\n * color value, the string either consists of 3 or 6 hex digits\n * plus a leading '#' character. */\nstring Color::rgbString () const {\n\tuint32_t rgb = getRGBUInt32();\n\tostringstream oss;\n\toss << '#';\n\tfor (int i=2; i >= 0; i--) {\n\t\toss << setbase(16) << setfill('0') << setw(2)\n\t\t\t << (((rgb >> (8*i)) & 0xff));\n\t}\n\t// check if RGB string can be reduced to a three digit hex value\n\t// #RRGGBB => #RGB, e.g. #112233 => #123\n\tstring hexstr = oss.str();\n\tif (hexstr[1] == hexstr[2] && hexstr[3] == hexstr[4] && hexstr[5] == hexstr[6]) {\n\t\thexstr[2] = hexstr[3];\n\t\thexstr[3] = hexstr[5];\n\t\thexstr.resize(4);\n\t}\n\treturn hexstr;\n}\n\n\n/** Returns an SVG color string representing the current color. The result can\n * either be an SVG color name or an RGB string of the form #RRGGBB. The latter\n * will be returned if parameter rgbonly is true or if the SVG standard doesn't\n * define a name for the current color. */\nstring Color::svgColorString (bool rgbonly) const {\n\tif (!rgbonly) {\n\t\tstruct ColorName {\n\t\t\tuint32_t rgb;\n\t\t\tconst char *name;\n\t\t};\n\t\tstatic constexpr array colornames {{\n\t\t\t{0x000000, \"black\"},\n\t\t\t{0x000080, \"navy\"},\n\t\t\t{0x00008b, \"darkblue\"},\n\t\t\t{0x0000cd, \"mediumblue\"},\n\t\t\t{0x0000ff, \"blue\"},\n\t\t\t{0x006400, \"darkgreen\"},\n\t\t\t{0x008000, \"green\"},\n\t\t\t{0x008080, \"teal\"},\n\t\t\t{0x008b8b, \"darkcyan\"},\n\t\t\t{0x00bfff, \"deepskyblue\"},\n\t\t\t{0x00ced1, \"darkturquoise\"},\n\t\t\t{0x00fa9a, \"mediumspringgreen\"},\n\t\t\t{0x00ff00, \"lime\"},\n\t\t\t{0x00ff7f, \"springgreen\"},\n\t\t\t{0x00ffff, \"cyan\"},\n\t\t\t{0x191970, \"midnightblue\"},\n\t\t\t{0x1e90ff, \"dodgerblue\"},\n\t\t\t{0x20b2aa, \"lightseagreen\"},\n\t\t\t{0x228b22, \"forestgreen\"},\n\t\t\t{0x2e8b57, \"seagreen\"},\n\t\t\t{0x2f4f4f, \"darkslategray\"},\n\t\t\t{0x32cd32, \"limegreen\"},\n\t\t\t{0x3cb371, \"mediumseagreen\"},\n\t\t\t{0x40e0d0, \"turquoise\"},\n\t\t\t{0x4169e1, \"royalblue\"},\n\t\t\t{0x4682b4, \"steelblue\"},\n\t\t\t{0x483d8b, \"darkslateblue\"},\n\t\t\t{0x48d1cc, \"mediumturquoise\"},\n\t\t\t{0x4b0082, \"indigo\"},\n\t\t\t{0x556b2f, \"darkolivegreen\"},\n\t\t\t{0x5f9ea0, \"cadetblue\"},\n\t\t\t{0x6495ed, \"cornflowerblue\"},\n\t\t\t{0x66cdaa, \"mediumaquamarine\"},\n\t\t\t{0x696969, \"dimgray\"},\n\t\t\t{0x6a5acd, \"slateblue\"},\n\t\t\t{0x6b8e23, \"olivedrab\"},\n\t\t\t{0x708090, \"slategray\"},\n\t\t\t{0x778899, \"lightslategray\"},\n\t\t\t{0x7b68ee, \"mediumslateblue\"},\n\t\t\t{0x7cfc00, \"lawngreen\"},\n\t\t\t{0x7fff00, \"chartreuse\"},\n\t\t\t{0x7fffd4, \"aquamarine\"},\n\t\t\t{0x800000, \"maroon\"},\n\t\t\t{0x800080, \"purple\"},\n\t\t\t{0x808000, \"olive\"},\n\t\t\t{0x808080, \"gray\"},\n\t\t\t{0x87ceeb, \"skyblue\"},\n\t\t\t{0x87cefa, \"lightskyblue\"},\n\t\t\t{0x8a2be2, \"blueviolet\"},\n\t\t\t{0x8b0000, \"darkred\"},\n\t\t\t{0x8b008b, \"darkmagenta\"},\n\t\t\t{0x8b4513, \"saddlebrown\"},\n\t\t\t{0x8fbc8f, \"darkseagreen\"},\n\t\t\t{0x90ee90, \"lightgreen\"},\n\t\t\t{0x9370db, \"mediumpurple\"},\n\t\t\t{0x9400d3, \"darkviolet\"},\n\t\t\t{0x98fb98, \"palegreen\"},\n\t\t\t{0x9932cc, \"darkorchid\"},\n\t\t\t{0x9acd32, \"yellowgreen\"},\n\t\t\t{0xa0522d, \"sienna\"},\n\t\t\t{0xa52a2a, \"brown\"},\n\t\t\t{0xa9a9a9, \"darkgray\"},\n\t\t\t{0xadd8e6, \"lightblue\"},\n\t\t\t{0xadff2f, \"greenyellow\"},\n\t\t\t{0xafeeee, \"paleturquoise\"},\n\t\t\t{0xb0c4de, \"lightsteelblue\"},\n\t\t\t{0xb0e0e6, \"powderblue\"},\n\t\t\t{0xb22222, \"firebrick\"},\n\t\t\t{0xb8860b, \"darkgoldenrod\"},\n\t\t\t{0xba55d3, \"mediumorchid\"},\n\t\t\t{0xbc8f8f, \"rosybrown\"},\n\t\t\t{0xbdb76b, \"darkkhaki\"},\n\t\t\t{0xc0c0c0, \"silver\"},\n\t\t\t{0xc71585, \"mediumvioletred\"},\n\t\t\t{0xcd5c5c, \"indianred\"},\n\t\t\t{0xcd853f, \"peru\"},\n\t\t\t{0xd2691e, \"chocolate\"},\n\t\t\t{0xd2b48c, \"tan\"},\n\t\t\t{0xd3d3d3, \"lightgray\"},\n\t\t\t{0xd8bfd8, \"thistle\"},\n\t\t\t{0xda70d6, \"orchid\"},\n\t\t\t{0xdaa520, \"goldenrod\"},\n\t\t\t{0xdb7093, \"palevioletred\"},\n\t\t\t{0xdc143c, \"crimson\"},\n\t\t\t{0xdcdcdc, \"gainsboro\"},\n\t\t\t{0xdda0dd, \"plum\"},\n\t\t\t{0xdeb887, \"burlywood\"},\n\t\t\t{0xe0ffff, \"lightcyan\"},\n\t\t\t{0xe6e6fa, \"lavender\"},\n\t\t\t{0xe9967a, \"darksalmon\"},\n\t\t\t{0xee82ee, \"violet\"},\n\t\t\t{0xeee8aa, \"palegoldenrod\"},\n\t\t\t{0xf08080, \"lightcoral\"},\n\t\t\t{0xf0e68c, \"khaki\"},\n\t\t\t{0xf0f8ff, \"aliceblue\"},\n\t\t\t{0xf0fff0, \"honeydew\"},\n\t\t\t{0xf0ffff, \"azure\"},\n\t\t\t{0xf4a460, \"sandybrown\"},\n\t\t\t{0xf5deb3, \"wheat\"},\n\t\t\t{0xf5f5dc, \"beige\"},\n\t\t\t{0xf5f5f5, \"whitesmoke\"},\n\t\t\t{0xf5fffa, \"mintcream\"},\n\t\t\t{0xf8f8ff, \"ghostwhite\"},\n\t\t\t{0xfa8072, \"salmon\"},\n\t\t\t{0xfaebd7, \"antiquewhite\"},\n\t\t\t{0xfaf0e6, \"linen\"},\n\t\t\t{0xfafad2, \"lightgoldenrodyellow\"},\n\t\t\t{0xfdf5e6, \"oldlace\"},\n\t\t\t{0xff0000, \"red\"},\n\t\t\t{0xff00ff, \"magenta\"},\n\t\t\t{0xff1493, \"deeppink\"},\n\t\t\t{0xff4500, \"orangered\"},\n\t\t\t{0xff6347, \"tomato\"},\n\t\t\t{0xff69b4, \"hotpink\"},\n\t\t\t{0xff7f50, \"coral\"},\n\t\t\t{0xff8c00, \"darkorange\"},\n\t\t\t{0xffa07a, \"lightsalmon\"},\n\t\t\t{0xffa500, \"orange\"},\n\t\t\t{0xffb6c1, \"lightpink\"},\n\t\t\t{0xffc0cb, \"pink\"},\n\t\t\t{0xffd700, \"gold\"},\n\t\t\t{0xffdab9, \"peachpuff\"},\n\t\t\t{0xffdead, \"navajowhite\"},\n\t\t\t{0xffe4b5, \"moccasin\"},\n\t\t\t{0xffe4c4, \"bisque\"},\n\t\t\t{0xffe4e1, \"mistyrose\"},\n\t\t\t{0xffebcd, \"blanchedalmond\"},\n\t\t\t{0xffefd5, \"papayawhip\"},\n\t\t\t{0xfff0f5, \"lavenderblush\"},\n\t\t\t{0xfff5ee, \"seashell\"},\n\t\t\t{0xfff8dc, \"cornsilk\"},\n\t\t\t{0xfffacd, \"lemonchiffon\"},\n\t\t\t{0xfffaf0, \"floralwhite\"},\n\t\t\t{0xfffafa, \"snow\"},\n\t\t\t{0xffff00, \"yellow\"},\n\t\t\t{0xffffe0, \"lightyellow\"},\n\t\t\t{0xfffff0, \"ivory\"},\n\t\t\t{0xffffff, \"white\"}\n\t\t}};\n\t\tColorName cmppair = {_value, nullptr};\n\t\tauto it = algo::lower_bound(colornames, cmppair, [](const ColorName &c1, const ColorName &c2) {\n\t\t\treturn c1.rgb < c2.rgb;\n\t\t});\n\t\tif (it != colornames.end() && it->rgb == _value)\n\t\t\treturn it->name;\n\t}\n\treturn rgbString();\n}\n\n\nvalarray Color::getDoubleValues () const {\n\tint n = numComponents(_cspace);\n\tvalarray values(n);\n\tint i=0;\n\tfor (int shift= (n-1)*8; shift >= 0; shift-=8)\n\t\tvalues[i++] = ((_value >> shift) & 0xff)/255.0;\n\treturn values;\n}\n\n\nstatic uint32_t interpolate_cmyk2rgb (const valarray &cmyk);\n\n/** Approximates a CMYK color by an RGB triple. The component values\n * are expected to be normalized, i.e. 0 <= cmyk[i],rgb[j] <= 1.\n * @param[in] cmyk color in CMYK space\n * @param[out] rgb RGB approximation */\nvoid Color::CMYK2RGB (const valarray &cmyk, valarray &rgb) {\n#if 0\n\tdouble cc = 1-cmyk[0];\n\tdouble mc = 1-cmyk[1];\n\tdouble yc = 1-cmyk[2];\n\tdouble kc = 1-cmyk[3];\n\t// https://graphicdesign.stackexchange.com/a/137902\n\trgb[0] = 0.3137+0.5882*cc-0.3529*mc-0.1373*yc+0.47175*cc*mc+0.1173*yc*cc;\n\trgb[1] = 0.2588-0.1961*cc+0.2745*mc-0.0627*yc+0.54825*cc*mc+0.0204*yc*cc+0.1581*yc*mc;\n\trgb[2] = 0.3373-0.3255*cc-0.1569*mc+0.1647*yc+0.1173*cc*mc+0.31365*yc*cc+0.54825*yc*mc;\n\tfor (int i=0; i < 3; i++)\n\t\trgb[i] = min(1.0, max(0.0, rgb[i]*kc));\n#else\n\tuint32_t rgb32 = interpolate_cmyk2rgb(cmyk);\n\trgb[0] = (rgb32 >> 16) / 255.0;\n\trgb[1] = ((rgb32 >> 8) & 0xff) / 255.0;\n\trgb[2] = (rgb32 & 0xff) / 255.0;\n#endif\n}\n\n\n/** Converts a color given in HSB coordinates to RGB.\n * @param[in] hsb color in HSB space\n * @param[out] rgb color in RGB space */\nvoid Color::HSB2RGB (const valarray &hsb, valarray &rgb) {\n\tif (hsb[1] == 0)\n\t\trgb[0] = rgb[1] = rgb[2] = hsb[2];\n\telse {\n\t\tdouble h = hsb[0]-floor(hsb[0]);\n\t\tint i = int(6*h);\n\t\tdouble f = 6*h-i;\n\t\tdouble p = hsb[2]*(1-hsb[1]);\n\t\tdouble q = hsb[2]*(1-hsb[1]*f);\n\t\tdouble t = hsb[2]*(1-hsb[1]*(1-f));\n\t\tswitch (i) {\n\t\t\tcase 0 : rgb[0]=hsb[2]; rgb[1]=t; rgb[2]=p; break;\n\t\t\tcase 1 : rgb[0]=q; rgb[1]=hsb[2]; rgb[2]=p; break;\n\t\t\tcase 2 : rgb[0]=p; rgb[1]=hsb[2]; rgb[2]=t; break;\n\t\t\tcase 3 : rgb[0]=p; rgb[1]=q; rgb[2]=hsb[2]; break;\n\t\t\tcase 4 : rgb[0]=t; rgb[1]=p; rgb[2]=hsb[2]; break;\n\t\t\tcase 5 : rgb[0]=hsb[2]; rgb[1]=p; rgb[2]=q; break;\n\t\t\tdefault: ; // prevent compiler warning\n\t\t}\n\t}\n}\n\n\ndouble Color::getGray () const {\n\tdouble r, g, b;\n\tgetRGB(r, g, b);\n\treturn r*0.3 + g*0.59 + b*0.11; // gray value according to NTSC video standard\n}\n\n\nvoid Color::getGray (valarray &gray) const {\n\tgray.resize(1);\n\tgray[0] = getGray();\n}\n\n\nvalarray Color::getRGBDouble () const {\n\tvalarray values = getDoubleValues();\n\tvalarray rgbValues;\n\tswitch (_cspace) {\n\t\tcase ColorSpace::RGB:\n\t\t\trgbValues = std::move(values);\n\t\t\tbreak;\n\t\tcase ColorSpace::CMYK:\n\t\t\trgbValues.resize(3);\n\t\t\tCMYK2RGB(values, rgbValues);\n\t\t\tbreak;\n\t\tcase ColorSpace::GRAY:\n\t\t\trgbValues.resize(3);\n\t\t\trgbValues[0] = rgbValues[1] = rgbValues[2] = values[0];\n\t\t\tbreak;\n\t\tcase ColorSpace::LAB:\n\t\t\trgbValues.resize(3);\n\t\t\tLab2XYZ(values, rgbValues);\n\t\t\tXYZ2RGB(rgbValues, values);\n\t\t\trgbValues = std::move(values);\n\t\t\tbreak;\n\t\tdefault: ;\n\t}\n\treturn rgbValues;\n}\n\n\nuint32_t Color::getRGBUInt32 () const {\n\tswitch (_cspace) {\n\t\tcase ColorSpace::GRAY: {\n\t\t\tuint32_t gray = _value & 0xff;\n\t\t\treturn (gray << 16) | (gray << 8) | gray;\n\t\t}\n\t\tcase ColorSpace::RGB:\n\t\t\treturn _value;\n\t\tdefault:\n\t\t\tvalarray rgb = getRGBDouble();\n\t\t\treturn (double_to_byte(rgb[0]) << 16) | (double_to_byte(rgb[1]) << 8) | (double_to_byte(rgb[2]));\n\t}\n}\n\n\nvoid Color::getRGB (double &r, double &g, double &b) const {\n\tvalarray rgb = getRGBDouble();\n\tr = rgb[0];\n\tg = rgb[1];\n\tb = rgb[2];\n}\n\n\nvoid Color::getRGB (valarray &rgb) const {\n\trgb = getRGBDouble();\n}\n\n\nvoid Color::getXYZ (double &x, double &y, double &z) const {\n\tvalarray rgb(3), xyz(3);\n\tgetRGB(rgb);\n\tRGB2XYZ(std::move(rgb), xyz);\n\tx = xyz[0];\n\ty = xyz[1];\n\tz = xyz[2];\n}\n\n\nvoid Color::setXYZ (double x, double y, double z) {\n\tvalarray xyz(3), rgb(3);\n\txyz[0] = x;\n\txyz[1] = y;\n\txyz[2] = z;\n\tXYZ2RGB(xyz, rgb);\n\tsetRGB(rgb);\n\t_cspace = ColorSpace::RGB;\n}\n\n\nvoid Color::setXYZ (const valarray &xyz) {\n\tvalarray rgb(3);\n\tXYZ2RGB(xyz, rgb);\n\tsetRGB(rgb);\n\t_cspace = ColorSpace::RGB;\n}\n\n\nvoid Color::setLab (double l, double a, double b) {\n\tvalarray lab(3), xyz(3);\n\tlab[0] = l;\n\tlab[1] = a;\n\tlab[2] = b;\n\tLab2XYZ(lab, xyz);\n\tsetXYZ(xyz);\n}\n\n\nvoid Color::setLab (const valarray &lab) {\n\tvalarray xyz(3);\n\tLab2XYZ(lab, xyz);\n\tsetXYZ(xyz);\n}\n\n\n/** Get the color in CIELAB color space using the sRGB working space and reference white D65. */\nvoid Color::getLab (double &l, double &a, double &b) const {\n\tvalarray rgb(3), lab(3);\n\tgetRGB(rgb);\n\tRGB2Lab(rgb, lab);\n\tl = lab[0];\n\ta = lab[1];\n\tb = lab[2];\n}\n\n\nvoid Color::getLab (std::valarray &lab) const {\n\tlab.resize(3);\n\tvalarray rgb(3);\n\tgetRGB(rgb);\n\tRGB2Lab(rgb, lab);\n}\n\n\ninline double cube (double x) {return x*x*x;}\n\nvoid Color::Lab2XYZ (const valarray &lab, valarray &xyz) {\n\txyz.resize(3);\n\tdouble wx=0.95047, wy=1.00, wz=1.08883; // reference white D65\n\tdouble eps = 0.008856;\n\tdouble kappa = 903.3;\n\tdouble fy = (lab[0]+16)/116;\n\tdouble fx = lab[1]/500 + fy;\n\tdouble fz = fy - lab[2]/200;\n\tdouble xr = (cube(fx) > eps ? cube(fx) : (116*fx-16)/kappa);\n\tdouble yr = (lab[0] > kappa*eps ? cube((lab[0]+16)/116) : lab[0]/kappa);\n\tdouble zr = (cube(fz) > eps ? cube(fz) : (116*fz-16)/kappa);\n\txyz[0] = xr*wx;\n\txyz[1] = yr*wy;\n\txyz[2] = zr*wz;\n}\n\n\nvoid Color::XYZ2RGB (const valarray &xyz, valarray &rgb) {\n\trgb.resize(3);\n\trgb[0] = 3.2404542*xyz[0] - 1.5371385*xyz[1] - 0.4985314*xyz[2];\n\trgb[1] = -0.9692660*xyz[0] + 1.8760108*xyz[1] + 0.0415560*xyz[2];\n\trgb[2] = 0.0556434*xyz[0] - 0.2040259*xyz[1] + 1.0572252*xyz[2];\n\tfor (int i=0; i < 3; i++)\n\t\trgb[i] = (rgb[i] <= 0.0031308 ? 12.92*rgb[i] : 1.055*pow(rgb[i], 1/2.4)-0.055);\n}\n\n\nvoid Color::RGB2XYZ (valarray rgb, valarray &xyz) {\n\txyz.resize(3);\n\tfor (int i=0; i < 3; i++)\n\t\trgb[i] = (rgb[i] <= 0.04045 ? rgb[i]/12.92 : pow((rgb[i]+0.055)/1.055, 2.4));\n\txyz[0] = 0.4124564*rgb[0] + 0.3575761*rgb[1] + 0.1804375*rgb[2];\n\txyz[1] = 0.2126729*rgb[0] + 0.7151522*rgb[1] + 0.0721750*rgb[2];\n\txyz[2] = 0.0193339*rgb[0] + 0.1191920*rgb[1] + 0.9503041*rgb[2];\n}\n\n\nvoid Color::RGB2Lab (const valarray &rgb, valarray &lab) {\n\tdouble wx=0.95047, wy=1.00, wz=1.08883; // reference white D65\n\tdouble eps = 0.008856;\n\tdouble kappa = 903.3;\n\tvalarray xyz(3);\n\tRGB2XYZ(rgb, xyz);\n\txyz[0] /= wx;\n\txyz[1] /= wy;\n\txyz[2] /= wz;\n\tdouble fx = (xyz[0] > eps ? pow(xyz[0], 1.0/3) : (kappa*xyz[0]+16)/116);\n\tdouble fy = (xyz[1] > eps ? pow(xyz[1], 1.0/3) : (kappa*xyz[1]+16)/116);\n\tdouble fz = (xyz[2] > eps ? pow(xyz[2], 1.0/3) : (kappa*xyz[2]+16)/116);\n\tlab[0] = 116*fy-16;\n\tlab[1] = 500*(fx-fy);\n\tlab[2] = 200*(fy-fz);\n}\n\n\n#if 0\n/** Returns the Delta E difference (CIE 2000) between this and another color. */\ndouble Color::deltaE (const Color &c) const {\n\tdouble l1, a1, b1;\n\tdouble l2, a2, b2;\n\tgetLab(l1, a1, b1);\n\tc.getLab(l2, a2, b2);\n\tconst double deltaL = l2-l1;\n\tconst double lBar = (l1+l2)/2;\n\tconst double c1 = hypot(a1, b1);\n\tconst double c2 = hypot(a2, b2);\n\tconst double cBar = (c1+c2)/2.0;\n\tconst double g = (1.0-sqrt(pow(cBar, 7.0)/(pow(cBar, 7.0)+6103515625.0)))/2.0;\n\tconst double aa1 = a1*(1.0+g);\n\tconst double aa2 = a2*(1.0+g);\n\tconst double cc1 = hypot(aa1, b1);\n\tconst double cc2 = hypot(aa2, b2);\n\tconst double ccBar = (cc1+cc2)/2.0;\n\tconst double deltaCC = cc2-cc1;\n\tdouble hh1 = atan2(b1, aa1);\n\tif (hh1 < 0) hh1 += deg2rad(360);\n\tdouble hh2 = atan2(b2, aa2);\n\tif (hh2 < 0) hh2 += deg2rad(360);\n\tconst double hhBar = (std::abs(hh1-hh2) > deg2rad(180) ? (hh1+hh2+deg2rad(360)) : (hh1+hh2))/2.0;\n\tconst double t = 1.0\n\t\t- 0.17*cos(hhBar-deg2rad(30.0))\n\t\t+ 0.24*cos(2.0*hhBar)\n\t\t+ 0.32*cos(3.0*hhBar+deg2rad(6.0))\n\t\t- 0.20*cos(4.0*hhBar-deg2rad(63.0));\n\tdouble deltaHH = hh2-hh1;\n\tif (deltaHH < deg2rad(-180))\n\t\tdeltaHH += deg2rad(360);\n\telse if (deltaHH > deg2rad(180))\n\t\tdeltaHH -= deg2rad(360);\n\tconst double deltaHHH = 2.0*sqrt(cc1*cc2)*sin(deltaHH/2.0);\n\tconst double sl = 1.0 + 0.015*sqr(lBar-50.0)/sqrt(20.0+sqr(lBar-50.0));\n\tconst double sc = 1.0 + 0.045*ccBar;\n\tconst double sh = 1.0 + 0.015*ccBar*t;\n\tconst double deltaTheta = deg2rad(30)*exp(-sqr((hhBar-deg2rad(275))/deg2rad(25)));\n\tconst double rc = 2.0*sqrt(pow(ccBar, 7)/(pow(ccBar, 7)+6103515625.0));\n\tconst double rt = -rc*sin(2.0*deltaTheta);\n\tconst double deltaE = sqrt(sqr(deltaL/sl) + sqr(deltaCC/sc) + sqr(deltaHHH/sh) + rt*deltaCC/sc*deltaHHH/sh);\n\treturn deltaE;\n}\n#endif\n\n\nint Color::numComponents (ColorSpace colorSpace) {\n\tswitch (colorSpace) {\n\t\tcase ColorSpace::GRAY: return 1;\n\t\tcase ColorSpace::LAB:\n\t\tcase ColorSpace::RGB: return 3;\n\t\tcase ColorSpace::CMYK: return 4;\n\t\tdefault: ;\n\t}\n\treturn 0;\n}\n\n\nstruct Cmyk2RgbTable {\n\tusing IntVec = vector;\n\tusing DoubleVec = vector;\n\n\tstatic constexpr const int GRIDSIZE = 5; // number of grid points per CMYK component\n\tstatic array rgbvalues;\n\tstatic const array dimfactors;\n\n\tstatic double interpolate (const IntVec &gi0, const IntVec &gi1, const DoubleVec &t, int icmyk, int irgb, int idx);\n};\n\n// For grid indices ci, mi, yi, ki, the corresponding table entry is located\n// at index ci + mi*GRIDSIZE + yi*GRIDSIZE^2 + ki*GRIDSIZE^3.\nconst array Cmyk2RgbTable::dimfactors {{\n\t1, GRIDSIZE, GRIDSIZE*GRIDSIZE, GRIDSIZE*GRIDSIZE*GRIDSIZE\n}};\n\n\n/** Compute RGB from CMYK by multivariate linear interpolation of sampled color values.\n * @param[in] cmyk CMYK color components (all values between 0 and 1)\n * @return 24-bit RGB color value (0x00RRGGBB) */\nstatic uint32_t interpolate_cmyk2rgb (const valarray &cmyk) {\n\tvector gi0(4), gi1(4); // upper and lower grid indices enclosing the CMYK components\n\tvector t(4); // fractional parts of the grid indices where the CMYK components are located\n\tfor (int i=0; i < 4; i++) {\n\t\tdouble gridpos = math::clip(cmyk[i], 0, 1)*(Cmyk2RgbTable::GRIDSIZE-1);\n\t\tdouble gi;\n\t\tt[i] = modf(gridpos, &gi); // distance of i-th CMYK component to nearest lower grid index (in [0,1))\n\t\tgi0[i] = int(gi); // index of nearest grid value <= i-th CMYK component\n\t\tgi1[i] = ceil(gridpos); // index of nearest grid value >= i-th CMYK component\n\t}\n\tuint32_t rgb=0;\n\tfor (int i=0; i < 3; i++) {\n\t\tdouble rgb_component = Cmyk2RgbTable::interpolate(gi0, gi1, t, 3, i, 0);\n\t\trgb_component = round(math::clip(rgb_component, 0, 255));\n\t\trgb = (rgb << 8) | int(rgb_component);\n\t}\n\treturn rgb;\n}\n\n\ninline uint32_t get_byte (uint32_t value, int n) {\n\treturn (value >> n*8) & 0xff;\n}\n\n\n/** Computes an RGB color component for a CMYK color by multi-linear interpolation\n * using a 4-dimensional grid of pre-computed color values.\n * @param[in] gi0 indices of nearest grid values <= corresponding CMYK components\n * @param[in] gi1 indices of nearest grid values >= corresponding CMYK components\n * @param[in] t fractional parts of the grid indices where the components of the CMYK color are located\n * @param[in] icmyk index of CMYK component to process (0=C, 1=M, 2=Y, 3=K)\n * @param[in] irgb index of RGB component to interpolate (0=R, 1=G, 2=B)\n * @param[in] idx index of RGB value in lookup table (computed during recursion, final value reached when icmyk==0)\n * @return The interpolated RGB color component in the range from 0 to 255. */\ndouble Cmyk2RgbTable::interpolate (const IntVec &gi0, const IntVec &gi1, const DoubleVec &t, int icmyk, int irgb, int idx) {\n\tint idx0 = gi0[icmyk]*dimfactors[icmyk]+idx;\n\tint idx1 = gi1[icmyk]*dimfactors[icmyk]+idx;\n\tdouble a, b;\n\tif (icmyk == 0) {\n\t\ta = get_byte(rgbvalues[idx0], 2-irgb);\n\t\tb = get_byte(rgbvalues[idx1], 2-irgb);\n\t}\n\telse {\n\t\ta = interpolate(gi0, gi1, t, icmyk-1, irgb, idx0);\n\t\tb = interpolate(gi0, gi1, t, icmyk-1, irgb, idx1);\n\t}\n\treturn a + (b-a)*t[icmyk];\n}\n\n\n/** RGB values for a 5x5x5x5 grid of CMYK values in [0,1]^4, i.e. the grid values of each dimension\n * are 0, 0.25, 0.5, 0.75, and 1. For grid coordinates (c,m,y,k), the corresponding RGB values are\n * located at index ci + 5*mi + 5*5*yi + 5*5*5*ki where ci=4*c, mi=4*m, yi=4*y, ki=4*k.\n * The RGB values were computed with Little CMS utility 'transicc' using options -t1 and -b\n * applied to Ghostscript's ICC profiles default_cmyk.icc and default_rgb.icc. */\narray Cmyk2RgbTable::rgbvalues {{\n\t0xffffff,0xb9e5fa,0x6dcff6,0x00bdf2,0x00aeef,0xf9cbdf,0xbbb8dc,0x7da7d9,0x1c9ad6,0x008fd5,0xf49ac1,0xbc8cbf,0x8781bd,0x4978bc,0x0072bc,0xf067a6,\n\t0xbd60a5,0x8e5ba5,0x5b57a6,0x0054a6,0xec008c,0xbd1a8d,0x92278f,0x662c91,0x2e3092,0xfffbcc,0xc0e2ca,0x7accc8,0x00bac6,0x00abc5,0xfbc8b4,0xc1b6b3,\n\t0x86a6b2,0x3799b1,0x008eb0,0xf5989d,0xc08c9c,0x8d819c,0x51789c,0x00719c,0xf16687,0xc06188,0x915c89,0x5f588a,0x03558b,0xed0972,0xbf1e74,0x942977,\n\t0x682f79,0x32327b,0xfff799,0xc4df9b,0x82ca9c,0x07b89d,0x00a99d,0xfdc689,0xc3b48b,0x8aa48c,0x43978d,0x008c8d,0xf69679,0xc28b7b,0x8f807d,0x56777e,\n\t0x00707e,0xf1666a,0xc1616c,0x925c6e,0x625870,0x145571,0xed145a,0xbf235e,0x942c61,0x693163,0x343465,0xfff45f,0xc8dd69,0x88c86f,0x2bb673,0x00a775,\n\t0xfec35a,0xc6b261,0x8ea366,0x4b9669,0x008b6b,0xf79552,0xc48a57,0x927f5c,0x5b775f,0x006f61,0xf26649,0xc2614e,0x945c53,0x645855,0x1c5557,0xed1941,\n\t0xc02646,0x952e4a,0x6a324d,0x35354e,0xfff200,0xcbdb2a,0x8dc63f,0x39b54a,0x00a650,0xffc20d,0xc8b12f,0x91a23d,0x519546,0x008a4b,0xf7941d,0xc5892f,\n\t0x947f3a,0x5e7641,0x006f45,0xf26522,0xc3602e,0x955c37,0x66583c,0x22543f,0xed1c24,0xc1272d,0x962e34,0x6b3337,0x363639,0xc7c8ca,0x92b6c7,0x57a5c4,\n\t0x0097c1,0x008bbf,0xc3a0b2,0x9593b0,0x6486ae,0x177bac,0x0072aa,0xc0799a,0x967099,0x6c6798,0x3a6097,0x005a96,0xbd4f84,0x964b84,0x714784,0x484385,\n\t0x004185,0xba006f,0x960470,0x741372,0x511b74,0x232176,0xcac6a3,0x97b3a2,0x60a3a0,0x00959f,0x008a9e,0xc59f90,0x98918f,0x6a858e,0x2a7a8e,0x00728d,\n\t0xc1787d,0x986f7d,0x70677d,0x40607d,0x00597d,0xbd506c,0x984b6c,0x73486d,0x4b446e,0x00416f,0xbb005a,0x970e5c,0x75185e,0x531e60,0x262261,0xcbc37b,\n\t0x9ab07c,0x65a07d,0x00937d,0x00887e,0xc69c6d,0x9a8f6f,0x6d836f,0x337970,0x007071,0xc17760,0x996e61,0x716663,0x435f63,0x005964,0xbe4f53,0x984b55,\n\t0x744857,0x4c4458,0x0a4159,0xba0546,0x971549,0x751c4b,0x52214d,0x27244f,0xccc04d,0x9cae53,0x6a9f58,0x1c915c,0x00875e,0xc69a47,0x9b8e4c,0x6f824f,\n\t0x397853,0x006f55,0xc1753f,0x9a6d43,0x736547,0x465e4a,0x00584c,0xbe4f38,0x994b3b,0x74483f,0x4e4442,0x124144,0xba0e31,0x971934,0x761f37,0x53233a,\n\t0x28253c,0xccbe00,0x9dad20,0x6d9d30,0x28903a,0x008641,0xc7990b,0x9c8c21,0x71812d,0x3d7735,0x006f3b,0xc27514,0x9b6c21,0x74652a,0x485e30,0x005834,\n\t0xbe4f17,0x994b20,0x754827,0x4f442c,0x17412f,0xba1319,0x981b1e,0x762123,0x542427,0x2a2529,0x939598,0x6c8896,0x3e7c94,0x007192,0x006991,0x917786,\n\t0x6f6d84,0x496483,0x055b82,0x005581,0x8f5973,0x705273,0x504b72,0x274572,0x004071,0x8e3762,0x713363,0x543063,0x332d63,0x002b64,0x8c0052,0x710053,\n\t0x570054,0x3b0256,0x140858,0x95937a,0x6f8679,0x447a78,0x007078,0x006877,0x92766b,0x716c6b,0x4c636a,0x175b6a,0x00546a,0x90585d,0x71515d,0x524b5d,\n\t0x2b455d,0x00405d,0x8e384f,0x713450,0x553151,0x352e51,0x002c52,0x8c0041,0x710043,0x570144,0x3b0846,0x160d47,0x96915b,0x70845c,0x48785d,0x006e5e,\n\t0x00665e,0x937450,0x716a51,0x4e6252,0x1e5a53,0x005454,0x905745,0x715047,0x524b48,0x2d4549,0x00404a,0x8d383a,0x71353c,0x55323e,0x362f40,0x002c41,\n\t0x8b0030,0x700032,0x560835,0x3b0d37,0x161038,0x968f37,0x72823c,0x4a7740,0x006d43,0x006545,0x937231,0x726935,0x506039,0x23593b,0x00533e,0x90562a,\n\t0x71502e,0x534a31,0x2f4534,0x004036,0x8d3823,0x713527,0x55322a,0x362f2d,0x002d2f,0x8b001d,0x700520,0x560c23,0x3b1026,0x161228,0x968d00,0x728012,\n\t0x4c7520,0x0d6c28,0x00652e,0x937100,0x726812,0x51601c,0x265823,0x005228,0x905500,0x714f0f,0x534919,0x31441e,0x004022,0x8d3802,0x71350d,0x553215,\n\t0x37301a,0x012d1d,0x8b0204,0x70090a,0x560f10,0x3b1215,0x171417,0x636466,0x465a65,0x225264,0x004b63,0x004563,0x624e59,0x494758,0x2c4058,0x003a57,\n\t0x003557,0x61374c,0x4a324c,0x322d4c,0x0f284c,0x00244c,0x601b3f,0x4b1740,0x361441,0x1c1041,0x000d42,0x600032,0x4c0034,0x380035,0x220037,0x000038,\n\t0x636250,0x475950,0x265150,0x004a50,0x004550,0x624d45,0x494646,0x2e4046,0x003a46,0x003546,0x61363a,0x4a323b,0x332d3c,0x12293c,0x00253c,0x601c30,\n\t0x4b1931,0x361632,0x1c1333,0x001134,0x5f0024,0x4b0027,0x380029,0x22002a,0x00002b,0x64603a,0x48573b,0x28503c,0x00493d,0x00443d,0x624b31,0x4a4532,\n\t0x2f3f33,0x003a34,0x003535,0x603628,0x4a312a,0x332d2b,0x14292c,0x00252d,0x5f1d1f,0x4b1a21,0x351823,0x1c1525,0x001226,0x5e0015,0x4b0018,0x37001b,\n\t0x21001d,0x00001e,0x645f1e,0x495623,0x2a4f26,0x004928,0x00442a,0x624a18,0x4a441c,0x303e1f,0x043922,0x003524,0x603510,0x4a3115,0x332d18,0x15291b,\n\t0x00261d,0x5f1d07,0x4a1b0d,0x351911,0x1c1714,0x001416,0x5e0000,0x4a0004,0x370008,0x21000c,0x00000e,0x635e00,0x495500,0x2b4e08,0x004811,0x004416,\n\t0x624a00,0x4a4300,0x303e03,0x07390b,0x003510,0x603500,0x4a3100,0x332d00,0x162904,0x002608,0x5f1e00,0x4a1b00,0x351900,0x1c1700,0x001502,0x5e0000,\n\t0x4a0000,0x360000,0x210000,0x000000,0x231f20,0x0c1a21,0x001522,0x001123,0x000e23,0x230d15,0x100617,0x000019,0x00001a,0x00001b,0x230008,0x13000d,\n\t0x00000f,0x000011,0x000012,0x230000,0x150001,0x030005,0x000008,0x00000a,0x230000,0x160000,0x060000,0x000000,0x000001,0x201d12,0x081914,0x001515,\n\t0x001216,0x001017,0x210c04,0x0e0608,0x00020a,0x00000c,0x00000d,0x220000,0x120000,0x000000,0x000002,0x000003,0x230000,0x140000,0x010000,0x000000,\n\t0x000000,0x230000,0x150000,0x040000,0x000000,0x000000,0x1e1c00,0x061802,0x001504,0x001306,0x001107,0x200c00,0x0d0700,0x000300,0x000100,0x000000,\n\t0x210000,0x110000,0x000000,0x000000,0x000000,0x220000,0x130000,0x000000,0x000000,0x000000,0x230000,0x150000,0x030000,0x000000,0x000000,0x1c1b00,\n\t0x041800,0x001500,0x001300,0x001200,0x1f0b00,0x0b0700,0x000400,0x000200,0x000100,0x210000,0x100000,0x000000,0x000000,0x000000,0x220000,0x120000,\n\t0x000000,0x000000,0x000000,0x230000,0x140000,0x020000,0x000000,0x000000,0x1b1a00,0x021700,0x001500,0x001400,0x001200,0x1e0b00,0x0a0700,0x000500,\n\t0x000300,0x000200,0x200000,0x0f0000,0x000000,0x000000,0x000000,0x210000,0x120000,0x000000,0x000000,0x000000,0x220000,0x140000,0x010000,0x000000,\n\t0x000000\n}};\n" }, { "path": "src/Color.hpp", "content": "/*************************************************************************\n** Color.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef COLOR_HPP\n#define COLOR_HPP\n\n#include \n#include \n#include \n#include \n#include \"VectorIterator.hpp\"\n\n#ifdef TRANSPARENT\n#undef TRANSPARENT\n#endif\n\nclass Color {\n\tpublic:\n\t\tstatic bool SUPPRESS_COLOR_NAMES;\n\t\tstatic const Color BLACK;\n\t\tstatic const Color WHITE;\n\n\t\tenum class ColorSpace {GRAY, RGB, CMYK, LAB, TRANSPARENT};\n\n\tpublic:\n\t\tColor () noexcept =default;\n\t\texplicit Color (uint32_t rgb) noexcept : _value(rgb) {}\n\t\tColor (uint32_t value, ColorSpace cs) : _value(value), _cspace(cs) {}\n\t\tColor (uint8_t r, uint8_t g, uint8_t b) noexcept {setRGB(r,g,b);}\n\t\tColor (double r, double g, double b) noexcept {setRGB(r,g,b);}\n\t\texplicit Color (const std::valarray &rgb) noexcept {setRGB(rgb);}\n\t\texplicit Color (const std::valarray &rgb, ColorSpace cs) noexcept;\n\t\texplicit Color (const std::string &colorstr);\n\t\texplicit operator uint32_t () const {return _value;}\n\t\tbool operator == (const Color &c) const {return _value == c._value;}\n\t\tbool operator != (const Color &c) const {return _value != c._value;}\n\t\tbool operator < (const Color &c) const {return _value < c._value;}\n\t\tColor operator *= (double c);\n\t\tColor operator * (double c) const {return Color(*this) *= c;}\n\t\tbool isTransparent () const {return _cspace == ColorSpace::TRANSPARENT;}\n\t\tvoid setRGB (uint8_t r, uint8_t g, uint8_t b);\n\t\tvoid setRGB (double r, double g, double b);\n\t\tvoid setRGB (const std::valarray &rgb) {setRGB(rgb[0], rgb[1], rgb[2]);}\n\t\tbool setRGBHexString (std::string hexString);\n\t\tbool setPSName (std::string name, bool case_sensitive=true);\n\t\tvoid setGray (uint8_t g) {setRGB(g,g,g);}\n\t\tvoid setGray (double g) {setRGB(g,g,g);}\n\t\tvoid setGray (const std::valarray &gray) {setRGB(gray[0], gray[0], gray[0]);}\n\t\tvoid setHSB (double h, double s, double b);\n\t\tvoid setCMYK (uint8_t c, uint8_t m, uint8_t y, uint8_t k);\n\t\tvoid setCMYK (double c, double m, double y, double k);\n\t\tvoid setCMYK (const std::valarray &cmyk);\n\t\tvoid setXYZ (double x, double y, double z);\n\t\tvoid setXYZ (const std::valarray &xyz);\n\t\tvoid setLab (double l, double a, double b);\n\t\tvoid setLab (const std::valarray &lab);\n\t\tvoid set (ColorSpace colorSpace, VectorIterator &it);\n\t\tstd::valarray getDoubleValues () const;\n\t\tdouble getGray () const;\n\t\tvoid getGray (std::valarray &gray) const;\n\t\tvoid getRGB (double &r, double &g, double &b) const;\n\t\tvoid getRGB (std::valarray &rgb) const;\n\t\tvoid getXYZ (double &x, double &y, double &z) const;\n\t\tvoid getLab (double &l, double &a, double &b) const;\n\t\tvoid getLab (std::valarray &lab) const;\n\t\tdouble deltaE (const Color &c) const;\n\t\tstd::string rgbString () const;\n\t\tstd::string svgColorString (bool rgbonly) const;\n\t\tstd::string svgColorString () const {return svgColorString(SUPPRESS_COLOR_NAMES);}\n\t\tstatic void CMYK2RGB (const std::valarray &cmyk, std::valarray &rgb);\n\t\tstatic void HSB2RGB (const std::valarray &hsb, std::valarray &rgb);\n\t\tstatic void RGB2XYZ (std::valarray rgb, std::valarray &xyz);\n\t\tstatic void XYZ2RGB (const std::valarray &xyz, std::valarray &rgb);\n\t\tstatic void RGB2Lab (const std::valarray &rgb, std::valarray &lab);\n\t\tstatic void Lab2XYZ (const std::valarray &lab, std::valarray &xyz);\n\t\tstatic int numComponents (ColorSpace colorSpace);\n\n\tprotected:\n\t\tuint32_t getRGBUInt32 () const;\n\t\tstd::valarray getRGBDouble () const;\n\n\tprivate:\n\t\tuint32_t _value=0;\n\t\tColorSpace _cspace=ColorSpace::RGB;\n};\n\n#endif\n" }, { "path": "src/ColorSpecialHandler.cpp", "content": "/*************************************************************************\n** ColorSpecialHandler.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \n#include \"algorithm.hpp\"\n#include \"ColorSpecialHandler.hpp\"\n#include \"SpecialActions.hpp\"\n\nusing namespace std;\n\n\nstatic double read_double (istream &is) {\n\tis.clear();\n\tdouble v;\n\tis >> v;\n\tif (is.fail())\n\t\tthrow SpecialException(\"number expected\");\n\treturn v;\n}\n\n\n/** Reads multiple double values from a given stream. The number of\n * values read is determined by the size of the result vector.\n * @param[in] is stream to be read from\n * @param[out] vec the resulting values */\nstatic void read_doubles (istream &is, vector &vec) {\n\talgo::generate(vec, [&is]() {\n\t\treturn read_double(is);\n\t});\n}\n\n\n/** Reads a color statement from an input stream and converts it to a color object.\n * A color statement has the following syntax:\n * _color model_ _component values_\n * Currently, the following color models are supported: rgb, cmyk, hsb and gray.\n * Examples: rgb 1 0.5 0, gray 0.5\n * @param[in] model the color model\n * @param[in] is stream to be read from\n * @return resulting Color object */\nColor ColorSpecialHandler::readColor (const string &model, istream &is) {\n\tColor color;\n\tif (model == \"rgb\") {\n\t\tvector rgb(3);\n\t\tread_doubles(is, rgb);\n\t\tcolor.setRGB(rgb[0], rgb[1], rgb[2]);\n\t}\n\telse if (model == \"cmyk\") {\n\t\tvector cmyk(4);\n\t\tread_doubles(is, cmyk);\n\t\tcolor.setCMYK(cmyk[0], cmyk[1], cmyk[2], cmyk[3]);\n\t}\n\telse if (model == \"hsb\") {\n\t\tvector hsb(3);\n\t\tread_doubles(is, hsb);\n\t\tcolor.setHSB(hsb[0], hsb[1], hsb[2]);\n\t}\n\telse if (model == \"gray\")\n\t\tcolor.setGray(read_double(is));\n\telse if (!color.setPSName(model, true))\n\t\tthrow SpecialException(\"unknown color statement\");\n\treturn color;\n}\n\n\n/** Reads the color model (rgb, cmyk, hsb, or gray) and the corresponding color components\n * from a given input stream.\n * @param[in] is stream to be read from\n * @return resulting Color object */\nColor ColorSpecialHandler::readColor (istream &is) {\n\tstring model;\n\tis >> model;\n\treturn readColor(model, is);\n}\n\n\nbool ColorSpecialHandler::process (const string&, istream &is, SpecialActions &actions) {\n\tchar colortype=0;\n\tauto pos = is.tellg();\n\tstring cmd;\n\tis >> cmd;\n\tif (cmd == \"push\") // color push [fill|stroke] \n\t\tcolortype = processPush(is);\n\telse if (cmd == \"pop\") {\n\t\tif (!_colorStack.empty()) // color pop\n\t\t\t_colorStack.pop_back();\n\t}\n\telse if (cmd == \"set\") // color set [fill|stroke] \n\t\tcolortype = processSet(is);\n\telse { // color [fill|stroke] \n\t\twhile (!_colorStack.empty())\n\t\t\t_colorStack.pop_back();\n\t\tis.seekg(pos);\n\t\tcolortype = processPush(is);\n\t}\n\tif (_colorStack.empty()) {\n\t\tif (colortype == 0 || colortype == 'f')\n\t\t\tactions.setFillColor(_defaultFillColor);\n\t\tif (colortype == 0 || colortype == 's')\n\t\t\tactions.setStrokeColor(_defaultStrokeColor);\n\t}\n\telse {\n\t\tif (colortype == 0 || colortype == 'f')\n\t\t\tactions.setFillColor(_colorStack.back().fillColor);\n\t\tif (colortype == 0 || colortype == 's')\n\t\t\tactions.setStrokeColor(_colorStack.back().strokeColor);\n\t}\n\treturn true;\n}\n\n\n/** Parses [fill|stroke] .\n * @param[in] is stream to read from\n * @param[out] type specified type color type ('f'=fill, 's'=stroke, 0=none specified)\n * @return color object representing the specified color */\nstatic Color read_color_and_type (istream &is, char &type) {\n\tstring token;\n\tstring model;\n\tis >> token;\n\tif (token == \"fill\" || token == \"stroke\") {\n\t\tis >> model;\n\t\ttype = token[0];\n\t}\n\telse {\n\t\tmodel = std::move(token);\n\t\ttype = '\\0';\n\t}\n\treturn ColorSpecialHandler::readColor(model, is);\n}\n\n\n/** Handles push [fill|stroke] which pushes a new color pair\n * onto the stack. If 'fill' or 'stroke' is specified, only that color value is set.\n * The other one is copied from the current corresponding value.\n * @return color type specified in the special command ('f'=fill, 's'=stroke, 0=none specified) */\nchar ColorSpecialHandler::processPush (istream &is) {\n\t_colorStack.emplace_back(ColorPair{});\n\treturn processSet(is);\n}\n\n\n/** Handles set [fill|stroke] which changes the current\n * color pair without pushing new ones. If the stack is empty, the default\n * color values (usually black) are changed.\n * @return color type specified in the special command ('f'=fill, 's'=stroke, 0=none specified) */\nchar ColorSpecialHandler::processSet (istream &is) {\n\tchar type;\n\tColor color = read_color_and_type(is, type);\n\tColor &fillColor = _colorStack.empty() ? _defaultFillColor : _colorStack.back().fillColor;\n\tColor &strokeColor = _colorStack.empty() ? _defaultStrokeColor : _colorStack.back().strokeColor;\n\tif (type == 0 || type == 'f')\n\t\tfillColor = color;\n\tif (type == 0 || type == 's')\n\t\tstrokeColor = color;\n\treturn type;\n}\n\n\nvector ColorSpecialHandler::prefixes () const {\n\tvector pfx {\"color\"};\n\treturn pfx;\n}\n\n" }, { "path": "src/ColorSpecialHandler.hpp", "content": "/*************************************************************************\n** ColorSpecialHandler.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef COLORSPECIALHANDLER_HPP\n#define COLORSPECIALHANDLER_HPP\n\n#include \n#include \n#include \n#include \"Color.hpp\"\n#include \"SpecialHandler.hpp\"\n\n\nclass ColorSpecialHandler : public SpecialHandler {\n\tprivate:\n\t\tstruct ColorPair {\n\t\t\tColor fillColor;\n\t\t\tColor strokeColor;\n\t\t};\n\n\tpublic:\n\t\tbool process (const std::string &prefix, std::istream &is, SpecialActions &actions) override;\n\t\tstatic Color readColor (std::istream &is);\n\t\tstatic Color readColor (const std::string &model, std::istream &is);\n\t\tconst char* name () const override {return handlerName();}\n\t\tstatic const char* handlerName () {return \"color\";}\n\t\tconst char* info () const override {return \"complete support of color specials\";}\n\t\tstd::vector prefixes () const override;\n\t\tsize_t stackSize () const {return _colorStack.size();}\n\n\tprotected:\n\t\tchar processPush (std::istream &is);\n\t\tchar processSet (std::istream &is);\n\n\tprivate:\n\t\tColor _defaultFillColor = Color::BLACK;\n\t\tColor _defaultStrokeColor = Color::BLACK;\n\t\tstd::vector _colorStack;\n};\n\n#endif\n" }, { "path": "src/DLLoader.cpp", "content": "/*************************************************************************\n** DLLoader.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \"DLLoader.hpp\"\n\nusing namespace std;\n\n\n/** Creates a new DLLoader object and tries to load the given dynamic/shared library.\n * @param[in] dlname name of library to load */\nDLLoader::DLLoader (const string &dlname) : _handle(nullptr) {\n\tloadLibrary(dlname);\n}\n\n\n/** Releases the currently assigned dynamic/shared library and loads another one.\n * @param[in] dlname name of library to load */\nbool DLLoader::loadLibrary (const string &dlname) {\n\tcloseLibrary();\n\tif (!dlname.empty()) {\n#ifdef _WIN32\n\t\t_handle = LoadLibrary(dlname.c_str());\n#else\n\t\t_handle = dlopen(dlname.c_str(), RTLD_LAZY);\n#endif\n\t}\n\treturn _handle != nullptr;\n}\n\n\n/** Releases the library currently assigned to the DLLoader object. */\nvoid DLLoader::closeLibrary () {\n\tif (_handle) {\n#ifdef _WIN32\n\t\tFreeLibrary(_handle);\n#else\n\t\tdlclose(_handle);\n#endif\n\t\t_handle = nullptr;\n\t}\n}\n\n" }, { "path": "src/DLLoader.hpp", "content": "/*************************************************************************\n** DLLoader.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef DLLOADER_HPP\n#define DLLOADER_HPP\n\n#include \n\n#ifdef _WIN32\n\t#include \"windows.hpp\"\n#else\n\t#include \n#endif\n\n\nclass DLLoader {\n\tpublic:\n\t\tDLLoader () =delete;\n\t\texplicit DLLoader (const std::string &dlname);\n\t\tDLLoader (DLLoader &&loader) =default;\n\t\tvirtual ~DLLoader () {closeLibrary();}\n\t\tbool loaded () const {return _handle != nullptr;}\n\t\tbool loadLibrary (const std::string &dlname);\n\n\tprotected:\n\t\ttemplate T loadSymbol (const char *name) const;\n\t\tvoid closeLibrary ();\n\n\tprivate:\n#ifdef _WIN32\n\t\tHINSTANCE _handle;\n#else\n\t\tvoid *_handle;\n#endif\n};\n\n\n/** Loads a function or variable from the dynamic/shared library.\n * @param[in] name name of function/variable to load\n * @return pointer to loaded symbol, or 0 if the symbol could not be loaded */\ntemplate \nT DLLoader::loadSymbol (const char *name) const {\n\tif (_handle) {\n#ifdef _WIN32\n\t\treturn reinterpret_cast(GetProcAddress(_handle, name));\n#else\n\t\treturn reinterpret_cast(dlsym(_handle, name));\n#endif\n\t}\n\treturn nullptr;\n}\n\n#define LOAD_SYMBOL(sym) loadSymbol(#sym)\n\n#endif\n" }, { "path": "src/DVIActions.hpp", "content": "/*************************************************************************\n** DVIActions.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef DVIACTIONS_HPP\n#define DVIACTIONS_HPP\n\n#include \n#include \n#include \n\nclass BoundingBox;\nclass Font;\n\nstruct DVIActions {\n\tvirtual ~DVIActions () =default;\n\tvirtual void reset () {}\n\tvirtual void setChar (double x, double y, unsigned c, bool vertical, const Font &f) {}\n\tvirtual void setRule (double x, double y, double height, double width) {}\n\tvirtual void setTextOrientation (bool vertical) {}\n\tvirtual void moveToX (double x, bool forceSVGMove) {}\n\tvirtual void moveToY (double y, bool forceSVGMove) {}\n\tvirtual void setFont (int num, const Font &font) {}\n\tvirtual void special (const std::string &s, double dvi2bp, bool preprocessing=false) {}\n\tvirtual void beginPage (unsigned pageno, const std::vector &c) {}\n\tvirtual void endPage (unsigned pageno) {}\n\tvirtual BoundingBox& bbox () =0;\n\tvirtual void progress (size_t current, size_t total, const char *id=nullptr) {}\n};\n\n#endif\n" }, { "path": "src/DVIReader.cpp", "content": "/*************************************************************************\n** DVIReader.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \n#include \"algorithm.hpp\"\n#include \"Color.hpp\"\n#include \"DVIActions.hpp\"\n#include \"DVIReader.hpp\"\n#include \"Font.hpp\"\n#include \"FontManager.hpp\"\n#include \"HashFunction.hpp\"\n#include \"utility.hpp\"\n\nusing namespace std;\n\nDVIReader::DVIReader (istream &is) : BasicDVIReader(is)\n{\n\texecutePreamble();\n\t_bopOffsets = collectBopOffsets();\n\t// read data from postamble but don't process font definitions\n\tgoToPostamble();\n\texecuteCommand();\n\texecutePostPost();\n}\n\n\n/** Executes all DVI commands read from the input stream. */\nvoid DVIReader::executeAll () {\n\tint opcode = 0;\n\twhile (!eof() && opcode >= 0) {\n\t\ttry {\n\t\t\topcode = executeCommand();\n\t\t}\n\t\tcatch (const DVIPrematureEOFException &) {\n\t\t\t// end of stream reached\n\t\t\topcode = -1;\n\t\t}\n\t}\n}\n\n\n/** Reads and executes the commands of a single page.\n * This methods stops reading after the page's eop command has been executed.\n * @param[in] n number of page to be executed (1-based)\n * @returns true if page was read successfully */\nbool DVIReader::executePage (unsigned n) {\n\tclearStream(); // reset all status bits\n\tif (!isStreamValid())\n\t\tthrowDVIException(\"invalid DVI file (page \"+to_string(n)+\" not found\");\n\tif (n < 1 || n > numberOfPages())\n\t\treturn false;\n\n\tseek(_bopOffsets[n-1]); // goto bop of n-th page\n\t_currPageNum = n;\n\twhile (executeCommand() != OP_EOP);\n\treturn true;\n}\n\n\n/** Computes a hash value for a given page. The hash algorithm is selected by\n * a HashFunction object which will also contain the resulting hash value if\n * this function returns true.\n * @param[in] pageno number of page to process (1-based)\n * @param[in,out] hashFunc hash function to use\n * @return true on success, hashFunc contains the resulting hash value */\nbool DVIReader::computePageHash (size_t pageno, HashFunction &hashFunc) const {\n\tif (pageno == 0 || pageno > numberOfPages())\n\t\treturn false;\n\n\thashFunc.reset();\n\tclearStream();\n\tseek(_bopOffsets[pageno-1]+45); // now on first command after bop of selected page\n\tsize_t numBytes = numberOfPageBytes(pageno-1)-46; // number of bytes excluding bop and eop\n\twhile (numBytes > 0) {\n\t\tconstexpr size_t BUFSIZE = 4096;\n\t\tchar buf[BUFSIZE];\n\t\tgetInputStream().read(buf, min(numBytes, BUFSIZE));\n\t\thashFunc.update(buf, getInputStream().gcount());\n\t\tnumBytes -= getInputStream().gcount();\n\t}\n\treturn true;\n}\n\n\n/////////////////////////////////////\n\n/** Reads and executes DVI preamble command.\n * Format: pre ver[1] num[4] den[4] mag[4] cmtlen[1] cmt[cmtlen] */\nvoid DVIReader::cmdPre (int) {\n\tuint8_t id = readUnsigned(1);\n\tsetDVIVersion(DVIVersion(id)); // identification number\n\tuint32_t numer = readUnsigned(4); // numerator units of measurement\n\tuint32_t denom = readUnsigned(4); // denominator units of measurement\n\tif (denom == 0)\n\t\tthrowDVIException(\"denominator of measurement unit is zero\");\n\t_mag = readUnsigned(4); // magnification\n\tuint32_t k = readUnsigned(1); // length of following comment\n\tstring comment = readString(k);\n\t// 1 dviunit * num/den == multiples of 0.0000001m\n\t// 1 dviunit * _dvibp: length of 1 dviunit in PS points * _mag/1000\n\t_dvi2bp = numer/254000.0*72.0/denom*_mag/1000.0;\n\tdviPre(id, numer, denom, _mag, comment);\n}\n\n\n/** Reads and executes DVI postamble command.\n * Format: post p[4] num[4] den[4] mag[4] ph[4] pw[4] sd[2] np[2] */\nvoid DVIReader::cmdPost (int) {\n\tuint32_t prevBopOffset = readUnsigned(4);\n\tuint32_t numer = readUnsigned(4);\n\tuint32_t denom = readUnsigned(4);\n\tif (denom == 0)\n\t\tthrowDVIException(\"denominator of measurement unit is zero\");\n\t_mag = readUnsigned(4);\n\tuint32_t pageHeight = readUnsigned(4); // height of tallest page in dvi units\n\tuint32_t pageWidth = readUnsigned(4); // width of widest page in dvi units\n\tuint16_t stackDepth = readUnsigned(2); // max. stack depth required\n\tuint16_t numPages = readUnsigned(2);\n\tif (numPages != (numberOfPages() & 0xffff))\n\t\tthrowDVIException(\"page count in postamble doesn't match actual number of pages\");\n\n\t// 1 dviunit * num/den == multiples of 0.0000001m\n\t// 1 dviunit * _dvi2bp: length of 1 dviunit in PS points * _mag/1000\n\t_dvi2bp = numer/254000.0*72.0/denom*_mag/1000.0;\n\tdviPost(stackDepth, numPages, pageWidth*_dvi2bp, pageHeight*_dvi2bp, _mag, numer, denom, prevBopOffset);\n}\n\n\n/** Reads and executes DVI post_post command.\n * Format: post_post q[4] i[1] 223[>=4] */\nvoid DVIReader::cmdPostPost (int) {\n\tuint32_t postOffset = readUnsigned(4); // pointer to begin of postamble\n\tuint8_t id = readUnsigned(1);\n\tsetDVIVersion(DVIVersion(id)); // identification byte\n\twhile (readUnsigned(1) == DVI_FILL); // skip fill bytes (223), eof bit should be set now\n\tdviPostPost(DVIVersion(id), postOffset);\n}\n\n\n/** Reads and executes Begin-Of-Page command.\n * Format: bop c0[+4] ... c9[+4] p[+4] */\nvoid DVIReader::cmdBop (int) {\n\tvector c(10);\n\tfor (int i=0; i < 10; i++)\n\t\tc[i] = readSigned(4);\n\tint32_t prevBopOffset = readSigned(4); // pointer to peceeding bop (-1 in case of first page)\n\t_dviState.reset(); // set all DVI registers to 0\n\twhile (!_stateStack.empty())\n\t\t_stateStack.pop();\n\t_currFontNum = 0;\n\t_inPage = true;\n\tdviBop(c, prevBopOffset);\n}\n\n\n/** Reads and executes End-Of-Page command. */\nvoid DVIReader::cmdEop (int) {\n\tif (!_stateStack.empty())\n\t\tthrowDVIException(\"stack not empty at end of page\");\n\t_inPage = false;\n\tdviEop();\n}\n\n\n/** Reads and executes push command. */\nvoid DVIReader::cmdPush (int) {\n\t_stateStack.push(_dviState);\n\tdviPush();\n}\n\n\n/** Reads and executes pop command (restores pushed position information). */\nvoid DVIReader::cmdPop (int) {\n\tif (_stateStack.empty())\n\t\tthrowDVIException(\"stack empty at pop command\");\n\t_dviState = _stateStack.top();\n\t_stateStack.pop();\n\tdviPop();\n}\n\n\n/** Helper function that handles characters from virtual fonts (VF).\n * It is called by the cmdSetChar and cmdPutChar methods.\n * @param[in] font current font (corresponding to _currFontNum)\n * @param[in] c character to typeset */\nvoid DVIReader::putVFChar (Font *font, uint32_t c) {\n\tif (auto vf = font_cast(font)) { // is current font a virtual font?\n\t\tFontManager &fm = FontManager::instance();\n\t\tconst auto *dvi = vf->getDVI(c); // try to get DVI sequence that represents character c\n\t\tFont *firstFont = fm.vfFirstFont(vf);\n\t\tif (!dvi) {\n\t\t\tconst FontMetrics *ffm = firstFont ? firstFont->getMetrics() : nullptr;\n\t\t\tif (!ffm || (!ffm->isJFM() && !ffm->isOFM()))\n\t\t\t\treturn;\n\t\t}\n\t\tfm.enterVF(vf); // enter VF font number context\n\t\tint savedFontNum = _currFontNum; // save current font number\n\t\tsetFont(fm.vfFirstFontNum(vf), SetFontMode::VF_ENTER);\n\t\tif (!dvi) // no definition present for current (Japanese) char?\n\t\t\tdviPutChar(c, firstFont); // fallback for JFM-based virtual fonts\n\t\telse {\n\t\t\t// DVI units in virtual fonts are multiples of 1^(-20) times the scaled size of the VF\n\t\t\tdouble savedScale = _dvi2bp;\n\t\t\t_dvi2bp = vf->scaledSize()/(1 << 20);\n\t\t\tDVIState savedState = _dviState; // save current cursor position\n\t\t\t_dviState.x = _dviState.y = _dviState.w = _dviState.z = 0;\n\t\t\tivectorstream> vis(*dvi);\n\t\t\tauto &is = replaceStream(vis);\n\t\t\ttry {\n\t\t\t\texecuteAll(); // execute DVI fragment\n\t\t\t}\n\t\t\tcatch (const DVIException &) {\n\t\t\t\t// Message::estream(true) << \"invalid dvi in vf: \" << e.getMessage() << endl; // @@\n\t\t\t}\n\t\t\treplaceStream(is); // restore previous input stream\n\t\t\t_dviState = savedState; // restore previous cursor position\n\t\t\t_dvi2bp = savedScale; // restore previous scale factor\n\t\t}\n\t\tfm.leaveVF(); // restore previous font number context\n\t\tsetFont(savedFontNum, SetFontMode::VF_LEAVE); // restore previous font number\n\t}\n}\n\n\n/** Reads and executes set_char_x command. Puts a character at the current\n * position and advances the cursor.\n * @param[in] c character to set\n * @throw DVIException if method is called outside a bop/eop pair */\nvoid DVIReader::cmdSetChar0 (int c) {\n\tif (!_inPage)\n\t\tthrowDVIException(\"setchar outside of page\");\n\tif (Font *font = FontManager::instance().getFont(_currFontNum)) {\n\t\tdviSetChar0(c, font); // template method that may trigger further actions\n\t\tputVFChar(font, c); // further character processing if current font is a virtual font\n\t\tmoveRight(font->charWidth(c)*font->scaleFactor()*_mag/1000.0, MoveMode::SETCHAR);\n\t}\n\telse throwDVIException(\"no font selected prior to setchar\");\n}\n\n\n/** Reads and executes setx command. Puts a character at the current\n * position and advances the cursor.\n * @param[in] len number of parameter bytes (possible values: 1-4)\n * @throw DVIException if method is called outside a bop/eop pair */\nvoid DVIReader::cmdSetChar (int len) {\n\tif (!_inPage)\n\t\tthrowDVIException(\"setchar outside of page\");\n\t// According to the dvi specification all character codes are unsigned\n\t// except len == 4. At the moment all char codes are treated as unsigned...\n\tuint32_t c = readUnsigned(len); // if len == 4 c may be signed\n\tif (Font *font = FontManager::instance().getFont(_currFontNum)) {\n\t\tdviSetChar(c, font); // template method that may trigger further actions\n\t\tputVFChar(font, c); // further character processing if current font is a virtual font\n\t\tmoveRight(font->charWidth(c)*font->scaleFactor()*_mag/1000.0, MoveMode::SETCHAR);\n\t}\n\telse throwDVIException(\"no font selected prior to setchar\");\n}\n\n\n/** Reads and executes putx command. Puts a character at the current\n * position but doesn't change the cursor position.\n * @param[in] len number of parameter bytes (possible values: 1-4)\n * @throw DVIException if method is called outside a bop/eop pair */\nvoid DVIReader::cmdPutChar (int len) {\n\tif (!_inPage)\n\t\tthrowDVIException(\"putchar outside of page\");\n\t// According to the dvi specification all character codes are unsigned\n\t// except len == 4. At the moment all char codes are treated as unsigned...\n\tint32_t c = readUnsigned(len);\n\tif (Font *font = FontManager::instance().getFont(_currFontNum)) {\n\t\tdviPutChar(c, font);\n\t\tputVFChar(font, c);\n\t}\n\telse throwDVIException(\"no font selected prior to putchar\");\n}\n\n\n/** Reads and executes set_rule command. Puts a solid rectangle at the current\n * position and updates the cursor position.\n * Format: set_rule h[+4] w[+4]\n * @throw DVIException if method is called outside a bop/eop pair */\nvoid DVIReader::cmdSetRule (int) {\n\tif (!_inPage)\n\t\tthrowDVIException(\"set_rule outside of page\");\n\tdouble height = _dvi2bp*readSigned(4);\n\tdouble width = _dvi2bp*readSigned(4);\n\tdviSetRule(height, width);\n\tmoveRight(width, MoveMode::CHANGEPOS);\n}\n\n\n/** Reads and executes set_rule command. Puts a solid rectangle at the current\n * position but leaves the cursor position unchanged.\n * Format: put_rule h[+4] w[+4]\n * @throw DVIException if method is called outside a bop/eop pair */\nvoid DVIReader::cmdPutRule (int) {\n\tif (!_inPage)\n\t\tthrowDVIException(\"put_rule outside of page\");\n\tdouble height = _dvi2bp*readSigned(4);\n\tdouble width = _dvi2bp*readSigned(4);\n\tdviPutRule(height, width);\n}\n\n\nvoid DVIReader::moveRight (double dx, MoveMode) {\n\tswitch (_dviState.d) {\n\t\tcase WritingMode::LR: _dviState.h += dx; break;\n\t\tcase WritingMode::TB: _dviState.v += dx; break;\n\t\tcase WritingMode::BT: _dviState.v -= dx; break;\n\t}\n}\n\n\nvoid DVIReader::moveDown (double dy, MoveMode) {\n\tswitch (_dviState.d) {\n\t\tcase WritingMode::LR: _dviState.v += dy; break;\n\t\tcase WritingMode::TB: _dviState.h -= dy; break;\n\t\tcase WritingMode::BT: _dviState.h += dy; break;\n\t}\n}\n\n\nvoid DVIReader::cmdRight (int len) {\n\tdouble dx = _dvi2bp*readSigned(len);\n\tmoveRight(dx, MoveMode::CHANGEPOS);\n\tdviRight(dx);\n}\n\n\nvoid DVIReader::cmdDown (int len) {\n\tdouble dy = _dvi2bp*readSigned(len);\n\tmoveDown(dy, MoveMode::CHANGEPOS);\n\tdviDown(dy);\n}\n\n\nvoid DVIReader::cmdNop (int) {dviNop();}\nvoid DVIReader::cmdX0 (int) {moveRight(_dviState.x, MoveMode::CHANGEPOS); dviX0();}\nvoid DVIReader::cmdY0 (int) {moveDown(_dviState.y, MoveMode::CHANGEPOS); dviY0();}\nvoid DVIReader::cmdW0 (int) {moveRight(_dviState.w, MoveMode::CHANGEPOS); dviW0();}\nvoid DVIReader::cmdZ0 (int) {moveDown(_dviState.z, MoveMode::CHANGEPOS); dviZ0();}\n\n\nvoid DVIReader::cmdX (int len) {\n\tdouble dx = _dvi2bp*readSigned(len);\n\t_dviState.x = dx;\n\tmoveRight(dx, MoveMode::CHANGEPOS);\n\tdviX(dx);\n}\n\n\nvoid DVIReader::cmdY (int len) {\n\tdouble dy = _dvi2bp*readSigned(len);\n\t_dviState.y = dy;\n\tmoveDown(dy, MoveMode::CHANGEPOS);\n\tdviY(dy);\n}\n\n\nvoid DVIReader::cmdW (int len) {\n\tdouble dx = _dvi2bp*readSigned(len);\n\t_dviState.w = dx;\n\tmoveRight(dx, MoveMode::CHANGEPOS);\n\tdviW(dx);\n}\n\n\nvoid DVIReader::cmdZ (int len) {\n\tdouble dy = _dvi2bp*readSigned(len);\n\t_dviState.z = dy;\n\tmoveDown(dy, MoveMode::CHANGEPOS);\n\tdviZ(dy);\n}\n\n\n/** Sets the text orientation (horizontal, vertical).\n * This command is only available in DVI version 3 (created by pTeX) */\nvoid DVIReader::cmdDir (int) {\n\tuint8_t wmode = readUnsigned(1);\n\tif (wmode == 4) // yoko mode (4) equals default LR mode (0)\n\t\twmode = 0;\n\tif (wmode == 2 || wmode > 3)\n\t\tthrowDVIException(\"invalid writing mode value \" + std::to_string(wmode) + \" (0, 1, 3, or 4 expected)\");\n\t_dviState.d = (WritingMode)wmode;\n\tdviDir(_dviState.d);\n}\n\n\nvoid DVIReader::cmdXXX (int len) {\n\tif (!_inPage)\n\t\tthrowDVIException(\"special outside of page\");\n\tuint32_t numBytes = readUnsigned(len);\n\tstring str = readString(numBytes);\n\tdviXXX(str);\n}\n\n\n/** Change the current font.\n * @param[in] fontnum local number of font to select\n * @param[in] mode info on command that triggered the font change\n * @throw DVIException if font number is undefined */\nvoid DVIReader::setFont (int fontnum, SetFontMode mode) {\n\tif (const Font *font = FontManager::instance().getFont(fontnum)) {\n\t\t_currFontNum = fontnum;\n\t\tdviFontNum(uint32_t(fontnum), mode, font);\n\t}\n\telse\n\t\tthrowDVIException(\"undefined font number \" + std::to_string(fontnum));\n}\n\n\n/** Selects a previously defined font by its number.\n * @param[in] fontnum font number\n * @throw DVIException if font number is undefined */\nvoid DVIReader::cmdFontNum0 (int fontnum) {\n\tsetFont(fontnum, SetFontMode::SF_SHORT);\n}\n\n\n/** Selects a previously defined font.\n * @param[in] len size of font number variable (in bytes)\n * @throw DVIException if font number is undefined */\nvoid DVIReader::cmdFontNum (int len) {\n\tuint32_t fontnum = readUnsigned(len);\n\tsetFont(fontnum, SetFontMode::SF_LONG);\n}\n\n\n/** Parses a sequence of font attributes given as key1=val1;key2=val2;...;keyn=valn */\nstatic map parse_font_attribs (const string &str) {\n\tmap attribs;\n\tif (!str.empty()) {\n\t\tfor (const string &attr : util::split(str, \";\")) {\n\t\t\tvector keyval = util::split(attr, \"=\");\n\t\t\tif (keyval.size() == 2)\n\t\t\t\tattribs[keyval[0]] = keyval[1];\n\t\t}\n\t}\n\treturn attribs;\n}\n\n\n/** Helper function to handle a font definition.\n * @param[in] fontnum local font number\n * @param[in] name font name (or file path if enclosed in square brackets)\n * @param[in] cs checksum to be compared with TFM checksum\n * @param[in] dsize design size of font in PS point units\n * @param[in] ssize scaled size of font in PS point units */\nconst Font* DVIReader::defineFont (uint32_t fontnum, const string &name, uint32_t cs, double dsize, double ssize) {\n\tFontManager &fm = FontManager::instance();\n\tFont *font = fm.getFont(fontnum);\n\tif (!font && !name.empty()) { // font not registered yet?\n\t\tif (name[0] == '[') { // LuaTeX native font reference?\n\t\t\tauto last = name.rfind(']');\n\t\t\tif (last != string::npos) {\n\t\t\t\tstring path = name.substr(1, last-1);\n\t\t\t\tFontStyle style;\n\t\t\t\tint fontIndex=0;\n\t\t\t\tif (name.size() > last && name[last+1] == ':') { // look for font attributes?\n\t\t\t\t\tauto attribs = parse_font_attribs(name.substr(last+2));\n\t\t\t\t\tauto it = attribs.begin();\n\t\t\t\t\tif ((it = attribs.find(\"index\")) != attribs.end())\n\t\t\t\t\t\tfontIndex = stoi(it->second);\n\t\t\t\t\tif ((it = attribs.find(\"embolden\")) != attribs.end())\n\t\t\t\t\t\tstyle.bold = stoi(it->second)/65536.0;\n\t\t\t\t\tif ((it = attribs.find(\"extend\")) != attribs.end())\n\t\t\t\t\t\tstyle.extend = stoi(it->second)/65536.0;\n\t\t\t\t\tif ((it = attribs.find(\"slant\")) != attribs.end())\n\t\t\t\t\t\tstyle.slant = stoi(it->second)/65536.0;\n\t\t\t\t}\n\t\t\t\tint id = fm.registerFont(fontnum, path, fontIndex, ssize, style, Color::BLACK);\n\t\t\t\tfont = fm.getFontById(id);\n\t\t\t}\n\t\t}\n\t\telse { // TFM-based font specified by name\n\t\t\tint id = fm.registerFont(fontnum, name, cs, dsize, ssize);\n\t\t\tfont = fm.getFontById(id);\n\t\t\tif (auto vf = font_cast(font)) {\n\t\t\t\t// read vf file, register its font and character definitions\n\t\t\t\tfm.enterVF(vf);\n\t\t\t\tifstream ifs(vf->path(), ios::binary);\n\t\t\t\tVFReader vfReader(ifs);\n\t\t\t\tvfReader.replaceActions(this);\n\t\t\t\tvfReader.executeAll();\n\t\t\t\tfm.leaveVF();\n\t\t\t}\n\t\t}\n\t}\n\treturn font;\n}\n\n\n/** Defines a new font.\n * @param[in] len size of font number variable (in bytes) */\nvoid DVIReader::cmdFontDef (int len) {\n\tuint32_t fontnum = readUnsigned(len); // font number\n\tuint32_t checksum = readUnsigned(4); // font checksum (to be compared with corresponding TFM checksum)\n\tuint32_t ssize = readUnsigned(4); // scaled size of font in DVI units\n\tuint32_t dsize = readUnsigned(4); // design size of font in DVI units\n\tuint32_t pathlen = readUnsigned(1); // length of font path\n\tuint32_t namelen = readUnsigned(1); // length of font name\n\tstring path = readString(pathlen); // path to font file\n\tstring fontname = readString(namelen);\n\tconst Font *font = defineFont(fontnum, fontname, checksum, dsize*_dvi2bp, ssize*_dvi2bp);\n\tdviFontDef(fontnum, checksum, font);\n}\n\n\n/** This template method is called by the VFReader after reading a font definition from a VF file.\n * @param[in] fontnum local font number\n * @param[in] path path to font file\n * @param[in] name font name\n * @param[in] checksum checksum to be compared with TFM checksum\n * @param[in] dsize design size in PS point units\n * @param[in] ssize scaled size in PS point units */\nvoid DVIReader::defineVFFont (uint32_t fontnum, const string &path, const string &name, uint32_t checksum, double dsize, double ssize) {\n\tif (const VirtualFont *vf = FontManager::instance().getVF())\n\t\tdefineFont(fontnum, name, checksum, dsize, ssize * vf->scaleFactor());\n}\n\n\n/** This template method is called by the VFReader after reading a character definition from a VF file.\n * @param[in] c character number\n * @param[in] dvi DVI fragment describing the character */\nvoid DVIReader::defineVFChar (uint32_t c, vector dvi) {\n\tFontManager::instance().assignVFChar(c, std::move(dvi));\n}\n\n\n/** XDV extension: includes image or pdf file.\n * parameters: box[1] matrix[4][6] p[2] len[2] path[l] */\nvoid DVIReader::cmdXPic (int) {\n\tuint8_t box = readUnsigned(1); // box\n\tvector matrix(6);\n\tfor (int i=0; i < 6; i++) // matrix\n\t\tmatrix[i] = readSigned(4);\n\tint16_t page = readSigned(2); // page number\n\tuint16_t len = readUnsigned(2);\n\tstring path = readString(len); // path to image/pdf file\n\tdviXPic(box, matrix, page, path);\n}\n\n\n/** XDV extension: defines a native font */\nvoid DVIReader::cmdXFontDef (int) {\n\tint32_t fontnum = readSigned(4);\n\tdouble ptsize = _dvi2bp*readUnsigned(4);\n\tuint16_t flags = readUnsigned(2);\n\tuint8_t psname_len = readUnsigned(1);\n\tuint8_t fmname_len = getDVIVersion() == DVI_XDV5 ? readUnsigned(1) : 0; // length of family name\n\tuint8_t stname_len = getDVIVersion() == DVI_XDV5 ? readUnsigned(1) : 0; // length of style name\n\tstring fontname = readString(psname_len);\n\tuint32_t fontIndex=0;\n\tif (getDVIVersion() == DVI_XDV5)\n\t\tseek(fmname_len+stname_len, ios::cur);\n\telse\n\t\tfontIndex = readUnsigned(4);\n\tFontStyle style;\n\tColor color;\n\tif (flags & 0x0100) { // vertical?\n\t}\n\tif (flags & 0x0200) { // colored?\n\t\t// The font color must not interfere with color specials. If the font color is not black,\n\t\t// all color specials should be ignored, i.e. glyphs of a non-black fonts have a fixed color\n\t\t// that can't be changed by color specials.\n\t\tuint32_t rgba = readUnsigned(4);\n\t\tcolor.setRGB(uint8_t(rgba >> 24), uint8_t((rgba >> 16) & 0xff), uint8_t((rgba >> 8) & 0xff));\n\t}\n\tif (flags & 0x1000) // extend?\n\t\tstyle.extend = _dvi2bp*readSigned(4);\n\tif (flags & 0x2000) // slant?\n\t\tstyle.slant = _dvi2bp*readSigned(4);\n\tif (flags & 0x4000) // embolden?\n\t\tstyle.bold = _dvi2bp*readSigned(4);\n\tif ((flags & 0x0800) && (getDVIVersion() == DVI_XDV5)) { // variations?\n\t\tuint16_t num_variations = readSigned(2);\n\t\tfor (int i=0; i < num_variations; i++)\n\t\t\treadUnsigned(4);\n\t}\n\tconst Font *font = FontManager::instance().getFont(fontnum);\n\tif (!font) {\n\t\tFontManager::instance().registerFont(fontnum, fontname, fontIndex, ptsize, style, color);\n\t\tfont = FontManager::instance().getFont(fontnum);\n\t}\n\tdviXFontDef(fontnum, font_cast(font));\n}\n\n\n/** Returns the width of a string typed with a given font.\n * @param[in] glyphs glyphs of the string\n * @param[in] font assigned font\n * @return width in bp units */\nstatic double string_width (const vector &glyphs, const Font *font) {\n\tif (auto nfont = font_cast(font)) {\n\t\treturn algo::accumulate(glyphs, 0.0, [&nfont](double w, uint16_t gid) {\n\t\t\treturn w + nfont->hAdvance(Character(Character::INDEX, gid));\n\t\t});\n\t}\n\treturn 0;\n}\n\n\n/** XDV extension: prints an array of characters where each character\n * can take independent x and y coordinates.\n * parameters: w[4] n[2] (dx,dy)[(4+4)n] glyphs[2n] */\nvoid DVIReader::cmdXGlyphArray (int) {\n\tvector dx, dy;\n\tvector glyphs;\n\tdouble width = putGlyphArray(false, dx, dy, glyphs);\n\tFont *font = FontManager::instance().getFont(_currFontNum);\n\tif (!font)\n\t\tthrowDVIException(\"missing setfont prior to xglypharray\");\n\tdviXGlyphArray(dx, dy, glyphs, *font);\n\tdouble diff = abs(string_width(glyphs, font) - width);\n\t// if the given width differs from the actual width of the string,\n\t// we must force a position change to prevent misalignments\n\tmoveRight(width, diff < 0.2 ? MoveMode::SETCHAR : MoveMode::CHANGEPOS);\n}\n\n\n/** XDV extension: prints an array/string of characters where each character\n * can take independent x coordinates whereas all share a single y coordinate.\n * parameters: w[4] n[2] dx[4n] dy[4] glyphs[2n] */\nvoid DVIReader::cmdXGlyphString (int) {\n\tvector dx, dy;\n\tvector glyphs;\n\tdouble width = putGlyphArray(true, dx, dy, glyphs);\n\tFont *font = FontManager::instance().getFont(_currFontNum);\n\tif (!font)\n\t\tthrowDVIException(\"missing setfont prior to xglyphstring\");\n\tdviXGlyphString(dx, glyphs, *font);\n\tdouble diff = abs(string_width(glyphs, font) - width);\n\t// if the given width differs from the actual width of the string,\n\t// we must force a position change to prevent misalignments\n\tmoveRight(width, diff < 0.2 ? MoveMode::SETCHAR : MoveMode::CHANGEPOS);\n}\n\n\n/** XDV extension: Same as cmdXGlyphArray plus a leading array of UTF-16 characters\n * that specify the \"actual text\" represented by the glyphs to be printed. It usually\n * contains the text with special characters (like ligatures) expanded so that it\n * can be used for text search, plain text copy & paste etc. This XDV command was\n * introduced with XeTeX 0.99995 and can be triggered by \\\\XeTeXgenerateactualtext1.\n * parameters: l[2] chars[2l] w[4] n[2] (dx,dy)[8n] glyphs[2n] */\nvoid DVIReader::cmdXTextAndGlyphs (int) {\n\tuint16_t l = readUnsigned(2); // number of chars\n\tvector chars(l);\n\tfor (int i=0; i < l; i++)\n\t\tchars[i] = readUnsigned(2);\n\tvector x, y;\n\tvector glyphs;\n\tdouble width = putGlyphArray(false, x, y, glyphs);\n\tFont *font = FontManager::instance().getFont(_currFontNum);\n\tif (!font)\n\t\tthrowDVIException(\"missing setfont prior to xtextandglyphs\");\n\tdviXTextAndGlyphs(x, y, chars, glyphs, *font);\n\tdouble diff = abs(string_width(glyphs, font) - width);\n\t// if the given width differs from the actual width of the string,\n\t// we must force a position change to prevent misalignments\n\tmoveRight(width, diff < 0.2 ? MoveMode::SETCHAR : MoveMode::CHANGEPOS);\n}\n\n\n/** Implements the common functionality of cmdXGlyphArray, cmdXGlyphString, and cmdXTextAndGlyphs.\n * @param[in] xonly indicates if the characters share a single y coordinate (xonly==true)\n * @param[out] dx relative horizontal positions of each glyph\n * @param[out] dy relative vertical positions of each glyph\n * @param[out] glyphs FreeType indices of the glyphs to typeset\n * @return total width of the glyph array */\ndouble DVIReader::putGlyphArray (bool xonly, vector &dx, vector &dy, vector &glyphs) const {\n\tdouble strwidth = _dvi2bp*readSigned(4);\n\tuint16_t num_glyphs = readUnsigned(2);\n\tdx.resize(num_glyphs);\n\tdy.resize(num_glyphs);\n\tglyphs.resize(num_glyphs);\n\tfor (int i=0; i < num_glyphs; i++) {\n\t\tdx[i] = readSigned(4)*_dvi2bp;\n\t\tdy[i] = xonly ? 0 : readSigned(4)*_dvi2bp;\n\t}\n\tfor (int i=0; i < num_glyphs; i++)\n\t\tglyphs[i] = readUnsigned(2);\n\treturn strwidth;\n}\n" }, { "path": "src/DVIReader.hpp", "content": "/*************************************************************************\n** DVIReader.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef DVIREADER_HPP\n#define DVIREADER_HPP\n\n#include \n#include \n#include \n#include \n#include \n#include \"BasicDVIReader.hpp\"\n#include \"Color.hpp\"\n#include \"VFActions.hpp\"\n\nclass Font;\nclass FontStyle;\nclass HashFunction;\nclass NativeFont;\nclass VirtualFont;\n\nclass DVIReader : public BasicDVIReader, public VFActions {\n\tprotected:\n\t\tenum class WritingMode {LR=0, TB=1, BT=3};\n\t\tenum class SetFontMode {SF_SHORT, SF_LONG, VF_ENTER, VF_LEAVE};\n\t\tenum class MoveMode {SETCHAR, CHANGEPOS};\n\n\t\tstruct DVIState {\n\t\t\tdouble h=0, v=0; ///< horizontal and vertical cursor position\n\t\t\tdouble x=0, w=0, y=0, z=0; ///< additional registers to store horizontal (x, w) and vertical (y, z) positions\n\t\t\tWritingMode d=WritingMode::LR; ///< direction: 0: horizontal, 1: vertical(top->bottom), 3: vertical (bottom->top)\n\t\t\tvoid reset () {h = v = x = w = y = z = 0.0; d=WritingMode::LR;}\n\t\t};\n\n\tpublic:\n\t\texplicit DVIReader (std::istream &is);\n\t\tvoid executeAll ();\n\t\tbool executePage (unsigned n);\n\t\tdouble getXPos () const override {return _dviState.h;}\n\t\tdouble getYPos () const override {return _dviState.v;}\n\t\tint stackDepth () const override {return _stateStack.size();}\n\t\tunsigned currentPageNumber () const override {return _currPageNum;}\n\t\tunsigned numberOfPages () const {return _bopOffsets.empty() ? 0 : _bopOffsets.size()-1;}\n\n\tprotected:\n\t\tsize_t numberOfPageBytes (int n) const {return _bopOffsets.size() > 1 ? _bopOffsets[n+1]-_bopOffsets[n] : 0;}\n\t\tbool computePageHash (size_t pageno, HashFunction &hashFunc) const;\n\t\tvirtual void moveRight (double dx, MoveMode mode);\n\t\tvirtual void moveDown (double dy, MoveMode mode);\n\t\tvoid putVFChar (Font *font, uint32_t c);\n\t\tdouble putGlyphArray (bool xonly, std::vector &dx, std::vector &dy, std::vector &glyphs) const;\n\t\tconst Font* defineFont (uint32_t fontnum, const std::string &name, uint32_t cs, double dsize, double ssize);\n\t\tvoid setFont (int num, SetFontMode mode);\n\t\tconst DVIState& dviState() const {return _dviState;}\n\t\tdouble dvi2bp () const {return _dvi2bp;}\n\t\tbool inPage () const {return _inPage;}\n\n\t\t// VFAction methods\n\t\tvoid defineVFFont (uint32_t fontnum, const std::string &path, const std::string &name, uint32_t checksum, double dsize, double ssize) override;\n\t\tvoid defineVFChar (uint32_t c, std::vector dvi) override;\n\n\t\t// The following template methods provide higher-level access to the DVI commands.\n\t\t// In contrast to their cmdXXX pendants, they don't require any handling of the input stream.\n\t\t// All command arguments are delivered as function parameters. These methods are called after\n\t\t// the DVI registers have been updated, i.e. currState() represents the state after executing\n\t\t// the command. If the previous register state is required, prevState() can be used.\n\t\tvirtual void dviPre (uint8_t id, uint32_t numer, uint32_t denom, uint32_t mag, const std::string &comment) {}\n\t\tvirtual void dviPost (uint16_t stdepth, uint16_t pages, uint32_t pw, uint32_t ph, uint32_t mag, uint32_t num, uint32_t den, uint32_t lbopofs) {}\n\t\tvirtual void dviPostPost (uint8_t id, uint32_t postOffset) {}\n\t\tvirtual void dviBop (const std::vector &c, int32_t prevBopOffset) {}\n\t\tvirtual void dviEop () {}\n\t\tvirtual void dviSetChar0 (uint32_t c, const Font *font) {}\n\t\tvirtual void dviSetChar (uint32_t c, const Font *font) {}\n\t\tvirtual void dviPutChar (uint32_t c, const Font *font) {}\n\t\tvirtual void dviSetRule (double h, double w) {}\n\t\tvirtual void dviPutRule (double h, double w) {}\n\t\tvirtual void dviNop () {}\n\t\tvirtual void dviPush () {}\n\t\tvirtual void dviPop () {}\n\t\tvirtual void dviRight (double dx) {}\n\t\tvirtual void dviDown (double dy) {}\n\t\tvirtual void dviX0 () {}\n\t\tvirtual void dviY0 () {}\n\t\tvirtual void dviW0 () {}\n\t\tvirtual void dviZ0 () {}\n\t\tvirtual void dviX (double x) {}\n\t\tvirtual void dviY (double y) {}\n\t\tvirtual void dviW (double w) {}\n\t\tvirtual void dviZ (double z) {}\n\t\tvirtual void dviFontDef (uint32_t fontnum, uint32_t checksum, const Font *font) {}\n\t\tvirtual void dviFontNum (uint32_t fontnum, SetFontMode mode, const Font *font) {}\n\t\tvirtual void dviDir (WritingMode dir) {}\n\t\tvirtual void dviXXX (const std::string &str) {}\n\t\tvirtual void dviXPic (uint8_t box, const std::vector &matrix, int16_t page, const std::string &path) {}\n\t\tvirtual void dviXFontDef (uint32_t fontnum, const NativeFont *font) {}\n\t\tvirtual void dviXGlyphArray (std::vector &dx, std::vector &dy, std::vector &glyphs, const Font &font) {}\n\t\tvirtual void dviXGlyphString (std::vector &dx, std::vector &glyphs, const Font &font) {}\n\t\tvirtual void dviXTextAndGlyphs (std::vector &dx, std::vector &dy, std::vector &chars, std::vector &glyphs, const Font &font) {}\n\n\tprivate:\n\t\t// The following low-level methods evaluate the DVI commands read from\n\t\t// the input stream and call the corresponding dviXXX methods.\n\t\tvoid cmdSetChar0 (int c) override;\n\t\tvoid cmdSetChar (int len) override;\n\t\tvoid cmdPutChar (int len) override;\n\t\tvoid cmdSetRule (int len) override;\n\t\tvoid cmdPutRule (int len) override;\n\t\tvoid cmdNop (int len) override;\n\t\tvoid cmdBop (int len) override;\n\t\tvoid cmdEop (int len) override;\n\t\tvoid cmdPush (int len) override;\n\t\tvoid cmdPop (int len) override;\n\t\tvoid cmdDir (int len) override;\n\t\tvoid cmdRight (int len) override;\n\t\tvoid cmdDown (int len) override;\n\t\tvoid cmdX0 (int len) override;\n\t\tvoid cmdY0 (int len) override;\n\t\tvoid cmdW0 (int len) override;\n\t\tvoid cmdZ0 (int len) override;\n\t\tvoid cmdX (int len) override;\n\t\tvoid cmdY (int len) override;\n\t\tvoid cmdW (int len) override;\n\t\tvoid cmdZ (int len) override;\n\t\tvoid cmdFontDef (int len) override;\n\t\tvoid cmdFontNum0 (int n) override;\n\t\tvoid cmdFontNum (int len) override;\n\t\tvoid cmdXXX (int len) override;\n\t\tvoid cmdPre (int len) override;\n\t\tvoid cmdPost (int len) override;\n\t\tvoid cmdPostPost (int len) override;\n\t\tvoid cmdXPic (int len) override;\n\t\tvoid cmdXFontDef (int len) override;\n\t\tvoid cmdXGlyphArray (int len) override;\n\t\tvoid cmdXGlyphString (int len) override;\n\t\tvoid cmdXTextAndGlyphs (int len) override;\n\n\tprivate:\n\t\tbool _inPage=false; ///< true if stream pointer is between bop and eop\n\t\tunsigned _currPageNum=0; ///< current page number (1 is first page)\n\t\tint _currFontNum=0; ///< current font number\n\t\tdouble _dvi2bp=0.0; ///< factor to convert dvi units to PS points\n\t\tuint32_t _mag=1; ///< magnification factor * 1000\n\t\tDVIState _dviState; ///< current state of the DVI registers\n\t\tstd::stack _stateStack;\n\t\tstd::vector _bopOffsets;\n};\n\n#endif\n" }, { "path": "src/DVIToSVG.cpp", "content": "/*************************************************************************\n** DVIToSVG.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"Calculator.hpp\"\n#include \"DVIToSVG.hpp\"\n#include \"DVIToSVGActions.hpp\"\n#include \"FileSystem.hpp\"\n#include \"Font.hpp\"\n#include \"FontManager.hpp\"\n#include \"GlyphTracerMessages.hpp\"\n#include \"InputBuffer.hpp\"\n#include \"InputReader.hpp\"\n#include \"PageRanges.hpp\"\n#include \"PageSize.hpp\"\n#include \"PreScanDVIReader.hpp\"\n#include \"SignalHandler.hpp\"\n#include \"optimizer/SVGOptimizer.hpp\"\n#include \"SVGOutput.hpp\"\n#include \"utility.hpp\"\n#include \"version.hpp\"\n#include \"XXHashFunction.hpp\"\n\n///////////////////////////////////\n// special handlers\n\n#include \"BgColorSpecialHandler.hpp\"\n#include \"ColorSpecialHandler.hpp\"\n#include \"DvisvgmSpecialHandler.hpp\"\n#include \"EmSpecialHandler.hpp\"\n#include \"HtmlSpecialHandler.hpp\"\n#include \"PapersizeSpecialHandler.hpp\"\n#include \"PdfSpecialHandler.hpp\"\n#include \"PsSpecialHandlerProxy.hpp\"\n#include \"TpicSpecialHandler.hpp\"\n\n///////////////////////////////////\n\nusing namespace std;\n\n/** 'a': trace all glyphs even if some of them are already cached\n * 'm': trace missing glyphs, i.e. glyphs not yet cached\n * 0 : only trace actually required glyphs */\nchar DVIToSVG::TRACE_MODE = 0;\nbool DVIToSVG::COMPUTE_PROGRESS = false;\nDVIToSVG::HashSettings DVIToSVG::PAGE_HASH_SETTINGS;\n\n\nDVIToSVG::DVIToSVG (istream &is, SVGOutputBase &out)\n\t: DVIReader(is), _out(out), _prevWritingMode(WritingMode::LR)\n{\n\t_prevXPos = _prevYPos = numeric_limits::min();\n\t_actions = util::make_unique(*this, _svg);\n}\n\n\n/** Starts the conversion process.\n * @param[in] first number of first page to convert\n * @param[in] last number of last page to convert\n * @param[in] hashFunc pointer to function to be used to compute page hashes */\nvoid DVIToSVG::convert (unsigned first, unsigned last, HashFunction *hashFunc) {\n\tif (first > last)\n\t\tswap(first, last);\n\tif (first > numberOfPages()) {\n\t\tostringstream oss;\n\t\toss << \"file contains only \" << numberOfPages() << \" page\";\n\t\tif (numberOfPages() > 1)\n\t\t\toss << 's';\n\t\tthrow DVIException(oss.str());\n\t}\n\tlast = min(last, numberOfPages());\n\tbool computeHashes = (hashFunc && !_out.ignoresHashes());\n\tstring shortenedOptHash = XXH32HashFunction(PAGE_HASH_SETTINGS.optionsHash()).digestString();\n\tfor (unsigned i=first; i <= last; ++i) {\n\t\tstring dviHash, combinedHash;\n\t\tif (computeHashes) {\n\t\t\tcomputePageHash(i, *hashFunc);\n\t\t\tdviHash = hashFunc->digestString();\n\t\t\thashFunc->update(PAGE_HASH_SETTINGS.optionsHash());\n\t\t\tcombinedHash = hashFunc->digestString();\n\t\t}\n\t\tconst SVGOutput::HashTriple hashTriple(dviHash, shortenedOptHash, std::move(combinedHash));\n\t\tFilePath path = _out.filepath(i, numberOfPages(), hashTriple);\n\t\tif (!dviHash.empty() && !PAGE_HASH_SETTINGS.isSet(HashSettings::P_REPLACE) && path.exists()) {\n\t\t\tMessage::mstream(false, Message::MC_PAGE_NUMBER) << \"skipping page \" << i;\n\t\t\tMessage::mstream().indent(1);\n\t\t\tMessage::mstream(false, Message::MC_PAGE_WRITTEN) << \"\\nfile \" << path.shorterAbsoluteOrRelative() << \" exists\\n\";\n\t\t\tMessage::mstream().indent(0);\n\t\t}\n\t\telse {\n\t\t\texecutePage(i);\n\t\t\tSVGOptimizer(_svg).execute();\n\t\t\tembedFonts();\n\t\t\tbool success = _svg.write(_out.getPageStream(currentPageNumber(), numberOfPages(), hashTriple));\n\t\t\t_out.finish();\n\t\t\tstring fname = path.shorterAbsoluteOrRelative();\n\t\t\tif (fname.empty())\n\t\t\t\tfname = \"\";\n\t\t\tif (!success)\n\t\t\t\tMessage::wstream(true) << \"failed to write output to \" << fname << '\\n';\n\t\t\telse {\n\t\t\t\tMessage::mstream(false, Message::MC_PAGE_WRITTEN) << \"\\noutput written to \" << fname << '\\n';\n\t\t\t\tif (!_userMessage.empty()) {\n\t\t\t\t\tif (auto specialActions = dynamic_cast(_actions.get())) {\n\t\t\t\t\t\tstring msg = specialActions->expandText(_userMessage);\n\t\t\t\t\t\tMessage::ustream(true) << msg << \"\\n\";\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t_svg.reset();\n\t\t\t_actions->reset();\n\t\t}\n\t}\n}\n\n\n/** Creates a HashFunction object for a given algorithm name.\n * @param[in] algo name of hash algorithm\n * @return pointer to hash function\n * @throw MessageException if algorithm name is invalid or not supported */\nstatic unique_ptr create_hash_function (const string &algo) {\n\tif (auto hashFunc = HashFunction::create(algo))\n\t\treturn hashFunc;\n\n\tstring msg = \"unknown hash algorithm '\"+algo+\"' (supported algorithms: \";\n\tfor (const string &name : HashFunction::supportedAlgorithms())\n\t\tmsg += name + \", \";\n\tmsg.pop_back();\n\tmsg.back() = ')';\n\tthrow MessageException(std::move(msg));\n}\n\n\n/** Convert DVI pages specified by a page range string.\n * @param[in] rangestr string describing the pages to convert\n * @param[out] pageinfo (number of converted pages, number of total pages) */\nvoid DVIToSVG::convert (const string &rangestr, pair *pageinfo) {\n\tPageRanges ranges;\n\tif (!ranges.parse(rangestr, numberOfPages()))\n\t\tthrow MessageException(\"invalid page range format\");\n\tif (ranges.empty())\n\t\tthrow MessageException(\"selected page is not available\");\n\n\tMessage::mstream(false, Message::MC_PAGE_NUMBER) << \"pre-processing DVI file (format version \" << getDVIVersion() << \")\\n\";\n\tif (auto actions = dynamic_cast(_actions.get())) {\n\t\tPreScanDVIReader prescan(getInputStream(), actions);\n\t\tactions->setDVIReader(prescan);\n\t\tprescan.executeAllPages();\n\t\tactions->setDVIReader(*this);\n\t\tSpecialManager::instance().notifyPreprocessingFinished();\n\t\texecuteFontDefs();\n\t}\n\n\tunique_ptr hashFunc;\n\tif (!PAGE_HASH_SETTINGS.algorithm().empty()) // name of hash algorithm present?\n\t\thashFunc = create_hash_function(PAGE_HASH_SETTINGS.algorithm());\n\n\tfor (const auto &range : ranges)\n\t\tconvert(range.first, range.second, hashFunc.get());\n\tif (pageinfo) {\n\t\tpageinfo->first = ranges.numberOfPages();\n\t\tpageinfo->second = numberOfPages();\n\t}\n}\n\n\n/** Writes the hash values of a selected set of pages to an output stream.\n * @param[in] rangestr string describing the pages to convert\n * @param[in,out] os stream the output is written to */\nvoid DVIToSVG::listHashes (const string &rangestr, std::ostream &os) const {\n\tPageRanges ranges;\n\tif (!ranges.parse(rangestr, numberOfPages()))\n\t\tthrow MessageException(\"invalid page range format\");\n\n\tXXH32HashFunction xxh32;\n\tauto hashFunc = create_hash_function(PAGE_HASH_SETTINGS.algorithm());\n\tint width1 = util::ilog10(numberOfPages())+1;\n\tint width2 = hashFunc->digestSize()*2;\n\tint spaces1 = width1+2+(width2-3)/2;\n\tint spaces2 = width1+2+width2+2-spaces1-3+(width2-7)/2;\n\tstring shortenedOptHash = XXH32HashFunction(PAGE_HASH_SETTINGS.optionsHash()).digestString();\n\tos << string(spaces1, ' ') << \"DVI\"\n\t\t<< string(spaces2, ' ') << \"DVI+opt\\n\";\n\tfor (const auto &range : ranges) {\n\t\tfor (int i=range.first; i <= range.second; i++) {\n\t\t\tcomputePageHash(i, *hashFunc);\n\t\t\tos << setw(width1) << i;\n\t\t\tos << \": \" << hashFunc->digestString();\n\t\t\thashFunc->update(PAGE_HASH_SETTINGS.optionsHash());\n\t\t\tos << \", \" << hashFunc->digestString() << '\\n';\n\t\t}\n\t}\n\tos << \"hash algorithm: \" << PAGE_HASH_SETTINGS.algorithm()\n\t\t<< \", options hash: \" << shortenedOptHash << '\\n';\n}\n\n\nint DVIToSVG::executeCommand () {\n\tSignalHandler::instance().check();\n\tconst streampos cmdpos = tell();\n\tint opcode = DVIReader::executeCommand();\n\tif (dviState().v+_ty != _prevYPos) {\n\t\t_tx = _ty = 0;\n\t\t_prevYPos = dviState().v;\n\t}\n\t_prevXPos = dviState().h+_tx;\n\t_prevWritingMode = dviState().d;\n\tif (COMPUTE_PROGRESS && inPage() && _actions) {\n\t\tsize_t pagelen = numberOfPageBytes(currentPageNumber()-1);\n\t\t_pageByte += tell()-cmdpos;\n\t\t_actions->progress(_pageByte, pagelen);\n\t}\n\treturn opcode;\n}\n\n\n/** This template method is called by parent class DVIReader before\n * executing the BOP actions.\n * @param[in] pageno physical page number (1 = first page)\n * @param[in] c contains information about the page (page number etc.) */\nvoid DVIToSVG::enterBeginPage (unsigned pageno, const vector &c) {\n\tif (dynamic_cast(_actions.get())) {\n\t\tMessage::mstream().indent(0);\n\t\tMessage::mstream(false, Message::MC_PAGE_NUMBER) << \"processing page \" << pageno;\n\t\tif (pageno != (unsigned)c[0]) // Does page number shown on page differ from physical page number?\n\t\t\tMessage::mstream(false) << \" [\" << c[0] << ']';\n\t\tMessage::mstream().indent(1);\n\t\t_svg.appendToDoc(util::make_unique(\" This file was generated by dvisvgm \" + string(PROGRAM_VERSION) + \" \"));\n\t}\n}\n\n\n/** This template method is called by DVIReader::cmdEop() after\n * executing the EOP actions. */\nvoid DVIToSVG::leaveEndPage (unsigned) const {\n\tif (!dynamic_cast(_actions.get()))\n\t\treturn;\n\n\t// set bounding box and apply page transformations\n\tBoundingBox bbox = _actions->bbox(); // bounding box derived from the DVI commands executed\n\tif (_bboxFormatString == \"min\" || _bboxFormatString == \"preview\" || _bboxFormatString == \"papersize\") {\n\t\tbbox.unlock();\n\t\tbbox.transform(getPageTransformation());\n\t}\n\telse if (_bboxFormatString == \"dvi\") {\n\t\t// center page content\n\t\tdouble dx = (_pageWidth-bbox.width())/2;\n\t\tdouble dy = (_pageHeight-bbox.height())/2;\n\t\tbbox += BoundingBox(-dx, -dy, dx, dy);\n\t}\n\telse if (_bboxFormatString != \"none\") {\n\t\tistringstream iss(_bboxFormatString);\n\t\tStreamInputReader ir(iss);\n\t\tir.skipSpace();\n\t\tif (isalpha(ir.peek())) {\n\t\t\t// set explicitly given page format\n\t\t\tPageSize size(_bboxFormatString);\n\t\t\tif (size.valid()) {\n\t\t\t\t// convention: DVI position (0,0) equals (1in, 1in) relative\n\t\t\t\t// to the upper left vertex of the page (see DVI specification)\n\t\t\t\tconst double border = -72;\n\t\t\t\tbbox = BoundingBox(border, border, size.width().bp()+border, size.height().bp()+border);\n\t\t\t}\n\t\t}\n\t\telse { // set/modify bounding box by explicitly given values\n\t\t\ttry {\n\t\t\t\tvector lengths = BoundingBox::extractLengths(_bboxFormatString);\n\t\t\t\tif (lengths.size() == 1 || lengths.size() == 2) { // relative box size?\n\t\t\t\t\t// apply the page transformation and adjust the bbox afterwards\n\t\t\t\t\tbbox.transform(getPageTransformation());\n\t\t\t\t}\n\t\t\t\tbbox.set(lengths);\n\t\t\t}\n\t\t\tcatch (const MessageException &) {\n\t\t\t}\n\t\t}\n\t}\n\tif (bbox.width() == 0)\n\t\tMessage::wstream(false) << \"\\npage is empty\\n\";\n\tif (_bboxFormatString != \"none\") {\n\t\t_svg.setBBox(bbox);\n\t\tconst double bp2pt = (1_bp).pt();\n\t\tMessage::mstream(false) << '\\n';\n\t\tMessage::mstream(false, Message::MC_PAGE_SIZE) << \"graphic size: \" << XMLString(bbox.width()*bp2pt) << \"pt\"\n\t\t\t\" x \" << XMLString(bbox.height()*bp2pt) << \"pt\"\n\t\t\t\" (\" << XMLString(bbox.width()) << \"bp\"\n\t\t\t\" x \" << XMLString(bbox.height()) << \"bp)\";\n\t\tMessage::mstream(false) << '\\n';\n\t}\n}\n\n\nMatrix DVIToSVG::getPageTransformation () const {\n\tMatrix matrix(1); // unity matrix\n\tif (!_transCmds.empty()) {\n\t\tCalculator calc;\n\t\tif (_actions) {\n\t\t\tconst double bp2pt = (1_bp).pt();\n\t\t\tBoundingBox &bbox = _actions->bbox();\n\t\t\tcalc.setVariable(\"ux\", bbox.minX()*bp2pt);\n\t\t\tcalc.setVariable(\"uy\", bbox.minY()*bp2pt);\n\t\t\tcalc.setVariable(\"w\", bbox.width()*bp2pt);\n\t\t\tcalc.setVariable(\"h\", bbox.height()*bp2pt);\n\t\t}\n\t\t// add constants for length units to calculator\n\t\tfor (const auto &unit : Length::getUnits())\n\t\t\tcalc.setVariable(unit.first, Length(1, unit.second).pt());\n\t\tmatrix.set(_transCmds, calc);\n\t}\n\treturn matrix;\n}\n\n\nstatic void collect_chars (unordered_map> &fontmap) {\n\tunordered_map> insertedChars;\n\tfor (const auto &entry : fontmap) {\n\t\tconst Font *unique_font = entry.first->uniqueFont();\n\t\tif (unique_font != entry.first) {\n\t\t\tfor (int c : entry.second)\n\t\t\t\tinsertedChars[unique_font].insert(c);\n\t\t}\n\t}\n\tfor (const auto &entry : insertedChars)\n\t\tfontmap[entry.first].insert(entry.second.begin(), entry.second.end());\n}\n\n\n/** Adds the font information to the SVG tree. */\nvoid DVIToSVG::embedFonts () {\n\tif (!_actions) // no dvi actions => no chars written => no fonts to embed\n\t\treturn;\n\n\tauto usedFonts = FontManager::instance().getUniqueFonts();\n\tauto &usedCharsMap = FontManager::instance().getUsedChars();\n\tcollect_chars(usedCharsMap);\n\n\tGlyphTracerMessages messages;\n\tunordered_set tracedFonts; // collect unique fonts already traced\n\tfor (auto font : usedFonts) {\n\t\tif (auto ph_font = font_cast(font)) {\n\t\t\t// Check if glyphs should be traced. Only trace the glyphs of unique fonts, i.e.\n\t\t\t// avoid retracing the same glyphs again if they are referenced in various sizes.\n\t\t\tif (TRACE_MODE != 0 && tracedFonts.find(ph_font->uniqueFont()) == tracedFonts.end()) {\n\t\t\t\tph_font->traceAllGlyphs(TRACE_MODE == 'a', &messages);\n\t\t\t\ttracedFonts.insert(ph_font->uniqueFont());\n\t\t\t}\n\t\t\tif (font->path()) { // does font file exist?\n\t\t\t\tauto it = usedCharsMap.find(font);\n\t\t\t\tif (it != usedCharsMap.end())\n\t\t\t\t\t_svg.append(*ph_font, it->second, &messages);\n\t\t\t}\n\t\t\telse\n\t\t\t\tMessage::wstream(true) << \"can't embed font '\" << font->name() << \"'\\n\";\n\t\t}\n\t\telse\n\t\t\tMessage::wstream(true) << \"can't embed font '\" << font->name() << \"'\\n\";\n\t}\n\t_svg.appendFontStyles(FontManager::instance().getUsedFonts());\n}\n\n\nstatic vector extract_prefixes (const string &ignorelist) {\n\tvector prefixes;\n\tif (!ignorelist.empty()) {\n\t\tauto left = ignorelist.begin();\n\t\twhile (left != ignorelist.end()) {\n\t\t\tleft = std::find_if(left, ignorelist.end(), [](char c) {\n\t\t\t\treturn isalnum(c);\n\t\t\t});\n\t\t\tauto right = std::find_if(left, ignorelist.end(), [](char c) {\n\t\t\t\treturn !isalnum(c);\n\t\t\t});\n\t\t\tif (left != ignorelist.end())\n\t\t\t\tprefixes.emplace_back(left-ignorelist.begin(), right-left);\n\t\t\tleft = right;\n\t\t}\n\t}\n\treturn prefixes;\n}\n\n\n/** Enables or disables processing of specials. If ignorelist == 0, all\n * supported special handlers are loaded. To disable selected sets of specials,\n * the corresponding prefixes can be given separated by non alpha-numeric characters,\n * e.g. \"color, ps, em\" or \"color: ps em\" etc.\n * A single \"*\" in the ignore list disables all specials.\n * @param[in] ignorelist list of handler names to ignore\n * @param[in] pswarning if true, shows warning about disabled PS support */\nvoid DVIToSVG::setProcessSpecials (const string &ignorelist, bool pswarning) {\n\tif (ignorelist == \"*\") // ignore all specials?\n\t\tSpecialManager::instance().unregisterHandlers();\n\telse {\n\t\tauto ignoredHandlerName = extract_prefixes(ignorelist);\n\t\t// add special handlers\n\t\tSpecialManager::registerHandler(ignoredHandlerName); // handles background color special\n\t\tSpecialManager::registerHandler(ignoredHandlerName); // handles color specials\n\t\tSpecialManager::registerHandler(ignoredHandlerName); // handles raw SVG embeddings\n\t\tSpecialManager::registerHandler(ignoredHandlerName); // handles emTeX specials\n\t\tSpecialManager::registerHandler(ignoredHandlerName); // handles hyperref specials\n\t\tSpecialManager::registerHandler(ignoredHandlerName); // handles papersize special\n\t\tSpecialManager::registerHandler(ignoredHandlerName);\n\t\tSpecialManager::registerHandler(ignoredHandlerName); // handles tpic specials\n\t\tSpecialManager::registerHandler(util::make_unique(pswarning), ignoredHandlerName);\n\t}\n}\n\n\nFilePath DVIToSVG::getSVGFilePath (unsigned pageno) const {\n\treturn _out.filepath(pageno, numberOfPages());\n}\n\n\nvoid DVIToSVG::moveRight (double dx, MoveMode mode) {\n\tDVIReader::moveRight(dx, mode);\n\tif (_actions) {\n\t\tif (dviState().d == WritingMode::LR)\n\t\t\t_actions->moveToX(dviState().h+_tx, mode == MoveMode::CHANGEPOS);\n\t\telse\n\t\t\t_actions->moveToY(dviState().v+_ty, mode == MoveMode::CHANGEPOS);\n\t}\n}\n\n\nvoid DVIToSVG::moveDown (double dy, MoveMode mode) {\n\tDVIReader::moveDown(dy, mode);\n\tif (_actions) {\n\t\tif (dviState().d == WritingMode::LR)\n\t\t\t_actions->moveToY(dviState().v+_ty, mode == MoveMode::CHANGEPOS);\n\t\telse\n\t\t\t_actions->moveToX(dviState().h+_tx, mode == MoveMode::CHANGEPOS);\n\t}\n}\n\n\nvoid DVIToSVG::dviPost (uint16_t, uint16_t pages, uint32_t pw, uint32_t ph, uint32_t, uint32_t, uint32_t, uint32_t) {\n\t_pageHeight = ph; // height of tallest page in dvi units\n\t_pageWidth = pw; // width of widest page in dvi units\n}\n\n\nvoid DVIToSVG::dviBop (const std::vector &c, int32_t) {\n\t_pageByte = 0;\n\tenterBeginPage(currentPageNumber(), c);\n\tif (_actions) {\n\t\t_actions->progress(0, 1); // ensure that progress is called at 0%\n\t\t_actions->beginPage(currentPageNumber(), c);\n\t}\n}\n\n\nvoid DVIToSVG::dviEop () {\n\tif (_actions) {\n\t\t_actions->endPage(currentPageNumber());\n\t\t_pageByte = numberOfPageBytes(currentPageNumber()-1);\n\t\t_actions->progress(_pageByte, _pageByte); // ensure that progress is called at 100%\n\t}\n\tleaveEndPage(currentPageNumber());\n}\n\n\nvoid DVIToSVG::dviSetChar0 (uint32_t c, const Font *font) {\n\tif (_actions && !font_cast(font))\n\t\t_actions->setChar(dviState().h+_tx, dviState().v+_ty, c, dviState().d != WritingMode::LR, *font);\n}\n\n\nvoid DVIToSVG::dviSetChar (uint32_t c, const Font *font) {\n\tdviSetChar0(c, font);\n}\n\n\nvoid DVIToSVG::dviPutChar (uint32_t c, const Font *font) {\n\tdviSetChar0(c, font);\n}\n\n\nvoid DVIToSVG::dviSetRule (double height, double width) {\n\tif (_actions && height > 0 && width > 0)\n\t\t_actions->setRule(dviState().h+_tx, dviState().v+_ty, height, width);\n}\n\n\nvoid DVIToSVG::dviPutRule (double height, double width) {\n\tdviSetRule(height, width);\n}\n\n\nvoid DVIToSVG::dviPop () {\n\tif (_actions) {\n\t\tif (_prevXPos != dviState().h+_tx)\n\t\t\t_actions->moveToX(dviState().h + _tx, true); // force setting the SVG position\n\t\tif (_prevYPos != dviState().v+_ty)\n\t\t\t_actions->moveToY(dviState().v + _ty, true); // force setting the SVG position\n\t\tif (_prevWritingMode != dviState().d)\n\t\t\t_actions->setTextOrientation(dviState().d != WritingMode::LR);\n\t}\n}\n\n\nvoid DVIToSVG::dviFontNum (uint32_t fontnum, SetFontMode, const Font *font) {\n\tif (_actions && font && !font_cast(font))\n\t\t_actions->setFont(FontManager::instance().fontID(fontnum), *font); // all fonts get a recomputed ID\n}\n\n\nvoid DVIToSVG::dviDir (WritingMode dir) {\n\tif (_actions)\n\t\t_actions->setTextOrientation(dir != WritingMode::LR);\n}\n\n\nvoid DVIToSVG::dviXXX (const std::string &str) {\n\tif (_actions)\n\t\t_actions->special(str, dvi2bp());\n}\n\n\nvoid DVIToSVG::dviXGlyphArray (std::vector &dx, vector &dy, vector &glyphs, const Font &font) {\n\tif (_actions) {\n\t\tfor (size_t i=0; i < glyphs.size(); i++)\n\t\t\t_actions->setChar(dviState().h+dx[i]+_tx, dviState().v+dy[i]+_ty, glyphs[i], false, font);\n\t}\n}\n\n\nvoid DVIToSVG::dviXGlyphString (vector &dx, vector &glyphs, const Font &font) {\n\tif (_actions) {\n\t\tfor (size_t i=0; i < glyphs.size(); i++)\n\t\t\t_actions->setChar(dviState().h+dx[i]+_tx, dviState().v+_ty, glyphs[i], false, font);\n\t}\n}\n\n\nvoid DVIToSVG::dviXTextAndGlyphs (vector &dx, vector &dy, vector&, vector &glyphs, const Font &font) {\n\tdviXGlyphArray(dx, dy, glyphs, font);\n}\n\n///////////////////////////////////////////////////////////////\n\n/** Parses a string consisting of comma-separated words, and assigns\n * the values to the hash settings. */\nvoid DVIToSVG::HashSettings::setParameters (const string ¶mstr) {\n\tauto paramnames = util::split(paramstr, \",\");\n\tmap paramMap = {\n\t\t{\"list\", P_LIST},\n\t\t{\"replace\", P_REPLACE}\n\t};\n\tfor (string &name : paramnames) {\n\t\tname = util::trim(name);\n\t\tauto it = paramMap.find(name);\n\t\tif (it != paramMap.end())\n\t\t\t_params.insert(it->second);\n\t\telse if (_algo.empty()) {\n\t\t\tif (HashFunction::isSupportedAlgorithm(name))\n\t\t\t\t_algo = name;\n\t\t\telse if (!name.empty()) {\n\t\t\t\tstring msg = \"invalid hash parameter '\" + name + \"' (supported algorithms: \";\n\t\t\t\tfor (const string &str: HashFunction::supportedAlgorithms())\n\t\t\t\t\tmsg += str + \", \";\n\t\t\t\tmsg.pop_back();\n\t\t\t\tmsg.back() = ')';\n\t\t\t\tthrow MessageException(std::move(msg));\n\t\t\t}\n\t\t}\n\t}\n\t// set default hash algorithm if none is given\n\tif (_algo.empty())\n\t\t_algo = \"xxh64\";\n}\n" }, { "path": "src/DVIToSVG.hpp", "content": "/*************************************************************************\n** DVIToSVG.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef DVITOSVG_HPP\n#define DVITOSVG_HPP\n\n#include \n#include \n#include \n#include \"DVIReader.hpp\"\n#include \"FilePath.hpp\"\n#include \"SVGTree.hpp\"\n\nstruct DVIActions;\nstruct SVGOutputBase;\nclass HashFunction;\n\nclass DVIToSVG : public DVIReader {\n\tpublic:\n\t\tclass HashSettings {\n\t\t\tpublic:\n\t\t\t\tenum Parameter {P_LIST, P_REPLACE};\n\t\t\t\tvoid setParameters (const std::string ¶mstr);\n\t\t\t\tvoid setOptionHash (const std::string &optHash) {_optHash = optHash;}\n\t\t\t\tconst std::string& algorithm () const {return _algo;}\n\t\t\t\tconst std::string& optionsHash () const {return _optHash;}\n\t\t\t\tbool isSet (Parameter param) {return _params.find(param) != _params.end();}\n\n\t\t\tprivate:\n\t\t\t\tstd::string _algo;\n\t\t\t\tstd::string _optHash;\n\t\t\t\tstd::set _params;\n\t\t};\n\n\tpublic:\n\t\texplicit DVIToSVG (std::istream &is, SVGOutputBase &out);\n\t\tDVIToSVG (const DVIToSVG&) =delete;\n\t\tvoid convert (const std::string &range, std::pair *pageinfo=nullptr);\n\t\tvoid setPageSize (const std::string &format) {_bboxFormatString = format;}\n\t\tvoid setPageTransformation (const std::string &cmds) {_transCmds = cmds;}\n\t\tvoid setUserMessage (const std::string &msg) {_userMessage = msg;}\n\t\tMatrix getPageTransformation () const override;\n\t\tvoid translateToX (double x) override {_tx = x-dviState().h-_tx;}\n\t\tvoid translateToY (double y) override {_ty = y-dviState().v-_ty;}\n\t\tdouble getXPos() const override {return dviState().h+_tx;}\n\t\tdouble getYPos() const override {return dviState().v+_ty;}\n\t\tvoid finishLine () override {_prevYPos = std::numeric_limits::min();}\n\t\tvoid listHashes (const std::string &rangestr, std::ostream &os) const;\n\n\t\tFilePath getSVGFilePath (unsigned pageno) const;\n\t\tconst std::string& getUserBBoxString () const {return _bboxFormatString;}\n\t\tstatic void setProcessSpecials (const std::string &ignorelist=\"\", bool pswarning=false);\n\n\tpublic:\n\t\tstatic bool COMPUTE_PROGRESS; ///< if true, an action to handle the progress ratio of a page is triggered\n\t\tstatic char TRACE_MODE;\n\t\tstatic HashSettings PAGE_HASH_SETTINGS;\n\n\tprotected:\n\t\tvoid convert (unsigned firstPage, unsigned lastPage, HashFunction *hashFunc);\n\t\tint executeCommand () override;\n\t\tvoid enterBeginPage (unsigned pageno, const std::vector &c);\n\t\tvoid leaveEndPage (unsigned pageno) const;\n\t\tvoid embedFonts ();\n\t\tvoid moveRight (double dx, MoveMode mode) override;\n\t\tvoid moveDown (double dy, MoveMode mode) override;\n\n\t\tvoid dviPost (uint16_t stdepth, uint16_t pages, uint32_t pw, uint32_t ph, uint32_t mag, uint32_t num, uint32_t den, uint32_t lbopofs) override;\n\t\tvoid dviBop (const std::vector &c, int32_t prevBopOffset) override;\n\t\tvoid dviEop () override;\n\t\tvoid dviSetChar0 (uint32_t c, const Font *font) override;\n\t\tvoid dviSetChar (uint32_t c, const Font *font) override;\n\t\tvoid dviPutChar (uint32_t c, const Font *font) override;\n\t\tvoid dviSetRule (double h, double w) override;\n\t\tvoid dviPutRule (double h, double w) override;\n\t\tvoid dviPop () override;\n\t\tvoid dviFontNum (uint32_t fontnum, SetFontMode mode, const Font *font) override;\n\t\tvoid dviDir (WritingMode dir) override;\n\t\tvoid dviXXX (const std::string &str) override;\n\t\tvoid dviXGlyphArray (std::vector &dx, std::vector &dy, std::vector &glyphs, const Font &font) override;\n\t\tvoid dviXGlyphString (std::vector &dx, std::vector &glyphs, const Font &font) override;\n\t\tvoid dviXTextAndGlyphs (std::vector &dx, std::vector &dy, std::vector &chars, std::vector &glyphs, const Font &font) override;\n\n\tprivate:\n\t\tSVGTree _svg;\n\t\tSVGOutputBase &_out;\n\t\tstd::unique_ptr _actions;\n\t\tstd::string _bboxFormatString; ///< bounding box size/format set by the user\n\t\tstd::string _transCmds; ///< page transformation commands set by the user\n\t\tstd::string _userMessage; ///< message printed after conversion of a page\n\t\tdouble _pageHeight=0, _pageWidth=0; ///< global page height and width stored in the postamble\n\t\tdouble _tx=0, _ty=0; ///< translation of cursor position\n\t\tdouble _prevXPos, _prevYPos; ///< previous cursor position\n\t\tWritingMode _prevWritingMode; ///< previous writing mode\n\t\tstd::streampos _pageByte=0; ///< position of the stream pointer relative to the preceding bop (in bytes)\n};\n\n#endif\n" }, { "path": "src/DVIToSVGActions.cpp", "content": "/*************************************************************************\n** DVIToSVGActions.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \n#include \n#include \"BoundingBox.hpp\"\n#include \"DVIToSVG.hpp\"\n#include \"DVIToSVGActions.hpp\"\n#include \"Font.hpp\"\n#include \"FontManager.hpp\"\n#include \"GlyphTracerMessages.hpp\"\n#include \"System.hpp\"\n#include \"utility.hpp\"\n\nusing namespace std;\n\n\nvoid DVIToSVGActions::reset () {\n\tFontManager::instance().resetUsedChars();\n\t_bbox.invalidate();\n\t_bgcolor = Color(0, Color::ColorSpace::TRANSPARENT);\n}\n\n\n/** Change current horizontal position.\n * @param[in] x new horizontal position\n * @param[in] forceSVGMove if true, creates an explicit position change in the SVG tree */\nvoid DVIToSVGActions::moveToX (double x, bool forceSVGMove) {\n\tSpecialManager::instance().notifyPositionChange(getX(), getY(), *this);\n\tif (forceSVGMove)\n\t\t_svg.setX(x);\n}\n\n\n/** Change current vertical position.\n * @param[in] y new vertical position\n * @param[in] forceSVGMove if true, creates an explicit position change in the SVG tree */\nvoid DVIToSVGActions::moveToY (double y, bool forceSVGMove) {\n\tSpecialManager::instance().notifyPositionChange(getX(), getY(), *this);\n\tif (forceSVGMove)\n\t\t_svg.setY(y);\n}\n\n\nFilePath DVIToSVGActions::getSVGFilePath (unsigned pageno) const {\n\tFilePath path;\n\tif (auto dvi2svg = dynamic_cast(_dvireader))\n\t\tpath = dvi2svg->getSVGFilePath(pageno);\n\treturn path;\n}\n\n\nstring DVIToSVGActions::getBBoxFormatString () const {\n\tstring boxstr;\n\tif (auto dvi2svg = dynamic_cast(_dvireader))\n\t\tboxstr = dvi2svg->getUserBBoxString();\n\treturn boxstr;\n}\n\n\n/** This method is called when a \"set char\" command was found in the DVI file.\n * It draws a character of the current font.\n * @param[in] x horizontal position of left bounding box edge\n * @param[in] y vertical position of the character's baseline\n * @param[in] c character code relative to the current font\n * @param[in] vertical true if we're in vertical mode\n * @param[in] font font to be used */\nvoid DVIToSVGActions::setChar (double x, double y, unsigned c, bool vertical, const Font &font) {\n\tif (_outputLocked)\n\t\treturn;\n\n\t// If we use SVG fonts there is no need to record all font name/char/size combinations\n\t// because the SVG font mechanism handles this automatically. It's sufficient to\n\t// record font names and chars. The various font sizes can be ignored here.\n\t// For a given font object, Font::uniqueFont() returns the same unique font object for\n\t// all fonts with the same name.\n\tFontManager::instance().addUsedChar(font, c);\n\t_svg.appendChar(c, x, y);\n\n\tstatic string fontname;\n\tGlyphTracerMessages callback(fontname != font.name(), false);\n\tfontname = font.name();\n\n\tGlyphMetrics metrics;\n\tfont.getGlyphMetrics(c, vertical, metrics);\n\tauto pf = font_cast(&font);\n\tif (PhysicalFont::EXACT_BBOX && pf) {\n\t\tGlyphMetrics exact_metrics;\n\t\tpf->getExactGlyphBox(c, exact_metrics, vertical, &callback);\n\t\tif (vertical) {\n\t\t\t// move top of bbox to upper margin of glyph (just an approximation yet)\n\t\t\ty += (metrics.d-exact_metrics.h-exact_metrics.d)/2;\n\t\t}\n\t\tmetrics = exact_metrics;\n\t}\n\tBoundingBox bbox(x-metrics.wl, y-metrics.h, x+metrics.wr, y+metrics.d);\n\n\t// update bounding box\n\tif (!getMatrix().isIdentity())\n\t\tbbox.transform(getMatrix());\n\tembed(bbox);\n#if 0\n\tauto rect = util::make_unique(\"rect\");\n\trect->addAttribute(\"x\", x-metrics.wl);\n\trect->addAttribute(\"y\", y-metrics.h);\n\trect->addAttribute(\"width\", metrics.wl+metrics.wr);\n\trect->addAttribute(\"height\", metrics.h+metrics.d);\n\trect->addAttribute(\"fill\", \"none\");\n\trect->addAttribute(\"stroke\", \"red\");\n\trect->addAttribute(\"stroke-width\", \"0.5\");\n\t_svg.appendToPage(std::move(rect));\n\tif (metrics.d > 0) {\n\t\tauto line = util::make_unique(\"line\");\n\t\tline->addAttribute(\"x1\", x-metrics.wl);\n\t\tline->addAttribute(\"y1\", y);\n\t\tline->addAttribute(\"x2\", x+metrics.wr);\n\t\tline->addAttribute(\"y2\", y);\n\t\tline->addAttribute(\"stroke\", \"blue\");\n\t\tline->addAttribute(\"stroke-width\", \"0.5\");\n\t\t_svg.appendToPage(std::move(line));\n\t}\n\tif (metrics.wl > 0) {\n\t\tauto line = util::make_unique(\"line\");\n\t\tline->addAttribute(\"x1\", x);\n\t\tline->addAttribute(\"y1\", y-metrics.h);\n\t\tline->addAttribute(\"x2\", x);\n\t\tline->addAttribute(\"y2\", y+metrics.d);\n\t\tline->addAttribute(\"stroke\", \"blue\");\n\t\tline->addAttribute(\"stroke-width\", \"0.5\");\n\t\t_svg.appendToPage(std::move(line));\n\t}\n#endif\n}\n\n\n/** This method is called when a \"set rule\" or \"put rule\" command was found in the\n * DVI file. It draws a solid unrotated rectangle.\n * @param[in] x horizontal position of left edge\n * @param[in] y vertical position of bottom(!) edge\n * @param[in] height length of the vertical edges\n * @param[in] width length of the horizontal edges */\nvoid DVIToSVGActions::setRule (double x, double y, double height, double width) {\n\tif (_outputLocked)\n\t\treturn;\n\n\t// (x,y) is the lower left corner of the rectangle\n\tauto rect = util::make_unique(\"rect\");\n\trect->addAttribute(\"x\", x);\n\trect->addAttribute(\"y\", y-height);\n\trect->addAttribute(\"height\", height);\n\trect->addAttribute(\"width\", width);\n\trect->setTransform(getMatrix());\n\trect->setFillColor(_svg.getFillColor());\n\t_svg.appendToPage(std::move(rect));\n\n\t// update bounding box\n\tBoundingBox bb(x, y-height, x+width, y);\n\tif (!getMatrix().isIdentity())\n\t\tbb.transform(getMatrix());\n\tembed(bb);\n}\n\n\n/** This method is called when a \"set font\" command was found in the DVI file. The\n * font must be previously defined.\n * @param[in] num unique number of the font in the DVI file (not necessarily equal to the DVI font number)\n * @param[in] font pointer to the font object (always represents a physical font and never a virtual font) */\nvoid DVIToSVGActions::setFont (int num, const Font &font) {\n\t_svg.setFont(num, font);\n}\n\n\n/** This method is called when a \"special\" command was found in the DVI file.\n * @param[in] spc the special expression\n * @param[in] dvi2bp factor to scale DVI units to PS points\n * @param[in] preprocessing if true, the DVI file is being pre-processed */\nvoid DVIToSVGActions::special (const string &spc, double dvi2bp, bool preprocessing) {\n\ttry {\n\t\tif (preprocessing)\n\t\t\tSpecialManager::instance().preprocess(spc, *this);\n\t\telse\n\t\t\tSpecialManager::instance().process(spc, dvi2bp, *this);\n\t\t// @@ output message in case of unsupported specials?\n\t}\n\tcatch (const SpecialException &e) {\n\t\tMessage::estream(true) << \"error in special: \" << e.what() << '\\n';\n\t}\n}\n\n\n/** This method is called when a \"begin of page (bop)\" command was found in the DVI file.\n * @param[in] pageno physical page number */\nvoid DVIToSVGActions::beginPage (unsigned pageno, const vector&) {\n\t_svg.newPage(++_pageCount);\n\t_bbox = BoundingBox(); // clear bounding box\n\t_boxes.clear();\n\tsetMatrix(Matrix(1));\n\tSpecialManager::instance().notifyBeginPage(pageno, *this);\n}\n\n\n/** This method is called when an \"end of page (eop)\" command was found in the DVI file. */\nvoid DVIToSVGActions::endPage (unsigned pageno) {\n\ttry {\n\t\tSpecialManager::instance().notifyEndPage(pageno, *this);\n\t}\n\tcatch (const SpecialException &e) {\n\t\tMessage::estream(true) << \"error in special: \" << e.what() << '\\n';\n\t}\n\tMatrix matrix = _dvireader->getPageTransformation();\n\t_svg.transformPage(matrix);\n\tif (!_bgcolor.isTransparent()) {\n\t\t// create a rectangle filled with the background color\n\t\tauto rect = util::make_unique(\"rect\");\n\t\trect->addAttribute(\"x\", _bbox.minX());\n\t\trect->addAttribute(\"y\", _bbox.minY());\n\t\trect->addAttribute(\"width\", _bbox.width());\n\t\trect->addAttribute(\"height\", _bbox.height());\n\t\trect->setFillColor(_bgcolor);\n\t\t_svg.prependToPage(std::move(rect));\n\t}\n}\n\n\nvoid DVIToSVGActions::setBgColor (const Color &color) {\n\t_bgcolor = color;\n}\n\n\nvoid DVIToSVGActions::embed (const BoundingBox &bbox) {\n\t_bbox.embed(bbox);\n\tfor (auto &strboxpair : _boxes)\n\t\tstrboxpair.second.embed(bbox);\n}\n\n\nvoid DVIToSVGActions::embed (const DPair& p, double r) {\n\tif (r == 0)\n\t\t_bbox.embed(p);\n\telse\n\t\t_bbox.embed(p, r);\n\tfor (auto &strboxpair : _boxes)\n\t\tstrboxpair.second.embed(p, r);\n}\n\n\nBoundingBox& DVIToSVGActions::bbox (const string& name, bool reset) {\n\tBoundingBox &box = _boxes[name];\n\tif (reset)\n\t\tbox = BoundingBox();\n\treturn box;\n}\n\n\n/** This method is called by subprocesses like the PS handler when\n * a computation step has finished. Since the total number of steps\n * can't be determined in advance, we don't show a percent value but\n * a rotating dash. */\nvoid DVIToSVGActions::progress (const char *id) {\n\tif (PROGRESSBAR_DELAY < 1000) {\n\t\tstatic double time=System::time();\n\t\t// slow down updating the progress indicator to prevent flickering\n\t\tif (System::time() - time > 0.1) {\n\t\t\tprogress(0, 0, id);\n\t\t\ttime = System::time();\n\t\t}\n\t}\n}\n\n\n/** Returns the number of digits of a given integer. */\nstatic int digits (int n) {\n\tif (n == 0)\n\t\treturn 1;\n\tif (n > 0)\n\t\treturn util::ilog10(n)+1;\n\treturn util::ilog10(-n)+2;\n}\n\n\n/** Draws a simple progress indicator.\n * @param[in] current current iteration step (of 'total' steps)\n * @param[in] total total number of iteration steps\n * @param[in] id ID of the subprocess providing the information */\nvoid DVIToSVGActions::progress (size_t current, size_t total, const char *id) {\n\tstatic double time=0;\n\tstatic bool draw=false; // show progress indicator?\n\tstatic const char *prev_id=nullptr;\n\tif (current == 0 && total > 0) {\n\t\ttime = System::time();\n\t\tdraw = false;\n\t\tMessage::mstream() << '\\n';\n\t}\n\t// don't show the progress indicator before the given time has elapsed\n\tif (!draw && System::time()-time > PROGRESSBAR_DELAY) {\n\t\tdraw = true;\n\t\tTerminal::cursor(false);\n\t}\n\tif (draw && (System::time() - time > 0.1 || (total > 0 && current == total) || prev_id != id)) {\n\t\tstatic int step = -1; // >=0: rotating dash\n\t\tstatic size_t prev_current=0, prev_total=1;\n\t\tconst char *tips = \"-\\\\|/\";\n\t\tif (total == 0) {\n\t\t\tcurrent = prev_current;\n\t\t\ttotal = prev_total;\n\t\t\tstep = (step+1) % 4;\n\t\t}\n\t\telse {\n\t\t\tprev_current = current;\n\t\t\tprev_total = total;\n\t\t\tstep = -1;\n\t\t}\n\t\t// adapt length of progress indicator to terminal width\n\t\tint cols = Terminal::columns();\n\t\tint width = (cols == 0 || cols > 60) ? 50 : 49-60+cols;\n\t\tdouble factor = double(current)/double(total);\n\t\tint length = int(width*factor);\n\t\tMessage::mstream(false, Message::MC_PROGRESS)\n\t\t\t<< '[' << string(length, '=')\n\t\t\t<< (factor < 1.0 ? (step < 0 ? ' ' : tips[step]) : '=')\n\t\t\t<< string(width-length, ' ')\n\t\t\t<< \"] \" << string(3-digits(int(100*factor)), ' ') << int(100*factor)\n\t\t\t<< \"%\\r\";\n\t\t// overprint indicator when finished\n\t\tif (factor == 1.0) {\n\t\t\tMessage::estream().clearline();\n\t\t\tTerminal::cursor(true);\n\t\t}\n\t\ttime = System::time();\n\t\tprev_id = id;\n\t}\n}\n" }, { "path": "src/DVIToSVGActions.hpp", "content": "/*************************************************************************\n** DVIToSVGActions.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef DVITOSVGACTIONS_HPP\n#define DVITOSVGACTIONS_HPP\n\n#include \n#include \n#include \"BoundingBox.hpp\"\n#include \"DVIActions.hpp\"\n#include \"Matrix.hpp\"\n#include \"SpecialActions.hpp\"\n#include \"SpecialManager.hpp\"\n#include \"SVGTree.hpp\"\n\n\nclass DVIToSVG;\nclass FileFinder;\nclass Font;\nclass XMLNode;\n\nclass DVIToSVGActions : public DVIActions, public SpecialActions {\n\tusing BoxMap = std::unordered_map;\n\n\tpublic:\n\t\tDVIToSVGActions (DVIToSVG &dvisvg, SVGTree &svg) : _svg(svg), _dvireader(&dvisvg) {}\n\t\tvoid reset () override;\n\t\tvoid setChar (double x, double y, unsigned c, bool vertical, const Font &f) override;\n\t\tvoid setRule (double x, double y, double height, double width) override;\n\t\tvoid setBgColor (const Color &color) override;\n\t\tvoid setFillColor (const Color &color) override {_svg.setFillColor(color);}\n\t\tvoid setStrokeColor (const Color &color) override {_svg.setStrokeColor(color);}\n\t\tvoid setMatrix (const Matrix &m) override {_svg.setMatrix(m);}\n\t\tvoid setOpacity (const Opacity &opacity) override {_svg.setOpacity(opacity);}\n\t\tconst Opacity& getOpacity () const override {return _svg.getOpacity();}\n\t\tconst Matrix& getMatrix () const override {return _svg.getMatrix();}\n\t\tMatrix getPageTransformation () const override {return _dvireader->getPageTransformation();}\n\t\tColor getFillColor () const override {return _svg.getFillColor();}\n\t\tColor getStrokeColor () const override {return _svg.getStrokeColor();}\n\t\tint getDVIStackDepth () const override {return _dvireader->stackDepth();}\n\t\tunsigned getCurrentPageNumber () const override {return _dvireader->currentPageNumber();}\n\t\tvoid setTextOrientation (bool vertical) override {_svg.setVertical(vertical);}\n\t\tvoid moveToX (double x, bool forceSVGMove) override;\n\t\tvoid moveToY (double y, bool forceSVGMove) override;\n\t\tvoid setFont (int num, const Font &font) override;\n\t\tvoid special (const std::string &spc, double dvi2bp, bool preprocessing=false) override;\n\t\tvoid beginPage (unsigned pageno, const std::vector &c) override;\n\t\tvoid endPage (unsigned pageno) override;\n\t\tvoid progress (size_t current, size_t total, const char *id=nullptr) override;\n\t\tvoid progress (const char *id) override;\n\t\tdouble getX() const override {return _dvireader->getXPos();}\n\t\tdouble getY() const override {return _dvireader->getYPos();}\n\t\tvoid setX (double x) override {_dvireader->translateToX(x); _svg.setX(x);}\n\t\tvoid setY (double y) override {_dvireader->translateToY(y); _svg.setY(y);}\n\t\tvoid finishLine () override {_dvireader->finishLine();}\n\t\tvoid lockOutput () override {_outputLocked = true;}\n\t\tvoid unlockOutput () override {_outputLocked = false;}\n\t\tbool outputLocked () const override {return _outputLocked;}\n\t\tconst SVGTree& svgTree () const override {return _svg;}\n\t\tBoundingBox& bbox () override {return _bbox;}\n\t\tBoundingBox& bbox (const std::string &name, bool reset=false) override;\n\t\tvoid embed (const BoundingBox &bbox) override;\n\t\tvoid embed (const DPair &p, double r=0) override;\n\t\tFilePath getSVGFilePath (unsigned pageno) const override;\n\t\tstd::string getBBoxFormatString () const override;\n\t\tvoid setDVIReader (BasicDVIReader &r) {_dvireader = &r;}\n\n\tprivate:\n\t\tSVGTree &_svg;\n\t\tBasicDVIReader *_dvireader;\n\t\tBoundingBox _bbox;\n\t\tint _pageCount=0;\n\t\tColor _bgcolor=Color(0, Color::ColorSpace::TRANSPARENT);\n\t\tBoxMap _boxes;\n\t\tbool _outputLocked=false;\n};\n\n\n#endif\n" }, { "path": "src/Directory.cpp", "content": "/*************************************************************************\n** Directory.cpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#include \"Directory.hpp\"\n\nusing namespace std;\n\n#ifndef _WIN32\n\t#include \n\t#include \n#endif\n\n\nDirectory::Directory () {\n#ifdef _WIN32\n\tmemset(&_fileData, 0, sizeof(WIN32_FIND_DATA));\n#endif\n}\n\n\nDirectory::Directory (const string &dirname) : Directory() {\n\topen(dirname);\n}\n\n\nDirectory::~Directory () {\n\tclose();\n}\n\n\nbool Directory::open (string dirname) {\n\t_dirname = dirname;\n#ifdef _WIN32\n\tif (dirname.empty())\n\t\treturn false;\n\t_firstread = true;\n\tif (dirname.back() == '/' || dirname.back() == '\\\\')\n\t\tdirname.pop_back();\n\tdirname += \"\\\\*\";\n\t_handle = FindFirstFile(dirname.c_str(), &_fileData);\n\treturn _handle != INVALID_HANDLE_VALUE;\n#else\n\t_dir = opendir(_dirname.c_str());\n\treturn bool(_dir);\n#endif\n}\n\n\nvoid Directory::close () {\n#ifdef _WIN32\n\tFindClose(_handle);\n#else\n\tif (_dir) {\n\t\tclosedir(_dir);\n\t\t_dir = nullptr;\n\t}\n#endif\n}\n\n\n/** Reads first/next directory entry.\n * @param[in] type type of entry to return (a: file or dir, f: file, d: dir)\n * @return name of entry */\nconst char* Directory::read (EntryType type) {\n#ifdef _WIN32\n\tif (_handle == INVALID_HANDLE_VALUE)\n\t\treturn nullptr;\n\twhile (_firstread || FindNextFile(_handle, &_fileData)) {\n\t\t_firstread = false;\n\t\tif (_fileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {\n\t\t\tif (type == ET_FILE_OR_DIR || type == ET_DIR)\n\t\t\t\treturn _fileData.cFileName;\n\t\t}\n\t\telse if (type == ET_FILE_OR_DIR || type == ET_FILE)\n\t\t\treturn _fileData.cFileName;\n\t}\n\tFindClose(_handle);\n\t_handle = INVALID_HANDLE_VALUE;\n\treturn nullptr;\n#else\n\tif (_dir) {\n\t\twhile ((_dirent = readdir(_dir))) {\n\t\t\tstring path = _dirname + \"/\" + _dirent->d_name;\n\t\t\tstruct stat stats;\n\t\t\tif (stat(path.c_str(), &stats) == 0) {\n\t\t\t\tif (S_ISDIR(stats.st_mode)) {\n\t\t\t\t\tif (type == ET_FILE_OR_DIR || type == ET_DIR)\n\t\t\t\t\t\treturn _dirent->d_name;\n\t\t\t\t}\n\t\t\t\telse if (type == ET_FILE_OR_DIR || type == ET_FILE)\n\t\t\t\t\treturn _dirent->d_name;\n\t\t\t}\n\t\t}\n\t\tclosedir(_dir);\n\t\t_dir = nullptr;\n\t}\n\treturn nullptr;\n#endif\n}\n\n\n" }, { "path": "src/Directory.hpp", "content": "/*************************************************************************\n** Directory.hpp **\n** **\n** This file is part of dvisvgm -- a fast DVI to SVG converter **\n** Copyright (C) 2005-2025 Martin Gieseking **\n** **\n** This program is free software; you can redistribute it and/or **\n** modify it under the terms of the GNU General Public License as **\n** published by the Free Software Foundation; either version 3 of **\n** the License, or (at your option) any later version. **\n** **\n** This program is distributed in the hope that it will be useful, but **\n** WITHOUT ANY WARRANTY; without even the implied warranty of **\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the **\n** GNU General Public License for more details. **\n** **\n** You should have received a copy of the GNU General Public License **\n** along with this program; if not, see . **\n*************************************************************************/\n\n#ifndef DIRECTORY_HPP\n#define DIRECTORY_HPP\n\n#include \n#ifdef _WIN32\n\t#include \"windows.hpp\"\n#else\n\t#include \n#endif\n\nclass Directory {\n\tpublic:\n\t\tenum EntryType {ET_FILE, ET_DIR, ET_FILE_OR_DIR};\n\n\tpublic:\n\t\tDirectory ();\n\t\texplicit Directory (const std::string &path);\n\t\t~Directory ();\n\t\tbool open (std::string path);\n\t\tvoid close ();\n\t\tconst char* read (EntryType type=ET_FILE_OR_DIR);\n\n\tprivate:\n\t\tstd::string _dirname;\n#ifdef _WIN32\n\t\tbool _firstread=true;\n\t\tHANDLE _handle=INVALID_HANDLE_VALUE;\n\t\tWIN32_FIND_DATA _fileData;\n#else\n\t\tDIR *_dir=nullptr;\n\t\tstruct dirent *_dirent=nullptr;\n#endif\n};\n\n#endif\n" }, { "path": "src/Doxyfile", "content": "# Doxyfile 1.8.6\n\n# This file describes the settings to be used by the documentation system\n# doxygen (www.doxygen.org) for a project.\n#\n# All text after a double hash (##) is considered a comment and is placed in\n# front of the TAG it is preceding.\n#\n# All text after a single hash (#) is considered a comment and will be ignored.\n# The format is:\n# TAG = value [value, ...]\n# For lists, items can also be appended using:\n# TAG += value [value, ...]\n# Values that contain spaces should be placed between quotes (\\\" \\\").\n\n#---------------------------------------------------------------------------\n# Project related configuration options\n#---------------------------------------------------------------------------\n\n# This tag specifies the encoding used for all characters in the config file\n# that follow. The default is UTF-8 which is also the encoding used for all text\n# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv\n# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv\n# for the list of possible encodings.\n# The default value is: UTF-8.\n\nDOXYFILE_ENCODING = UTF-8\n\n# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by\n# double-quotes, unless you are using Doxywizard) that should identify the\n# project for which the documentation is generated. This name is used in the\n# title of most generated pages and in a few other places.\n# The default value is: My Project.\n\nPROJECT_NAME = dvisvgm\n\n# The PROJECT_NUMBER tag can be used to enter a project or revision number. This\n# could be handy for archiving the generated documentation or if some version\n# control system is used.\n\nPROJECT_NUMBER = 3.6\n\n# Using the PROJECT_BRIEF tag one can provide an optional one line description\n# for a project that appears at the top of each page and should give viewer a\n# quick idea about the purpose of the project. Keep the description short.\n\nPROJECT_BRIEF = \n\n# With the PROJECT_LOGO tag one can specify an logo or icon that is included in\n# the documentation. The maximum height of the logo should not exceed 55 pixels\n# and the maximum width should not exceed 200 pixels. Doxygen will copy the logo\n# to the output directory.\n\nPROJECT_LOGO = \n\n# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path\n# into which the generated documentation will be written. If a relative path is\n# entered, it will be relative to the location where doxygen was started. If\n# left blank the current directory will be used.\n\nOUTPUT_DIRECTORY = doxy\n\n# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create 4096 sub-\n# directories (in 2 levels) under the output directory of each output format and\n# will distribute the generated files over these directories. Enabling this\n# option can be useful when feeding doxygen a huge amount of source files, where\n# putting all generated files in the same directory would otherwise causes\n# performance problems for the file system.\n# The default value is: NO.\n\nCREATE_SUBDIRS = NO\n\n# The OUTPUT_LANGUAGE tag is used to specify the language in which all\n# documentation generated by doxygen is written. Doxygen will use this\n# information to generate all constant output in the proper language.\n# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,\n# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),\n# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,\n# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),\n# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,\n# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,\n# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,\n# Ukrainian and Vietnamese.\n# The default value is: English.\n\nOUTPUT_LANGUAGE = English\n\n# If the BRIEF_MEMBER_DESC tag is set to YES doxygen will include brief member\n# descriptions after the members that are listed in the file and class\n# documentation (similar to Javadoc). Set to NO to disable this.\n# The default value is: YES.\n\nBRIEF_MEMBER_DESC = YES\n\n# If the REPEAT_BRIEF tag is set to YES doxygen will prepend the brief\n# description of a member or function before the detailed description\n#\n# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the\n# brief descriptions will be completely suppressed.\n# The default value is: YES.\n\nREPEAT_BRIEF = YES\n\n# This tag implements a quasi-intelligent brief description abbreviator that is\n# used to form the text in various listings. Each string in this list, if found\n# as the leading text of the brief description, will be stripped from the text\n# and the result, after processing the whole list, is used as the annotated\n# text. Otherwise, the brief description is used as-is. If left blank, the\n# following values are used ($name is automatically replaced with the name of\n# the entity):The $name class, The $name widget, The $name file, is, provides,\n# specifies, contains, represents, a, an and the.\n\nABBREVIATE_BRIEF = \"The $name class\" \\\n \"The $name widget\" \\\n \"The $name file\" \\\n is \\\n provides \\\n specifies \\\n contains \\\n represents \\\n a \\\n an \\\n the\n\n# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then\n# doxygen will generate a detailed section even if there is only a brief\n# description.\n# The default value is: NO.\n\nALWAYS_DETAILED_SEC = NO\n\n# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all\n# inherited members of a class in the documentation of that class as if those\n# members were ordinary class members. Constructors, destructors and assignment\n# operators of the base classes will not be shown.\n# The default value is: NO.\n\nINLINE_INHERITED_MEMB = NO\n\n# If the FULL_PATH_NAMES tag is set to YES doxygen will prepend the full path\n# before files name in the file list and in the header files. If set to NO the\n# shortest path that makes the file name unique will be used\n# The default value is: YES.\n\nFULL_PATH_NAMES = YES\n\n# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.\n# Stripping is only done if one of the specified strings matches the left-hand\n# part of the path. The tag can be used to show relative paths in the file list.\n# If left blank the directory from which doxygen is run is used as the path to\n# strip.\n#\n# Note that you can specify absolute paths here, but also relative paths, which\n# will be relative from the directory where doxygen is started.\n# This tag requires that the tag FULL_PATH_NAMES is set to YES.\n\nSTRIP_FROM_PATH = /home/mgieseki/develop/cpp/dvisvgm-hg/src/\n\n# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the\n# path mentioned in the documentation of a class, which tells the reader which\n# header file to include in order to use a class. If left blank only the name of\n# the header file containing the class definition is used. Otherwise one should\n# specify the list of include paths that are normally passed to the compiler\n# using the -I flag.\n\nSTRIP_FROM_INC_PATH = \n\n# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but\n# less readable) file names. This can be useful is your file systems doesn't\n# support long names like on DOS, Mac, or CD-ROM.\n# The default value is: NO.\n\nSHORT_NAMES = NO\n\n# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the\n# first line (until the first dot) of a Javadoc-style comment as the brief\n# description. If set to NO, the Javadoc-style will behave just like regular Qt-\n# style comments (thus requiring an explicit @brief command for a brief\n# description.)\n# The default value is: NO.\n\nJAVADOC_AUTOBRIEF = NO\n\n# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first\n# line (until the first dot) of a Qt-style comment as the brief description. If\n# set to NO, the Qt-style will behave just like regular Qt-style comments (thus\n# requiring an explicit \\brief command for a brief description.)\n# The default value is: NO.\n\nQT_AUTOBRIEF = NO\n\n# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a\n# multi-line C++ special comment block (i.e. a block of //! or /// comments) as\n# a brief description. This used to be the default behavior. The new default is\n# to treat a multi-line C++ comment block as a detailed description. Set this\n# tag to YES if you prefer the old behavior instead.\n#\n# Note that setting this tag to YES also means that rational rose comments are\n# not recognized any more.\n# The default value is: NO.\n\nMULTILINE_CPP_IS_BRIEF = NO\n\n# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the\n# documentation from any documented member that it re-implements.\n# The default value is: YES.\n\nINHERIT_DOCS = YES\n\n# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce a\n# new page for each member. If set to NO, the documentation of a member will be\n# part of the file/class/namespace that contains it.\n# The default value is: NO.\n\nSEPARATE_MEMBER_PAGES = NO\n\n# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen\n# uses this value to replace tabs by spaces in code fragments.\n# Minimum value: 1, maximum value: 16, default value: 4.\n\nTAB_SIZE = 4\n\n# This tag can be used to specify a number of aliases that act as commands in\n# the documentation. An alias has the form:\n# name=value\n# For example adding\n# \"sideeffect=@par Side Effects:\\n\"\n# will allow you to put the command \\sideeffect (or @sideeffect) in the\n# documentation, which will result in a user-defined paragraph with heading\n# \"Side Effects:\". You can put \\n's in the value part of an alias to insert\n# newlines.\n\nALIASES = \n\n# This tag can be used to specify a number of word-keyword mappings (TCL only).\n# A mapping has the form \"name=value\". For example adding \"class=itcl::class\"\n# will allow you to use the command class in the itcl::class meaning.\n\nTCL_SUBST = \n\n# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources\n# only. Doxygen will then generate output that is more tailored for C. For\n# instance, some of the names that are used will be different. The list of all\n# members will be omitted, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_FOR_C = NO\n\n# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or\n# Python sources only. Doxygen will then generate output that is more tailored\n# for that language. For instance, namespaces will be presented as packages,\n# qualified scopes will look different, etc.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_JAVA = NO\n\n# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran\n# sources. Doxygen will then generate output that is tailored for Fortran.\n# The default value is: NO.\n\nOPTIMIZE_FOR_FORTRAN = NO\n\n# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL\n# sources. Doxygen will then generate output that is tailored for VHDL.\n# The default value is: NO.\n\nOPTIMIZE_OUTPUT_VHDL = NO\n\n# Doxygen selects the parser to use depending on the extension of the files it\n# parses. With this tag you can assign which parser to use for a given\n# extension. Doxygen has a built-in mapping, but you can override or extend it\n# using this tag. The format is ext=language, where ext is a file extension, and\n# language is one of the parsers supported by doxygen: IDL, Java, Javascript,\n# C#, C, C++, D, PHP, Objective-C, Python, Fortran, VHDL. For instance to make\n# doxygen treat .inc files as Fortran files (default is PHP), and .f files as C\n# (default is Fortran), use: inc=Fortran f=C.\n#\n# Note For files without extension you can use no_extension as a placeholder.\n#\n# Note that for custom extensions you also need to set FILE_PATTERNS otherwise\n# the files are not read by doxygen.\n\nEXTENSION_MAPPING = \n\n# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments\n# according to the Markdown format, which allows for more readable\n# documentation. See http://daringfireball.net/projects/markdown/ for details.\n# The output of markdown processing is further processed by doxygen, so you can\n# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in\n# case of backward compatibilities issues.\n# The default value is: YES.\n\nMARKDOWN_SUPPORT = YES\n\n# When enabled doxygen tries to link words that correspond to documented\n# classes, or namespaces to their corresponding documentation. Such a link can\n# be prevented in individual cases by by putting a % sign in front of the word\n# or globally by setting AUTOLINK_SUPPORT to NO.\n# The default value is: YES.\n\nAUTOLINK_SUPPORT = YES\n\n# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want\n# to include (a tag file for) the STL sources as input, then you should set this\n# tag to YES in order to let doxygen match functions declarations and\n# definitions whose arguments contain STL classes (e.g. func(std::string);\n# versus func(std::string) {}). This also make the inheritance and collaboration\n# diagrams that involve STL classes more complete and accurate.\n# The default value is: NO.\n\nBUILTIN_STL_SUPPORT = NO\n\n# If you use Microsoft's C++/CLI language, you should set this option to YES to\n# enable parsing support.\n# The default value is: NO.\n\nCPP_CLI_SUPPORT = NO\n\n# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:\n# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen\n# will parse them like normal C++ but will assume all classes use public instead\n# of private inheritance when no explicit protection keyword is present.\n# The default value is: NO.\n\nSIP_SUPPORT = NO\n\n# For Microsoft's IDL there are propget and propput attributes to indicate\n# getter and setter methods for a property. Setting this option to YES will make\n# doxygen to replace the get and set methods by a property in the documentation.\n# This will only work if the methods are indeed getting or setting a simple\n# type. If this is not the case, or you want to show the methods anyway, you\n# should set this option to NO.\n# The default value is: YES.\n\nIDL_PROPERTY_SUPPORT = YES\n\n# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC\n# tag is set to YES, then doxygen will reuse the documentation of the first\n# member in the group (if any) for the other members of the group. By default\n# all members of a group must be documented explicitly.\n# The default value is: NO.\n\nDISTRIBUTE_GROUP_DOC = NO\n\n# Set the SUBGROUPING tag to YES to allow class member groups of the same type\n# (for instance a group of public functions) to be put as a subgroup of that\n# type (e.g. under the Public Functions section). Set it to NO to prevent\n# subgrouping. Alternatively, this can be done per class using the\n# \\nosubgrouping command.\n# The default value is: YES.\n\nSUBGROUPING = YES\n\n# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions\n# are shown inside the group in which they are included (e.g. using \\ingroup)\n# instead of on a separate page (for HTML and Man pages) or section (for LaTeX\n# and RTF).\n#\n# Note that this feature does not work in combination with\n# SEPARATE_MEMBER_PAGES.\n# The default value is: NO.\n\nINLINE_GROUPED_CLASSES = NO\n\n# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions\n# with only public data fields or simple typedef fields will be shown inline in\n# the documentation of the scope in which they are defined (i.e. file,\n# namespace, or group documentation), provided this scope is documented. If set\n# to NO, structs, classes, and unions are shown on a separate page (for HTML and\n# Man pages) or section (for LaTeX and RTF).\n# The default value is: NO.\n\nINLINE_SIMPLE_STRUCTS = NO\n\n# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or\n# enum is documented as struct, union, or enum with the name of the typedef. So\n# typedef struct TypeS {} TypeT, will appear in the documentation as a struct\n# with name TypeT. When disabled the typedef will appear as a member of a file,\n# namespace, or class. And the struct will be named TypeS. This can typically be\n# useful for C code in case the coding convention dictates that all compound\n# types are typedef'ed and only the typedef is referenced, never the tag name.\n# The default value is: NO.\n\nTYPEDEF_HIDES_STRUCT = NO\n\n# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This\n# cache is used to resolve symbols given their name and scope. Since this can be\n# an expensive process and often the same symbol appears multiple times in the\n# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small\n# doxygen will become slower. If the cache is too large, memory is wasted. The\n# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range\n# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536\n# symbols. At the end of a run doxygen will report the cache usage and suggest\n# the optimal cache size from a speed point of view.\n# Minimum value: 0, maximum value: 9, default value: 0.\n\nLOOKUP_CACHE_SIZE = 0\n\n#---------------------------------------------------------------------------\n# Build related configuration options\n#---------------------------------------------------------------------------\n\n# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in\n# documentation are documented, even if no documentation was available. Private\n# class members and static file members will be hidden unless the\n# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.\n# Note: This will also disable the warnings about undocumented members that are\n# normally produced when WARNINGS is set to YES.\n# The default value is: NO.\n\nEXTRACT_ALL = YES\n\n# If the EXTRACT_PRIVATE tag is set to YES all private members of a class will\n# be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PRIVATE = YES\n\n# If the EXTRACT_PACKAGE tag is set to YES all members with package or internal\n# scope will be included in the documentation.\n# The default value is: NO.\n\nEXTRACT_PACKAGE = NO\n\n# If the EXTRACT_STATIC tag is set to YES all static members of a file will be\n# included in the documentation.\n# The default value is: NO.\n\nEXTRACT_STATIC = YES\n\n# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) defined\n# locally in source files will be included in the documentation. If set to NO\n# only classes defined in header files are included. Does not have any effect\n# for Java sources.\n# The default value is: YES.\n\nEXTRACT_LOCAL_CLASSES = YES\n\n# This flag is only useful for Objective-C code. When set to YES local methods,\n# which are defined in the implementation section but not in the interface are\n# included in the documentation. If set to NO only methods in the interface are\n# included.\n# The default value is: NO.\n\nEXTRACT_LOCAL_METHODS = YES\n\n# If this flag is set to YES, the members of anonymous namespaces will be\n# extracted and appear in the documentation as a namespace called\n# 'anonymous_namespace{file}', where file will be replaced with the base name of\n# the file that contains the anonymous namespace. By default anonymous namespace\n# are hidden.\n# The default value is: NO.\n\nEXTRACT_ANON_NSPACES = NO\n\n# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all\n# undocumented members inside documented classes or files. If set to NO these\n# members will be included in the various overviews, but no documentation\n# section is generated. This option has no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_MEMBERS = NO\n\n# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all\n# undocumented classes that are normally visible in the class hierarchy. If set\n# to NO these classes will be included in the various overviews. This option has\n# no effect if EXTRACT_ALL is enabled.\n# The default value is: NO.\n\nHIDE_UNDOC_CLASSES = NO\n\n# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend\n# (class|struct|union) declarations. If set to NO these declarations will be\n# included in the documentation.\n# The default value is: NO.\n\nHIDE_FRIEND_COMPOUNDS = NO\n\n# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any\n# documentation blocks found inside the body of a function. If set to NO these\n# blocks will be appended to the function's detailed documentation block.\n# The default value is: NO.\n\nHIDE_IN_BODY_DOCS = NO\n\n# The INTERNAL_DOCS tag determines if documentation that is typed after a\n# \\internal command is included. If the tag is set to NO then the documentation\n# will be excluded. Set it to YES to include the internal documentation.\n# The default value is: NO.\n\nINTERNAL_DOCS = YES\n\n# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file\n# names in lower-case letters. If set to YES upper-case letters are also\n# allowed. This is useful if you have classes or files whose names only differ\n# in case and if your file system supports case sensitive file names. Windows\n# and Mac users are advised to set this option to NO.\n# The default value is: system dependent.\n\nCASE_SENSE_NAMES = YES\n\n# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with\n# their full class and namespace scopes in the documentation. If set to YES the\n# scope will be hidden.\n# The default value is: NO.\n\nHIDE_SCOPE_NAMES = NO\n\n# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of\n# the files that are included by a file in the documentation of that file.\n# The default value is: YES.\n\nSHOW_INCLUDE_FILES = YES\n\n# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each\n# grouped member an include statement to the documentation, telling the reader\n# which file to include in order to use the member.\n# The default value is: NO.\n\nSHOW_GROUPED_MEMB_INC = NO\n\n# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include\n# files with double quotes in the documentation rather than with sharp brackets.\n# The default value is: NO.\n\nFORCE_LOCAL_INCLUDES = NO\n\n# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the\n# documentation for inline members.\n# The default value is: YES.\n\nINLINE_INFO = YES\n\n# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the\n# (detailed) documentation of file and class members alphabetically by member\n# name. If set to NO the members will appear in declaration order.\n# The default value is: YES.\n\nSORT_MEMBER_DOCS = YES\n\n# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief\n# descriptions of file, namespace and class members alphabetically by member\n# name. If set to NO the members will appear in declaration order. Note that\n# this will also influence the order of the classes in the class list.\n# The default value is: NO.\n\nSORT_BRIEF_DOCS = NO\n\n# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the\n# (brief and detailed) documentation of class members so that constructors and\n# destructors are listed first. If set to NO the constructors will appear in the\n# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.\n# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief\n# member documentation.\n# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting\n# detailed member documentation.\n# The default value is: NO.\n\nSORT_MEMBERS_CTORS_1ST = NO\n\n# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy\n# of group names into alphabetical order. If set to NO the group names will\n# appear in their defined order.\n# The default value is: NO.\n\nSORT_GROUP_NAMES = NO\n\n# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by\n# fully-qualified names, including namespaces. If set to NO, the class list will\n# be sorted only by class name, not including the namespace part.\n# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.\n# Note: This option applies only to the class list, not to the alphabetical\n# list.\n# The default value is: NO.\n\nSORT_BY_SCOPE_NAME = NO\n\n# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper\n# type resolution of all parameters of a function it will reject a match between\n# the prototype and the implementation of a member function even if there is\n# only one candidate or it is obvious which candidate to choose by doing a\n# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still\n# accept a match between prototype and implementation in such cases.\n# The default value is: NO.\n\nSTRICT_PROTO_MATCHING = NO\n\n# The GENERATE_TODOLIST tag can be used to enable ( YES) or disable ( NO) the\n# todo list. This list is created by putting \\todo commands in the\n# documentation.\n# The default value is: YES.\n\nGENERATE_TODOLIST = YES\n\n# The GENERATE_TESTLIST tag can be used to enable ( YES) or disable ( NO) the\n# test list. This list is created by putting \\test commands in the\n# documentation.\n# The default value is: YES.\n\nGENERATE_TESTLIST = YES\n\n# The GENERATE_BUGLIST tag can be used to enable ( YES) or disable ( NO) the bug\n# list. This list is created by putting \\bug commands in the documentation.\n# The default value is: YES.\n\nGENERATE_BUGLIST = YES\n\n# The GENERATE_DEPRECATEDLIST tag can be used to enable ( YES) or disable ( NO)\n# the deprecated list. This list is created by putting \\deprecated commands in\n# the documentation.\n# The default value is: YES.\n\nGENERATE_DEPRECATEDLIST= YES\n\n# The ENABLED_SECTIONS tag can be used to enable conditional documentation\n# sections, marked by \\if ... \\endif and \\cond \n# ... \\endcond blocks.\n\nENABLED_SECTIONS = \n\n# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the\n# initial value of a variable or macro / define can have for it to appear in the\n# documentation. If the initializer consists of more lines than specified here\n# it will be hidden. Use a value of 0 to hide initializers completely. The\n# appearance of the value of individual variables and macros / defines can be\n# controlled using \\showinitializer or \\hideinitializer command in the\n# documentation regardless of this setting.\n# Minimum value: 0, maximum value: 10000, default value: 30.\n\nMAX_INITIALIZER_LINES = 30\n\n# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at\n# the bottom of the documentation of classes and structs. If set to YES the list\n# will mention the files that were used to generate the documentation.\n# The default value is: YES.\n\nSHOW_USED_FILES = YES\n\n# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This\n# will remove the Files entry from the Quick Index and from the Folder Tree View\n# (if specified).\n# The default value is: YES.\n\nSHOW_FILES = YES\n\n# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces\n# page. This will remove the Namespaces entry from the Quick Index and from the\n# Folder Tree View (if specified).\n# The default value is: YES.\n\nSHOW_NAMESPACES = YES\n\n# The FILE_VERSION_FILTER tag can be used to specify a program or script that\n# doxygen should invoke to get the current version for each file (typically from\n# the version control system). Doxygen will invoke the program by executing (via\n# popen()) the command command input-file, where command is the value of the\n# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided\n# by doxygen. Whatever the program writes to standard output is used as the file\n# version. For an example see the documentation.\n\nFILE_VERSION_FILTER = \n\n# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed\n# by doxygen. The layout file controls the global structure of the generated\n# output files in an output format independent way. To create the layout file\n# that represents doxygen's defaults, run doxygen with the -l option. You can\n# optionally specify a file name after the option, if omitted DoxygenLayout.xml\n# will be used as the name of the layout file.\n#\n# Note that if you run doxygen from a directory containing a file called\n# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE\n# tag is left empty.\n\nLAYOUT_FILE = \n\n# The CITE_BIB_FILES tag can be used to specify one or more bib files containing\n# the reference definitions. This must be a list of .bib files. The .bib\n# extension is automatically appended if omitted. This requires the bibtex tool\n# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.\n# For LaTeX the style of the bibliography can be controlled using\n# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the\n# search path. Do not use file names with spaces, bibtex cannot handle them. See\n# also \\cite for info how to create references.\n\nCITE_BIB_FILES = \n\n#---------------------------------------------------------------------------\n# Configuration options related to warning and progress messages\n#---------------------------------------------------------------------------\n\n# The QUIET tag can be used to turn on/off the messages that are generated to\n# standard output by doxygen. If QUIET is set to YES this implies that the\n# messages are off.\n# The default value is: NO.\n\nQUIET = NO\n\n# The WARNINGS tag can be used to turn on/off the warning messages that are\n# generated to standard error ( stderr) by doxygen. If WARNINGS is set to YES\n# this implies that the warnings are on.\n#\n# Tip: Turn warnings on while writing the documentation.\n# The default value is: YES.\n\nWARNINGS = YES\n\n# If the WARN_IF_UNDOCUMENTED tag is set to YES, then doxygen will generate\n# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag\n# will automatically be disabled.\n# The default value is: YES.\n\nWARN_IF_UNDOCUMENTED = NO\n\n# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for\n# potential errors in the documentation, such as not documenting some parameters\n# in a documented function, or documenting parameters that don't exist or using\n# markup commands wrongly.\n# The default value is: YES.\n\nWARN_IF_DOC_ERROR = YES\n\n# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that\n# are documented, but have no documentation for their parameters or return\n# value. If set to NO doxygen will only warn about wrong or incomplete parameter\n# documentation, but not about the absence of documentation.\n# The default value is: NO.\n\nWARN_NO_PARAMDOC = YES\n\n# The WARN_FORMAT tag determines the format of the warning messages that doxygen\n# can produce. The string should contain the $file, $line, and $text tags, which\n# will be replaced by the file and line number from which the warning originated\n# and the warning text. Optionally the format may contain $version, which will\n# be replaced by the version of the file (if it could be obtained via\n# FILE_VERSION_FILTER)\n# The default value is: $file:$line: $text.\n\nWARN_FORMAT = \"$file:$line: $text\"\n\n# The WARN_LOGFILE tag can be used to specify a file to which warning and error\n# messages should be written. If left blank the output is written to standard\n# error (stderr).\n\nWARN_LOGFILE = \n\n#---------------------------------------------------------------------------\n# Configuration options related to the input files\n#---------------------------------------------------------------------------\n\n# The INPUT tag is used to specify the files and/or directories that contain\n# documented source files. You may enter file names like myfile.cpp or\n# directories like /usr/src/myproject. Separate the files or directories with\n# spaces.\n# Note: If this tag is empty the current directory is searched.\n\nINPUT = .\n\n# This tag can be used to specify the character encoding of the source files\n# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses\n# libiconv (or the iconv built into libc) for the transcoding. See the libiconv\n# documentation (see: http://www.gnu.org/software/libiconv) for the list of\n# possible encodings.\n# The default value is: UTF-8.\n\nINPUT_ENCODING = UTF-8\n\n# If the value of the INPUT tag contains directories, you can use the\n# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and\n# *.h) to filter out the source-files in the directories. If left blank the\n# following patterns are tested:*.c, *.cc, *.cxx, *.cpp, *.c++, *.java, *.ii,\n# *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, *.hh, *.hxx, *.hpp,\n# *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, *.m, *.markdown,\n# *.md, *.mm, *.dox, *.py, *.f90, *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf,\n# *.qsf, *.as and *.js.\n\nFILE_PATTERNS = *.c \\\n *.cc \\\n *.cxx \\\n *.cpp \\\n *.c++ \\\n *.d \\\n *.java \\\n *.ii \\\n *.ixx \\\n *.ipp \\\n *.i++ \\\n *.inl \\\n *.h \\\n *.hh \\\n *.hxx \\\n *.hpp \\\n *.h++ \\\n *.idl \\\n *.odl \\\n *.cs \\\n *.php \\\n *.php3 \\\n *.inc \\\n *.m \\\n *.mm \\\n *.dox \\\n *.py \\\n *.f90 \\\n *.f \\\n *.vhd \\\n *.vhdl \\\n *.C \\\n *.CC \\\n *.C++ \\\n *.II \\\n *.I++ \\\n *.H \\\n *.HH \\\n *.H++ \\\n *.CS \\\n *.PHP \\\n *.PHP3 \\\n *.M \\\n *.MM \\\n *.PY \\\n *.F90 \\\n *.F \\\n *.VHD \\\n *.VHDL\n\n# The RECURSIVE tag can be used to specify whether or not subdirectories should\n# be searched for input files as well.\n# The default value is: NO.\n\nRECURSIVE = YES\n\n# The EXCLUDE tag can be used to specify files and/or directories that should be\n# excluded from the INPUT source files. This way you can easily exclude a\n# subdirectory from a directory tree whose root is specified with the INPUT tag.\n#\n# Note that relative paths are relative to the directory from which doxygen is\n# run.\n\nEXCLUDE = \n\n# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or\n# directories that are symbolic links (a Unix file system feature) are excluded\n# from the input.\n# The default value is: NO.\n\nEXCLUDE_SYMLINKS = NO\n\n# If the value of the INPUT tag contains directories, you can use the\n# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude\n# certain files from those directories.\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories for example use the pattern */test/*\n\nEXCLUDE_PATTERNS = \n\n# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names\n# (namespaces, classes, functions, etc.) that should be excluded from the\n# output. The symbol name can be a fully qualified name, a word, or if the\n# wildcard * is used, a substring. Examples: ANamespace, AClass,\n# AClass::ANamespace, ANamespace::*Test\n#\n# Note that the wildcards are matched against the file with absolute path, so to\n# exclude all test directories use the pattern */test/*\n\nEXCLUDE_SYMBOLS = \n\n# The EXAMPLE_PATH tag can be used to specify one or more files or directories\n# that contain example code fragments that are included (see the \\include\n# command).\n\nEXAMPLE_PATH = \n\n# If the value of the EXAMPLE_PATH tag contains directories, you can use the\n# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and\n# *.h) to filter out the source-files in the directories. If left blank all\n# files are included.\n\nEXAMPLE_PATTERNS = *\n\n# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be\n# searched for input files to be used with the \\include or \\dontinclude commands\n# irrespective of the value of the RECURSIVE tag.\n# The default value is: NO.\n\nEXAMPLE_RECURSIVE = NO\n\n# The IMAGE_PATH tag can be used to specify one or more files or directories\n# that contain images that are to be included in the documentation (see the\n# \\image command).\n\nIMAGE_PATH = \n\n# The INPUT_FILTER tag can be used to specify a program that doxygen should\n# invoke to filter for each input file. Doxygen will invoke the filter program\n# by executing (via popen()) the command:\n#\n# \n#\n# where is the value of the INPUT_FILTER tag, and is the\n# name of an input file. Doxygen will then use the output that the filter\n# program writes to standard output. If FILTER_PATTERNS is specified, this tag\n# will be ignored.\n#\n# Note that the filter must not add or remove lines; it is applied before the\n# code is scanned, but not when the output code is generated. If lines are added\n# or removed, the anchors will not be placed correctly.\n\nINPUT_FILTER = \n\n# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern\n# basis. Doxygen will compare the file name with each pattern and apply the\n# filter if there is a match. The filters are a list of the form: pattern=filter\n# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how\n# filters are used. If the FILTER_PATTERNS tag is empty or if none of the\n# patterns match the file name, INPUT_FILTER is applied.\n\nFILTER_PATTERNS = \n\n# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using\n# INPUT_FILTER ) will also be used to filter the input files that are used for\n# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).\n# The default value is: NO.\n\nFILTER_SOURCE_FILES = NO\n\n# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file\n# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and\n# it is also possible to disable source filtering for a specific pattern using\n# *.ext= (so without naming a filter).\n# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.\n\nFILTER_SOURCE_PATTERNS = \n\n# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that\n# is part of the input, its contents will be placed on the main page\n# (index.html). This can be useful if you have a project on for instance GitHub\n# and want to reuse the introduction page also for the doxygen output.\n\nUSE_MDFILE_AS_MAINPAGE = \n\n#---------------------------------------------------------------------------\n# Configuration options related to source browsing\n#---------------------------------------------------------------------------\n\n# If the SOURCE_BROWSER tag is set to YES then a list of source files will be\n# generated. Documented entities will be cross-referenced with these sources.\n#\n# Note: To get rid of all source code in the generated output, make sure that\n# also VERBATIM_HEADERS is set to NO.\n# The default value is: NO.\n\nSOURCE_BROWSER = YES\n\n# Setting the INLINE_SOURCES tag to YES will include the body of functions,\n# classes and enums directly into the documentation.\n# The default value is: NO.\n\nINLINE_SOURCES = NO\n\n# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any\n# special comment blocks from generated source code fragments. Normal C, C++ and\n# Fortran comments will always remain visible.\n# The default value is: YES.\n\nSTRIP_CODE_COMMENTS = YES\n\n# If the REFERENCED_BY_RELATION tag is set to YES then for each documented\n# function all documented functions referencing it will be listed.\n# The default value is: NO.\n\nREFERENCED_BY_RELATION = NO\n\n# If the REFERENCES_RELATION tag is set to YES then for each documented function\n# all documented entities called/used by that function will be listed.\n# The default value is: NO.\n\nREFERENCES_RELATION = NO\n\n# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set\n# to YES, then the hyperlinks from functions in REFERENCES_RELATION and\n# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will\n# link to the documentation.\n# The default value is: YES.\n\nREFERENCES_LINK_SOURCE = YES\n\n# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the\n# source code will show a tooltip with additional information such as prototype,\n# brief description and links to the definition and documentation. Since this\n# will make the HTML file larger and loading of large files a bit slower, you\n# can opt to disable this feature.\n# The default value is: YES.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nSOURCE_TOOLTIPS = YES\n\n# If the USE_HTAGS tag is set to YES then the references to source code will\n# point to the HTML generated by the htags(1) tool instead of doxygen built-in\n# source browser. The htags tool is part of GNU's global source tagging system\n# (see http://www.gnu.org/software/global/global.html). You will need version\n# 4.8.6 or higher.\n#\n# To use it do the following:\n# - Install the latest version of global\n# - Enable SOURCE_BROWSER and USE_HTAGS in the config file\n# - Make sure the INPUT points to the root of the source tree\n# - Run doxygen as normal\n#\n# Doxygen will invoke htags (and that will in turn invoke gtags), so these\n# tools must be available from the command line (i.e. in the search path).\n#\n# The result: instead of the source browser generated by doxygen, the links to\n# source code will now point to the output of htags.\n# The default value is: NO.\n# This tag requires that the tag SOURCE_BROWSER is set to YES.\n\nUSE_HTAGS = NO\n\n# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a\n# verbatim copy of the header file for each class for which an include is\n# specified. Set to NO to disable this.\n# See also: Section \\class.\n# The default value is: YES.\n\nVERBATIM_HEADERS = NO\n\n#---------------------------------------------------------------------------\n# Configuration options related to the alphabetical class index\n#---------------------------------------------------------------------------\n\n# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all\n# compounds will be generated. Enable this if the project contains a lot of\n# classes, structs, unions or interfaces.\n# The default value is: YES.\n\nALPHABETICAL_INDEX = YES\n\n# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in\n# which the alphabetical index list will be split.\n# Minimum value: 1, maximum value: 20, default value: 5.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nCOLS_IN_ALPHA_INDEX = 5\n\n# In case all classes in a project start with a common prefix, all classes will\n# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag\n# can be used to specify a prefix (or a list of prefixes) that should be ignored\n# while generating the index headers.\n# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.\n\nIGNORE_PREFIX = \n\n#---------------------------------------------------------------------------\n# Configuration options related to the HTML output\n#---------------------------------------------------------------------------\n\n# If the GENERATE_HTML tag is set to YES doxygen will generate HTML output\n# The default value is: YES.\n\nGENERATE_HTML = YES\n\n# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a\n# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of\n# it.\n# The default directory is: html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_OUTPUT = html\n\n# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each\n# generated HTML page (for example: .htm, .php, .asp).\n# The default value is: .html.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FILE_EXTENSION = .html\n\n# The HTML_HEADER tag can be used to specify a user-defined HTML header file for\n# each generated HTML page. If the tag is left blank doxygen will generate a\n# standard header.\n#\n# To get valid HTML the header file that includes any scripts and style sheets\n# that doxygen needs, which is dependent on the configuration options used (e.g.\n# the setting GENERATE_TREEVIEW). It is highly recommended to start with a\n# default header using\n# doxygen -w html new_header.html new_footer.html new_stylesheet.css\n# YourConfigFile\n# and then modify the file new_header.html. See also section \"Doxygen usage\"\n# for information on how to generate the default header that doxygen normally\n# uses.\n# Note: The header is subject to change so you typically have to regenerate the\n# default header when upgrading to a newer version of doxygen. For a description\n# of the possible markers and block names see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_HEADER = \n\n# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each\n# generated HTML page. If the tag is left blank doxygen will generate a standard\n# footer. See HTML_HEADER for more information on how to generate a default\n# footer and what special commands can be used inside the footer. See also\n# section \"Doxygen usage\" for information on how to generate the default footer\n# that doxygen normally uses.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_FOOTER = \n\n# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style\n# sheet that is used by each HTML page. It can be used to fine-tune the look of\n# the HTML output. If left blank doxygen will generate a default style sheet.\n# See also section \"Doxygen usage\" for information on how to generate the style\n# sheet that doxygen normally uses.\n# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as\n# it is more robust and this tag (HTML_STYLESHEET) will in the future become\n# obsolete.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_STYLESHEET = \n\n# The HTML_EXTRA_STYLESHEET tag can be used to specify an additional user-\n# defined cascading style sheet that is included after the standard style sheets\n# created by doxygen. Using this option one can overrule certain style aspects.\n# This is preferred over using HTML_STYLESHEET since it does not replace the\n# standard style sheet and is therefore more robust against future updates.\n# Doxygen will copy the style sheet file to the output directory. For an example\n# see the documentation.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_STYLESHEET = \n\n# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or\n# other source files which should be copied to the HTML output directory. Note\n# that these files will be copied to the base HTML output directory. Use the\n# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these\n# files. In the HTML_STYLESHEET file, use the file name only. Also note that the\n# files will be copied as-is; there are no commands or markers available.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_EXTRA_FILES = \n\n# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen\n# will adjust the colors in the stylesheet and background images according to\n# this color. Hue is specified as an angle on a colorwheel, see\n# http://en.wikipedia.org/wiki/Hue for more information. For instance the value\n# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300\n# purple, and 360 is red again.\n# Minimum value: 0, maximum value: 359, default value: 220.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_HUE = 220\n\n# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors\n# in the HTML output. For a value of 0 the output will use grayscales only. A\n# value of 255 will produce the most vivid colors.\n# Minimum value: 0, maximum value: 255, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_SAT = 100\n\n# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the\n# luminance component of the colors in the HTML output. Values below 100\n# gradually make the output lighter, whereas values above 100 make the output\n# darker. The value divided by 100 is the actual gamma applied, so 80 represents\n# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not\n# change the gamma.\n# Minimum value: 40, maximum value: 240, default value: 80.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_COLORSTYLE_GAMMA = 80\n\n# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML\n# page will contain the date and time when the page was generated. Setting this\n# to NO can help when comparing the output of multiple runs.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_TIMESTAMP = YES\n\n# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML\n# documentation will contain sections that can be hidden and shown after the\n# page has loaded.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_DYNAMIC_SECTIONS = NO\n\n# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries\n# shown in the various tree structured indices initially; the user can expand\n# and collapse entries dynamically later on. Doxygen will expand the tree to\n# such a level that at most the specified number of entries are visible (unless\n# a fully collapsed tree already exceeds this amount). So setting the number of\n# entries 1 will produce a full collapsed tree by default. 0 is a special value\n# representing an infinite number of entries and will result in a full expanded\n# tree by default.\n# Minimum value: 0, maximum value: 9999, default value: 100.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nHTML_INDEX_NUM_ENTRIES = 100\n\n# If the GENERATE_DOCSET tag is set to YES, additional index files will be\n# generated that can be used as input for Apple's Xcode 3 integrated development\n# environment (see: http://developer.apple.com/tools/xcode/), introduced with\n# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a\n# Makefile in the HTML output directory. Running make will produce the docset in\n# that directory and running make install will install the docset in\n# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at\n# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html\n# for more information.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_DOCSET = NO\n\n# This tag determines the name of the docset feed. A documentation feed provides\n# an umbrella under which multiple documentation sets from a single provider\n# (such as a company or product suite) can be grouped.\n# The default value is: Doxygen generated docs.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_FEEDNAME = \"Doxygen generated docs\"\n\n# This tag specifies a string that should uniquely identify the documentation\n# set bundle. This should be a reverse domain-name style string, e.g.\n# com.mycompany.MyDocSet. Doxygen will append .docset to the name.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_BUNDLE_ID = org.doxygen.Project\n\n# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify\n# the documentation publisher. This should be a reverse domain-name style\n# string, e.g. com.mycompany.MyDocSet.documentation.\n# The default value is: org.doxygen.Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_ID = org.doxygen.Publisher\n\n# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.\n# The default value is: Publisher.\n# This tag requires that the tag GENERATE_DOCSET is set to YES.\n\nDOCSET_PUBLISHER_NAME = Publisher\n\n# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three\n# additional HTML index files: index.hhp, index.hhc, and index.hhk. The\n# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop\n# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on\n# Windows.\n#\n# The HTML Help Workshop contains a compiler that can convert all HTML output\n# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML\n# files are now used as the Windows 98 help format, and will replace the old\n# Windows help format (.hlp) on all Windows platforms in the future. Compressed\n# HTML files also contain an index, a table of contents, and you can search for\n# words in the documentation. The HTML workshop also contains a viewer for\n# compressed HTML files.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_HTMLHELP = NO\n\n# The CHM_FILE tag can be used to specify the file name of the resulting .chm\n# file. You can add a path in front of the file if the result should not be\n# written to the html output directory.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_FILE = \n\n# The HHC_LOCATION tag can be used to specify the location (absolute path\n# including file name) of the HTML help compiler ( hhc.exe). If non-empty\n# doxygen will try to run the HTML help compiler on the generated index.hhp.\n# The file has to be specified with full path.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nHHC_LOCATION = \n\n# The GENERATE_CHI flag controls if a separate .chi index file is generated (\n# YES) or that it should be included in the master .chm file ( NO).\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nGENERATE_CHI = NO\n\n# The CHM_INDEX_ENCODING is used to encode HtmlHelp index ( hhk), content ( hhc)\n# and project file content.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nCHM_INDEX_ENCODING = \n\n# The BINARY_TOC flag controls whether a binary table of contents is generated (\n# YES) or a normal table of contents ( NO) in the .chm file.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nBINARY_TOC = NO\n\n# The TOC_EXPAND flag can be set to YES to add extra items for group members to\n# the table of contents of the HTML help documentation and to the tree view.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTMLHELP is set to YES.\n\nTOC_EXPAND = NO\n\n# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and\n# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that\n# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help\n# (.qch) of the generated HTML documentation.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_QHP = NO\n\n# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify\n# the file name of the resulting .qch file. The path specified is relative to\n# the HTML output folder.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQCH_FILE = \n\n# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help\n# Project output. For more information please see Qt Help Project / Namespace\n# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_NAMESPACE = org.doxygen.Project\n\n# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt\n# Help Project output. For more information please see Qt Help Project / Virtual\n# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-\n# folders).\n# The default value is: doc.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_VIRTUAL_FOLDER = doc\n\n# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom\n# filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_NAME = \n\n# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the\n# custom filter to add. For more information please see Qt Help Project / Custom\n# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-\n# filters).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_CUST_FILTER_ATTRS = \n\n# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this\n# project's filter section matches. Qt Help Project / Filter Attributes (see:\n# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHP_SECT_FILTER_ATTRS = \n\n# The QHG_LOCATION tag can be used to specify the location of Qt's\n# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the\n# generated .qhp file.\n# This tag requires that the tag GENERATE_QHP is set to YES.\n\nQHG_LOCATION = \n\n# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be\n# generated, together with the HTML files, they form an Eclipse help plugin. To\n# install this plugin and make it available under the help contents menu in\n# Eclipse, the contents of the directory containing the HTML and XML files needs\n# to be copied into the plugins directory of eclipse. The name of the directory\n# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.\n# After copying Eclipse needs to be restarted before the help appears.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_ECLIPSEHELP = NO\n\n# A unique identifier for the Eclipse help plugin. When installing the plugin\n# the directory name containing the HTML and XML files should also have this\n# name. Each documentation set should have its own identifier.\n# The default value is: org.doxygen.Project.\n# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.\n\nECLIPSE_DOC_ID = org.doxygen.Project\n\n# If you want full control over the layout of the generated HTML pages it might\n# be necessary to disable the index and replace it with your own. The\n# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top\n# of each HTML page. A value of NO enables the index and the value YES disables\n# it. Since the tabs in the index contain the same information as the navigation\n# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nDISABLE_INDEX = NO\n\n# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index\n# structure should be generated to display hierarchical information. If the tag\n# value is set to YES, a side panel will be generated containing a tree-like\n# index structure (just like the one that is generated for HTML Help). For this\n# to work a browser that supports JavaScript, DHTML, CSS and frames is required\n# (i.e. any modern browser). Windows users are probably better off using the\n# HTML help feature. Via custom stylesheets (see HTML_EXTRA_STYLESHEET) one can\n# further fine-tune the look of the index. As an example, the default style\n# sheet generated by doxygen has an example that shows how to put an image at\n# the root of the tree instead of the PROJECT_NAME. Since the tree basically has\n# the same information as the tab index, you could consider setting\n# DISABLE_INDEX to YES when enabling this option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nGENERATE_TREEVIEW = NO\n\n# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that\n# doxygen will group on one line in the generated HTML documentation.\n#\n# Note that a value of 0 will completely suppress the enum values from appearing\n# in the overview section.\n# Minimum value: 0, maximum value: 20, default value: 4.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nENUM_VALUES_PER_LINE = 4\n\n# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used\n# to set the initial width (in pixels) of the frame in which the tree is shown.\n# Minimum value: 0, maximum value: 1500, default value: 250.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nTREEVIEW_WIDTH = 250\n\n# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open links to\n# external symbols imported via tag files in a separate window.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nEXT_LINKS_IN_WINDOW = NO\n\n# Use this tag to change the font size of LaTeX formulas included as images in\n# the HTML documentation. When you change the font size after a successful\n# doxygen run you need to manually remove any form_*.png images from the HTML\n# output directory to force them to be regenerated.\n# Minimum value: 8, maximum value: 50, default value: 10.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_FONTSIZE = 10\n\n# Use the FORMULA_TRANPARENT tag to determine whether or not the images\n# generated for formulas are transparent PNGs. Transparent PNGs are not\n# supported properly for IE 6.0, but are supported on all modern browsers.\n#\n# Note that when changing this option you need to delete any form_*.png files in\n# the HTML output directory before the changes have effect.\n# The default value is: YES.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nFORMULA_TRANSPARENT = YES\n\n# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see\n# http://www.mathjax.org) which uses client side Javascript for the rendering\n# instead of using prerendered bitmaps. Use this if you do not have LaTeX\n# installed or if you want to formulas look prettier in the HTML output. When\n# enabled you may also need to install MathJax separately and configure the path\n# to it using the MATHJAX_RELPATH option.\n# The default value is: NO.\n# This tag requires that the tag GENERATE_HTML is set to YES.\n\nUSE_MATHJAX = NO\n\n# When MathJax is enabled you can set the default output format to be used for\n# the MathJax output. See the MathJax site (see:\n# http://docs.mathjax.org/en/latest/output.html) for more details.\n# Possible values are: HTML-CSS (which is slower, but has the best\n# compatibility), NativeMML (i.e. MathML) and SVG.\n# The default value is: HTML-CSS.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_FORMAT = HTML-CSS\n\n# When MathJax is enabled you need to specify the location relative to the HTML\n# output directory using the MATHJAX_RELPATH option. The destination directory\n# should contain the MathJax.js script. For instance, if the mathjax directory\n# is located at the same level as the HTML output directory, then\n# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax\n# Content Delivery Network so you can quickly see the result without installing\n# MathJax. However, it is strongly recommended to install a local copy of\n# MathJax from http://www.mathjax.org before deployment.\n# The default value is: http://cdn.mathjax.org/mathjax/latest.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest\n\n# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax\n# extension names that should be enabled during MathJax rendering. For example\n# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_EXTENSIONS = \n\n# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces\n# of code that will be used on startup of the MathJax code. See the MathJax site\n# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an\n# example see the documentation.\n# This tag requires that the tag USE_MATHJAX is set to YES.\n\nMATHJAX_CODEFILE = \n\n# When the SEARCHENGINE tag is enabled doxygen will generate a search box for\n# the HTML output. The underlying search engine uses javascript and DHTML and\n# should work on any modern browser. Note that when using HTML help\n# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)\n# there is already a search function so this one should typically be disabled.\n# For large projects the javascript based search engine can be slow, then\n# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to\n# search using the keyboard; to jump to the search box use + S\n# (what the is depends on the OS and browser, but it is typically\n# , /