pax_global_header00006660000000000000000000000064143652527040014522gustar00rootroot0000000000000052 comment=caad5fb29bcc38a842addbac3c357becf3addf1e libimagequant-2.18.0/000077500000000000000000000000001436525270400144345ustar00rootroot00000000000000libimagequant-2.18.0/.gitignore000066400000000000000000000005211436525270400164220ustar00rootroot00000000000000config.mk imagequant.pc *.lo *.o *.a *.so.0 *.so *.bz2 *.dylib *.dylib.0 *.jnilib *.dSYM org/pngquant/*.class org/pngquant/*.h target/ msvc-dist/org/ msvc-dist/*.md msvc-dist/Makefile* msvc-dist/*.cs msvc-dist/*.xml msvc-dist/CHANGELOG msvc-dist/COPYRIGHT msvc-dist/configure msvc-dist/.gitignore quantized_example.png example lodepng.? libimagequant-2.18.0/.travis.yml000066400000000000000000000006741436525270400165540ustar00rootroot00000000000000matrix: include: - os: linux language: java jdk: oraclejdk9 env: CFLAGS="-fPIC" install: true script: make java - os: linux language: rust script: cargo build --verbose --all && cargo test --verbose --all - os: linux language: generic script: make static - os: linux language: generic script: ./configure --prefix=/tmp && make libimagequant.so && make install libimagequant-2.18.0/CHANGELOG000066400000000000000000000062231436525270400156510ustar00rootroot00000000000000version 4 --------- - rewritten in Rust - multi-threaded floyd-steinberg dithering gives 2x-3x remapping speed boost - better handling of remapping on top of backgrounds (for GIFs, gif.ski) - support for more than 256-colors (compile-time option) - WASM compatibility - the C API enables dithering by default Newer v3/v4 versions of the library are on crates.io: https://crates.io/crates/imagequant version 2.18 ------------ - improved handling of images with very few pixels with very diverse colors - added more perceptually-weighed color selection - dropped problematic omp_set_nested() - fixed a rare memory leak version 2.17 ------------ - quality improvement - ARM64 build fix version 2.16 ------------ - fixed LCMS2 error handling version 2.15 ------------ - speed and quality improvements version 2.14 ------------ - improved Rust API - quality improvements for remapping overlays over a background version 2.13 ------------ - support OpenMP in clang - dropped old Internet Explorer workarounds - speed and quality improvements version 2.12 ------------ - new liq_histogram_add_fixed_color() - faster for large/complex images - workarounds for Microsoft's outdated C compiler version 2.11 ------------ - new liq_image_set_background() for high-quality remapping of GIF frames - new liq_image_set_importance_map() for controlling which parts of the image get more palette colors - improved OpenMP support version 2.10 ----------- - supports building with Rust/Cargo version 2.9 ----------- - new liq_histogram_add_colors() version 2.8 ----------- - standalone version - added Java interface (JNI) - new API for remapping multiple images to a single shared palette version 2.7 ----------- - improved dithering of saturated and semitransparent colors - libimagequant reports detailed progress and supports aborting of operations via callbacks - fixed order of log output when using openmp version 2.5 ----------- - replaced color search algorithm with vantage point tree, which is much faster and more reliable - deprecated IE6 workaround - warn when compiled without color profile support - improved support for predefined colors in libimagequant version 2.4 ----------- - fixed remapping of bright colors when dithering - added libimagequant API to add fixed preset colors to the palette version 2.3 ----------- - added ./configure script for better support of Intel C compiler and dependencies [thanks to pdknsk] - tweaked quality metric to better estimate quality of images with large solid backgrounds [thanks to Rolf Timmermans] - avoid applying quality setting to images that use palette already version 2.2 ----------- - OpenMP acceleration - improved support for Intel C Compiler, speedup in 32-bit GCC, and some workarounds for Visual Studio's incomplete C support version 2.1 ----------- - option to generate posterized output (for use with 16-bit textures) version 2.0 ----------- - refactored codebase into pngquant and standalone libimagequant - reduced memory usage by further 30% (and more for very large images) - less precise remapping improving speed by 25% in higher speed settings - fixed regression in dithering of alpha channel libimagequant-2.18.0/CMakeLists.txt000066400000000000000000000024561436525270400172030ustar00rootroot00000000000000cmake_minimum_required(VERSION 2.6) file(READ version.txt VERSION) project(imagequant C) if(${CMAKE_SYSTEM_PROCESSOR} STREQUAL ARM64) option(BUILD_WITH_SSE "Use SSE" OFF) else() option(BUILD_WITH_SSE "Use SSE" ON) endif() if(BUILD_WITH_SSE) add_definitions(-DUSE_SSE=1) endif() find_package(OpenMP) if(OPENMP_FOUND) set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} ${OpenMP_C_FLAGS}") set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${OpenMP_CXX_FLAGS}") endif() include_directories(${CMAKE_SOURCE_DIR}) if(CMAKE_COMPILER_IS_GNUCC) add_compile_options("-std=c99") endif() add_library(imagequant SHARED libimagequant.c blur.c mediancut.c mempool.c nearest.c pam.c kmeans.c ) add_library(imagequant_a STATIC libimagequant.c blur.c mediancut.c mempool.c nearest.c pam.c kmeans.c ) set_target_properties(imagequant PROPERTIES SOVERSION 0 VERSION 0.0) set(PREFIX ${CMAKE_INSTALL_PREFIX}) configure_file(imagequant.pc.in imagequant.pc @ONLY) install(TARGETS imagequant LIBRARY DESTINATION ${LIB_INSTALL_DIR}) install(FILES libimagequant.h DESTINATION include) install(FILES ${CMAKE_BINARY_DIR}/libimagequant_a.a DESTINATION ${LIB_INSTALL_DIR} RENAME libimagequant.a) install(FILES ${CMAKE_BINARY_DIR}/imagequant.pc DESTINATION ${LIB_INSTALL_DIR}/pkgconfig) libimagequant-2.18.0/CODE_OF_CONDUCT.md000066400000000000000000000062331436525270400172370ustar00rootroot00000000000000# Contributor Covenant Code of Conduct ## Our Pledge In the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation. ## Our Standards Examples of behavior that contributes to creating a positive environment include: * Using welcoming and inclusive language * Being respectful of differing viewpoints and experiences * Gracefully accepting constructive criticism * Focusing on what is best for the community * Showing empathy towards other community members Examples of unacceptable behavior by participants include: * The use of sexualized language or imagery and unwelcome sexual attention or advances * Trolling, insulting/derogatory comments, and personal or political attacks * Public or private harassment * Publishing others' private information, such as a physical or electronic address, without explicit permission * Other conduct which could reasonably be considered inappropriate in a professional setting ## Our Responsibilities Project maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior. Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful. ## Scope This Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers. ## Enforcement Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at kornel@geekhood.net. All complaints will be reviewed and investigated and will result in a response that is deemed necessary and appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately. Project maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership. ## Attribution This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version] [homepage]: http://contributor-covenant.org [version]: http://contributor-covenant.org/version/1/4/ libimagequant-2.18.0/CONTRIBUTING.md000066400000000000000000000027211436525270400166670ustar00rootroot00000000000000 Thank you for contributing! pngquant and libimagequant are licensed under multiple licenses, so to make things clear, I'm accepting contributions as licensed under the BSD 2-clause license: Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. libimagequant-2.18.0/COPYRIGHT000066400000000000000000001010321436525270400157240ustar00rootroot00000000000000 libimagequant is derived from code by Jef Poskanzer and Greg Roelofs licensed under pngquant's original license (at the end of this file), and contains extensive changes and additions by Kornel Lesiński licensed under GPL v3 or later. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - libimagequant © 2009-2018 by Kornel Lesiński. GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - © 1989, 1991 by Jef Poskanzer. © 1997, 2000, 2002 by Greg Roelofs. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. This software is provided "as is" without express or implied warranty. libimagequant-2.18.0/Cargo.toml000066400000000000000000000023421436525270400163650ustar00rootroot00000000000000# Please upgrade to v4 of the library [package] version = "3.1.4+sys2.18.0" authors = ["Kornel Lesiński "] build = "rust-sys/build.rs" categories = ["external-ffi-bindings"] homepage = "https://pngquant.org/lib" include = ["COPYRIGHT", "rust-sys/*", "*.c", "*.h", "README.md", "Cargo.toml"] keywords = ["pngquant"] license = "GPL-3.0-or-later" links = "imagequant" name = "imagequant-sys" readme = "README.md" repository = "https://github.com/ImageOptim/libimagequant" description = "Statically linked C part of imagequant library powering tools such as pngquant.\n\nThis library is dual-licensed like pngquant: either GPL or a commercial license. See website for details: https://pngquant.org" edition = "2018" [build-dependencies] cc = "1.0.71" [dependencies] rgb = "0.8.29" bitflags = "1.3.2" [dependencies.openmp-sys] optional = true version = "1.2.0" [features] default = ["sse"] openmp = ["openmp-sys"] openmp-static = ["openmp", "openmp-sys/static"] sse = [] [lib] crate-type = ["cdylib", "staticlib", "lib"] name = "imagequant_sys" path = "rust-sys/libimagequant.rs" doctest = false [dev-dependencies] lodepng = "3.4.7" imagequant = { path = "./rust-api" } [profile.bench] debug = 1 split-debuginfo = 'unpacked' libimagequant-2.18.0/Makefile000066400000000000000000000104261436525270400160770ustar00rootroot00000000000000-include config.mk STATICLIB=libimagequant.a SHAREDLIB=libimagequant.$(SOLIBSUFFIX) SOVER=0 ifeq ($(SOLIBSUFFIX),dylib) SHAREDLIBVER=libimagequant.$(SOVER).$(SOLIBSUFFIX) FIX_INSTALL_NAME=install_name_tool -id $(LIBDIR)/$(SHAREDLIBVER) $(DESTDIR)$(LIBDIR)/$(SHAREDLIBVER) else SHAREDLIBVER=libimagequant.$(SOLIBSUFFIX).$(SOVER) FIX_INSTALL_NAME= endif JNILIB=libimagequant.jnilib DLL=imagequant.dll DLLIMP=imagequant_dll.a DLLDEF=imagequant_dll.def JNIDLL=libimagequant.dll JNIDLLIMP=libimagequant_dll.a JNIDLLDEF=libimagequant_dll.def OBJS = pam.o mediancut.o blur.o remap.o mempool.o kmeans.o nearest.o libimagequant.o SHAREDOBJS = $(subst .o,.lo,$(OBJS)) JAVACLASSES = org/pngquant/LiqObject.class org/pngquant/PngQuant.class org/pngquant/Image.class org/pngquant/Result.class JAVAHEADERS = $(JAVACLASSES:.class=.h) JAVAINCLUDE = -I'$(JAVA_HOME)/include' -I'$(JAVA_HOME)/include/linux' -I'$(JAVA_HOME)/include/win32' -I'$(JAVA_HOME)/include/darwin' DISTFILES = $(OBJS:.o=.c) *.h README.md CHANGELOG COPYRIGHT Makefile configure imagequant.pc.in TARNAME = libimagequant-$(VERSION) TARFILE = $(TARNAME)-src.tar.bz2 PKGCONFIG = imagequant.pc all: static shared static: $(STATICLIB) shared: $(SHAREDLIB) dll: $(MAKE) CFLAGS="$(CFLAGS) -DIMAGEQUANT_EXPORTS" $(DLL) java: $(JNILIB) java-dll: $(MAKE) CFLAGS="$(CFLAGS) -DIMAGEQUANT_EXPORTS" $(JNIDLL) $(DLL) $(DLLIMP): $(OBJS) $(CC) -fPIC -shared -o $(DLL) $^ $(LDFLAGS) -Wl,--out-implib,$(DLLIMP),--output-def,$(DLLDEF) $(STATICLIB): $(OBJS) $(AR) $(ARFLAGS) $@ $^ $(SHAREDOBJS): $(CC) -fPIC $(CFLAGS) -c $(@:.lo=.c) -o $@ libimagequant.so: $(SHAREDOBJS) $(CC) -shared -Wl,-soname,$(SHAREDLIBVER) -o $(SHAREDLIBVER) $^ $(LDFLAGS) ln -fs $(SHAREDLIBVER) $(SHAREDLIB) libimagequant.dylib: $(SHAREDOBJS) $(CC) -shared -o $(SHAREDLIBVER) $^ $(LDFLAGS) ln -fs $(SHAREDLIBVER) $(SHAREDLIB) $(OBJS): $(wildcard *.h) config.mk $(JNILIB): $(JAVAHEADERS) $(STATICLIB) org/pngquant/PngQuant.c $(CC) -g $(CFLAGS) $(LDFLAGS) $(JAVAINCLUDE) -shared -o $@ org/pngquant/PngQuant.c $(STATICLIB) $(JNIDLL) $(JNIDLLIMP): $(JAVAHEADERS) $(OBJS) org/pngquant/PngQuant.c $(CC) -fPIC -shared -I. $(JAVAINCLUDE) -o $(JNIDLL) $^ $(LDFLAGS) -Wl,--out-implib,$(JNIDLLIMP),--output-def,$(JNIDLLDEF) $(JAVACLASSES): %.class: %.java javac $< $(JAVAHEADERS): %.h: %.class javah -o $@ $(subst /,., $(patsubst %.class,%,$<)) && touch $@ dist: $(TARFILE) cargo $(TARFILE): $(DISTFILES) rm -rf $(TARFILE) $(TARNAME) mkdir $(TARNAME) cp $(DISTFILES) $(TARNAME) tar -cjf $(TARFILE) --numeric-owner --exclude='._*' $(TARNAME) rm -rf $(TARNAME) -shasum $(TARFILE) cargo: rm -rf msvc-dist git clone . -b msvc msvc-dist rm -rf msvc-dist/Cargo.toml msvc-dist/org msvc-dist/rust msvc-dist/README.md msvc-dist/COPYRIGHT cargo test example: example.c lodepng.h lodepng.c $(STATICLIB) $(CC) -g $(CFLAGS) -Wall example.c $(STATICLIB) -o example -lm lodepng.h: curl -o lodepng.h -L https://raw.githubusercontent.com/lvandeve/lodepng/master/lodepng.h lodepng.c: curl -o lodepng.c -L https://raw.githubusercontent.com/lvandeve/lodepng/master/lodepng.cpp clean: rm -f $(OBJS) $(SHAREDOBJS) $(SHAREDLIBVER) $(SHAREDLIB) $(STATICLIB) $(TARFILE) $(DLL) '$(DLLIMP)' '$(DLLDEF)' rm -f $(JAVAHEADERS) $(JAVACLASSES) $(JNILIB) example rm -rf target rust-api/target rust-sys/target distclean: clean rm -f config.mk rm -f imagequant.pc install: all $(PKGCONFIG) install -d $(DESTDIR)$(LIBDIR) install -d $(DESTDIR)$(PKGCONFIGDIR) install -d $(DESTDIR)$(INCLUDEDIR) install -m 644 $(STATICLIB) $(DESTDIR)$(LIBDIR)/$(STATICLIB) install -m 755 $(SHAREDLIBVER) $(DESTDIR)$(LIBDIR)/$(SHAREDLIBVER) ln -sf $(SHAREDLIBVER) $(DESTDIR)$(LIBDIR)/$(SHAREDLIB) install -m 644 $(PKGCONFIG) $(DESTDIR)$(PKGCONFIGDIR)/$(PKGCONFIG) install -m 644 libimagequant.h $(DESTDIR)$(INCLUDEDIR)/libimagequant.h $(FIX_INSTALL_NAME) uninstall: rm -f $(DESTDIR)$(LIBDIR)/$(STATICLIB) rm -f $(DESTDIR)$(LIBDIR)/$(SHAREDLIBVER) rm -f $(DESTDIR)$(LIBDIR)/$(SHAREDLIB) rm -f $(DESTDIR)$(PKGCONFIGDIR)/$(PKGCONFIG) rm -f $(DESTDIR)$(INCLUDEDIR)/libimagequant.h config.mk: ifeq ($(filter %clean %distclean, $(MAKECMDGOALS)), ) ./configure endif $(PKGCONFIG): config.mk sed 's|@PREFIX@|$(PREFIX)|;s|@VERSION@|$(VERSION)|' < imagequant.pc.in > $(PKGCONFIG) .PHONY: all static shared clean dist distclean dll java cargo .DELETE_ON_ERROR: libimagequant-2.18.0/README.md000066400000000000000000001007301436525270400157140ustar00rootroot00000000000000# libimagequant—Image Quantization Library Small, portable C library for high-quality conversion of RGBA images to 8-bit indexed-color (palette) images. It's powering [pngquant2](https://pngquant.org). ## License Libimagequant is dual-licensed: * For Free/Libre Open Source Software it's available under GPL v3 or later with additional [copyright notices](https://raw.github.com/ImageOptim/libimagequant/master/COPYRIGHT) for older parts of the code. * For use in closed-source software, AppStore distribution, and other non-GPL uses, you can [obtain a commercial license](https://supso.org/projects/pngquant). Feel free to ask kornel@pngquant.org for details and custom licensing terms if you need them. ## Download The [library](https://pngquant.org/lib) is currently a part of the [pngquant2 project](https://pngquant.org). [Repository](https://github.com/ImageOptim/libimagequant). ## Compiling and Linking The library can be linked with ANSI C, C++, [C#](https://github.com/ImageOptim/libimagequant/blob/master/libimagequant.cs), [Rust](https://github.com/pornel/libimagequant-rust), [Java](https://github.com/ImageOptim/libimagequant/tree/master/org/pngquant) and [Golang](https://github.com/larrabee/go-imagequant) programs. It has no external dependencies. To build on Unix-like systems run: make static it will create `libimagequant.a` which you can link with your program. gcc yourprogram.c /path/to/libimagequant.a On BSD, use `gmake` (GNU make) rather than the native `make`. Alternatively you can compile the library with your program simply by including all `.c` files (and define `NDEBUG` to get a fast version): gcc -std=c99 -O3 -DNDEBUG libimagequant/*.c yourprogram.c ### Building for use in Rust programs In [Rust](https://www.rust-lang.org/) you can use Cargo to build the library. Add [`imagequant`](https://crates.io/crates/imagequant) to dependencies of the Rust program. You can also use `cargo build` in [`imagequant-sys`](https://crates.io/crates/imagequant-sys) to build `libimagequant.a` for any C-compatible language. ### Building for Java JNI To build Java JNI interface, ensure `JAVA_HOME` is set to your JDK directory, and run: # export JAVA_HOME=$(locate include/jni.h) # you may need to set JAVA_HOME first make java It will create `libimagequant.jnilib` and classes in `org/pngquant/`. On Windows run `make java-dll` and it'll create `libimagequant.dll` instead. ### Compiling on Windows/Visual Studio The library can be compiled with any C compiler that has at least basic support for C99 (GCC, clang, ICC, C++ Builder, even Tiny C Compiler), but Visual Studio 2012 and older are not up to date with the 1999 C standard. Use Visual Studio **2015** and the [MSVC-compatible branch of the library](https://github.com/ImageOptim/libimagequant/tree/msvc). To build on Windows, install CMake and use it to generate a makefile/project for your build system. Build instructions mkdir build cd build cmake .. cmake --build . To generate a 64-bit Visual Studio project instead: mkdir build cd build cmake -G "Visual Studio 15 2017 Win64" .. cmake --build . ### Building as shared library To build on Unix-like systems run: ./configure --prefix=/usr make libimagequant.so To install on Unix-like systems run: make install ## Overview The basic flow is: 1. Create attributes object and configure the library. 2. Create image object from RGBA pixels or data source. 3. Perform quantization (generate palette). 4. Store remapped image and final palette. 5. Free memory. Please note that libimagequant only handles raw uncompressed arrays of pixels in memory and is completely independent of any file format.

/* See example.c for the full code! */ #include "libimagequant.h" liq_attr *attr = liq_attr_create(); liq_image *image = liq_image_create_rgba(attr, example_bitmap_rgba, width, height, 0); liq_result *res; liq_image_quantize(image, attr, &res); liq_write_remapped_image(res, image, example_bitmap_8bpp, example_bitmap_size); const liq_palette *pal = liq_get_palette(res); // Save the image and the palette now. for(int i=0; i < pal->count; i++) { example_copy_palette_entry(pal->entries[i]); } // You'll need a PNG library to write to a file. example_write_image(example_bitmap_8bpp); liq_result_destroy(res); liq_image_destroy(image); liq_attr_destroy(attr); Functions returning `liq_error` return `LIQ_OK` (`0`) on success and non-zero on error. It's safe to pass `NULL` to any function accepting `liq_attr`, `liq_image`, `liq_result` (in that case the error code `LIQ_INVALID_POINTER` will be returned). These objects can be reused multiple times. There are 3 ways to create image object for quantization: * `liq_image_create_rgba()` for simple, contiguous RGBA pixel arrays (width×height×4 bytes large bitmap). * `liq_image_create_rgba_rows()` for non-contiguous RGBA pixel arrays (that have padding between rows or reverse order, e.g. BMP). * `liq_image_create_custom()` for RGB, ABGR, YUV and all other formats that can be converted on-the-fly to RGBA (you have to supply the conversion function). Note that "image" here means raw uncompressed pixels. If you have a compressed image file, such as PNG, you must use another library (e.g. libpng or lodepng) to decode it first. You'll find full example code in "example.c" file in the library source directory. ## Functions ---- liq_attr* liq_attr_create(void); Returns object that will hold initial settings (attributes) for the library. The object should be freed using `liq_attr_destroy()` after it's no longer needed. Returns `NULL` in the unlikely case that the library cannot run on the current machine (e.g. the library has been compiled for SSE-capable x86 CPU and run on VIA C3 CPU). ---- liq_error liq_set_max_colors(liq_attr* attr, int colors); Specifies maximum number of colors to use. The default is 256. Instead of setting a fixed limit it's better to use `liq_set_quality()`. The first argument is attributes object from `liq_attr_create()`. Returns `LIQ_VALUE_OUT_OF_RANGE` if number of colors is outside the range 2-256. ---- int liq_get_max_colors(liq_attr* attr); Returns the value set by `liq_set_max_colors()`. ---- liq_error liq_set_quality(liq_attr* attr, int minimum, int maximum); Quality is in range `0` (worst) to `100` (best) and values are analoguous to JPEG quality (i.e. `80` is usually good enough). Quantization will attempt to use the lowest number of colors needed to achieve `maximum` quality. `maximum` value of `100` is the default and means conversion as good as possible. If it's not possible to convert the image with at least `minimum` quality (i.e. 256 colors is not enough to meet the minimum quality), then `liq_image_quantize()` will fail. The default minimum is `0` (proceeds regardless of quality). Quality measures how well the generated palette fits image given to `liq_image_quantize()`. If a different image is remapped with `liq_write_remapped_image()` then actual quality may be different. Regardless of the quality settings the number of colors won't exceed the maximum (see `liq_set_max_colors()`). The first argument is attributes object from `liq_attr_create()`. Returns `LIQ_VALUE_OUT_OF_RANGE` if target is lower than minimum or any of them is outside the 0-100 range. Returns `LIQ_INVALID_POINTER` if `attr` appears to be invalid. liq_attr *attr = liq_attr_create(); liq_set_quality(attr, 50, 80); // use quality 80 if possible. Give up if quality drops below 50. ---- int liq_get_min_quality(liq_attr* attr); Returns the lower bound set by `liq_set_quality()`. ---- int liq_get_max_quality(liq_attr* attr); Returns the upper bound set by `liq_set_quality()`. ---- liq_image *liq_image_create_rgba(liq_attr *attr, void* pixels, int width, int height, double gamma); Creates an object that represents the image pixels to be used for quantization and remapping. The pixel array must be contiguous run of RGBA pixels (alpha is the last component, 0 = transparent, 255 = opaque). The first argument is attributes object from `liq_attr_create()`. The same `attr` object should be used for the entire process, from creation of images to quantization. The `pixels` array must not be modified or freed until this object is freed with `liq_image_destroy()`. See also `liq_image_set_memory_ownership()`. `width` and `height` are dimensions in pixels. An image 10x10 pixel large will need a 400-byte array. If the `gamma` argument is `0`, then the default of 1/2.2 [gamma](https://en.wikipedia.org/wiki/Gamma_correction) is assumed, which is good for most sRGB images. Otherwise `gamma` must be > 0 and < 1, e.g. `0.45455` (1/2.2) or `0.55555` (1/1.8). Generated palette will use the same gamma unless `liq_set_output_gamma()` is used. If `liq_set_output_gamma` is not used, then it only affects whether brighter or darker areas of the image will get more palette colors allocated. Returns `NULL` on failure, e.g. if `pixels` is `NULL` or `width`/`height` is <= 0. ---- liq_image *liq_image_create_rgba_rows(liq_attr *attr, void* rows[], int width, int height, double gamma); Same as `liq_image_create_rgba()`, but takes an array of pointers to rows of pixels. This allows defining images with reversed rows (like in BMP), "stride" different than width or using only fragment of a larger bitmap, etc. The `rows` array must have at least `height` elements, and each row must be at least `width` RGBA pixels wide. unsigned char *bitmap = …; void *rows = malloc(height * sizeof(void*)); int bytes_per_row = width * 4 + padding; // stride for(int i=0; i < height; i++) { rows[i] = bitmap + i * bytes_per_row; } liq_image *img = liq_image_create_rgba_rows(attr, rows, width, height, 0); // … liq_image_destroy(img); free(rows); The row pointers and pixels must not be modified or freed until this object is freed with `liq_image_destroy()` (you can change that with `liq_image_set_memory_ownership()`). See also `liq_image_create_rgba()` and `liq_image_create_custom()`. ---- liq_error liq_image_quantize(liq_image *const input_image, liq_attr *const attr, liq_result **out_result); Performs quantization (palette generation) based on settings in `attr` (from `liq_attr_create()`) and pixels of the image. Returns `LIQ_OK` if quantization succeeds and sets `liq_result` pointer in `out_result`. The last argument is used for receiving the `result` object: liq_result *result; if (LIQ_OK == liq_image_quantize(img, attr, &result)) { // Note &result // result pointer is valid here } Returns `LIQ_QUALITY_TOO_LOW` if quantization fails due to limit set in `liq_set_quality()`. See `liq_write_remapped_image()`. If you want to generate one palette for multiple images at once, see `liq_histogram_create()`. ---- liq_error liq_set_dithering_level(liq_result *res, float dither_level); Enables/disables dithering in `liq_write_remapped_image()`. Dithering level must be between `0` and `1` (inclusive). Dithering level `0` enables fast non-dithered remapping. Otherwise a variation of Floyd-Steinberg error diffusion is used. Precision of the dithering algorithm depends on the speed setting, see `liq_set_speed()`. Returns `LIQ_VALUE_OUT_OF_RANGE` if the dithering level is outside the 0-1 range. ---- liq_error liq_write_remapped_image(liq_result *result, liq_image *input_image, void *buffer, size_t buffer_size); Remaps the image to palette and writes its pixels to the given buffer, 1 pixel per byte. The buffer must be large enough to fit the entire image, i.e. width×height bytes large. For safety, pass the size of the buffer as `buffer_size`. For best performance call `liq_get_palette()` *after* this function, as palette is improved during remapping (except when `liq_histogram_quantize()` is used). Returns `LIQ_BUFFER_TOO_SMALL` if given size of the buffer is not enough to fit the entire image. int buffer_size = width*height; char *buffer = malloc(buffer_size); if (LIQ_OK == liq_write_remapped_image(result, input_image, buffer, buffer_size)) { liq_palette *pal = liq_get_palette(result); // save image } See `liq_get_palette()`. The buffer is assumed to be contiguous, with rows ordered from top to bottom, and no gaps between rows. If you need to write rows with padding or upside-down order, then use `liq_write_remapped_image_rows()`. Please note that it only writes raw uncompressed pixels to memory. It does not perform any PNG compression. If you'd like to create a PNG file then you need to pass the raw pixel data to another library, e.g. libpng or lodepng. See `rwpng.c` in `pngquant` project for an example how to do that. ---- const liq_palette *liq_get_palette(liq_result *result); Returns pointer to palette optimized for image that has been quantized or remapped (final refinements are applied to the palette during remapping). It's valid to call this method before remapping, if you don't plan to remap any images or want to use same palette for multiple images. `liq_palette->count` contains number of colors (up to 256), `liq_palette->entries[n]` contains RGBA value for nth palette color. The palette is **temporary and read-only**. You must copy the palette elsewhere *before* calling `liq_result_destroy()`. Returns `NULL` on error. ---- void liq_attr_destroy(liq_attr *); void liq_image_destroy(liq_image *); void liq_result_destroy(liq_result *); void liq_histogram_destroy(liq_histogram *); Releases memory owned by the given object. Object must not be used any more after it has been freed. Freeing `liq_result` also frees any `liq_palette` obtained from it. ## Advanced Functions ---- liq_error liq_set_speed(liq_attr* attr, int speed); Higher speed levels disable expensive algorithms and reduce quantization precision. The default speed is `4`. Speed `1` gives marginally better quality at significant CPU cost. Speed `10` has usually 5% lower quality, but is 8 times faster than the default. High speeds combined with `liq_set_quality()` will use more colors than necessary and will be less likely to meet minimum required quality.
Features dependent on speed
Noise-sensitive ditheringspeed 1 to 5
Forced posterization8-10 or if image has more than million colors
Quantization error known1-7 or if minimum quality is set
Additional quantization techniques1-6
Returns `LIQ_VALUE_OUT_OF_RANGE` if the speed is outside the 1-10 range. ---- int liq_get_speed(liq_attr* attr); Returns the value set by `liq_set_speed()`. ---- liq_error liq_set_min_opacity(liq_attr* attr, int min); This was a workaround for Internet Explorer 6, but because this browser is not used any more, this option has been deprecated and removed. ---- int liq_get_min_opacity(liq_attr* attr); This function has been deprecated. ---- liq_set_min_posterization(liq_attr* attr, int bits); Ignores given number of least significant bits in all channels, posterizing image to `2^bits` levels. `0` gives full quality. Use `2` for VGA or 16-bit RGB565 displays, `4` if image is going to be output on a RGB444/RGBA4444 display (e.g. low-quality textures on Android). Returns `LIQ_VALUE_OUT_OF_RANGE` if the value is outside the 0-4 range. ---- int liq_get_min_posterization(liq_attr* attr); Returns the value set by `liq_set_min_posterization()`. ---- liq_set_last_index_transparent(liq_attr* attr, int is_last); `0` (default) makes alpha colors sorted before opaque colors. Non-`0` mixes colors together except completely transparent color, which is moved to the end of the palette. This is a workaround for programs that blindly assume the last palette entry is transparent. ---- liq_image *liq_image_create_custom(liq_attr *attr, liq_image_get_rgba_row_callback *row_callback, void *user_info, int width, int height, double gamma);

void image_get_rgba_row_callback(liq_color row_out[], int row_index, int width, void *user_info) { for(int column_index=0; column_index < width; column_index++) { row_out[column_index] = /* generate pixel at (row_index, column_index) */; } } Creates image object that will use callback to read image data. This allows on-the-fly conversion of images that are not in the RGBA color space. `user_info` value will be passed to the callback. It may be useful for storing pointer to program's internal representation of the image. The callback must read/generate `row_index`-th row and write its RGBA pixels to the `row_out` array. Row `width` is given for convenience and will always equal to image width. The callback will be called multiple times for each row. Quantization and remapping require at least two full passes over image data, so caching of callback's work makes no sense — in such case it's better to convert entire image and use `liq_image_create_rgba()` instead. To use RGB image: void rgb_to_rgba_callback(liq_color row_out[], int row_index, int width, void *user_info) { unsigned char *rgb_row = ((unsigned char *)user_info) + 3*width*row_index; for(int i=0; i < width; i++) { row_out[i].r = rgb_row[i*3]; row_out[i].g = rgb_row[i*3+1]; row_out[i].b = rgb_row[i*3+2]; row_out[i].a = 255; } } liq_image *img = liq_image_create_custom(attr, rgb_to_rgba_callback, rgb_bitmap, width, height, 0); The library doesn't support RGB bitmaps "natively", because supporting only single format allows compiler to inline more code, 4-byte pixel alignment is faster, and SSE instructions operate on 4 values at once, so alpha support is almost free. ---- liq_error liq_image_set_memory_ownership(liq_image *image, int ownership_flags); Passes ownership of image pixel data and/or its rows array to the `liq_image` object, so you don't have to free it yourself. Memory owned by the object will be freed at its discretion with `free` function specified in `liq_attr_create_with_allocator()` (by default it's stdlib's `free()`). * `LIQ_OWN_PIXELS` makes pixel array owned by the object. The pixels will be freed automatically at any point when it's no longer needed. If you set this flag you must **not** free the pixel array yourself. If the image has been created with `liq_image_create_rgba_rows()` then the starting address of the array of pixels is assumed to be the lowest address of any row. * `LIQ_OWN_ROWS` makes array of row pointers (but not the pixels pointed by these rows) owned by the object. Rows will be freed when object is deallocated. If you set this flag you must **not** free the rows array yourself. This flag is valid only if the object has been created with `liq_image_create_rgba_rows()`. These flags can be combined with binary *or*, i.e. `LIQ_OWN_PIXELS | LIQ_OWN_ROWS`. This function must not be used if the image has been created with `liq_image_create_custom()`. Returns `LIQ_VALUE_OUT_OF_RANGE` if invalid flags are specified or the image object only takes pixels from a callback. ---- liq_error liq_image_set_background(liq_image *image, liq_image *background_image); Analyze and remap this image with assumption that it will be always presented exactly on top of this background. When this image is remapped to a palette with a fully transparent color (use `liq_image_add_fixed_color()` to ensure this) pixels that are better represented by the background than the palette will be made transparent. This function can be used to improve quality of animated GIFs by setting previous animation frame as the background. This function takes full ownership of the background image, so you should **not** free the background object. It will be freed automatically together with the foreground image. Returns `LIQ_BUFFER_TOO_SMALL` if the background image has a different size than the foreground. ---- liq_error liq_image_set_importance_map(liq_image *image, unsigned char map[], size_t buffer_size, liq_ownership ownership); Impotance map controls which areas of the image get more palette colors. Pixels corresponding to 0 values in the map are completely ignored. The higher the value the more weight is placed on the given pixel, giving it higher chance of influencing the final palette. The map is one byte per pixel and must have the same size as the image (width×height bytes). `buffer_size` argument is used to double-check that. If the `ownership` is `LIQ_COPY_PIXELS` then the `map` content be copied immediately (it's up to you to ensure the `map` memory is freed). If the `ownership` is `LIQ_OWN_PIXELS` then the `map` memory will be owned by the image and will be freed automatically when the image is freed. If a custom allocator has been set using `liq_attr_create_with_allocator()`, the `map` must be allocated using the same allocator. Returns `LIQ_INVALID_POINTER` if any pointer is `NULL`, `LIQ_BUFFER_TOO_SMALL` if the `buffer_size` does not match the image size, and `LIQ_UNSUPPORTED` if `ownership` isn't a valid value. ---- liq_error liq_write_remapped_image_rows(liq_result *result, liq_image *input_image, unsigned char **row_pointers); Similar to `liq_write_remapped_image()`. Writes remapped image, at 1 byte per pixel, to each row pointed by `row_pointers` array. The array must have at least as many elements as height of the image, and each row must have at least as many bytes as width of the image. Rows must not overlap. For best performance call `liq_get_palette()` *after* this function, as remapping may change the palette (except when `liq_histogram_quantize()` is used). Returns `LIQ_INVALID_POINTER` if `result` or `input_image` is `NULL`. ---- double liq_get_quantization_error(liq_result *result); Returns mean square error of quantization (square of difference between pixel values in the source image and its remapped version). Alpha channel, gamma correction and approximate importance of pixels is taken into account, so the result isn't exactly the mean square error of all channels. For most images MSE 1-5 is excellent. 7-10 is OK. 20-30 will have noticeable errors. 100 is awful. This function may return `-1` if the value is not available (this happens when a high speed has been requested, the image hasn't been remapped yet, and quality limit hasn't been set, see `liq_set_speed()` and `liq_set_quality()`). The value is not updated when multiple images are remapped, it applies only to the image used in `liq_image_quantize()` or the first image that has been remapped. See `liq_get_remapping_error()`. ---- double liq_get_remapping_error(liq_result *result); Returns mean square error of last remapping done (square of difference between pixel values in the remapped image and its remapped version). Alpha channel and gamma correction are taken into account, so the result isn't exactly the mean square error of all channels. This function may return `-1` if the value is not available (this happens when a high speed has been requested or the image hasn't been remapped yet). ---- double liq_get_quantization_quality(liq_result *result); Analoguous to `liq_get_quantization_error()`, but returns quantization error as quality value in the same 0-100 range that is used by `liq_set_quality()`. It may return `-1` if the value is not available (see note in `liq_get_quantization_error()`). This function can be used to add upper limit to quality options presented to the user, e.g. liq_attr *attr = liq_attr_create(); liq_image *img = liq_image_create_rgba(…); liq_result *res; liq_image_quantize(img, attr, &res); int max_attainable_quality = liq_get_quantization_quality(res); printf("Please select quality between 0 and %d: ", max_attainable_quality); int user_selected_quality = prompt(); if (user_selected_quality < max_attainable_quality) { liq_set_quality(user_selected_quality, 0); liq_result_destroy(res); liq_image_quantize(img, attr, &res); } liq_write_remapped_image(…); ---- double liq_get_remapping_quality(liq_result *result); Analoguous to `liq_get_remapping_error()`, but returns quantization error as quality value in the same 0-100 range that is used by `liq_set_quality()`. ---- void liq_set_log_callback(liq_attr*, liq_log_callback_function*, void *user_info);

void log_callback_function(const liq_attr*, const char *message, void *user_info) {} ---- void liq_set_log_flush_callback(liq_attr*, liq_log_flush_callback_function*, void *user_info);

void log_flush_callback_function(const liq_attr*, void *user_info) {} Sets up callback function to be called when the library reports status or errors. The callback must not call any library functions. `user_info` value will be passed through to the callback. It can be `NULL`. `NULL` callback clears the current callback. In the log callback the `message` is a zero-terminated string containing informative message to output. It is valid only until the callback returns, so you must copy it. `liq_set_log_flush_callback()` sets up callback function that will be called after the last log callback, which can be used to flush buffers and free resources used by the log callback. ---- void liq_set_progress_callback(liq_attr*, liq_progress_callback_function*, void *user_info); void liq_result_set_progress_callback(liq_result*, liq_progress_callback_function*, void *user_info);

int progress_callback_function(const liq_attr*, float progress_percent, void *user_info) {} Sets up callback function to be called while the library is processing images. The callback may abort processing by returning `0`. Setting callback to `NULL` clears the current callback. `liq_set_progress_callback` is for quantization progress, and `liq_result_set_progress_callback` is for remapping progress (currently only dithered remapping reports progress). `user_info` value will be passed through to the callback. It can be `NULL`. The callback must not call any library functions. `progress_percent` is a value between 0 and 100 that estimates how much of the current task has been done. The callback should return `1` to continue the operation, and `0` to abort current operation. ---- liq_attr* liq_attr_create_with_allocator(void* (*malloc)(size_t), void (*free)(void*)); Same as `liq_attr_create`, but uses given `malloc` and `free` replacements to allocate all memory used by the library. The `malloc` function must return 16-byte aligned memory on x86 (and on other architectures memory aligned for `double` and pointers). Conversely, if your stdlib's `malloc` doesn't return appropriately aligned memory, you should use this function to provide aligned replacements. ---- liq_attr* liq_attr_copy(liq_attr *orig); Creates an independent copy of `liq_attr`. The copy should also be freed using `liq_attr_destroy()`. --- liq_error liq_set_output_gamma(liq_result* res, double gamma); Sets gamma correction for generated palette and remapped image. Must be > 0 and < 1, e.g. `0.45455` for gamma 1/2.2 in PNG images. By default output gamma is same as gamma of the input image. ---- int liq_image_get_width(const liq_image *img); int liq_image_get_height(const liq_image *img); double liq_get_output_gamma(const liq_result *result); Getters for `width`, `height` and `gamma` of the input image. If the input is invalid, these all return -1. --- liq_error liq_image_add_fixed_color(liq_image* img, liq_color color); liq_error liq_histogram_add_fixed_color(liq_histogram* hist, liq_color color, double gamma); Reserves a color in the output palette created from this image. It behaves as if the given color was used in the image and was very important. RGB values of `liq_color` are assumed to have the same gamma as the image. For the histogram function, the `gamma` can be `0` (see `liq_image_create_rgba()`). It must be called before the image is quantized. Returns error if more than 256 colors are added. If image is quantized to fewer colors than the number of fixed colors added, then excess fixed colors will be ignored. For histograms see also a more flexible `liq_histogram_add_colors()`. --- int liq_version(); Returns version of the library as an integer. Same as `LIQ_VERSION`. Human-readable version is defined as `LIQ_VERSION_STRING`. ## Multiple images with the same palette It's possible to efficiently generate a single palette that is optimal for multiple images, e.g. for an APNG animation. This is done by collecting statistics of images in a `liq_histogram` object. liq_attr *attr = liq_attr_create(); liq_histogram *hist = liq_histogram_create(attr); liq_image *image1 = liq_image_create_rgba(attr, example_bitmap_rgba1, width, height, 0); liq_histogram_add_image(hist, attr, image1); liq_image *image2 = liq_image_create_rgba(attr, example_bitmap_rgba2, width, height, 0); liq_histogram_add_image(hist, attr, image2); liq_result *result; liq_error err = liq_histogram_quantize(attr, hist, &result); if (LIQ_OK == err) { // result will contain shared palette best for both image1 and image2 } --- liq_histogram *liq_histogram_create(liq_attr *attr); Creates histogram object that will be used to collect color statistics from multiple images. It must be freed using `liq_histogram_destroy()`. All options should be set on `attr` before the histogram object is created. Options changed later may not have effect. --- liq_error liq_histogram_add_image(liq_histogram *hist, liq_attr *attr, liq_image* image); "Learns" colors from the image, which will be later used to generate the palette. After the image is added to the histogram it may be freed to save memory (but it's more efficient to keep the image object if it's going to be used for remapping). Fixed colors added to the image are also added to the histogram. If total number of fixed colors exceeds 256, this function will fail with `LIQ_BUFFER_TOO_SMALL`. --- liq_error liq_histogram_add_colors(liq_histogram *hist, liq_attr *attr, liq_histogram_entry entries[], int num_entries, double gamma); Alternative to `liq_histogram_add_image()`. Intead of counting colors in an image, it directly takes an array of colors and their counts (see `liq_histogram_entry` in `libimagequant.h`). This function is only useful if you already have a histogram of the image from another source. For description of gamma, see `liq_image_create_rgba()`. --- liq_error liq_histogram_quantize(liq_histogram *const hist, liq_attr *const attr, liq_result **out_result); Generates palette from the histogram. On success returns `LIQ_OK` and writes `liq_result*` pointer to `out_result`. Use it as follows: liq_result *result; liq_error err = liq_histogram_quantize(attr, hist, &result); if (LIQ_OK == err) { // Use result here to remap and get palette } Returns `LIQ_QUALITY_TOO_LOW` if the palette is worse than limit set in `liq_set_quality()`. One histogram object can be quantized only once. Palette generated using this function won't be improved during remapping. If you're generating palette for only one image, it's better to use `liq_image_quantize()`. ## Working with GIF The library can generate palettes for GIF images. To ensure correct transparency is used you need to preprocess the image yourself and replace alpha values other than 0 or 255 with one of these. For animated GIFs see `liq_image_set_background()` which remaps images for GIF's "keep" frame disposal method. See [gif.ski](https://gif.ski). ## Multithreading The library is stateless and doesn't use any global or thread-local storage. It doesn't use any locks. * Different threads can perform unrelated quantizations/remappings at the same time (e.g. each thread working on a different image). * The same `liq_attr`, `liq_result`, etc. can be accessed from different threads, but not at the same time (e.g. you can create `liq_attr` in one thread and free it in another). The library needs to sort unique colors present in the image. Although the sorting algorithm does few things to make stack usage minimal in typical cases, there is no guarantee against extremely degenerate cases, so threads should have automatically growing stack. ### OpenMP The library can parallelize some operations if compiled with OpenMP. GCC 9 or later is required for correct OpenMP support. Older compilers *will cause bugs* when OpenMP is enabled. You must not increase number of maximum threads after `liq_image` has been created, as it allocates some per-thread buffers. Callback of `liq_image_create_custom()` may be called from different threads at the same time. ## Acknowledgements Thanks to Irfan Skiljan for helping test the first version of the library. The library is developed by [Kornel Lesiński](mailto:%20kornel@pngquant.org). libimagequant-2.18.0/benches/000077500000000000000000000000001436525270400160435ustar00rootroot00000000000000libimagequant-2.18.0/benches/bench.rs000066400000000000000000000043271436525270400174760ustar00rootroot00000000000000#![feature(test)] extern crate test; use test::Bencher; use imagequant::*; #[bench] fn histogram(b: &mut Bencher) { let img = lodepng::decode32_file("/Users/kornel/Desktop/canvas.png").unwrap(); let liq = Attributes::new(); b.iter(move || { let mut img = liq.new_image(&img.buffer, img.width, img.height, 0.).unwrap(); let mut hist = Histogram::new(&liq); hist.add_image(&mut img).unwrap(); }) } #[bench] fn remap_ord(b: &mut Bencher) { let img = lodepng::decode32_file("/Users/kornel/Desktop/canvas.png").unwrap(); let mut buf = vec![std::mem::MaybeUninit::uninit(); img.width * img.height]; let mut liq = Attributes::new(); liq.set_speed(10); let mut img = liq.new_image(&img.buffer, img.width, img.height, 0.).unwrap(); let mut res = liq.quantize(&mut img).unwrap(); res.set_dithering_level(0.); b.iter(move || { res.remap_into(&mut img, &mut buf).unwrap(); res.remap_into(&mut img, &mut buf).unwrap(); }) } #[bench] fn remap_floyd(b: &mut Bencher) { let img = lodepng::decode32_file("/Users/kornel/Desktop/canvas.png").unwrap(); let mut buf = vec![std::mem::MaybeUninit::uninit(); img.width * img.height]; let mut liq = Attributes::new(); liq.set_speed(10); let mut img = liq.new_image(&img.buffer, img.width, img.height, 0.).unwrap(); let mut res = liq.quantize(&mut img).unwrap(); res.set_dithering_level(1.); b.iter(move || { res.remap_into(&mut img, &mut buf).unwrap(); res.remap_into(&mut img, &mut buf).unwrap(); }) } #[bench] fn quantize_s8(b: &mut Bencher) { let img = lodepng::decode32_file("/Users/kornel/Desktop/canvas.png").unwrap(); let mut liq = Attributes::new(); liq.set_speed(8); b.iter(move || { let mut img = liq.new_image(&img.buffer, img.width, img.height, 0.).unwrap(); liq.quantize(&mut img).unwrap(); }) } #[bench] fn quantize_s1(b: &mut Bencher) { let img = lodepng::decode32_file("/Users/kornel/Desktop/canvas.png").unwrap(); let mut liq = Attributes::new(); liq.set_speed(1); b.iter(move || { let mut img = liq.new_image(&img.buffer, img.width, img.height, 0.).unwrap(); liq.quantize(&mut img).unwrap(); }) } libimagequant-2.18.0/blur.c000066400000000000000000000101151436525270400155420ustar00rootroot00000000000000/* © 2011-2015 by Kornel Lesiński. This file is part of libimagequant. libimagequant is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. libimagequant is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with libimagequant. If not, see . */ #include "libimagequant.h" #include "pam.h" #include "blur.h" /* Blurs image horizontally (width 2*size+1) and writes it transposed to dst (called twice gives 2d blur) */ static void transposing_1d_blur(unsigned char *restrict src, unsigned char *restrict dst, unsigned int width, unsigned int height, const unsigned int size) { assert(size > 0); for(unsigned int j=0; j < height; j++) { unsigned char *restrict row = src + j*width; // accumulate sum for pixels outside line unsigned int sum; sum = row[0]*size; for(unsigned int i=0; i < size; i++) { sum += row[i]; } // blur with left side outside line for(unsigned int i=0; i < size; i++) { sum -= row[0]; sum += row[i+size]; dst[i*height + j] = sum / (size*2); } for(unsigned int i=size; i < width-size; i++) { sum -= row[i-size]; sum += row[i+size]; dst[i*height + j] = sum / (size*2); } // blur with right side outside line for(unsigned int i=width-size; i < width; i++) { sum -= row[i-size]; sum += row[width-1]; dst[i*height + j] = sum / (size*2); } } } /** * Picks maximum of neighboring pixels (blur + lighten) */ LIQ_PRIVATE void liq_max3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height) { for(unsigned int j=0; j < height; j++) { const unsigned char *row = src + j*width, *prevrow = src + (j > 1 ? j-1 : 0)*width, *nextrow = src + MIN(height-1,j+1)*width; unsigned char prev,curr=row[0],next=row[0]; for(unsigned int i=0; i < width-1; i++) { prev=curr; curr=next; next=row[i+1]; unsigned char t1 = MAX(prev,next); unsigned char t2 = MAX(nextrow[i],prevrow[i]); *dst++ = MAX(curr,MAX(t1,t2)); } unsigned char t1 = MAX(curr,next); unsigned char t2 = MAX(nextrow[width-1],prevrow[width-1]); *dst++ = MAX(t1,t2); } } /** * Picks minimum of neighboring pixels (blur + darken) */ LIQ_PRIVATE void liq_min3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height) { for(unsigned int j=0; j < height; j++) { const unsigned char *row = src + j*width, *prevrow = src + (j > 1 ? j-1 : 0)*width, *nextrow = src + MIN(height-1,j+1)*width; unsigned char prev,curr=row[0],next=row[0]; for(unsigned int i=0; i < width-1; i++) { prev=curr; curr=next; next=row[i+1]; unsigned char t1 = MIN(prev,next); unsigned char t2 = MIN(nextrow[i],prevrow[i]); *dst++ = MIN(curr,MIN(t1,t2)); } unsigned char t1 = MIN(curr,next); unsigned char t2 = MIN(nextrow[width-1],prevrow[width-1]); *dst++ = MIN(t1,t2); } } /* Filters src image and saves it to dst, overwriting tmp in the process. Image must be width*height pixels high. Size controls radius of box blur. */ LIQ_PRIVATE void liq_blur(unsigned char *src, unsigned char *tmp, unsigned char *dst, unsigned int width, unsigned int height, unsigned int size) { assert(size > 0); if (width < 2*size+1 || height < 2*size+1) { return; } transposing_1d_blur(src, tmp, width, height, size); transposing_1d_blur(tmp, dst, height, width, size); } libimagequant-2.18.0/blur.h000066400000000000000000000006221436525270400155510ustar00rootroot00000000000000#ifndef BLUR_H #define BLUR_H LIQ_PRIVATE void liq_blur(unsigned char *src, unsigned char *tmp, unsigned char *dst, unsigned int width, unsigned int height, unsigned int size); LIQ_PRIVATE void liq_max3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height); LIQ_PRIVATE void liq_min3(unsigned char *src, unsigned char *dst, unsigned int width, unsigned int height); #endif libimagequant-2.18.0/configure000077500000000000000000000162701436525270400163510ustar00rootroot00000000000000#!/usr/bin/env bash CONFIG="config.mk" PREFIX="/usr/local" LIBDIR="$PREFIX/lib" INCLUDEDIR="$PREFIX/include" PKGCONFIGDIR="$LIBDIR/pkgconfig" VERSION=$(grep LIQ_VERSION_STRING libimagequant.h | grep -Eo "2\.[0-9.]+") DEBUG= QUIET=0 SSE=auto OPENMP= EXTRA_CFLAGS= EXTRA_LDFLAGS= # make gcc default compiler unless CC is already set CC=${CC:-gcc} help() { printf "%4s %s\n" "" "$1" } for i in "$@"; do case $i in --help|-h) echo help "--prefix=

installation directory [$PREFIX]" help "--libdir= installation directory [$LIBDIR]" help "--includedir= installation directory [$INCLUDEDIR]" help "--pkgconfigdir= installation directory [$PKGCONFIGDIR]" help "--extra-cflags= append to CFLAGS" help "--extra-ldflags= append to LDFLAGS" echo help "--enable-debug" help "--enable-sse/--disable-sse enable/disable SSE instructions" echo help "--with-openmp=static compile with multicore support" echo help "CC= use given compiler command" help "CFLAGS= pass options to the compiler" help "LDFLAGS= pass options to the linker" echo exit 0 ;; # Can be set before or after configure. Latter overrides former. CC=*) CC=${i#*=} ;; CFLAGS=*) CFLAGS=${i#*=} ;; LDFLAGS=*) LDFLAGS=${i#*=} ;; --enable-debug) DEBUG=1 ;; --enable-sse) SSE=1 ;; --disable-sse) SSE=0 ;; --quiet) QUIET=1 ;; '') # allows a bash quirk ;; --with-openmp) OPENMP=1 ;; --with-openmp=static) OPENMP=static ;; --prefix=*) PREFIX=${i#*=} LIBDIR="$PREFIX/lib" INCLUDEDIR="$PREFIX/include" PKGCONFIGDIR="$LIBDIR/pkgconfig" ;; --libdir=*) LIBDIR=${i#*=} PKGCONFIGDIR="$LIBDIR/pkgconfig" ;; --includedir=*) INCLUDEDIR=${i#*=} ;; --pkgconfigdir=*) PKGCONFIGDIR=${i#*=} ;; # can be used multiple times or in quotes to set multiple flags --extra-cflags=*) EXTRA_CFLAGS="$EXTRA_CFLAGS ${i#*=}" ;; --extra-ldflags=*) EXTRA_LDFLAGS="$EXTRA_LDFLAGS ${i#*=}" ;; *) echo "warning: unknown switch '${i%%=*}' (see $0 --help for the list)" ;; esac done # If someone runs sudo make install as very first command, and configure later, # $CONFIG cannot be overwritten, and must be deleted before continuing. if [[ -f "$CONFIG" && ! -w "$CONFIG" ]]; then echo "Cannot overwrite file $CONFIG! Please delete it." exit 1 fi cflags() { CFLAGS="$CFLAGS $1" } lflags() { LDFLAGS="$LDFLAGS $1" } status() { if [ "$QUIET" -ne 1 ]; then printf "%10s: %s\n" "$1" "$2" fi } # Append to CFLAGS if compiler supports flag, with optional prerequisite. # Fails on errors and warnings. conditional_cflags() { if [ -z "$(echo | "$CC" -xc -S -o /dev/null $2 $1 - 2>&1)" ]; then cflags "$1" fi } error() { status "$1" "error ... $2" echo exit 1 } if [ "$QUIET" -ne 1 ]; then echo fi echo > pngquant-gcccheck.c "int main(){}" if ! "$CC" -std=c99 -o pngquant-gcccheck pngquant-gcccheck.c; then rm -f pngquant-gcccheck pngquant-gcccheck.c error "Compiler" "$CC failed to compile anything (make sure it's installed and supports C99)" fi rm -f pngquant-gcccheck pngquant-gcccheck.c status "Compiler" "$CC" # init flags CFLAGS=${CFLAGS:--fno-math-errno -funroll-loops -fomit-frame-pointer -Wall} cflags "-std=c99 -I." # DEBUG if [ -z "$DEBUG" ]; then cflags "-O3 -DNDEBUG" status "Debug" "no" else cflags "-O1 -g -DDEBUG" status "Debug" "yes" fi # SSE if [ "$SSE" = 'auto' ]; then SSE=0 if type uname > /dev/null; then if [[ "$(uname -m)" =~ "amd64" || "$(uname -m)" =~ "x86_64" || "$(grep -E -m1 "^flags" /proc/cpuinfo)" =~ "sse" ]]; then SSE=1 fi fi fi if [ "$SSE" -eq 1 ]; then status "SSE" "yes" cflags "-DUSE_SSE=1" cflags "-msse" # Silence a later ICC warning due to -msse working slightly different. conditional_cflags "-wd10121" # Must be set explicitly for GCC on x86_32. Other compilers imply it. conditional_cflags "-mfpmath=sse" "-msse" elif [ "$SSE" -eq 0 ]; then status "SSE" "no" cflags "-DUSE_SSE=0" fi # OpenMP if [ -n "$OPENMP" ]; then if [ "static" = "$OPENMP" ]; then OPENMPFLAGS="-static-libgcc -Bstatic -fopenmp -Bdynamic" else OPENMPFLAGS="-fopenmp" fi if [[ "$("$CC" -xc -E $OPENMPFLAGS <(echo "#ifdef _OPENMP #include #endif") 2>&1)" =~ "omp_get_thread_num" ]]; then cflags "$OPENMPFLAGS" lflags "$OPENMPFLAGS" status "OpenMP" "yes" else error "OpenMP" "not supported by compiler (please install a compiler that supports OpenMP (e.g. gcc) and specify it with the CC= argument)" fi else # silence warnings about omp pragmas cflags "-Wno-unknown-pragmas" conditional_cflags "-wd3180" # ICC status "OpenMP" "no" fi # Cocoa if [[ "$OSTYPE" =~ "darwin" ]]; then if [ -z "${MACOSX_DEPLOYMENT_TARGET+isset}" ]; then cflags "-mmacosx-version-min=10.9" lflags "-mmacosx-version-min=10.9" fi fi if [[ "$OSTYPE" =~ "darwin" ]]; then SOLIBSUFFIX=dylib # Search Developer SDK paths, since Apple seems to have dropped the standard Unixy ones XCODE_CMD="xcode-select" XCODE_PATH=$($XCODE_CMD -p) DIRS+=("$XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX.sdk/usr/include $XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX.sdk/usr/lib") DIRS+=("$XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.9.sdk/usr/include $XCODE_PATH/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.9.sdk/usr/lib") elif [[ "$OSTYPE" =~ "msys" ]]; then SOLIBSUFFIX=dll else SOLIBSUFFIX=so fi if [ "$QUIET" -ne 1 ]; then echo fi # As of GCC 4.5, 387 fp math is significantly slower in C99 mode without this. # Note: CPUs without SSE2 use 387 for doubles, even when SSE fp math is set. conditional_cflags "-fexcess-precision=fast" # Intel C++ Compiler # ICC does usually only produce fast(er) code when it can optimize to the full # capabilites of the (Intel) CPU. This is equivalent to -march=native for GCC. conditional_cflags "-xHOST" # Disable unsafe fp optimizations and enforce fp precision as set in the source. conditional_cflags "-fp-model source" # Silence a gold linker warning about string misalignment. conditional_cflags "-falign-stack=maintain-16-byte" lflags "-lm" # Ubuntu requires this library last, issue #38 if [ -n "$EXTRA_CFLAGS" ]; then cflags "$EXTRA_CFLAGS" fi if [ -n "$EXTRA_LDFLAGS" ]; then lflags "$EXTRA_LDFLAGS" fi # Overwrite previous configuration. echo " # auto-generated by configure PREFIX = $PREFIX LIBDIR = $LIBDIR INCLUDEDIR = $INCLUDEDIR PKGCONFIGDIR = $PKGCONFIGDIR VERSION = $VERSION CC = $CC CFLAGS = $CFLAGS LDFLAGS = $LDFLAGS SOLIBSUFFIX = $SOLIBSUFFIX " > "$CONFIG" libimagequant-2.18.0/example.c000066400000000000000000000100521436525270400162310ustar00rootroot00000000000000/** This is an example how to write your own simple pngquant using libimagequant. libimagequant works with any PNG library. This example uses lodepng, because it's easier to use than libpng. To run this example, run these commands in the library directory: make example ./example /path/to/some_file.png On "manually": 1. Get lodepng.c (download lodepng.cpp and rename it) and lodepng.h from http://lodev.org/lodepng/ and put them in this directry 2. Compile libimagequant (see README.md) 3. Compile and run the example: gcc -O3 example.c libimagequant.a -o example ./example truecolor_file.png This example code can be freely copied under CC0 (public domain) license. */ #include "lodepng.h" // Get it from https://raw.githubusercontent.com/lvandeve/lodepng/master/lodepng.h #include "lodepng.c" // Get it from https://raw.githubusercontent.com/lvandeve/lodepng/master/lodepng.cpp and rename #include #include #include "libimagequant.h" int main(int argc, char *argv[]) { if (argc < 2) { fprintf(stderr, "Please specify a path to a PNG file\n"); return EXIT_FAILURE; } const char *input_png_file_path = argv[1]; // Load PNG file and decode it as raw RGBA pixels // This uses lodepng library for PNG reading (not part of libimagequant) unsigned int width, height; unsigned char *raw_rgba_pixels; unsigned int status = lodepng_decode32_file(&raw_rgba_pixels, &width, &height, input_png_file_path); if (status) { fprintf(stderr, "Can't load %s: %s\n", input_png_file_path, lodepng_error_text(status)); return EXIT_FAILURE; } // Use libimagequant to make a palette for the RGBA pixels liq_attr *handle = liq_attr_create(); liq_image *input_image = liq_image_create_rgba(handle, raw_rgba_pixels, width, height, 0); // You could set more options here, like liq_set_quality liq_result *quantization_result; if (liq_image_quantize(input_image, handle, &quantization_result) != LIQ_OK) { fprintf(stderr, "Quantization failed\n"); return EXIT_FAILURE; } // Use libimagequant to make new image pixels from the palette size_t pixels_size = width * height; unsigned char *raw_8bit_pixels = malloc(pixels_size); liq_set_dithering_level(quantization_result, 1.0); liq_write_remapped_image(quantization_result, input_image, raw_8bit_pixels, pixels_size); const liq_palette *palette = liq_get_palette(quantization_result); // Save converted pixels as a PNG file // This uses lodepng library for PNG writing (not part of libimagequant) LodePNGState state; lodepng_state_init(&state); state.info_raw.colortype = LCT_PALETTE; state.info_raw.bitdepth = 8; state.info_png.color.colortype = LCT_PALETTE; state.info_png.color.bitdepth = 8; for(int i=0; i < palette->count; i++) { lodepng_palette_add(&state.info_png.color, palette->entries[i].r, palette->entries[i].g, palette->entries[i].b, palette->entries[i].a); lodepng_palette_add(&state.info_raw, palette->entries[i].r, palette->entries[i].g, palette->entries[i].b, palette->entries[i].a); } unsigned char *output_file_data; size_t output_file_size; unsigned int out_status = lodepng_encode(&output_file_data, &output_file_size, raw_8bit_pixels, width, height, &state); if (out_status) { fprintf(stderr, "Can't encode image: %s\n", lodepng_error_text(out_status)); return EXIT_FAILURE; } const char *output_png_file_path = "quantized_example.png"; FILE *fp = fopen(output_png_file_path, "wb"); if (!fp) { fprintf(stderr, "Unable to write to %s\n", output_png_file_path); return EXIT_FAILURE; } fwrite(output_file_data, 1, output_file_size, fp); fclose(fp); printf("Written %s\n", output_png_file_path); // Done. Free memory. liq_result_destroy(quantization_result); // Must be freed only after you're done using the palette liq_image_destroy(input_image); liq_attr_destroy(handle); free(raw_8bit_pixels); lodepng_state_cleanup(&state); } libimagequant-2.18.0/imagequant.pc.in000066400000000000000000000004701436525270400175210ustar00rootroot00000000000000prefix=@PREFIX@ includedir=${prefix}/include libdir=${prefix}/lib Name: imagequant Description: Small, portable C library for high-quality conversion of RGBA images to 8-bit indexed-color (palette) images. URL: https://pngquant.org/lib/ Version: @VERSION@ Libs: -L${libdir} -limagequant Cflags: -I${includedir} libimagequant-2.18.0/kmeans.c000066400000000000000000000105561436525270400160650ustar00rootroot00000000000000/* ** © 2011-2016 by Kornel Lesiński. ** See COPYRIGHT file for license. */ #include "libimagequant.h" #include "pam.h" #include "kmeans.h" #include "nearest.h" #include #include #ifdef _OPENMP #include #else #define omp_get_max_threads() 1 #define omp_get_thread_num() 0 #endif /* * K-Means iteration: new palette color is computed from weighted average of colors that map to that palette entry. */ LIQ_PRIVATE void kmeans_init(const colormap *map, const unsigned int max_threads, kmeans_state average_color[]) { memset(average_color, 0, sizeof(average_color[0])*(KMEANS_CACHE_LINE_GAP+map->colors)*max_threads); } LIQ_PRIVATE void kmeans_update_color(const f_pixel acolor, const float value, const colormap *map, unsigned int match, const unsigned int thread, kmeans_state average_color[]) { match += thread * (KMEANS_CACHE_LINE_GAP+map->colors); average_color[match].a += acolor.a * value; average_color[match].r += acolor.r * value; average_color[match].g += acolor.g * value; average_color[match].b += acolor.b * value; average_color[match].total += value; } LIQ_PRIVATE void kmeans_finalize(colormap *map, const unsigned int max_threads, const kmeans_state average_color[]) { for (unsigned int i=0; i < map->colors; i++) { double a=0, r=0, g=0, b=0, total=0; // Aggregate results from all threads for(unsigned int t=0; t < max_threads; t++) { const unsigned int offset = (KMEANS_CACHE_LINE_GAP+map->colors) * t + i; a += average_color[offset].a; r += average_color[offset].r; g += average_color[offset].g; b += average_color[offset].b; total += average_color[offset].total; } if (!map->palette[i].fixed) { map->palette[i].popularity = total; if (total) { map->palette[i].acolor = (f_pixel){ .a = a / total, .r = r / total, .g = g / total, .b = b / total, }; } else { // if a color is useless, make a new one // (it was supposed to be random, but Android NDK has problematic stdlib headers) map->palette[i].acolor.a = map->palette[(i+1)%map->colors].acolor.a; map->palette[i].acolor.r = map->palette[(i+2)%map->colors].acolor.r; map->palette[i].acolor.g = map->palette[(i+3)%map->colors].acolor.g; map->palette[i].acolor.b = map->palette[(i+4)%map->colors].acolor.b; } } } } LIQ_PRIVATE double kmeans_do_iteration(histogram *hist, colormap *const map, kmeans_callback callback, unsigned int max_threads) { LIQ_ARRAY(kmeans_state, average_color, (KMEANS_CACHE_LINE_GAP+map->colors) * max_threads); kmeans_init(map, max_threads, average_color); struct nearest_map *const n = nearest_init(map); hist_item *const achv = hist->achv; const int hist_size = hist->size; double total_diff=0; #if __GNUC__ >= 9 || __clang__ #pragma omp parallel for if (hist_size > 2000) \ schedule(static) default(none) shared(achv,average_color,callback,hist_size,map,n) reduction(+:total_diff) #else #pragma omp parallel for if (hist_size > 2000) \ schedule(static) default(none) shared(average_color,callback) reduction(+:total_diff) #endif for(int j=0; j < hist_size; j++) { float diff; const f_pixel px = achv[j].acolor; const unsigned int match = nearest_search(n, &px, achv[j].tmp.likely_colormap_index, &diff); achv[j].tmp.likely_colormap_index = match; if (callback) { // Check how average diff would look like if there was dithering const f_pixel remapped = map->palette[match].acolor; nearest_search(n, &(f_pixel){ .a = px.a + px.a - remapped.a, .r = px.r + px.r - remapped.r, .g = px.g + px.g - remapped.g, .b = px.b + px.b - remapped.b, }, match, &diff); callback(&achv[j], diff); } total_diff += diff * achv[j].perceptual_weight; kmeans_update_color(px, achv[j].adjusted_weight, map, match, omp_get_thread_num(), average_color); } nearest_free(n); kmeans_finalize(map, max_threads, average_color); return total_diff / hist->total_perceptual_weight; } libimagequant-2.18.0/kmeans.h000066400000000000000000000016371436525270400160720ustar00rootroot00000000000000 #ifndef KMEANS_H #define KMEANS_H // Spread memory touched by different threads at least 64B apart which I assume is the cache line size. This should avoid memory write contention. #define KMEANS_CACHE_LINE_GAP ((64+sizeof(kmeans_state)-1)/sizeof(kmeans_state)) typedef struct { double a, r, g, b, total; } kmeans_state; typedef void (*kmeans_callback)(hist_item *item, float diff); LIQ_PRIVATE void kmeans_init(const colormap *map, const unsigned int max_threads, kmeans_state state[]); LIQ_PRIVATE void kmeans_update_color(const f_pixel acolor, const float value, const colormap *map, unsigned int match, const unsigned int thread, kmeans_state average_color[]); LIQ_PRIVATE void kmeans_finalize(colormap *map, const unsigned int max_threads, const kmeans_state state[]); LIQ_PRIVATE double kmeans_do_iteration(histogram *hist, colormap *const map, kmeans_callback callback, const unsigned int max_threads); #endif libimagequant-2.18.0/libimagequant-ios.xcodeproj/000077500000000000000000000000001436525270400220425ustar00rootroot00000000000000libimagequant-2.18.0/libimagequant-ios.xcodeproj/project.pbxproj000066400000000000000000000210641436525270400251210ustar00rootroot00000000000000// !$*UTF8*$! { archiveVersion = 1; classes = { }; objectVersion = 50; objects = { /* Begin PBXBuildFile section */ 5F65D41723A04D7B003E3A5B /* nearest.c in Sources */ = {isa = PBXBuildFile; fileRef = 5F65D41023A04D7B003E3A5B /* nearest.c */; }; 5F65D41823A04D7B003E3A5B /* pam.c in Sources */ = {isa = PBXBuildFile; fileRef = 5F65D41123A04D7B003E3A5B /* pam.c */; }; 5F65D41923A04D7B003E3A5B /* mempool.c in Sources */ = {isa = PBXBuildFile; fileRef = 5F65D41223A04D7B003E3A5B /* mempool.c */; }; 5F65D41A23A04D7B003E3A5B /* mediancut.c in Sources */ = {isa = PBXBuildFile; fileRef = 5F65D41323A04D7B003E3A5B /* mediancut.c */; }; 5F65D41B23A04D7B003E3A5B /* kmeans.c in Sources */ = {isa = PBXBuildFile; fileRef = 5F65D41423A04D7B003E3A5B /* kmeans.c */; }; 5F65D41C23A04D7B003E3A5B /* libimagequant.c in Sources */ = {isa = PBXBuildFile; fileRef = 5F65D41523A04D7B003E3A5B /* libimagequant.c */; }; 5F65D41D23A04D7B003E3A5B /* blur.c in Sources */ = {isa = PBXBuildFile; fileRef = 5F65D41623A04D7B003E3A5B /* blur.c */; }; /* End PBXBuildFile section */ /* Begin PBXCopyFilesBuildPhase section */ 5FB37C7723A04C7300942532 /* CopyFiles */ = { isa = PBXCopyFilesBuildPhase; buildActionMask = 2147483647; dstPath = "include/$(PRODUCT_NAME)"; dstSubfolderSpec = 16; files = ( ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXCopyFilesBuildPhase section */ /* Begin PBXFileReference section */ 5F65D41023A04D7B003E3A5B /* nearest.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = nearest.c; sourceTree = SOURCE_ROOT; }; 5F65D41123A04D7B003E3A5B /* pam.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = pam.c; sourceTree = SOURCE_ROOT; }; 5F65D41223A04D7B003E3A5B /* mempool.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = mempool.c; sourceTree = SOURCE_ROOT; }; 5F65D41323A04D7B003E3A5B /* mediancut.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = mediancut.c; sourceTree = SOURCE_ROOT; }; 5F65D41423A04D7B003E3A5B /* kmeans.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = kmeans.c; sourceTree = SOURCE_ROOT; }; 5F65D41523A04D7B003E3A5B /* libimagequant.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = libimagequant.c; sourceTree = SOURCE_ROOT; }; 5F65D41623A04D7B003E3A5B /* blur.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = blur.c; sourceTree = SOURCE_ROOT; }; 5F65D41E23A04D93003E3A5B /* libimagequant.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = libimagequant.h; sourceTree = SOURCE_ROOT; }; 5FB37C7923A04C7300942532 /* libimagequant.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libimagequant.a; sourceTree = BUILT_PRODUCTS_DIR; }; /* End PBXFileReference section */ /* Begin PBXFrameworksBuildPhase section */ 5FB37C7623A04C7300942532 /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXFrameworksBuildPhase section */ /* Begin PBXGroup section */ 5FB37C7023A04C7300942532 = { isa = PBXGroup; children = ( 5FB37C7B23A04C7300942532 /* imagequant */, 5FB37C7A23A04C7300942532 /* Products */, ); sourceTree = ""; }; 5FB37C7A23A04C7300942532 /* Products */ = { isa = PBXGroup; children = ( 5FB37C7923A04C7300942532 /* libimagequant.a */, ); name = Products; sourceTree = ""; }; 5FB37C7B23A04C7300942532 /* imagequant */ = { isa = PBXGroup; children = ( 5F65D41E23A04D93003E3A5B /* libimagequant.h */, 5F65D41623A04D7B003E3A5B /* blur.c */, 5F65D41423A04D7B003E3A5B /* kmeans.c */, 5F65D41523A04D7B003E3A5B /* libimagequant.c */, 5F65D41323A04D7B003E3A5B /* mediancut.c */, 5F65D41223A04D7B003E3A5B /* mempool.c */, 5F65D41023A04D7B003E3A5B /* nearest.c */, 5F65D41123A04D7B003E3A5B /* pam.c */, ); path = imagequant; sourceTree = ""; }; /* End PBXGroup section */ /* Begin PBXNativeTarget section */ 5FB37C7823A04C7300942532 /* imagequant */ = { isa = PBXNativeTarget; buildConfigurationList = 5FB37C8223A04C7300942532 /* Build configuration list for PBXNativeTarget "imagequant" */; buildPhases = ( 5FB37C7523A04C7300942532 /* Sources */, 5FB37C7623A04C7300942532 /* Frameworks */, 5FB37C7723A04C7300942532 /* CopyFiles */, ); buildRules = ( ); dependencies = ( ); name = imagequant; productName = imagequant; productReference = 5FB37C7923A04C7300942532 /* libimagequant.a */; productType = "com.apple.product-type.library.static"; }; /* End PBXNativeTarget section */ /* Begin PBXProject section */ 5FB37C7123A04C7300942532 /* Project object */ = { isa = PBXProject; attributes = { LastUpgradeCheck = 1120; ORGANIZATIONNAME = "ImageOptim Ltd."; TargetAttributes = { 5FB37C7823A04C7300942532 = { CreatedOnToolsVersion = 11.2; }; }; }; buildConfigurationList = 5FB37C7423A04C7300942532 /* Build configuration list for PBXProject "libimagequant-ios" */; compatibilityVersion = "Xcode 9.3"; developmentRegion = en; hasScannedForEncodings = 0; knownRegions = ( en, Base, ); mainGroup = 5FB37C7023A04C7300942532; productRefGroup = 5FB37C7A23A04C7300942532 /* Products */; projectDirPath = ""; projectRoot = ""; targets = ( 5FB37C7823A04C7300942532 /* imagequant */, ); }; /* End PBXProject section */ /* Begin PBXSourcesBuildPhase section */ 5FB37C7523A04C7300942532 /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 5F65D41B23A04D7B003E3A5B /* kmeans.c in Sources */, 5F65D41923A04D7B003E3A5B /* mempool.c in Sources */, 5F65D41823A04D7B003E3A5B /* pam.c in Sources */, 5F65D41C23A04D7B003E3A5B /* libimagequant.c in Sources */, 5F65D41A23A04D7B003E3A5B /* mediancut.c in Sources */, 5F65D41723A04D7B003E3A5B /* nearest.c in Sources */, 5F65D41D23A04D7B003E3A5B /* blur.c in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXSourcesBuildPhase section */ /* Begin XCBuildConfiguration section */ 5FB37C8023A04C7300942532 /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { ALWAYS_SEARCH_USER_PATHS = NO; COPY_PHASE_STRIP = NO; DEBUG_INFORMATION_FORMAT = dwarf; ENABLE_TESTABILITY = YES; GCC_C_LANGUAGE_STANDARD = gnu11; GCC_DYNAMIC_NO_PIC = NO; GCC_NO_COMMON_BLOCKS = YES; GCC_OPTIMIZATION_LEVEL = 0; IPHONEOS_DEPLOYMENT_TARGET = 11.0; ONLY_ACTIVE_ARCH = YES; SDKROOT = iphoneos; }; name = Debug; }; 5FB37C8123A04C7300942532 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { ALWAYS_SEARCH_USER_PATHS = NO; COPY_PHASE_STRIP = NO; DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym"; ENABLE_NS_ASSERTIONS = NO; GCC_C_LANGUAGE_STANDARD = gnu11; GCC_NO_COMMON_BLOCKS = YES; GCC_PREPROCESSOR_DEFINITIONS = "NDEBUG=1"; IPHONEOS_DEPLOYMENT_TARGET = 11.0; SDKROOT = iphoneos; VALIDATE_PRODUCT = YES; }; name = Release; }; 5FB37C8323A04C7300942532 /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { CODE_SIGN_STYLE = Automatic; PRODUCT_NAME = "$(TARGET_NAME)"; SKIP_INSTALL = YES; TARGETED_DEVICE_FAMILY = "1,2"; }; name = Debug; }; 5FB37C8423A04C7300942532 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { CODE_SIGN_STYLE = Automatic; PRODUCT_NAME = "$(TARGET_NAME)"; SKIP_INSTALL = YES; TARGETED_DEVICE_FAMILY = "1,2"; }; name = Release; }; /* End XCBuildConfiguration section */ /* Begin XCConfigurationList section */ 5FB37C7423A04C7300942532 /* Build configuration list for PBXProject "libimagequant-ios" */ = { isa = XCConfigurationList; buildConfigurations = ( 5FB37C8023A04C7300942532 /* Debug */, 5FB37C8123A04C7300942532 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 5FB37C8223A04C7300942532 /* Build configuration list for PBXNativeTarget "imagequant" */ = { isa = XCConfigurationList; buildConfigurations = ( 5FB37C8323A04C7300942532 /* Debug */, 5FB37C8423A04C7300942532 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; /* End XCConfigurationList section */ }; rootObject = 5FB37C7123A04C7300942532 /* Project object */; } libimagequant-2.18.0/libimagequant-mac.xcodeproj/000077500000000000000000000000001436525270400220105ustar00rootroot00000000000000libimagequant-2.18.0/libimagequant-mac.xcodeproj/project.pbxproj000066400000000000000000000213671436525270400250750ustar00rootroot00000000000000// !$*UTF8*$! { archiveVersion = 1; classes = { }; objectVersion = 50; objects = { /* Begin PBXBuildFile section */ 5FF4F4CD23A04EF500A3FFB5 /* libimagequant.h in Headers */ = {isa = PBXBuildFile; fileRef = 5FF4F4C523A04EF500A3FFB5 /* libimagequant.h */; }; 5FF4F4CE23A04EF500A3FFB5 /* libimagequant.c in Sources */ = {isa = PBXBuildFile; fileRef = 5FF4F4C623A04EF500A3FFB5 /* libimagequant.c */; }; 5FF4F4CF23A04EF500A3FFB5 /* kmeans.c in Sources */ = {isa = PBXBuildFile; fileRef = 5FF4F4C723A04EF500A3FFB5 /* kmeans.c */; }; 5FF4F4D023A04EF500A3FFB5 /* blur.c in Sources */ = {isa = PBXBuildFile; fileRef = 5FF4F4C823A04EF500A3FFB5 /* blur.c */; }; 5FF4F4D123A04EF500A3FFB5 /* mempool.c in Sources */ = {isa = PBXBuildFile; fileRef = 5FF4F4C923A04EF500A3FFB5 /* mempool.c */; }; 5FF4F4D223A04EF500A3FFB5 /* nearest.c in Sources */ = {isa = PBXBuildFile; fileRef = 5FF4F4CA23A04EF500A3FFB5 /* nearest.c */; }; 5FF4F4D323A04EF500A3FFB5 /* pam.c in Sources */ = {isa = PBXBuildFile; fileRef = 5FF4F4CB23A04EF500A3FFB5 /* pam.c */; }; 5FF4F4D423A04EF500A3FFB5 /* mediancut.c in Sources */ = {isa = PBXBuildFile; fileRef = 5FF4F4CC23A04EF500A3FFB5 /* mediancut.c */; }; /* End PBXBuildFile section */ /* Begin PBXFileReference section */ 5FF4F4BE23A04ED500A3FFB5 /* libimagequant.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libimagequant.a; sourceTree = BUILT_PRODUCTS_DIR; }; 5FF4F4C523A04EF500A3FFB5 /* libimagequant.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = libimagequant.h; path = ../../www/pngquant/lib/libimagequant.h; sourceTree = ""; }; 5FF4F4C623A04EF500A3FFB5 /* libimagequant.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = libimagequant.c; path = ../../www/pngquant/lib/libimagequant.c; sourceTree = ""; }; 5FF4F4C723A04EF500A3FFB5 /* kmeans.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = kmeans.c; path = ../../www/pngquant/lib/kmeans.c; sourceTree = ""; }; 5FF4F4C823A04EF500A3FFB5 /* blur.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = blur.c; path = ../../www/pngquant/lib/blur.c; sourceTree = ""; }; 5FF4F4C923A04EF500A3FFB5 /* mempool.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = mempool.c; path = ../../www/pngquant/lib/mempool.c; sourceTree = ""; }; 5FF4F4CA23A04EF500A3FFB5 /* nearest.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = nearest.c; path = ../../www/pngquant/lib/nearest.c; sourceTree = ""; }; 5FF4F4CB23A04EF500A3FFB5 /* pam.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = pam.c; path = ../../www/pngquant/lib/pam.c; sourceTree = ""; }; 5FF4F4CC23A04EF500A3FFB5 /* mediancut.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; name = mediancut.c; path = ../../www/pngquant/lib/mediancut.c; sourceTree = ""; }; /* End PBXFileReference section */ /* Begin PBXFrameworksBuildPhase section */ 5FF4F4BC23A04ED500A3FFB5 /* Frameworks */ = { isa = PBXFrameworksBuildPhase; buildActionMask = 2147483647; files = ( ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXFrameworksBuildPhase section */ /* Begin PBXGroup section */ 5FF4F4B523A04ED500A3FFB5 = { isa = PBXGroup; children = ( 5FF4F4C823A04EF500A3FFB5 /* blur.c */, 5FF4F4C723A04EF500A3FFB5 /* kmeans.c */, 5FF4F4C623A04EF500A3FFB5 /* libimagequant.c */, 5FF4F4C523A04EF500A3FFB5 /* libimagequant.h */, 5FF4F4CC23A04EF500A3FFB5 /* mediancut.c */, 5FF4F4C923A04EF500A3FFB5 /* mempool.c */, 5FF4F4CA23A04EF500A3FFB5 /* nearest.c */, 5FF4F4CB23A04EF500A3FFB5 /* pam.c */, 5FF4F4BF23A04ED500A3FFB5 /* Products */, ); sourceTree = ""; }; 5FF4F4BF23A04ED500A3FFB5 /* Products */ = { isa = PBXGroup; children = ( 5FF4F4BE23A04ED500A3FFB5 /* libimagequant.a */, ); name = Products; sourceTree = ""; }; /* End PBXGroup section */ /* Begin PBXHeadersBuildPhase section */ 5FF4F4BA23A04ED500A3FFB5 /* Headers */ = { isa = PBXHeadersBuildPhase; buildActionMask = 2147483647; files = ( 5FF4F4CD23A04EF500A3FFB5 /* libimagequant.h in Headers */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXHeadersBuildPhase section */ /* Begin PBXNativeTarget section */ 5FF4F4BD23A04ED500A3FFB5 /* imagequant */ = { isa = PBXNativeTarget; buildConfigurationList = 5FF4F4C223A04ED500A3FFB5 /* Build configuration list for PBXNativeTarget "imagequant" */; buildPhases = ( 5FF4F4BA23A04ED500A3FFB5 /* Headers */, 5FF4F4BB23A04ED500A3FFB5 /* Sources */, 5FF4F4BC23A04ED500A3FFB5 /* Frameworks */, ); buildRules = ( ); dependencies = ( ); name = imagequant; productName = imagequant; productReference = 5FF4F4BE23A04ED500A3FFB5 /* libimagequant.a */; productType = "com.apple.product-type.library.static"; }; /* End PBXNativeTarget section */ /* Begin PBXProject section */ 5FF4F4B623A04ED500A3FFB5 /* Project object */ = { isa = PBXProject; attributes = { LastUpgradeCheck = 1120; ORGANIZATIONNAME = "ImageOptim Ltd."; TargetAttributes = { 5FF4F4BD23A04ED500A3FFB5 = { CreatedOnToolsVersion = 11.2; }; }; }; buildConfigurationList = 5FF4F4B923A04ED500A3FFB5 /* Build configuration list for PBXProject "imagequant" */; compatibilityVersion = "Xcode 9.3"; developmentRegion = en; hasScannedForEncodings = 0; knownRegions = ( en, Base, ); mainGroup = 5FF4F4B523A04ED500A3FFB5; productRefGroup = 5FF4F4BF23A04ED500A3FFB5 /* Products */; projectDirPath = ""; projectRoot = ""; targets = ( 5FF4F4BD23A04ED500A3FFB5 /* imagequant */, ); }; /* End PBXProject section */ /* Begin PBXSourcesBuildPhase section */ 5FF4F4BB23A04ED500A3FFB5 /* Sources */ = { isa = PBXSourcesBuildPhase; buildActionMask = 2147483647; files = ( 5FF4F4D323A04EF500A3FFB5 /* pam.c in Sources */, 5FF4F4D023A04EF500A3FFB5 /* blur.c in Sources */, 5FF4F4D223A04EF500A3FFB5 /* nearest.c in Sources */, 5FF4F4CF23A04EF500A3FFB5 /* kmeans.c in Sources */, 5FF4F4CE23A04EF500A3FFB5 /* libimagequant.c in Sources */, 5FF4F4D423A04EF500A3FFB5 /* mediancut.c in Sources */, 5FF4F4D123A04EF500A3FFB5 /* mempool.c in Sources */, ); runOnlyForDeploymentPostprocessing = 0; }; /* End PBXSourcesBuildPhase section */ /* Begin XCBuildConfiguration section */ 5FF4F4C023A04ED500A3FFB5 /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { ALWAYS_SEARCH_USER_PATHS = NO; COPY_PHASE_STRIP = NO; DEBUG_INFORMATION_FORMAT = dwarf; ENABLE_TESTABILITY = YES; GCC_C_LANGUAGE_STANDARD = gnu11; GCC_DYNAMIC_NO_PIC = NO; GCC_NO_COMMON_BLOCKS = YES; GCC_OPTIMIZATION_LEVEL = 0; MACOSX_DEPLOYMENT_TARGET = 10.9; ONLY_ACTIVE_ARCH = YES; SDKROOT = macosx; }; name = Debug; }; 5FF4F4C123A04ED500A3FFB5 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { ALWAYS_SEARCH_USER_PATHS = NO; COPY_PHASE_STRIP = NO; DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym"; ENABLE_NS_ASSERTIONS = NO; GCC_C_LANGUAGE_STANDARD = gnu11; GCC_NO_COMMON_BLOCKS = YES; GCC_PREPROCESSOR_DEFINITIONS = "NDEBUG=1"; MACOSX_DEPLOYMENT_TARGET = 10.9; SDKROOT = macosx; }; name = Release; }; 5FF4F4C323A04ED500A3FFB5 /* Debug */ = { isa = XCBuildConfiguration; buildSettings = { CODE_SIGN_STYLE = Automatic; EXECUTABLE_PREFIX = lib; PRODUCT_NAME = "$(TARGET_NAME)"; SKIP_INSTALL = YES; }; name = Debug; }; 5FF4F4C423A04ED500A3FFB5 /* Release */ = { isa = XCBuildConfiguration; buildSettings = { CODE_SIGN_STYLE = Automatic; EXECUTABLE_PREFIX = lib; PRODUCT_NAME = "$(TARGET_NAME)"; SKIP_INSTALL = YES; }; name = Release; }; /* End XCBuildConfiguration section */ /* Begin XCConfigurationList section */ 5FF4F4B923A04ED500A3FFB5 /* Build configuration list for PBXProject "imagequant" */ = { isa = XCConfigurationList; buildConfigurations = ( 5FF4F4C023A04ED500A3FFB5 /* Debug */, 5FF4F4C123A04ED500A3FFB5 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; 5FF4F4C223A04ED500A3FFB5 /* Build configuration list for PBXNativeTarget "imagequant" */ = { isa = XCConfigurationList; buildConfigurations = ( 5FF4F4C323A04ED500A3FFB5 /* Debug */, 5FF4F4C423A04ED500A3FFB5 /* Release */, ); defaultConfigurationIsVisible = 0; defaultConfigurationName = Release; }; /* End XCConfigurationList section */ }; rootObject = 5FF4F4B623A04ED500A3FFB5 /* Project object */; } libimagequant-2.18.0/libimagequant.c000066400000000000000000001764421436525270400174400ustar00rootroot00000000000000/* ** © 2009-2018 by Kornel Lesiński. ** © 1989, 1991 by Jef Poskanzer. ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider. ** ** See COPYRIGHT file for license. */ #include #include #include #include #include #include #include #if !(defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199900L) && !(defined(_MSC_VER) && _MSC_VER >= 1800) #error "This program requires C99, e.g. -std=c99 switch in GCC or it requires MSVC 18.0 or higher." #error "Ignore torrent of syntax errors that may follow. It's only because compiler is set to use too old C version." #endif #include "libimagequant.h" #include "pam.h" #include "libimagequant_private.h" #include "mediancut.h" #include "blur.h" #include "kmeans.h" #include "remap.h" #define LIQ_HIGH_MEMORY_LIMIT (1<<26) /* avoid allocating buffers larger than 64MB */ // each structure has a pointer as a unique identifier that allows type checking at run time static const char liq_attr_magic[] = "liq_attr"; static const char liq_image_magic[] = "liq_image"; static const char liq_result_magic[] = "liq_result"; static const char liq_histogram_magic[] = "liq_histogram"; static const char liq_remapping_result_magic[] = "liq_remapping_result"; static const char liq_freed_magic[] = "free"; #define CHECK_STRUCT_TYPE(attr, kind) liq_crash_if_invalid_handle_pointer_given((const liq_attr*)attr, kind ## _magic) #define CHECK_USER_POINTER(ptr) liq_crash_if_invalid_pointer_given(ptr) struct liq_attr { const char *magic_header; void* (*malloc)(size_t); void (*free)(void*); double target_mse, max_mse, kmeans_iteration_limit; unsigned int max_colors, max_histogram_entries; unsigned int min_posterization_output /* user setting */, min_posterization_input /* speed setting */; unsigned int kmeans_iterations, feedback_loop_trials; bool last_index_transparent, use_contrast_maps; unsigned char use_dither_map; unsigned char speed; unsigned char progress_stage1, progress_stage2, progress_stage3; liq_progress_callback_function *progress_callback; void *progress_callback_user_info; liq_log_callback_function *log_callback; void *log_callback_user_info; liq_log_flush_callback_function *log_flush_callback; void *log_flush_callback_user_info; }; struct liq_result { const char *magic_header; void* (*malloc)(size_t); void (*free)(void*); liq_remapping_result *remapping; colormap *palette; liq_progress_callback_function *progress_callback; void *progress_callback_user_info; liq_palette int_palette; float dither_level; double gamma, palette_error; int min_posterization_output; unsigned char use_dither_map; }; struct liq_histogram { const char *magic_header; void* (*malloc)(size_t); void (*free)(void*); struct acolorhash_table *acht; double gamma; f_pixel fixed_colors[256]; unsigned short fixed_colors_count; unsigned short ignorebits; bool had_image_added; }; static void contrast_maps(liq_image *image) LIQ_NONNULL; static liq_error finalize_histogram(liq_histogram *input_hist, liq_attr *options, histogram **hist_output) LIQ_NONNULL; static const liq_color *liq_image_get_row_rgba(liq_image *input_image, unsigned int row) LIQ_NONNULL; static void liq_remapping_result_destroy(liq_remapping_result *result) LIQ_NONNULL; static liq_error pngquant_quantize(histogram *hist, const liq_attr *options, const int fixed_colors_count, const f_pixel fixed_colors[], const double gamma, bool fixed_result_colors, liq_result **) LIQ_NONNULL; static liq_error liq_histogram_quantize_internal(liq_histogram *input_hist, liq_attr *attr, bool fixed_result_colors, liq_result **result_output) LIQ_NONNULL; LIQ_NONNULL static void liq_verbose_printf(const liq_attr *context, const char *fmt, ...) { if (context->log_callback) { va_list va; va_start(va, fmt); int required_space = vsnprintf(NULL, 0, fmt, va)+1; // +\0 va_end(va); LIQ_ARRAY(char, buf, required_space); va_start(va, fmt); vsnprintf(buf, required_space, fmt, va); va_end(va); context->log_callback(context, buf, context->log_callback_user_info); } } LIQ_NONNULL inline static void verbose_print(const liq_attr *attr, const char *msg) { if (attr->log_callback) { attr->log_callback(attr, msg, attr->log_callback_user_info); } } LIQ_NONNULL static void liq_verbose_printf_flush(liq_attr *attr) { if (attr->log_flush_callback) { attr->log_flush_callback(attr, attr->log_flush_callback_user_info); } } LIQ_NONNULL static bool liq_progress(const liq_attr *attr, const float percent) { return attr->progress_callback && !attr->progress_callback(percent, attr->progress_callback_user_info); } LIQ_PRIVATE LIQ_NONNULL bool liq_remap_progress(const liq_remapping_result *quant, const float percent) { return quant->progress_callback && !quant->progress_callback(percent, quant->progress_callback_user_info); } #if USE_SSE inline static bool is_sse_available() { #if (defined(__x86_64__) || defined(__amd64) || defined(_WIN64)) return true; #elif _MSC_VER int info[4]; __cpuid(info, 1); /* bool is implemented as a built-in type of size 1 in MSVC */ return info[3] & (1<<26) ? true : false; #else int a,b,c,d; cpuid(1, a, b, c, d); return d & (1<<25); // edx bit 25 is set when SSE is present #endif } #endif /* make it clear in backtrace when user-supplied handle points to invalid memory */ NEVER_INLINE LIQ_EXPORT bool liq_crash_if_invalid_handle_pointer_given(const liq_attr *user_supplied_pointer, const char *const expected_magic_header); LIQ_EXPORT bool liq_crash_if_invalid_handle_pointer_given(const liq_attr *user_supplied_pointer, const char *const expected_magic_header) { if (!user_supplied_pointer) { return false; } if (user_supplied_pointer->magic_header == liq_freed_magic) { fprintf(stderr, "%s used after being freed", expected_magic_header); // this is not normal error handling, this is programmer error that should crash the program. // program cannot safely continue if memory has been used after it's been freed. // abort() is nasty, but security vulnerability may be worse. abort(); } return user_supplied_pointer->magic_header == expected_magic_header; } NEVER_INLINE LIQ_EXPORT bool liq_crash_if_invalid_pointer_given(const void *pointer); LIQ_EXPORT bool liq_crash_if_invalid_pointer_given(const void *pointer) { if (!pointer) { return false; } // Force a read from the given (potentially invalid) memory location in order to check early whether this crashes the program or not. // It doesn't matter what value is read, the code here is just to shut the compiler up about unused read. char test_access = *((volatile char *)pointer); return test_access || true; } LIQ_NONNULL static void liq_log_error(const liq_attr *attr, const char *msg) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return; liq_verbose_printf(attr, " error: %s", msg); } static double quality_to_mse(long quality) { if (quality == 0) { return MAX_DIFF; } if (quality == 100) { return 0; } // curve fudged to be roughly similar to quality of libjpeg // except lowest 10 for really low number of colors const double extra_low_quality_fudge = MAX(0,0.016/(0.001+quality) - 0.001); // LIQ_WEIGHT_MSE is a fudge factor - reminder that colors are not in 0..1 range any more return LIQ_WEIGHT_MSE * (extra_low_quality_fudge + 2.5/pow(210.0 + quality, 1.2) * (100.1-quality)/100.0); } static unsigned int mse_to_quality(double mse) { for(int i=100; i > 0; i--) { if (mse <= quality_to_mse(i) + 0.000001) { // + epsilon for floating point errors return i; } } return 0; } /** internally MSE is a sum of all channels with pixels 0..1 range, but other software gives per-RGB-channel MSE for 0..255 range */ static double mse_to_standard_mse(double mse) { return (mse * 65536.0/6.0) / LIQ_WEIGHT_MSE; } LIQ_EXPORT LIQ_NONNULL liq_error liq_set_quality(liq_attr* attr, int minimum, int target) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return LIQ_INVALID_POINTER; if (target < 0 || target > 100 || target < minimum || minimum < 0) return LIQ_VALUE_OUT_OF_RANGE; attr->target_mse = quality_to_mse(target); attr->max_mse = quality_to_mse(minimum); return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL int liq_get_min_quality(const liq_attr *attr) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return -1; return mse_to_quality(attr->max_mse); } LIQ_EXPORT LIQ_NONNULL int liq_get_max_quality(const liq_attr *attr) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return -1; return mse_to_quality(attr->target_mse); } LIQ_EXPORT LIQ_NONNULL liq_error liq_set_max_colors(liq_attr* attr, int colors) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return LIQ_INVALID_POINTER; if (colors < 2 || colors > 256) return LIQ_VALUE_OUT_OF_RANGE; attr->max_colors = colors; return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL int liq_get_max_colors(const liq_attr *attr) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return -1; return attr->max_colors; } LIQ_EXPORT LIQ_NONNULL liq_error liq_set_min_posterization(liq_attr *attr, int bits) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return LIQ_INVALID_POINTER; if (bits < 0 || bits > 4) return LIQ_VALUE_OUT_OF_RANGE; attr->min_posterization_output = bits; return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL int liq_get_min_posterization(const liq_attr *attr) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return -1; return attr->min_posterization_output; } LIQ_EXPORT LIQ_NONNULL liq_error liq_set_speed(liq_attr* attr, int speed) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return LIQ_INVALID_POINTER; if (speed < 1 || speed > 10) return LIQ_VALUE_OUT_OF_RANGE; unsigned int iterations = MAX(8-speed, 0); iterations += iterations * iterations/2; attr->kmeans_iterations = iterations; attr->kmeans_iteration_limit = 1.0/(double)(1<<(23-speed)); attr->feedback_loop_trials = MAX(56-9*speed, 0); attr->max_histogram_entries = (1<<17) + (1<<18)*(10-speed); attr->min_posterization_input = (speed >= 8) ? 1 : 0; attr->use_dither_map = (speed <= (omp_get_max_threads() > 1 ? 7 : 5)); // parallelized dither map might speed up floyd remapping if (attr->use_dither_map && speed < 3) { attr->use_dither_map = 2; // always } attr->use_contrast_maps = (speed <= 7) || attr->use_dither_map; attr->speed = speed; attr->progress_stage1 = attr->use_contrast_maps ? 20 : 8; if (attr->feedback_loop_trials < 2) { attr->progress_stage1 += 30; } attr->progress_stage3 = 50 / (1+speed); attr->progress_stage2 = 100 - attr->progress_stage1 - attr->progress_stage3; return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL int liq_get_speed(const liq_attr *attr) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return -1; return attr->speed; } LIQ_EXPORT LIQ_NONNULL liq_error liq_set_output_gamma(liq_result* res, double gamma) { if (!CHECK_STRUCT_TYPE(res, liq_result)) return LIQ_INVALID_POINTER; if (gamma <= 0 || gamma >= 1.0) return LIQ_VALUE_OUT_OF_RANGE; if (res->remapping) { liq_remapping_result_destroy(res->remapping); res->remapping = NULL; } res->gamma = gamma; return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL liq_error liq_set_min_opacity(liq_attr* attr, int min) { return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL int liq_get_min_opacity(const liq_attr *attr) { return 0; } LIQ_EXPORT LIQ_NONNULL void liq_set_last_index_transparent(liq_attr* attr, int is_last) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return; attr->last_index_transparent = !!is_last; } LIQ_EXPORT void liq_attr_set_progress_callback(liq_attr *attr, liq_progress_callback_function *callback, void *user_info) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return; attr->progress_callback = callback; attr->progress_callback_user_info = user_info; } LIQ_EXPORT void liq_result_set_progress_callback(liq_result *result, liq_progress_callback_function *callback, void *user_info) { if (!CHECK_STRUCT_TYPE(result, liq_result)) return; result->progress_callback = callback; result->progress_callback_user_info = user_info; } LIQ_EXPORT void liq_set_log_callback(liq_attr *attr, liq_log_callback_function *callback, void* user_info) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return; liq_verbose_printf_flush(attr); attr->log_callback = callback; attr->log_callback_user_info = user_info; } LIQ_EXPORT void liq_set_log_flush_callback(liq_attr *attr, liq_log_flush_callback_function *callback, void* user_info) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return; attr->log_flush_callback = callback; attr->log_flush_callback_user_info = user_info; } LIQ_EXPORT liq_attr* liq_attr_create() { return liq_attr_create_with_allocator(NULL, NULL); } LIQ_EXPORT LIQ_NONNULL void liq_attr_destroy(liq_attr *attr) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) { return; } liq_verbose_printf_flush(attr); attr->magic_header = liq_freed_magic; attr->free(attr); } LIQ_EXPORT LIQ_NONNULL liq_attr* liq_attr_copy(const liq_attr *orig) { if (!CHECK_STRUCT_TYPE(orig, liq_attr)) { return NULL; } liq_attr *attr = orig->malloc(sizeof(liq_attr)); if (!attr) return NULL; *attr = *orig; return attr; } static void *liq_aligned_malloc(size_t size) { unsigned char *ptr = malloc(size + 16); if (!ptr) { return NULL; } uintptr_t offset = 16 - ((uintptr_t)ptr & 15); // also reserves 1 byte for ptr[-1] ptr += offset; assert(0 == (((uintptr_t)ptr) & 15)); ptr[-1] = offset ^ 0x59; // store how much pointer was shifted to get the original for free() return ptr; } LIQ_NONNULL static void liq_aligned_free(void *inptr) { unsigned char *ptr = inptr; size_t offset = ptr[-1] ^ 0x59; assert(offset > 0 && offset <= 16); free(ptr - offset); } LIQ_EXPORT liq_attr* liq_attr_create_with_allocator(void* (*custom_malloc)(size_t), void (*custom_free)(void*)) { #if USE_SSE if (!is_sse_available()) { return NULL; } #endif if (!custom_malloc && !custom_free) { custom_malloc = liq_aligned_malloc; custom_free = liq_aligned_free; } else if (!custom_malloc != !custom_free) { return NULL; // either specify both or none } liq_attr *attr = custom_malloc(sizeof(liq_attr)); if (!attr) return NULL; *attr = (liq_attr) { .magic_header = liq_attr_magic, .malloc = custom_malloc, .free = custom_free, .max_colors = 256, .last_index_transparent = false, // puts transparent color at last index. This is workaround for blu-ray subtitles. .target_mse = 0, .max_mse = MAX_DIFF, }; liq_set_speed(attr, 4); return attr; } LIQ_EXPORT LIQ_NONNULL liq_error liq_image_add_fixed_color(liq_image *img, liq_color color) { if (!CHECK_STRUCT_TYPE(img, liq_image)) return LIQ_INVALID_POINTER; if (img->fixed_colors_count > 255) return LIQ_UNSUPPORTED; float gamma_lut[256]; to_f_set_gamma(gamma_lut, img->gamma); img->fixed_colors[img->fixed_colors_count++] = rgba_to_f(gamma_lut, (liq_color){ .r = color.r, .g = color.g, .b = color.b, .a = color.a, }); return LIQ_OK; } LIQ_NONNULL static liq_error liq_histogram_add_fixed_color_f(liq_histogram *hist, f_pixel color) { if (hist->fixed_colors_count > 255) return LIQ_UNSUPPORTED; hist->fixed_colors[hist->fixed_colors_count++] = color; return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL liq_error liq_histogram_add_fixed_color(liq_histogram *hist, liq_color color, double gamma) { if (!CHECK_STRUCT_TYPE(hist, liq_histogram)) return LIQ_INVALID_POINTER; float gamma_lut[256]; to_f_set_gamma(gamma_lut, gamma ? gamma : 0.45455); const f_pixel px = rgba_to_f(gamma_lut, (liq_color){ .r = color.r, .g = color.g, .b = color.b, .a = color.a, }); return liq_histogram_add_fixed_color_f(hist, px); } LIQ_NONNULL static bool liq_image_use_low_memory(liq_image *img) { if (img->temp_f_row) { img->free(img->temp_f_row); } img->temp_f_row = img->malloc(sizeof(img->f_pixels[0]) * LIQ_TEMP_ROW_WIDTH(img->width) * omp_get_max_threads()); return img->temp_f_row != NULL; } LIQ_NONNULL static bool liq_image_should_use_low_memory(liq_image *img, const bool low_memory_hint) { return (size_t)img->width * (size_t)img->height > (low_memory_hint ? LIQ_HIGH_MEMORY_LIMIT/8 : LIQ_HIGH_MEMORY_LIMIT) / sizeof(f_pixel); // Watch out for integer overflow } static liq_image *liq_image_create_internal(const liq_attr *attr, liq_color* rows[], liq_image_get_rgba_row_callback *row_callback, void *row_callback_user_info, int width, int height, double gamma) { if (gamma < 0 || gamma > 1.0) { liq_log_error(attr, "gamma must be >= 0 and <= 1 (try 1/gamma instead)"); return NULL; } if (!rows && !row_callback) { liq_log_error(attr, "missing row data"); return NULL; } liq_image *img = attr->malloc(sizeof(liq_image)); if (!img) return NULL; *img = (liq_image){ .magic_header = liq_image_magic, .malloc = attr->malloc, .free = attr->free, .width = width, .height = height, .gamma = gamma ? gamma : 0.45455, .rows = rows, .row_callback = row_callback, .row_callback_user_info = row_callback_user_info, }; if (!rows) { img->temp_row = attr->malloc(sizeof(img->temp_row[0]) * LIQ_TEMP_ROW_WIDTH(width) * omp_get_max_threads()); if (!img->temp_row) return NULL; } // if image is huge or converted pixels are not likely to be reused then don't cache converted pixels if (liq_image_should_use_low_memory(img, !img->temp_row && !attr->use_contrast_maps && !attr->use_dither_map)) { verbose_print(attr, " conserving memory"); if (!liq_image_use_low_memory(img)) return NULL; } return img; } LIQ_EXPORT LIQ_NONNULL liq_error liq_image_set_memory_ownership(liq_image *img, int ownership_flags) { if (!CHECK_STRUCT_TYPE(img, liq_image)) return LIQ_INVALID_POINTER; if (!img->rows || !ownership_flags || (ownership_flags & ~(LIQ_OWN_ROWS|LIQ_OWN_PIXELS))) { return LIQ_VALUE_OUT_OF_RANGE; } if (ownership_flags & LIQ_OWN_ROWS) { if (img->free_rows_internal) return LIQ_VALUE_OUT_OF_RANGE; img->free_rows = true; } if (ownership_flags & LIQ_OWN_PIXELS) { img->free_pixels = true; if (!img->pixels) { // for simplicity of this API there's no explicit bitmap argument, // so the row with the lowest address is assumed to be at the start of the bitmap img->pixels = img->rows[0]; for(unsigned int i=1; i < img->height; i++) { img->pixels = MIN(img->pixels, img->rows[i]); } } } return LIQ_OK; } LIQ_NONNULL static void liq_image_free_maps(liq_image *input_image); LIQ_NONNULL static void liq_image_free_dither_map(liq_image *input_image); LIQ_NONNULL static void liq_image_free_importance_map(liq_image *input_image); LIQ_EXPORT LIQ_NONNULL liq_error liq_image_set_importance_map(liq_image *img, unsigned char importance_map[], size_t buffer_size, enum liq_ownership ownership) { if (!CHECK_STRUCT_TYPE(img, liq_image)) return LIQ_INVALID_POINTER; if (!CHECK_USER_POINTER(importance_map)) return LIQ_INVALID_POINTER; const size_t required_size = (size_t)img->width * (size_t)img->height; if (buffer_size < required_size) { return LIQ_BUFFER_TOO_SMALL; } if (ownership == LIQ_COPY_PIXELS) { unsigned char *tmp = img->malloc(required_size); if (!tmp) { return LIQ_OUT_OF_MEMORY; } memcpy(tmp, importance_map, required_size); importance_map = tmp; } else if (ownership != LIQ_OWN_PIXELS) { return LIQ_UNSUPPORTED; } liq_image_free_importance_map(img); img->importance_map = importance_map; return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL liq_error liq_image_set_background(liq_image *img, liq_image *background) { if (!CHECK_STRUCT_TYPE(img, liq_image)) return LIQ_INVALID_POINTER; if (!CHECK_STRUCT_TYPE(background, liq_image)) return LIQ_INVALID_POINTER; if (background->background) { return LIQ_UNSUPPORTED; } if (img->width != background->width || img->height != background->height) { return LIQ_BUFFER_TOO_SMALL; } if (img->background) { liq_image_destroy(img->background); } img->background = background; liq_image_free_dither_map(img); // Force it to be re-analyzed with the background return LIQ_OK; } LIQ_NONNULL static bool check_image_size(const liq_attr *attr, const int width, const int height) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) { return false; } if (width <= 0 || height <= 0) { liq_log_error(attr, "width and height must be > 0"); return false; } if (width > INT_MAX/sizeof(liq_color)/height || width > INT_MAX/16/sizeof(f_pixel) || height > INT_MAX/sizeof(size_t)) { liq_log_error(attr, "image too large"); return false; } return true; } LIQ_EXPORT liq_image *liq_image_create_custom(const liq_attr *attr, liq_image_get_rgba_row_callback *row_callback, void* user_info, int width, int height, double gamma) { if (!check_image_size(attr, width, height)) { return NULL; } return liq_image_create_internal(attr, NULL, row_callback, user_info, width, height, gamma); } LIQ_EXPORT liq_image *liq_image_create_rgba_rows(const liq_attr *attr, void *const rows[], int width, int height, double gamma) { if (!check_image_size(attr, width, height)) { return NULL; } for(int i=0; i < height; i++) { if (!CHECK_USER_POINTER(rows+i) || !CHECK_USER_POINTER(rows[i])) { liq_log_error(attr, "invalid row pointers"); return NULL; } } return liq_image_create_internal(attr, (liq_color**)rows, NULL, NULL, width, height, gamma); } LIQ_EXPORT LIQ_NONNULL liq_image *liq_image_create_rgba(const liq_attr *attr, const void* bitmap, int width, int height, double gamma) { if (!check_image_size(attr, width, height)) { return NULL; } if (!CHECK_USER_POINTER(bitmap)) { liq_log_error(attr, "invalid bitmap pointer"); return NULL; } liq_color *const pixels = (liq_color *const)bitmap; liq_color **rows = attr->malloc(sizeof(rows[0])*height); if (!rows) return NULL; for(int i=0; i < height; i++) { rows[i] = pixels + width * i; } liq_image *image = liq_image_create_internal(attr, rows, NULL, NULL, width, height, gamma); if (!image) { attr->free(rows); return NULL; } image->free_rows = true; image->free_rows_internal = true; return image; } NEVER_INLINE LIQ_EXPORT void liq_executing_user_callback(liq_image_get_rgba_row_callback *callback, liq_color *temp_row, int row, int width, void *user_info); LIQ_EXPORT void liq_executing_user_callback(liq_image_get_rgba_row_callback *callback, liq_color *temp_row, int row, int width, void *user_info) { assert(callback); assert(temp_row); callback(temp_row, row, width, user_info); } LIQ_NONNULL inline static bool liq_image_has_rgba_pixels(const liq_image *img) { if (!CHECK_STRUCT_TYPE(img, liq_image)) { return false; } return img->rows || (img->temp_row && img->row_callback); } LIQ_NONNULL inline static bool liq_image_can_use_rgba_rows(const liq_image *img) { assert(liq_image_has_rgba_pixels(img)); return img->rows; } LIQ_NONNULL static const liq_color *liq_image_get_row_rgba(liq_image *img, unsigned int row) { if (liq_image_can_use_rgba_rows(img)) { return img->rows[row]; } assert(img->temp_row); liq_color *temp_row = img->temp_row + LIQ_TEMP_ROW_WIDTH(img->width) * omp_get_thread_num(); if (img->rows) { memcpy(temp_row, img->rows[row], img->width * sizeof(temp_row[0])); } else { liq_executing_user_callback(img->row_callback, (liq_color*)temp_row, row, img->width, img->row_callback_user_info); } return temp_row; } LIQ_NONNULL static void convert_row_to_f(liq_image *img, f_pixel *row_f_pixels, const unsigned int row, const float gamma_lut[]) { assert(row_f_pixels); assert(!USE_SSE || 0 == ((uintptr_t)row_f_pixels & 15)); const liq_color *const row_pixels = liq_image_get_row_rgba(img, row); for(unsigned int col=0; col < img->width; col++) { row_f_pixels[col] = rgba_to_f(gamma_lut, row_pixels[col]); } } LIQ_PRIVATE LIQ_NONNULL bool liq_image_get_row_f_init(liq_image *img) { assert(omp_get_thread_num() == 0); if (img->f_pixels) { return true; } if (!liq_image_should_use_low_memory(img, false)) { img->f_pixels = img->malloc(sizeof(img->f_pixels[0]) * img->width * img->height); } if (!img->f_pixels) { return liq_image_use_low_memory(img); } if (!liq_image_has_rgba_pixels(img)) { return false; } float gamma_lut[256]; to_f_set_gamma(gamma_lut, img->gamma); for(unsigned int i=0; i < img->height; i++) { convert_row_to_f(img, &img->f_pixels[i*img->width], i, gamma_lut); } return true; } LIQ_PRIVATE LIQ_NONNULL const f_pixel *liq_image_get_row_f(liq_image *img, unsigned int row) { if (!img->f_pixels) { assert(img->temp_f_row); // init should have done that float gamma_lut[256]; to_f_set_gamma(gamma_lut, img->gamma); f_pixel *row_for_thread = img->temp_f_row + LIQ_TEMP_ROW_WIDTH(img->width) * omp_get_thread_num(); convert_row_to_f(img, row_for_thread, row, gamma_lut); return row_for_thread; } return img->f_pixels + img->width * row; } LIQ_EXPORT LIQ_NONNULL int liq_image_get_width(const liq_image *input_image) { if (!CHECK_STRUCT_TYPE(input_image, liq_image)) return -1; return input_image->width; } LIQ_EXPORT LIQ_NONNULL int liq_image_get_height(const liq_image *input_image) { if (!CHECK_STRUCT_TYPE(input_image, liq_image)) return -1; return input_image->height; } typedef void free_func(void*); LIQ_NONNULL static free_func *get_default_image_free_func(liq_image *img) { // When default allocator is used then user-supplied pointers must be freed with free() if (img->free != liq_aligned_free) { return img->free; } return free; } LIQ_NONNULL static free_func *get_default_rows_free_func(liq_image *img) { // When default allocator is used then user-supplied pointers must be freed with free() if (img->free_rows_internal || img->free != liq_aligned_free) { return img->free; } return free; } LIQ_NONNULL static void liq_image_free_rgba_source(liq_image *input_image) { if (input_image->free_pixels && input_image->pixels) { get_default_image_free_func(input_image)(input_image->pixels); input_image->pixels = NULL; } if (input_image->free_rows && input_image->rows) { get_default_rows_free_func(input_image)(input_image->rows); input_image->rows = NULL; } } LIQ_NONNULL static void liq_image_free_importance_map(liq_image *input_image) { if (input_image->importance_map) { input_image->free(input_image->importance_map); input_image->importance_map = NULL; } } LIQ_NONNULL static void liq_image_free_maps(liq_image *input_image) { liq_image_free_importance_map(input_image); if (input_image->edges) { input_image->free(input_image->edges); input_image->edges = NULL; } liq_image_free_dither_map(input_image); } LIQ_NONNULL static void liq_image_free_dither_map(liq_image *input_image) { if (input_image->dither_map) { input_image->free(input_image->dither_map); input_image->dither_map = NULL; } } LIQ_EXPORT LIQ_NONNULL void liq_image_destroy(liq_image *input_image) { if (!CHECK_STRUCT_TYPE(input_image, liq_image)) return; liq_image_free_rgba_source(input_image); liq_image_free_maps(input_image); if (input_image->f_pixels) { input_image->free(input_image->f_pixels); } if (input_image->temp_row) { input_image->free(input_image->temp_row); } if (input_image->temp_f_row) { input_image->free(input_image->temp_f_row); } if (input_image->background) { liq_image_destroy(input_image->background); } input_image->magic_header = liq_freed_magic; input_image->free(input_image); } LIQ_EXPORT liq_histogram* liq_histogram_create(const liq_attr* attr) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) { return NULL; } liq_histogram *hist = attr->malloc(sizeof(liq_histogram)); if (!hist) return NULL; *hist = (liq_histogram) { .magic_header = liq_histogram_magic, .malloc = attr->malloc, .free = attr->free, .ignorebits = MAX(attr->min_posterization_output, attr->min_posterization_input), }; return hist; } LIQ_EXPORT LIQ_NONNULL void liq_histogram_destroy(liq_histogram *hist) { if (!CHECK_STRUCT_TYPE(hist, liq_histogram)) return; hist->magic_header = liq_freed_magic; pam_freeacolorhash(hist->acht); hist->free(hist); } LIQ_EXPORT LIQ_NONNULL liq_result *liq_quantize_image(liq_attr *attr, liq_image *img) { liq_result *res; if (LIQ_OK != liq_image_quantize(img, attr, &res)) { return NULL; } return res; } LIQ_EXPORT LIQ_NONNULL liq_error liq_image_quantize(liq_image *const img, liq_attr *const attr, liq_result **result_output) { if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return LIQ_INVALID_POINTER; if (!liq_image_has_rgba_pixels(img)) { return LIQ_UNSUPPORTED; } liq_histogram *hist = liq_histogram_create(attr); if (!hist) { return LIQ_OUT_OF_MEMORY; } liq_error err = liq_histogram_add_image(hist, attr, img); if (LIQ_OK != err) { liq_histogram_destroy(hist); return err; } err = liq_histogram_quantize_internal(hist, attr, false, result_output); liq_histogram_destroy(hist); return err; } LIQ_EXPORT LIQ_NONNULL liq_error liq_histogram_quantize(liq_histogram *input_hist, liq_attr *attr, liq_result **result_output) { return liq_histogram_quantize_internal(input_hist, attr, true, result_output); } LIQ_NONNULL static liq_error liq_histogram_quantize_internal(liq_histogram *input_hist, liq_attr *attr, bool fixed_result_colors, liq_result **result_output) { if (!CHECK_USER_POINTER(result_output)) return LIQ_INVALID_POINTER; *result_output = NULL; if (!CHECK_STRUCT_TYPE(attr, liq_attr)) return LIQ_INVALID_POINTER; if (!CHECK_STRUCT_TYPE(input_hist, liq_histogram)) return LIQ_INVALID_POINTER; if (liq_progress(attr, 0)) return LIQ_ABORTED; histogram *hist; liq_error err = finalize_histogram(input_hist, attr, &hist); if (err != LIQ_OK) { return err; } err = pngquant_quantize(hist, attr, input_hist->fixed_colors_count, input_hist->fixed_colors, input_hist->gamma, fixed_result_colors, result_output); pam_freeacolorhist(hist); return err; } LIQ_EXPORT LIQ_NONNULL liq_error liq_set_dithering_level(liq_result *res, float dither_level) { if (!CHECK_STRUCT_TYPE(res, liq_result)) return LIQ_INVALID_POINTER; if (res->remapping) { liq_remapping_result_destroy(res->remapping); res->remapping = NULL; } if (dither_level < 0 || dither_level > 1.0f) return LIQ_VALUE_OUT_OF_RANGE; res->dither_level = dither_level; return LIQ_OK; } LIQ_NONNULL static liq_remapping_result *liq_remapping_result_create(liq_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_result)) { return NULL; } liq_remapping_result *res = result->malloc(sizeof(liq_remapping_result)); if (!res) return NULL; *res = (liq_remapping_result) { .magic_header = liq_remapping_result_magic, .malloc = result->malloc, .free = result->free, .dither_level = result->dither_level, .use_dither_map = result->use_dither_map, .palette_error = result->palette_error, .gamma = result->gamma, .palette = pam_duplicate_colormap(result->palette), .progress_callback = result->progress_callback, .progress_callback_user_info = result->progress_callback_user_info, .progress_stage1 = result->use_dither_map ? 20 : 0, }; return res; } LIQ_EXPORT LIQ_NONNULL double liq_get_output_gamma(const liq_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_result)) return -1; return result->gamma; } LIQ_NONNULL static void liq_remapping_result_destroy(liq_remapping_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_remapping_result)) return; if (result->palette) pam_freecolormap(result->palette); if (result->pixels) result->free(result->pixels); result->magic_header = liq_freed_magic; result->free(result); } LIQ_EXPORT LIQ_NONNULL void liq_result_destroy(liq_result *res) { if (!CHECK_STRUCT_TYPE(res, liq_result)) return; memset(&res->int_palette, 0, sizeof(liq_palette)); if (res->remapping) { memset(&res->remapping->int_palette, 0, sizeof(liq_palette)); liq_remapping_result_destroy(res->remapping); } pam_freecolormap(res->palette); res->magic_header = liq_freed_magic; res->free(res); } LIQ_EXPORT LIQ_NONNULL double liq_get_quantization_error(const liq_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_result)) return -1; if (result->palette_error >= 0) { return mse_to_standard_mse(result->palette_error); } return -1; } LIQ_EXPORT LIQ_NONNULL double liq_get_remapping_error(const liq_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_result)) return -1; if (result->remapping && result->remapping->palette_error >= 0) { return mse_to_standard_mse(result->remapping->palette_error); } return -1; } LIQ_EXPORT LIQ_NONNULL int liq_get_quantization_quality(const liq_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_result)) return -1; if (result->palette_error >= 0) { return mse_to_quality(result->palette_error); } return -1; } LIQ_EXPORT LIQ_NONNULL int liq_get_remapping_quality(const liq_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_result)) return -1; if (result->remapping && result->remapping->palette_error >= 0) { return mse_to_quality(result->remapping->palette_error); } return -1; } LIQ_NONNULL static int compare_popularity(const void *ch1, const void *ch2) { const float v1 = ((const colormap_item*)ch1)->popularity; const float v2 = ((const colormap_item*)ch2)->popularity; return v1 > v2 ? -1 : 1; } LIQ_NONNULL static void sort_palette_qsort(colormap *map, int start, int nelem) { if (!nelem) return; qsort(map->palette + start, nelem, sizeof(map->palette[0]), compare_popularity); } #define SWAP_PALETTE(map, a,b) { \ const colormap_item tmp = (map)->palette[(a)]; \ (map)->palette[(a)] = (map)->palette[(b)]; \ (map)->palette[(b)] = tmp; } LIQ_NONNULL static void sort_palette(colormap *map, const liq_attr *options) { /* ** Step 3.5 [GRR]: remap the palette colors so that all entries with ** the maximal alpha value (i.e., fully opaque) are at the end and can ** therefore be omitted from the tRNS chunk. */ if (options->last_index_transparent) { for(unsigned int i=0; i < map->colors; i++) { if (map->palette[i].acolor.a < MIN_OPAQUE_A) { const unsigned int old = i, transparent_dest = map->colors-1; SWAP_PALETTE(map, transparent_dest, old); /* colors sorted by popularity make pngs slightly more compressible */ sort_palette_qsort(map, 0, map->colors-1); return; } } } unsigned int non_fixed_colors = 0; for(unsigned int i = 0; i < map->colors; i++) { if (map->palette[i].fixed) { break; } non_fixed_colors++; } /* move transparent colors to the beginning to shrink trns chunk */ unsigned int num_transparent = 0; for(unsigned int i = 0; i < non_fixed_colors; i++) { if (map->palette[i].acolor.a < 255.f/256.f * LIQ_WEIGHT_A) { // current transparent color is swapped with earlier opaque one if (i != num_transparent) { SWAP_PALETTE(map, num_transparent, i); i--; } num_transparent++; } } liq_verbose_printf(options, " eliminated opaque tRNS-chunk entries...%d entr%s transparent", num_transparent, (num_transparent == 1)? "y" : "ies"); /* colors sorted by popularity make pngs slightly more compressible * opaque and transparent are sorted separately */ sort_palette_qsort(map, 0, num_transparent); sort_palette_qsort(map, num_transparent, non_fixed_colors - num_transparent); if (non_fixed_colors > 9 && map->colors > 16) { SWAP_PALETTE(map, 7, 1); // slightly improves compression SWAP_PALETTE(map, 8, 2); SWAP_PALETTE(map, 9, 3); } } inline static unsigned int posterize_channel(unsigned int color, unsigned int bits) { return (color & ~((1<> (8-bits)); } LIQ_NONNULL static void set_rounded_palette(liq_palette *const dest, colormap *const map, const double gamma, unsigned int posterize) { float gamma_lut[256]; to_f_set_gamma(gamma_lut, gamma); dest->count = map->colors; for(unsigned int x = 0; x < map->colors; ++x) { liq_color px = f_to_rgb(gamma, map->palette[x].acolor); px.r = posterize_channel(px.r, posterize); px.g = posterize_channel(px.g, posterize); px.b = posterize_channel(px.b, posterize); px.a = posterize_channel(px.a, posterize); map->palette[x].acolor = rgba_to_f(gamma_lut, px); /* saves rounding error introduced by to_rgb, which makes remapping & dithering more accurate */ if (!px.a && !map->palette[x].fixed) { px.r = 71; px.g = 112; px.b = 76; } dest->entries[x] = (liq_color){.r=px.r,.g=px.g,.b=px.b,.a=px.a}; } } LIQ_EXPORT LIQ_NONNULL const liq_palette *liq_get_palette(liq_result *result) { if (!CHECK_STRUCT_TYPE(result, liq_result)) return NULL; if (result->remapping && result->remapping->int_palette.count) { return &result->remapping->int_palette; } if (!result->int_palette.count) { set_rounded_palette(&result->int_palette, result->palette, result->gamma, result->min_posterization_output); } return &result->int_palette; } LIQ_EXPORT LIQ_NONNULL liq_error liq_histogram_add_colors(liq_histogram *input_hist, const liq_attr *options, const liq_histogram_entry entries[], int num_entries, double gamma) { if (!CHECK_STRUCT_TYPE(options, liq_attr)) return LIQ_INVALID_POINTER; if (!CHECK_STRUCT_TYPE(input_hist, liq_histogram)) return LIQ_INVALID_POINTER; if (!CHECK_USER_POINTER(entries)) return LIQ_INVALID_POINTER; if (gamma < 0 || gamma >= 1.0) return LIQ_VALUE_OUT_OF_RANGE; if (num_entries <= 0 || num_entries > 1<<30) return LIQ_VALUE_OUT_OF_RANGE; if (input_hist->ignorebits > 0 && input_hist->had_image_added) { return LIQ_UNSUPPORTED; } input_hist->ignorebits = 0; input_hist->had_image_added = true; input_hist->gamma = gamma ? gamma : 0.45455; if (!input_hist->acht) { input_hist->acht = pam_allocacolorhash(~0, num_entries*num_entries, 0, options->malloc, options->free); if (!input_hist->acht) { return LIQ_OUT_OF_MEMORY; } } // Fake image size. It's only for hash size estimates. if (!input_hist->acht->cols) { input_hist->acht->cols = num_entries; } input_hist->acht->rows += num_entries; const unsigned int hash_size = input_hist->acht->hash_size; for(int i=0; i < num_entries; i++) { const liq_color rgba = { .r = entries[i].color.r, .g = entries[i].color.g, .b = entries[i].color.b, .a = entries[i].color.a, }; union rgba_as_int px = {rgba}; unsigned int hash; if (px.rgba.a) { hash = px.l % hash_size; } else { hash=0; px.l=0; } if (!pam_add_to_hash(input_hist->acht, hash, entries[i].count, px, i, num_entries)) { return LIQ_OUT_OF_MEMORY; } } return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL liq_error liq_histogram_add_image(liq_histogram *input_hist, const liq_attr *options, liq_image *input_image) { if (!CHECK_STRUCT_TYPE(options, liq_attr)) return LIQ_INVALID_POINTER; if (!CHECK_STRUCT_TYPE(input_hist, liq_histogram)) return LIQ_INVALID_POINTER; if (!CHECK_STRUCT_TYPE(input_image, liq_image)) return LIQ_INVALID_POINTER; const unsigned int cols = input_image->width, rows = input_image->height; if (!input_image->importance_map && options->use_contrast_maps) { contrast_maps(input_image); } input_hist->gamma = input_image->gamma; for(int i = 0; i < input_image->fixed_colors_count; i++) { liq_error res = liq_histogram_add_fixed_color_f(input_hist, input_image->fixed_colors[i]); if (res != LIQ_OK) { return res; } } /* ** Step 2: attempt to make a histogram of the colors, unclustered. ** If at first we don't succeed, increase ignorebits to increase color ** coherence and try again. */ if (liq_progress(options, options->progress_stage1 * 0.4f)) { return LIQ_ABORTED; } const bool all_rows_at_once = liq_image_can_use_rgba_rows(input_image); // Usual solution is to start from scratch when limit is exceeded, but that's not possible if it's not // the first image added const unsigned int max_histogram_entries = input_hist->had_image_added ? ~0 : options->max_histogram_entries; do { if (!input_hist->acht) { input_hist->acht = pam_allocacolorhash(max_histogram_entries, rows*cols, input_hist->ignorebits, options->malloc, options->free); } if (!input_hist->acht) return LIQ_OUT_OF_MEMORY; // histogram uses noise contrast map for importance. Color accuracy in noisy areas is not very important. // noise map does not include edges to avoid ruining anti-aliasing for(unsigned int row=0; row < rows; row++) { bool added_ok; if (all_rows_at_once) { added_ok = pam_computeacolorhash(input_hist->acht, (const liq_color *const *)input_image->rows, cols, rows, input_image->importance_map); if (added_ok) break; } else { const liq_color* rows_p[1] = { liq_image_get_row_rgba(input_image, row) }; added_ok = pam_computeacolorhash(input_hist->acht, rows_p, cols, 1, input_image->importance_map ? &input_image->importance_map[row * cols] : NULL); } if (!added_ok) { input_hist->ignorebits++; liq_verbose_printf(options, " too many colors! Scaling colors to improve clustering... %d", input_hist->ignorebits); pam_freeacolorhash(input_hist->acht); input_hist->acht = NULL; if (liq_progress(options, options->progress_stage1 * 0.6f)) return LIQ_ABORTED; break; } } } while(!input_hist->acht); input_hist->had_image_added = true; liq_image_free_importance_map(input_image); if (input_image->free_pixels && input_image->f_pixels) { liq_image_free_rgba_source(input_image); // bow can free the RGBA source if copy has been made in f_pixels } return LIQ_OK; } LIQ_NONNULL static liq_error finalize_histogram(liq_histogram *input_hist, liq_attr *options, histogram **hist_output) { if (liq_progress(options, options->progress_stage1 * 0.9f)) { return LIQ_ABORTED; } if (!input_hist->acht) { return LIQ_BITMAP_NOT_AVAILABLE; } histogram *hist = pam_acolorhashtoacolorhist(input_hist->acht, input_hist->gamma, options->malloc, options->free); pam_freeacolorhash(input_hist->acht); input_hist->acht = NULL; if (!hist) { return LIQ_OUT_OF_MEMORY; } liq_verbose_printf(options, " made histogram...%d colors found", hist->size); remove_fixed_colors_from_histogram(hist, input_hist->fixed_colors_count, input_hist->fixed_colors, options->target_mse); *hist_output = hist; return LIQ_OK; } /** Builds two maps: importance_map - approximation of areas with high-frequency noise, except straight edges. 1=flat, 0=noisy. edges - noise map including all edges */ LIQ_NONNULL static void contrast_maps(liq_image *image) { const unsigned int cols = image->width, rows = image->height; if (cols < 4 || rows < 4 || (3*cols*rows) > LIQ_HIGH_MEMORY_LIMIT) { return; } unsigned char *restrict noise = image->importance_map ? image->importance_map : image->malloc(cols*rows); image->importance_map = NULL; unsigned char *restrict edges = image->edges ? image->edges : image->malloc(cols*rows); image->edges = NULL; unsigned char *restrict tmp = image->malloc(cols*rows); if (!noise || !edges || !tmp || !liq_image_get_row_f_init(image)) { image->free(noise); image->free(edges); image->free(tmp); return; } const f_pixel *curr_row, *prev_row, *next_row; curr_row = prev_row = next_row = liq_image_get_row_f(image, 0); for (unsigned int j=0; j < rows; j++) { prev_row = curr_row; curr_row = next_row; next_row = liq_image_get_row_f(image, MIN(rows-1,j+1)); f_pixel prev, curr = curr_row[0], next=curr; for (unsigned int i=0; i < cols; i++) { prev=curr; curr=next; next = curr_row[MIN(cols-1,i+1)]; // contrast is difference between pixels neighbouring horizontally and vertically const float a = fabsf(prev.a+next.a - curr.a*2.f), r = fabsf(prev.r+next.r - curr.r*2.f), g = fabsf(prev.g+next.g - curr.g*2.f), b = fabsf(prev.b+next.b - curr.b*2.f); const f_pixel prevl = prev_row[i]; const f_pixel nextl = next_row[i]; const float a1 = fabsf(prevl.a+nextl.a - curr.a*2.f), r1 = fabsf(prevl.r+nextl.r - curr.r*2.f), g1 = fabsf(prevl.g+nextl.g - curr.g*2.f), b1 = fabsf(prevl.b+nextl.b - curr.b*2.f); const float horiz = MAX(MAX(a,r),MAX(g,b)); const float vert = MAX(MAX(a1,r1),MAX(g1,b1)); const float edge = MAX(horiz,vert); float z = edge - fabsf(horiz-vert)*.5f; z = 1.f - MAX(z,MIN(horiz,vert)); z *= z; // noise is amplified z *= z; // 85 is about 1/3rd of weight (not 0, because noisy pixels still need to be included, just not as precisely). const unsigned int z_int = 80 + (unsigned int)(z * 176.f); noise[j*cols+i] = MIN(z_int, 255); const int e_int = 255 - (int)(edge * 256.f); edges[j*cols+i] = e_int > 0 ? MIN(e_int, 255) : 0; } } // noise areas are shrunk and then expanded to remove thin edges from the map liq_max3(noise, tmp, cols, rows); liq_max3(tmp, noise, cols, rows); liq_blur(noise, tmp, noise, cols, rows, 3); liq_max3(noise, tmp, cols, rows); liq_min3(tmp, noise, cols, rows); liq_min3(noise, tmp, cols, rows); liq_min3(tmp, noise, cols, rows); liq_min3(edges, tmp, cols, rows); liq_max3(tmp, edges, cols, rows); for(unsigned int i=0; i < cols*rows; i++) edges[i] = MIN(noise[i], edges[i]); image->free(tmp); image->importance_map = noise; image->edges = edges; } /** * Builds map of neighbor pixels mapped to the same palette entry * * For efficiency/simplicity it mainly looks for same consecutive pixels horizontally * and peeks 1 pixel above/below. Full 2d algorithm doesn't improve it significantly. * Correct flood fill doesn't have visually good properties. */ LIQ_NONNULL static void update_dither_map(liq_image *input_image, unsigned char *const *const row_pointers, colormap *map) { const unsigned int width = input_image->width; const unsigned int height = input_image->height; unsigned char *const edges = input_image->edges; for(unsigned int row=0; row < height; row++) { unsigned char lastpixel = row_pointers[row][0]; unsigned int lastcol=0; for(unsigned int col=1; col < width; col++) { const unsigned char px = row_pointers[row][col]; if (input_image->background && map->palette[px].acolor.a < MIN_OPAQUE_A) { // Transparency may or may not create an edge. When there's an explicit background set, assume no edge. continue; } if (px != lastpixel || col == width-1) { int neighbor_count = 10 * (col-lastcol); unsigned int i=lastcol; while(i < col) { if (row > 0) { unsigned char pixelabove = row_pointers[row-1][i]; if (pixelabove == lastpixel) neighbor_count += 15; } if (row < height-1) { unsigned char pixelbelow = row_pointers[row+1][i]; if (pixelbelow == lastpixel) neighbor_count += 15; } i++; } while(lastcol <= col) { int e = edges[row*width + lastcol]; edges[row*width + lastcol++] = (e+128) * (255.f/(255+128)) * (1.f - 20.f / (20 + neighbor_count)); } lastpixel = px; } } } input_image->dither_map = input_image->edges; input_image->edges = NULL; } /** * Palette can be NULL, in which case it creates a new palette from scratch. */ static colormap *add_fixed_colors_to_palette(colormap *palette, const int max_colors, const f_pixel fixed_colors[], const int fixed_colors_count, void* (*malloc)(size_t), void (*free)(void*)) { if (!fixed_colors_count) return palette; colormap *newpal = pam_colormap(MIN(max_colors, (palette ? palette->colors : 0) + fixed_colors_count), malloc, free); unsigned int i=0; if (palette && fixed_colors_count < max_colors) { unsigned int palette_max = MIN(palette->colors, max_colors - fixed_colors_count); for(; i < palette_max; i++) { newpal->palette[i] = palette->palette[i]; } } for(int j=0; j < MIN(max_colors, fixed_colors_count); j++) { newpal->palette[i++] = (colormap_item){ .acolor = fixed_colors[j], .fixed = true, }; } if (palette) pam_freecolormap(palette); return newpal; } LIQ_NONNULL static void adjust_histogram_callback(hist_item *item, float diff) { item->adjusted_weight = (item->perceptual_weight + 2.f * item->adjusted_weight) * (0.5f + diff); } /** Repeats mediancut with different histogram weights to find palette with minimum error. feedback_loop_trials controls how long the search will take. < 0 skips the iteration. */ static colormap *find_best_palette(histogram *hist, const liq_attr *options, const double max_mse, const f_pixel fixed_colors[], const unsigned int fixed_colors_count, double *palette_error_p) { unsigned int max_colors = options->max_colors; // if output is posterized it doesn't make sense to aim for perfrect colors, so increase target_mse // at this point actual gamma is not set, so very conservative posterization estimate is used const double target_mse = MIN(max_mse, MAX(options->target_mse, pow((1<min_posterization_output)/1024.0, 2))); int feedback_loop_trials = options->feedback_loop_trials; if (hist->size > 5000) {feedback_loop_trials = (feedback_loop_trials*3 + 3)/4;} if (hist->size > 25000) {feedback_loop_trials = (feedback_loop_trials*3 + 3)/4;} if (hist->size > 50000) {feedback_loop_trials = (feedback_loop_trials*3 + 3)/4;} if (hist->size > 100000) {feedback_loop_trials = (feedback_loop_trials*3 + 3)/4;} colormap *acolormap = NULL; double least_error = MAX_DIFF; double target_mse_overshoot = feedback_loop_trials>0 ? 1.05 : 1.0; const float total_trials = (float)(feedback_loop_trials>0?feedback_loop_trials:1); int fails_in_a_row=0; do { colormap *newmap; if (hist->size && fixed_colors_count < max_colors) { newmap = mediancut(hist, max_colors-fixed_colors_count, target_mse * target_mse_overshoot, MAX(MAX(45.0/65536.0, target_mse), least_error)*1.2, options->malloc, options->free); } else { feedback_loop_trials = 0; newmap = NULL; } newmap = add_fixed_colors_to_palette(newmap, max_colors, fixed_colors, fixed_colors_count, options->malloc, options->free); if (!newmap) { return NULL; } if (feedback_loop_trials <= 0) { return newmap; } // after palette has been created, total error (MSE) is calculated to keep the best palette // at the same time K-Means iteration is done to improve the palette // and histogram weights are adjusted based on remapping error to give more weight to poorly matched colors const bool first_run_of_target_mse = !acolormap && target_mse > 0; double total_error = kmeans_do_iteration(hist, newmap, first_run_of_target_mse ? NULL : adjust_histogram_callback, omp_get_max_threads()); // goal is to increase quality or to reduce number of colors used if quality is good enough if (!acolormap || total_error < least_error || (total_error <= target_mse && newmap->colors < max_colors)) { if (acolormap) pam_freecolormap(acolormap); acolormap = newmap; if (total_error < target_mse && total_error > 0) { // K-Means iteration improves quality above what mediancut aims for // this compensates for it, making mediancut aim for worse target_mse_overshoot = MIN(target_mse_overshoot*1.25, target_mse/total_error); } least_error = total_error; // if number of colors could be reduced, try to keep it that way // but allow extra color as a bit of wiggle room in case quality can be improved too max_colors = MIN(newmap->colors+1, max_colors); feedback_loop_trials -= 1; // asymptotic improvement could make it go on forever fails_in_a_row = 0; } else { fails_in_a_row++; target_mse_overshoot = 1.0; // if error is really bad, it's unlikely to improve, so end sooner feedback_loop_trials -= 5 + fails_in_a_row; pam_freecolormap(newmap); } float fraction_done = 1.f-MAX(0.f, feedback_loop_trials/total_trials); if (liq_progress(options, options->progress_stage1 + fraction_done * options->progress_stage2)) break; liq_verbose_printf(options, " selecting colors...%d%%", (int)(100.f * fraction_done)); } while(feedback_loop_trials > 0); *palette_error_p = least_error; return acolormap; } LIQ_NONNULL static liq_error pngquant_quantize(histogram *hist, const liq_attr *options, const int fixed_colors_count, const f_pixel fixed_colors[], const double gamma, bool fixed_result_colors, liq_result **result_output) { colormap *acolormap; double palette_error = -1; assert((verbose_print(options, "SLOW debug checks enabled. Recompile with NDEBUG for normal operation."),1)); const bool few_input_colors = hist->size+fixed_colors_count <= options->max_colors; if (liq_progress(options, options->progress_stage1)) return LIQ_ABORTED; // If image has few colors to begin with (and no quality degradation is required) // then it's possible to skip quantization entirely if (few_input_colors && options->target_mse == 0) { colormap *hist_pal = histogram_to_palette(hist, options->malloc, options->free); acolormap = add_fixed_colors_to_palette(hist_pal, options->max_colors, fixed_colors, fixed_colors_count, options->malloc, options->free); palette_error = 0; } else { const double max_mse = options->max_mse * (few_input_colors ? 0.33 : 1.0); // when degrading image that's already paletted, require much higher improvement, since pal2pal often looks bad and there's little gain acolormap = find_best_palette(hist, options, max_mse, fixed_colors, fixed_colors_count, &palette_error); if (!acolormap) { return LIQ_VALUE_OUT_OF_RANGE; } // K-Means iteration approaches local minimum for the palette double iteration_limit = options->kmeans_iteration_limit; unsigned int iterations = options->kmeans_iterations; if (!iterations && palette_error < 0 && max_mse < MAX_DIFF) iterations = 1; // otherwise total error is never calculated and MSE limit won't work if (iterations) { // likely_colormap_index (used and set in kmeans_do_iteration) can't point to index outside colormap hist_reset_colors(hist, acolormap->colors); if (hist->size > 5000) {iterations = (iterations*3 + 3)/4;} if (hist->size > 25000) {iterations = (iterations*3 + 3)/4;} if (hist->size > 50000) {iterations = (iterations*3 + 3)/4;} if (hist->size > 100000) {iterations = (iterations*3 + 3)/4; iteration_limit *= 2;} verbose_print(options, " moving colormap towards local minimum"); double previous_palette_error = MAX_DIFF; for(unsigned int i=0; i < iterations; i++) { palette_error = kmeans_do_iteration(hist, acolormap, NULL, omp_get_max_threads()); if (liq_progress(options, options->progress_stage1 + options->progress_stage2 + (i * options->progress_stage3 * 0.9f) / iterations)) { break; } if (fabs(previous_palette_error-palette_error) < iteration_limit) { break; } if (palette_error > max_mse*1.5) { // probably hopeless if (palette_error > max_mse*3.0) break; // definitely hopeless i++; } previous_palette_error = palette_error; } } if (palette_error > max_mse) { liq_verbose_printf(options, " image degradation MSE=%.3f (Q=%d) exceeded limit of %.3f (%d)", mse_to_standard_mse(palette_error), mse_to_quality(palette_error), mse_to_standard_mse(max_mse), mse_to_quality(max_mse)); pam_freecolormap(acolormap); return LIQ_QUALITY_TOO_LOW; } } if (liq_progress(options, options->progress_stage1 + options->progress_stage2 + options->progress_stage3 * 0.95f)) { pam_freecolormap(acolormap); return LIQ_ABORTED; } sort_palette(acolormap, options); // If palette was created from a multi-image histogram, // then it shouldn't be optimized for one image during remapping if (fixed_result_colors) { for(unsigned int i=0; i < acolormap->colors; i++) { acolormap->palette[i].fixed = true; } } liq_result *result = options->malloc(sizeof(liq_result)); if (!result) return LIQ_OUT_OF_MEMORY; *result = (liq_result){ .magic_header = liq_result_magic, .malloc = options->malloc, .free = options->free, .palette = acolormap, .palette_error = palette_error, .use_dither_map = options->use_dither_map, .gamma = gamma, .min_posterization_output = options->min_posterization_output, }; *result_output = result; return LIQ_OK; } LIQ_EXPORT LIQ_NONNULL liq_error liq_write_remapped_image(liq_result *result, liq_image *input_image, void *buffer, size_t buffer_size) { if (!CHECK_STRUCT_TYPE(result, liq_result)) { return LIQ_INVALID_POINTER; } if (!CHECK_STRUCT_TYPE(input_image, liq_image)) { return LIQ_INVALID_POINTER; } if (!CHECK_USER_POINTER(buffer)) { return LIQ_INVALID_POINTER; } const size_t required_size = (size_t)input_image->width * (size_t)input_image->height; if (buffer_size < required_size) { return LIQ_BUFFER_TOO_SMALL; } unsigned char **rows = input_image->malloc(input_image->height * sizeof(unsigned char *)); unsigned char *buffer_bytes = buffer; for(unsigned int i=0; i < input_image->height; i++) { rows[i] = &buffer_bytes[input_image->width * i]; } liq_error err = liq_write_remapped_image_rows(result, input_image, rows); input_image->free(rows); return err; } LIQ_EXPORT LIQ_NONNULL liq_error liq_write_remapped_image_rows(liq_result *quant, liq_image *input_image, unsigned char **row_pointers) { if (!CHECK_STRUCT_TYPE(quant, liq_result)) return LIQ_INVALID_POINTER; if (!CHECK_STRUCT_TYPE(input_image, liq_image)) return LIQ_INVALID_POINTER; for(unsigned int i=0; i < input_image->height; i++) { if (!CHECK_USER_POINTER(row_pointers+i) || !CHECK_USER_POINTER(row_pointers[i])) return LIQ_INVALID_POINTER; } if (quant->remapping) { liq_remapping_result_destroy(quant->remapping); } liq_remapping_result *const result = quant->remapping = liq_remapping_result_create(quant); if (!result) return LIQ_OUT_OF_MEMORY; if (!input_image->edges && !input_image->dither_map && quant->use_dither_map) { contrast_maps(input_image); } if (liq_remap_progress(result, result->progress_stage1 * 0.25f)) { return LIQ_ABORTED; } /* ** Step 4: map the colors in the image to their closest match in the ** new colormap, and write 'em out. */ float remapping_error = result->palette_error; if (result->dither_level == 0) { set_rounded_palette(&result->int_palette, result->palette, result->gamma, quant->min_posterization_output); remapping_error = remap_to_palette(input_image, row_pointers, result->palette); } else { const bool is_image_huge = (input_image->width * input_image->height) > 2000 * 2000; const bool allow_dither_map = result->use_dither_map == 2 || (!is_image_huge && result->use_dither_map); const bool generate_dither_map = allow_dither_map && (input_image->edges && !input_image->dither_map); if (generate_dither_map) { // If dithering (with dither map) is required, this image is used to find areas that require dithering remapping_error = remap_to_palette(input_image, row_pointers, result->palette); update_dither_map(input_image, row_pointers, result->palette); } if (liq_remap_progress(result, result->progress_stage1 * 0.5f)) { return LIQ_ABORTED; } // remapping above was the last chance to do K-Means iteration, hence the final palette is set after remapping set_rounded_palette(&result->int_palette, result->palette, result->gamma, quant->min_posterization_output); if (!remap_to_palette_floyd(input_image, row_pointers, result, MAX(remapping_error*2.4f, 8.f/256.f), generate_dither_map)) { return LIQ_ABORTED; } } // remapping error from dithered image is absurd, so always non-dithered value is used // palette_error includes some perceptual weighting from histogram which is closer correlated with dssim // so that should be used when possible. if (result->palette_error < 0) { result->palette_error = remapping_error; } return LIQ_OK; } LIQ_EXPORT int liq_version() { return LIQ_VERSION; } libimagequant-2.18.0/libimagequant.cs000066400000000000000000000147171436525270400176170ustar00rootroot00000000000000/* This is an example demonstrating use of libimagequant from C#. This example code can be freely copied under CC0 (public domain) license. */ using System; using System.Collections.Generic; using System.Runtime.InteropServices; [StructLayout(LayoutKind.Sequential)] struct liq_color { public byte r, g, b, a; }; [StructLayout(LayoutKind.Sequential)] struct liq_palette { public int count; [MarshalAs(UnmanagedType.ByValArray, SizeConst = 256)] public liq_color[] entries; }; enum liq_error { LIQ_OK = 0, LIQ_QUALITY_TOO_LOW = 99, LIQ_VALUE_OUT_OF_RANGE = 100, LIQ_OUT_OF_MEMORY, LIQ_ABORTED, LIQ_BITMAP_NOT_AVAILABLE, LIQ_BUFFER_TOO_SMALL, LIQ_INVALID_POINTER, }; namespace liq { using liq_attr_ptr = IntPtr; using liq_image_ptr = IntPtr; using liq_result_ptr = IntPtr; using size_t = UIntPtr; class Liq { [DllImport(@"imagequant.dll")] public static extern liq_attr_ptr liq_attr_create(); [DllImport(@"imagequant.dll")] public static extern liq_attr_ptr liq_attr_copy(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern void liq_attr_destroy(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern liq_error liq_set_max_colors(liq_attr_ptr attr, int colors); [DllImport(@"imagequant.dll")] public static extern int liq_get_max_colors(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern liq_error liq_set_speed(liq_attr_ptr attr, int speed); [DllImport(@"imagequant.dll")] public static extern int liq_get_speed(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern liq_error liq_set_min_opacity(liq_attr_ptr attr, int min); [DllImport(@"imagequant.dll")] public static extern int liq_get_min_opacity(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern liq_error liq_set_min_posterization(liq_attr_ptr attr, int bits); [DllImport(@"imagequant.dll")] public static extern int liq_get_min_posterization(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern liq_error liq_set_quality(liq_attr_ptr attr, int minimum, int maximum); [DllImport(@"imagequant.dll")] public static extern int liq_get_min_quality(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern int liq_get_max_quality(liq_attr_ptr attr); [DllImport(@"imagequant.dll")] public static extern void liq_set_last_index_transparent(liq_attr_ptr attr, int is_last); [DllImport(@"imagequant.dll")] public static extern liq_image_ptr liq_image_create_rgba(liq_attr_ptr attr, [In, MarshalAs(UnmanagedType.LPArray)] byte[] bitmap, int width, int height, double gamma); [DllImport(@"imagequant.dll")] public static extern liq_error liq_image_set_memory_ownership(liq_image_ptr image, int ownership_flags); [DllImport(@"imagequant.dll")] public static extern liq_error liq_image_add_fixed_color(liq_image_ptr img, liq_color color); [DllImport(@"imagequant.dll")] public static extern int liq_image_get_width(liq_image_ptr img); [DllImport(@"imagequant.dll")] public static extern int liq_image_get_height(liq_image_ptr img); [DllImport(@"imagequant.dll")] public static extern void liq_image_destroy(liq_image_ptr img); [DllImport(@"imagequant.dll")] public static extern liq_result_ptr liq_quantize_image(liq_attr_ptr attr, liq_image_ptr input_image); [DllImport(@"imagequant.dll")] public static extern liq_error liq_set_dithering_level(liq_result_ptr res, float dither_level); [DllImport(@"imagequant.dll")] public static extern liq_error liq_set_output_gamma(liq_result_ptr res, double gamma); [DllImport(@"imagequant.dll")] public static extern double liq_get_output_gamma(liq_result_ptr res); [DllImport(@"imagequant.dll")] public static extern IntPtr liq_get_palette(liq_result_ptr res); [DllImport(@"imagequant.dll")] public static extern liq_error liq_write_remapped_image(liq_result_ptr res, liq_image_ptr input_image, [Out, MarshalAs(UnmanagedType.LPArray)] byte[] buffer, size_t buffer_size); [DllImport(@"imagequant.dll")] public static extern double liq_get_quantization_error(liq_result_ptr res); [DllImport(@"imagequant.dll")] public static extern int liq_get_quantization_quality(liq_result_ptr res); [DllImport(@"imagequant.dll")] public static extern double liq_get_remapping_error(liq_result_ptr res); [DllImport(@"imagequant.dll")] public static extern int liq_get_remapping_quality(liq_result_ptr res); [DllImport(@"imagequant.dll")] public static extern void liq_result_destroy(liq_result_ptr res); [DllImport(@"imagequant.dll")] public static extern int liq_version(); static void Main(string[] args) { Console.WriteLine("library version: {0}", liq_version()); int width = 3; int height = 1; var attr = liq_attr_create(); if (attr == IntPtr.Zero) throw new Exception("can't create attr"); byte[] bitmap = { // R, G, B, A, R, G, B, A, ... 111, 222, 33, 255, 255, 0, 255, 255, 255, 0, 255, 255, }; var img = liq_image_create_rgba(attr, bitmap, width, height, 0); if (img == IntPtr.Zero) throw new Exception("can't create image"); var res = liq_quantize_image(attr, img); if (res == IntPtr.Zero) throw new Exception("can't quantize image"); var buffer_size = width * height; var remapped = new byte[buffer_size]; var err = liq_write_remapped_image(res, img, remapped, (UIntPtr)buffer_size); if (err != liq_error.LIQ_OK) { throw new Exception("remapping error"); } Console.WriteLine("first pixel is {0}th palette entry", remapped[0]); liq_palette pal = (liq_palette)Marshal.PtrToStructure(liq_get_palette(res), typeof(liq_palette)); Console.WriteLine("palette entries: {0}; red of first entry: {1}", pal.count, pal.entries[0].r); liq_image_destroy(img); liq_result_destroy(res); liq_attr_destroy(attr); } } } libimagequant-2.18.0/libimagequant.h000066400000000000000000000154361436525270400174400ustar00rootroot00000000000000/* * https://pngquant.org */ #ifndef LIBIMAGEQUANT_H #define LIBIMAGEQUANT_H #ifdef IMAGEQUANT_EXPORTS #define LIQ_EXPORT __declspec(dllexport) #endif #ifndef LIQ_EXPORT #define LIQ_EXPORT extern #endif #define LIQ_VERSION 21800 #define LIQ_VERSION_STRING "2.18.0" #ifndef LIQ_PRIVATE #if defined(__GNUC__) || defined (__llvm__) #define LIQ_PRIVATE __attribute__((visibility("hidden"))) #define LIQ_NONNULL __attribute__((nonnull)) #define LIQ_USERESULT __attribute__((warn_unused_result)) #else #define LIQ_PRIVATE #define LIQ_NONNULL #define LIQ_USERESULT #endif #endif #ifdef __cplusplus extern "C" { #endif #include typedef struct liq_attr liq_attr; typedef struct liq_image liq_image; typedef struct liq_result liq_result; typedef struct liq_histogram liq_histogram; typedef struct liq_color { unsigned char r, g, b, a; } liq_color; typedef struct liq_palette { unsigned int count; liq_color entries[256]; } liq_palette; typedef enum liq_error { LIQ_OK = 0, LIQ_QUALITY_TOO_LOW = 99, LIQ_VALUE_OUT_OF_RANGE = 100, LIQ_OUT_OF_MEMORY, LIQ_ABORTED, LIQ_BITMAP_NOT_AVAILABLE, LIQ_BUFFER_TOO_SMALL, LIQ_INVALID_POINTER, LIQ_UNSUPPORTED, } liq_error; enum liq_ownership { LIQ_OWN_ROWS=4, LIQ_OWN_PIXELS=8, LIQ_COPY_PIXELS=16, }; typedef struct liq_histogram_entry { liq_color color; unsigned int count; } liq_histogram_entry; LIQ_EXPORT LIQ_USERESULT liq_attr* liq_attr_create(void); LIQ_EXPORT LIQ_USERESULT liq_attr* liq_attr_create_with_allocator(void* (*malloc)(size_t), void (*free)(void*)); LIQ_EXPORT LIQ_USERESULT liq_attr* liq_attr_copy(const liq_attr *orig) LIQ_NONNULL; LIQ_EXPORT void liq_attr_destroy(liq_attr *attr) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT liq_histogram* liq_histogram_create(const liq_attr* attr); LIQ_EXPORT liq_error liq_histogram_add_image(liq_histogram *hist, const liq_attr *attr, liq_image* image) LIQ_NONNULL; LIQ_EXPORT liq_error liq_histogram_add_colors(liq_histogram *hist, const liq_attr *attr, const liq_histogram_entry entries[], int num_entries, double gamma) LIQ_NONNULL; LIQ_EXPORT liq_error liq_histogram_add_fixed_color(liq_histogram *hist, liq_color color, double gamma) LIQ_NONNULL; LIQ_EXPORT void liq_histogram_destroy(liq_histogram *hist) LIQ_NONNULL; LIQ_EXPORT liq_error liq_set_max_colors(liq_attr* attr, int colors) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_get_max_colors(const liq_attr* attr) LIQ_NONNULL; LIQ_EXPORT liq_error liq_set_speed(liq_attr* attr, int speed) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_get_speed(const liq_attr* attr) LIQ_NONNULL; LIQ_EXPORT liq_error liq_set_min_opacity(liq_attr* attr, int min) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_get_min_opacity(const liq_attr* attr) LIQ_NONNULL; LIQ_EXPORT liq_error liq_set_min_posterization(liq_attr* attr, int bits) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_get_min_posterization(const liq_attr* attr) LIQ_NONNULL; LIQ_EXPORT liq_error liq_set_quality(liq_attr* attr, int minimum, int maximum) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_get_min_quality(const liq_attr* attr) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_get_max_quality(const liq_attr* attr) LIQ_NONNULL; LIQ_EXPORT void liq_set_last_index_transparent(liq_attr* attr, int is_last) LIQ_NONNULL; typedef void liq_log_callback_function(const liq_attr*, const char *message, void* user_info); typedef void liq_log_flush_callback_function(const liq_attr*, void* user_info); LIQ_EXPORT void liq_set_log_callback(liq_attr*, liq_log_callback_function*, void* user_info); LIQ_EXPORT void liq_set_log_flush_callback(liq_attr*, liq_log_flush_callback_function*, void* user_info); typedef int liq_progress_callback_function(float progress_percent, void* user_info); LIQ_EXPORT void liq_attr_set_progress_callback(liq_attr*, liq_progress_callback_function*, void* user_info); LIQ_EXPORT void liq_result_set_progress_callback(liq_result*, liq_progress_callback_function*, void* user_info); // The rows and their data are not modified. The type of `rows` is non-const only due to a bug in C's typesystem design. LIQ_EXPORT LIQ_USERESULT liq_image *liq_image_create_rgba_rows(const liq_attr *attr, void *const rows[], int width, int height, double gamma) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT liq_image *liq_image_create_rgba(const liq_attr *attr, const void *bitmap, int width, int height, double gamma) LIQ_NONNULL; typedef void liq_image_get_rgba_row_callback(liq_color row_out[], int row, int width, void* user_info); LIQ_EXPORT LIQ_USERESULT liq_image *liq_image_create_custom(const liq_attr *attr, liq_image_get_rgba_row_callback *row_callback, void* user_info, int width, int height, double gamma); LIQ_EXPORT liq_error liq_image_set_memory_ownership(liq_image *image, int ownership_flags) LIQ_NONNULL; LIQ_EXPORT liq_error liq_image_set_background(liq_image *img, liq_image *background_image) LIQ_NONNULL; LIQ_EXPORT liq_error liq_image_set_importance_map(liq_image *img, unsigned char buffer[], size_t buffer_size, enum liq_ownership memory_handling) LIQ_NONNULL; LIQ_EXPORT liq_error liq_image_add_fixed_color(liq_image *img, liq_color color) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_image_get_width(const liq_image *img) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT int liq_image_get_height(const liq_image *img) LIQ_NONNULL; LIQ_EXPORT void liq_image_destroy(liq_image *img) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT liq_error liq_histogram_quantize(liq_histogram *const input_hist, liq_attr *const options, liq_result **result_output) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT liq_error liq_image_quantize(liq_image *const input_image, liq_attr *const options, liq_result **result_output) LIQ_NONNULL; LIQ_EXPORT liq_error liq_set_dithering_level(liq_result *res, float dither_level) LIQ_NONNULL; LIQ_EXPORT liq_error liq_set_output_gamma(liq_result* res, double gamma) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT double liq_get_output_gamma(const liq_result *result) LIQ_NONNULL; LIQ_EXPORT LIQ_USERESULT const liq_palette *liq_get_palette(liq_result *result) LIQ_NONNULL; LIQ_EXPORT liq_error liq_write_remapped_image(liq_result *result, liq_image *input_image, void *buffer, size_t buffer_size) LIQ_NONNULL; LIQ_EXPORT liq_error liq_write_remapped_image_rows(liq_result *result, liq_image *input_image, unsigned char **row_pointers) LIQ_NONNULL; LIQ_EXPORT double liq_get_quantization_error(const liq_result *result) LIQ_NONNULL; LIQ_EXPORT int liq_get_quantization_quality(const liq_result *result) LIQ_NONNULL; LIQ_EXPORT double liq_get_remapping_error(const liq_result *result) LIQ_NONNULL; LIQ_EXPORT int liq_get_remapping_quality(const liq_result *result) LIQ_NONNULL; LIQ_EXPORT void liq_result_destroy(liq_result *) LIQ_NONNULL; LIQ_EXPORT int liq_version(void); // Deprecated LIQ_EXPORT LIQ_USERESULT liq_result *liq_quantize_image(liq_attr *options, liq_image *input_image) LIQ_NONNULL; #ifdef __cplusplus } #endif #endif libimagequant-2.18.0/libimagequant_private.h000066400000000000000000000030561436525270400211650ustar00rootroot00000000000000 #ifdef _OPENMP #include #define LIQ_TEMP_ROW_WIDTH(img_width) (((img_width) | 15) + 1) /* keep alignment & leave space between rows to avoid cache line contention */ #else #define LIQ_TEMP_ROW_WIDTH(img_width) (img_width) #define omp_get_max_threads() 1 #define omp_get_thread_num() 0 #endif struct liq_image { const char *magic_header; void* (*malloc)(size_t); void (*free)(void*); f_pixel *f_pixels; liq_color **rows; double gamma; unsigned int width, height; unsigned char *importance_map, *edges, *dither_map; liq_color *pixels, *temp_row; f_pixel *temp_f_row; liq_image_get_rgba_row_callback *row_callback; void *row_callback_user_info; liq_image *background; f_pixel fixed_colors[256]; unsigned short fixed_colors_count; bool free_pixels, free_rows, free_rows_internal; }; typedef struct liq_remapping_result { const char *magic_header; void* (*malloc)(size_t); void (*free)(void*); unsigned char *pixels; colormap *palette; liq_progress_callback_function *progress_callback; void *progress_callback_user_info; liq_palette int_palette; double gamma, palette_error; float dither_level; unsigned char use_dither_map; unsigned char progress_stage1; } liq_remapping_result; LIQ_PRIVATE bool liq_image_get_row_f_init(liq_image *img) LIQ_NONNULL; LIQ_PRIVATE const f_pixel *liq_image_get_row_f(liq_image *input_image, unsigned int row) LIQ_NONNULL; LIQ_PRIVATE bool liq_remap_progress(const liq_remapping_result *quant, const float percent) LIQ_NONNULL; libimagequant-2.18.0/mediancut.c000066400000000000000000000367241436525270400165650ustar00rootroot00000000000000/* ** © 2009-2018 by Kornel Lesiński. ** © 1989, 1991 by Jef Poskanzer. ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider. ** ** See COPYRIGHT file for license. */ #include #include #include "libimagequant.h" #include "pam.h" #include "mediancut.h" #define index_of_channel(ch) (offsetof(f_pixel,ch)/sizeof(float)) static f_pixel averagepixels(unsigned int clrs, const hist_item achv[]); struct box { f_pixel color; f_pixel variance; double sum, total_error, max_error; unsigned int ind; unsigned int colors; }; /** Weighted per-channel variance of the box. It's used to decide which channel to split by */ static f_pixel box_variance(const hist_item achv[], const struct box *box) { const f_pixel mean = box->color; double variancea=0, variancer=0, varianceg=0, varianceb=0; for(unsigned int i = 0; i < box->colors; ++i) { const f_pixel px = achv[box->ind + i].acolor; double weight = achv[box->ind + i].adjusted_weight; variancea += (mean.a - px.a)*(mean.a - px.a)*weight; variancer += (mean.r - px.r)*(mean.r - px.r)*weight; varianceg += (mean.g - px.g)*(mean.g - px.g)*weight; varianceb += (mean.b - px.b)*(mean.b - px.b)*weight; } return (f_pixel){ .a = variancea, .r = variancer, .g = varianceg, .b = varianceb, }; } static double box_max_error(const hist_item achv[], const struct box *box) { f_pixel mean = box->color; double max_error = 0; for(unsigned int i = 0; i < box->colors; ++i) { const double diff = colordifference(mean, achv[box->ind + i].acolor); if (diff > max_error) { max_error = diff; } } return max_error; } ALWAYS_INLINE static double color_weight(f_pixel median, hist_item h); static inline void hist_item_swap(hist_item *l, hist_item *r) { if (l != r) { hist_item t = *l; *l = *r; *r = t; } } ALWAYS_INLINE static unsigned int qsort_pivot(const hist_item *const base, const unsigned int len); inline static unsigned int qsort_pivot(const hist_item *const base, const unsigned int len) { if (len < 32) { return len/2; } const unsigned int aidx=8, bidx=len/2, cidx=len-1; const unsigned int a=base[aidx].tmp.sort_value, b=base[bidx].tmp.sort_value, c=base[cidx].tmp.sort_value; return (a < b) ? ((b < c) ? bidx : ((a < c) ? cidx : aidx )) : ((b > c) ? bidx : ((a < c) ? aidx : cidx )); } ALWAYS_INLINE static unsigned int qsort_partition(hist_item *const base, const unsigned int len); inline static unsigned int qsort_partition(hist_item *const base, const unsigned int len) { unsigned int l = 1, r = len; if (len >= 8) { hist_item_swap(&base[0], &base[qsort_pivot(base,len)]); } const unsigned int pivot_value = base[0].tmp.sort_value; while (l < r) { if (base[l].tmp.sort_value >= pivot_value) { l++; } else { while(l < --r && base[r].tmp.sort_value <= pivot_value) {} hist_item_swap(&base[l], &base[r]); } } l--; hist_item_swap(&base[0], &base[l]); return l; } /** quick select algorithm */ static void hist_item_sort_range(hist_item base[], unsigned int len, unsigned int sort_start) { for(;;) { const unsigned int l = qsort_partition(base, len), r = l+1; if (l > 0 && sort_start < l) { len = l; } else if (r < len && sort_start > r) { base += r; len -= r; sort_start -= r; } else break; } } /** sorts array to make sum of weights lower than halfvar one side, returns index of the edge between halfvar parts of the set */ static unsigned int hist_item_sort_halfvar(hist_item base[], unsigned int len, double halfvar) { unsigned int base_idx = 0; // track base-index do { const unsigned int l = qsort_partition(base, len), r = l+1; // check if sum of left side is smaller than half, // if it is, then it doesn't need to be sorted double tmpsum = 0.; for(unsigned int t = 0; t <= l && tmpsum < halfvar; ++t) tmpsum += base[t].color_weight; // the split is on the left part if (tmpsum >= halfvar) { if (l > 0) { len = l; continue; } else { // reached the end of left part return base_idx; } } // process the right part halfvar -= tmpsum; if (len > r) { base += r; base_idx += r; len -= r; // tail-recursive "call" } else { // reached the end of the right part return base_idx + len; } } while(1); } static f_pixel get_median(const struct box *b, hist_item achv[]); typedef struct { unsigned int chan; float variance; } channelvariance; static int comparevariance(const void *ch1, const void *ch2) { return ((const channelvariance*)ch1)->variance > ((const channelvariance*)ch2)->variance ? -1 : (((const channelvariance*)ch1)->variance < ((const channelvariance*)ch2)->variance ? 1 : 0); } /** Finds which channels need to be sorted first and preproceses achv for fast sort */ static double prepare_sort(struct box *b, hist_item achv[]) { /* ** Sort dimensions by their variance, and then sort colors first by dimension with highest variance */ channelvariance channels[4] = { {index_of_channel(a), b->variance.a}, {index_of_channel(r), b->variance.r}, {index_of_channel(g), b->variance.g}, {index_of_channel(b), b->variance.b}, }; qsort(channels, 4, sizeof(channels[0]), comparevariance); const unsigned int ind1 = b->ind; const unsigned int colors = b->colors; #if __GNUC__ >= 9 || __clang__ #pragma omp parallel for if (colors > 25000) \ schedule(static) default(none) shared(achv, channels, colors, ind1) #else #pragma omp parallel for if (colors > 25000) \ schedule(static) default(none) shared(achv, channels) #endif for(unsigned int i=0; i < colors; i++) { const float *chans = (const float *)&achv[ind1 + i].acolor; // Only the first channel really matters. When trying median cut many times // with different histogram weights, I don't want sort randomness to influence outcome. achv[ind1 + i].tmp.sort_value = ((unsigned int)(chans[channels[0].chan]*65535.0)<<16) | (unsigned int)((chans[channels[2].chan] + chans[channels[1].chan]/2.0 + chans[channels[3].chan]/4.0)*65535.0); } const f_pixel median = get_median(b, achv); // box will be split to make color_weight of each side even const unsigned int ind = b->ind, end = ind+b->colors; double totalvar = 0; #pragma omp parallel for if (end - ind > 15000) \ schedule(static) default(shared) reduction(+:totalvar) for(unsigned int j=ind; j < end; j++) totalvar += (achv[j].color_weight = color_weight(median, achv[j])); return totalvar / 2.0; } /** finds median in unsorted set by sorting only minimum required */ static f_pixel get_median(const struct box *b, hist_item achv[]) { const unsigned int median_start = (b->colors-1)/2; hist_item_sort_range(&(achv[b->ind]), b->colors, median_start); if (b->colors&1) return achv[b->ind + median_start].acolor; // technically the second color is not guaranteed to be sorted correctly // but most of the time it is good enough to be useful return averagepixels(2, &achv[b->ind + median_start]); } /* ** Find the best splittable box. -1 if no boxes are splittable. */ static int best_splittable_box(struct box bv[], unsigned int boxes, const double max_mse) { int bi=-1; double maxsum=0; for(unsigned int i=0; i < boxes; i++) { if (bv[i].colors < 2) { continue; } // looks only at max variance, because it's only going to split by it const double cv = MAX(bv[i].variance.r, MAX(bv[i].variance.g,bv[i].variance.b)); double thissum = bv[i].sum * MAX(bv[i].variance.a, cv); if (bv[i].max_error > max_mse) { thissum = thissum* bv[i].max_error/max_mse; } if (thissum > maxsum) { maxsum = thissum; bi = i; } } return bi; } inline static double color_weight(f_pixel median, hist_item h) { float diff = colordifference(median, h.acolor); return sqrt(diff) * (sqrt(1.0+h.adjusted_weight)-1.0); } static void set_colormap_from_boxes(colormap *map, struct box bv[], unsigned int boxes, hist_item *achv); static void adjust_histogram(hist_item *achv, const struct box bv[], unsigned int boxes); static double box_error(const struct box *box, const hist_item achv[]) { f_pixel avg = box->color; double total_error=0; for (unsigned int i = 0; i < box->colors; ++i) { total_error += colordifference(avg, achv[box->ind + i].acolor) * achv[box->ind + i].perceptual_weight; } return total_error; } static bool total_box_error_below_target(double target_mse, struct box bv[], unsigned int boxes, const histogram *hist) { target_mse *= hist->total_perceptual_weight; double total_error=0; for(unsigned int i=0; i < boxes; i++) { // error is (re)calculated lazily if (bv[i].total_error >= 0) { total_error += bv[i].total_error; } if (total_error > target_mse) return false; } for(unsigned int i=0; i < boxes; i++) { if (bv[i].total_error < 0) { bv[i].total_error = box_error(&bv[i], hist->achv); total_error += bv[i].total_error; } if (total_error > target_mse) return false; } return true; } static void box_init(struct box *box, const hist_item *achv, const unsigned int ind, const unsigned int colors, const double sum) { assert(colors > 0); assert(sum > 0); box->ind = ind; box->colors = colors; box->sum = sum; box->total_error = -1; box->color = averagepixels(colors, &achv[ind]); box->variance = box_variance(achv, box); box->max_error = box_max_error(achv, box); } /* ** Here is the fun part, the median-cut colormap generator. This is based ** on Paul Heckbert's paper, "Color Image Quantization for Frame Buffer ** Display," SIGGRAPH 1982 Proceedings, page 297. */ LIQ_PRIVATE colormap *mediancut(histogram *hist, unsigned int newcolors, const double target_mse, const double max_mse, void* (*malloc)(size_t), void (*free)(void*)) { hist_item *achv = hist->achv; struct box bv[newcolors+16]; assert(hist->boxes[0].begin == 0); assert(hist->boxes[LIQ_MAXCLUSTER-1].end == hist->size); unsigned int boxes = 0; for(int b=0; b < LIQ_MAXCLUSTER; b++) { int begin = hist->boxes[b].begin; int end = hist->boxes[b].end; if (begin == end) { continue; } if (boxes >= newcolors/3) { boxes = 0; begin = 0; end = hist->boxes[LIQ_MAXCLUSTER-1].end; b = LIQ_MAXCLUSTER; } double sum = 0; for(int i=begin; i < end; i++) { sum += achv[i].adjusted_weight; } box_init(&bv[boxes], achv, begin, end-begin, sum); boxes++; } assert(boxes < newcolors); /* ** Main loop: split boxes until we have enough. */ while (boxes < newcolors) { // first splits boxes that exceed quality limit (to have colors for things like odd green pixel), // later raises the limit to allow large smooth areas/gradients get colors. const double current_max_mse = max_mse + (boxes/(double)newcolors)*16.0*max_mse; const int bi = best_splittable_box(bv, boxes, current_max_mse); if (bi < 0) { break; /* ran out of colors! */ } unsigned int indx = bv[bi].ind; unsigned int clrs = bv[bi].colors; /* Classic implementation tries to get even number of colors or pixels in each subdivision. Here, instead of popularity I use (sqrt(popularity)*variance) metric. Each subdivision balances number of pixels (popular colors) and low variance - boxes can be large if they have similar colors. Later boxes with high variance will be more likely to be split. Median used as expected value gives much better results than mean. */ const double halfvar = prepare_sort(&bv[bi], achv); // hist_item_sort_halfvar sorts and sums lowervar at the same time // returns item to break at …minus one, which does smell like an off-by-one error. unsigned int break_at = hist_item_sort_halfvar(&achv[indx], clrs, halfvar); break_at = MIN(clrs-1, break_at + 1); /* ** Split the box. */ double sm = bv[bi].sum; double lowersum = 0; for(unsigned int i=0; i < break_at; i++) lowersum += achv[indx + i].adjusted_weight; box_init(&bv[bi], achv, indx, break_at, lowersum); box_init(&bv[boxes], achv, indx + break_at, clrs - break_at, sm - lowersum); ++boxes; if (total_box_error_below_target(target_mse, bv, boxes, hist)) { break; } } colormap *map = pam_colormap(boxes, malloc, free); set_colormap_from_boxes(map, bv, boxes, achv); adjust_histogram(achv, bv, boxes); return map; } static void set_colormap_from_boxes(colormap *map, struct box* bv, unsigned int boxes, hist_item *achv) { /* ** Ok, we've got enough boxes. Now choose a representative color for ** each box. There are a number of possible ways to make this choice. ** One would be to choose the center of the box; this ignores any structure ** within the boxes. Another method would be to average all the colors in ** the box - this is the method specified in Heckbert's paper. */ for(unsigned int bi = 0; bi < boxes; ++bi) { map->palette[bi].acolor = bv[bi].color; /* store total color popularity (perceptual_weight is approximation of it) */ map->palette[bi].popularity = 0; for(unsigned int i=bv[bi].ind; i < bv[bi].ind+bv[bi].colors; i++) { map->palette[bi].popularity += achv[i].perceptual_weight; } } } /* increase histogram popularity by difference from the final color (this is used as part of feedback loop) */ static void adjust_histogram(hist_item *achv, const struct box* bv, unsigned int boxes) { for(unsigned int bi = 0; bi < boxes; ++bi) { for(unsigned int i=bv[bi].ind; i < bv[bi].ind+bv[bi].colors; i++) { achv[i].tmp.likely_colormap_index = bi; } } } static f_pixel averagepixels(unsigned int clrs, const hist_item achv[]) { double r = 0, g = 0, b = 0, a = 0, sum = 0; #pragma omp parallel for if (clrs > 25000) \ schedule(static) default(shared) reduction(+:a) reduction(+:r) reduction(+:g) reduction(+:b) reduction(+:sum) for(unsigned int i = 0; i < clrs; i++) { const f_pixel px = achv[i].acolor; const double weight = achv[i].adjusted_weight; sum += weight; a += px.a * weight; r += px.r * weight; g += px.g * weight; b += px.b * weight; } if (sum) { a /= sum; r /= sum; g /= sum; b /= sum; } assert(!isnan(r) && !isnan(g) && !isnan(b) && !isnan(a)); return (f_pixel){.r=r, .g=g, .b=b, .a=a}; } libimagequant-2.18.0/mediancut.h000066400000000000000000000003301436525270400165520ustar00rootroot00000000000000#ifndef MEDIANCUT_H #define MEDIANCUT_H LIQ_PRIVATE colormap *mediancut(histogram *hist, unsigned int newcolors, const double target_mse, const double max_mse, void* (*malloc)(size_t), void (*free)(void*)); #endif libimagequant-2.18.0/mempool.c000066400000000000000000000041721436525270400162540ustar00rootroot00000000000000/* ** © 2009-2017 by Kornel Lesiński. ** © 1989, 1991 by Jef Poskanzer. ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider. ** ** See COPYRIGHT file for license. */ #include "libimagequant.h" #include "mempool.h" #include #include #include #define ALIGN_MASK 15UL #define MEMPOOL_RESERVED ((sizeof(struct mempool)+ALIGN_MASK) & ~ALIGN_MASK) struct mempool { unsigned int used, size; void* (*malloc)(size_t); void (*free)(void*); struct mempool *next; }; LIQ_PRIVATE void* mempool_create(mempoolptr *mptr, const unsigned int size, unsigned int max_size, void* (*malloc)(size_t), void (*free)(void*)) { if (*mptr && ((*mptr)->used+size) <= (*mptr)->size) { unsigned int prevused = (*mptr)->used; (*mptr)->used += (size+15UL) & ~0xFUL; return ((char*)(*mptr)) + prevused; } mempoolptr old = *mptr; if (!max_size) max_size = (1<<17); max_size = size+ALIGN_MASK > max_size ? size+ALIGN_MASK : max_size; *mptr = malloc(MEMPOOL_RESERVED + max_size); if (!*mptr) return NULL; **mptr = (struct mempool){ .malloc = malloc, .free = free, .size = MEMPOOL_RESERVED + max_size, .used = sizeof(struct mempool), .next = old, }; uintptr_t mptr_used_start = (uintptr_t)(*mptr) + (*mptr)->used; (*mptr)->used += (ALIGN_MASK + 1 - (mptr_used_start & ALIGN_MASK)) & ALIGN_MASK; // reserve bytes required to make subsequent allocations aligned assert(!(((uintptr_t)(*mptr) + (*mptr)->used) & ALIGN_MASK)); return mempool_alloc(mptr, size, size); } LIQ_PRIVATE void* mempool_alloc(mempoolptr *mptr, const unsigned int size, const unsigned int max_size) { if (((*mptr)->used+size) <= (*mptr)->size) { unsigned int prevused = (*mptr)->used; (*mptr)->used += (size + ALIGN_MASK) & ~ALIGN_MASK; return ((char*)(*mptr)) + prevused; } return mempool_create(mptr, size, max_size, (*mptr)->malloc, (*mptr)->free); } LIQ_PRIVATE void mempool_destroy(mempoolptr m) { while (m) { mempoolptr next = m->next; m->free(m); m = next; } } libimagequant-2.18.0/mempool.h000066400000000000000000000006421436525270400162570ustar00rootroot00000000000000#ifndef MEMPOOL_H #define MEMPOOL_H #include struct mempool; typedef struct mempool *mempoolptr; LIQ_PRIVATE void* mempool_create(mempoolptr *mptr, const unsigned int size, unsigned int capacity, void* (*malloc)(size_t), void (*free)(void*)); LIQ_PRIVATE void* mempool_alloc(mempoolptr *mptr, const unsigned int size, const unsigned int capacity); LIQ_PRIVATE void mempool_destroy(mempoolptr m); #endif libimagequant-2.18.0/nearest.c000066400000000000000000000173701436525270400162510ustar00rootroot00000000000000/* ** © 2009-2015 by Kornel Lesiński. ** © 1989, 1991 by Jef Poskanzer. ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider. ** ** See COPYRIGHT file for license. */ #include "libimagequant.h" #include "pam.h" #include "nearest.h" #include "mempool.h" #include typedef struct vp_sort_tmp { float distance_squared; unsigned int idx; } vp_sort_tmp; typedef struct vp_search_tmp { float distance; float distance_squared; unsigned int idx; int exclude; } vp_search_tmp; struct leaf { f_pixel color; unsigned int idx; }; typedef struct vp_node { struct vp_node *near, *far; f_pixel vantage_point; float radius, radius_squared; struct leaf *rest; unsigned short idx; unsigned short restcount; } vp_node; struct nearest_map { vp_node *root; const colormap_item *palette; float nearest_other_color_dist[256]; mempoolptr mempool; }; static void vp_search_node(const vp_node *node, const f_pixel *const needle, vp_search_tmp *const best_candidate); static int vp_compare_distance(const void *ap, const void *bp) { float a = ((const vp_sort_tmp*)ap)->distance_squared; float b = ((const vp_sort_tmp*)bp)->distance_squared; return a > b ? 1 : -1; } static void vp_sort_indexes_by_distance(const f_pixel vantage_point, vp_sort_tmp indexes[], int num_indexes, const colormap_item items[]) { for(int i=0; i < num_indexes; i++) { indexes[i].distance_squared = colordifference(vantage_point, items[indexes[i].idx].acolor); } qsort(indexes, num_indexes, sizeof(indexes[0]), vp_compare_distance); } /* * Usually it should pick farthest point, but picking most popular point seems to make search quicker anyway */ static int vp_find_best_vantage_point_index(vp_sort_tmp indexes[], int num_indexes, const colormap_item items[]) { int best = 0; float best_popularity = items[indexes[0].idx].popularity; for(int i = 1; i < num_indexes; i++) { if (items[indexes[i].idx].popularity > best_popularity) { best_popularity = items[indexes[i].idx].popularity; best = i; } } return best; } static vp_node *vp_create_node(mempoolptr *m, vp_sort_tmp indexes[], int num_indexes, const colormap_item items[]) { if (num_indexes <= 0) { return NULL; } vp_node *node = mempool_alloc(m, sizeof(node[0]), 0); if (num_indexes == 1) { *node = (vp_node){ .vantage_point = items[indexes[0].idx].acolor, .idx = indexes[0].idx, .radius = MAX_DIFF, .radius_squared = MAX_DIFF, }; return node; } const int ref = vp_find_best_vantage_point_index(indexes, num_indexes, items); const int ref_idx = indexes[ref].idx; // Removes the `ref_idx` item from remaining items, because it's included in the current node num_indexes -= 1; indexes[ref] = indexes[num_indexes]; vp_sort_indexes_by_distance(items[ref_idx].acolor, indexes, num_indexes, items); // Remaining items are split by the median distance const int half_idx = num_indexes/2; *node = (vp_node){ .vantage_point = items[ref_idx].acolor, .idx = ref_idx, .radius = sqrtf(indexes[half_idx].distance_squared), .radius_squared = indexes[half_idx].distance_squared, }; if (num_indexes < 7) { node->rest = mempool_alloc(m, sizeof(node->rest[0]) * num_indexes, 0); node->restcount = num_indexes; for(int i=0; i < num_indexes; i++) { node->rest[i].idx = indexes[i].idx; node->rest[i].color = items[indexes[i].idx].acolor; } } else { node->near = vp_create_node(m, indexes, half_idx, items); node->far = vp_create_node(m, &indexes[half_idx], num_indexes - half_idx, items); } return node; } LIQ_PRIVATE struct nearest_map *nearest_init(const colormap *map) { mempoolptr m = NULL; struct nearest_map *handle = mempool_create(&m, sizeof(handle[0]), sizeof(handle[0]) + sizeof(vp_node)*map->colors+16, map->malloc, map->free); LIQ_ARRAY(vp_sort_tmp, indexes, map->colors); for(unsigned int i=0; i < map->colors; i++) { indexes[i].idx = i; } vp_node *root = vp_create_node(&m, indexes, map->colors, map->palette); *handle = (struct nearest_map){ .root = root, .palette = map->palette, .mempool = m, }; for(unsigned int i=0; i < map->colors; i++) { vp_search_tmp best = { .distance = MAX_DIFF, .distance_squared = MAX_DIFF, .exclude = i, }; vp_search_node(root, &map->palette[i].acolor, &best); handle->nearest_other_color_dist[i] = best.distance * best.distance / 4.f; // half of squared distance } return handle; } static void vp_search_node(const vp_node *node, const f_pixel *const needle, vp_search_tmp *const best_candidate) { do { const float distance_squared = colordifference(node->vantage_point, *needle); const float distance = sqrtf(distance_squared); if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->idx) { best_candidate->distance = distance; best_candidate->distance_squared = distance_squared; best_candidate->idx = node->idx; } if (node->restcount) { for(int i=0; i < node->restcount; i++) { const float distance_squared = colordifference(node->rest[i].color, *needle); if (distance_squared < best_candidate->distance_squared && best_candidate->exclude != node->rest[i].idx) { best_candidate->distance = sqrtf(distance_squared); best_candidate->distance_squared = distance_squared; best_candidate->idx = node->rest[i].idx; } } return; } // Recurse towards most likely candidate first to narrow best candidate's distance as soon as possible if (distance_squared < node->radius_squared) { if (node->near) { vp_search_node(node->near, needle, best_candidate); } // The best node (final answer) may be just ouside the radius, but not farther than // the best distance we know so far. The vp_search_node above should have narrowed // best_candidate->distance, so this path is rarely taken. if (node->far && distance >= node->radius - best_candidate->distance) { node = node->far; // Fast tail recursion } else { return; } } else { if (node->far) { vp_search_node(node->far, needle, best_candidate); } if (node->near && distance <= node->radius + best_candidate->distance) { node = node->near; // Fast tail recursion } else { return; } } } while(true); } LIQ_PRIVATE unsigned int nearest_search(const struct nearest_map *handle, const f_pixel *px, const int likely_colormap_index, float *diff) { const float guess_diff = colordifference(handle->palette[likely_colormap_index].acolor, *px); if (guess_diff < handle->nearest_other_color_dist[likely_colormap_index]) { if (diff) *diff = guess_diff; return likely_colormap_index; } vp_search_tmp best_candidate = { .distance = sqrtf(guess_diff), .distance_squared = guess_diff, .idx = likely_colormap_index, .exclude = -1, }; vp_search_node(handle->root, px, &best_candidate); if (diff) { *diff = best_candidate.distance * best_candidate.distance; } return best_candidate.idx; } LIQ_PRIVATE void nearest_free(struct nearest_map *centroids) { mempool_destroy(centroids->mempool); } libimagequant-2.18.0/nearest.h000066400000000000000000000005511436525270400162470ustar00rootroot00000000000000// // nearest.h // pngquant // #ifndef NEAREST_H #define NEAREST_H struct nearest_map; LIQ_PRIVATE struct nearest_map *nearest_init(const colormap *palette); LIQ_PRIVATE unsigned int nearest_search(const struct nearest_map *map, const f_pixel *px, const int palette_index_guess, float *diff); LIQ_PRIVATE void nearest_free(struct nearest_map *map); #endif libimagequant-2.18.0/org/000077500000000000000000000000001436525270400152235ustar00rootroot00000000000000libimagequant-2.18.0/org/pngquant/000077500000000000000000000000001436525270400170605ustar00rootroot00000000000000libimagequant-2.18.0/org/pngquant/Image.java000066400000000000000000000051101436525270400207420ustar00rootroot00000000000000package org.pngquant; import org.pngquant.*; import java.awt.image.*; /** * PngQuant's representation of an Image constructed from BufferedImage. */ public class Image extends LiqObject { /** * Converts BufferedImage to internal representation (pixel data is copied). * It's best to use BufferedImage in RGB/RGBA format backed by DataBufferByte. * Throws if conversion fails. */ public Image(BufferedImage image) throws PngQuantException { this(new PngQuant(), image); } public Image(PngQuant attr, BufferedImage image) throws PngQuantException { handle = handleFromImage(attr, image); if (handle == 0) { BufferedImage converted = new BufferedImage(image.getWidth(), image.getHeight(), BufferedImage.TYPE_4BYTE_ABGR); converted.getGraphics().drawImage(image, 0, 0, null); handle = handleFromImage(attr, converted); if (handle == 0) { throw new PngQuantException(); } } } /** * Guarantees presence of the given color in the palette (subject to setMaxColors()) * if this image is used for quantization. */ public native boolean addFixedColor(int r, int g, int b, int a); public boolean addFixedColor(int r, int g, int b) { return addFixedColor(r, g, b, 255); } public native int getWidth(); public native int getHeight(); public void close() { if (handle != 0) { liq_image_destroy(handle); handle = 0; } } private static long handleFromImage(PngQuant attr, BufferedImage image) { // The JNI wrapper will accept non-premultiplied ABGR and BGR only. int type = image.getType(); if (type != BufferedImage.TYPE_3BYTE_BGR && type != BufferedImage.TYPE_4BYTE_ABGR && type != BufferedImage.TYPE_4BYTE_ABGR_PRE) return 0; WritableRaster raster = image.getRaster(); ColorModel color = image.getColorModel(); if (type == BufferedImage.TYPE_4BYTE_ABGR_PRE) color.coerceData(raster, false); DataBuffer buffer = raster.getDataBuffer(); if (buffer instanceof DataBufferByte) { byte[] imageData = ((DataBufferByte)buffer).getData(); return liq_image_create(attr.handle, imageData, raster.getWidth(), raster.getHeight(), color.getNumComponents()); } return 0; } private static native long liq_image_create(long attr, byte[] bitmap, int width, int height, int components); private static native void liq_image_destroy(long handle); } libimagequant-2.18.0/org/pngquant/LiqObject.java000066400000000000000000000006451436525270400216040ustar00rootroot00000000000000package org.pngquant; abstract class LiqObject { static { // libimagequant.jnilib or libimagequant.so must be in java.library.path System.loadLibrary("imagequant"); } long handle; /** * Free memory used by the library. The object must not be used after this call. */ abstract public void close(); protected void finalize() throws Throwable { close(); } } libimagequant-2.18.0/org/pngquant/PngQuant.c000066400000000000000000000146661436525270400207760ustar00rootroot00000000000000#include "org/pngquant/PngQuant.h" #include "org/pngquant/Image.h" #include "org/pngquant/Result.h" #include "libimagequant.h" #include typedef struct { liq_image *image; jbyte *data; } liq_jni_image; static void *handle(JNIEnv *env, jobject obj) { jlong h = (*env)->GetLongField(env, obj, (*env)->GetFieldID(env, (*env)->GetObjectClass(env, obj), "handle", "J")); return (void*)h; } JNIEXPORT jlong JNICALL Java_org_pngquant_PngQuant_liq_1attr_1create(JNIEnv *env, jclass class) { return (jlong)liq_attr_create(); } JNIEXPORT jlong JNICALL Java_org_pngquant_PngQuant_liq_1attr_1copy(JNIEnv *env, jclass class, jlong attr) { return (jlong)liq_attr_copy((liq_attr*)attr); } JNIEXPORT void JNICALL Java_org_pngquant_PngQuant_liq_1attr_1destroy(JNIEnv *env, jclass class, jlong attr) { return liq_attr_destroy((liq_attr*)attr); } JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setMaxColors(JNIEnv *env, jobject obj, jint colors) { return LIQ_OK == liq_set_max_colors(handle(env, obj), colors); } JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setSpeed(JNIEnv *env, jobject obj, jint speed) { return LIQ_OK == liq_set_speed(handle(env, obj), speed); } JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setMinPosterization(JNIEnv *env, jobject obj, jint p) { return LIQ_OK == liq_set_min_posterization(handle(env, obj), p); } JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setQuality__I(JNIEnv *env, jobject obj, jint q) { return LIQ_OK == liq_set_quality(handle(env, obj), q/2, q); } JNIEXPORT jboolean JNICALL Java_org_pngquant_PngQuant_setQuality__II(JNIEnv *env, jobject obj, jint qmin, jint qmax) { return LIQ_OK == liq_set_quality(handle(env, obj), qmin, qmax); } static void convert_abgr(liq_color row_out[], int row_index, int width, void* user_info) { liq_jni_image *jniimg = user_info; int column_index; for(column_index=0; column_index < width; column_index++) { row_out[column_index].r = jniimg->data[4*(width*row_index + column_index) + 3]; row_out[column_index].g = jniimg->data[4*(width*row_index + column_index) + 2]; row_out[column_index].b = jniimg->data[4*(width*row_index + column_index) + 1]; row_out[column_index].a = jniimg->data[4*(width*row_index + column_index) + 0]; } } static void convert_bgr(liq_color row_out[], int row_index, int width, void* user_info) { liq_jni_image *jniimg = user_info; int column_index; for(column_index=0; column_index < width; column_index++) { row_out[column_index].r = jniimg->data[3*(width*row_index + column_index) + 2]; row_out[column_index].g = jniimg->data[3*(width*row_index + column_index) + 1]; row_out[column_index].b = jniimg->data[3*(width*row_index + column_index) + 0]; row_out[column_index].a = 255; } } JNIEXPORT jlong JNICALL Java_org_pngquant_Image_liq_1image_1create(JNIEnv *env, jclass class, jlong attr, jbyteArray bytearray, jint w, jint h, jint components) { /* liq_image needs to be wrapped to keep track of allocated buffer */ liq_jni_image *jniimg = malloc(sizeof(liq_jni_image)); /* copying buffer, since ReleaseByteArrayElements was crashing when called from finalize() */ jsize size = (*env)->GetArrayLength(env, bytearray); jniimg->data = malloc(size); (*env)->GetByteArrayRegion(env, bytearray, 0, size, jniimg->data); jniimg->image = liq_image_create_custom((liq_attr*)attr, components == 4 ? convert_abgr : convert_bgr, jniimg, w, h, 0); if (!jniimg->image) { free(jniimg->data); free(jniimg); return 0; } return (jlong)jniimg; } JNIEXPORT jboolean JNICALL Java_org_pngquant_Image_addFixedColor(JNIEnv *env, jobject obj, jint r, jint g, jint b, jint a) { liq_color c = {r,g,b,a}; return LIQ_OK == liq_image_add_fixed_color(((liq_jni_image*)handle(env,obj))->image, c); } JNIEXPORT jint JNICALL Java_org_pngquant_Image_getWidth(JNIEnv *env, jobject obj) { return liq_image_get_width(((liq_jni_image*)handle(env,obj))->image); } JNIEXPORT jint JNICALL Java_org_pngquant_Image_getHeight(JNIEnv *env, jobject obj) { return liq_image_get_height(((liq_jni_image*)handle(env,obj))->image); } JNIEXPORT void JNICALL Java_org_pngquant_Image_liq_1image_1destroy(JNIEnv *env, jclass class, jlong handle) { liq_jni_image *jniimg = (liq_jni_image*)handle; liq_image_destroy(jniimg->image); free(jniimg->data); free(jniimg); } JNIEXPORT jlong JNICALL Java_org_pngquant_Result_liq_1quantize_1image(JNIEnv *env, jclass class, jlong attr, jlong handle) { return (jlong)liq_quantize_image((liq_attr*)attr, ((liq_jni_image*)handle)->image); } JNIEXPORT jboolean JNICALL Java_org_pngquant_Result_setDitheringLevel(JNIEnv *env, jobject obj, jfloat l) { return LIQ_OK == liq_set_dithering_level(handle(env, obj), l); } JNIEXPORT jboolean JNICALL Java_org_pngquant_Result_setGamma(JNIEnv *env, jobject obj, jdouble gamma) { return LIQ_OK == liq_set_output_gamma(handle(env, obj), gamma); } JNIEXPORT jdouble JNICALL Java_org_pngquant_Result_getGamma(JNIEnv *env, jobject obj) { return liq_get_output_gamma(handle(env, obj)); } JNIEXPORT jboolean JNICALL Java_org_pngquant_Result_liq_1write_1remapped_1image(JNIEnv *env, jclass class, jlong result, jlong image_handle, jbyteArray bytearray) { jsize size = (*env)->GetArrayLength(env, bytearray); jbyte *bitmap = (*env)->GetByteArrayElements(env, bytearray, 0); liq_error err = liq_write_remapped_image((liq_result*)result, ((liq_jni_image*)image_handle)->image, bitmap, size); (*env)->ReleaseByteArrayElements(env, bytearray, bitmap, 0); return LIQ_OK == err; } JNIEXPORT jdouble JNICALL Java_org_pngquant_Result_getMeanSquareError(JNIEnv *env, jobject obj) { return liq_get_quantization_error(handle(env, obj)); } JNIEXPORT jint JNICALL Java_org_pngquant_Result_getQuality(JNIEnv *env, jobject obj) { return liq_get_quantization_quality(handle(env, obj)); } JNIEXPORT void JNICALL Java_org_pngquant_Result_liq_1result_1destroy(JNIEnv *env, jclass class, jlong result) { return liq_result_destroy((liq_result*)result); } JNIEXPORT jbyteArray JNICALL Java_org_pngquant_Result_liq_1get_1palette(JNIEnv *env, jclass class, jlong result) { const liq_palette *pal = liq_get_palette((liq_result*)result); jbyteArray arr = (*env)->NewByteArray(env, pal->count * 4); int i; for(i=0; i < pal->count; i++) { (*env)->SetByteArrayRegion(env, arr, i*4, 4, ((jbyte*)&pal->entries[i])); } return arr; } libimagequant-2.18.0/org/pngquant/PngQuant.java000066400000000000000000000063561436525270400214720ustar00rootroot00000000000000package org.pngquant; import org.pngquant.*; import java.awt.image.*; /** * Starting point for the library. Holds configuration. Equivalent of liq_attr* in libimagequant. */ public class PngQuant extends LiqObject { /** * Single instance can be "recycled" for many remappings. */ public PngQuant() { handle = liq_attr_create(); } public PngQuant(PngQuant other) { handle = liq_attr_copy(other.handle); } /** * 1-shot quantization and remapping with current settings. * @see quantize() * * @return 8-bit indexed image or null on failure */ public BufferedImage getRemapped(BufferedImage bufimg) { try { Image liqimg = new Image(this, bufimg); BufferedImage remapped = getRemapped(liqimg); liqimg.close(); return remapped; } catch(PngQuantException e) { return null; } } /** @return remapped image or null on failure */ public BufferedImage getRemapped(Image liqimg) { Result result = quantize(liqimg); if (result == null) return null; BufferedImage remapped = result.getRemapped(liqimg); result.close(); return remapped; } /** * Performs quantization (chooses optimal palette for the given Image). * Returned object can be used to customize remapping and reused to remap other images to the same palette. * @link http://pngquant.org/lib/#liq_quantize_image * * @return null on failure */ public Result quantize(Image img) { try { return new Result(this, img); } catch(PngQuantException e) { return null; } } /** * Remapped images won't use more than given number of colors (may use less if setQuality() is used) * * @link http://pngquant.org/lib/#liq_set_max_colors */ public native boolean setMaxColors(int colors); /** * Equivalent of setQuality(target/2, target) * * @link http://pngquant.org/lib/#liq_set_quality */ public native boolean setQuality(int target); /** * Quality in range 0-100. Quantization will fail if minimum quality cannot * be achieved with given number of colors. * * @link http://pngquant.org/lib/#liq_set_quality */ public native boolean setQuality(int min, int max); /** * Speed in range 1 (slowest) and 11 (fastest). 3 is the optimum. * Higher speeds quantize quicker, but at cost of quality and sometimes larger images. * * @link http://pngquant.org/lib/#liq_set_speed */ public native boolean setSpeed(int speed); /** * Reduces color precision by truncating number of least significant bits. * Slightly improves speed and helps generating images for low-fidelity displays/textures. * * @link http://pngquant.org/lib/#liq_set_min_posterization */ public native boolean setMinPosterization(int bits); public void close() { if (handle != 0) { liq_attr_destroy(handle); handle = 0; } } private static native long liq_attr_create(); private static native long liq_attr_copy(long orig); private static native void liq_attr_destroy(long handle); } libimagequant-2.18.0/org/pngquant/PngQuantException.java000066400000000000000000000001141436525270400233330ustar00rootroot00000000000000package org.pngquant; public class PngQuantException extends Exception { } libimagequant-2.18.0/org/pngquant/Result.java000066400000000000000000000057331436525270400212110ustar00rootroot00000000000000package org.pngquant; import org.pngquant.*; import java.awt.image.*; /** * Quantization result that holds palette and options for remapping. */ public class Result extends LiqObject { /** * Throws when quantization fails (e.g. due to failing to achieve minimum quality) */ public Result(PngQuant pngquant, Image image) throws PngQuantException { handle = liq_quantize_image(pngquant.handle, image.handle); if (handle == 0) { throw new PngQuantException(); } } /** * @return BufferedImage remapped to palette this Result has been created with or null on failure. */ public BufferedImage getRemapped(Image orig_image) { byte[] pal = liq_get_palette(handle); IndexColorModel color = new IndexColorModel(8, pal.length/4, pal, 0, true); BufferedImage img = new BufferedImage( orig_image.getWidth(), orig_image.getHeight(), BufferedImage.TYPE_BYTE_INDEXED, color); byte[] data = get8bitDataFromImage(img); if (data == null) return null; if (!liq_write_remapped_image(handle, orig_image.handle, data)) return null; return img; } /** * Dithering strength. Floyd-Steinberg is always used and in * speed settings 1-5 high-quality adaptive dithering is used. * @see PngQuant.setSpeed() * @link http://pngquant.org/lib/#liq_set_dithering_level * * @param dither_level Dithering in range 0 (none) and 1 (full) */ public native boolean setDitheringLevel(float dither_level); /** * The default is 0.45455 (1/2.2) which is PNG's approximation of sRGB. */ public native boolean setGamma(double gamma); public native double getGamma(); /** * Mean Square Error of remapping of image used to create this result. * @link http://pngquant.org/lib/#liq_get_quantization_error * * @return MSE or -1 if not available */ public native double getMeanSquareError(); /** * @link http://pngquant.org/lib/#liq_get_quantization_quality * @return Actually achieved quality in 0-100 range on scale compatible with PngQuant.setQuality() */ public native int getQuality(); public void close() { if (handle != 0) { liq_result_destroy(handle); handle = 0; } } private static byte[] get8bitDataFromImage(BufferedImage image) { if (image.getType() == BufferedImage.TYPE_BYTE_INDEXED) { DataBuffer buffer = image.getRaster().getDataBuffer(); if (buffer instanceof DataBufferByte) { return ((DataBufferByte)buffer).getData(); } } return null; } private static native byte[] liq_get_palette(long handle); private static native long liq_quantize_image(long attr, long image); private static native boolean liq_write_remapped_image(long handle, long image, byte[] buffer); private static native void liq_result_destroy(long handle); } libimagequant-2.18.0/pam.c000066400000000000000000000333301436525270400153570ustar00rootroot00000000000000/* pam.c - pam (portable alpha map) utility library ** ** © 2009-2017 by Kornel Lesiński. ** © 1989, 1991 by Jef Poskanzer. ** © 1997, 2000, 2002 by Greg Roelofs; based on an idea by Stefan Schneider. ** ** See COPYRIGHT file for license. */ #include #include #include "libimagequant.h" #include "pam.h" #include "mempool.h" LIQ_PRIVATE bool pam_computeacolorhash(struct acolorhash_table *acht, const liq_color *const pixels[], unsigned int cols, unsigned int rows, const unsigned char *importance_map) { const unsigned int ignorebits = acht->ignorebits; const unsigned int channel_mask = 255U>>ignorebits<>ignorebits) ^ 0xFFU; const unsigned int posterize_mask = channel_mask << 24 | channel_mask << 16 | channel_mask << 8 | channel_mask; const unsigned int posterize_high_mask = channel_hmask << 24 | channel_hmask << 16 | channel_hmask << 8 | channel_hmask; const unsigned int hash_size = acht->hash_size; /* Go through the entire image, building a hash table of colors. */ for(unsigned int row = 0; row < rows; ++row) { for(unsigned int col = 0; col < cols; ++col) { unsigned int boost; // RGBA color is casted to long for easier hasing/comparisons union rgba_as_int px = {pixels[row][col]}; unsigned int hash; if (px.rgba.a) { // mask posterizes all 4 channels in one go px.l = (px.l & posterize_mask) | ((px.l & posterize_high_mask) >> (8-ignorebits)); // fancier hashing algorithms didn't improve much hash = px.l % hash_size; if (importance_map) { boost = *importance_map++; } else { boost = 255; } } else { // "dirty alpha" has different RGBA values that end up being the same fully transparent color px.l=0; hash=0; boost = 2000; if (importance_map) { importance_map++; } } if (!pam_add_to_hash(acht, hash, boost, px, row, rows)) { return false; } } } acht->cols = cols; acht->rows += rows; return true; } LIQ_PRIVATE bool pam_add_to_hash(struct acolorhash_table *acht, unsigned int hash, unsigned int boost, union rgba_as_int px, unsigned int row, unsigned int rows) { /* head of the hash function stores first 2 colors inline (achl->used = 1..2), to reduce number of allocations of achl->other_items. */ struct acolorhist_arr_head *achl = &acht->buckets[hash]; if (achl->inline1.color.l == px.l && achl->used) { achl->inline1.perceptual_weight += boost; return true; } if (achl->used) { if (achl->used > 1) { if (achl->inline2.color.l == px.l) { achl->inline2.perceptual_weight += boost; return true; } // other items are stored as an array (which gets reallocated if needed) struct acolorhist_arr_item *other_items = achl->other_items; unsigned int i = 0; for (; i < achl->used-2; i++) { if (other_items[i].color.l == px.l) { other_items[i].perceptual_weight += boost; return true; } } // the array was allocated with spare items if (i < achl->capacity) { other_items[i] = (struct acolorhist_arr_item){ .color = px, .perceptual_weight = boost, }; achl->used++; ++acht->colors; return true; } if (++acht->colors > acht->maxcolors) { return false; } struct acolorhist_arr_item *new_items; unsigned int capacity; if (!other_items) { // there was no array previously, alloc "small" array capacity = 8; if (acht->freestackp <= 0) { // estimate how many colors are going to be + headroom const size_t mempool_size = ((acht->rows + rows-row) * 2 * acht->colors / (acht->rows + row + 1) + 1024) * sizeof(struct acolorhist_arr_item); new_items = mempool_alloc(&acht->mempool, sizeof(struct acolorhist_arr_item)*capacity, mempool_size); } else { // freestack stores previously freed (reallocated) arrays that can be reused // (all pesimistically assumed to be capacity = 8) new_items = acht->freestack[--acht->freestackp]; } } else { const unsigned int stacksize = sizeof(acht->freestack)/sizeof(acht->freestack[0]); // simply reallocs and copies array to larger capacity capacity = achl->capacity*2 + 16; if (acht->freestackp < stacksize-1) { acht->freestack[acht->freestackp++] = other_items; } const size_t mempool_size = ((acht->rows + rows-row) * 2 * acht->colors / (acht->rows + row + 1) + 32*capacity) * sizeof(struct acolorhist_arr_item); new_items = mempool_alloc(&acht->mempool, sizeof(struct acolorhist_arr_item)*capacity, mempool_size); if (!new_items) return false; memcpy(new_items, other_items, sizeof(other_items[0])*achl->capacity); } achl->other_items = new_items; achl->capacity = capacity; new_items[i] = (struct acolorhist_arr_item){ .color = px, .perceptual_weight = boost, }; achl->used++; } else { // these are elses for first checks whether first and second inline-stored colors are used achl->inline2.color.l = px.l; achl->inline2.perceptual_weight = boost; achl->used = 2; ++acht->colors; } } else { achl->inline1.color.l = px.l; achl->inline1.perceptual_weight = boost; achl->used = 1; ++acht->colors; } return true; } LIQ_PRIVATE struct acolorhash_table *pam_allocacolorhash(unsigned int maxcolors, unsigned int surface, unsigned int ignorebits, void* (*malloc)(size_t), void (*free)(void*)) { const size_t estimated_colors = MIN(maxcolors, surface/(ignorebits + (surface > 512*512 ? 6 : 5))); const size_t hash_size = estimated_colors < 66000 ? 6673 : (estimated_colors < 200000 ? 12011 : 24019); mempoolptr m = NULL; const size_t buckets_size = hash_size * sizeof(struct acolorhist_arr_head); const size_t mempool_size = sizeof(struct acolorhash_table) + buckets_size + estimated_colors * sizeof(struct acolorhist_arr_item); struct acolorhash_table *t = mempool_create(&m, sizeof(*t) + buckets_size, mempool_size, malloc, free); if (!t) return NULL; *t = (struct acolorhash_table){ .mempool = m, .hash_size = hash_size, .maxcolors = maxcolors, .ignorebits = ignorebits, }; memset(t->buckets, 0, buckets_size); return t; } ALWAYS_INLINE static float pam_add_to_hist(struct temp_hist_item achv[], unsigned int *j, const struct acolorhist_arr_item *entry, const float max_perceptual_weight, int counts[]) { if (entry->perceptual_weight == 0 && *j > 0) { return 0; } const liq_color px = entry->color.rgba; achv[*j].color = px; const short cluster = ((px.r>>7)<<3) | ((px.g>>7)<<2) | ((px.b>>7)<<1) | (px.a>>7); counts[cluster]++; achv[*j].cluster = cluster; const float w = MIN(entry->perceptual_weight/170.f, max_perceptual_weight); achv[*j].weight = w; *j += 1; return w; } LIQ_PRIVATE histogram *pam_acolorhashtoacolorhist(const struct acolorhash_table *acht, const double gamma, void* (*malloc)(size_t), void (*free)(void*)) { histogram *hist = malloc(sizeof(hist[0])); if (!hist || !acht) return NULL; *hist = (histogram){ .achv = malloc(MAX(1,acht->colors) * sizeof(hist->achv[0])), .size = acht->colors, .free = free, .ignorebits = acht->ignorebits, }; if (!hist->achv) return NULL; /// Clusters form initial boxes for quantization, to ensure extreme colors are better represented int counts[LIQ_MAXCLUSTER] = {}; struct temp_hist_item *temp = malloc(MAX(1, acht->colors) * sizeof(temp[0])); /* Limit perceptual weight to 1/10th of the image surface area to prevent a single color from dominating all others. */ float max_perceptual_weight = 0.1f * acht->cols * acht->rows; double total_weight = 0; unsigned int j=0; for(unsigned int i=0; i < acht->hash_size; ++i) { const struct acolorhist_arr_head *const achl = &acht->buckets[i]; if (achl->used) { total_weight += pam_add_to_hist(temp, &j, &achl->inline1, max_perceptual_weight, counts); if (achl->used > 1) { total_weight += pam_add_to_hist(temp, &j, &achl->inline2, max_perceptual_weight, counts); for(unsigned int k=0; k < achl->used-2; k++) { total_weight += pam_add_to_hist(temp, &j, &achl->other_items[k], max_perceptual_weight, counts); } } } } hist->total_perceptual_weight = total_weight; int begin = 0; for(int i=0; i < LIQ_MAXCLUSTER; i++) { hist->boxes[i].begin = begin; hist->boxes[i].end = begin; begin = begin + counts[i]; } hist->size = j; hist->total_perceptual_weight = total_weight; for(unsigned int k=0; k < hist->size; k++) { hist->achv[k].tmp.likely_colormap_index = 0; } if (!j) { free(temp); pam_freeacolorhist(hist); return NULL; } float gamma_lut[256]; to_f_set_gamma(gamma_lut, gamma); for(int i=0; i < hist->size; i++) { int j = hist->boxes[temp[i].cluster].end++; hist->achv[j].acolor = rgba_to_f(gamma_lut, temp[i].color); hist->achv[j].perceptual_weight = temp[i].weight; hist->achv[j].adjusted_weight = temp[i].weight; } free(temp); return hist; } LIQ_PRIVATE void pam_freeacolorhash(struct acolorhash_table *acht) { if (acht) { mempool_destroy(acht->mempool); } } LIQ_PRIVATE void pam_freeacolorhist(histogram *hist) { hist->free(hist->achv); hist->free(hist); } LIQ_PRIVATE LIQ_NONNULL colormap *pam_colormap(unsigned int colors, void* (*malloc)(size_t), void (*free)(void*)) { assert(colors > 0 && colors < 65536); colormap *map; const size_t colors_size = colors * sizeof(map->palette[0]); map = malloc(sizeof(colormap) + colors_size); if (!map) return NULL; *map = (colormap){ .malloc = malloc, .free = free, .colors = colors, }; memset(map->palette, 0, colors_size); return map; } LIQ_PRIVATE colormap *pam_duplicate_colormap(colormap *map) { colormap *dupe = pam_colormap(map->colors, map->malloc, map->free); for(unsigned int i=0; i < map->colors; i++) { dupe->palette[i] = map->palette[i]; } return dupe; } LIQ_PRIVATE void pam_freecolormap(colormap *c) { c->free(c); } LIQ_PRIVATE void to_f_set_gamma(float gamma_lut[], const double gamma) { for(int i=0; i < 256; i++) { gamma_lut[i] = pow((double)i/255.0, internal_gamma/gamma); } } /* fixed colors are always included in the palette, so it would be wasteful to duplicate them in palette from histogram */ LIQ_PRIVATE LIQ_NONNULL void remove_fixed_colors_from_histogram(histogram *hist, const int fixed_colors_count, const f_pixel fixed_colors[], const float target_mse) { const float max_difference = MAX(target_mse/2.f, 2.f/256.f/256.f); if (fixed_colors_count) { for(int j=0; j < hist->size; j++) { for(unsigned int i=0; i < fixed_colors_count; i++) { if (colordifference(hist->achv[j].acolor, fixed_colors[i]) < max_difference) { hist->achv[j] = hist->achv[--hist->size]; // remove color from histogram by overwriting with the last entry j--; break; // continue searching histogram } } } } } LIQ_PRIVATE LIQ_NONNULL colormap *histogram_to_palette(const histogram *hist, void* (*malloc)(size_t), void (*free)(void*)) { if (!hist->size) { return NULL; } colormap *acolormap = pam_colormap(hist->size, malloc, free); for(unsigned int i=0; i < hist->size; i++) { acolormap->palette[i].acolor = hist->achv[i].acolor; acolormap->palette[i].popularity = hist->achv[i].perceptual_weight; } return acolormap; } LIQ_PRIVATE LIQ_NONNULL void hist_reset_colors(const histogram *hist, const unsigned int colors) { // likely_colormap_index (used and set in kmeans_do_iteration) can't point to index outside colormap if (colors < 256) for(unsigned int j=0; j < hist->size; j++) { if (hist->achv[j].tmp.likely_colormap_index >= colors) { hist->achv[j].tmp.likely_colormap_index = 0; // actual value doesn't matter, as the guess is out of date anyway } } } libimagequant-2.18.0/pam.h000066400000000000000000000234621436525270400153710ustar00rootroot00000000000000/* pam.h - pam (portable alpha map) utility library ** ** Colormap routines. ** ** Copyright (C) 1989, 1991 by Jef Poskanzer. ** Copyright (C) 1997 by Greg Roelofs. ** ** Permission to use, copy, modify, and distribute this software and its ** documentation for any purpose and without fee is hereby granted, provided ** that the above copyright notice appear in all copies and that both that ** copyright notice and this permission notice appear in supporting ** documentation. This software is provided "as is" without express or ** implied warranty. */ #ifndef PAM_H #define PAM_H // accidental debug assertions make color search much slower, // so force assertions off if there's no explicit setting #if !defined(NDEBUG) && !defined(DEBUG) #define NDEBUG #endif #include #include #include #include #ifndef MAX # define MAX(a,b) ((a) > (b)? (a) : (b)) # define MIN(a,b) ((a) < (b)? (a) : (b)) #endif #define MAX_DIFF 1e20 #ifndef USE_SSE # if defined(__SSE__) && (defined(__amd64__) || defined(__X86_64__) || defined(_WIN64) || defined(WIN32) || defined(__WIN32__)) # define USE_SSE 1 # else # define USE_SSE 0 # endif #endif #if USE_SSE # include # ifdef _MSC_VER # include # define SSE_ALIGN # else # define SSE_ALIGN __attribute__ ((aligned (16))) # if defined(__i386__) && defined(__PIC__) # define cpuid(func,ax,bx,cx,dx)\ __asm__ __volatile__ ( \ "push %%ebx\n" \ "cpuid\n" \ "mov %%ebx, %1\n" \ "pop %%ebx\n" \ : "=a" (ax), "=r" (bx), "=c" (cx), "=d" (dx) \ : "a" (func)); # else # define cpuid(func,ax,bx,cx,dx)\ __asm__ __volatile__ ("cpuid":\ "=a" (ax), "=b" (bx), "=c" (cx), "=d" (dx) : "a" (func)); # endif #endif #else # define SSE_ALIGN #endif #ifndef _MSC_VER #define LIQ_ARRAY(type, var, count) type var[count] #else #define LIQ_ARRAY(type, var, count) type* var = (type*)_alloca(sizeof(type)*(count)) #endif #if defined(__GNUC__) || defined (__llvm__) #define ALWAYS_INLINE __attribute__((always_inline)) inline #define NEVER_INLINE __attribute__ ((noinline)) #elif defined(_MSC_VER) #define inline __inline #define restrict __restrict #define ALWAYS_INLINE __forceinline #define NEVER_INLINE __declspec(noinline) #else #define ALWAYS_INLINE inline #define NEVER_INLINE #endif /* from pam.h */ typedef struct { float a, r, g, b; } SSE_ALIGN f_pixel; static const float internal_gamma = 0.57f; LIQ_PRIVATE void to_f_set_gamma(float gamma_lut[], const double gamma); #define MIN_OPAQUE_A (1.f / 256.f * LIQ_WEIGHT_A) #define LIQ_WEIGHT_A 0.625f #define LIQ_WEIGHT_R 0.5f #define LIQ_WEIGHT_G 1.0f #define LIQ_WEIGHT_B 0.45f #define LIQ_WEIGHT_MSE 0.45 // fudge factor for compensating that colors aren't 0..1 range /** Converts 8-bit color to internal gamma and premultiplied alpha. (premultiplied color space is much better for blending of semitransparent colors) */ ALWAYS_INLINE static f_pixel rgba_to_f(const float gamma_lut[], const liq_color px); inline static f_pixel rgba_to_f(const float gamma_lut[], const liq_color px) { float a = px.a/255.f; return (f_pixel) { .a = a * LIQ_WEIGHT_A, .r = gamma_lut[px.r] * LIQ_WEIGHT_R * a, .g = gamma_lut[px.g] * LIQ_WEIGHT_G * a, .b = gamma_lut[px.b] * LIQ_WEIGHT_B * a, }; } inline static liq_color f_to_rgb(const float gamma, const f_pixel px) { if (px.a < MIN_OPAQUE_A) { return (liq_color){0,0,0,0}; } float r = (LIQ_WEIGHT_A / LIQ_WEIGHT_R) * px.r / px.a, g = (LIQ_WEIGHT_A / LIQ_WEIGHT_G) * px.g / px.a, b = (LIQ_WEIGHT_A / LIQ_WEIGHT_B) * px.b / px.a; r = powf(r, gamma/internal_gamma); g = powf(g, gamma/internal_gamma); b = powf(b, gamma/internal_gamma); // 256, because numbers are in range 1..255.9999… rounded down r *= 256.f; g *= 256.f; b *= 256.f; float a = (256.f / LIQ_WEIGHT_A) * px.a; return (liq_color){ .r = r>=255.f ? 255 : r, .g = g>=255.f ? 255 : g, .b = b>=255.f ? 255 : b, .a = a>=255.f ? 255 : a, }; } ALWAYS_INLINE static float colordifference_ch(const float x, const float y, const float alphas); inline static float colordifference_ch(const float x, const float y, const float alphas) { // maximum of channel blended on white, and blended on black // premultiplied alpha and backgrounds 0/1 shorten the formula const float black = x-y, white = black+alphas; return MAX(black*black, white*white); } ALWAYS_INLINE static float colordifference_stdc(const f_pixel px, const f_pixel py); inline static float colordifference_stdc(const f_pixel px, const f_pixel py) { // px_b.rgb = px.rgb + 0*(1-px.a) // blend px on black // px_b.a = px.a + 1*(1-px.a) // px_w.rgb = px.rgb + 1*(1-px.a) // blend px on white // px_w.a = px.a + 1*(1-px.a) // px_b.rgb = px.rgb // difference same as in opaque RGB // px_b.a = 1 // px_w.rgb = px.rgb - px.a // difference simplifies to formula below // px_w.a = 1 // (px.rgb - px.a) - (py.rgb - py.a) // (px.rgb - py.rgb) + (py.a - px.a) const float alphas = py.a-px.a; return colordifference_ch(px.r, py.r, alphas) + colordifference_ch(px.g, py.g, alphas) + colordifference_ch(px.b, py.b, alphas); } ALWAYS_INLINE static float colordifference(f_pixel px, f_pixel py); inline static float colordifference(f_pixel px, f_pixel py) { #if USE_SSE #ifdef _MSC_VER /* In MSVC we cannot use the align attribute in parameters. * This is used a lot, so we just use an unaligned load. * Also the compiler incorrectly inlines vpx and vpy without * the volatile when optimization is applied for x86_64. */ const volatile __m128 vpx = _mm_loadu_ps((const float*)&px); const volatile __m128 vpy = _mm_loadu_ps((const float*)&py); #else const __m128 vpx = _mm_load_ps((const float*)&px); const __m128 vpy = _mm_load_ps((const float*)&py); #endif // y.a - x.a __m128 alphas = _mm_sub_ss(vpy, vpx); alphas = _mm_shuffle_ps(alphas,alphas,0); // copy first to all four __m128 onblack = _mm_sub_ps(vpx, vpy); // x - y __m128 onwhite = _mm_add_ps(onblack, alphas); // x - y + (y.a - x.a) onblack = _mm_mul_ps(onblack, onblack); onwhite = _mm_mul_ps(onwhite, onwhite); const __m128 max = _mm_max_ps(onwhite, onblack); // add rgb, not a const __m128 maxhl = _mm_movehl_ps(max, max); const __m128 tmp = _mm_add_ps(max, maxhl); const __m128 sum = _mm_add_ss(maxhl, _mm_shuffle_ps(tmp, tmp, 1)); const float res = _mm_cvtss_f32(sum); assert(fabs(res - colordifference_stdc(px,py)) < 0.001); return res; #else return colordifference_stdc(px,py); #endif } /* from pamcmap.h */ union rgba_as_int { liq_color rgba; unsigned int l; }; typedef struct { f_pixel acolor; float adjusted_weight, // perceptual weight changed to tweak how mediancut selects colors perceptual_weight; // number of pixels weighted by importance of different areas of the picture float color_weight; // these two change every time histogram subset is sorted union { unsigned int sort_value; unsigned char likely_colormap_index; } tmp; } hist_item; #define LIQ_MAXCLUSTER 16 struct temp_hist_item { liq_color color; float weight; short cluster; }; struct histogram_box { int begin, end; }; typedef struct { hist_item *achv; void (*free)(void*); double total_perceptual_weight; unsigned int size; unsigned int ignorebits; struct histogram_box boxes[LIQ_MAXCLUSTER]; } histogram; typedef struct { f_pixel acolor; float popularity; bool fixed; // if true it's user-supplied and must not be changed (e.g in K-Means iteration) } colormap_item; typedef struct colormap { unsigned int colors; void* (*malloc)(size_t); void (*free)(void*); colormap_item palette[]; } colormap; struct acolorhist_arr_item { union rgba_as_int color; unsigned int perceptual_weight; }; struct acolorhist_arr_head { struct acolorhist_arr_item inline1, inline2; unsigned int used, capacity; struct acolorhist_arr_item *other_items; }; struct acolorhash_table { struct mempool *mempool; unsigned int ignorebits, maxcolors, colors, cols, rows; unsigned int hash_size; unsigned int freestackp; struct acolorhist_arr_item *freestack[512]; struct acolorhist_arr_head buckets[]; }; LIQ_PRIVATE void pam_freeacolorhash(struct acolorhash_table *acht); LIQ_PRIVATE struct acolorhash_table *pam_allocacolorhash(unsigned int maxcolors, unsigned int surface, unsigned int ignorebits, void* (*malloc)(size_t), void (*free)(void*)); LIQ_PRIVATE histogram *pam_acolorhashtoacolorhist(const struct acolorhash_table *acht, const double gamma, void* (*malloc)(size_t), void (*free)(void*)); LIQ_PRIVATE bool pam_computeacolorhash(struct acolorhash_table *acht, const liq_color *const pixels[], unsigned int cols, unsigned int rows, const unsigned char *importance_map); LIQ_PRIVATE bool pam_add_to_hash(struct acolorhash_table *acht, unsigned int hash, unsigned int boost, union rgba_as_int px, unsigned int row, unsigned int rows); LIQ_PRIVATE void pam_freeacolorhist(histogram *h); LIQ_PRIVATE colormap *pam_colormap(unsigned int colors, void* (*malloc)(size_t), void (*free)(void*)) LIQ_NONNULL; LIQ_PRIVATE colormap *pam_duplicate_colormap(colormap *map) LIQ_NONNULL; LIQ_PRIVATE void pam_freecolormap(colormap *c); LIQ_PRIVATE void remove_fixed_colors_from_histogram(histogram *hist, const int fixed_colors_count, const f_pixel fixed_colors[], const float target_mse) LIQ_NONNULL; LIQ_PRIVATE colormap *histogram_to_palette(const histogram *hist, void* (*malloc)(size_t), void (*free)(void*)) LIQ_NONNULL; LIQ_PRIVATE void hist_reset_colors(const histogram *hist, const unsigned int colors) LIQ_NONNULL; #endif libimagequant-2.18.0/pom.xml000066400000000000000000000047741436525270400157650ustar00rootroot00000000000000 4.0.0 org.pngquant libimagequant jar 2.1.1 pngquant http://pngquant.org . org.codehaus.mojo exec-maven-plugin 1.1 build compile exec make -j8 USE_SSE=1 java clean clean exec make clean mac-x64 Mac x64 org.pngquant libimagequant-jni 1 jnilib mac-x64 linux-x64 unix Linux x64 org.pngquant libimagequant-jni so 1 linux-x64 libimagequant-2.18.0/remap.c000066400000000000000000000313501436525270400157060ustar00rootroot00000000000000#include #include #include "libimagequant.h" #include "pam.h" #include "libimagequant_private.h" #include "nearest.h" #include "kmeans.h" LIQ_PRIVATE LIQ_NONNULL float remap_to_palette(liq_image *const input_image, unsigned char *const *const output_pixels, colormap *const map) { const int rows = input_image->height; const unsigned int cols = input_image->width; double remapping_error=0; if (!liq_image_get_row_f_init(input_image)) { return -1; } if (input_image->background && !liq_image_get_row_f_init(input_image->background)) { return -1; } const colormap_item *acolormap = map->palette; struct nearest_map *const n = nearest_init(map); liq_image *background = input_image->background; const int transparent_index = background ? nearest_search(n, &(f_pixel){0,0,0,0}, 0, NULL) : -1; if (background && acolormap[transparent_index].acolor.a > 1.f/256.f) { // palette unsuitable for using the bg background = NULL; } const unsigned int max_threads = omp_get_max_threads(); LIQ_ARRAY(kmeans_state, average_color, (KMEANS_CACHE_LINE_GAP+map->colors) * max_threads); kmeans_init(map, max_threads, average_color); #if __GNUC__ >= 9 || __clang__ #pragma omp parallel for if (rows*cols > 3000) \ schedule(static) default(none) shared(background,acolormap,average_color,cols,input_image,map,n,output_pixels,rows,transparent_index) reduction(+:remapping_error) #endif for(int row = 0; row < rows; ++row) { const f_pixel *const row_pixels = liq_image_get_row_f(input_image, row); const f_pixel *const bg_pixels = background && acolormap[transparent_index].acolor.a < MIN_OPAQUE_A ? liq_image_get_row_f(background, row) : NULL; unsigned int last_match=0; for(unsigned int col = 0; col < cols; ++col) { float diff; last_match = nearest_search(n, &row_pixels[col], last_match, &diff); if (bg_pixels) { float bg_diff = colordifference(bg_pixels[col], acolormap[last_match].acolor); if (bg_diff <= diff) { diff = bg_diff; last_match = transparent_index; } } output_pixels[row][col] = last_match; remapping_error += diff; if (last_match != transparent_index) { kmeans_update_color(row_pixels[col], 1.0, map, last_match, omp_get_thread_num(), average_color); } } } kmeans_finalize(map, max_threads, average_color); nearest_free(n); return remapping_error / (input_image->width * input_image->height); } inline static f_pixel get_dithered_pixel(const float dither_level, const float max_dither_error, const f_pixel thiserr, const f_pixel px) { /* Use Floyd-Steinberg errors to adjust actual color. */ const float sr = thiserr.r * dither_level, sg = thiserr.g * dither_level, sb = thiserr.b * dither_level, sa = thiserr.a * dither_level; float ratio = 1.0; const float max_overflow = 1.1f; const float max_underflow = -0.1f; // allowing some overflow prevents undithered bands caused by clamping of all channels if (px.r + sr > max_overflow) ratio = MIN(ratio, (max_overflow -px.r)/sr); else { if (px.r + sr < max_underflow) ratio = MIN(ratio, (max_underflow-px.r)/sr); } if (px.g + sg > max_overflow) ratio = MIN(ratio, (max_overflow -px.g)/sg); else { if (px.g + sg < max_underflow) ratio = MIN(ratio, (max_underflow-px.g)/sg); } if (px.b + sb > max_overflow) ratio = MIN(ratio, (max_overflow -px.b)/sb); else { if (px.b + sb < max_underflow) ratio = MIN(ratio, (max_underflow-px.b)/sb); } float a = px.a + sa; if (a > 1.f) { a = 1.f; } else if (a < 0) { a = 0; } // If dithering error is crazy high, don't propagate it that much // This prevents crazy geen pixels popping out of the blue (or red or black! ;) const float dither_error = sr*sr + sg*sg + sb*sb + sa*sa; if (dither_error > max_dither_error) { ratio *= 0.8f; } else if (dither_error < 2.f/256.f/256.f) { // don't dither areas that don't have noticeable error — makes file smaller return px; } return (f_pixel) { .r=px.r + sr * ratio, .g=px.g + sg * ratio, .b=px.b + sb * ratio, .a=a, }; } /** Uses edge/noise map to apply dithering only to flat areas. Dithering on edges creates jagged lines, and noisy areas are "naturally" dithered. If output_image_is_remapped is true, only pixels noticeably changed by error diffusion will be written to output image. */ LIQ_PRIVATE LIQ_NONNULL bool remap_to_palette_floyd(liq_image *input_image, unsigned char *const output_pixels[], liq_remapping_result *quant, const float max_dither_error, const bool output_image_is_remapped) { const int rows = input_image->height, cols = input_image->width; const unsigned char *dither_map = quant->use_dither_map ? (input_image->dither_map ? input_image->dither_map : input_image->edges) : NULL; const colormap *map = quant->palette; const colormap_item *acolormap = map->palette; if (!liq_image_get_row_f_init(input_image)) { return false; } if (input_image->background && !liq_image_get_row_f_init(input_image->background)) { return false; } /* Initialize Floyd-Steinberg error vectors. */ const size_t errwidth = cols+2; f_pixel *restrict thiserr = input_image->malloc(errwidth * sizeof(thiserr[0]) * 2); // +2 saves from checking out of bounds access if (!thiserr) return false; f_pixel *restrict nexterr = thiserr + errwidth; memset(thiserr, 0, errwidth * sizeof(thiserr[0])); bool ok = true; struct nearest_map *const n = nearest_init(map); liq_image *background = input_image->background; const int transparent_index = background ? nearest_search(n, &(f_pixel){0,0,0,0}, 0, NULL) : -1; if (background && acolormap[transparent_index].acolor.a > 1.f/256.f) { // palette unsuitable for using the bg background = NULL; } // response to this value is non-linear and without it any value < 0.8 would give almost no dithering float base_dithering_level = quant->dither_level; base_dithering_level = 1.f - (1.f-base_dithering_level)*(1.f-base_dithering_level); if (dither_map) { base_dithering_level *= 1.f/255.f; // convert byte to float } base_dithering_level *= 15.f/16.f; // prevent small errors from accumulating int fs_direction = 1; unsigned int last_match=0; for (int row = 0; row < rows; ++row) { if (liq_remap_progress(quant, quant->progress_stage1 + row * (100.f - quant->progress_stage1) / rows)) { ok = false; break; } memset(nexterr, 0, errwidth * sizeof(nexterr[0])); int col = (fs_direction > 0) ? 0 : (cols - 1); const f_pixel *const row_pixels = liq_image_get_row_f(input_image, row); const f_pixel *const bg_pixels = background && acolormap[transparent_index].acolor.a < MIN_OPAQUE_A ? liq_image_get_row_f(background, row) : NULL; int undithered_bg_used = 0; do { float dither_level = base_dithering_level; if (dither_map) { dither_level *= dither_map[row*cols + col]; } const f_pixel spx = get_dithered_pixel(dither_level, max_dither_error, thiserr[col + 1], row_pixels[col]); const unsigned int guessed_match = output_image_is_remapped ? output_pixels[row][col] : last_match; float dither_diff; last_match = nearest_search(n, &spx, guessed_match, &dither_diff); f_pixel output_px = acolormap[last_match].acolor; // this is for animgifs if (bg_pixels) { // if the background makes better match *with* dithering, it's a definitive win float bg_for_dither_diff = colordifference(spx, bg_pixels[col]); if (bg_for_dither_diff <= dither_diff) { output_px = bg_pixels[col]; last_match = transparent_index; } else if (undithered_bg_used > 1) { // the undithered fallback can cause artifacts when too many undithered pixels accumulate a big dithering error // so periodically ignore undithered fallback to prevent that undithered_bg_used = 0; } else { // if dithering is not applied, there's a high risk of creating artifacts (flat areas, error accumulating badly), // OTOH poor dithering disturbs static backgrounds and creates oscilalting frames that break backgrounds // back and forth in two differently bad ways float max_diff = colordifference(row_pixels[col], bg_pixels[col]); float dithered_diff = colordifference(row_pixels[col], output_px); // if dithering is worse than natural difference between frames // (this rule dithers moving areas, but does not dither static areas) if (dithered_diff > max_diff) { // then see if an undithered color is closer to the ideal float undithered_diff = colordifference(row_pixels[col], acolormap[guessed_match].acolor); if (undithered_diff < max_diff) { undithered_bg_used++; output_px = acolormap[guessed_match].acolor; last_match = guessed_match; } } } } output_pixels[row][col] = last_match; f_pixel err = { .r = (spx.r - output_px.r), .g = (spx.g - output_px.g), .b = (spx.b - output_px.b), .a = (spx.a - output_px.a), }; // If dithering error is crazy high, don't propagate it that much // This prevents crazy geen pixels popping out of the blue (or red or black! ;) if (err.r*err.r + err.g*err.g + err.b*err.b + err.a*err.a > max_dither_error) { err.r *= 0.75f; err.g *= 0.75f; err.b *= 0.75f; err.a *= 0.75f; } /* Propagate Floyd-Steinberg error terms. */ if (fs_direction > 0) { thiserr[col + 2].a += err.a * (7.f/16.f); thiserr[col + 2].r += err.r * (7.f/16.f); thiserr[col + 2].g += err.g * (7.f/16.f); thiserr[col + 2].b += err.b * (7.f/16.f); nexterr[col + 2].a = err.a * (1.f/16.f); nexterr[col + 2].r = err.r * (1.f/16.f); nexterr[col + 2].g = err.g * (1.f/16.f); nexterr[col + 2].b = err.b * (1.f/16.f); nexterr[col + 1].a += err.a * (5.f/16.f); nexterr[col + 1].r += err.r * (5.f/16.f); nexterr[col + 1].g += err.g * (5.f/16.f); nexterr[col + 1].b += err.b * (5.f/16.f); nexterr[col ].a += err.a * (3.f/16.f); nexterr[col ].r += err.r * (3.f/16.f); nexterr[col ].g += err.g * (3.f/16.f); nexterr[col ].b += err.b * (3.f/16.f); } else { thiserr[col ].a += err.a * (7.f/16.f); thiserr[col ].r += err.r * (7.f/16.f); thiserr[col ].g += err.g * (7.f/16.f); thiserr[col ].b += err.b * (7.f/16.f); nexterr[col ].a = err.a * (1.f/16.f); nexterr[col ].r = err.r * (1.f/16.f); nexterr[col ].g = err.g * (1.f/16.f); nexterr[col ].b = err.b * (1.f/16.f); nexterr[col + 1].a += err.a * (5.f/16.f); nexterr[col + 1].r += err.r * (5.f/16.f); nexterr[col + 1].g += err.g * (5.f/16.f); nexterr[col + 1].b += err.b * (5.f/16.f); nexterr[col + 2].a += err.a * (3.f/16.f); nexterr[col + 2].r += err.r * (3.f/16.f); nexterr[col + 2].g += err.g * (3.f/16.f); nexterr[col + 2].b += err.b * (3.f/16.f); } // remapping is done in zig-zag col += fs_direction; if (fs_direction > 0) { if (col >= cols) break; } else { if (col < 0) break; } } while(1); f_pixel *const temperr = thiserr; thiserr = nexterr; nexterr = temperr; fs_direction = -fs_direction; } input_image->free(MIN(thiserr, nexterr)); // MIN because pointers were swapped nearest_free(n); return ok; } libimagequant-2.18.0/remap.h000066400000000000000000000006121436525270400157100ustar00rootroot00000000000000#ifndef REMAP_H #define REMAP_H LIQ_PRIVATE float remap_to_palette(liq_image *const input_image, unsigned char *const *const output_pixels, colormap *const map) LIQ_NONNULL; LIQ_PRIVATE bool remap_to_palette_floyd(liq_image *input_image, unsigned char *const output_pixels[], liq_remapping_result *quant, const float max_dither_error, const bool output_image_is_remapped) LIQ_NONNULL; #endif libimagequant-2.18.0/rust-api/000077500000000000000000000000001436525270400162005ustar00rootroot00000000000000libimagequant-2.18.0/rust-api/.gitignore000066400000000000000000000000231436525270400201630ustar00rootroot00000000000000target/ Cargo.lock libimagequant-2.18.0/rust-api/COPYRIGHT000066400000000000000000001004521436525270400174750ustar00rootroot00000000000000https://raw.githubusercontent.com/ImageOptim/libimagequant/master/COPYRIGHT libimagequant © 2009-2016 by Kornel Lesiński. GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things. To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - © 1989, 1991 by Jef Poskanzer. © 1997, 2000, 2002 by Greg Roelofs. Permission to use, copy, modify, and distribute this software and its documentation for any purpose and without fee is hereby granted, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. This software is provided "as is" without express or implied warranty. libimagequant-2.18.0/rust-api/Cargo.toml000066400000000000000000000017731436525270400201400ustar00rootroot00000000000000[package] categories = ["multimedia::images"] description = "Convert 24/32-bit images to 8-bit palette with alpha channel.\nBindings for libimagequant that powers pngquant lossy PNG compressor.\n\nDual-licensed like pngquant. See https://pngquant.org for details." documentation = "https://docs.rs/imagequant" homepage = "https://pngquant.org/lib/" include = ["src/*", "examples/*", "COPYRIGHT", "Cargo.toml", "README.md"] keywords = ["quantization", "palette", "image", "pngquant", "compression"] authors = [ "Kornel " ] license = "GPL-3.0-or-later" name = "imagequant" readme = "README.md" repository = "https://github.com/ImageOptim/libimagequant" version = "3.2.0" edition = "2018" [dependencies] fallible_collections = "0.4.3" imagequant-sys = { version = "3.1.2", path = "../" } libc = "0.2.102" rgb = "0.8.27" [features] default = ["sse"] sse = ["imagequant-sys/sse"] openmp = ["imagequant-sys/openmp"] openmp-static = ["openmp", "imagequant-sys/openmp-static"] [lib] name = "imagequant" libimagequant-2.18.0/rust-api/README.md000066400000000000000000000013201436525270400174530ustar00rootroot00000000000000# [libimagequant](https://pngquant.org/lib/) bindings for [Rust](https://www.rust-lang.org/) Imagequant library converts RGBA images to 8-bit indexed images with palette, *including* alpha component. It's ideal for generating tiny PNG images (although [image I/O](https://github.com/kornelski/lodepng-rust) isn't handled by the library itself). This wrapper makes the library usable from Rust. Rust API closely follows the C API, but is slightly OO-ified: liq_set_dithering_level(result, 1.0); ↓ result.set_dithering_level(1.0); For more details see [libimagequant documentation](https://pngquant.org/lib/) and [Rust function reference](https://kornelski.github.io/libimagequant-rust/imagequant/). libimagequant-2.18.0/rust-api/examples/000077500000000000000000000000001436525270400200165ustar00rootroot00000000000000libimagequant-2.18.0/rust-api/examples/basic.rs000066400000000000000000000020551436525270400214470ustar00rootroot00000000000000// Don't forget to add -L . (or whatever dir has .rlib) to rustc! fn main() { // Image loading/saving is outside scope of this library let width = 10usize; let height = 10usize; let fakebitmap = vec![imagequant::RGBA {r:0, g:0, b:0, a:0}; width * height]; // http://pngquant.org/lib/ // Configure the library let mut liq = imagequant::new(); liq.set_speed(5); liq.set_quality(70, 99); // Describe the bitmap let ref mut img = liq.new_image(&fakebitmap[..], width, height, 0.0).unwrap(); // The magic happens in quantize() let mut res = match liq.quantize(img) { Ok(res) => res, Err(err) => panic!("Quantization failed, because: {:?}", err), }; // Enable dithering for subsequent remappings res.set_dithering_level(1.0); // You can reuse the result to generate several images with the same palette let (palette, pixels) = res.remapped(img).unwrap(); println!("Done! Got palette {:?} and {} pixels with {}% quality", palette, pixels.len(), res.quantization_quality()); } libimagequant-2.18.0/rust-api/src/000077500000000000000000000000001436525270400167675ustar00rootroot00000000000000libimagequant-2.18.0/rust-api/src/lib.rs000066400000000000000000000732421436525270400201130ustar00rootroot00000000000000//! https://pngquant.org/lib/ //! //! Converts RGBA images to 8-bit with alpha channel. //! //! This is based on imagequant library, which generates very high quality images. //! //! See `examples/` directory for example code. #![doc(html_logo_url = "https://pngquant.org/pngquant-logo.png")] #![warn(missing_docs)] pub use crate::ffi::liq_error; pub use crate::ffi::liq_error::*; use fallible_collections::FallibleVec; use imagequant_sys as ffi; use std::ffi::CStr; use std::fmt; use std::marker::PhantomData; use std::mem::MaybeUninit; use std::mem; use std::os::raw::{c_int, c_void, c_char}; use std::ptr; use std::ptr::NonNull; pub use rgb::RGBA8 as RGBA; /// Allocates all memory used by the library, like [`libc::malloc`]. /// /// Must return properly aligned memory (16-bytes on x86, pointer size on other architectures). pub type MallocUnsafeFn = unsafe extern "C" fn(size: usize) -> *mut c_void; /// Frees all memory used by the library, like [`libc::free`]. pub type FreeUnsafeFn = unsafe extern "C" fn(*mut c_void); /// 8-bit RGBA. This is the only color format used by the library. pub type Color = ffi::liq_color; /// Number of pixels in a given color /// /// Used if you're building histogram manually. Otherwise see `add_image()` pub type HistogramEntry = ffi::liq_histogram_entry; /// Print messages pub type LogCallbackFn = Box; /// Result of [`ProgressCallbackFn`] #[repr(C)] pub enum ControlFlow { /// Continue processing as normal Continue = 1, /// Abort processing and fail Break = 0, } /// Check progress and optionally abort pub type ProgressCallbackFn = Box ControlFlow + Send>; /// Settings for the conversion process. Start here. pub struct Attributes { handle: NonNull, malloc: MallocUnsafeFn, free: FreeUnsafeFn, log_callback: Option>, // Double boxed, because it's a fat ptr, and Attributes can be moved progress_callback: Option>, } /// Describes image dimensions for the library. pub struct Image<'a> { handle: NonNull, /// Holds row pointers for images with stride _marker: PhantomData<&'a [u8]>, } /// Palette inside. pub struct QuantizationResult { handle: NonNull, } /// Generate one shared palette for multiple images. pub struct Histogram<'a> { attr: &'a Attributes, handle: NonNull, } impl Drop for Attributes { #[inline] fn drop(&mut self) { unsafe { ffi::liq_attr_destroy(self.handle.as_mut()); } } } impl<'a> Drop for Image<'a> { #[inline] fn drop(&mut self) { unsafe { ffi::liq_image_destroy(self.handle.as_mut()); } } } impl Drop for QuantizationResult { #[inline] fn drop(&mut self) { unsafe { ffi::liq_result_destroy(self.handle.as_mut()); } } } impl<'a> Drop for Histogram<'a> { #[inline] fn drop(&mut self) { unsafe { ffi::liq_histogram_destroy(self.handle.as_mut()); } } } impl Clone for Attributes { /// NB: it doesn't clone the log/progress callbacks! #[inline] fn clone(&self) -> Attributes { unsafe { let mut handle = NonNull::new(ffi::liq_attr_copy(self.handle.as_ref())).unwrap(); if self.log_callback.is_some() { // can't be cloned ffi::liq_set_log_callback(handle.as_mut(), None, ptr::null_mut()); } if self.progress_callback.is_some() { // can't be cloned ffi::liq_attr_set_progress_callback(handle.as_mut(), None, ptr::null_mut()); } Attributes { handle, malloc: self.malloc, free: self.free, log_callback: None, progress_callback: None, } } } } impl Default for Attributes { #[inline(always)] fn default() -> Attributes { Attributes::new() } } impl Attributes { /// New handle for library configuration /// /// See also `new_image()` #[inline] #[must_use] pub fn new() -> Self { let handle = unsafe { ffi::liq_attr_create() }; Attributes { handle: NonNull::new(handle).expect("SSE-capable CPU is required for this build."), malloc: libc::malloc, free: libc::free, log_callback: None, progress_callback: None, } } /// New handle for library configuration, with specified custom allocator for internal use. /// /// See also `new_image()` /// /// # Safety /// /// * `malloc` and `free` must behave according to their corresponding C specification. /// * `malloc` must return properly aligned memory (16-bytes on x86, pointer-sized on other architectures). #[inline] #[must_use] pub unsafe fn with_allocator(malloc: MallocUnsafeFn, free: FreeUnsafeFn) -> Self { let handle = ffi::liq_attr_create_with_allocator(malloc, free); Attributes { handle: NonNull::new(handle).expect("SSE-capable CPU is required for this build."), malloc, free, log_callback: None, progress_callback: None, } } /// It's better to use `set_quality()` #[inline] pub fn set_max_colors(&mut self, value: i32) -> liq_error { unsafe { ffi::liq_set_max_colors(self.handle.as_mut(), value) } } /// Number of least significant bits to ignore. /// /// Useful for generating palettes for VGA, 15-bit textures, or other retro platforms. #[inline] pub fn set_min_posterization(&mut self, value: i32) -> liq_error { unsafe { ffi::liq_set_min_posterization(self.handle.as_mut(), value) } } /// Returns number of bits of precision truncated #[inline] pub fn min_posterization(&mut self) -> i32 { unsafe { ffi::liq_get_min_posterization(self.handle.as_ref()) } } /// Range 0-100, roughly like JPEG. /// /// If minimum quality can't be met, quantization will fail. /// /// Default is min 0, max 100. #[inline] pub fn set_quality(&mut self, min: u32, max: u32) -> liq_error { unsafe { ffi::liq_set_quality(self.handle.as_mut(), min as c_int, max as c_int) } } /// Reads values set with `set_quality` #[inline] pub fn quality(&mut self) -> (u32, u32) { unsafe { (ffi::liq_get_min_quality(self.handle.as_ref()) as u32, ffi::liq_get_max_quality(self.handle.as_ref()) as u32) } } /// 1-10. /// /// Faster speeds generate images of lower quality, but may be useful /// for real-time generation of images. #[inline] pub fn set_speed(&mut self, value: i32) -> liq_error { unsafe { ffi::liq_set_speed(self.handle.as_mut(), value) } } /// Move transparent color to the last entry in the palette /// /// This is less efficient for PNG, but required by some broken software #[inline] pub fn set_last_index_transparent(&mut self, value: bool) { unsafe { ffi::liq_set_last_index_transparent(self.handle.as_mut(), value as c_int) } } /// Return currently set speed/quality trade-off setting #[inline(always)] #[must_use] pub fn speed(&mut self) -> i32 { unsafe { ffi::liq_get_speed(self.handle.as_ref()) } } /// Return max number of colors set #[inline(always)] #[must_use] pub fn max_colors(&mut self) -> i32 { unsafe { ffi::liq_get_max_colors(self.handle.as_ref()) } } /// Describe dimensions of a slice of RGBA pixels /// /// Use 0.0 for gamma if the image is sRGB (most images are). #[inline] pub fn new_image<'a>(&self, bitmap: &'a [RGBA], width: usize, height: usize, gamma: f64) -> Result, liq_error> { Image::new(self, bitmap, width, height, gamma) } /// Stride is in pixels. Allows defining regions of larger images or images with padding without copying. #[inline] pub fn new_image_stride<'a>(&self, bitmap: &'a [RGBA], width: usize, height: usize, stride: usize, gamma: f64) -> Result, liq_error> { Image::new_stride(self, bitmap, width, height, stride, gamma) } /// Like `new_image_stride`, but makes a copy of the pixels #[inline] pub fn new_image_stride_copy(&self, bitmap: &[RGBA], width: usize, height: usize, stride: usize, gamma: f64) -> Result, liq_error> { Image::new_stride_copy(self, bitmap, width, height, stride, gamma) } /// Create new histogram /// /// Use to make one palette suitable for many images #[inline(always)] #[must_use] pub fn new_histogram(&self) -> Histogram<'_> { Histogram::new(&self) } /// Generate palette for the image pub fn quantize(&mut self, image: &Image<'_>) -> Result { unsafe { let mut h = ptr::null_mut(); match ffi::liq_image_quantize(image.handle.as_ref(), self.handle.as_ref(), &mut h) { liq_error::LIQ_OK if !h.is_null() => Ok(QuantizationResult { handle: NonNull::new_unchecked(h) }), err => Err(err), } } } /// Set callback function to be called every time the library wants to print a message. /// /// To share data with the callback, use `Arc` or `Atomic*` types and `move ||` closures. #[inline(always)] pub fn set_log_callback(&mut self, callback: F) { self._set_log_callback(Box::new(callback)) } /// Set callback function to be called every time the library makes a progress. /// It can be used to cancel operation early. /// /// To share data with the callback, use `Arc` or `Atomic*` types and `move ||` closures. #[inline(always)] pub fn set_progress_callback ControlFlow + Send + 'static>(&mut self, callback: F) { self._set_progress_callback(Box::new(callback)) } fn _set_log_callback(&mut self, callback: LogCallbackFn) { let mut log_callback = Box::new(callback); let log_callback_ref: &mut LogCallbackFn = &mut *log_callback; unsafe { ffi::liq_set_log_callback(self.handle.as_mut(), Some(call_log_callback), log_callback_ref as *mut LogCallbackFn as *mut c_void); } self.log_callback = Some(log_callback); } fn _set_progress_callback(&mut self, callback: ProgressCallbackFn) { let mut progress_callback = Box::new(callback); let progress_callback_ref: &mut ProgressCallbackFn = &mut *progress_callback; unsafe { ffi::liq_attr_set_progress_callback(self.handle.as_mut(), Some(call_progress_callback), progress_callback_ref as *mut ProgressCallbackFn as *mut c_void); } self.progress_callback = Some(progress_callback); } } extern "C" fn call_log_callback(_liq: &ffi::liq_attr, msg: *const c_char, user_data: *mut c_void) { unsafe { let cb: &mut LogCallbackFn = match (user_data as *mut LogCallbackFn).as_mut() { Some(cb) => cb, None => return, }; match CStr::from_ptr(msg).to_str() { Ok(msg) => cb(msg), Err(_) => return, }; } } extern "C" fn call_progress_callback(perc: f32, user_data: *mut c_void) -> c_int { unsafe { match (user_data as *mut ProgressCallbackFn).as_mut() { Some(cb) => cb(perc) as _, None => ControlFlow::Break as _, } } } /// Start here: creates new handle for library configuration #[inline(always)] #[must_use] pub fn new() -> Attributes { Attributes::new() } impl<'a> Histogram<'a> { /// Creates histogram object that will be used to collect color statistics from multiple images. /// /// All options should be set on `attr` before the histogram object is created. Options changed later may not have effect. #[inline] #[must_use] pub fn new(attr: &'a Attributes) -> Self { Histogram { attr, handle: unsafe { NonNull::new(ffi::liq_histogram_create(attr.handle.as_ref())).unwrap() }, } } /// "Learns" colors from the image, which will be later used to generate the palette. /// /// Fixed colors added to the image are also added to the histogram. If total number of fixed colors exceeds 256, this function will fail with `LIQ_BUFFER_TOO_SMALL`. #[inline] pub fn add_image(&mut self, image: &mut Image<'_>) -> liq_error { unsafe { ffi::liq_histogram_add_image(self.handle.as_mut(), self.attr.handle.as_ref(), image.handle.as_mut()) } } /// Alternative to `add_image()`. Intead of counting colors in an image, it directly takes an array of colors and their counts. /// /// This function is only useful if you already have a histogram of the image from another source. #[inline] pub fn add_colors(&mut self, colors: &[HistogramEntry], gamma: f64) -> liq_error { unsafe { ffi::liq_histogram_add_colors(self.handle.as_mut(), self.attr.handle.as_ref(), colors.as_ptr(), colors.len() as c_int, gamma) } } /// Generate palette for all images/colors added to the histogram. /// /// Palette generated using this function won't be improved during remapping. /// If you're generating palette for only one image, it's better not to use the `Histogram`. #[inline] pub fn quantize(&mut self) -> Result { unsafe { let mut h = ptr::null_mut(); match ffi::liq_histogram_quantize(self.handle.as_ref(), self.attr.handle.as_ref(), &mut h) { liq_error::LIQ_OK if !h.is_null() => Ok(QuantizationResult { handle: NonNull::new_unchecked(h) }), err => Err(err), } } } } /// Generate image row on the fly /// /// `output_row` is an array `width` RGBA elements wide. /// `y` is the row (0-indexed) to write to the `output_row` /// `user_data` is the data given to `Image::new_unsafe_fn()` pub type ConvertRowUnsafeFn = unsafe extern "C" fn(output_row: *mut Color, y: c_int, width: c_int, user_data: *mut UserData); impl<'bitmap> Image<'bitmap> { /// Describe dimensions of a slice of RGBA pixels. /// /// `bitmap` must be either `&[u8]` or a slice with one element per pixel (`&[RGBA]`). /// /// Use `0.` for gamma if the image is sRGB (most images are). #[inline(always)] pub fn new(attr: &Attributes, bitmap: &'bitmap [RGBA], width: usize, height: usize, gamma: f64) -> Result { Self::new_stride(attr, bitmap, width, height, width, gamma) } /// Generate rows on demand using a callback function. /// /// The callback function must be cheap (e.g. just byte-swap pixels). /// It will be called multiple times per row. May be called in any order from any thread. /// /// The user data must be compatible with a primitive pointer /// (i.e. not a slice, not a Trait object. `Box` it if you must). #[inline] pub fn new_unsafe_fn(attr: &Attributes, convert_row_fn: ConvertRowUnsafeFn, user_data: *mut CustomData, width: usize, height: usize, gamma: f64) -> Result { let handle = NonNull::new(unsafe { ffi::liq_image_create_custom(attr.handle.as_ref(), mem::transmute(convert_row_fn), user_data.cast(), width as c_int, height as c_int, gamma) }).ok_or(LIQ_INVALID_POINTER)?; Ok(Image { handle, _marker: PhantomData }) } /// Stride is in pixels. Allows defining regions of larger images or images with padding without copying. #[inline(always)] pub fn new_stride(attr: &Attributes, bitmap: &'bitmap [RGBA], width: usize, height: usize, stride: usize, gamma: f64) -> Result { // Type definition preserves the lifetime, so it's not unsafe unsafe { Self::new_stride_internal(attr, bitmap, width, height, stride, gamma, false) } } /// Create new image by copying `bitmap` to an internal buffer, so that it makes a self-contained type. #[inline(always)] pub fn new_stride_copy(attr: &Attributes, bitmap: &[RGBA], width: usize, height: usize, stride: usize, gamma: f64) -> Result, liq_error> { // copy guarantees the image doesn't reference the bitmap any more unsafe { Self::new_stride_internal(attr, bitmap, width, height, stride, gamma, true) } } unsafe fn new_stride_internal<'varies>(attr: &Attributes, bitmap: &[RGBA], width: usize, height: usize, stride: usize, gamma: f64, copy: bool) -> Result, liq_error> { if bitmap.len() < (stride * height + width - stride) { eprintln!("Buffer length is {} bytes, which is not enough for {}×{}×4 RGBA bytes", bitmap.len()*4, stride, height); return Err(LIQ_BUFFER_TOO_SMALL); } let (bitmap, ownership) = if copy { let copied = (attr.malloc)(4 * bitmap.len()) as *mut RGBA; ptr::copy_nonoverlapping(bitmap.as_ptr(), copied, bitmap.len()); (copied as *const _, ffi::liq_ownership::LIQ_OWN_ROWS | ffi::liq_ownership::LIQ_OWN_PIXELS) } else { (bitmap.as_ptr(), ffi::liq_ownership::LIQ_OWN_ROWS) }; let rows = Self::malloc_image_rows(bitmap, stride, height, attr.malloc); let h = NonNull::new(ffi::liq_image_create_rgba_rows(attr.handle.as_ref(), rows, width as c_int, height as c_int, gamma)); let img = match h { None => { (attr.free)(rows.cast()); return Err(LIQ_INVALID_POINTER); } Some(h) => { Image { handle: h, _marker: PhantomData, } } }; match ffi::liq_image_set_memory_ownership(img.handle.as_ref(), ownership) { LIQ_OK => Ok(img), err => { drop(img); (attr.free)(rows.cast()); Err(err) }, } } /// For arbitrary stride libimagequant requires rows. It's most convenient if they're allocated using libc, /// so they can be owned and freed automatically by the C library. unsafe fn malloc_image_rows(bitmap: *const RGBA, stride: usize, height: usize, malloc: MallocUnsafeFn) -> *mut *const u8 { let mut byte_ptr = bitmap as *const u8; let stride_bytes = stride * 4; let rows = malloc(mem::size_of::<*const u8>() * height) as *mut *const u8; for y in 0..height { *rows.add(y) = byte_ptr; byte_ptr = byte_ptr.add(stride_bytes); } rows } /// Width of the image in pixels #[inline] #[must_use] pub fn width(&self) -> usize { unsafe { ffi::liq_image_get_width(self.handle.as_ref()) as usize } } /// Height of the image in pixels #[inline] #[must_use] pub fn height(&self) -> usize { unsafe { ffi::liq_image_get_height(self.handle.as_ref()) as usize } } /// Reserves a color in the output palette created from this image. It behaves as if the given color was used in the image and was very important. /// /// RGB values of liq_color are assumed to have the same gamma as the image. /// /// It must be called before the image is quantized. /// /// Returns error if more than 256 colors are added. If image is quantized to fewer colors than the number of fixed colors added, then excess fixed colors will be ignored. #[inline] pub fn add_fixed_color(&mut self, color: ffi::liq_color) -> liq_error { unsafe { ffi::liq_image_add_fixed_color(self.handle.as_mut(), color) } } /// Remap pixels assuming they will be displayed on this background. /// /// Pixels that match the background color will be made transparent if there's a fully transparent color available in the palette. /// /// The background image's pixels must outlive this image #[inline] pub fn set_background<'own, 'bg: 'own>(&'own mut self, background: Image<'bg>) -> Result<(), liq_error> { unsafe { ffi::liq_image_set_background(self.handle.as_mut(), background.into_raw()).ok() } } /// Set which pixels are more important (and more likely to get a palette entry) /// /// The map must be `width`×`height` pixels large. Higher numbers = more important. #[inline] pub fn set_importance_map(&mut self, map: &[u8]) -> Result<(), liq_error> { unsafe { ffi::liq_image_set_importance_map(self.handle.as_mut(), map.as_ptr() as *mut _, map.len(), ffi::liq_ownership::LIQ_COPY_PIXELS).ok() } } #[inline] fn into_raw(self) -> *mut ffi::liq_image { let handle = self.handle; mem::forget(self); handle.as_ptr() } } impl QuantizationResult { /// Set to 1.0 to get nice smooth image #[inline] pub fn set_dithering_level(&mut self, value: f32) -> liq_error { unsafe { ffi::liq_set_dithering_level(self.handle.as_mut(), value) } } /// The default is sRGB gamma (~1/2.2) #[inline] pub fn set_output_gamma(&mut self, value: f64) -> liq_error { unsafe { ffi::liq_set_output_gamma(self.handle.as_mut(), value) } } /// Approximate gamma correction value used for the output /// /// Colors are converted from input gamma to this gamma #[inline] #[must_use] pub fn output_gamma(&mut self) -> f64 { unsafe { ffi::liq_get_output_gamma(self.handle.as_ref()) } } /// Number 0-100 guessing how nice the input image will look if remapped to this palette #[inline] #[must_use] pub fn quantization_quality(&self) -> i32 { unsafe { ffi::liq_get_quantization_quality(self.handle.as_ref()) as i32 } } /// Approximate mean square error of the palette #[inline] #[must_use] pub fn quantization_error(&self) -> Option { match unsafe { ffi::liq_get_quantization_error(self.handle.as_ref()) } { x if x < 0. => None, x => Some(x), } } /// Final palette /// /// It's slighly better if you get palette from the `remapped()` call instead #[must_use] pub fn palette(&mut self) -> Vec { let pal = self.palette_ref(); let mut out: Vec = FallibleVec::try_with_capacity(pal.len()).unwrap(); out.extend_from_slice(pal); out } /// Final palette (as a temporary slice) /// /// It's slighly better if you get palette from the `remapped()` call instead /// /// Use when ownership of the palette colors is not needed #[inline] pub fn palette_ref(&mut self) -> &[Color] { unsafe { let pal = &*ffi::liq_get_palette(self.handle.as_mut()); std::slice::from_raw_parts(pal.entries.as_ptr(), (pal.count as usize).min(pal.entries.len())) } } /// Remap image into a `Vec` /// /// Returns the palette and a 1-byte-per-pixel uncompressed bitmap pub fn remapped(&mut self, image: &mut Image<'_>) -> Result<(Vec, Vec), liq_error> { let len = image.width() * image.height(); // Capacity is essential here, as it creates uninitialized buffer unsafe { let mut buf: Vec = FallibleVec::try_with_capacity(len).map_err(|_| liq_error::LIQ_OUT_OF_MEMORY)?; let uninit_slice = std::slice::from_raw_parts_mut(buf.as_ptr() as *mut MaybeUninit, buf.capacity()); self.remap_into(image, uninit_slice)?; buf.set_len(uninit_slice.len()); Ok((self.palette(), buf)) } } /// Remap image into an existing buffer. /// /// This is a low-level call for use when existing memory has to be reused. Use `remapped()` if possible. /// /// Writes 1-byte-per-pixel uncompressed bitmap into the pre-allocated buffer. /// /// You should call `palette()` or `palette_ref()` _after_ this call, but not before it, /// because remapping changes the palette. #[inline] pub fn remap_into(&mut self, image: &mut Image<'_>, output_buf: &mut [MaybeUninit]) -> Result<(), liq_error> { unsafe { match ffi::liq_write_remapped_image(self.handle.as_mut(), image.handle.as_mut(), output_buf.as_mut_ptr().cast(), output_buf.len()) { LIQ_OK => Ok(()), err => Err(err), } } } } impl fmt::Debug for QuantizationResult { #[cold] fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { write!(f, "QuantizationResult(q={})", self.quantization_quality()) } } unsafe impl Send for Attributes {} unsafe impl Send for QuantizationResult {} unsafe impl<'bitmap> Send for Image<'bitmap> {} unsafe impl<'a> Send for Histogram<'a> {} #[test] fn copy_img() { let tmp = vec![RGBA::new(1,2,3,4); 10*100]; let liq = Attributes::new(); let _ = liq.new_image_stride_copy(&tmp, 10, 100, 10, 0.).unwrap(); } #[test] fn takes_rgba() { let liq = Attributes::new(); use rgb::RGBA8 as RGBA; let img = vec![RGBA {r:0, g:0, b:0, a:0}; 8]; liq.new_image(&img, 1, 1, 0.0).unwrap(); liq.new_image(&img, 4, 2, 0.0).unwrap(); liq.new_image(&img, 8, 1, 0.0).unwrap(); assert!(liq.new_image(&img, 9, 1, 0.0).is_err()); assert!(liq.new_image(&img, 4, 3, 0.0).is_err()); } #[test] fn histogram() { let attr = Attributes::new(); let mut hist = attr.new_histogram(); let bitmap1 = vec![RGBA {r:0, g:0, b:0, a:0}; 1]; let mut image1 = attr.new_image(&bitmap1[..], 1, 1, 0.0).unwrap(); hist.add_image(&mut image1); let bitmap2 = vec![RGBA {r:255, g:255, b:255, a:255}; 1]; let mut image2 = attr.new_image(&bitmap2[..], 1, 1, 0.0).unwrap(); hist.add_image(&mut image2); hist.add_colors(&[HistogramEntry{ color: Color::new(255,128,255,128), count: 10, }], 0.0); let mut res = hist.quantize().unwrap(); let pal = res.palette(); assert_eq!(3, pal.len()); } #[test] fn poke_it() { let width = 10usize; let height = 10usize; let mut fakebitmap = vec![RGBA::new(255,255,255,255); width*height]; fakebitmap[0].r = 0x55; fakebitmap[0].g = 0x66; fakebitmap[0].b = 0x77; // Configure the library let mut liq = Attributes::new(); liq.set_speed(5); liq.set_quality(70, 99); liq.set_min_posterization(1); assert_eq!(1, liq.min_posterization()); liq.set_min_posterization(0); use std::sync::atomic::Ordering::SeqCst; use std::sync::atomic::AtomicBool; use std::sync::Arc; let log_called = Arc::new(AtomicBool::new(false)); let log_called2 = log_called.clone(); liq.set_log_callback(move |_msg| { log_called2.store(true, SeqCst); }); let prog_called = Arc::new(AtomicBool::new(false)); let prog_called2 = prog_called.clone(); liq.set_progress_callback(move |_perc| { prog_called2.store(true, SeqCst); ControlFlow::Continue }); // Describe the bitmap let ref mut img = liq.new_image(&fakebitmap[..], width, height, 0.0).unwrap(); // The magic happens in quantize() let mut res = match liq.quantize(img) { Ok(res) => res, Err(err) => panic!("Quantization failed, because: {:?}", err), }; // Enable dithering for subsequent remappings res.set_dithering_level(1.0); // You can reuse the result to generate several images with the same palette let (palette, pixels) = res.remapped(img).unwrap(); assert_eq!(width * height, pixels.len()); assert_eq!(100, res.quantization_quality()); assert_eq!(Color { r: 255, g: 255, b: 255, a: 255 }, palette[0]); assert_eq!(Color { r: 0x55, g: 0x66, b: 0x77, a: 255 }, palette[1]); assert!(log_called.load(SeqCst)); assert!(prog_called.load(SeqCst)); } #[test] fn set_importance_map() { use crate::ffi::liq_color as RGBA; let mut liq = new(); let bitmap = &[RGBA::new(255, 0, 0, 255), RGBA::new(0u8, 0, 255, 255)]; let ref mut img = liq.new_image(&bitmap[..], 2, 1, 0.).unwrap(); let map = &[255, 0]; img.set_importance_map(map).unwrap(); let mut res = liq.quantize(img).unwrap(); let pal = res.palette(); assert_eq!(1, pal.len()); assert_eq!(bitmap[0], pal[0]); } #[test] fn thread() { let liq = Attributes::new(); std::thread::spawn(move || { let b = vec![RGBA::new(0,0,0,0);1]; liq.new_image(&b, 1, 1, 0.).unwrap(); }).join().unwrap(); } #[test] fn callback_test() { let mut called = 0; let mut res = { let mut a = new(); unsafe extern "C" fn get_row(output_row: *mut Color, y: c_int, width: c_int, user_data: *mut i32) { assert!(y >= 0 && y < 5); assert_eq!(123, width); for i in 0..width as isize { let n = i as u8; *output_row.offset(i as isize) = Color::new(n,n,n,n); } *user_data += 1; } let mut img = Image::new_unsafe_fn(&a, get_row, &mut called, 123, 5, 0.).unwrap(); a.quantize(&mut img).unwrap() }; assert!(called > 5 && called < 50); assert_eq!(123, res.palette().len()); } #[test] fn custom_allocator_test() { // SAFETY: This is all in one thread. static mut ALLOC_COUNTR: usize = 0; static mut FREE_COUNTR: usize = 0; unsafe extern "C" fn test_malloc(size: usize) -> *mut c_void { ALLOC_COUNTR += 1; libc::malloc(size) } unsafe extern "C" fn test_free(ptr: *mut c_void) { FREE_COUNTR += 1; libc::free(ptr) } let liq = unsafe { Attributes::with_allocator(test_malloc, test_free) }; assert_eq!(unsafe { ALLOC_COUNTR }, 1); assert_eq!(unsafe { FREE_COUNTR }, 0); let liq2 = liq.clone(); assert_eq!(liq.malloc, liq2.malloc); assert_eq!(liq.free, liq2.free); drop(liq); assert_eq!(unsafe { ALLOC_COUNTR }, 2); assert_eq!(unsafe { FREE_COUNTR }, 1); drop(liq2); assert_eq!(unsafe { ALLOC_COUNTR }, 2); assert_eq!(unsafe { FREE_COUNTR }, 2); } libimagequant-2.18.0/rust-sys/000077500000000000000000000000001436525270400162455ustar00rootroot00000000000000libimagequant-2.18.0/rust-sys/build.rs000066400000000000000000000046551436525270400177240ustar00rootroot00000000000000//! This is a build script for Cargo https://crates.io/ //! It produces a static library that can be used by C or Rust. extern crate cc; use std::env; use std::fs::canonicalize; use std::path::PathBuf; fn main() { let mut cc = cc::Build::new(); let compiler = cc.get_compiler(); cc.warnings(false); if env::var("PROFILE").map(|p| p != "debug").unwrap_or(true) { cc.define("NDEBUG", Some("1")); } else { cc.define("DEBUG", Some("1")); } if cfg!(feature = "openmp") { env::var("DEP_OPENMP_FLAG").expect("openmp-sys failed") .split(" ").for_each(|f| { cc.flag(f); }); } let target_arch = env::var("CARGO_CFG_TARGET_ARCH").expect("Needs CARGO_CFG_TARGET_ARCH"); if target_arch =="x86_64" || (target_arch == "x86" && cfg!(feature = "sse")) { cc.flag(if compiler.is_like_msvc() {"/arch:SSE2"} else {"-msse"}); cc.define("USE_SSE", Some("1")); } let outdated_c_compiler = env::var("TARGET").unwrap().contains("windows-msvc"); let has_msvc_files = PathBuf::from("msvc-dist/libimagequant.c").exists(); if outdated_c_compiler && has_msvc_files { println!("cargo:include={}", canonicalize("msvc-dist").unwrap().display()); cc.file("msvc-dist/libimagequant.c") .file("msvc-dist/nearest.c") .file("msvc-dist/kmeans.c") .file("msvc-dist/mediancut.c") .file("msvc-dist/mempool.c") .file("msvc-dist/pam.c") .file("msvc-dist/remap.c") .file("msvc-dist/blur.c"); } else { // This is so that I don't forget to publish MSVC version as well if !has_msvc_files { println!("cargo:warning=msvc-dist/ directory not present. MSVC builds may fail"); } println!("cargo:include={}", canonicalize(".").unwrap().display()); if !compiler.is_like_msvc() { cc.flag("-std=c99"); } cc.file("libimagequant.c") .file("nearest.c") .file("kmeans.c") .file("mediancut.c") .file("mempool.c") .file("pam.c") .file("remap.c") .file("blur.c"); } cc.compile("libimagequant.a"); if cfg!(feature = "openmp") { if let Some(link) = env::var_os("DEP_OPENMP_CARGO_LINK_INSTRUCTIONS") { for i in env::split_paths(&link) { println!("cargo:{}", i.display()); } } } } libimagequant-2.18.0/rust-sys/libimagequant.rs000066400000000000000000000404271436525270400214440ustar00rootroot00000000000000//! Small, portable C library for high-quality conversion of RGBA images to 8-bit indexed-color (palette) images. //! It's powering [pngquant2](https://pngquant.org). //! //! This is a low-level crate exposing a C API. If you're looking for a Rust library, see [imagequant](https://crates.io/crates/imagequant). //! //! ## License //! //! Libimagequant is dual-licensed: //! //! * For Free/Libre Open Source Software it's available under [GPL v3 or later](https://raw.github.com/ImageOptim/libimagequant/master/COPYRIGHT) with additional copyright notices for older parts of the code. //! //! * For use in non-GPL software (e.g. closed-source or App Store distribution) please ask kornel@pngquant.org for a commercial license. //! //! ## Overview //! //! The basic flow is: //! //! 1. Create attributes object and configure the library. //! 2. Create image object from RGBA pixels or data source. //! 3. Perform quantization (generate palette). //! 4. Store remapped image and final palette. //! 5. Free memory. //! //! Please note that libimagequant only handles raw uncompressed arrays of pixels in memory and is completely independent of any file format. //! //! There are 3 ways to create image object for quantization: //! //! * `liq_image_create_rgba()` for simple, contiguous RGBA pixel arrays (width×height×4 bytes large bitmap). //! * `liq_image_create_rgba_rows()` for non-contiguous RGBA pixel arrays (that have padding between rows or reverse order, e.g. BMP). //! * `liq_image_create_custom()` for RGB, ABGR, YUV and all other formats that can be converted on-the-fly to RGBA (you have to supply the conversion function). //! //! Note that "image" here means raw uncompressed pixels. If you have a compressed image file, such as PNG, you must use another library (e.g. lodepng) to decode it first. #![allow(non_camel_case_types)] #[cfg(feature = "openmp")] extern crate openmp_sys; use std::error; use std::fmt; use std::os::raw::{c_char, c_int, c_uint, c_void}; pub enum liq_attr {} pub enum liq_image {} pub enum liq_result {} pub enum liq_histogram {} pub type liq_color = rgb::RGBA8; #[repr(C)] #[derive(Copy, Clone, Debug, Eq, PartialEq)] pub enum liq_error { LIQ_OK = 0, LIQ_QUALITY_TOO_LOW = 99, LIQ_VALUE_OUT_OF_RANGE = 100, LIQ_OUT_OF_MEMORY, LIQ_ABORTED, LIQ_BITMAP_NOT_AVAILABLE, LIQ_BUFFER_TOO_SMALL, LIQ_INVALID_POINTER, LIQ_UNSUPPORTED, } bitflags::bitflags! { #[repr(C)] pub struct liq_ownership: c_int { /// Moves ownership of the rows array. It will free it using `free()` or custom allocator. const LIQ_OWN_ROWS = 4; /// Moves ownership of the pixel data. It will free it using `free()` or custom allocator. const LIQ_OWN_PIXELS = 8; /// Makes a copy of the pixels, so the `liq_image` is not tied to pixel's lifetime. const LIQ_COPY_PIXELS = 16; } } #[repr(C)] pub struct liq_palette { pub count: c_int, pub entries: [liq_color; 256], } #[repr(C)] #[derive(Debug, Copy, Clone)] pub struct liq_histogram_entry { pub color: liq_color, pub count: c_uint, } impl error::Error for liq_error {} impl fmt::Display for liq_error { fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { f.write_str(match *self { liq_error::LIQ_OK => "OK", liq_error::LIQ_QUALITY_TOO_LOW => "QUALITY_TOO_LOW", liq_error::LIQ_VALUE_OUT_OF_RANGE => "VALUE_OUT_OF_RANGE", liq_error::LIQ_OUT_OF_MEMORY => "OUT_OF_MEMORY", liq_error::LIQ_ABORTED => "ABORTED", liq_error::LIQ_BITMAP_NOT_AVAILABLE => "BITMAP_NOT_AVAILABLE", liq_error::LIQ_BUFFER_TOO_SMALL => "BUFFER_TOO_SMALL", liq_error::LIQ_INVALID_POINTER => "INVALID_POINTER", liq_error::LIQ_UNSUPPORTED => "UNSUPPORTED", }) } } impl liq_error { #[inline] pub fn is_ok(&self) -> bool { *self == liq_error::LIQ_OK } pub fn is_err(&self) -> bool { !self.is_ok() } #[inline] pub fn ok(&self) -> Result<(), liq_error> { match *self { liq_error::LIQ_OK => Ok(()), e => Err(e), } } #[inline] pub fn ok_or(self, err: E) -> Result<(), E> { if self.is_ok() { Ok(()) } else { Err(err) } } pub fn unwrap(&self) { assert!(self.is_ok(), "{}", self); } pub fn expect(&self, msg: &str) { assert!(self.is_ok(), "{}", msg); } } pub type liq_log_callback_function = Option; pub type liq_log_flush_callback_function = Option; pub type liq_progress_callback_function = Option c_int>; pub type liq_image_get_rgba_row_callback = unsafe extern "C" fn(row_out: *mut liq_color, row: c_int, width: c_int, user_info: *mut c_void); extern "C" { /// Returns object that will hold initial settings (attributes) for the library. /// /// The object should be freed using `liq_attr_destroy()` after it's no longer needed. /// Returns `NULL` in the unlikely case that the library cannot run on the current machine (e.g. the library has been compiled for SSE-capable x86 CPU and run on VIA C3 CPU). pub fn liq_attr_create() -> *mut liq_attr; pub fn liq_attr_create_with_allocator(malloc: unsafe extern "C" fn(usize) -> *mut c_void, free: unsafe extern "C" fn(*mut c_void)) -> *mut liq_attr; pub fn liq_attr_copy(orig: &liq_attr) -> *mut liq_attr; pub fn liq_attr_destroy(attr: &mut liq_attr); /// Specifies maximum number of colors to use. /// /// The default is 256. Instead of setting a fixed limit it's better to use `liq_set_quality()`. /// The first argument is attributes object from `liq_attr_create()`. /// Returns `LIQ_VALUE_OUT_OF_RANGE` if number of colors is outside the range 2-256. pub fn liq_set_max_colors(attr: &mut liq_attr, colors: c_int) -> liq_error; pub fn liq_get_max_colors(attr: &liq_attr) -> c_int; pub fn liq_set_speed(attr: &mut liq_attr, speed: c_int) -> liq_error; pub fn liq_get_speed(attr: &liq_attr) -> c_int; pub fn liq_set_min_posterization(attr: &mut liq_attr, bits: c_int) -> liq_error; pub fn liq_get_min_posterization(attr: &liq_attr) -> c_int; /// Quality is in range `0` (worst) to `100` (best) and values are analoguous to JPEG quality (i.e. `80` is usually good enough). /// /// Quantization will attempt to use the lowest number of colors needed to achieve `maximum` quality. `maximum` value of `100` is the default and means conversion as good as possible. /// If it's not possible to convert the image with at least `minimum` quality (i.e. 256 colors is not enough to meet the minimum quality), then `liq_image_quantize()` will fail. The default minumum is `0` (proceeds regardless of quality). /// Quality measures how well the generated palette fits image given to `liq_image_quantize()`. If a different image is remapped with `liq_write_remapped_image()` then actual quality may be different. /// Regardless of the quality settings the number of colors won't exceed the maximum (see `liq_set_max_colors()`). /// The first argument is attributes object from `liq_attr_create()`. /// /// Returns `LIQ_VALUE_OUT_OF_RANGE` if target is lower than minimum or any of them is outside the 0-100 range. /// Returns `LIQ_INVALID_POINTER` if `attr` appears to be invalid. pub fn liq_set_quality(attr: &mut liq_attr, minimum: c_int, maximum: c_int) -> liq_error; pub fn liq_get_min_quality(attr: &liq_attr) -> c_int; pub fn liq_get_max_quality(attr: &liq_attr) -> c_int; pub fn liq_set_last_index_transparent(attr: &mut liq_attr, is_last: c_int); pub fn liq_image_create_rgba_rows(attr: &liq_attr, rows: *const *const u8, width: c_int, height: c_int, gamma: f64) -> *mut liq_image; /// Creates an object that represents the image pixels to be used for quantization and remapping. /// /// The pixel array must be contiguous run of RGBA pixels (alpha is the last component, 0 = transparent, 255 = opaque). /// /// The first argument is attributes object from `liq_attr_create()`. The same `attr` object should be used for the entire process, from creation of images to quantization. /// /// The `pixels` array must not be modified or freed until this object is freed with `liq_image_destroy()`. See also `liq_image_set_memory_ownership()`. /// /// `width` and `height` are dimensions in pixels. An image 10x10 pixel large will need a 400-byte array. /// /// `gamma` can be `0` for images with the typical 1/2.2 [gamma](https://en.wikipedia.org/wiki/Gamma_correction). /// Otherwise `gamma` must be > 0 and < 1, e.g. `0.45455` (1/2.2) or `0.55555` (1/1.8). Generated palette will use the same gamma unless `liq_set_output_gamma()` is used. If `liq_set_output_gamma` is not used, then it only affects whether brighter or darker areas of the image will get more palette colors allocated. /// /// Returns `NULL` on failure, e.g. if `pixels` is `NULL` or `width`/`height` is <= 0. pub fn liq_image_create_rgba(attr: &liq_attr, bitmap: *const u8, width: c_int, height: c_int, gamma: f64) -> *mut liq_image; /// unsafe: It will crash if the owned memory wasn't allocated using `libc::malloc()` (or whatever allocator C side is using) pub fn liq_image_set_memory_ownership(image: &liq_image, own: liq_ownership) -> liq_error; pub fn liq_set_log_callback(liq: &mut liq_attr, cb: liq_log_callback_function, user_info: *mut c_void); pub fn liq_set_log_flush_callback(liq: &mut liq_attr, cb: liq_log_flush_callback_function, user_info: *mut c_void); pub fn liq_attr_set_progress_callback(liq: &mut liq_attr, cb: liq_progress_callback_function, user_info: *mut c_void); pub fn liq_result_set_progress_callback(arg1: &mut liq_result, cb: liq_progress_callback_function, user_info: *mut c_void); pub fn liq_image_create_custom(attr: &liq_attr, row_callback: liq_image_get_rgba_row_callback, user_info: *mut c_void, width: c_int, height: c_int, gamma: f64) -> *mut liq_image; /// Remap assuming the image will be always presented exactly on top of this background. /// /// Takes ownership of the background image (i.e. do NOT use it afterwards, do NOT call liq_image_destroy on it). /// /// The background must have the same size. The foreground image must have a transparent color. pub fn liq_image_set_background(img: &mut liq_image, background: *mut liq_image) -> liq_error; pub fn liq_image_set_importance_map(img: &mut liq_image, buffer: *mut u8, buffer_size: usize, own: liq_ownership) -> liq_error; pub fn liq_image_add_fixed_color(img: &mut liq_image, color: liq_color) -> liq_error; pub fn liq_image_get_width(img: &liq_image) -> c_int; pub fn liq_image_get_height(img: &liq_image) -> c_int; pub fn liq_image_destroy(img: &mut liq_image); pub fn liq_histogram_create(attr: &liq_attr) -> *mut liq_histogram; pub fn liq_histogram_add_image(hist: &mut liq_histogram, attr: &liq_attr, image: &mut liq_image) -> liq_error; pub fn liq_histogram_add_colors(hist: &mut liq_histogram, attr: &liq_attr, entries: *const liq_histogram_entry, num_entries: c_int, gamma: f64) -> liq_error; pub fn liq_histogram_add_fixed_color(hist: &mut liq_histogram, color: liq_color) -> liq_error; pub fn liq_histogram_destroy(hist: &mut liq_histogram); /// Performs quantization (palette generation) based on settings in `attr` (from `liq_attr_create()`) and pixels of the image. /// /// Returns `LIQ_OK` if quantization succeeds and sets `liq_result` pointer in `out_result`. The last argument is used for receiving the `result` object: /// /// liq_result *result; /// if (LIQ_OK == liq_image_quantize(img, attr, &result)) { // Note &result /// // result pointer is valid here /// } /// /// Returns `LIQ_QUALITY_TOO_LOW` if quantization fails due to limit set in `liq_set_quality()`. /// /// See `liq_write_remapped_image()`. /// /// If you want to generate one palette for multiple images at once, see `liq_histogram_create()`. pub fn liq_quantize_image(options: &liq_attr, input_image: &liq_image) -> *mut liq_result; pub fn liq_histogram_quantize(input_hist: &liq_histogram, options: &liq_attr, result_output: &mut *mut liq_result) -> liq_error; pub fn liq_image_quantize(input_image: &liq_image, options: &liq_attr, result_output: &mut *mut liq_result) -> liq_error; /// Enables/disables dithering in `liq_write_remapped_image()`. /// /// Dithering level must be between `0` and `1` (inclusive). Dithering level `0` enables fast non-dithered remapping. Otherwise a variation of Floyd-Steinberg error diffusion is used. /// /// Precision of the dithering algorithm depends on the speed setting, see `liq_set_speed()`. /// /// Returns `LIQ_VALUE_OUT_OF_RANGE` if the dithering level is outside the 0-1 range. pub fn liq_set_dithering_level(res: &mut liq_result, dither_level: f32) -> liq_error; pub fn liq_set_output_gamma(res: &mut liq_result, gamma: f64) -> liq_error; pub fn liq_get_output_gamma(result: &liq_result) -> f64; /// Returns pointer to palette optimized for image that has been quantized or remapped /// (final refinements are applied to the palette during remapping). /// /// It's valid to call this method before remapping, if you don't plan to remap any images or want to use same palette for multiple images. /// /// `liq_palette->count` contains number of colors (up to 256), `liq_palette->entries[n]` contains RGBA value for nth palette color. pub fn liq_get_palette<'a>(result: &'a mut liq_result) -> &'a liq_palette; /// Remaps the image to palette and writes its pixels to the given buffer, 1 pixel per byte. /// /// The buffer must be large enough to fit the entire image, i.e. width×height bytes large. For safety, pass the size of the buffer as `buffer_size`. /// /// For best performance call `liq_get_palette()` *after* this function, as palette is improved during remapping (except when `liq_histogram_quantize()` is used). /// /// Returns `LIQ_BUFFER_TOO_SMALL` if given size of the buffer is not enough to fit the entire image. /// /// int buffer_size = width*height; /// char *buffer = malloc(buffer_size); /// if (LIQ_OK == liq_write_remapped_image(result, input_image, buffer, buffer_size)) { /// liq_palette *pal = liq_get_palette(result); /// // save image /// } /// /// See `liq_get_palette()`. /// /// The buffer is assumed to be contiguous, with rows ordered from top to bottom, and no gaps between rows. If you need to write rows with padding or upside-down order, then use `liq_write_remapped_image_rows()`. /// /// Please note that it only writes raw uncompressed pixels to memory. It does not perform any PNG compression. If you'd like to create a PNG file then you need to pass the raw pixel data to another library, e.g. libpng or lodepng. See `rwpng.c` in `pngquant` project for an example how to do that. pub fn liq_write_remapped_image(result: &mut liq_result, input_image: &mut liq_image, buffer: *mut u8, buffer_size: usize) -> liq_error; pub fn liq_write_remapped_image_rows(result: &mut liq_result, input_image: &mut liq_image, row_pointers: *const *mut u8) -> liq_error; pub fn liq_get_quantization_error(result: &liq_result) -> f64; pub fn liq_get_quantization_quality(result: &liq_result) -> c_int; pub fn liq_result_destroy(res: &mut liq_result); pub fn liq_get_remapping_error(result: &liq_result) -> f64; pub fn liq_get_remapping_quality(result: &liq_result) -> c_int; pub fn liq_version() -> c_int; } #[test] fn ownership_bitflags() { assert_eq!(4+16, (liq_ownership::LIQ_OWN_ROWS | liq_ownership::LIQ_COPY_PIXELS).bits()); } #[test] fn links_and_runs() { use std::ptr; unsafe { assert!(liq_version() >= 20901); let attr = liq_attr_create(); assert!(!attr.is_null()); let hist = liq_histogram_create(&*attr); assert!(!hist.is_null()); let mut res = ptr::null_mut(); liq_histogram_quantize(&*hist, &*attr, &mut res); assert!(res.is_null()); liq_histogram_destroy(&mut *hist); liq_attr_destroy(&mut *attr); } } libimagequant-2.18.0/tests/000077500000000000000000000000001436525270400155765ustar00rootroot00000000000000libimagequant-2.18.0/tests/frame-6-a.png000066400000000000000000002557541436525270400200010ustar00rootroot00000000000000PNG  IHDRllg[IDATxim[vf5;={eߪABBl(\ cƎ W;-W*0ఉEEDIP%!(HRJIټ]͜F3Zsܳ92̓n֚k17!1x5^WCWx5^kWFx5^kWFx5^kWFx5^kWFx5^kWFx5^ko;#^WC+[ֈZƋ}ܫm?īqxμZ@sƋX'J+mD.9«qj\<!k<)묫+%ڈl MZj|{ x^rZ,-śa|h̒QoFl>:kbv[ =.u'UWox~ɈWe tk!}C92ݎ.$_LG?ra˪DZ`tR6s[ UqPpE4ΎTK'nvʗ^p*]`«.tq79nn͍$hz\|x .Y z??Cl2=n%ۚPr[\-(䉞cn8qnnaQ^!trIlG+lhe<œOM#6d֦&_y"}y\%AOE7Tay`dTtk+E5\^"$CJGF[wv~SJ5WuA(Jᗥ럨 kl \Qw,QdNfõ1  Ik8`?/:>L2e)&NYQUpEi7~[8%< 5YGn;崼.U VxS Rʜ `bc-L"`7v(fI77 k=R760OX&͇/ {dQ=FÁм7h44??'fXLzm`JFT )>/%"jYH(:#"#ֹxG)f+?-PM_3E,)\s!zfG҃-ƹWsLsx5?cK48EYRJTu}^O~&\ ,&?mw~jr:w:c0{{{rgv^H l^LT9exxO;)_R}ݼ4Od-Imݍa8rTBG+k9+'э_USNGQ!m&{M膺 էls^<E-_ay`9&q%P ⷹ#xnW&)$2X NIJAMi3#/ynd۠А5Iȼ1!c<|Ϟ}yjnL7n~̾8h#vCWwOv?O cM%&-ybBS+pIIcmy D.Ye3dmٚozUț5@=b[fU Q +$> 21U6ոX]=n_ lz`Nd`2QGO:7T']0% 1 Ij"5`UC*1y]&TAU, 0"g_gO‹b'x5.37}!;oD7g>sww^l$I 6%$<W23d ERO#N%S ǖŋf X/ͱQ#vJϟPGtfwmdg>sw}|ڽI4 I+IpUɦ[]&aָ!0=__oxbӆٳ㣣x}gfY"sC%f ,˓.?nY{Typ7hSDZ*K]ՏE0н/8(1CٟUr-&o/E>ǿi+Zo ck,W`J:2ʈ~I}/e8 M\5/ISYFFd+~_u|WM>Z ;NA'O2FDBFlj%e(p{"~l@l {e ^Hko} |TR~o7BF6| /$D`g¸,CNhuo6 YnZe?dAֹ`Mkd; 鼶eY/3|&reث%B|[Mtv eQ+y%tJ]ݣ{ Dgh@L0m$Jq鯋 Vn $ȒK[ .ȔeYཟoO\]k/^%e^o$o>~p>;l%4f2 'z=51T_[XxHEmM]!y8B]򘶥:Mp+⥎ s|[D.x[SsK?gqet)[%V$i6%1'X2Td6! | _ʱ?_Wޚ+'__,82#V M.xGv5Ob!E&Hkl &t1'M{gѬ\.}t|B'q7ҡ\ۯDbף}Һwc)9+ Z$\G?y͝Kss.oaicx? d'?B`c#Ѽ%'r/ v^SHUWhO+xt ~ch_5VXշq,-mqcsy:&756P} 3?x4C4.[qml} 7m_D`JfAd2_E $zn{T]|[al33V+ wx<9p*,((,Ċ\߸i\qzFlbMCT}ޛgWΌL)U%R'!\4b:yᵧ/yFwP6W&k(G^)$Xm57扸uCVX]58ȿ_:?_x\, ?#/^o xK$OoCG\8=o0nqf 2<`G_أGEgWDsY6q[?RY:>hD{7qPz\X.<>^WpJAk={`ifN@]h\Ou!IP. ǯo)ѭh|cEpN__,,՜_ڼm=/@~8z`v|"P[hVl5ǍC'%JUBG^uFoq/P!y'ض?0B~Y,ۍ;½Q/ċπcՑDgǭ!C{/AKN)Mܱ ьxW]qe~C/a H[ޝ (}:Ǐp[ :6ڮ{^u>c] C-r#tˊV5Ƕz<㑱03SnIԿ>EM RM,Ϧrڮ.4*q܂?뇾V&DVCQ qJ<Nj7k2r*i@N_u6KY}Er%qhZ=lԾD} \璟|sz67aBWF/H\Ysk3.jFƛSOΟ;C>찎h/eoVȺ|D]R}~X%nHJDW8'Vv2Q(dE#6b:>NFN;^< "[qE춛ϠE|Cr~o<п}oz;M\,N`p5 r-`?b!5VN_ү Iz weձdndn}9/m-YN6mK @2JV!@X ;{떔zxZu7{Ї MYYB@4M98i2"KUF92{74t_p=@%WƎXyG9nk1^ȑ B,tEoRmyyGGs pmbo2^dcWBhRYv-fɮۭ"LÛo>VY:LsBp"hD.@OWR|ANU}}S/x~d=N+[P{&M:Œp7s[%j&+ u-8] l\fZIj=idM-J=.$ǡ!7% :!t 3O,TX.lϐ zJ]6˼%6DPfyў&m_=S=>j$ }/:e '}j0 G[jdj3O~0Zھb9.U7Ҥ^6t!Y⸶Y;ϿA%hOBd}:ɓ㓏ףTIN %/m zlgDȩ!!6xVR?Io_V\!723]1cvTVO!umR;g?^A]-ŋ"Ue^8)\LN=:>OY IYIp+KY ￖ~Wu>Rو^K|RmImwb$ۯZ")Y:@N%#LYk;KpH- AهxDKND w/gLKdY22` I[)\q?ȩB2㓓OcSLiԕ3et2$ފĝ+>'qPN{qiZ +Qpkm^n#ë埿90KgOB^r;o!bDkL'kCPjM_[Jh_ u @Jq"B%p\V?s^[ė<~ͲŋWҦ~ƕsXx# '\{_2(ڗgg\W@= ʪ>>9eIŠRBkoM)!pK I1^ZLX,$`8$bL~C=) H|~M[_&飇gp6 u@Ɔa 8a׈1_ u.xiꪒGOk "R0mc4+[v5!-ٯ7^>AK+'O5P EDWaճ3LS WXԐ1?I(ͯsy:Iga^)k/GWZbRb$AK_fcGؾG'ЩK&ӳey4}ryDiIkr.U;Wcүdl}&>:z Ou.qن|]~)$,|96%1֔f1pb>U#4 yl?wH%Z&} + ;/DPg.xa-Zw_ޛ$wBi,( >!EH+Bƻ k*zn ;OH{uPR.cٕɵ.\]Gh~ۦwo{C52D 9+|q;'_;{lOѮά1ҪĥCER+KZ {egی&I ͑2A]QiaZXbaP.@r{SF5=$tSޑ<ؑnqnXl5d3.[-d3I%. Smoa;Ez boDL.uzxM&_<}sys4uC р1Ix| R^)EzKxbwx 挬V5*bҼf f F١n=~,oSDp] bwo4D2C=yqrr2n#݇KX̜{pS p2\ X\h" >pBaڶS K6ߎ})t2'ICD Lm;^koӥuvI9ܐ~ G DЊ а遛 9ɝx<~:.<-J,wY3q_|ixao,y'Ұ:KW/lZhi{dD[S_<~Hˀ4yƞy˱w-_}'K.=#(-Tl_:=U]V뿳7g))5)g B"Fhr=: KTC(UA @-1N!>͇jÑ`&u;qUM<%W2tJg&wbJAʔj,oũS1t+eC`IqĤpg6H|UwV>r@Bq Y$Q G NEa> ǎr ޿̭hwɴ$̛@Y'd[Tsɜ Y,\ڧ(hwP w!@ ๒EO!mύM7/D ZeF+i'鶮W*z>˶"iйG3_>H2ˬF-j \1;z^W X{r<jv6Zߪ1E+tMTvqʲ!zytTщz-L3IY2=bts$і1w7$ ٙwY0(Ȃp'2 B?}cw1I4NHZV|kERlٝ8>Y= [,A]7;֔W/!pc3ȏU>K~F4X}x*V "7=d %z;3%%nqIf AO FsQFzݸ^=zlMTS850iZZBzz;Tg%zRxdf"G+VMZp$~Wg?u 7:/N'G`Zd4i`0ai[,U x[ᤴOb"8+,IsFݷ˩_b4z4d2)j~Zܔ?@dXu÷U׷J4Oa_"2fȥ3zQ`E!`^z֤X#`i}{|O5yN12Zdu- kimN1ahú hE<(iDŽn$ht2Ң>\cB Z;d[ߔP\c<=~R.:˺3 &g*;wRYb@F'r8 {G欚LOyAO~*y삳eU*3\Ki5\aXs[ހ'򜯧iwK2kλ'E%Gf~*CDnx&y]^ HH4o٘p kǙ=F:%5$kd:)!O(('beS wƝ)ҹx /o\ 2 p.-ʾFZ?~?)-ji/UN"]B WPuQAˢ!mLpO~<}ɝۨ8g*8AXX9m}kuO58hY ֒ΑL l,tQBw(zw'ߜ0s;=4-CdtGM]:p7btZEo7FGau^ >.lʹϐfC0j:h0dfusM 7$4z X,+eOX࠸`G}k =*Ѯ88" .e|6v;˰joUR='u0yo4_",WEJ|n)qb jdw6_xvoxxk~w 4깭*/7>BQMĒV]4 \cq4npDǩnFlψ"\M>A/}b P[c7 -c%Rz1av8֞!\NK`zv|+Β6"WbȀ .TI`=K$D g29?+v2x"d #n Jw*ʓ7{rI9KzmFngM]qp_g \L*7GgOfg~O56%Vr,RI&{(hATf^$58%F+${C&Ad<g_ϞNp`0 7;xe6~P9'I {e;u4"ywb;ćpب$?m4`m$.'SCMIu.R썆!pr;'GNfʕLd25Wh4#.k)d+dVa)eR+gRX[}SҐ^2b Ql <D:z,uŠ  xm!f!ِj2|ŐB;Hs)1(LF4i YpV|6OS7MK*jEeFNڪn1L3tXS/ -HkzW[]»k/3Vbs}bv]|j@~>b%T OX 9Yw_9w5? B")<R}_Z1fBBJɴ3 @6^z%N@\$4iQm]K7f!TP0X%)WQvMȈimyh72'ɩA$qpr 4/JͪMgOִR!)MYZ!$:佁҃'{Z@ x1#s![ K4̶z,,;r08I^66bL"D5(Z#|:xR9;-jwir4~֝;S, r㞣:kUS mXo#JvT3em&7慚{kgy?`xASԎ̵ w_'*wDnrzUss|Uڐu`^6ؑ"aH[KvҬH>Chʹ!%"Xe?"FN? =@-s ulrtt4I?XP:d *kO"̀L6x15Ti#!p4 pjRdpI`X-oe~^0;.1D8,n1kZ 62OҼ'~FI]lbsOq[±L,ά,[7"+w! ? P߂CK<ɕH I* $n'Hɶə=!P7PmbNE#^0РE0xG/7-fQ`rĖUQVe5TVpy({Xmd8$2pJ/ 0@IbI$)yBZ[Zby]HJAvG):QB\emzѕ/p7A! |qv3H.Ab 5961Š,Qؗ<ט +u) <+Eݫ]kQ5쭰O{.ΩKCWO rz)Kq.X!'vQ.Bvs~ь(pQCL1~Q$&m|2Cd=`k$XqVzhbwPdMf),Y% %vLbMO}vKٺ{kVd iDLpŢgBYz *E3+Xzz\d?j]X<%wS Dž˔ 3¶̭NI9g z"~Xꐸ: "TszȆEEnk)m| !2kןdqI;rџɂt( ޘ6QH* p$f}fđ (Nlu,=`@.ur7H_RF8ZLDRUtT7:M2^7/q|Ix-8P gbv5lwMVy~V|S?M !ڨE-;v\dwA_[dc" {|57srgF̖+SЁۅS8߇*%Ffw!S~4:l$* RI~UaՒKt-.DU`gߺ${,1d8kF%0|S:f5A}v ֙£VrGW+tTё8?;N4 W]17[{1۾{Z9(jQ$uܮ q*+%>% (f)\I˴yKFE7-!޴л5ӾF@ABV^3b|z \ DZvLPpd(aPh!yL`SZ=M,EBә+QXǶpUGpm 6V2xKӤQKr\gPE;8iU]K7#i&QlcEAd-DP Ѷjf!\?@Z""|M)٭uQv"h$mqͧQ4pm+)ݓw4F Q+Z&>;8*I^O‹lr˕HBNӡGxfsBʧI\S̭q J̴3pghб\-gHF"M M V8ۊc *M.82.bJգl b#qE֋*l{"$ U+G֞5Tgpy֞!~&N2d!#]vMtMiџ\MCB`}xMY &5[ClANpb^i#<(jIտ]B;0lA.}.Z}r6~&,OMQLyYhT+1욵y/aXjbi+Ȱ۫Vkx"nuyAeIH-k7 qF|H͚G;Nw uN ]&SVkeGCBT=Jz>|8G^*C޴[Ir읛9|7r,[zy\K 6 eи/|u> hpt'K~\&$c\Bͧ1 i:y2~J}@+ܐߺxÎGZqꆼjoq=` vU| |]l mu} 7b8X̠W4p\LjZ!+X/ #L ᠄иA5{擛Z 5d8B &b8"`p/z f]5l:],oF̬iF2&0g^bn Aɚ+ǰՑt3qZxuD p$9Ykٛ:Ab8ܾX )s/ > FOJ+K4eMlJŽ{œ1챠1E4{<6%W'Sk1 'V;sqZdGP?rE1G4y|RH VtD)#1KI T@J(6a1mH*tOԦ'\UBښ:C@֑ Y2^K .=*GFM3:36UKask,=wٶ)&!!kiJyMpo79I-YNI4w8cj,Dvn壐& cȥh+szz[*K4_$Z;f䜄Fu GlP"P6i|*knJ z+_7񇪚 )IuOƀz}! GSנIj1QqtBDX[3ieס{Mp5Yj MTZTF<r1']c8DvN8d4JHO.dB<93Ҵ'SL5`^n}\idI5 xi('knCB s(CL VuiؕK`ErUڞꆌմOLM5Q9hHB=Ԕ ,`_`$Íݰ_9\$Q:-޵O]S*ͪ6dI<%i)ŝfiy#8lGM)v$oťǥH&neUb" Vg1gdG^j1 jM_k ,a!{Sּ>FV_@.ח(AAj!FSm61qiY;a1~v"M^/_SI #fO6ӎoxl5־{1֙ /@c2܅=#jk|7: Ay>v砶W(O ;A7I*1Uc7vJF8Ea #`'bhFLS{R|3H4 b*lIj "QtsDokw*Z>ի׼AKKÊR\ r!gDS:'E(4"܂|ǐӝLwvOT!DXP.T6 K dWAiK^w#KM2K]tT\??x ^T:!2]ɋ='u1h4 {C;Rex~`-3 , CC>IV!Az|~N1<1ԲbC@&5tv* ծ "9]kt:wޭLڧ <5N/ V ƒ@LRMWl Pw5緇}mr+#bЪoiMB UA UжyCUn^ժ|~ӧƤ~?U=php~dMΠWğ wY* Ŀp49Gxw~`EmJ]+Z%;b7D]ZoaU: . ʬ|c1R,c2fP\Toi~,eO)[ejFnzVglm}Dbkd TC v!UvaHz S4'KҜ^<ñil" Ċ$֞Rw 퉴_mY>|cyz4Dbt+K3Dsp{=0%4v(v®"2q*3CC|zY-۷vqX3(] C.P/aUjޯ#HUΖIhAPp)~4{ZJmN!e%M:=0uBϖ)Tdw;zpw VWj d}, 'zlT7c"+θX\ s["^#wGL } jӈ^7_CrMgӓYMP^* ,t%jɱf㌤\f]dfu_g6]&rд.HE 8tWQ{w"s--2" ˲||//` \ X&bށzGÊ_֞Y%Q6 2"RT[^N6zodΧUA+2u 20Դx:=~oز~KV/X͑!gZqGvvȂwMX6*j_IK-lRE^@)R.} SĔEKR<*kSU% FAjjXZ8 !FpaRȄ"qulRR5O2ϥ{MYDc)86sʭ%ZzҐ7.Vw]>;p#HpO''"Rn7fL#Od l~zrI]Clr fds˲:}wv 2jQsĔAUkHLW6+9 !{!̡hInnϼ) \?# >*TEf`I (2ڶk38,kįg0"BP [ FO%L,SE8kՂFI&h~/!+JjͿ9>9L'0.s YMM#/ Dؕ;===s|@ ĎOAY=>?zv7GJ}_k3Rǡ=" nL^ayou|Ð監厧#u㤨IVӲ~U1kN[ *]ibclUoVZSBY dbrZ`uT.սy \_H3L 0 iX+L~ gP19}@iVq˨krRV * /1hށbx1cooCݏ-\+kCEi5˲lRL&}w6_`wl6>|;wF)~[EqƔ`U)kw{?lC`C.AѩGɥΚ@M&,:+d ?j'ͽfľ\TNbT2\ `OdL.r,8f͇#20j M/c,ۍR;ޅ/ЂK!qweKtceLni=Mx~FΩ}M%?X@K0({p^Ley;u4wh4ڿ],gO1OCv1[հ]%;zo I)Io:͔5ٖPyNq Id% ɭl+qaPXߍR+_*s-/c|&.4?ƐT@ . 3c.Rkə3nt:}lo#v-sGHҥQCerkJi}HDf08M_&o`t',aL¬rcz`VWTb x G'绽1 ,~(]7䤆 4f`zd|~~2Q<>)vtpqgMЕ%3*S&3OvmTIeu?4,MiH-sv⼄t5݋LEPQ"lv1 [t6bݢԻ@9Z9( aMYާ $5z*ɩK>njG<;@ز/MWølG`oI=(;{(k[&3s R}hz m #MYF|:ARfw?Y'C(Hc(h+B1\.ޫt؍::} UȆA6 Wj}UqV3k͜i4oV"Wk*J%yظg_G8M$puXk)U,4\iתU1{8 "I5VHqɈs>"r4d歊^kȥa"nE'u7"fa7Q4{=L-tYptUs`LVZUY4uxۃzMrOrJRgJ ;L^[US- :kyaP3 S1O>Js~{ۯ. tb1pNW:}zzl߾u4$%rd"(6)nihh7QVp&X6@ԺV΄m}sdT [AvZi5Inf` 4ڝ" 9@NJ_H c4nv\eu %蟺d'e0;SM^1ϒ@V{I0i%A,@'ƛߤ_٥پ` y5WnzMF%m][N-t# qeqO`O˜+Փ'6.^W{x>> u#hScc@EP˟"|S2Iap3g=+P VV}NZAn)p*^#Ke3}Qr;M$ g|xcUN]=c/)5ը+$S3&lPEeEAĴ@,W)%SCIn (C]\m:@:ѷ\,.&vZ{T}CKeS~AR3uEV.sީtQ^f+٢;;* \ e P)&5w'zۇ:D }^7 I؜tJ_pT&UrP gc&V[F}kEOi"蕸.sVǪkSv:r sQ 3ˇӯEbwU p+[PÞ`=20<Co!jRѫHa@=j/Pj`Á}B-ZplA/1-ʅrۃS"PVݔy;13L|`l)åd}FOnͱڦKYNN6MtO[5Ъ[ ثɆ\V|R}*g2h9ʸNt.J{| `T~_CK\$IAxDqI+Z-$WpMu !B2|j' RnMˏCΚt oAEpj ''Ǔlo?Me0'|o5#{O +U )$HeJmG 9֊Pg2jiZz\X *<8Cu.QTeXS^`YJCN|ڹ_ROTrx=/ۇKNx!HsC@n t n2gTp)w`{;v8G2$W5||] ) 4~ɸvh #r뮵YxTJ3b K4dBbYv+DL'o }ĘB(XbxjYsV9U:% ɘwFn\BӨf| ik{T Ö88jʨp7y%&SdREm,!HjpR91bmР\q4%MQFȁoZBbmֿˀ-ϡ"S;r5|4+ *+6JPr.`۠X%J{v#`ôbuOv| i|8)ȲQ\ף8QVml,k:`dV mX!j7<س,iQ -ɸu 6xD#%_Fp{l =32ZR\unP7h@0W T 1cb>8IȳI~)i񒊇-ycȸ5[EêM&e3^0C Su5>v_.3_s\2 "EZRZX e.r::t$`RtЩGe/1aRjEpF6h̤"++a6!=7*CchղDEpY7z)VݖR\:M["D߉R2XX?.I>"?p!vE$\mn!꤄2U^@4Dy#IJs3%!-_P"mh5!^ :k7t㺞WdU7װ:HBkc9tMg R[y_Wa2Iҫ b/G\sR'ʼné$\gcoѓd݂G'C" )hg!_JɱŊ6DcLXqp(9T K  B u*o\k w vt Yic_>I 4THI/I%%:Kb /}E$8}B<:|a>885j "234JG` |cGgQ&~OWLSY+F(J{E0VYӶeW):eU v$.ӐXDcU!ԥ: #*[4+Xza0Ƙ@3Ky5hˈ& |;w!t݂+dTV^.q. <ؗik)<Q$r.GCyږgz$Lbo>QGݝ[t~79T>tJ.߲[%ZfXN>dIP7bh2/Š,+{aTܴ3pw#΍IN-UĊk:H 'mLN?}z+Fx>Ӫ+Ve| qeY.ٴ8ŽBEӽnfK{+zJgDBnHA1U%y~(m1 hU9nOLcUת>?{0_сHwHp6L, :,5JX^[iob!:Z8"ɶ4u[vE<֘F].>Hp2^Ri/j R95SsSbXxsG K!|$1Y#) >wq+ A.Cʨt+\`gW'LM's3u ~b7NBDMz `1vtQ$}ؾ[Jt1bJd+'] XHJgB0dJRwp{Ξ<_齮!)8Ϩs8!٧(,Plz>͍Xely'gnwݻjݐ d(i86ˏmJJy!Ϲ.*r35`RsjIJ'aퟟ*a q._mPۆ Ɍq6t.!'8,?=Tp9XH(qQ-Fn2HRq*I(l%UBSM] 1Kq Ig qv&he<Ht,xkŠϳl,Q(+Q(\zŲj,C˜v,Uu2Ɏ1sgYBܠsJl(ǓbञBewpVc7zprr2vn#m؂'bU_Lp}dfŋʶ7 Dy떇E%&KTA(a;ʇ7LdnPH¨F.aPeZ='$2L I7&Ӄ.#6FZ *NK> ^jCJrQR #{ N=\i]I۷o{LCD3{U)i4>a8o3tS=ْ ,]R c/Z+U̙UVjnfNv~?rnT;Ve|EP`svI,Y)Pi%{dq %K4ǔk0M5|";!|^NN'bC` % XȚkb>JY84"٣ӓSݿ $b^Yl% j)ҬvRDޜ:\`8^| ݬy6`wyیSda':Z569%[SBlD'Ot1J*o;i%$'b =pY.o'k[|rh aoB_r\ֻnF\4FwAtp?A梗좤ˤӧrF# q-"`B J.P m#rPc .i(]O}3H0T'La!jKTfF= HLtvC$W8_r[JF<:~ިiO:۽e"Ea& xyzH'fS|dmHs.z/RZ̐U`׊wgUyx k:F͑pr詸)W^n\T.6'+OujmC»q{Ėc2O\'$zju-Neekw`;lsE9!@ıD9 :Q ԲbӍ'TZzӓ˓ABЄ9|zaWJ@";H_ŝK / YP}27UIH~ivngR a2كlZJ'9T|( Oރmo8WIjSR,yDz0=̪e_r=ݵmе&ĸs[G\qz d5)RշU99?$kFQ+Ծ-SD,pcgՆg.mb<+-FٴMEK'l'q{-]W&૓A hA`ek]nƥ-@+`,(|{3ʽtv!AF0 W=%v4^E-8#;{;,+F;;uvBlW"aƮa'J /Ijg$`nޮ^,mנ5OܯR̋3"X,!WCs> VbzHIS9;({?T!fV%=w; b]/KΖ11"+tщ84/sr HX+`$Kdf`9d0~*RӽN,vgi 7)d\[yyR]˗ub72*UFa1AE~(5y8g_ޜgũlEКׄ}bE;K"/w iTHD#Dy-tvSȆp]Db6P7r LL*®|^o4[فTM+BEmJFR]#.7SnnUQ) bݳ|wg̚+䖔Ď.Ha5&S;iiWf^4(ә`H$ʓl< q )2Amx06Pze]-V7c ,M\n]-]X@޻ 7&'g瓹Na6F@-JZ9RtA*2Tb rNrD(|3]P46aka/Y"; .3dCyAe-~E#\+|Im~뮠>oop#9#|`K>7~}|n䛡28öEohD9x(faP5e:o ΅CVS&Vx?﹒iSKImRnTemjYotS{J#$,EYK.r#<H=9#|(!`) *r g8m~ f9Szx|&K`?MA5p`7+B7V,F2 Wq#JF&-);5+,Epa66܌W!>(QAm*Z,$Xz5*O!dyq2&Qfu%O_W'&EP! _nحYεrTNVLY[sC3߹3+95=%2_7!~uO`>־^6YeKoWMg(L*t G\ɵX9 O_n}4J&C"S@ sL"k+lˆh[nd]wQo>lHx0,Dܽ[ ^|vM'G[ңUϩ=s1T*22%"6',?5, LXi PRNbn1e  mzxr~L3)7UηBlj.5c5F/H>/nnץ߫6 v2}1N'!0{Wjl%^2 M/{U~_~ ߳X?9'IaLb,IER6d {ClJRJ4!"U5&!Ic M&k;Tߨ#-B'zYֺFQIR\aMNlΫ~)?O5XjмpKPL5ޜTc rUÕK|/{%H,+'[!"bڴ J:# %U$QnMJ=Hyyv5>Ҙref:R#-*j|c$cݵ'B'E*Yucx`%u1[K:1KF;b wAm$咉ڽZc"{:8xg\7(8 2/MrN-:MarOrp:3(` jMSE0 bhUҐݢ\0%墨G^DM0;:ӉxM^r/w?)*lкn)(՛*$c\%VG?z&S* 2Sّ޹-/T(mB3Q:nΈpֵS54"᫶:uULߛMw>*wn#XCa tuVut Y/GLo])ú}2*n27rT<<dh=*!ɁB  ]C--u9Y!isM`l M)SF3"qhYVzE|S, 7Xhltk>#]Nⶋ >Yٗ}782ង1Mye$2N;vIvN9E #2e aBM&i)7T\܊s\mjd$Yo6q^` E[lLvʵŵr"2%au  vx ߻hĄ!yhpl]$c9{ X,p"4WlF mYMD_Ξ)@|F вS/I ^Pws}2@M1j[.V!ݞkSM%&Iw=WV٤X,eHJQf+<`5 pnu~(~23O^;֐߂e"۸',8Ns1l{|yJg[ӽedg֗H DqFX \})ӑr㻅П'.ip Ka\ATѤh zW:Ud1/fgG|4=h~ hPR6/0KNj:͵p$` YPҚ JIR2J$%X2emxks*)+_iTx"%ˇ wZjcmG^%h`Ӕ)hF:!K=B2RjOġAOʜX FdZ=vp[RbɩPG;$V%R?J umH.ָd񉌑dG.l,P 4Epagx#Y e,T|'S{wGO/:s$wL2.LB|1rn]7]Mι"q2)̝tz|@#`/ٛ$IMjmr*6fg Ѽ\3&z]PEcό~x@Y%]*K ZFA+;MW>POxUCA$B\ qUgZS6f=1:"ji @(TdNw%!JuupwrgguJpQH/@[q] ̼wjEVFdt) zR,uK]o]\{\@DleH<[[[犽QZ؆ 4n4*S9?e:T/ac6^e qMvJʌEOZNF iLUӯA*oޅ2.qrlʛ=wag S;NjF^*nTmU8 7ǂY.cm.R - ݙ mYH7`j:t{o$?B䛻F=[xiIwYWm[cWFɐXѯ=U/. Grѝ ę< >2s1xJXB)2%G=CZת.*l/Eɵ7 K?E| w9k^onӳ9ud2^Jt&78sedfQU6 BV`d3Ѿ|^5&k/!LL&y;=нNpwi:͎Wb ]Lr$ŅUi3karnJIGwl>00DD4zLgm&+Nx )m;ȃO{,o ;!K:?[^R]ːPp KN,>E(jrk\vR_f3bޟJѻ|GezD<;#~2nŲH1$k$S2.np_@|bwlأ)/̈́jw[D|VKӑ껜bvg^mFUmM}!fWl.ܺg shVТǔo Sѯ}n=g[nG67D[H6Y#yDpEmtS)ZOΤ+'FaPqij*˳[w!chuv#JvFJb.}e!^2&r( k$;"Yeއ 5Y={H@^^@"J@:vTbdnyj{-ٹJ[> N&!ToD#uNCIc^uQq=$B ݝ;j sDT|7}\Acjgek?Qs(ek2Ђ?/8WDլlS oy)n `ix6tHEjt^={l~D1y-n _X@In kpI{B5UL jڽa\qIgw9'88`NN&w~oy0(krS2ա[LDhM0xJH-'بN_t+pbvpd3dU"9H̉߫鯕N}#" (B2k\E=忶:kΌ%2;̀ǁ+ZaY]>4Iabɨ 'DRBuxg\7c _Z\wt2NrHGZ>q(2T?Q[l4ލo^6ϙS|:}̬I$4}γ2N'̳Dz x բ?|ەXdBxtެraxT]1 Hu$(v`]Ig刹9[8 1{Dngov\< -/uU*K-b W$+' +_Vvo$;oi5?X5;a%-X-5d;YTaESq+h֢r[T'ajϋ|̤،XnrZM$oF 4eDW7"DB.\k fRpȋ^;v$wǴv)Ɍ8A~A2t]L4piQsoD?֙+GݵG,sg笸ZI2㩖^Z$3+aRf==&Pl%=n2nSZwJnf5ĕ!Mņ;^8cu4[ :$m]rm&wt8?g;z)iwr]vx &rqײO*QJ24sY'of11v-Mo|G^{~aBMdr‹Rceን<[1TpTRcdfi^)9+q$Tbg/]۱Wr?g:UQ©eFN5vhQ+\xD;: #4_PJ#X@U8{szn:y8=Le5ʯն2h>vNUuELnԦiE @^Kn~t2F}7^;+Wy!. $՚U7KVϹ 0˲YUg]Eթ;`_|7mMCmT\^MLn$q]f}7"LjC8o3zO;$ nf7N[;}'{`v,8FU!Y|l Ui55J w7l~>|́KEBLbl.aKCςbƸ쿒UO}*%J?_?=a?.imFd*0xim1]uTTM>5 cVNq`tnByL KRz;y~kUNi7J:./FI7OtQп s5bA# :͌j9d'o]K9 ؒ>+u|< s! uFK\#qξv/eD ElcW<׻d߀3=?uE+S¾IjӹB\;7v[fyZ/K3?_}v%4oMܖeV\eh]+c*bax0_6>:IFX0,)@hq`F;ӯI>*sTFXGF dM j@Z o:d~Fsmr% +*+\ Xk K!2ͶK&18ѸHr9|(HHա3A'z޻w֭,N>f sH;îw rluv6T~4Bjy# :6 nxJO~S?أNN%aG) QML4qT$L‹ah.p5;pI%ڼiZ/V\T݋ȂP~=P5K[@ړTm繭d2[ -uGWX*B\776n9֍Y1vj9̥FpqRO7La5 `SLO|r|b&ϔ-E]8>Uԍ^pST KMKPٕ\^xW%9/I܊6ƪfDZoDS[zê-Gn HrkC9,EvaH,AK;ʽ?g쏎Ǐ` 5ZZ@.T^eI:Z@˗{5 #E :'+gIΥ覵Z-:vw"36B7|U|$atln9D 'jyCra?Ltq/9Sѻ!C#FwcǷxC%E-8Y-a6ce R$& cnZI:PMy$ I(RufGjd#dP!VV- xkc-hK '/# "i*mō,gaUA~ǏO;@>J,KX I{&yzɭn2ʛ͏{FMUZ}(o !LeN dՎ6ܯWJ@&ԎpuIZmLᜋ^kSlĸٯ p 1tkp)Wta) UާVdXw(Q2RXTS#5ǖ@w<jyUWL>A~hܒ jq80.(P$8j1kqHƉ|gZ ~|=uƌ^a>jX SC>:=zXYSVe5֠ e,zz0k`,1zyBi*8#ۺk%X:%Q-dE=,b_I3{.7L1VXiLu. [cu8l'd7#DM9z 7"K<2E2o7BaMwl2 jDΘ^Jq_$N/ǩ.{׌AΧZ󮈌~=tY: l{%;a|ۚ- y(1lp xqa3ߝ=OișS-ԂP5dn=В̒O?TZeP (!%&JɛCmBga c7?z pGu?=$@^/i,lzZ\'hΩ]:)DpAzg{:Xړ8qY<+ 1߁@?2Fds2ryݸ]ԦbřbmIr K2[}+ߓOͯjV؜6r5H2` ՜{d\TyA"u2-A2x4 Qe#Uy!EeXմ O{:/bHPEܱ|-N_΂M_Jb:}ߥ,|kgOyƍm|~c ig+O;˙57mK}yX4X*`u;S?%Q8'_"Wa4}MeDCM$a}ʸ , 8\a[ͷΪQZdÒmѐ]JŅd<|T}mKƛlߡBW t|CTlBn8 ObPЂ5c;?vOC} g6 5"^&K6dOˆ#$yIXR8 =&( իҡC !cS"A`A4c Dx䷓N NvMTKq+V`?g;k$!Xh) ]ZDWbFQŢqeYe@ XVo?t3VU?⩲3UO%Rj,h\N 6Ȱ>[-aOAa7ؐOdQUSE@Wa=lz Z2ʴ0냵+,k͡p2J‰D_dIr,o9Ӑr#I`JY3"~ӻz]M۹%uq~UB+o =a ~ ȝu ) iQH}$DŽq-aZϡ}4^:xR[z#9R{"4 LS>Oտ}w|vV%qH`z+D/#Od+;/剸n@mD: ɝly7Ii+aW2]zlu kA} ~Ma`ط!J+Mt_B Fb*ۭ<ґ ,t΁ 'ػ'0GS&qG>֭ F7Y5?&,5xtKl. Kau.eIDPew2,TZm#Fzb*Ȏ 9o1ֺ3`8`6xM?Yb*[!J#{eX1JN}`+"]_-ʧ7/#y?\L3NjT)%7HDPsA]k MoV5.ːPq@C0dPUH]uUi.̸YW54dD Jh15D>*㕃,d -E] }+Ҍz2|2_;7UB>2y˙Ryd{F,l:MS x)8@5. GV3{a_od׾-JnلmAL Q!\ c@P! ͛0wc GO?yvv#8Im\U<ܦ c[s|$蹃SP:I>N{_s4qbT?|k _'f.ø';H(FM(> [PUfHI,[6-5e<"jv: kai` Juİj[>ៃ}b0D'Ai=`$SUMDX/\ òd'zZOK6ƞ,dCA mICpQ zApbX9/hLjN]TУ*n;G5q;v?`"8r`8֎' 䑐R"Tzؚ! +b= 86kRcrMюЀ$m>TѴÎ_f\8ä9!p W!vwuK%>ok^!=fNj^Pwi0;?._/֏=1?L Z2n{6~:=rc_ek|f)i'fzV&#̧hkF"@̎θXu  A#H9jSp qaZf\fIZBT͈8YgY zHFѲڸn.sX ~8^786[d(Tri}fK;IHi>V!M:̠11 Vg0T^\&YX&&kluwcigl'kfv*_NECE&dYǹ_Y\h|& ]Q?R/o[o57 .]&ڸ$$ { YJZvN&q`h9mi퐱ÊjR%{xໝN+~:@xq]pU5B.S_'?eےG<{y|'zELuhmIw|DBoWL`-,YRBJiZ=P f鎲Tao=+w6뢧ҿٜh.?F1škXn>/C uLEJkhcd2ᗾ7޽oAɅFWefJq^;sk,2wRy?"L~U˶kMa1 ^Z!Fwr)Y,/#^%EW!(]bawܡ()e /_{eY^v:)g 3Ou&unʆ$F5ټXR99lXhjr+]mWf nA>Ć ~S DPR] uGS@ oEM?||7E@u\4 bDK_8%~U~}_KWٟ C\;{trUUXV.UG!`[Tpfu_mdꦊ* #Qڱ\mt6grp0Rԅю^orq#8{Z(/ #V@ Q=/F9 2)W@,jk0uYCҾ((:#KvW.ʃ(K'ifL?r*2CRoPĵMX2ޜQ諻x:M.+K)ʞbe- 9e]" sGXQot~[+_{^/̀&>"o3rUE7y#i]LnKG%A7V;s @N8R(S9x={`8zBB\)T_Rasy\RB^RRwm 逷k}͚xgD]]94Wb([:s"g]=H89{G8'ݢ k8HvR`|_ͱcdDً3ܔ S"<|aIa{OOwPDEMH64L%y{VtWItx(sXl%*:@)O{zI.3D,&M`' H8GtN>` ˭|F}i9 ?]y@vwkS\AۂinC֯.%(TJk:(QVQ$rFԎ)'cb?n%dD|nEǣImjAq>+wY؏|P0[_7%|W\ G8A )qwniH?3fBӎ)TTؚ,2jEPy0Z"eG8vh&6p$w1rrsX\,μtl0ͮZSn-lFvJoC"TmWU} j`R%x^]|"SDЏ͑D ;":1]alvSf<@Cp1O`c8siL?6kgJ}DE})j1L }Ȗ)oW^ޕoc5ɨ S":#ii7Mqev=w4/4d~=Օ2Mz^ nz)ǀ1g}秧8୙ͪ,̗cl1W'o¥Q)lH. #{pKk`iKAo$ R޴\>*zc|K%"dgf7zd32h毢9.?l(lfBAgƽ\IckmΦiY<GX %'KsNor 9zKP+E"*2T%%rg Q Ӱ(Q$dyYvi, lE Z f6Lp*j+hKg/WfW6#$7ϓ$Vj>}"@_w;A͖ ~mN+(҂=C_ze#!˟ _'ԩ6]>;I`;F79}g(NlenyMtL~3>:BV{ABRc: h21 䉞qt(tQW0sI+:f^s-n|XVHZ40auWX43}iK _CP SwQi\/餢l];Ȏ1QxOOY_~ 7 7EP9* ;˲N\husѽ#E;2\'V-3#ɹ Kb9Jɍ䉽 H #͘\3ED\K5L)*Yp iI!,,Ͳ8l0L~-23$bln`YĹBMqb7MrM 1$k szsrSфk60ͅ Y vӖ` XFY*߼5W P% ;xC3H?W&)u|$𣕣6 Far丹-ώ-me{ALQIhZFW֩R؇2LLD!/mu %Yǣ+H~MFFvCˆ 7l7[OT:#GijVt|6W Z/ "L;Ӓ|}RoLd? +u.m"B.OĮfP0sq^Ͻ)!2DVehc-ZsćpBqv@ެ. uFmOg~n)IPᄽV.IҬżi_HҮt&9ݩBboޮW:=1lq,vәaq`"S\:|'Ϋ1v*֯Ms!W쩧V N* [9tdN?ϩ:2LXn%^>]3wTIl(KcNw zE6ճ",!&DRa(}'>2pWQ|P 炴v( APDR)aif}h5\_^xHze2=J=E'[?c{$8^(U`ɮK8}ku2X(ʪ۰>s5:`.7=r5*P&ԵTZcE1,Z`'zZzjqC;+wyC/JΈ;\9i|<99@:lG-vH5+5ݛiչ,7wm"4W^!֎A=d )&C] ލleݲΥ:sNTPh#O 5!J _O|1K?Ou!5 y%EN_t\8c3?wQ  نhx %$_@A]&Z)6eY_[}V]?tq]ѳE~? U !簏%a=_|lz7D,M!sdHEl2 2slR0:W6%Jv *Yb|kji_C {V`f͞*BŇ|RA"v)֩HHJD%BozG<d`ǮJs M^IO?;~i֏՗~j9@v+㔚SȀeu# gOs̀["٬(d< DyJlO4M>x;D}Ͻ6nai! `n*k}eJ]Ʈ//W@tacWi.6 Wn+&3p=t#apv{&ηd96$Q#.vj6 @4#8*˥fVP >qB(6?>`)竎z"t{f 4gtXQƇ_@d;3W9vJ/]ƞF\\epk4ɪNt?#ͪ9C>|G] ' o,t|p^ 5jYBt"n-vV]K~cBkq'7MuԼUeM6NmE9Xoیq2h/s̰T(}Cբ:H eV;I,XvwY8CH;OD:s!e6BwZ^ο\*)2k.fzGM_i96@AvAJ0\k#| glߠ sN1<2Du;*Ҙ`az!$8B}H8c*b%_ش{pJ}*= Lxz"lҥ-eZ\YGD(4s#VE]]`#*/S,q=V&,s}iɀm{924O(N݄-f֑*x"̢ ܓ[i$M})cd/.s A>D"VB,mWD,p^//oVc2ΧRT?-At~+&<vk }CKU:Q {2lA.ܖbCy1 3KA Iqk:O_{wwiRӡ~OfWM߶#L`dǚYQNY5o^zda7FLL$0{]cA#>QF[B2D@r(m51ceIFb{б I^1X(v؉&JdAf`+BIb4Dre?fiVCv[H(rB {~aa"kLzŇ^W5C}TlOo Z"Q[/nFoSyʮB})gy{jC>ŊvѴ/MlNѸ!.R-[d*B7Z'Dp#“R؈0D|f▎9؇ݿ={|ے4A#IjHA Lj$!'rIZ)Ҳ+Z)xZs@sᕫ)/. 4*hH7'd]:_CCd|[.yū%k鉰؄c3a\4g^@ fאǵ\<4m@R;_`S8GA#eGHml>iI>,2/2-!OGL|*D4[U$@WT=7XNY/~qg;vn1@.N.b(t\["5S~㔝2,O&O8  1W0,穽ۉK':-"HCLfHjP]U Ziң~$;3H_đTn84xB*V45[gT𹰯LU"oH<^m fêIŔ ^g# wu!y޿/L"Ƒ&z65}GմhAhx{g߅,7{\V65zg++{qL*pH͍P<PzHSUΐw8aIT'Mz1)[lU-iBnɌȔ4+0="a%CFE3ܵy"&Vm QɂiX),E0,tSuT7pеx 2P{؝@AJm`. ѓRp]wL##,RYcEbǻ*w3A%>XMG/qϟTuy5YmDSP.PbN֏B!hps{q J(%R2I:n従]7j$& C L.RgI̐tbJn2Ể?j-H7{ئk"V\RWO {% CW%Q7]*9(!2UjK;/8#Ux47kkĵ!2ʲT]W%&t6 ʻ`e8g{h D4tXȯ!j<ȟxC4Rhs[eȊx#GRu߻;`"2yvc#e3w|:襘$'"vQMhbj 1ǃiM1xWBPL UPiϟ$I3AP#32Q8HFw^=e]cV{Zf#Cvy9$AA\QUwEGDVeRpC{n)1-SdJMkMF1 |E0V9 7~IH.7n'ܗ`DrwK᳅`)!itQLA»~g;)x(O`S(B%55@-Di-JVTR2[6.eC &G?I"nD&v#ʌl13(F?$f4N;N&JVz>/]H7%|-=Fd o vl #9Wa"j:t?Gg{.4*w =&д"Ǵұ4 C{6I4GѦ=!͋eٯGj+AEf]?/䘺ۑQ`sбm7X ׀/\#K4:b`Q9`jG&m "l :B"CeC-+ǏĖ{o{,p+-tb"7֬pIT7O!W88}GBE*4 %6]܆֔!^EH;b 7b9uay#VgW7󣷳;wޙX'4l(6Lht/֔N\(5Y!M@l/<ʤ6TWn<sHm, g8'ҖRsYHL^a;B1o5˧.uN>ۗ7cWD+:cVT~յNJ5NO,i.c*܀-tu'Q(?*^P{ b+bJ5Ҧ{=zPZccWdx%zZ#iK*!;.Wi9E &ܽx9a]}-5H(ÐFwAFOBk"TuViE ~@%;;B$u F h`5@>dh6+Y)e:Ǣ2HԷFwˈ[wh0_yTD499[r낦rcw㦞^jNۖ* `GQ=9=#.̤(W `T@1~d@Q{N ׮vE\[lk/tP(s)g]*/1~wb!ҦZ5PUtY< F snP{y] AwX,|zW֫r Id>\vF-1ak( Vzf4\ SKƹ-ۆQ:Y&[kD>\.~d"?Ɯ vteì*JP&i۬l3|ஓ(_R9/ g,M" dw]H gep:lB& oI௿#c"eӫu8'7yLxao  O`SM]F6:pwp ,'.ֶ{ngc}20'yy1L%%_VEpIxy縞mS1=G;IU |SbS=NVPv$m Ʈ@]6m]*$- 1Nl!wN%vEQh0tG<%r'P{i%Y7^7k­ @a/~ _R6'IЋ@n:`N }8Nǥ-xEl5Iфp"jЦwɱhE k1(awĈx`s֍\kr(FDv*15u/xL 8^D0xׂ?])oe!Ow`p#UWɓW.b* fHI4$nDtzC 8f^K3DO4>؄n&USAY;<&nApXw9ڵnrmY0ʹTiʲ\,VEVYf7vhmZ/׹!{M8 uYU :&wN(J{70; 7+ykCh{q}#ZȞāL\^/IU QB4SD,ĖA`t1+ћ١T q'Z^6AU"e=2A,y$ټm|6/?ȳA`?u >E%>)c}lh&:O{/,?eVη~?~1~޽O9=R:}`R$l{f$E!ҳ# 8u-nm44*J8(].܊=_3[>yd/aӋ= GE#9gZ v@ iٖ<,B*[>D;3hPԻhYc_CYwg29 @b#p3ߙ~. IM;*Xp~C#*Md}fWvd6-Ӥ9[lw~&wظWr9_]+%9lUbG96}^2Vk.9Qg6|-%I#0DVˋ2Y!2Jݍ6$1- Cg04%᯸#0)?a'ۇu^EypD'Vm84U3{︽K:p,:<朴_AT" Eh~xrxx;ݱ(Hk┭#*\6 Dmh\Ljօ^)$Y,ky*qM+7`)/oQ>ZO2x+'֌ޠu&jJoDA-=?򎨩bBY;ѣRs4;Pu"zI·^%z cx?ɪp)2%ErEP9Rp:*AN=xBwI"=:^[,i0x !.oE_’vS<j@ {^ܞqL|KH{?ա"Rv~"I9kTerot:=~YrdI'gz*1y"bkEȣTY^DDx/*Jx`չ.K#lP@ChmlM _ob\`?Na={ޱU(V,1+ڑbBDr=Ng^ҭmӼvLC@QUuv4jzxDj~,jmG-Ȉ8[A'AE4fs}yr bÓ'rD&OJ%`Ĵъ 6*nk܆Pzw]RZݢ WeޕbaWFHD [zkɪ88v̎vDO΢,9N$%qo0o.3I&$hI6-le>eiE%(bD!):Sx-܊pqI1=j}'C.*e.ZcS#?4Dw\n7;ޙ-A9Wz4jQP$0 Fd+כ?%#ȾH-HJ:IQh<+{͍ oZ |KcZj-9`b\hV) "ND/GWN]Rrq}!Id )'ż+4,*E#/fL7f *K.p kPx \oVd [m.1ٓ)&4?$Ԇ]xjP#hfx.smM~i ؔQ"~rGU7u `*IC,oʺl̹NTYšRԇ*2K M0SVxA7DCݠq'tjUY*d *4l7(ֶCMUe8Ttɍ q۴ș 2x=tpxff~v s.7[ml9W:΅e}].<}2dzx5 .i_92`"z GÖ3~Dw\k҉LEtygiؾD?$I͋CIk.yphYSy ^g-OH !Wբ҄^\_% ؍. ^È X,+_ZУ8>Jt h(E-aAaبd:ys~zRM6C:XS[ dI#ʘ-sC Cet e2kl՞#,kmђe {"[9_΋h2%kRL~QGweTp5%fjd'{[[IBY Y6lhmsK!Ք"-HXT*CD+R4+P=U7 E˫oL˷t^K:Rg6*(8BcNA"wioA݇5{XÒMRT;<8YvS[ % a <EڲGߒA"Wź7E?z޻w!HFWY>9{4;4 V8luy@$#Gn#'Y}`BStS14 nh_K.Mƭʹ&:^WT%@j,K^,* 5lAy'/K=!k`TXKFnGJ /o{\m@FX\7$k!kXiՍT :#F_:K Sʟ)u!fл^aK4mYR?Ur =E=wYSW@Y'.";SbʧV& qT .h$z"_vZ$tntv? "AR|]&dS$G zݢ,R-+%Rzوԛ\4!%&j2ح9 (;3oKZ%)dr1*ed!ar;V&=VX&X/[oU#^H)si$;<>Tivz ng`!Jӹsq)a߾oy!2>\>|i1GGG:t\{7ɶ[x.HDFW^ 9%M_t=fUlkvl)|E]SWth*4G0͒Oǟӓ4+X%8ȾJM-gy!!ySm(X[6cp.2# n~L wuUi;]-͢oS,J(z1K}_':;V~r+aAK%X#`' |m dM'.|G4_y44NJzV'2v.PffŸL'IT]0 !ʬ+TFvk3NB<k...PDNMUk>{ k%&+nU 6N%{(egCt*SR;iTRԪ(UR%]7oNXBxpR4aid;B%\Y%&9~S^#K%Q-$OA2 툕D!7*i NgD:+;={ZNd& $Q~]M[d:*2`@rpud}enMPYW0;F<\οQ&zRS\@-uV. %/#]C 'MvyRK&ee*=\bj~i91 CWTqC5|O'hBx:L^>x(ƾ{t.o0nGO9'wsYJ9ZBRfc 4QT1 N-Z=^*oS@N2+s.787 ~z_X^D7dg~68^KZIʲl8?_*rxxnUAMuڦъSu"~[>6 W g@xSf/.fL4gťCVpN%P\ZN-Siz[ۚ .`W4p=/;ִOh[5<)&Z>ơx]}r] N(<jV}GW8eX_ !1,kQ~.> Հ1R/gU%veT}4pL2W/^&PMI8ur ŧlȿ#E,d}(A}jf"ޱn[%?p\dܫ8X.ZPLrTvCj颵(|%k*7t$8uDF%dͦ}9;B3YJn[Ec4SeiB ˚Pff,7kͺñӁ)^lVn+i+B1`.ђzEd+iwt:&{;bx}?+ۀ\ܚ6E'T8{T\_.FwmXc~`H ]٫ҔoJ IhX..;Did^_P r^)m );F5 \ 'YA8j9)Ff2E)H<\B4`= V=M|:5oJA#Ua6ME$FlrB=:ڴ .;kE W>CmE-U/D>[jnu/_+L&>:<FTX7%i?%lӮ_[0" 56mn2҇`q|<+OW߃c/ՉĆ{R. B7UGdc[#)  6z"Vf!^OC_lBMy&G,TiXUX-k0{Z'IG-Z 9Wfﶵғkֵ]I5B˨̺*e1;gcx\$K #YU9{%LL%}VjLu:UB˞ʭyë[O\>_+Os Os1JLN`&,.]/!5+dq:{5(yL+ѱ[s >YE!:uq@v\9ۡ9 E25AXJv§-yZOd<4d ZFn#n+w9%նOuP(j\4ƕ@ߐecc8sʄvbEuuys%/ [O=z%nwt`&*˼h]\,GGѝ o'%v F$Isܚ-(;Γ "?,7eK1:9\ӿ\`z~\=c^}ۍ&ufo;Aw@. ƍdTJ , [PHt ϴBaT8'~DX 7*ꭧ|N/E_D;\tF#vg}Dc}sLQ{󼘥ƝtBmnC37G`A,h~ |jUY|"LR5j:%a'콰J`MԆ0D`64.tq;ed<eܬ `=4&J6sd~G 1HSm4=0``yb> )eb%~95tjՉϪ74P4̚԰_|o)v Rpͼ(+,g>S L$ z འل,n4ƯW1ݷbÊ ~ܜV\HK='{|*)%Cފ45i)QV '3BHl\C3A~5bsV!|P `?PՊjct3:+G#MtR'u0٦<=;i o%wh7 !G_L5aUĘ(WH7rٙf7'hh-QKgYDDbꞁ>^P{,o\\*VLaUճ9,S"(MH2)m"+Z? ? 52g1j*8DL(\^, y5K /L&*8OB6znM|s9/@hěK1 BKbB0׌*'.{!;pW)>{y`~ _\6gb.\HEAi<ŋQ2}Ϧ\7F6"X22RJN9FaS*;TTd%>` Q qz.gg.$# (EJJc)ȗ.(wtl#6Q,YKǹ 5Ԧc@8UjZFSWDbcGR.It8, SU'ŰMBӪ`I:΋50[[p#]%SZE1}x-ؐϑCUwigTԙR;9QR^r(j;z &+oodo 3y$"R F$q羿@lb0)e,V:JV-z'܆SchD5fӻf/J O]:6'_Z`Psɸ8/ ,RkR9"CVBBps&bzlG88[0-* GhO r՝o5(2/4ZSdZ#l3e?yhͥ0nÖq4q'Wl9$no`oܵ,յ%Jnk+TxK-uY (1N`j4s7%->XoZ!dea+yq FįAǎȧX㍡h T5q"^]A^(]g"*Y4y?'Ӌob RP*bNIljCw+_Ny5Pw:J0bNOTV Mr;}\FYHr8fqɜ_RjHՉjc. >)ˡ,,8pA%qTq L\UT~hȎBsTn|,߾:lCh)Bvka0{bZ-8O^UZP0u ԻHJ.>|ځgPşW(|żv 2ԕȞR\ێR6( <ŵWܷR- '۪<ՓT,5 aaIV$N93<&'`SK;}B87$d[wlhY(#,J!P@!Ihݴ0O%:ֶWħ--7E:ƇGE= r@ vRǞ5B0g h24I_&\AqaanCW^?/#=qHݰ E%̐qu;!+z VyIZKc*H$Ji`XdPz3J.fKձL^FK1sx 5.0pVTٷ (I|# +oz^7$V-pXHJIJq\"@D5F"D!!)^^ث-F), ʟ@8넨e>%Lʃ҆Jckl؁ T~#L )(t]fˬ6xEym| ϛ|t2DSRJ&Jc =3vNxnãƙ$R)7wč޿A8cw~- #J--Bp*0Gć"%5|PcQk`\n0㳳w?eaMDRZj]WU4eZzx-E~DbBDFDmu0dsߣ^+^ N\ĽuFZ,?GNDm(E=P)Q[W7 QqvN}4#, IED~ͤ^'^`܂*5 A(C%DooG, gRM@7iǼV<y3J^_`1>h4Y(f^O<\ξwxx 27ic%0|#EA@vA}UmߑsKBٞkB踂-A1y%AhLF hbBqgz_EaDSi.pl^tɖCE\2KHnq]Ոd kY;D)E-1oT*Dy|gZj$J7qɥ%|%Kʼn12Wu,x<̘B%pWV;CqT p1:>Kgdnk݈q *'| Σ}ٝ7.yE6sߕ7=cDZ{0DD~msm=]fL}A}B a [zDR48a^P$\bLzBY2Aa LdfKjEIxZG!80-!܈/C+07K͈[D.ktrck[.lE"G2^PmUnp53Į"GGS'#]0Q]gO4N V8;]Q#OW& XD渗bw_wnO[i=md ~Ӳ1u0#!r2%1'I!@SҸ;:-uz/vCbV[mD4+Ja3r o`d|]mc; ZBY()Cdgz a#`@ Do'x⏖ˣ_yQa]yb]W/7Nr߶dc~6o]W j8Y7JE;+]IV_^C,F1 6rT$؛<b5"Յ[Lb1?vfÓ,K˰+H =NcV1$9b A:ά23NH)I&_+8@B%r0 hy`(]Z4 #IeI Jc0U)9xPyleJ!hJijfOxMx=g [G<"  W~[/{׼`,6H 戄α*UeӳvVʺYVO>)b2:K* ԘP$)jl9+,OP) NTYs8Ua2&Pf{U׆&#ټW%L?wyE1d} "ލܠ-8et,8G;, [\dٰݾuH8Հ4%,cKx4?-&~1ʩOX&zg҂慟Fc255:*BAƣeV-ŵɖ3^ٮΈLtAwl׎ކaAcl@#.XzM 7b|Lh ͼt|4#1*DIyQ~gX>KyV%4S_a}@Ԃݒb`^։t˷'=01rMҺ{xا+oG \펅z9KauSO䙲XC qM"st`MZSr'ħn ,eU] 1B󍵞dnZ%Y'.b^ Gv  z(%A+BVSc01G JT9Q@r)$ڒb|:[JN+ndbB2ݙ{`)KD#Zy{0cLC7.5GH сQLN.DK-;D`-|W `!܅h!gw;*XU-R;ԡYTpv 224܁_Ya ]*R4s BRLW{ep["KlSRFl9 (傅2%D!˧3jXoiS&GWj؂I26y/#4pd-TWC׵3Xw7WِE}x=m'<\m' ;뺆S{^&o.ŵ0c Ց/I }U{߈G.}|sjC FQtzڱ'ƣQ0 [!H8 d%pGΖ<~F1ɔ+JxsX^\ao]xNiknRǠ^.]g&˭[*9m~+hC*l0)qsx"`JvQm|8͎i2x0gePS't.zH%DmJdR+7m+ͧ7mJ/ ޠWy6C[UZh$s"C'02Ð[`A&Kk\-'G ,Sj)=fxFVMM Fal)dhHtCcKk]1J My~qORĹMq-o}(w~e7Rvjkѷ½$k^qLǐMQD,΄R5PiBOWh3C@AHejs$'UU.Λz1M_Is0Tl țY}X"dHĕe)0E1;NQ?!gD#9Äg=U]'kkXA'yH̆x"2HӨDHk$Lz1H';%֝nȷlqQb U/EGAe(DЪ;:"pFk7' 8k4X^mCJ|f-CbێMս}HʩjԍD+֭t+Q'/LuB ygB)QK5M!)Ov6KI1Oi|4ey/PmqDQ:&FwfHM=+ؾAMΦG٠f6J H˒(KX[>JU(a[]#HJ4yk͌힐f޷HS4D.P-5;yJ'c%}V͑ՔHFV`ʳr{ٱ"'!lɩb I袂9M,J$Vf/Q@^nPŲry.iЌFhd4wH%[]$okݔ.Zi]j˝E[ݪ(/#ׁscwœGUʀ_fVtM@ChB` xYviMC_٠ᢲ$r1xZh 7\Wn9x6 :!fRS^Lw/*zTo-W'K5jj^yg$6dxvuTLOb0Wf2zNfVêjh*SzpT12=( iCCIo=ܾvv%WE9Pr΄'% G=l2ؽ(_6nJC K 0%]to->āY^LKURv}nZcxe|pp:d@Dd-J_)GGI(5[ KqC*LB yu~7WV7D{_fHF_C5]2:zoK\l0rF Tw.m _đ'bCi%t^X%G.u\RXi]3\k-.戙FQimREuoԼ'rYIJPw∝TbIN*o7 dsTrʲ)('X_jDFJ-HzM7l[= z_be9ϱxܴb\4 Stv}Tk[\}Zx}̡D[WUjݻ.<ω6bC-ľ!bKP?D8~yLD=dkAG{{i kciW\/Ss5ODP1ڴ2u,g1GÄ`*v0?#aY@S{^G?- 2Wsrk, >ޙƷAd ]r\4VX?,ڲTw/,[z^6[aL}w>j<.w/Q*OB5BEP•z(n|/=;Q-b#=bW\V=- ]jl,fp]֭}xWODu\M (;2<ݪڢ- 55,uESj@{!FS E#(4%%ٖ͹qm;ȶ0\钺uO&݁xȉo UЮ<JhVE˳踶$a5NF5?4 knQtȥng3&Aɍ'#U/EI$Jmӽ2~ u\7g'X}BV 0,UKzE-ΔO.q͗PljP^Qi JݡЋO0ԃnXHp$G ̉xq_FzVI{Q.' Nʌd _0Dx<֛U I=Eʹ=aŶYv~VrCYBJ4]y'o|nK ]ozTrUmȳ;E* U[-B-=;J'İEVukK/"%oTh7,5| 5)nKY;@<3؍YDoO%mt[ |^Ɉ``P "EW(nƉ'C7.H`w)r\̡oE{Fk H[^ V(g`d։~')eۙ az x9~hoٔiڑ\&FbËyfKtyslP[≄ Rnߟ|&1JA-T|Xe:2>M:}6i"3' =s[y/e@pLu)qPCE=r(WT@`ʎL C :WU:u _ArL 8EIpۣEupF"'Î!4RWca;Dtw3dd\Ğc>חnu[ʺGZppVQBm_Pr`7m^&j[~=+nQ*LMTK2U|P>!>XzzK-h~p"!QI{epܥ4\+Z:{t4q,.fٶ#kJ=:OI+VSDil:yNQt,Zz'd G )JWiC2{ʾ˜_>gn9=؛ ۰1\#Eہ#.$dņ_3bR>}?+xz0 gf[zd$KjGzIR[x>xsGuw+*])O0HlbClUKfSͮm "LgkdL&(Wv3J]Krmv ,VicD ,ǀU M=YY0Y xJr;*xP6ƻk0 ><3k}VK:Ҳ±*=0(3gXu-NC>i]axdUC,uT|`Wgt/+K zcp9Dxl 2Pd`ZNPPkt0d 2j#XZ6{z1HUOX7'!2 jDz_ %[VYSc Ccd^4Ef.cC[v<5,|i mƞJ vlj To2a-з_]D†\@@ܤ糋b2.7PXxD-+|Rp] %uܡvfJ{& W~۱x.%nx aq!"N♊NP#[.WpR(Njx*bɅ^ˀ=Y&̅W>nn?q+@7NER\k/'px82 nm߻ZEMMO2H VySi>,ԞU-"pՌtꑄW ·"d ImW+[=FRdU(w?jFhRD4zqzGKʩ)"$7dQzT|wI"r/y8:J>unRobڛk7Ah;׿%<3jݵ .jG IwOkZQ=#f3AjL`[3᷿u#Q*~=iX"p +8R/OWߩu֨%} #ǴΧN8 xZÝHG8&1 "_ôXXr1HLV[Uu~|aw@LaXyʓ+rM\Mz_2J{6M^Z4"5̉F`2UpFYys.O\viqAש@D #JYk p25PHZ0{J -R;kß c}'zK\BngorN_rr|^L،T{ۇs Lt 9>:SWϨJ³ !یb_(;kCK$DzADM.rQ,L'$ՖzR" y9L -kZ)dA<)&^o{]װkA !*_lH/>vbniޒao+p͏㖡RdS>q>~N$3"@JNu\ri; ܖ k$-BlNwOj1t\㲹I2$K Zw^z_+ڑęexuDܞo ٶ;Gd23k/}NY 7%TGPb;wRgEQ}+ӛՍ`PHfz,` X%6Z%!ò3⧥C'\uvZ&trt }`3eN!+\ ]RWIh&),6~H *jY4#\|뙤8-wh}~DnZ/?P瘟Q?%R#&p:E6q*Sղi4lYuv'vtP*0xc u ey^F)-4b\RJ&oj*4ǓS)> >ğ5'aRX!:a祗_zQ:33 yCk$ ӯQƣq :JH+Cn4Þx-NƟ pUHqAVl~1"f1znYW/ɱµ'#^ƒW(! jnKdp'D*H4^ i P˵Y$ѮDd'Z]p;p :ݻ%$-%6i[;ږٛ/Tzƥ`b?"M; 0H+^ɭ4r$^lùݒC)WT!No:aOzB> R!L%E^@j 54 ~ )ڞ4|MD7%$JGZot )yBXye߇k孮]PToׅ .Ft:;/r1Uw{ݿ ]wЦ;63"DEDA5_1 $E.We<+p`T#W/vM)zNJTUGZZ(r_T54yz"&YORX[pF RWfc#yxaNp>.XPFeo  Wl q (;(媪YGEJRlM7:wIuD]]71BRvc b@ә]oDvaDL%LGVpkʣ܎{nޟ{jZ]n)iR Y'̰CWa~D֋x_czZVB3|=EN7~0H }q$–'|p 9-ʉGE2W>D~@{ɵzT*PV|ܝ.lyfG"HLSׇh0 K={FyV "a7Zʼ0 31(O*hI{ ?zjV xv\ Vb^> :E>ػg?yaP X'B 9ꃸ~g=|, 7k G6ydO&*3r.A2,rXhO:H"P,:I2gE1닗49_>⼜ULG'NQ *f"a7t/AY3\6l3B,j,Yp֍;X`M!Vc+؅v6EU z]hE?uOFxǻ>AúW_}B|~=7D]0"5KFT'k 4}|_;)H5l`%pr{!g*(#Aj) E;wFI3O*՜W\ϚÃ#9~)A-1$ apD!S+k4]%1;y"OaRȍHhXNGQBo\2Ӹ6xOMUӘ:^CM2NJfX_*JhXɗXLW|_=\}ӆݘX5&`1K*z6YR WVoa>Hh O2q1jX~DQjOR>dQW|W;9EF~'ULBD8H7~9N Lna"k>LimT&paxN¯uF @'ɜzD'uH20ד"SL),mmIM ; zך@ժt&Z&-b`k sxF]}Z\8nU!QCQ[95~%kp 7璑\']ppbC}B,}$4yѝY&=C}$[~- bV3v# ™85T y%4K>4vG4H6{$R*o~i PKU ;6J3N2ϕX f)!2) yU;+?*$/9]g(׫ Ns <-cٝ\QhaXt'g˵X'ސXlQIQQBBTi;OՃBYX~OL5|Ą=ÙijP,FD(dBw H^(8ST$`PIK7J;ՏʪjjNa8dNݙ_+&4 "iP~S ɐ5u3L|5WM6z$BDH:&dJ ypp~hDetJ&Uw!Q~;8|PKOs'=BM2xx/>JWE$:0|FrQ¢$^ QT}f.)LD=LCHAHݤ6k\%yL՚o)C2Dl]eޏ!O~&, m\U1lPvP/3 DU$L7ﾼ8z'Ye~ ҩ` R[H9hITD`>+ bt6o.;&G{s(R2q? b.VwPc 7.'LzV%i4+tX\ǼM,'hI*JPA(I%4n!#s$ ,EJ@$܉W`#MW~ >pNUkp{Ә6p6&ɫ`kimӨfi|1Z֑Фmyh[O}*owܽ{|v"JEsBV B`SҖo|ѣ?:w85'H7YfO8L1&푈-1}GUL-'mb pV؀c7 QU#0)}UUBj|@ dXǤ^7mZI[ICp᮪ VLSܝ$2b~gbSf wlh&O PMSIMdӸ\&T?H? ˯}sP"MSgIߺYλY+47-i 8GE/q¦ImmM-DLzZF)MOON@I` s$'9Z?/K/7 ^~؄1ַ7=o Ҵ, VJ, 1 2zQ4$:i iV Yt2h͑,` Cue*\$N*^G5kNѱpIY~JsȨFl' )x gDZIMvކy2Vݜx:ų +&2R{ɫ_5Q q4fX=#"BYUeY$Wd6W@sI{:8Y%9~uT8*gM['EVOr ;Wۊtгԣ m=g#V k'` |E+')Bmkpd0&)Sh).>,R7MS^̒,Ye+U)ܠgX#3E[@bqX3Mʻ`4 ; PP̍)OXrgz֭ԡTs9`xatή?eEKnW&.5JSүq*GI# N, jkF`(=<aZXyO ?;r=ާRCY*ϼ}ksзdDA 6[%"Qn[[@^9: ^Q0i"clfIh#T(!T|o*;Ɵ~%wyihIݻ6Nt^\:Y{CAJ팈_ZBCt6\:U)م;UKI s`"Ǭ]!;(y"SQUCla ⊢ u:bB7sgvoߍ߄|镗?򑏁 &2g4e,̮+ Dߦx TUnŀnUe+e/oG=9gwK~'q!"v};0Msĕ~L#*E 93<̊zJE*hrgi֌zakvis>@0Q5U3TulN݃{IzG?ꫯ&7Oh90{X72"Eand:(ywKo75M# v:(1E(]~!$yk^U{( &[eC+p~b3#ΖJ0%H)Ձ"GIMIRZb1bMj؅{L#.K y|ցߡڳn'':] w;-ZF#M2+?ȎCgIFLx&U}'M.R~7liS4t>sitJxW}Ǝs']Ԇly_ ZGM)Mp\rg PpiXW'9)C#;n< Bd-0~?=_sh,љwF\a8lj泟;s,틊0(2'4DugE6[vBP ӊ`+*.mNjpq!l֟o;Q yˣ>գZ>n>WDwEV}n >Ll+h^Je24vk-TrŘ6X Qڏ6ή[<{brקX}bu1о]Dw2O%r^ODSKA >"VYE(Ck~֪V4pep@5e_/c`ÍܐpL* OwWk]?gqv* KJFmλ>w{LT?QQiuŏ㉛p[Fs #p者@bbH|⃿U_[ׯ͎[]{zT->9S[eNVv(9m\\PG||k'޴|9} e*si/!^dz@=G#mDymGaa`y/~=>Y{P`9qSv2韣ތYg| ׺Ξ=3)%r18NPMvȎa!_.4k#o?U,g\Z3vw^yP欟 !=- prAL"VkokPBˌQk!B %ۥբy)I&7(zWf'j<.F8$ aZ̡5 ehv yn-KB==#mkyp0?,Hii bo5K55VES]w\ E7$/ KDܻ/ſO4ɀnQyDޓCx'6k8 9_cE; ¼-6qF&vFmLdeAaO7eiE5D0_g?cqiwCg%ؗHޟN m\M'bhQϧX M8 j-,Aob=#̕.}n(ww pj|rW~_CzW}ngurL#)޿d&纈`44؞awC;/_C>jGJhD-R pȶ=N[FKα;꺇>'\"ٖcb;Wma~ؖt#pGB&O1W~%KR((dJ$2m8CҺCY?rq"٢$?~ WM!x8:_կ_~EOƖпo@:VAq׶,~ _d~!JYF*x"\%(ݱ5sd'Od$7#ΒwIZg gu ?!Ad/W [(JW?%_;5 M !=ֶ2/^쌃PO)+U50 ?/o V8bٖʨ\v-/=w'">d q1نvB_IK#'??xSBFO/Ƌ>w}죫bTd#M"BFmBZ$q/㉈=#5 ~cR)+}QLտ.v]dzp%b1::_$lEFFdZ>q\Lrz;G'+|?QX$>RkR׆T ^ V-91|対oLU_@l4ƊU>&3^󋉼&nZd`5.|K_ &ius8ɒ܃ QalBWwDŊaBZ T !A^__G\=o>X;wvyyO~Zɨc,iZH&d͂"1? Od m~7#@@ RG@#h@JD䤬?9Suckc+ŋ̳}_'q _jV"5`F_{}ё lF叒0RoC﷑Ki|(*nb=C#6oF".f0j%iJ p(aLLnKc%cVO8ÇIVUZ(aymjλ|lC}q9+7觢cu~1ni] 5Z&q pidkg$^bk*ݍ铀ĩh}U:č$ȾO/=x^g A US_oV8e2gV'"#" G7/z(? dJyЎkFpk.Y}nG?l6זo )%M+i!"+Qd5)A qiŐݯ{/W. of}WKڮzw6og Xee"Bit:ss|<.ɿMPm x`G vc2+"&#n}/6Ȏ3#zFl௱)aĄ`U@CX%OHQU ^U(zd#5nNr0].Wr1_>}֌F;׮c\RII8N9Ī ]H3}]վVQE}okxԺ۬&kĥBOpNmf윾U>8GQ6]N'j:Ԩ .)ib4Gc,Q) f){ѶbH0 knDZ˽4iylJ* v a#bP7^]`\LM®Jk,)nTx{0h!Sưا\RѱS% 6Y 2Ŷ#׸o24wsN*-Wlr : G{AŹgvj.άv(Z25NeRa&5uK08,QCh :=@JMOz I~`dшjTS@*)ZHQ *D{2m!w2VMmp#fgKF^ :ŸV8spZ׆2_<6.~^$bػTZ Vge1[k_K$Z"}w\_ZQl+aIMm8g];n;(1x1ޟ#~2ny+iZai6BQhv;ޯ ][)S#rɟbxuInAYJX5Y[0V<6(/?ǡ <'c2.h=ղ_궖ymCuW6"@6To {.}`D~Dx73;-h?)BY31^ 6W T;W5cbcC݁qٌJbkh7:KND|pcTbkzEU9kd+"#ب#.Mq14Cmڈ:ڵZ6 j4Wl W?0I0"bx9/"b>o1#vمg^pl]wQX8j؈@h=MLd5KlX~kJx?0L5Z~+Cj+2t W1Wσ3n/?M"ǚ%zּ232kcXȍD_yxyD1"k`j;ͯ}|`_7Ybބ[Ka{s2"o/æ!ݚ]^?c//@n#4e[.b= =4"Ccgm#QA56b|0PHqW~Cz3T{}$;Cr'dB~<+?5{ d+kqˋpf˸!ȁҀ!x1Ɛ1c(~:?C9^iY=}c4-p0ׁګ>0Loe ۺvA0 4 ^9, cSSoG{x .ۺ CFha8XwWz^\GY~ 뎹 {} ׸\wl_w3u{{s6nYsلXܸrA9HO>Lh7g2pi8R+. +ܡ% 5ܶiO>K)+z*GH0t/d SNdl*W D'|,4U̲)}Z.N{m?;.82y\6fhYB߀)/GJx5{t#֋2XLoWqQ`2jyܩ3<8dA?[u7ʁȅWK}ޱeSR nֿR`W1Y|e-_f?`GF)[GIcLh%`FakDuP/^ ғvRCTIUp(V,LLixc:y t`9g0,I9 C|z~(6ZciBϺ~Q(d(0h CIcbj8 s@R]YL]e2@% >ˀ7Y3Obw;JXqzŠxaIg&GHY$fTch36;^ൖ{U;;ooÇ< :hª[jD2΂c h Z >*Ӊ*ñ Â֓d:Lx٣YWY'"b|ӝޣRSkuznMGKrrq{œz{p1q Smm|dmd7Q!@bt!%y乃INuJk8`.ͱՃ=Na>/ɽOG8Ҍ5]M>/{ԎT$v '?iE,ywN"&ҡD^RQқ2βա$ ,3ZoZysyQdЍ,OU!D^hSKIyoD܈=TV3V1?8ͷ;@4t(% b%ŝd1y8@d֖֕BE^ݴ?鯍A̵8%(?Ai1dsksvy/{uW/{ҩs;uv!O4>b1Tt=ǂԹ4S{8.B{\;#H8Evуe_XO4^m ywя/[oe 30aʲ1R`Zhk\}7 sI{.LdKek. hcZ[ p/zsYI]niۤrċn7łqznHchN((5&>y%oD(QKA;}/dq?{^WєvO):~ϼuKNHER7U(kֹҿ{|Ld|&Z/%˾TBE<$wN~P~׿wNa`0ʟ49;=Kg8BAXۆYQ¶#B&BmCE!.i:u?2]ߪ;u{>MR;x觟0)|cwjfYN~ KJ XvS4Yyѵrt.`$ne >2@y (ÂF%YG|CGYX#QB+.)/8>>08wUvjmNQW/Q,8JPq0:7lav"/h}R]?$Ͼ?H+[ AW҈vbtJȻu'>b,:I` de3(e3:==XkI]*P+L;nQv ?!^V7xmpYҞewoÑEq,~#zW~%Qps`-mYQC&ҨYd"@A/ ԗ9!zݮ>}~`(,,!u?< Uis0q@P(XՖl`'ڵ%rxR #Th}=( 4^[7xw&\X]7nGUN8I} -H- e"Js^ / O{?+OA'uc: 05`4Ǥ(PHD4)#LN[&cJ2<y@IJ,Ek1P-Yv 6qa8#00u~ŠnW,Wd" y0!|L/}55 Pktv7jzn ns6̔FλO}fmJF!<1YZ3I.3!?{T=Q6nBM7 fJI`<~t2V9 LHyۥ6q1t eD Z M0AҞjЃʏb6IS{|4;ֺL0Jyd5Q'R9Y .;$K|nce+^xn/}WoMI/ JG@̝NKp]nD,Æ)2I1 ;1`QC4xVOذAS~FҌ"LB BMQ"nR1ZZ7 @=r![Lѣ95x^˶znaIi,'[N|fW~Fde+^N aUh?4ʜ Y^WuPF BuۢbGMlq^ŚKw/'Iű~)54#/KTbwzgjd08p|bBWU^+%_|o0܇VZ9KZG\i9̺mum Vm4 sKAFbzfݭ3"8&owߕњN8Tϴ䯌B  XJ0N 5 xmZ2'sϐӫs"?x- aʓ\.nxĶf. 1{OOY#lhg3]{IWu@'9N" 蘢6_;o/u·#?P#+9$4fBt]F\k. 6)ˣžԊ|/ۓo V}_Uo G%/ JVD_{]aۋq ;Rx ?ik?V_XklE2WUϟg* xͥs@_|ˏ?t#`{q/8%pF8NXŃ@yC.V72~S54Cwjo1?ni&ÓOV,o4$r,a]FU],dOj]=D(fH͗7.83{~g00ٴC S~m81vU>ΐS9Q 8b@`vMCYկoVaFCqx62 e^嶍d-PϹne788?m$KazAo.2SE=oiw-&͆{e@&sܞQ@eηKw#D%U LM˃e΂DϒZ7*%UVf9[7鞞8 8_cmfV)\AfG~3p T.f޸.b(Wg\TQ54a8ER.Z!0 P6OxfogQs񘴅'%M#ɲ˖iK$yeu@pW={à\f#2`a :^+Lլ)h !nL !±:M}` s|Й/F\bpW1^O!Xk;O &ρ}g dx覨N87 zyX_A;ey)wD*+E#jZ mFz>p3b9+&r LYl$h^Hf^D{o.o C$pϺX懧1~7^lt!8cQI]U!cv&WSi?}3ȫV97aW2O> D"S&!N+ȋŒyp0/B>=cGxEUұy.-󳗣΅Ζb>acn5Z@*W3%eԍA4[rH&%RY y:E6۷9e=w#I) а"`ẔWP^D .m*)d8AY@@DnXۮ _rjw `15:1Pb K4P0%Stw4#; # Pgh׆~o>˒!ц;9V`WHeMHW!j݂XLg 0 0@ şO}ч-~|uP^8\7/}](n*ӏ[?֟Le~'u&^/QXLkS]Rėm.m63'ҞA ,pdj03$Q c;<ΫN'AFsqڭ[mdpZwtxJF% ܍?"d[! 8}<쟝N'G^?;MaAG:N,vVemyܞt-8# -f4frMvy#(c;3,EsL&d>1AO%׮%Y)/5UjK=4_H P0ɸfQ"gGOUf^7d7bXY6cE!Xpir=xg8GD4ؒl'ߤG@M꺅!`㴐N8ZfA#dʰ s3 "wt܋S^{]̈́u@+<&?$hXۭ&UaP>ېjLd][e ?'t:-"ȕۺ|Wz4m_#tlל:>|} ahY>uxD`U` G}G覍=єn{|z>;)`5~cIHyCńMȅnB{vm08AMc]oa_ c%s#}k3BNV`݂$(Kb@(0g7TL7\ΊXg؋4q _?5v+$5n`j?;3'~ QMH6Lיmخyk 7ܖR: 7Ҡ1H5a%P[IGSF}tg Qjt<ܐTZ8veB^V];ev4q|04d!$:`oߍ?#?2œ5o}u"ReN7PPGІ̝!Bf쾙4ֆ|~&;5"JB-qA|2>yM OaZ njX">!`:TR@ KIAbmcm3!6 .fX]Thr€u}>W5@ Y}"q: Yl2s)~.UbrNϭDŊuINe] ۓ(f6Ӏ̮ѮX}C,q0B+Yb\PrfcQbx㋥A`ٶeT?v` NÔu)PtQB]f@DoT*ydbL<)*W  Cu:I|>tAR0d&Kx1/ p>ijpf,NK;l>C(rpg7E#Vi] 0ƨ)4^G{!Z) w~:CfMQ L&n+rA`؟@³4Oҳ|Q+09Gۗ>1W:[`8WfȎC&ypJ>9`{WijEϑf xW"a\CZPoxQy~Nl< t##o<b?;d?> kXJ Z MC辆vP卦_ )hU RRh^"ŭ,|1'' ?ҡ.#i]hL>O Jvp[Crxvlz>V4 03 K&"WhUztt6t2翙>3BfpK8BR/O:rxqHAПۇ)ͩfޫs=VV_Y) ӯ\'C洼 Dd5d9NJN~[<˿Shk8q3O69`vZ1HNP0'ٮV!5?wq撨eg8pyp!S f!C5&>[1 Y2GC`A9煲X)1ib)!6`qN PL)s^'{]v,usϳ/~$yRŃ/oy~mWuGv_!CBUVQ>`ভ0gj.ݻIw ­`gHcj&N?O̔# cC@Y#^! )o$vNj(>JA+D@%w@LڐO l[w%˫r (Dx0l-\9~wAxx~6گ F{o7a ;((`ii z fjNtY2W EWM3mYXta:iО>f;RkZ<0Gz:x?10ph"&,5 ~1P)j  h k0ڏ#X}t6D%JX!{0ڍ3Uý3 iCdr{s`SSh+joU9@I`M@@<7h`p.iLXL=5dbEqv: ~9Ãf.ZXa$PlV)&?puUKMCݞ ~"si)=D o2Ao_('ч23 wN ԁ ǟTGi7nIGG b@ NpIק4J[kq_*#(A $φ؂8=ht;ꞗ! +q|sM>N%j`uJ_+WjY ]ƥ ǀ~n= m)xO:N4|3+ɏ 2Aƙp| \lɪ= XI؇Ac{`Hےa Y+ZgXIra*|>}oX7SCrh0Xm' }7:tqf6uTf5/BG">B k+Vx rF0;өjB"0;4r343pSP͠r+ò=VxP҆q!q6 \0 O* H ZX_$>xŝ2ʁOG >ͳOV n7}KB>'^J>čht1IlK^&KTAڹ} SCjQZ7Vڰݣ6)H* M߿.폊 >F82VfP 80|H2A8,3LOiIA1#Nuv|/\G ga!KѯjT h,Y! Ν ۧP D²ޭ٤iDPo @،An!g㭐BaU ;cpO[ྦYS&N~}thoKt.Ɩyxyaj7ND^ln3޿NX f"L>[Ԓ,SEiCvx|Ii0GDA>ɗ&9)dqηF5Kbrr]:).-vS;d @7 ^L)yk% f/w>@"ZMA:N#ʐ9^ G+bAkycaqpڐ AN9j~`sH(W`hSһ$L`CSd*|<7d<'~Is>J4+bfH|9L js^%) 3ǼR6WwHqz̜Z6ʋYa̵un? q66ߏS9e0݃N\Hm6>;;qJBQ+,!yaI׮PG-e `g╖ӇQƱtOc.8.#)h/jI$;}> s',ZW( J:tXm){ 4 ó'HE7n37BC ()mœ)S`rBp̤J"I`́X<9w)N;Osb%k,o.M:K}ʙ/8PFIjJMa0ֈ4 }mf^/ !AG9d5",Aq(v4".`Re"̢ 4D,aBr!*DQ(Ġ'4%/YXTxLG+z 2&Sv2g|>\_P8ƩlyqSԢ -/=iZe6=XJӴƩ1}̼5P*bL*oLU%W{>b[}.w t]YͬD wقL*9''N&o$i481'  nVsE`B:iA2j: b|>< UF60@)L \hEʍ ¢<Ȟ[H1fypDgD-枋=`rYXT*qǦ_Fe2Z6i؄s3 ##*C֟/+\UB ;SUVv d6N1󣉐е(aK ɳv܊M4Xl$B5L#D.0gN,SF%03Y^;-&,!&_d;Hه>? [x7r$+=ً$PZGg< f !& |$ ڰ1 bL7YJIPPkHFQ[d6+qOW_pyߙ3[Ad*wJj+{IT=; 8vߜ,-8c~?Ky]0y0<YWfKzKfо:H/~0؋YntlqptVtQd(|'_(ل!=+ h,5,ab.KiQ|h,`,y%|gôAKH]87`Uj*  d3 DFiX}#q=ͮ--A*+Ըa k5u&K *AJqq* jG}YoaW`vL#ӌ76g YgRN ѐtrG=km>R!EJqR*i!fREݩ npI%S: P+mn 3Xb%l }@.U=X%y- )WVKyfRc5-!&ͳVEdb0xb?d LAbk}HjY$DRMiy~+[7z)3jÊ^1:kbkyԫae DH\ 'Xm: Ft+IRu^AY.(bC@K7 XI[dO`cxLuP>xu!U>oh|yCǥL5T^a)Ĕ+21O꾒@3oO5gc__Yq+s3\MIc [\Ω孩YF=Tq zB9v 8<"hxWD}A*Xۨ/饌Ĩ$VpF-L1>pLٽL3MLˇV`蟥YE1ANV^VmK0Ux|FI&^,0E 6"#~m慕U/+ "?'+^9\@x^dyA/VPH%ڪiEpcg)#૯o˿r]j_k7ᮥI6Ҩ!Аæ1{-?wE[X!=`",^&׋t)g[R +>z+Կ.,qxjifdpR´j&~,5BUWRمNwr\Ww"aMn h`e@D8EWv7N@]1?.G4+!^dtv6+\O61SO>z>.F 9" 0-=x/>Gwy`\N;ZϼnRlVRab+*quԌ uJny|ѭZsmO̦yt-KnouB/QQx3R,q`U(@I(MH(H&-. /Xp9]zBҬ1W4cóv'h/S, DOk>7γ''EUud"˵f}&.%&=B/WKt\chjVXUU7SJ~ Eϭ0_[TOl/*>kknVwbȽSE_1Jζnv~Odiȵđ)6'6w()ّJHI•uz..&?=9iD쿭VL3,]EY!+v~QsK-ryU}73+}̖nyvU(ʬo$\3mna2F^gQ#I5/>)X9ư$Q^'l]3ٳvL-FU6dnBj:MGk&q7eYn:b+H؅YB}v;_Q~/G>B )[EătJXx't|fкAF;7RrMh7UU_]r@5}ȣ` '1jV'RzFY?@zmn{/;,Vr~ddՋ~rO8B6hÃ4 n`WESCn"j0ڰno1O*,=e_l~hCt`1 )~H -Ni4[|Q_%JH \|r9L푹|3Wj͌,>˪%Ѷ5>mϻ[?DFj܈'r٠ bb,K?Im5w v~d11ԉf47"2F2lmOd r aSf:R:l*.,)h1Ra`'XpI$3bb\ܽDAh߮dU9q0/YW ;Ό@ vikڊ£3>t0VY4.q~&JPS lʿhEv})2C.)STV9Y WUr>ߪ֭ΡNSNW$PFޮx-o_xK\Sy_s mt3{$^s/6x6 hEd݈z%O2œΖ{C90eUљ ;kLvkCr?5HjN[PN3ryB^[m0b>~fWE]vVLR LG|%dvìf6 b;<4Ҭ5ٖlДaydVj6RpCn;w4̷͚hŒL$2x|z{3j!0GCXRwr=Q P.pUܞ(0ܵ^pk#[x v_J>ereaVȥ+T}t !t9 D|p,` x}cT$|nf7}1p#G~E.*Ft䬜J3?䡴Lθqhl+, "(u0{XM}n<>T{>Jl7r-Fuoa7L-PSBK.Q^V \i^Bhݽmxv^j08A8.NSCe&Zdq+ُ; v^{062;{J>"@zJdU&Wt+YPVZU $HoYo|r!i"|4 \'gЎGVپ%˜vdF -B/f΢ɼ[i^o_{1>%^h0g7yDAȌ $d28mHySu(oSSg}͔&`$㮮.\ yA\|!eg]̍ +l.+ߕ[N7K/ Ycf(k"A$ bvnc"e)GaSCٸ m=y򏧧g2~sؠQ}c$X {EVŴH;y]3;S2 ;#ou\c{?`$s Q-EΰU}Rx\G l*璛9~hC&"ND`vFLX5)ΕA( 4l@Ú6P ГX9\\Vg LLY)n*1qmgDM Vߋn0ÕI%)*L@#u$"~5:(5 5˄&2`^!W@Zr>?>~`xv=i "^IEkzmA^7XjB8*U) '(6lO$ޥ H0Ũp:~68 d[Lih总5Mf҉.N6Q,yyc}>˒,?o.\ϳfA)k~Ԕ+Atb]rd4|<rl4>lu"}9 ]m|BOؠrS *D[4<G_ DuаSsW9aW7@n 5d6XA;Vy3g'g,' G#آ:͐q)E"a|ɫb p)^BD8B)KDD_mR$>t=yE?oz<;/- OSe@:s>{oԂ f|V QxW "[pDn:|A`鈙x{&_'/nӍIX+-DK \>t[P|٬Hp 85pJ0paR 1#֕LaʞDMx,f<ѽ'UløGp :B$q#4 mFa)/"j$6P|p$-$.;]zm8mLxɯJ DU@?Uy0*R>=y$y $Zq>li6?{q=+:z!n KZĄ ߕ+zi묟dtAͻEUZ,̂l>t_NIz"UKZ^w}+"lg̾XQEQQE{`ũm8i&Xk7,;'M~a8BjQ(4 NRsoh ;wkrmpBUG/(OʋBbu#l"IUiվ޼]n%4|77(ß C<}p_h%QD Td+ރ5M̳w=Vӵ2ЉBr1BrC\h9NưW}: { my`{D>wJ\ߟ/n5eD+=ʧJ2O2絪/8՘Xk!F|vc0dG;YB@L@ y^Ó?{p=AHXDw4s0Ӈ,%$S@TmXc0^]4S]_%DxyDtgh^rpxSUf$Oɳv`q ovhbI@hd .|ǣ᳧!nOyX*l.4.؞fat]NQr T^+>e_ݩq]wڊ,+0)E>ݼ8U%5T[z{yB]k e)嚗ڮ?C[ \I=*̚sP FyLPP$~؛Rķ.,(Yy{|γA Jzd83$lE?=폟})<>.-atp=rQ8Y,g*Hkoe˙8u15:H^ִB2,uK },dqzC*=mj GL*w8<7|*(oyhvB?ǣN8A`P^D"m\YbrBXb /3x"FwMUE'qָVZ mb7; PzᲿU54>|+GU*t"+ePm'`?L=Iha1qMPqQHͩ4|ByLnF'3A0Lc";<>ɓt3hSJzT-(NQkkh{І$KA@TM1VFM3 4q,M=C#L.LT9B()+ &sNUNxgfԐ^0`6up~I-ۃHIJ ̖O ,C{Mdr4?%E`H 'bT-MnáPqmĵD_ͷ0Hׇ tYm+!`٬Ŭ-]ݣ}\hqhXs=HvX>VoQw`C%&sb *Jܬ VzJVd xNOO`ѷ CTڔESʊkԈ0:h\/C@[36^f .KYq Rb]#n#>#Bd% ٘E79[^߸ܐJ3JF^>U\jL葤gJw47NZ?Ka4a݉LH ؗSw/@qK,A0 O}x?p$HJLm[T BCS KEZ}XQ#/Wum<=eZYQEzC`єWy@-\0% '^ S'c+=kŒ0rPU{ vlo&ny#)O:5tmxUDBϻkx!Y+ 15vh)c.@A Kt"HKXhNy'VowLoߌVΑn쌅-B ^398fIe~a0K7B:S'Hehpf\O"-v "aSBr;%NFX/{Z:uκ.qMeبHT,3=t%Pdpa'r4JON"AOD ۾JEܒ:׆^(W< 6=x0y dQHGBcY՝R2u"yX˚/8oh{٩ "ӽhpJcC FaK 1T!rXdR>[Wh4KrWCѓ`~Fm5%w@L_?4I~Q6B,qЎݎI7xe P,pR=w4-xuCbHFhF RapQ . P #;o~w8W"3%!F\;``erN@l e}>y e/FlG"„u>!ghA}{OX=vI2askym B˺Ƶ zjusE8-A}@ԆtcL*X@ǘ sStEkNZ`ɧ`ɀśw0[_ vS/}p2mg % Y#@N,`6X P7u s&$Cl4YELng|$'q>G'ӽNEw$ B]G:.0Ԙ4f]%SL8&!0omIFKd:O"*'a97E^E I [``)x~ ,3EHd%]@ټmIGqS'Y]nhSt s/WNmqNYu'XY!I5@SEhP`=@TY-u4/^y}S  *À>k!c=z0ӺNqxй5am.Q&l[ R3],ϰUOOpelܨzm7U詽}so8 ?:/F$*i1TqH02R +;<ҿ0b(R0T!g1C!7D "yÃaU2 n>nbr >U^:5$ꠒdI.r$³r[ip#ʰ  \x Nˢ|ƿuk\g༕CyhLGCԆZ"0of m|]"M(:F=ֿώ~+8߆8/Ƕ[V?e皩9J^ A: ^OIv=+F!Q*,Z]<`-jP(z_#5mP{_+meΔbMB 65^wv;ٟP6"ID!%̠bE2֋-:22[s(ujF1:frcӒ6af=&Jr ^:B&(g|&N{bZ8}g8ByԆA݅hqNϲ'G˿Y39e5xVkea'R+^E5pYA,BC.KrE qlG%|v Q[e8ϵp d3\A߾[qËS"֢qp >Y|v Oh)8+Flr,k=.R$wYX$lmb 1 [8}FS7#u.`ޙUT6l2{FSXYHnvy;흜O׳ Y={VC9 S$bR*nLQ1yc%V"r9}?:Nph_`l|gi36c_P';+VEä))Ǧ!9|ȕ ۽׌(In \p*ϘUr7])K><)SǧAJmfKEs:ʫu.;D%#ȘkzA~)}E^`K!1f(`<<Όknq./b m`!|*.dv ;FkVC|4m lT!P`ejc1ΞMOO BVPH4P]_vE-u#f 81x(vw!(Ϝ1E\J Ny3wP2nLSJ][MON2t$̒PD8VmCۥ/3/@zؾ.cl4sǷe^ U@Ϟ'C]t;]Ԇ`})S))VAJ#lYtA/QlRPq)9aVNz-9\6Ƭi`%Iڏol`2lh ,,Bj (՘V>NqGKB5^&2b{ y8aiiONY8AE/B,@Z|8J>7uulndv(\z\ |y$D\#YF^nD mz-nb=#4]p}:"*jmbMEz2Y:Y58jJr nGhU፠nnKufX1AYfm0 MaDTyvHG KX@߆oTrgMI^T#tS`%dΆlOufdܱz3J|AzIw JjFɴ֡ "Z^mY, q+m6zePފ Ku7֖˶]% '!,cOt1 9g6{ `ֵumWR05F,q$2.W|ei+;CY%2"~jUuFF>Yޗ Q b'.@ !uZ7@~{޿qIs0@g /Rkܐ=.ULD$Iq7T-5 8n,tL~ѳݷa]4AjKT$L0t^ooƮO_ći Y*)J_^tJ1,Ge#IU@yќ''{8JxJ.D=˖'sy<ȫDN\f& ST˨'!?A:,i9rrkue\lMX4L(T^&Ǯ /4aI<<d)w(Q$,.Nb}^)l NA;c+#-}Fxzo4 BZ! y !hņ,3.nXaR%Ot`C05L'UB82B.}AQ&lL/G;^y nXxjб|>Gn\/Vi[AUIzbhX=?As"o4&d.>)IA%wFD )ӈ)Ǻ أI_̍tofx?ۼ!Tt3[< dxVJ-a&aVd{a󎲌#%a9kw5` Ӟ,UQe@jn}[ҹ՟'ŤoG?aQ!s[2ln X޽9_S[_x5K|&!Ш"voݸv"|,cVrl,IFa=|ķm*skA"Kn]Ό1[,Fly˷]x;? A@WǣǏmvs3RΪ 4[Dt4%-ӠnSlNe+_]R>dwA|mm8fCTz@agTNj^>'AѝΤJJ'в1#Vm/ceis3ū}.CB;PV_MdHd>.K*4+A@`8VWžլӊ]4N8ʝ ˄%)3$#ϻ Xs]BvMQ!hHX?8FcFGwf,0#׭C+` Q܅ϵ Q媟hU?E4*򼜅I!CMa[G{ӡO|GBSWc"/_W'h<}\gQ#rYͳh ݽr-mӉڟsaiҾQG$wk̔s[eGB6-'Ţ u`ށvs{^h` 08i)Ft0 d&St:yHR0`E%A.,yqH0G=qhfEj4: vAhB/|O 1T79>6_h;Y6)eSVPZDj_Xqh^`Cw2SuA8cf0>qCvڷɣ_IqT$EU {j>&ҔLR!`CmH6Ax5BvU]zsMΊdJ7dV wUɜ"G ݏ: 5ꏚ$W-:D-; 8~e)FٮwAD!qcZt/jP_ | ^ Ǥ"~Gn9<;5Yʽ*+1\>1=29%7qdñjmH3]OΘH}EUڒ-8cbt<~!6 Z͜=ӫ!_: Sޥ@ \hvG4Έ]NѸMi"P.$yl$;?g ⏸ZeYB..l ea@80tmGٌ 8&n{qjLbHޡX#s&5qؚޝTdӧwnYk&ZBK%R`jSf\dkb/bW*O9Zwgp| 8NA^>2i:x?M?1,?sjNd,ɼzeϏ ixK|6 j@s# tC{*Wz/VDLŶ2P/FXИ~z>,%p)G<5@2h%)k!A/X71^tM 2N\Ӗid^Bwxvpynp_GĈ@ѭ]mOG<9 x}Zk>Yez .U s eEyE <6 O-H̉ ˚X]*Mu> M>.fVOe#cxN3le;&9#C+C"EB~;SG;%&]O3E1Yi]kUW˷wf0G.":C&4y6}/{wp{0EA&'X}>)טDmh/zU\>]r.7JTBE?O\6U B,GV 8yUa54s\[X6B[/.<7FS5z~x"/LD;'Ԑ[i_E n~-'bqv3FdByGaHsu풌 5,pZhglS #sSLR"* !`A"4bx[>6zv{5(@%7[wn/;(fU"*jY@ 2VAΦ)i1'Y6ggdjojaO sjv(5;hת[~Õ X֬r VUP_h M&CC&$g,f|,8Zj>J!)/jk\n`21Pm38 @sv'|kj9H8p'&2Λ rB6@E{iiE3F\*lRP"pܹ7Y-zl۽ c1qٰS 3x ! 8eh|n,KKG7i&C`w7-r ̔@i28UM${:%D@ᢢgxqSgv\_҅ێnB"G(s>JTfճxZ1d9U +4Ug&1t2Qn7LBSPXY epx'q1Jay 9w5q7V 9e\I_hDDx,sK$ASs/8>"%J[\,.; :*"U`ZۖY. tiC\gDd 4? ;mf1LV*h]` ;4ϒH)s mpʩ\ dJ%uh1/v*arq'NVSަEЫ< He@ Ta~~_(ܘĸmJR5sJJ0!Aσb q# fYѕ-0DIRVwFM6/NpZh@wɝ=w&Rm=,xO2 *"d7'"l&I#J~\kCjr0.əQ՗kOM)og(> a],%R!ձWK9${N88k92< o%|"*`gUy5s=TZثZ^/kxwQЛtoC{¢ A>\rP{,lÂ[JAhԓ1afjJ.}c+)"b@rM~Ӥ}zy$qqR?%=^sL[VB`>9q.oqx&Y '7)(?t|DhR,l$x8Cn>*)`7#@0O7o$,4tc{nexTcy G64Uv݌͟[ebZ kOpQc^]iЋոE]pS~7= %@ɷ{ ~sgIu۲tc:#:%dƝ8@|:Mr4ga`" R>?r[ý\iK+Iq!g|S _n78w.2=1=\>(J^%_:H\ UF 5rWn.V8QEK Ldr6; ?&.1"+ LhtMXrGWkV,,&_ص+D&'/ ,^P2={txp,H. rHTS[3K+b5{{M=}Qf(R :Rl_C #f^ڪѩ(+xC:[LWR7x_ow Aq  ri 89.KO2GcFɣN|0l[N?bp]2 w)м$i1-XKSF.r28EjfZGƢ7AX%Ae.|q=@9zvkQq!ȗO|{/ǟUww(}X`b2Ih*nyϑPHGg'`,W, SW^-S=k[/<:[b/Mg@墤Xoa?n${: l4-R$*yAmK /Dĕ7,%lv7nf&ᳯ}l^TF/E8ZBE*CqoΔ0~wq &{>MwiLoHAɯ0;o|h<j ;tUkl}NNT9BXYn ѓ"ƹa-sQkgh6myD޿qqXEg e`4Qg~׿yͼ[ƚd %)+d߄&ʃ`e7y6L3aӽ7l~n:7Dn(IxjZrЪX1 1|S@2 A26΍r+:‡ fibw{c1EH|U.DRr-s}1[ur SK|`j>kS^ۜQ36Ά(cGQ-`Qv V/5`wwDSB\'w-kYEa2-&$!KU^J0u2n$KC #۳LAEhiD-^֬$9lAɰfB\^./R@Oo=ynJG/ k}`,G*qo_wNYtg[ .MOI0M| C/qFp%*Bg!&B0?'ȚnW=j;tI_˳l=wqfuc`mm3|Y>0Lj=7%^;8oœhQia%yJ0 ,ç{G[A[O#Jkg㥦YL9bP!>gR+ipS8a#b8b w"^蜂y M@K*ßaag45g@ިLzcwmN)8U^ІiWk@QR ?熖b'!c'=tZ}oB&___]@+,m1IVE]<@5ur*RsYJi [,[W4 EWڷc{9JsNݕu!ؘ{upYA8FWf*t^+P:)y1"!Vb~o9ڻ%3P~qFjL @cw L %wjP?g/U9o*=txYX|zR,p`F 9|ҽdoJ cU0ִL%XJIiCT;?W=iP|ncY b5`ęǰOQ[t]҉իNP/ iEp> FZ3N2¯&mx7KiaCـП='LnyxDY+Q6NL=ӊfRZm@9G*`YZ7`= q=Ngla);c-,7ҭMT8B@# Y$ a ݑhVm=C9Ny>RlA(邅hHDv+Ve[g|yeZh"iSx^@Cj&ęx>(XR_+\u 6 3\#EԪN4OAB 4MFzV,C ^r#G_{NƱYUtZ_WgYJ$$,7.\[mjo8Et\,ڍgd#?vtz=GrO<1n7+$՗^wwmFQ-5/| 2XU +aƹ!z~"aPVD^qLg03jec8ep'wH1KLɄ*W(7X0`܅5UkdJfU3!oM88T!> { =eWDt$s0 N<Eбۆ_V{K*6LpItיɜvDeKسl4j7s L#S6޼(!3]cg +U#R'S/uس(8uA2!~ӊtEܥ°JNӖe/4&BqK  pcS%+KHiT gَd.PrhHW9eue6t"y S3= F3G(6ebgw?_0-wp\;maZf%cU~|멵ғՔ$̏|OPu"J @yp0Iܿy#7Ae;]W4VJgqOpA.mt{&Jϯ+@0HZP"J=׮{zN@X P)*~kΊF}L&SwG\՛/{V,(b i QU_U/aaG@F]GrT"豪pvͬtN1+P#֜cg?kGwޛ)hce,#' r2cQ_op.Ȯ.<ڙO^SAW\JǨ Q@m"h/_ Ɠ~taizO2MfG5}E;0@b+[5nf5&^rf)`b}{)"l w" $('9;FϟSΛ]wa$1Cqn@Y̍CƋr5܍_ ARPHJth`BlY9Rrl0Q;[~¿G+zlp ny쬡@X)P5\Ez#6RMk8KgWGؔ9L:6ly ۼx $f&A>Lq)2"HKVPpi"+k^n' !q9FV5=-x`H~`W"HІH}4bakhac{˅ApbbV.[V6W/Ja͑dftb,w/}IF*0L,zbR`x #(6J&pÜuծSBHMM___/g{M`E#)Bh)y|߰(ΌUT=|R qXEΩ YJm˲ds7<1?STN.+=As/e *u3G ep(y[VZWoi60<%g7A#{ߕYmgxv}KAc @mjYGUx%];[geT+ *1FVE lzjyu.s邬@ [a#m3oY|9%~Վo[̸|v>`[g;{FJwG=.y]ժ EjAۻo 3JXa6."(q:_خD\zN/%;-_~kway0xA288WBd$0b)s`T1W67aj ~r(DD$Ź;dr > 5$h[fYr ՠ)M>HQ,l6tTtSAq X>tKW0gEp1І ]-Zjzh_okΛ x${ZU@na&o{I)dv uFI%yIym "0(W k'o[><tc7~Xj:̒rc3;mw%]0tsU9iAD2c )D̩umbн x 9f1EG:F ULQ-f#{ &rdn'(0\!κ`).3/בfjN7 <&&f2*1r}VlL9/SA+[ =iK CxUT_L[J"niaVۄ`R,]ƥgκI+9eӔ̙*}B @NqجL8 8(ML̬ hfv|4-{ٕ\??_{+}%:S4FA:ϻN\Җʩ|:UKxm3A sr Ma.>xy:2EJWά`.a⑉ʄ3WN EuYq(uNQE^tzEܙzJ;[2K02Ui&%pj-yu /vvs,>__5^~E5ϐ\x͒\4 چ"CWj,W:=_pF#_nJ+)*Lu ~$XP-v.ɻ<80 u$Kx-`r+Bn{|\uioH48O 4Mve:&EPecG֑rfhH2ˋv,F< sos,.`-2C#|.jj鸤͖tayt"^ж6&ԮOJO뮃bV[S!z`8N7)#ͳ3GU;PXfs`Jf~(oe08LbSA6; BVB@FXcZ7hx#UsZ}>%/0sMָ /$uho:Pw])gz\؛si͞CʊY6kFGBW8 '&%)$|Uܴ{auk]ځg\3z1AL6 Ȝ4Ka|n rlU=AVbyNrB' VηkT-+CSL>lhE;˦g$090$]@Np򼠱 i\}aۺ4G\Mܢ s)F1J%5:^XyO\v;Pkk3'R7`:lR uYe( )_߂gi(Z>px4o~To0&pn,]p$/(WGΓKIEp/K2|՚9:BWD>%vPQ!aE(Y*`龜;3=<1h&.bi&rGjWxՊFlD-k`Xn5ELXDŽ83P_U}T[q'XPr~y*j[n`Y(=YK  *Y6eA ; J8۫bm0G=xUKNOWC|66,}RG̓ĥ;aܚv$bܛ+&^Sdys;b*IMщ"T ˡ &eXtU=bX-AHUUQBHP&8#Ć0/R'r mNQ%_jr{詥! Bhre~G#q#9%,M0@2<n%ʞ2vߘmhQйf`2^ & lD>+CW[o{pA@3pxq)XL #_0sMG3qf45Loa yLswJzVD'u1:ETͶ(%wA`"UbF/ pP9[`W %V j0 C\\_sb16WHVGV;U|}""*wq kMYC8 QS9P#MhY2o*Z6Yn,li'~ٍ. EXmPgH}Bёa>@)BtV;qQ9FL,o-s|HY5 - 8NEvlOײz{`' aRfe`$msP橨.ì< rcM`ÿrō _$ Eq#HiKDUP+SyWBǯ3W.>KqIƝYp%vف8JRe%KrRb[|9>? ,+." [I֐ԥMt$M6ZNurfn byF3$tt0,4,ӑU‘})CaĽ{8R7$&}#`.ؗ'~0}O|Ni$̂/3tBPB[ʳkW\ֹqKah80 D 6JaQݘG_@$կ ϩkeZ 胾>Aehzi,C b?JOX?i2xgS,\'wE4ˌq:,ۺyqEAzm&B$hݨ9> k;hdX XXչ894 DCo< C`=ృ%3e ݾ+=@h67(d '?lh}N35vXOՆ[]Ѩ‘6XQ(-N\2( A e8c[!A3t،2 XP3bc<A7231_J)iES>_L'b_`R79LYz@Lـu ;,@Gf$1y@b!*}6m+o)]_0xb'SDj] %%rLB5X PV?7G7?Zv,'05%bPʮ~Vx>Ĺ`|\- 7r~ʵxBMXֱ"!\3h2-]M/Qo٤/`탤Xe#|>ap#>`w$l?F!*=Fh$CSLolmUOJR!u%0P Ǒ%YrGPq9rieBmV'[)5YIy@ovgg>~q[q TLE HD.C `3Vh % \l$=wcK*>/WM2F!߹+i^mq9w:3.!H,)iPBĊrXd#qȹ8$#eĸ.{,*%.|v$XMǠ-MSfP4DQ8vq EF@jnV -\N.ـ@f:MnoK ֖0jj|Ϲ=r~EҴhR͵dJLc  lLEN`j~I e),:b;Ra#rDFhYۏBۙ{/{; =)7 L,.udaG I-{ Ybw鹲]De: 9i@Nc?Sf;ՍL,O59^5I:/Z4_49/ЁN JhCG h"1tDAi V,S|RBͬ`*N+'zR D`m:ǎwdq`N%h l NSP$qӳ$xzI|V4Ӆ7tceEY &Py[ݦ }S&D/ + Y|[ J4j5߾)CgQ _; fKfeMCSJAW'%.Ue88pDGxNOEW}߽vgwIUHq3h(3nPbeoylAȗUEzͅuWN,>VA@ [o:Ȯp\@^fc,4ܥoLڣLԎ#4*7"#XZC]DݥV&u'WN4[V֛`-[ x%"Ȫ: O Tk;L&gvR7fw5 Fwsn ԤN:~yf<6cR%WMb/vM`k/L\DR t]7bJ=< ݏ q;T>i `#X0 #s1P%I̱]v84e֍efR8%JFKґzܵÕqF$%$#%|8ZAns)h&jm٦vtx/ǀ'ݻma3&aBlڡ]ȡ5c>WշgGw?e+~1 u \tBEKYh ?cqx Qdh.XƎ/}^ ܲԊ/Ț60s퉒v`G Xg鳼'Vhf:/^PjK̋i!h@[:шc,͞A~AjPEl>3Ȃ̖ !#!cN!H 0b`oy^gg:(S^pdВrFKe5rȺ.k:9Mپ/Aw>gn:` -jA,9ًg+k ®S45kcn5 Pi3|DJLMS7!6|XTm&!iC,"ܐ_KQԂ}!rKG84a0!!]Y  o\Bm@O-KPiL:Q3IuyI i79YN'zqHI4,3'Ȅ&Y2]mB .NLbuhmm R d+tȓLh@C- A|%zUWY3BAf1 !h0DS[kؘ3~E$cgYy7'`X0d +qJr}~ٶ&0pѺ8 >wؙktH#&{14-&(}4^D)I5E"[U>+M+AWBN%>_t![ oOjs,r#@Kz% hNehK#+ko EaZMf٣6h*UH5| w*<̚.~w+?ePOFҺ{xny. 7! Grf|0׃LDpyHm= 4\BDB6dXv ղm#T`#?F`0Y(Fk~d% YC$@t\: BTU_yu"lrWCT|o}DF(C8l2Wq9>,y^m #UDw>B@3B 5)1̳y@*N0htSp[7;qT+_\ݙ9L>9vC=hI?a4ƭHoAOϒlk/jf G|'&߂Fv\:+!+Y{:k K]iӹ+&٤u'B%B躔ylK<#+pi#/+;F$6a1vo9f+#x})(Dpҡg)#ru{d񰾼Y\?٥~5cqPls#]y |9)DpF=?~s?6č8=>lu:+, ՗R~N "';r)tO$b\b1+녔dV`g>"YFD ⶺpyAT^Ge"c?>,6Rg"sE0E5GDiV}KNw-cmAD:Qy/jOace1 ̄B(nӔ۳K܁kT>P yЏ~?d-B&FY-UC38t ,cWTf%|?LIC$ GeiCĊ|^bq ];:zypƭ78%ΓO Οj5UPU}<nfGLd9e/h; X;e#PkRkuzbfHP[j1juTBuY)Wǚi996o^$#ik \S4Gqs`=9;m1k[Fij8 r7?޻mYMXqqw|<ѫńeeZ^ƤFʠz Vs)φnha&֙ƴRNX֎LVq$nԔp( 05"X"n$ <}Gj F?7(DB@I[[SakWN'B" jwY6@$<ռɞ<.-;7̩KKAz,K+|[)*Oo8FxrMC:6h- SUպ ْb,97ݻaCk8˳Wons@^@% a^YfJu)d8bF+zibѐR! ^3;]K5e ~(ry[LֈO?{6C8l Fx׃ukNȵ@iIϯrWp‡;GmD#fw;JqN,u4bFC[zEλbT ã\f$` Oi<Ԭ7DR (ϔWǾ?QG/CՓ{{wjsB`4dˊ(q(' fZ)/xM8lsGE#YOOT:}݊^6T D5Ҥ̂c%3ݹWD✅{:$%ǎ I|.%ƭg_xTћx t'uyqv1U. ;c"uէgH޼^ǁmlEi=bhL#{ 1\MK+&6k:3"0Mkٟǟw+սOo>|;:5,8ų t{ f<'(Ipq. J*N^;L,USͬ%r< (&۽'L+ p۲lPlVםYnݪ/5md MM -]P)qQ`5+YOѴv&pݟ iFM 9r V:ttܟI14@ l(u%k!XUڣԞ ߷2 V >,߷l>:KfqZ0SIZ[N5&NHCtl{dlKCE؈ek:E0ajF,,o a;'ԝk$4F~LO2Eɼ!de~bT6Umѽ)_z/r#;o8˧+@ehh#⃀`'+Ü=4jJRe/F$%ZE&6UNX徸 ^zZ/42f &N xPԎN;D4zFzDZ,ⳀckIDqCv M=SQߚO@aoc %Rgͩ\~Teӕ@?Z&B\L׹ R@2kQ]><`|'##8b-t4~ ԥKW>8K͈`L`*Lm$H0Wq+z6&P4liEZV=,NixVdma|V< plyp3C `MSJbiM,G> R1srWhv o֕uE8 }` iFF0Td iV"<T!4_.qZy3ڵF5}EwF6٫`>2J;>OR vjҗflnE[JK^бT3 dl8lFD8+>8akYUd:]lN-bmK(\I}t#a*1ʼc3>ѾS2,\!&"xbpAu( Pg62W>XČ5a$o!Xj;h3cs-xq|]%b2FoMdɮVKWw `3"!.eShZEvvp8B!BQR#lp@ ̛ͼ>̬UYUo;5ryﹿ;{P^i*xA/_#D'd\ٝy>^`}%(A998ԔÍ{\wzji4YWu E-'H |҅Pav}VN`X^ ^ Bۖu [PXtH%.- e_9NO}Dȍ] ԋmw6V+RW3cn!3Pp%4O/̹[LeqC=µYt@!}Eh[ |xqjң(I:* -њ6 G]$\۫]!s Q/2ٜq/vk@ʂ\n,btj=@TZcexT՞rH׻ j֙Qٳ7%=Y|D"t>dp4dq L2ʉ!reA ]†"{L{-u3*jG䩲,A6;¬ d;iu}Ifðbtvq^ Iυg JZ wT0Ѕ>uq0J5V]{G'@EmgιB30oP#j;oGd> ~@IHk{" ;,S!852_ϗQ(ܹAٮln74"93]8b*h6A[>X 0cjfD\P}BaN^mŃ۶>Աo{շ(6&ƀ/B2["t Ho"}<T}0ʻF, ٶLyȢE,T.+-oň .2G#rg/WF|rmʹHsnzxG^)mtT+/LcY p] klј{kETluN0KsiĕYDo6'8Ҷ5rԝi/ vQ}$Otr&n<%߮XuUMziGy R+#4Pi|aqׄ `qrI 2 |ŎK_m-t ξ=@B."HӋǪC`ruz:%h1պzm"ڸ.Gw&Tm^]\"pUc K&@g^Y~d2 ՙ" k|ܪ:J2xjXqzQ?6ϛiזjC ^G%˭(i 6Tve[*V2Ff2H%1PGſG9Z : );]:w$>*OT0J# mn>#9z_v"y9udJ _`̒bvj]# b=zӌ:A[tmFȢH0aH0s[ϴqIn1s`pU=鮖w p"s"ЎqV[ \Hh6a,_$C*显u &B >8|9`J28lXAf8vņQWwl dBnNtV?Xwļ/ry5SX$H]m |oVĝ'|pxsN64X|Ug"+[\*Z$6\~CZ'Yl@8Z1 ?};xKۋ،>`1ȦVWuo<{aώ+\0]IZ\h r(45'ͳ M kb*s*cJƌ]&5g$YAU6 v:^x2cq%TEBEV[]D\̳E:aEI$Gv-YZ#D^Zi٠59طΗ:«j8M̸o~s5.Yuvܹ][9 @0ΑQ|~vqI1K{,fs+ *Yu?qdOn݋0bxZϤZ[ & ! t#AWH_5d|t2 O -lcJ-u$]`@Eᗕؑ#>*QMi/ .T:*Y5?>S)/NviPO4Cm8B|4lY"K;aE )gmDwƜAw:H"))Uu]H*@|a^##}`M$?"&ReS-D}vbxج]O32D"a3[EZY©J`q*C*\@L0)f&ߡz_9Y/oٸс-41 q D< #n9ÄG'l6IO'Fws6._{fMQBq첈؆hwPqw~qĄ9l:|1DĎ8of .2-[B a[lkpie;7rve#л,zḰF>.—Qi"C6!ˀ!x]K4"5ЫXZV`@GFHsR;T?ҳiX qvt=unۺA wc4zI,d1l:!fme|ĹM mEEz; !Hû } , f"N#gLA\/ Wj8h9`%Zy7q, 〵,8Х)z_IXT+@y9N1x:B\a 7@@ǁ#q.R3yba, G@S8Z ^ȢnDZ\Ӳ]xbJf]VUxa]"^n?2Ԫw RRd)0H J!t6HvOWTs]{ȆxgYL>ݳjjϓY76={{lp~eq>]urV>\dkvX5 Y 0a6L֫ȩ[%H9FAD〤18ḁ"_`fqER@ d-jPxz~~q> %^ڔ_4q.!йJ]-8M%("pmjHړ~{4]֠g l>۬HZg)h 9ხ0A!K3Pm)Q)2qRB' + suw}-ۼ*2  %zKx h4)D"HJAFx W1ϺõiP\Gz&:}TGZ`@fPCxe&05p\qS/4Oiږ܌ jYweBv+4EZ`̀.(6X/J@FҥyM~w`%VS;)1p1}Ol84<]7x̸b((!l"ph-CLIla\:UD=<çGa'ѱ:_6Rvh`3I&wPރЙ870 +es8\!E(02'ctW)qv\Xޣ9מ)|8|P 6lS\{ߚJCx Wҵ߼BfkYoNJab3Sf*<7:yRz2󎘠7#X6.i1O-YźݯW~$xG$K`d- e)@=& ,2&!a}0 [t`GA_jVTBi(\f4k׷x MNggzt9DE2t)! Rtvک0H -ӫ*~¦ <\>HݔAڥG\ \Y g!2V$df$S1-y [ri@H"!|k%p˪ %t!sUg6slgAWyc )޸O0bY Jښݱ{7.,B+,L>49h%@aYx ?ei93M 3QQ7$<lUˉ!k-1oHM*ϖWN~P?ٸ\?+,t1[Nw3R>J(`+K*  0,)\Lv9N0񑠏,P2ÿ8EӏW$ZS:Nwt Xh ;/ZD1GZlz=6H޵i(!3)aZe/T-ރ?#^6XL-uSm<Mvw1;NIjZ|@̊ (@W~=wP Q 5dvh6(n_Ed"M0 2SꊠG=6dyZ,9~lX^(&aE2 qM˹1<6rCV1]c$w,Mz uёذTm$H _dǖ5?9j@ST\&Z>d5y~>.‚w]H-g/maCq${hG@i̅_tvtvn9 C Cd1_xzu,NLyE`/_=P$Ntj1鈽~VPxTlKc:PXr\\mό`ٷX/SB`\l9=JXITraQNC VR QORs=hԾx%&5=4hlǼ@#.Yɋ ٧p y ,œy91%tH( / _,@= ||FLw,V0 `\&Ivڬ&:@&S;VW﯁}@ ᐈiSӤ Ѹ}O'TV cfɂ"WQ08zЋ$~u M9q`ܣe52[bI]Zkev-409ցm.lW}R5X y|/6O1msQ \ˌx"p2:< N"-oE3Tɺ$R׸Dͮ%ARmTpVjƏeU i( 螫•OѝU#F# qjÆT='L1徇Aۏ^fJfu]WLtt+6GIAOޟ|oFXۇ%а>DAcǮc #*:9a2GïIvSX_2ReVU!,Umd`%#DVW(/|I|A&=8uW g=836%0ѷJk1J()XNhh\EbNpcAq7k7tA^e\HPqԘ; C0Y !&rxDƊ26< -fUYHIU+!pFva6$ 81.\Fט}\Xo&鰂n^,.7c>Nh@`hG>]裏%] 'ŴH&M#` x >-n D2db&8Jpl}G[U@x(WH. + CoM$Pm(҄TC`ܴhZTL?*<᳅ Lw3[ó]w-TV}9GcqF&mq&l?a'y&η}`Q-sU#AOP.*JXྌ(f6DZ=%歜(GȠ˾me>¶s!bkoo`|5&<QG泋|΂b4>AO&_W>q)R3[J<%GG1X0Y댴m%JWeC X9 }KEi꽮%Br@YL8ӗi @|誇K!sa^=-jL-M?b.yNM@ R;էJ%A̮K`; < S+rVyYABS2SXF.9dldfL!w A4OQun\C\: r>+r3~"1;]֙i{`9 qNjVu }IXs%T_ M~ ̋q377 ׹N~ IGUha)rKY*n`5.& 8xLL+gkus%Y / 6t|#2? \dP!X #M K(p"J[9RgkSM|Kn \w6g.k8nQ-Sö*%8LCJo~v4CVޞ@c%́L:"\7B\Ψ:H"uTzGO ~ʏ{ ˾fe]KcdzlͷEƚr ݠݺnڣޣ,Ş JjRRvpG9lG$;(=W^!eV 27+tk?rY]̷K)IXɢ!RF妛\0mx|T>Xk7.Dxa6\$#8KdXPg(rJy/2[Xh]"w"jPrMfˊf$~<FRb"G$#(43Іڹ3Bۡ&;4ڬ* c$2Roxjxj;[ar%`G89}E~:1:$z] yYޫn^Dv#eP ׊3?8;xj{0( Fvor~c"cB9,6B rF oKP]J؀bPZ)0pFh{(!CH nqh &}=9sMXùbmz IUF-ɭ"H7=]gO0 C5^3x:L&G&SUX:;8 9*SQ+0>h1 FHwɎ.$4݈}ڦ)ِpS0H }jBcj#f.EŞڪᚧ ^.#~CXdOQF} E?ӷb"f KpDj%iI;Et v=鼺b%#2rjϚ kC.|T¾=S::g7׽}sXΓ:Q *)p2;WEDwz_ ۞Y砘|MY~r$1"9Nf9h`C"C YdUM/]+4DZg Зo?`+ P!kme#VJUPI h"9>^<~2}1V1'8,"^mlC.ًC(bf̞eUFU).}2+onqQ;296SQޝшʃ#] /(&l,AcHgq\!nk 'nh={vV evŻK.M:m]ӖU<j>{\;q) V =egwGoM'aw|SǺwmc7du(T"7u MFWq{EWalV~z JLQ*0brfg X4a(oH\mgB%pHɚ8vZ,xT=; }t9gcۄ}ux/Ӹ;AgDvg°!{Ƌ~ɻ4V# O3^['}{OY0>y$?͑ y6ū0LP`rޙ{&w{z>|v>-$(i1#ڝkW'Ozw9#Ld/₶T&r6 hN*C&:{r>}|w:$a](3Xzi7 DƐ}T;7ߐwYy_^ <^EMQZX z:gqbR^j LܢbW.vNI돀g%7l}T~g2{xӇ(3KIqau_%.DB95DvhY%Ed2Zm֍d厞hюW\?]{@a% QNH$>rKL0g9 ӷot& 9|1$ǁ1Q‚Q \&!٫qD%zi"O@h :S|1}:9*68ugEj\̧f.5:e/ `l@j'Ц0\ub$ mVۀ<7g+20GNyWArPn9O(d^'LN[7REМ]ۉx&pF <<QSmx0L͆_b\9B !ZT?~.棒|d|:~4g,Bu$ m4ve WH̻wԦ(ʝG#!j?tDP,._W4j ?veڂe˯~yn[<3e?Ɠ w| )@Z)\Z,/]'xHʼnբʉ[eZZ7Wp̲J.]86ieQLYbv_Խoz;?ƊܘG]YVnN@4Y~kRgl%Iq?ٱa= J:$CF5+UE.u2WF.?\6!t ]Ci"vfkƾbFJV5G sWLqij1^nNlE2֎-'9 dT;N:cK~q.sG$H ^ j <* h٦Dn?[S>c'Nw؍2t B|00=|Oֆ涴pO[OX>[OwQ 7IP8 _pG)W˚U,[ s;;ݥpR7ds|X݅ꔶ ꄱ.N,ځdXfY<6Yp0a[\΁dcR^~Fzؖ~ume E[o:&5N?utp>x(Y BA( @5rt*2 /c{r_L9yoTg@^AE"E F 8GܣY!68UHVkJ\jMnh|^rM6iί@ ;h5GRju`IwE"R>ϓz A.՜n#<+ndBOE{qb}W{?&D@"?W_ >q anx3_{"Yb 97&u9)zcH7mh7,6;L`x.uc#Re^8ʹ+XEu2wF9\5n4y ܭrʵ%U߀Akj@kq-׼/ͻQ2/B~\pqNdT&Σ-𤳉jY (K8Wvߜio.Ew?˽j w؆0?kY;~[YX|wwf}Ҭ{qQyY (̞ϴK4ϓAvht(P~Ո ZZ6+.P_kJ=f=Q+X蛸L$q8|_dLa"H Pu ci$V+!i?H77@ (X7 5 ` RHGJ['P[čg++:{̖j pmZpI ֌%Nh\[@0 31|ٹI(`~ǚ-c Sj@V=%Tl*-fguSjhZ2zöh,*=IM%|v=@Ta=9{GbN`M-er-f+.@BGE!^IY1ed*VĖQKi*Z;x.A`ѤIB7t6=Ua'\Mpm6?h̒}4(Cb\ʒhF|7oٴj¸[Hm>ݐ6TfĨj P~DcS 5 ˭ Ks깓 -7 v&afYM(|^.Yޑ5Ne_oNpQGd ߵhZD%d^Na:t|EM$H]BT܀^7 Ջd X|WZ ^72a/E\my\8dJ6IKbO iQ| Iv?8z {S,`pΎȆ|hՙteÏlEŽ>\mZӖnI#+n \3+>n&K8l\z@;Cϑr7&d d5K1N6 Y/)GɹxoT~FPI3/,0֜ҁՁ泒ݏy[~ͅ] D8%&ykj(qh?'kƃTOGjV0² tI=_vi %|? ^v,I2G.VOv8+U ' O6DaјrP7,›P#aܱ߲yUaaqhUDramdv س>bu{k~IEơSX/+ELxdX,&r*0.q ܉퐷Ү{ut-HX'Ũ+w,j i(ŶvK\bl8FSݺu>lmI @=f~ stEcP8Rix"h QmI(-CGU,qC)Wq"7t ;g.YOl]D"kjps9ჹL`Q!8])_ 9VȮ7.yA)P 3#(z-9{NeM_ ٱzw. Yݲ88Sq*Zt#Mց >}l ό &K?,7vpJ4G&(VTX]J^JV!+U"T/pMV/qy;T"AqJB=%"q±$+zN ׳2]81(]hL^@-TTwkE&dE6xB"`/<|u4@ɖ#'9=}p J"@3ܡ3tܒT\8ñk̈́e A^p  !PLg@Hȑৠމj8`Ȩ).O({E >(}+E܃伲Z 8^ȗHxP#<#0+wDۣe!rz v(,q($3*iU-8fY6y C7HmڃHś`<;iUgv4BC p1[<<ŕYkhlW6h:#=/U -mG>,%+nZEtOjMA]P\#rv>.c\Q).$"R$ADOg%\L|F6<ѡOqfÈ-1/Ga/IT%rh܂8cRL1ۜQ ϑΗd7u\cV{~QBpqx#39f$ʼsxr7e\Sɱl]C@$PmU Ggtd^\-L^^ ^c%BZ,_?^MA<{jj-Bm$MYP@ފ! u|#";e;?0%=}I[=4oӋSϓK &Ai v$U/ۆtfnvP ,B:M)f^4GM2Ykl. ^ĘL(re8‚q<Ҟw71vĮޠ[MSw Ohh4Bo֒@Хǽv(7`{8yRlGT)E`DkSy$3g|woA*bJkk eϰâo׼HC{̕ ;Yq1xg8MI=uSǾwh[ѻ)44^g[A/cZ3ޤ7FmXo |)MG-_pO8YݐL1=fA(0 @ _AB` 쀔ʢ"fCMM K"1XoӈuJ(Q\fj¢} "RYWA1&:]4-L.j*+#WwW^%}=fWu"%Ž.=x#L~0ZGv=w긯zR /6|N=afn&TޑCc*z|a(`.ᖲ~ntDjˈ+.G-*.Ll!B\y9K~?P_͡yǫZ]D *43.q[NkG*8˾k>OFY,GiRÖ1\;6ɺ>d7G`?u% N$\O<A[M@$ŢȞhᶲ4CBfmB)c>߿+̅L^>V ˕KH0b޽杕k3n0(amOԝh¢xgTOĉ-TH[rY8ϋJw&`і!E^JCqtL5R8[jD2 d< AL_ *T @YS1ktpW[*/XjюH3H8S,tW%;,A\F28ZJH\8&E@%>T<~e-ozR$F'^vu>5NPEykqrhelg{æ؋ԚjB b\#6/~2^\N~g? F|PC;\#r X 1B` BmR~ :YOϑp{X} /=jM/>>B;/G6KS.ȵV>/.T r,Gh|P ,쨡a tTT<is>ʹ`pZ$eO5Wao|%Q3 B\t@w3qu{|k$o#FȀoΎ~NôUbiAN"M4~"~EPE/$庩#Jr^xSihd:eg6! r:T%R720k6PuƂU{4K$1\ժ_q/<|12y52)@ҨWPx} =MXS@#+)Bs9Iz\ooVs$խ~qx混_]*&ɲ`E*U]^3e;dNLw@$,^)0A;cc3K[u:mrpݣ9SXKw'.Yc}~ uqJ\\у˔\9\QaQ,0y&(`'+6 ryZX $N;oE{SJNyņ9!OAHr٢qQ[vI >/^9s|JoÌ] .6lL *G(œ٣laSl̠\[q Ci\i z6:Q3Q;SF"[3p>2+/@,]B )JrTBf"E4&͂X[3R˨aRP>H=P= XnB_K^g[d`lFM-Tp+G*M-fEtRFpuE:=}2 L?̊'Qpg*p}-Fov.H VQy?}w嘻;-q9Zgu:;P9؃V[.oEr:(0@F Ⱦ^8.@p>l2&C;10 %y5l`Q1y@љhU&W3`iBEGUH=#2( 3gڕub!A^߅cRLF!PÓ 6rtO޶|^<l6pG8}pGK2Hߝgt(/ &R*y`" l0$F * 9֯ɘg(ߐf_[ȵȗ utsp{Xd̟tq/BN9Ȉ.sbS2ɂPmР}L:Z!Wj00DM"{?zĢV8_JfBX_cA*T D@Z:'OcӓPT A Y@5@2eW p _3N ^V{$Ys3chV[M1y:P7^:RwC*GS<88pQɉC%wye__/$)c1=@Z*1hkpq6cAZkxD:.?RY>]`X+u%4Α(nmq'[t# GDCF0UNIR Qw̌ &_(:Exs .܄Q=~/ |.\IՂ"y࠭"L/ǣ) :}wBm"]IM.nȭo( @|A\[?jQšFCph%l*k\̑z ɼtmuw/;QLΫ!X,z#S @ LǢ~S)I({eoRf9ۃYj> k%JT }-.>C.V]b=TPjR,`,0P@â9 M_N+NBA,#PV-Y[LD{< u/CԀyg(ȐT5BޥnL(Х@ X Ꞵ J;L>laygп+PN|}@"%OъĔ+eh'qksE~z`Dkc9=P-]XK!VZp ,/wً"8^RCERԩ2A@8Xt<}<jx+M(1Ҫ9O*!xGNq.oDB7KǶw"dҊ> V-DNӉYWgShl1!"fsAKe^d%+ɮnIT^S!_;!/W"YzkK M-ZWMmLx6GFCͭL٣G+]A5/#kB-]z.L/WOC0:sVj0e0͓e1de~~}4|L}϶6)\+6 WZY|beoÙ_;&"ㆩQ kRTPQ VT|w?;kS4ޚ1:$Oa(*E]I[\)HF0ǹ'6?0þy(`R YyZ|g 0hX2IU}T*ʴZEF9I#*`;3>{][imYm*A'<_<*k\ h stcd7#2E  mѸK+Sz仹ّ:xwQE2U]dUslo[]#4VWhvkUϨ?0zD# Sz_b)wpꭻh܇ŋI ʲdX5\5:K J ˽oY!H3V5T?]s>\;\MBEFWZ=l)F$F,w0SAJPEvjd]i"yLP6`|9N&CKFt-AQ_ 2 Ht9x\5`TB*N ĴU[29W該weAqC)Ml0&yeyt$P. ,5yEQ{0K-D}6GU ZT3QA&Un -^BdU`kSVzvMgV+ &"_Bmϱ%B_qH]'AtG""D1 jwV Y;Ê}D^v_@de.ksd'0 Ns%~ #X<=[3T\MFa$#xW[SMўv V)ofۺ;6(Ň4]$~֊K A ;cmS{;P>(p],^/Ce51xNWTOscj`pWKF7J/RVx+( T,8}ow!KY6pL,pk-@9`*oot|Npə⡒\b/Ax4 > O"mp=:*BW^}b%=oF2ekϳtup F" +5EGGz$?˵h#i,0[XwW =wwC]}p_n} YVQ<6 0&R3UV\Xft/5_ɿ{[XGOwk#ص8f%%_hN3D/XSM2XAuzAĊUPԟ GT2T_X\J:tJ/ukfHeAʵR.BU-e.m3.Wxt)_/̓D+![Rl)uB`: UE(`o|c:$j:cB|l GWjj=)իey0S7uzU:E홐6*Wɗ>50AJjw{uw=u=yE^5/R`w~'_ϴI}>wkgG8 a[Z1v啑[+t\rɑԽS PE"|ʜ6e~ewtwBT|͸ھI׺k:&u=pgܻs,C뽗؝S56٥~He<9 g`vKOܛҖCb|aGknW@nߕw_e/3P/|/CWЎ3B}B\BfKg@PyI*9y>_*M6-z~kѼ@|7"uؼ֏CMC&Z"dN |bLn NtIS& AYmrwQycL }FPU &_){ü:mOpCI.1_nLB86/)mPи[_?I@V2W\`j7F16%i]4IF!Zĺȁ|*ɓE4bLgoE~TѼ߲g4!?[}sk=:X &wݐ5rIqO`A}EawAm `I!0۞FvݕDeD:~_k4|V 䍒>O`(~SDEhyz~ޫ:ږ\j +i^ApcuhiXmk30T8'IKc3p e5D/x3.m"(rP##l&уﰚC(U|xD 4f݆R TXR&#`tnh$o2Wak%jk;O^ t76&JVuڦ% 9ZQx>}T u"U#AwX"ADKwր]`)uQ,5,GG??o0Xԣhߕlu_u:2#dmz|[?un soU|x&"K}`G+!D35A|6dFHA5}{2_{~Ǒ3,A=#7Vmqxļ C"٥^f_y_ Y2YV7FkI4Mo4Ԋj1Ywv$ºyyQ;J" Hc;SK; aT^!I$2T5҉AnIUW :„k mSSMQ^o﹔6zF.S`KĦtץ ʕtWۥoC?7Պ skD>Pjpo6G%7V"G`|. @"Ј6>/EìF1tq_NuZU72Yk=3$Gh$xSƜ}~t6;nv^WH+FFC6+ + o;5(GJ |e9*7|n"{$DV}{+Dn*D25|5_`$ b3>.&֑ Qa:1T[NBoG(!9R`5pdHY.~?|x?:*ZՉsQJBgmzҷHdl;|׾8d#$[lgljl9XXCl΋?`_hw7_?{/{+ŭ3mmf`Eo2'>FA.JlA"#dE<cvG{ 1Rm&-?7Kܒ]ioۧq.K?ѿ_, -+XxdW69i>#W5>ZˑZIom,4\75>"ju&J̎Bo"{G*9zArf<7rd6+,?i*PܶikO? WoM7$c"e'6m_H`$GO5 l6Y FY6B/2LJVi0c'kDmys7(|Y-Ahŀ5l)F_ 0 ٷ}@lu/[:5%户@$G9H ޏ{~e=Rtݶ}9p>E9:2}B4j%GYAseA]{5IkApRmN|N_ ?~0ly~B=ɣEf[neN"⠩bGMNeNq" u mmHØTZӴRm@K $l7Jw~R䋰tU4WW'#5W-譿Ƨm.tS}D׿+o}hkj+Lտ%!fiR4$H3J0M:\|#B߲#r$j0gObG((B=]ڭmځG努A?k~+[(8F !,q} R;(5mۍGҶs"ljr`Z۸é<ό$JVjQ•w٣OAyxmy5lHi!-hSF NѰ+j;ctyGF7_X &6HYͨ %@]ڵAY jMHl#QBrb[ѠI yf`ܭt.9 "omۻ.D|pE^> WKE}A` BH0לAǤvkIvBk}AK^ucFr Δd=@ 6C"dg(x߼ލsx%|jA6qd@j1zن^t!º󘟾1> $K[p%&_M8e;}z[\I>R96z_TV -;_=k&eRpv^𭞫%˥_xҺlvl؜,2:D_epzp&k _` 1 D2/P' .Dvr͒mu);E j+Ѐ5HW(7?!<ʃJN̥5\?hen5jhwrq!BfjV+fJXt-!9QB6`!K3_@k8͘4A( 0Kdzo{@.q.":Ng Di~ꥭnNh;uņjw;S +m(dTa&v:{q[~?b<(ݍ#ci+2ʾƓh%,h_sp9;݀U2v) 4xpEc:]"ꖺLlj&9VD to ހ(Ѻ@C.ZsNB ĊQ{) v>u͇Qo/ Xi@ i(A k.f - TehD|\V|1HkSPஊLXOm)mE|s^ -mXo!Ɗ=L$;h:Hd$gH{0OgiiVqGRλ <*R`6`qnmBZsÉ9Ac,{ĕ Km"S_v#Q[Q^V2Р-+:)q%(a4/T?!D)S+< -4 9fչ 3ݶOKgJ.4}:,hF)9w#C:^6@:aHgqućjQ2P\ xqȖ7,1D —& OQp:&+TӘn]pTepmϸu? rʱs'XSዦ`$2[ڬ =lP;Ǧ~%"$(JHF4֜:މ >Xi Yָ#l5W;ہ~nsj+`O?A"t<\IpRZcs-[h]yIlS [q]J&uVC#܎ icݮ`vӍM5IZm`@cJbи#o낃y. Pl" u Oak78x|UTt2ϲ.^\yo'kԐFSC2OU lڼF']UاCljצݤȓ)1N|j(+tm{-:ե,EN+XF`ǺuvM"D?W{!.l nZ&e-dmNM -b[sŜ(V}u;PϮ^!eůea#cے  ) Vn!&PϠ'8$2j ;-,*Q'6T Qyy. -. (,4 #/4 +<9c  !2&^ի4,I  766 8.+IZ Lh   :&?*hߖ9h=A1 ;! 1 ¥/Wګ8)8: 3 ;:"+X& J,4$ SV5 N™OC  H3 !B8R $ʹ (  UL % #%[\#$Ε`upvq|IENDB`libimagequant-2.18.0/tests/frame-7-a.png000066400000000000000000002557541436525270400200020ustar00rootroot00000000000000PNG  IHDRllg[IDATxim[vf5;={eߪABBl(\ cƎ W;-W*0ఉEEDIP%!(HRJIټ]͜F3Zsܳ92̓n֚k17!1x5^WCWx5^kWFx5^kWFx5^kWFx5^kWFx5^kWFx5^ko;#^WC+[ֈZƋ}ܫm?īqxμZ@sƋX'J+mD.9«qj\<!k<)묫+%ڈl MZj|{ x^rZ,-śa|h̒QoFl>:kbv[ =.u'UWox~ɈWe tk!}C92ݎ.$_LG?ra˪DZ`tR6s[ UqPpE4ΎTK'nvʗ^p*]`«.tq79nn͍$hz\|x .Y z??Cl2=n%ۚPr[\-(䉞cn8qnnaQ^!trIlG+lhe<œOM#6d֦&_y"}y\%AOE7Tay`dTtk+E5\^"$CJGF[wv~SJ5WuA(Jᗥ럨 kl \Qw,QdNfõ1  Ik8`?/:>L2e)&NYQUpEi7~[8%< 5YGn;崼.U VxS Rʜ `bc-L"`7v(fI77 k=R760OX&͇/ {dQ=FÁм7h44??'fXLzm`JFT )>/%"jYH(:#"#ֹxG)f+?-PM_3E,)\s!zfG҃-ƹWsLsx5?cK48EYRJTu}^O~&\ ,&?mw~jr:w:c0{{{rgv^H l^LT9exxO;)_R}ݼ4Od-Imݍa8rTBG+k9+'э_USNGQ!m&{M膺 էls^<E-_ay`9&q%P ⷹ#xnW&)$2X NIJAMi3#/ynd۠А5Iȼ1!c<|Ϟ}yjnL7n~̾8h#vCWwOv?O cM%&-ybBS+pIIcmy D.Ye3dmٚozUț5@=b[fU Q +$> 21U6ոX]=n_ lz`Nd`2QGO:7T']0% 1 Ij"5`UC*1y]&TAU, 0"g_gO‹b'x5.37}!;oD7g>sww^l$I 6%$<W23d ERO#N%S ǖŋf X/ͱQ#vJϟPGtfwmdg>sw}|ڽI4 I+IpUɦ[]&aָ!0=__oxbӆٳ㣣x}gfY"sC%f ,˓.?nY{Typ7hSDZ*K]ՏE0н/8(1CٟUr-&o/E>ǿi+Zo ck,W`J:2ʈ~I}/e8 M\5/ISYFFd+~_u|WM>Z ;NA'O2FDBFlj%e(p{"~l@l {e ^Hko} |TR~o7BF6| /$D`g¸,CNhuo6 YnZe?dAֹ`Mkd; 鼶eY/3|&reث%B|[Mtv eQ+y%tJ]ݣ{ Dgh@L0m$Jq鯋 Vn $ȒK[ .ȔeYཟoO\]k/^%e^o$o>~p>;l%4f2 'z=51T_[XxHEmM]!y8B]򘶥:Mp+⥎ s|[D.x[SsK?gqet)[%V$i6%1'X2Td6! | _ʱ?_Wޚ+'__,82#V M.xGv5Ob!E&Hkl &t1'M{gѬ\.}t|B'q7ҡ\ۯDbף}Һwc)9+ Z$\G?y͝Kss.oaicx? d'?B`c#Ѽ%'r/ v^SHUWhO+xt ~ch_5VXշq,-mqcsy:&756P} 3?x4C4.[qml} 7m_D`JfAd2_E $zn{T]|[al33V+ wx<9p*,((,Ċ\߸i\qzFlbMCT}ޛgWΌL)U%R'!\4b:yᵧ/yFwP6W&k(G^)$Xm57扸uCVX]58ȿ_:?_x\, ?#/^o xK$OoCG\8=o0nqf 2<`G_أGEgWDsY6q[?RY:>hD{7qPz\X.<>^WpJAk={`ifN@]h\Ou!IP. ǯo)ѭh|cEpN__,,՜_ڼm=/@~8z`v|"P[hVl5ǍC'%JUBG^uFoq/P!y'ض?0B~Y,ۍ;½Q/ċπcՑDgǭ!C{/AKN)Mܱ ьxW]qe~C/a H[ޝ (}:Ǐp[ :6ڮ{^u>c] C-r#tˊV5Ƕz<㑱03SnIԿ>EM RM,Ϧrڮ.4*q܂?뇾V&DVCQ qJ<Nj7k2r*i@N_u6KY}Er%qhZ=lԾD} \璟|sz67aBWF/H\Ysk3.jFƛSOΟ;C>찎h/eoVȺ|D]R}~X%nHJDW8'Vv2Q(dE#6b:>NFN;^< "[qE춛ϠE|Cr~o<п}oz;M\,N`p5 r-`?b!5VN_ү Iz weձdndn}9/m-YN6mK @2JV!@X ;{떔zxZu7{Ї MYYB@4M98i2"KUF92{74t_p=@%WƎXyG9nk1^ȑ B,tEoRmyyGGs pmbo2^dcWBhRYv-fɮۭ"LÛo>VY:LsBp"hD.@OWR|ANU}}S/x~d=N+[P{&M:Œp7s[%j&+ u-8] l\fZIj=idM-J=.$ǡ!7% :!t 3O,TX.lϐ zJ]6˼%6DPfyў&m_=S=>j$ }/:e '}j0 G[jdj3O~0Zھb9.U7Ҥ^6t!Y⸶Y;ϿA%hOBd}:ɓ㓏ףTIN %/m zlgDȩ!!6xVR?Io_V\!723]1cvTVO!umR;g?^A]-ŋ"Ue^8)\LN=:>OY IYIp+KY ￖ~Wu>Rو^K|RmImwb$ۯZ")Y:@N%#LYk;KpH- AهxDKND w/gLKdY22` I[)\q?ȩB2㓓OcSLiԕ3et2$ފĝ+>'qPN{qiZ +Qpkm^n#ë埿90KgOB^r;o!bDkL'kCPjM_[Jh_ u @Jq"B%p\V?s^[ė<~ͲŋWҦ~ƕsXx# '\{_2(ڗgg\W@= ʪ>>9eIŠRBkoM)!pK I1^ZLX,$`8$bL~C=) H|~M[_&飇gp6 u@Ɔa 8a׈1_ u.xiꪒGOk "R0mc4+[v5!-ٯ7^>AK+'O5P EDWaճ3LS WXԐ1?I(ͯsy:Iga^)k/GWZbRb$AK_fcGؾG'ЩK&ӳey4}ryDiIkr.U;Wcүdl}&>:z Ou.qن|]~)$,|96%1֔f1pb>U#4 yl?wH%Z&} + ;/DPg.xa-Zw_ޛ$wBi,( >!EH+Bƻ k*zn ;OH{uPR.cٕɵ.\]Gh~ۦwo{C52D 9+|q;'_;{lOѮά1ҪĥCER+KZ {egی&I ͑2A]QiaZXbaP.@r{SF5=$tSޑ<ؑnqnXl5d3.[-d3I%. Smoa;Ez boDL.uzxM&_<}sys4uC р1Ix| R^)EzKxbwx 挬V5*bҼf f F١n=~,oSDp] bwo4D2C=yqrr2n#݇KX̜{pS p2\ X\h" >pBaڶS K6ߎ})t2'ICD Lm;^koӥuvI9ܐ~ G DЊ а遛 9ɝx<~:.<-J,wY3q_|ixao,y'Ұ:KW/lZhi{dD[S_<~Hˀ4yƞy˱w-_}'K.=#(-Tl_:=U]V뿳7g))5)g B"Fhr=: KTC(UA @-1N!>͇jÑ`&u;qUM<%W2tJg&wbJAʔj,oũS1t+eC`IqĤpg6H|UwV>r@Bq Y$Q G NEa> ǎr ޿̭hwɴ$̛@Y'd[Tsɜ Y,\ڧ(hwP w!@ ๒EO!mύM7/D ZeF+i'鶮W*z>˶"iйG3_>H2ˬF-j \1;z^W X{r<jv6Zߪ1E+tMTvqʲ!zytTщz-L3IY2=bts$і1w7$ ٙwY0(Ȃp'2 B?}cw1I4NHZV|kERlٝ8>Y= [,A]7;֔W/!pc3ȏU>K~F4X}x*V "7=d %z;3%%nqIf AO FsQFzݸ^=zlMTS850iZZBzz;Tg%zRxdf"G+VMZp$~Wg?u 7:/N'G`Zd4i`0ai[,U x[ᤴOb"8+,IsFݷ˩_b4z4d2)j~Zܔ?@dXu÷U׷J4Oa_"2fȥ3zQ`E!`^z֤X#`i}{|O5yN12Zdu- kimN1ahú hE<(iDŽn$ht2Ң>\cB Z;d[ߔP\c<=~R.:˺3 &g*;wRYb@F'r8 {G欚LOyAO~*y삳eU*3\Ki5\aXs[ހ'򜯧iwK2kλ'E%Gf~*CDnx&y]^ HH4o٘p kǙ=F:%5$kd:)!O(('beS wƝ)ҹx /o\ 2 p.-ʾFZ?~?)-ji/UN"]B WPuQAˢ!mLpO~<}ɝۨ8g*8AXX9m}kuO58hY ֒ΑL l,tQBw(zw'ߜ0s;=4-CdtGM]:p7btZEo7FGau^ >.lʹϐfC0j:h0dfusM 7$4z X,+eOX࠸`G}k =*Ѯ88" .e|6v;˰joUR='u0yo4_",WEJ|n)qb jdw6_xvoxxk~w 4깭*/7>BQMĒV]4 \cq4npDǩnFlψ"\M>A/}b P[c7 -c%Rz1av8֞!\NK`zv|+Β6"WbȀ .TI`=K$D g29?+v2x"d #n Jw*ʓ7{rI9KzmFngM]qp_g \L*7GgOfg~O56%Vr,RI&{(hATf^$58%F+${C&Ad<g_ϞNp`0 7;xe6~P9'I {e;u4"ywb;ćpب$?m4`m$.'SCMIu.R썆!pr;'GNfʕLd25Wh4#.k)d+dVa)eR+gRX[}SҐ^2b Ql <D:z,uŠ  xm!f!ِj2|ŐB;Hs)1(LF4i YpV|6OS7MK*jEeFNڪn1L3tXS/ -HkzW[]»k/3Vbs}bv]|j@~>b%T OX 9Yw_9w5? B")<R}_Z1fBBJɴ3 @6^z%N@\$4iQm]K7f!TP0X%)WQvMȈimyh72'ɩA$qpr 4/JͪMgOִR!)MYZ!$:佁҃'{Z@ x1#s![ K4̶z,,;r08I^66bL"D5(Z#|:xR9;-jwir4~֝;S, r㞣:kUS mXo#JvT3em&7慚{kgy?`xASԎ̵ w_'*wDnrzUss|Uڐu`^6ؑ"aH[KvҬH>Chʹ!%"Xe?"FN? =@-s ulrtt4I?XP:d *kO"̀L6x15Ti#!p4 pjRdpI`X-oe~^0;.1D8,n1kZ 62OҼ'~FI]lbsOq[±L,ά,[7"+w! ? P߂CK<ɕH I* $n'Hɶə=!P7PmbNE#^0РE0xG/7-fQ`rĖUQVe5TVpy({Xmd8$2pJ/ 0@IbI$)yBZ[Zby]HJAvG):QB\emzѕ/p7A! |qv3H.Ab 5961Š,Qؗ<ט +u) <+Eݫ]kQ5쭰O{.ΩKCWO rz)Kq.X!'vQ.Bvs~ь(pQCL1~Q$&m|2Cd=`k$XqVzhbwPdMf),Y% %vLbMO}vKٺ{kVd iDLpŢgBYz *E3+Xzz\d?j]X<%wS Dž˔ 3¶̭NI9g z"~Xꐸ: "TszȆEEnk)m| !2kןdqI;rџɂt( ޘ6QH* p$f}fđ (Nlu,=`@.ur7H_RF8ZLDRUtT7:M2^7/q|Ix-8P gbv5lwMVy~V|S?M !ڨE-;v\dwA_[dc" {|57srgF̖+SЁۅS8߇*%Ffw!S~4:l$* RI~UaՒKt-.DU`gߺ${,1d8kF%0|S:f5A}v ֙£VrGW+tTё8?;N4 W]17[{1۾{Z9(jQ$uܮ q*+%>% (f)\I˴yKFE7-!޴л5ӾF@ABV^3b|z \ DZvLPpd(aPh!yL`SZ=M,EBә+QXǶpUGpm 6V2xKӤQKr\gPE;8iU]K7#i&QlcEAd-DP Ѷjf!\?@Z""|M)٭uQv"h$mqͧQ4pm+)ݓw4F Q+Z&>;8*I^O‹lr˕HBNӡGxfsBʧI\S̭q J̴3pghб\-gHF"M M V8ۊc *M.82.bJգl b#qE֋*l{"$ U+G֞5Tgpy֞!~&N2d!#]vMtMiџ\MCB`}xMY &5[ClANpb^i#<(jIտ]B;0lA.}.Z}r6~&,OMQLyYhT+1욵y/aXjbi+Ȱ۫Vkx"nuyAeIH-k7 qF|H͚G;Nw uN ]&SVkeGCBT=Jz>|8G^*C޴[Ir읛9|7r,[zy\K 6 eи/|u> hpt'K~\&$c\Bͧ1 i:y2~J}@+ܐߺxÎGZqꆼjoq=` vU| |]l mu} 7b8X̠W4p\LjZ!+X/ #L ᠄иA5{擛Z 5d8B &b8"`p/z f]5l:],oF̬iF2&0g^bn Aɚ+ǰՑt3qZxuD p$9Ykٛ:Ab8ܾX )s/ > FOJ+K4eMlJŽ{œ1챠1E4{<6%W'Sk1 'V;sqZdGP?rE1G4y|RH VtD)#1KI T@J(6a1mH*tOԦ'\UBښ:C@֑ Y2^K .=*GFM3:36UKask,=wٶ)&!!kiJyMpo79I-YNI4w8cj,Dvn壐& cȥh+szz[*K4_$Z;f䜄Fu GlP"P6i|*knJ z+_7񇪚 )IuOƀz}! GSנIj1QqtBDX[3ieס{Mp5Yj MTZTF<r1']c8DvN8d4JHO.dB<93Ҵ'SL5`^n}\idI5 xi('knCB s(CL VuiؕK`ErUڞꆌմOLM5Q9hHB=Ԕ ,`_`$Íݰ_9\$Q:-޵O]S*ͪ6dI<%i)ŝfiy#8lGM)v$oťǥH&neUb" Vg1gdG^j1 jM_k ,a!{Sּ>FV_@.ח(AAj!FSm61qiY;a1~v"M^/_SI #fO6ӎoxl5־{1֙ /@c2܅=#jk|7: Ay>v砶W(O ;A7I*1Uc7vJF8Ea #`'bhFLS{R|3H4 b*lIj "QtsDokw*Z>ի׼AKKÊR\ r!gDS:'E(4"܂|ǐӝLwvOT!DXP.T6 K dWAiK^w#KM2K]tT\??x ^T:!2]ɋ='u1h4 {C;Rex~`-3 , CC>IV!Az|~N1<1ԲbC@&5tv* ծ "9]kt:wޭLڧ <5N/ V ƒ@LRMWl Pw5緇}mr+#bЪoiMB UA UжyCUn^ժ|~ӧƤ~?U=php~dMΠWğ wY* Ŀp49Gxw~`EmJ]+Z%;b7D]ZoaU: . ʬ|c1R,c2fP\Toi~,eO)[ejFnzVglm}Dbkd TC v!UvaHz S4'KҜ^<ñil" Ċ$֞Rw 퉴_mY>|cyz4Dbt+K3Dsp{=0%4v(v®"2q*3CC|zY-۷vqX3(] C.P/aUjޯ#HUΖIhAPp)~4{ZJmN!e%M:=0uBϖ)Tdw;zpw VWj d}, 'zlT7c"+θX\ s["^#wGL } jӈ^7_CrMgӓYMP^* ,t%jɱf㌤\f]dfu_g6]&rд.HE 8tWQ{w"s--2" ˲||//` \ X&bށzGÊ_֞Y%Q6 2"RT[^N6zodΧUA+2u 20Դx:=~oز~KV/X͑!gZqGvvȂwMX6*j_IK-lRE^@)R.} SĔEKR<*kSU% FAjjXZ8 !FpaRȄ"qulRR5O2ϥ{MYDc)86sʭ%ZzҐ7.Vw]>;p#HpO''"Rn7fL#Od l~zrI]Clr fds˲:}wv 2jQsĔAUkHLW6+9 !{!̡hInnϼ) \?# >*TEf`I (2ڶk38,kįg0"BP [ FO%L,SE8kՂFI&h~/!+JjͿ9>9L'0.s YMM#/ Dؕ;===s|@ ĎOAY=>?zv7GJ}_k3Rǡ=" nL^ayou|Ð監厧#u㤨IVӲ~U1kN[ *]ibclUoVZSBY dbrZ`uT.սy \_H3L 0 iX+L~ gP19}@iVq˨krRV * /1hށbx1cooCݏ-\+kCEi5˲lRL&}w6_`wl6>|;wF)~[EqƔ`U)kw{?lC`C.AѩGɥΚ@M&,:+d ?j'ͽfľ\TNbT2\ `OdL.r,8f͇#20j M/c,ۍR;ޅ/ЂK!qweKtceLni=Mx~FΩ}M%?X@K0({p^Ley;u4wh4ڿ],gO1OCv1[հ]%;zo I)Io:͔5ٖPyNq Id% ɭl+qaPXߍR+_*s-/c|&.4?ƐT@ . 3c.Rkə3nt:}lo#v-sGHҥQCerkJi}HDf08M_&o`t',aL¬rcz`VWTb x G'绽1 ,~(]7䤆 4f`zd|~~2Q<>)vtpqgMЕ%3*S&3OvmTIeu?4,MiH-sv⼄t5݋LEPQ"lv1 [t6bݢԻ@9Z9( aMYާ $5z*ɩK>njG<;@ز/MWølG`oI=(;{(k[&3s R}hz m #MYF|:ARfw?Y'C(Hc(h+B1\.ޫt؍::} UȆA6 Wj}UqV3k͜i4oV"Wk*J%yظg_G8M$puXk)U,4\iתU1{8 "I5VHqɈs>"r4d歊^kȥa"nE'u7"fa7Q4{=L-tYptUs`LVZUY4uxۃzMrOrJRgJ ;L^[US- :kyaP3 S1O>Js~{ۯ. tb1pNW:}zzl߾u4$%rd"(6)nihh7QVp&X6@ԺV΄m}sdT [AvZi5Inf` 4ڝ" 9@NJ_H c4nv\eu %蟺d'e0;SM^1ϒ@V{I0i%A,@'ƛߤ_٥پ` y5WnzMF%m][N-t# qeqO`O˜+Փ'6.^W{x>> u#hScc@EP˟"|S2Iap3g=+P VV}NZAn)p*^#Ke3}Qr;M$ g|xcUN]=c/)5ը+$S3&lPEeEAĴ@,W)%SCIn (C]\m:@:ѷ\,.&vZ{T}CKeS~AR3uEV.sީtQ^f+٢;;* \ e P)&5w'zۇ:D }^7 I؜tJ_pT&UrP gc&V[F}kEOi"蕸.sVǪkSv:r sQ 3ˇӯEbwU p+[PÞ`=20<Co!jRѫHa@=j/Pj`Á}B-ZplA/1-ʅrۃS"PVݔy;13L|`l)åd}FOnͱڦKYNN6MtO[5Ъ[ ثɆ\V|R}*g2h9ʸNt.J{| `T~_CK\$IAxDqI+Z-$WpMu !B2|j' RnMˏCΚt oAEpj ''Ǔlo?Me0'|o5#{O +U )$HeJmG 9֊Pg2jiZz\X *<8Cu.QTeXS^`YJCN|ڹ_ROTrx=/ۇKNx!HsC@n t n2gTp)w`{;v8G2$W5||] ) 4~ɸvh #r뮵YxTJ3b K4dBbYv+DL'o }ĘB(XbxjYsV9U:% ɘwFn\BӨf| ik{T Ö88jʨp7y%&SdREm,!HjpR91bmР\q4%MQFȁoZBbmֿˀ-ϡ"S;r5|4+ *+6JPr.`۠X%J{v#`ôbuOv| i|8)ȲQ\ף8QVml,k:`dV mX!j7<س,iQ -ɸu 6xD#%_Fp{l =32ZR\unP7h@0W T 1cb>8IȳI~)i񒊇-ycȸ5[EêM&e3^0C Su5>v_.3_s\2 "EZRZX e.r::t$`RtЩGe/1aRjEpF6h̤"++a6!=7*CchղDEpY7z)VݖR\:M["D߉R2XX?.I>"?p!vE$\mn!꤄2U^@4Dy#IJs3%!-_P"mh5!^ :k7t㺞WdU7װ:HBkc9tMg R[y_Wa2Iҫ b/G\sR'ʼné$\gcoѓd݂G'C" )hg!_JɱŊ6DcLXqp(9T K  B u*o\k w vt Yic_>I 4THI/I%%:Kb /}E$8}B<:|a>885j "234JG` |cGgQ&~OWLSY+F(J{E0VYӶeW):eU v$.ӐXDcU!ԥ: #*[4+Xza0Ƙ@3Ky5hˈ& |;w!t݂+dTV^.q. <ؗik)<Q$r.GCyږgz$Lbo>QGݝ[t~79T>tJ.߲[%ZfXN>dIP7bh2/Š,+{aTܴ3pw#΍IN-UĊk:H 'mLN?}z+Fx>Ӫ+Ve| qeY.ٴ8ŽBEӽnfK{+zJgDBnHA1U%y~(m1 hU9nOLcUת>?{0_сHwHp6L, :,5JX^[iob!:Z8"ɶ4u[vE<֘F].>Hp2^Ri/j R95SsSbXxsG K!|$1Y#) >wq+ A.Cʨt+\`gW'LM's3u ~b7NBDMz `1vtQ$}ؾ[Jt1bJd+'] XHJgB0dJRwp{Ξ<_齮!)8Ϩs8!٧(,Plz>͍Xely'gnwݻjݐ d(i86ˏmJJy!Ϲ.*r35`RsjIJ'aퟟ*a q._mPۆ Ɍq6t.!'8,?=Tp9XH(qQ-Fn2HRq*I(l%UBSM] 1Kq Ig qv&he<Ht,xkŠϳl,Q(+Q(\zŲj,C˜v,Uu2Ɏ1sgYBܠsJl(ǓbञBewpVc7zprr2vn#m؂'bU_Lp}dfŋʶ7 Dy떇E%&KTA(a;ʇ7LdnPH¨F.aPeZ='$2L I7&Ӄ.#6FZ *NK> ^jCJrQR #{ N=\i]I۷o{LCD3{U)i4>a8o3tS=ْ ,]R c/Z+U̙UVjnfNv~?rnT;Ve|EP`svI,Y)Pi%{dq %K4ǔk0M5|";!|^NN'bC` % XȚkb>JY84"٣ӓSݿ $b^Yl% j)ҬvRDޜ:\`8^| ݬy6`wyیSda':Z569%[SBlD'Ot1J*o;i%$'b =pY.o'k[|rh aoB_r\ֻnF\4FwAtp?A梗좤ˤӧrF# q-"`B J.P m#rPc .i(]O}3H0T'La!jKTfF= HLtvC$W8_r[JF<:~ިiO:۽e"Ea& xyzH'fS|dmHs.z/RZ̐U`׊wgUyx k:F͑pr詸)W^n\T.6'+OujmC»q{Ėc2O\'$zju-Neekw`;lsE9!@ıD9 :Q ԲbӍ'TZzӓ˓ABЄ9|zaWJ@";H_ŝK / YP}27UIH~ivngR a2كlZJ'9T|( Oރmo8WIjSR,yDz0=̪e_r=ݵmе&ĸs[G\qz d5)RշU99?$kFQ+Ծ-SD,pcgՆg.mb<+-FٴMEK'l'q{-]W&૓A hA`ek]nƥ-@+`,(|{3ʽtv!AF0 W=%v4^E-8#;{;,+F;;uvBlW"aƮa'J /Ijg$`nޮ^,mנ5OܯR̋3"X,!WCs> VbzHIS9;({?T!fV%=w; b]/KΖ11"+tщ84/sr HX+`$Kdf`9d0~*RӽN,vgi 7)d\[yyR]˗ub72*UFa1AE~(5y8g_ޜgũlEКׄ}bE;K"/w iTHD#Dy-tvSȆp]Db6P7r LL*®|^o4[فTM+BEmJFR]#.7SnnUQ) bݳ|wg̚+䖔Ď.Ha5&S;iiWf^4(ә`H$ʓl< q )2Amx06Pze]-V7c ,M\n]-]X@޻ 7&'g瓹Na6F@-JZ9RtA*2Tb rNrD(|3]P46aka/Y"; .3dCyAe-~E#\+|Im~뮠>oop#9#|`K>7~}|n䛡28öEohD9x(faP5e:o ΅CVS&Vx?﹒iSKImRnTemjYotS{J#$,EYK.r#<H=9#|(!`) *r g8m~ f9Szx|&K`?MA5p`7+B7V,F2 Wq#JF&-);5+,Epa66܌W!>(QAm*Z,$Xz5*O!dyq2&Qfu%O_W'&EP! _nحYεrTNVLY[sC3߹3+95=%2_7!~uO`>־^6YeKoWMg(L*t G\ɵX9 O_n}4J&C"S@ sL"k+lˆh[nd]wQo>lHx0,Dܽ[ ^|vM'G[ңUϩ=s1T*22%"6',?5, LXi PRNbn1e  mzxr~L3)7UηBlj.5c5F/H>/nnץ߫6 v2}1N'!0{Wjl%^2 M/{U~_~ ߳X?9'IaLb,IER6d {ClJRJ4!"U5&!Ic M&k;Tߨ#-B'zYֺFQIR\aMNlΫ~)?O5XjмpKPL5ޜTc rUÕK|/{%H,+'[!"bڴ J:# %U$QnMJ=Hyyv5>Ҙref:R#-*j|c$cݵ'B'E*Yucx`%u1[K:1KF;b wAm$咉ڽZc"{:8xg\7(8 2/MrN-:MarOrp:3(` jMSE0 bhUҐݢ\0%墨G^DM0;:ӉxM^r/w?)*lкn)(՛*$c\%VG?z&S* 2Sّ޹-/T(mB3Q:nΈpֵS54"᫶:uULߛMw>*wn#XCa tuVut Y/GLo])ú}2*n27rT<<dh=*!ɁB  ]C--u9Y!isM`l M)SF3"qhYVzE|S, 7Xhltk>#]Nⶋ >Yٗ}782ង1Mye$2N;vIvN9E #2e aBM&i)7T\܊s\mjd$Yo6q^` E[lLvʵŵr"2%au  vx ߻hĄ!yhpl]$c9{ X,p"4WlF mYMD_Ξ)@|F вS/I ^Pws}2@M1j[.V!ݞkSM%&Iw=WV٤X,eHJQf+<`5 pnu~(~23O^;֐߂e"۸',8Ns1l{|yJg[ӽedg֗H DqFX \})ӑr㻅П'.ip Ka\ATѤh zW:Ud1/fgG|4=h~ hPR6/0KNj:͵p$` YPҚ JIR2J$%X2emxks*)+_iTx"%ˇ wZjcmG^%h`Ӕ)hF:!K=B2RjOġAOʜX FdZ=vp[RbɩPG;$V%R?J umH.ָd񉌑dG.l,P 4Epagx#Y e,T|'S{wGO/:s$wL2.LB|1rn]7]Mι"q2)̝tz|@#`/ٛ$IMjmr*6fg Ѽ\3&z]PEcό~x@Y%]*K ZFA+;MW>POxUCA$B\ qUgZS6f=1:"ji @(TdNw%!JuupwrgguJpQH/@[q] ̼wjEVFdt) zR,uK]o]\{\@DleH<[[[犽QZ؆ 4n4*S9?e:T/ac6^e qMvJʌEOZNF iLUӯA*oޅ2.qrlʛ=wag S;NjF^*nTmU8 7ǂY.cm.R - ݙ mYH7`j:t{o$?B䛻F=[xiIwYWm[cWFɐXѯ=U/. Grѝ ę< >2s1xJXB)2%G=CZת.*l/Eɵ7 K?E| w9k^onӳ9ud2^Jt&78sedfQU6 BV`d3Ѿ|^5&k/!LL&y;=нNpwi:͎Wb ]Lr$ŅUi3karnJIGwl>00DD4zLgm&+Nx )m;ȃO{,o ;!K:?[^R]ːPp KN,>E(jrk\vR_f3bޟJѻ|GezD<;#~2nŲH1$k$S2.np_@|bwlأ)/̈́jw[D|VKӑ껜bvg^mFUmM}!fWl.ܺg shVТǔo Sѯ}n=g[nG67D[H6Y#yDpEmtS)ZOΤ+'FaPqij*˳[w!chuv#JvFJb.}e!^2&r( k$;"Yeއ 5Y={H@^^@"J@:vTbdnyj{-ٹJ[> N&!ToD#uNCIc^uQq=$B ݝ;j sDT|7}\Acjgek?Qs(ek2Ђ?/8WDլlS oy)n `ix6tHEjt^={l~D1y-n _X@In kpI{B5UL jڽa\qIgw9'88`NN&w~oy0(krS2ա[LDhM0xJH-'بN_t+pbvpd3dU"9H̉߫鯕N}#" (B2k\E=忶:kΌ%2;̀ǁ+ZaY]>4Iabɨ 'DRBuxg\7c _Z\wt2NrHGZ>q(2T?Q[l4ލo^6ϙS|:}̬I$4}γ2N'̳Dz x բ?|ەXdBxtެraxT]1 Hu$(v`]Ig刹9[8 1{Dngov\< -/uU*K-b W$+' +_Vvo$;oi5?X5;a%-X-5d;YTaESq+h֢r[T'ajϋ|̤،XnrZM$oF 4eDW7"DB.\k fRpȋ^;v$wǴv)Ɍ8A~A2t]L4piQsoD?֙+GݵG,sg笸ZI2㩖^Z$3+aRf==&Pl%=n2nSZwJnf5ĕ!Mņ;^8cu4[ :$m]rm&wt8?g;z)iwr]vx &rqײO*QJ24sY'of11v-Mo|G^{~aBMdr‹Rceን<[1TpTRcdfi^)9+q$Tbg/]۱Wr?g:UQ©eFN5vhQ+\xD;: #4_PJ#X@U8{szn:y8=Le5ʯն2h>vNUuELnԦiE @^Kn~t2F}7^;+Wy!. $՚U7KVϹ 0˲YUg]Eթ;`_|7mMCmT\^MLn$q]f}7"LjC8o3zO;$ nf7N[;}'{`v,8FU!Y|l Ui55J w7l~>|́KEBLbl.aKCςbƸ쿒UO}*%J?_?=a?.imFd*0xim1]uTTM>5 cVNq`tnByL KRz;y~kUNi7J:./FI7OtQп s5bA# :͌j9d'o]K9 ؒ>+u|< s! uFK\#qξv/eD ElcW<׻d߀3=?uE+S¾IjӹB\;7v[fyZ/K3?_}v%4oMܖeV\eh]+c*bax0_6>:IFX0,)@hq`F;ӯI>*sTFXGF dM j@Z o:d~Fsmr% +*+\ Xk K!2ͶK&18ѸHr9|(HHա3A'z޻w֭,N>f sH;îw rluv6T~4Bjy# :6 nxJO~S?أNN%aG) QML4qT$L‹ah.p5;pI%ڼiZ/V\T݋ȂP~=P5K[@ړTm繭d2[ -uGWX*B\776n9֍Y1vj9̥FpqRO7La5 `SLO|r|b&ϔ-E]8>Uԍ^pST KMKPٕ\^xW%9/I܊6ƪfDZoDS[zê-Gn HrkC9,EvaH,AK;ʽ?g쏎Ǐ` 5ZZ@.T^eI:Z@˗{5 #E :'+gIΥ覵Z-:vw"36B7|U|$atln9D 'jyCra?Ltq/9Sѻ!C#FwcǷxC%E-8Y-a6ce R$& cnZI:PMy$ I(RufGjd#dP!VV- xkc-hK '/# "i*mō,gaUA~ǏO;@>J,KX I{&yzɭn2ʛ͏{FMUZ}(o !LeN dՎ6ܯWJ@&ԎpuIZmLᜋ^kSlĸٯ p 1tkp)Wta) UާVdXw(Q2RXTS#5ǖ@w<jyUWL>A~hܒ jq80.(P$8j1kqHƉ|gZ ~|=uƌ^a>jX SC>:=zXYSVe5֠ e,zz0k`,1zyBi*8#ۺk%X:%Q-dE=,b_I3{.7L1VXiLu. [cu8l'd7#DM9z 7"K<2E2o7BaMwl2 jDΘ^Jq_$N/ǩ.{׌AΧZ󮈌~=tY: l{%;a|ۚ- y(1lp xqa3ߝ=OișS-ԂP5dn=В̒O?TZeP (!%&JɛCmBga c7?z pGu?=$@^/i,lzZ\'hΩ]:)DpAzg{:Xړ8qY<+ 1߁@?2Fds2ryݸ]ԦbřbmIr K2[}+ߓOͯjV؜6r5H2` ՜{d\TyA"u2-A2x4 Qe#Uy!EeXմ O{:/bHPEܱ|-N_΂M_Jb:}ߥ,|kgOyƍm|~c ig+O;˙57mK}yX4X*`u;S?%Q8'_"Wa4}MeDCM$a}ʸ , 8\a[ͷΪQZdÒmѐ]JŅd<|T}mKƛlߡBW t|CTlBn8 ObPЂ5c;?vOC} g6 5"^&K6dOˆ#$yIXR8 =&( իҡC !cS"A`A4c Dx䷓N NvMTKq+V`?g;k$!Xh) ]ZDWbFQŢqeYe@ XVo?t3VU?⩲3UO%Rj,h\N 6Ȱ>[-aOAa7ؐOdQUSE@Wa=lz Z2ʴ0냵+,k͡p2J‰D_dIr,o9Ӑr#I`JY3"~ӻz]M۹%uq~UB+o =a ~ ȝu ) iQH}$DŽq-aZϡ}4^:xR[z#9R{"4 LS>Oտ}w|vV%qH`z+D/#Od+;/剸n@mD: ɝly7Ii+aW2]zlu kA} ~Ma`ط!J+Mt_B Fb*ۭ<ґ ,t΁ 'ػ'0GS&qG>֭ F7Y5?&,5xtKl. Kau.eIDPew2,TZm#Fzb*Ȏ 9o1ֺ3`8`6xM?Yb*[!J#{eX1JN}`+"]_-ʧ7/#y?\L3NjT)%7HDPsA]k MoV5.ːPq@C0dPUH]uUi.̸YW54dD Jh15D>*㕃,d -E] }+Ҍz2|2_;7UB>2y˙Ryd{F,l:MS x)8@5. GV3{a_od׾-JnلmAL Q!\ c@P! ͛0wc GO?yvv#8Im\U<ܦ c[s|$蹃SP:I>N{_s4qbT?|k _'f.ø';H(FM(> [PUfHI,[6-5e<"jv: kai` Juİj[>ៃ}b0D'Ai=`$SUMDX/\ òd'zZOK6ƞ,dCA mICpQ zApbX9/hLjN]TУ*n;G5q;v?`"8r`8֎' 䑐R"Tzؚ! +b= 86kRcrMюЀ$m>TѴÎ_f\8ä9!p W!vwuK%>ok^!=fNj^Pwi0;?._/֏=1?L Z2n{6~:=rc_ek|f)i'fzV&#̧hkF"@̎θXu  A#H9jSp qaZf\fIZBT͈8YgY zHFѲڸn.sX ~8^786[d(Tri}fK;IHi>V!M:̠11 Vg0T^\&YX&&kluwcigl'kfv*_NECE&dYǹ_Y\h|& ]Q?R/o[o57 .]&ڸ$$ { YJZvN&q`h9mi퐱ÊjR%{xໝN+~:@xq]pU5B.S_'?eےG<{y|'zELuhmIw|DBoWL`-,YRBJiZ=P f鎲Tao=+w6뢧ҿٜh.?F1škXn>/C uLEJkhcd2ᗾ7޽oAɅFWefJq^;sk,2wRy?"L~U˶kMa1 ^Z!Fwr)Y,/#^%EW!(]bawܡ()e /_{eY^v:)g 3Ou&unʆ$F5ټXR99lXhjr+]mWf nA>Ć ~S DPR] uGS@ oEM?||7E@u\4 bDK_8%~U~}_KWٟ C\;{trUUXV.UG!`[Tpfu_mdꦊ* #Qڱ\mt6grp0Rԅю^orq#8{Z(/ #V@ Q=/F9 2)W@,jk0uYCҾ((:#KvW.ʃ(K'ifL?r*2CRoPĵMX2ޜQ諻x:M.+K)ʞbe- 9e]" sGXQot~[+_{^/̀&>"o3rUE7y#i]LnKG%A7V;s @N8R(S9x={`8zBB\)T_Rasy\RB^RRwm 逷k}͚xgD]]94Wb([:s"g]=H89{G8'ݢ k8HvR`|_ͱcdDً3ܔ S"<|aIa{OOwPDEMH64L%y{VtWItx(sXl%*:@)O{zI.3D,&M`' H8GtN>` ˭|F}i9 ?]y@vwkS\AۂinC֯.%(TJk:(QVQ$rFԎ)'cb?n%dD|nEǣImjAq>+wY؏|P0[_7%|W\ G8A )qwniH?3fBӎ)TTؚ,2jEPy0Z"eG8vh&6p$w1rrsX\,μtl0ͮZSn-lFvJoC"TmWU} j`R%x^]|"SDЏ͑D ;":1]alvSf<@Cp1O`c8siL?6kgJ}DE})j1L }Ȗ)oW^ޕoc5ɨ S":#ii7Mqev=w4/4d~=Օ2Mz^ nz)ǀ1g}秧8୙ͪ,̗cl1W'o¥Q)lH. #{pKk`iKAo$ R޴\>*zc|K%"dgf7zd32h毢9.?l(lfBAgƽ\IckmΦiY<GX %'KsNor 9zKP+E"*2T%%rg Q Ӱ(Q$dyYvi, lE Z f6Lp*j+hKg/WfW6#$7ϓ$Vj>}"@_w;A͖ ~mN+(҂=C_ze#!˟ _'ԩ6]>;I`;F79}g(NlenyMtL~3>:BV{ABRc: h21 䉞qt(tQW0sI+:f^s-n|XVHZ40auWX43}iK _CP SwQi\/餢l];Ȏ1QxOOY_~ 7 7EP9* ;˲N\husѽ#E;2\'V-3#ɹ Kb9Jɍ䉽 H #͘\3ED\K5L)*Yp iI!,,Ͳ8l0L~-23$bln`YĹBMqb7MrM 1$k szsrSфk60ͅ Y vӖ` XFY*߼5W P% ;xC3H?W&)u|$𣕣6 Far丹-ώ-me{ALQIhZFW֩R؇2LLD!/mu %Yǣ+H~MFFvCˆ 7l7[OT:#GijVt|6W Z/ "L;Ӓ|}RoLd? +u.m"B.OĮfP0sq^Ͻ)!2DVehc-ZsćpBqv@ެ. uFmOg~n)IPᄽV.IҬżi_HҮt&9ݩBboޮW:=1lq,vәaq`"S\:|'Ϋ1v*֯Ms!W쩧V N* [9tdN?ϩ:2LXn%^>]3wTIl(KcNw zE6ճ",!&DRa(}'>2pWQ|P 炴v( APDR)aif}h5\_^xHze2=J=E'[?c{$8^(U`ɮK8}ku2X(ʪ۰>s5:`.7=r5*P&ԵTZcE1,Z`'zZzjqC;+wyC/JΈ;\9i|<99@:lG-vH5+5ݛiչ,7wm"4W^!֎A=d )&C] ލleݲΥ:sNTPh#O 5!J _O|1K?Ou!5 y%EN_t\8c3?wQ  نhx %$_@A]&Z)6eY_[}V]?tq]ѳE~? U !簏%a=_|lz7D,M!sdHEl2 2slR0:W6%Jv *Yb|kji_C {V`f͞*BŇ|RA"v)֩HHJD%BozG<d`ǮJs M^IO?;~i֏՗~j9@v+㔚SȀeu# gOs̀["٬(d< DyJlO4M>x;D}Ͻ6nai! `n*k}eJ]Ʈ//W@tacWi.6 Wn+&3p=t#apv{&ηd96$Q#.vj6 @4#8*˥fVP >qB(6?>`)竎z"t{f 4gtXQƇ_@d;3W9vJ/]ƞF\\epk4ɪNt?#ͪ9C>|G] ' o,t|p^ 5jYBt"n-vV]K~cBkq'7MuԼUeM6NmE9Xoیq2h/s̰T(}Cբ:H eV;I,XvwY8CH;OD:s!e6BwZ^ο\*)2k.fzGM_i96@AvAJ0\k#| glߠ sN1<2Du;*Ҙ`az!$8B}H8c*b%_ش{pJ}*= Lxz"lҥ-eZ\YGD(4s#VE]]`#*/S,q=V&,s}iɀm{924O(N݄-f֑*x"̢ ܓ[i$M})cd/.s A>D"VB,mWD,p^//oVc2ΧRT?-At~+&<vk }CKU:Q {2lA.ܖbCy1 3KA Iqk:O_{wwiRӡ~OfWM߶#L`dǚYQNY5o^zda7FLL$0{]cA#>QF[B2D@r(m51ceIFb{б I^1X(v؉&JdAf`+BIb4Dre?fiVCv[H(rB {~aa"kLzŇ^W5C}TlOo Z"Q[/nFoSyʮB})gy{jC>ŊvѴ/MlNѸ!.R-[d*B7Z'Dp#“R؈0D|f▎9؇ݿ={|ے4A#IjHA Lj$!'rIZ)Ҳ+Z)xZs@sᕫ)/. 4*hH7'd]:_CCd|[.yū%k鉰؄c3a\4g^@ fאǵ\<4m@R;_`S8GA#eGHml>iI>,2/2-!OGL|*D4[U$@WT=7XNY/~qg;vn1@.N.b(t\["5S~㔝2,O&O8  1W0,穽ۉK':-"HCLfHjP]U Ziң~$;3H_đTn84xB*V45[gT𹰯LU"oH<^m fêIŔ ^g# wu!y޿/L"Ƒ&z65}GմhAhx{g߅,7{\V65zg++{qL*pH͍P<PzHSUΐw8aIT'Mz1)[lU-iBnɌȔ4+0="a%CFE3ܵy"&Vm QɂiX),E0,tSuT7pеx 2P{؝@AJm`. ѓRp]wL##,RYcEbǻ*w3A%>XMG/qϟTuy5YmDSP.PbN֏B!hps{q J(%R2I:n従]7j$& C L.RgI̐tbJn2Ể?j-H7{ئk"V\RWO {% CW%Q7]*9(!2UjK;/8#Ux47kkĵ!2ʲT]W%&t6 ʻ`e8g{h D4tXȯ!j<ȟxC4Rhs[eȊx#GRu߻;`"2yvc#e3w|:襘$'"vQMhbj 1ǃiM1xWBPL UPiϟ$I3AP#32Q8HFw^=e]cV{Zf#Cvy9$AA\QUwEGDVeRpC{n)1-SdJMkMF1 |E0V9 7~IH.7n'ܗ`DrwK᳅`)!itQLA»~g;)x(O`S(B%55@-Di-JVTR2[6.eC &G?I"nD&v#ʌl13(F?$f4N;N&JVz>/]H7%|-=Fd o vl #9Wa"j:t?Gg{.4*w =&д"Ǵұ4 C{6I4GѦ=!͋eٯGj+AEf]?/䘺ۑQ`sбm7X ׀/\#K4:b`Q9`jG&m "l :B"CeC-+ǏĖ{o{,p+-tb"7֬pIT7O!W88}GBE*4 %6]܆֔!^EH;b 7b9uay#VgW7󣷳;wޙX'4l(6Lht/֔N\(5Y!M@l/<ʤ6TWn<sHm, g8'ҖRsYHL^a;B1o5˧.uN>ۗ7cWD+:cVT~յNJ5NO,i.c*܀-tu'Q(?*^P{ b+bJ5Ҧ{=zPZccWdx%zZ#iK*!;.Wi9E &ܽx9a]}-5H(ÐFwAFOBk"TuViE ~@%;;B$u F h`5@>dh6+Y)e:Ǣ2HԷFwˈ[wh0_yTD499[r낦rcw㦞^jNۖ* `GQ=9=#.̤(W `T@1~d@Q{N ׮vE\[lk/tP(s)g]*/1~wb!ҦZ5PUtY< F snP{y] AwX,|zW֫r Id>\vF-1ak( Vzf4\ SKƹ-ۆQ:Y&[kD>\.~d"?Ɯ vteì*JP&i۬l3|ஓ(_R9/ g,M" dw]H gep:lB& oI௿#c"eӫu8'7yLxao  O`SM]F6:pwp ,'.ֶ{ngc}20'yy1L%%_VEpIxy縞mS1=G;IU |SbS=NVPv$m Ʈ@]6m]*$- 1Nl!wN%vEQh0tG<%r'P{i%Y7^7k­ @a/~ _R6'IЋ@n:`N }8Nǥ-xEl5Iфp"jЦwɱhE k1(awĈx`s֍\kr(FDv*15u/xL 8^D0xׂ?])oe!Ow`p#UWɓW.b* fHI4$nDtzC 8f^K3DO4>؄n&USAY;<&nApXw9ڵnrmY0ʹTiʲ\,VEVYf7vhmZ/׹!{M8 uYU :&wN(J{70; 7+ykCh{q}#ZȞāL\^/IU QB4SD,ĖA`t1+ћ١T q'Z^6AU"e=2A,y$ټm|6/?ȳA`?u >E%>)c}lh&:O{/,?eVη~?~1~޽O9=R:}`R$l{f$E!ҳ# 8u-nm44*J8(].܊=_3[>yd/aӋ= GE#9gZ v@ iٖ<,B*[>D;3hPԻhYc_CYwg29 @b#p3ߙ~. IM;*Xp~C#*Md}fWvd6-Ӥ9[lw~&wظWr9_]+%9lUbG96}^2Vk.9Qg6|-%I#0DVˋ2Y!2Jݍ6$1- Cg04%᯸#0)?a'ۇu^EypD'Vm84U3{︽K:p,:<朴_AT" Eh~xrxx;ݱ(Hk┭#*\6 Dmh\Ljօ^)$Y,ky*qM+7`)/oQ>ZO2x+'֌ޠu&jJoDA-=?򎨩bBY;ѣRs4;Pu"zI·^%z cx?ɪp)2%ErEP9Rp:*AN=xBwI"=:^[,i0x !.oE_’vS<j@ {^ܞqL|KH{?ա"Rv~"I9kTerot:=~YrdI'gz*1y"bkEȣTY^DDx/*Jx`չ.K#lP@ChmlM _ob\`?Na={ޱU(V,1+ڑbBDr=Ng^ҭmӼvLC@QUuv4jzxDj~,jmG-Ȉ8[A'AE4fs}yr bÓ'rD&OJ%`Ĵъ 6*nk܆Pzw]RZݢ WeޕbaWFHD [zkɪ88v̎vDO΢,9N$%qo0o.3I&$hI6-le>eiE%(bD!):Sx-܊pqI1=j}'C.*e.ZcS#?4Dw\n7;ޙ-A9Wz4jQP$0 Fd+כ?%#ȾH-HJ:IQh<+{͍ oZ |KcZj-9`b\hV) "ND/GWN]Rrq}!Id )'ż+4,*E#/fL7f *K.p kPx \oVd [m.1ٓ)&4?$Ԇ]xjP#hfx.smM~i ؔQ"~rGU7u `*IC,oʺl̹NTYšRԇ*2K M0SVxA7DCݠq'tjUY*d *4l7(ֶCMUe8Ttɍ q۴ș 2x=tpxff~v s.7[ml9W:΅e}].<}2dzx5 .i_92`"z GÖ3~Dw\k҉LEtygiؾD?$I͋CIk.yphYSy ^g-OH !Wբ҄^\_% ؍. ^È X,+_ZУ8>Jt h(E-aAaبd:ys~zRM6C:XS[ dI#ʘ-sC Cet e2kl՞#,kmђe {"[9_΋h2%kRL~QGweTp5%fjd'{[[IBY Y6lhmsK!Ք"-HXT*CD+R4+P=U7 E˫oL˷t^K:Rg6*(8BcNA"wioA݇5{XÒMRT;<8YvS[ % a <EڲGߒA"Wź7E?z޻w!HFWY>9{4;4 V8luy@$#Gn#'Y}`BStS14 nh_K.Mƭʹ&:^WT%@j,K^,* 5lAy'/K=!k`TXKFnGJ /o{\m@FX\7$k!kXiՍT :#F_:K Sʟ)u!fл^aK4mYR?Ur =E=wYSW@Y'.";SbʧV& qT .h$z"_vZ$tntv? "AR|]&dS$G zݢ,R-+%Rzوԛ\4!%&j2ح9 (;3oKZ%)dr1*ed!ar;V&=VX&X/[oU#^H)si$;<>Tivz ng`!Jӹsq)a߾oy!2>\>|i1GGG:t\{7ɶ[x.HDFW^ 9%M_t=fUlkvl)|E]SWth*4G0͒Oǟӓ4+X%8ȾJM-gy!!ySm(X[6cp.2# n~L wuUi;]-͢oS,J(z1K}_':;V~r+aAK%X#`' |m dM'.|G4_y44NJzV'2v.PffŸL'IT]0 !ʬ+TFvk3NB<k...PDNMUk>{ k%&+nU 6N%{(egCt*SR;iTRԪ(UR%]7oNXBxpR4aid;B%\Y%&9~S^#K%Q-$OA2 툕D!7*i NgD:+;={ZNd& $Q~]M[d:*2`@rpud}enMPYW0;F<\οQ&zRS\@-uV. %/#]C 'MvyRK&ee*=\bj~i91 CWTqC5|O'hBx:L^>x(ƾ{t.o0nGO9'wsYJ9ZBRfc 4QT1 N-Z=^*oS@N2+s.787 ~z_X^D7dg~68^KZIʲl8?_*rxxnUAMuڦъSu"~[>6 W g@xSf/.fL4gťCVpN%P\ZN-Siz[ۚ .`W4p=/;ִOh[5<)&Z>ơx]}r] N(<jV}GW8eX_ !1,kQ~.> Հ1R/gU%veT}4pL2W/^&PMI8ur ŧlȿ#E,d}(A}jf"ޱn[%?p\dܫ8X.ZPLrTvCj颵(|%k*7t$8uDF%dͦ}9;B3YJn[Ec4SeiB ˚Pff,7kͺñӁ)^lVn+i+B1`.ђzEd+iwt:&{;bx}?+ۀ\ܚ6E'T8{T\_.FwmXc~`H ]٫ҔoJ IhX..;Did^_P r^)m );F5 \ 'YA8j9)Ff2E)H<\B4`= V=M|:5oJA#Ua6ME$FlrB=:ڴ .;kE W>CmE-U/D>[jnu/_+L&>:<FTX7%i?%lӮ_[0" 56mn2҇`q|<+OW߃c/ՉĆ{R. B7UGdc[#)  6z"Vf!^OC_lBMy&G,TiXUX-k0{Z'IG-Z 9Wfﶵғkֵ]I5B˨̺*e1;gcx\$K #YU9{%LL%}VjLu:UB˞ʭyë[O\>_+Os Os1JLN`&,.]/!5+dq:{5(yL+ѱ[s >YE!:uq@v\9ۡ9 E25AXJv§-yZOd<4d ZFn#n+w9%նOuP(j\4ƕ@ߐecc8sʄvbEuuys%/ [O=z%nwt`&*˼h]\,GGѝ o'%v F$Isܚ-(;Γ "?,7eK1:9\ӿ\`z~\=c^}ۍ&ufo;Aw@. ƍdTJ , [PHt ϴBaT8'~DX 7*ꭧ|N/E_D;\tF#vg}Dc}sLQ{󼘥ƝtBmnC37G`A,h~ |jUY|"LR5j:%a'콰J`MԆ0D`64.tq;ed<eܬ `=4&J6sd~G 1HSm4=0``yb> )eb%~95tjՉϪ74P4̚԰_|o)v Rpͼ(+,g>S L$ z འل,n4ƯW1ݷbÊ ~ܜV\HK='{|*)%Cފ45i)QV '3BHl\C3A~5bsV!|P `?PՊjct3:+G#MtR'u0٦<=;i o%wh7 !G_L5aUĘ(WH7rٙf7'hh-QKgYDDbꞁ>^P{,o\\*VLaUճ9,S"(MH2)m"+Z? ? 52g1j*8DL(\^, y5K /L&*8OB6znM|s9/@hěK1 BKbB0׌*'.{!;pW)>{y`~ _\6gb.\HEAi<ŋQ2}Ϧ\7F6"X22RJN9FaS*;TTd%>` Q qz.gg.$# (EJJc)ȗ.(wtl#6Q,YKǹ 5Ԧc@8UjZFSWDbcGR.It8, SU'ŰMBӪ`I:΋50[[p#]%SZE1}x-ؐϑCUwigTԙR;9QR^r(j;z &+oodo 3y$"R F$q羿@lb0)e,V:JV-z'܆SchD5fӻf/J O]:6'_Z`Psɸ8/ ,RkR9"CVBBps&bzlG88[0-* GhO r՝o5(2/4ZSdZ#l3e?yhͥ0nÖq4q'Wl9$no`oܵ,յ%Jnk+TxK-uY (1N`j4s7%->XoZ!dea+yq FįAǎȧX㍡h T5q"^]A^(]g"*Y4y?'Ӌob RP*bNIljCw+_Ny5Pw:J0bNOTV Mr;}\FYHr8fqɜ_RjHՉjc. >)ˡ,,8pA%qTq L\UT~hȎBsTn|,߾:lCh)Bvka0{bZ-8O^UZP0u ԻHJ.>|ځgPşW(|żv 2ԕȞR\ێR6( <ŵWܷR- '۪<ՓT,5 aaIV$N93<&'`SK;}B87$d[wlhY(#,J!P@!Ihݴ0O%:ֶWħ--7E:ƇGE= r@ vRǞ5B0g h24I_&\AqaanCW^?/#=qHݰ E%̐qu;!+z VyIZKc*H$Ji`XdPz3J.fKձL^FK1sx 5.0pVTٷ (I|# +oz^7$V-pXHJIJq\"@D5F"D!!)^^ث-F), ʟ@8넨e>%Lʃ҆Jckl؁ T~#L )(t]fˬ6xEym| ϛ|t2DSRJ&Jc =3vNxnãƙ$R)7wč޿A8cw~- #J--Bp*0Gć"%5|PcQk`\n0㳳w?eaMDRZj]WU4eZzx-E~DbBDFDmu0dsߣ^+^ N\ĽuFZ,?GNDm(E=P)Q[W7 QqvN}4#, IED~ͤ^'^`܂*5 A(C%DooG, gRM@7iǼV<y3J^_`1>h4Y(f^O<\ξwxx 27ic%0|#EA@vA}UmߑsKBٞkB踂-A1y%AhLF hbBqgz_EaDSi.pl^tɖCE\2KHnq]Ոd kY;D)E-1oT*Dy|gZj$J7qɥ%|%Kʼn12Wu,x<̘B%pWV;CqT p1:>Kgdnk݈q *'| Σ}ٝ7.yE6sߕ7=cDZ{0DD~msm=]fL}A}B a [zDR48a^P$\bLzBY2Aa LdfKjEIxZG!80-!܈/C+07K͈[D.ktrck[.lE"G2^PmUnp53Į"GGS'#]0Q]gO4N V8;]Q#OW& XD渗bw_wnO[i=md ~Ӳ1u0#!r2%1'I!@SҸ;:-uz/vCbV[mD4+Ja3r o`d|]mc; ZBY()Cdgz a#`@ Do'x⏖ˣ_yQa]yb]W/7Nr߶dc~6o]W j8Y7JE;+]IV_^C,F1 6rT$؛<b5"Յ[Lb1?vfÓ,K˰+H =NcV1$9b A:ά23NH)I&_+8@B%r0 hy`(]Z4 #IeI Jc0U)9xPyleJ!hJijfOxMx=g [G<"  W~[/{׼`,6H 戄α*UeӳvVʺYVO>)b2:K* ԘP$)jl9+,OP) NTYs8Ua2&Pf{U׆&#ټW%L?wyE1d} "ލܠ-8et,8G;, [\dٰݾuH8Հ4%,cKx4?-&~1ʩOX&zg҂慟Fc255:*BAƣeV-ŵɖ3^ٮΈLtAwl׎ކaAcl@#.XzM 7b|Lh ͼt|4#1*DIyQ~gX>KyV%4S_a}@Ԃݒb`^։t˷'=01rMҺ{xا+oG \펅z9KauSO䙲XC qM"st`MZSr'ħn ,eU] 1B󍵞dnZ%Y'.b^ Gv  z(%A+BVSc01G JT9Q@r)$ڒb|:[JN+ndbB2ݙ{`)KD#Zy{0cLC7.5GH сQLN.DK-;D`-|W `!܅h!gw;*XU-R;ԡYTpv 224܁_Ya ]*R4s BRLW{ep["KlSRFl9 (傅2%D!˧3jXoiS&GWj؂I26y/#4pd-TWC׵3Xw7WِE}x=m'<\m' ;뺆S{^&o.ŵ0c Ց/I }U{߈G.}|sjC FQtzڱ'ƣQ0 [!H8 d%pGΖ<~F1ɔ+JxsX^\ao]xNiknRǠ^.]g&˭[*9m~+hC*l0)qsx"`JvQm|8͎i2x0gePS't.zH%DmJdR+7m+ͧ7mJ/ ޠWy6C[UZh$s"C'02Ð[`A&Kk\-'G ,Sj)=fxFVMM Fal)dhHtCcKk]1J My~qORĹMq-o}(w~e7Rvjkѷ½$k^qLǐMQD,΄R5PiBOWh3C@AHejs$'UU.Λz1M_Is0Tl țY}X"dHĕe)0E1;NQ?!gD#9Äg=U]'kkXA'yH̆x"2HӨDHk$Lz1H';%֝nȷlqQb U/EGAe(DЪ;:"pFk7' 8k4X^mCJ|f-CbێMս}HʩjԍD+֭t+Q'/LuB ygB)QK5M!)Ov6KI1Oi|4ey/PmqDQ:&FwfHM=+ؾAMΦG٠f6J H˒(KX[>JU(a[]#HJ4yk͌힐f޷HS4D.P-5;yJ'c%}V͑ՔHFV`ʳr{ٱ"'!lɩb I袂9M,J$Vf/Q@^nPŲry.iЌFhd4wH%[]$okݔ.Zi]j˝E[ݪ(/#ׁscwœGUʀ_fVtM@ChB` xYviMC_٠ᢲ$r1xZh 7\Wn9x6 :!fRS^Lw/*zTo-W'K5jj^yg$6dxvuTLOb0Wf2zNfVêjh*SzpT12=( iCCIo=ܾvv%WE9Pr΄'% G=l2ؽ(_6nJC K 0%]to->āY^LKURv}nZcxe|pp:d@Dd-J_)GGI(5[ KqC*LB yu~7WV7D{_fHF_C5]2:zoK\l0rF Tw.m _đ'bCi%t^X%G.u\RXi]3\k-.戙FQimREuoԼ'rYIJPw∝TbIN*o7 dsTrʲ)('X_jDFJ-HzM7l[= z_be9ϱxܴb\4 Stv}Tk[\}Zx}̡D[WUjݻ.<ω6bC-ľ!bKP?D8~yLD=dkAG{{i kciW\/Ss5ODP1ڴ2u,g1GÄ`*v0?#aY@S{^G?- 2Wsrk, >ޙƷAd ]r\4VX?,ڲTw/,[z^6[aL}w>j<.w/Q*OB5BEP•z(n|/=;Q-b#=bW\V=- ]jl,fp]֭}xWODu\M (;2<ݪڢ- 55,uESj@{!FS E#(4%%ٖ͹qm;ȶ0\钺uO&݁xȉo UЮ<JhVE˳踶$a5NF5?4 knQtȥng3&Aɍ'#U/EI$Jmӽ2~ u\7g'X}BV 0,UKzE-ΔO.q͗PljP^Qi JݡЋO0ԃnXHp$G ̉xq_FzVI{Q.' Nʌd _0Dx<֛U I=Eʹ=aŶYv~VrCYBJ4]y'o|nK ]ozTrUmȳ;E* U[-B-=;J'İEVukK/"%oTh7,5| 5)nKY;@<3؍YDoO%mt[ |^Ɉ``P "EW(nƉ'C7.H`w)r\̡oE{Fk H[^ V(g`d։~')eۙ az x9~hoٔiڑ\&FbËyfKtyslP[≄ Rnߟ|&1JA-T|Xe:2>M:}6i"3' =s[y/e@pLu)qPCE=r(WT@`ʎL C :WU:u _ArL 8EIpۣEupF"'Î!4RWca;Dtw3dd\Ğc>חnu[ʺGZppVQBm_Pr`7m^&j[~=+nQ*LMTK2U|P>!>XzzK-h~p"!QI{epܥ4\+Z:{t4q,.fٶ#kJ=:OI+VSDil:yNQt,Zz'd G )JWiC2{ʾ˜_>gn9=؛ ۰1\#Eہ#.$dņ_3bR>}?+xz0 gf[zd$KjGzIR[x>xsGuw+*])O0HlbClUKfSͮm "LgkdL&(Wv3J]Krmv ,VicD ,ǀU M=YY0Y xJr;*xP6ƻk0 ><3k}VK:Ҳ±*=0(3gXu-NC>i]axdUC,uT|`Wgt/+K zcp9Dxl 2Pd`ZNPPkt0d 2j#XZ6{z1HUOX7'!2 jDz_ %[VYSc Ccd^4Ef.cC[v<5,|i mƞJ vlj To2a-з_]D†\@@ܤ糋b2.7PXxD-+|Rp] %uܡvfJ{& W~۱x.%nx aq!"N♊NP#[.WpR(Njx*bɅ^ˀ=Y&̅W>nn?q+@7NER\k/'px82 nm߻ZEMMO2H VySi>,ԞU-"pՌtꑄW ·"d ImW+[=FRdU(w?jFhRD4zqzGKʩ)"$7dQzT|wI"r/y8:J>unRobڛk7Ah;׿%<3jݵ .jG IwOkZQ=#f3AjL`[3᷿u#Q*~=iX"p +8R/OWߩu֨%} #ǴΧN8 xZÝHG8&1 "_ôXXr1HLV[Uu~|aw@LaXyʓ+rM\Mz_2J{6M^Z4"5̉F`2UpFYys.O\viqAש@D #JYk p25PHZ0{J -R;kß c}'zK\BngorN_rr|^L،T{ۇs Lt 9>:SWϨJ³ !یb_(;kCK$DzADM.rQ,L'$ՖzR" y9L -kZ)dA<)&^o{]װkA !*_lH/>vbniޒao+p͏㖡RdS>q>~N$3"@JNu\ri; ܖ k$-BlNwOj1t\㲹I2$K Zw^z_+ڑęexuDܞo ٶ;Gd23k/}NY 7%TGPb;wRgEQ}+ӛՍ`PHfz,` X%6Z%!ò3⧥C'\uvZ&trt }`3eN!+\ ]RWIh&),6~H *jY4#\|뙤8-wh}~DnZ/?P瘟Q?%R#&p:E6q*Sղi4lYuv'vtP*0xc u ey^F)-4b\RJ&oj*4ǓS)> >ğ5'aRX!:a祗_zQ:33 yCk$ ӯQƣq :JH+Cn4Þx-NƟ pUHqAVl~1"f1znYW/ɱµ'#^ƒW(! jnKdp'D*H4^ i P˵Y$ѮDd'Z]p;p :ݻ%$-%6i[;ږٛ/Tzƥ`b?"M; 0H+^ɭ4r$^lùݒC)WT!No:aOzB> R!L%E^@j 54 ~ )ڞ4|MD7%$JGZot )yBXye߇k孮]PToׅ .Ft:;/r1Uw{ݿ ]wЦ;63"DEDA5_1 $E.We<+p`T#W/vM)zNJTUGZZ(r_T54yz"&YORX[pF RWfc#yxaNp>.XPFeo  Wl q (;(媪YGEJRlM7:wIuD]]71BRvc b@ә]oDvaDL%LGVpkʣ܎{nޟ{jZ]n)iR Y'̰CWa~D֋x_czZVB3|=EN7~0H }q$–'|p 9-ʉGE2W>D~@{ɵzT*PV|ܝ.lyfG"HLSׇh0 K={FyV "a7Zʼ0 31(O*hI{ ?zjV xv\ Vb^> :E>ػg?yaP X'B 9ꃸ~g=|, 7k G6ydO&*3r.A2,rXhO:H"P,:I2gE1닗49_>⼜ULG'NQ *f"a7t/AY3\6l3B,j,Yp֍;X`M!Vc+؅v6EU z]hE?uOFxǻ>AúW_}B|~=7D]0"5KFT'k 4}|_;)H5l`%pr{!g*(#Aj) E;wFI3O*՜W\ϚÃ#9~)A-1$ apD!S+k4]%1;y"OaRȍHhXNGQBo\2Ӹ6xOMUӘ:^CM2NJfX_*JhXɗXLW|_=\}ӆݘX5&`1K*z6YR WVoa>Hh O2q1jX~DQjOR>dQW|W;9EF~'ULBD8H7~9N Lna"k>LimT&paxN¯uF @'ɜzD'uH20ד"SL),mmIM ; zך@ժt&Z&-b`k sxF]}Z\8nU!QCQ[95~%kp 7璑\']ppbC}B,}$4yѝY&=C}$[~- bV3v# ™85T y%4K>4vG4H6{$R*o~i PKU ;6J3N2ϕX f)!2) yU;+?*$/9]g(׫ Ns <-cٝ\QhaXt'g˵X'ސXlQIQQBBTi;OՃBYX~OL5|Ą=ÙijP,FD(dBw H^(8ST$`PIK7J;ՏʪjjNa8dNݙ_+&4 "iP~S ɐ5u3L|5WM6z$BDH:&dJ ypp~hDetJ&Uw!Q~;8|PKOs'=BM2xx/>JWE$:0|FrQ¢$^ QT}f.)LD=LCHAHݤ6k\%yL՚o)C2Dl]eޏ!O~&, m\U1lPvP/3 DU$L7ﾼ8z'Ye~ ҩ` R[H9hITD`>+ bt6o.;&G{s(R2q? b.VwPc 7.'LzV%i4+tX\ǼM,'hI*JPA(I%4n!#s$ ,EJ@$܉W`#MW~ >pNUkp{Ә6p6&ɫ`kimӨfi|1Z֑Фmyh[O}*owܽ{|v"JEsBV B`SҖo|ѣ?:w85'H7YfO8L1&푈-1}GUL-'mb pV؀c7 QU#0)}UUBj|@ dXǤ^7mZI[ICp᮪ VLSܝ$2b~gbSf wlh&O PMSIMdӸ\&T?H? ˯}sP"MSgIߺYλY+47-i 8GE/q¦ImmM-DLzZF)MOON@I` s$'9Z?/K/7 ^~؄1ַ7=o Ҵ, VJ, 1 2zQ4$:i iV Yt2h͑,` Cue*\$N*^G5kNѱpIY~JsȨFl' )x gDZIMvކy2Vݜx:ų +&2R{ɫ_5Q q4fX=#"BYUeY$Wd6W@sI{:8Y%9~uT8*gM['EVOr ;Wۊtгԣ m=g#V k'` |E+')Bmkpd0&)Sh).>,R7MS^̒,Ye+U)ܠgX#3E[@bqX3Mʻ`4 ; PP̍)OXrgz֭ԡTs9`xatή?eEKnW&.5JSүq*GI# N, jkF`(=<aZXyO ?;r=ާRCY*ϼ}ksзdDA 6[%"Qn[[@^9: ^Q0i"clfIh#T(!T|o*;Ɵ~%wyihIݻ6Nt^\:Y{CAJ팈_ZBCt6\:U)م;UKI s`"Ǭ]!;(y"SQUCla ⊢ u:bB7sgvoߍ߄|镗?򑏁 &2g4e,̮+ Dߦx TUnŀnUe+e/oG=9gwK~'q!"v};0Msĕ~L#*E 93<̊zJE*hrgi֌zakvis>@0Q5U3TulN݃{IzG?ꫯ&7Oh90{X72"Eand:(ywKo75M# v:(1E(]~!$yk^U{( &[eC+p~b3#ΖJ0%H)Ձ"GIMIRZb1bMj؅{L#.K y|ցߡڳn'':] w;-ZF#M2+?ȎCgIFLx&U}'M.R~7liS4t>sitJxW}Ǝs']Ԇly_ ZGM)Mp\rg PpiXW'9)C#;n< Bd-0~?=_sh,љwF\a8lj泟;s,틊0(2'4DugE6[vBP ӊ`+*.mNjpq!l֟o;Q yˣ>գZ>n>WDwEV}n >Ll+h^Je24vk-TrŘ6X Qڏ6ή[<{brקX}bu1о]Dw2O%r^ODSKA >"VYE(Ck~֪V4pep@5e_/c`ÍܐpL* OwWk]?gqv* KJFmλ>w{LT?QQiuŏ㉛p[Fs #p者@bbH|⃿U_[ׯ͎[]{zT->9S[eNVv(9m\\PG||k'޴|9} e*si/!^dz@=G#mDymGaa`y/~=>Y{P`9qSv2韣ތYg| ׺Ξ=3)%r18NPMvȎa!_.4k#o?U,g\Z3vw^yP欟 !=- prAL"VkokPBˌQk!B %ۥբy)I&7(zWf'j<.F8$ aZ̡5 ehv yn-KB==#mkyp0?,Hii bo5K55VES]w\ E7$/ KDܻ/ſO4ɀnQyDޓCx'6k8 9_cE; ¼-6qF&vFmLdeAaO7eiE5D0_g?cqiwCg%ؗHޟN m\M'bhQϧX M8 j-,Aob=#̕.}n(ww pj|rW~_CzW}ngurL#)޿d&纈`44؞awC;/_C>jGJhD-R pȶ=N[FKα;꺇>'\"ٖcb;Wma~ؖt#pGB&O1W~%KR((dJ$2m8CҺCY?rq"٢$?~ WM!x8:_կ_~EOƖпo@:VAq׶,~ _d~!JYF*x"\%(ݱ5sd'Od$7#ΒwIZg gu ?!Ad/W [(JW?%_;5 M !=ֶ2/^쌃PO)+U50 ?/o V8bٖʨ\v-/=w'">d q1نvB_IK#'??xSBFO/Ƌ>w}죫bTd#M"BFmBZ$q/㉈=#5 ~cR)+}QLտ.v]dzp%b1::_$lEFFdZ>q\Lrz;G'+|?QX$>RkR׆T ^ V-91|対oLU_@l4ƊU>&3^󋉼&nZd`5.|K_ &ius8ɒ܃ QalBWwDŊaBZ T !A^__G\=o>X;wvyyO~Zɨc,iZH&d͂"1? Od m~7#@@ RG@#h@JD䤬?9Suckc+ŋ̳}_'q _jV"5`F_{}ё lF叒0RoC﷑Ki|(*nb=C#6oF".f0j%iJ p(aLLnKc%cVO8ÇIVUZ(aymjλ|lC}q9+7觢cu~1ni] 5Z&q pidkg$^bk*ݍ铀ĩh}U:č$ȾO/=x^g A US_oV8e2gV'"#" G7/z(? dJyЎkFpk.Y}nG?l6זo )%M+i!"+Qd5)A qiŐݯ{/W. of}WKڮzw6og Xee"Bit:ss|<.ɿMPm x`G vc2+"&#n}/6Ȏ3#zFl௱)aĄ`U@CX%OHQU ^U(zd#5nNr0].Wr1_>}֌F;׮c\RII8N9Ī ]H3}]վVQE}okxԺ۬&kĥBOpNmf윾U>8GQ6]N'j:Ԩ .)ib4Gc,Q) f){ѶbH0 knDZ˽4iylJ* v a#bP7^]`\LM®Jk,)nTx{0h!Sưا\RѱS% 6Y 2Ŷ#׸o24wsN*-Wlr : G{AŹgvj.άv(Z25NeRa&5uK08,QCh :=@JMOz I~`dшjTS@*)ZHQ *D{2m!w2VMmp#fgKF^ :ŸV8spZ׆2_<6.~^$bػTZ Vge1[k_K$Z"}w\_ZQl+aIMm8g];n;(1x1ޟ#~2ny+iZai6BQhv;ޯ ][)S#rɟbxuInAYJX5Y[0V<6(/?ǡ <'c2.h=ղ_궖ymCuW6"@6To {.}`D~Dx73;-h?)BY31^ 6W T;W5cbcC݁qٌJbkh7:KND|pcTbkzEU9kd+"#ب#.Mq14Cmڈ:ڵZ6 j4Wl W?0I0"bx9/"b>o1#vمg^pl]wQX8j؈@h=MLd5KlX~kJx?0L5Z~+Cj+2t W1Wσ3n/?M"ǚ%zּ232kcXȍD_yxyD1"k`j;ͯ}|`_7Ybބ[Ka{s2"o/æ!ݚ]^?c//@n#4e[.b= =4"Ccgm#QA56b|0PHqW~Cz3T{}$;Cr'dB~<+?5{ d+kqˋpf˸!ȁҀ!x1Ɛ1c(~3`'œ q ʯDyAݧX߅#f(Kͯ9`+9v.mI4u54vʥ.f{{iy* )\KE@{YN(: Q(KHxOio"U|J{6=|w|||x3/YকA{Xm<涶}sE5IC5M[5vp1aZFSfxw LI;GYkzFA#DžRəv?!ڥJisas{L{k4Svyx_.!vkU\؛ˆG}txVT#cXi+-c~btxtyj$%Jb qv<}Sjd0 ߗh$` ڪY.@Yƛ֛420 B4uR7X թYu}]IMyE&3C`?Ž]:cWNµ`g?$0!LDO}}wƾ*&"Ţ \yI7f3BiD1*P~6eJ"m3,Dy!w$U %E3?.M/jdĢ6,~|V5:lT/~at!m؊7T40߮"YU |I+c}-ZE*-0FlbÐ>S*l&Z8;:9Iy!E"+o-ag2! |phAE=Y5'faE=BuHYU uSy~pSF yoc8{ qZK4aY΍6Vkanak-V#T %6Z3KZ=^ uͰa:u8Gⅽf}#ao,hܫ- :$ d W9U?n4'R耫hAǽbD/>"}VѶm!ᛲւ5^< ^R)}%)V`TDma7a7V&J l[}t|(ld/lp6yZE+gJha fxTu;v6S=;)h1T4{XD6;9V3:",`tXB[m B` yA0v\iJ#jiʏ{Pxvl) H03i`o R]7)[K`3vJ(m.[4V4D;9lme`JysҦ \"lJu1 68b~i^V.84u~G6ͭ-maڞ A!Cin%kɰb.Rb ѨEo|Ͱ?y>Z`as) Թ+<#2GO+}Xz͆%jl;6k6nAy$}886y6n/5xm4pmZw_ύ{{5'UX SRCAߘܱ=GB/2s_>I<:fXᐜ!M?{[(l^I4HvZ*EC?-H6=O}}>uѪYz`ViUg̤ZjNqƝv-f ]FO~Xcjk3ʢlUժl ,Rـ V7jU(z}ÙeiVV~Q&7>[Z`Wح+. *7f`Q*Tu?Ņ@!(ˀ17lP0VVrfs)ԍQktwҶ :і>wTLXl]NTtE{@m¶RERmSYd>R ;ɹ3x+zRxQ ĜJ}fحVbU_$B.{qXZ<c(1$ہ^Pvtx$wt`tmø_JD~]–,|`LD$;r;vvi qώAsf[g(vrRdEԉ7l\U1*jhHsFa mR sfV*iA9`GUVJ o+3g6\[jr2L ![ m'u e)3GI,|UvL .5+8qVP(VY7xC0IU!}p m\ʹmmM1u^atlaZرvrl ²ػ̉#w]-#Ou ݦ8wŗؘj4 uʢLtͧ,o:2 +h"u[ʋ]bV4-맧DgUTJ\/i>=`|"&ЧB# |б)ZFrW)'.A<ɰݪ:H,:x|н^d7އktsl4ªa R3eX|<l+!5UHn㖭*myyŰctzbɒMZ:n-؜Mjw DqLǍmkC/~MHGj'qE{.R.UZM' 0t+R`JdFhw9.OY=)Xؾ7 60Ʒ-=v'%a8 ~h!jB'$QxU6٘t&Ѷ)*4)R.ذӕNOE/]>Kˀ7vuY&箶j?:|][?ϖ;ʱ:v`kcka?6wcBƒe̢Alb m_Pr:0 /;H.a}tJv+Dx] 5j4nNS ]NS./Ջ&# \&ؐXLulb]@mӔBb?}@T.g9`C.lӿ/@k+q tcEo=c]*zRBkbsŽ-~oAtЍl% i%Hm}>R]:`6,rbu*0)cu#q ٛGq>?wɕ=ZV]h-M\G6 R qh \n XLD\m!iw.v^X)bX&HHk/ `жڸ%l=mӧ|h/u'] `t)rh]``bON\Gx"V\wlye9kC}*V@<޵\uźZz,b}}\lfyauS6<_o8HڞT4\ڶM.F.uZ.-% :ig{|ڮ5KUIakۂv|%l|lZ9V ]V`I*h0;D fi;3E- .1.^K [}h φc?LĬMiڬF{U+R{=./6Y p3)fVd=Ѱ԰~[ ]<)ڃTwI'4*-G&avXHliVS*[./ u#a{5($>{ӹÓjfG#zGPɒ?>cհ/2h!n'ìo@;GH%0Lܴ~EZcIaūXKnB \gêIasHqCiDO^ߨ`[7X Ξ-yCBIˎm 26t9!mڙLGzJl5baKבLa†d|,v@[.aC}l iNS d&|9UdmŰ1-Irj)`7b.ؖGXѣH>l~D4rmhKoHHۯolVԮuˁ ];t骄 _ e=m[$f&Z/Vey-lijG/P5mįۿNlEl68_,l9^P5]qQItyt/}k!Sblxe[6I|7aDyvHZ@30qqlO&,^^6hi%_}=mGzEh%k 6oz5]=7qP[Sz 7"{HҾf}G[RrݲɪS1Ld"8@1XIa_0/BW|*nC|}qal8nuݺ Յ*rt0ؾFm%Tv_f/`'~sckwZFB]y׶ ȠV G@5DTjѰkت`%\8icܵ1$= -kV֢a#6{yv>hC`Qz9ll "K-`+Ȼ"a;f#1&Iqo px?Y>5Vaw u_)m"2Y2}aH֩qe 6Fƫ6AVVf[o:mo_lC~ maY l6wWWŪa_]0ԮKlmص667:m~ŕm (j=ᖴ+}ki-äb#CӚjݽyhCp|LnnUFîi/xe0vΥF̲`WͫhVXE.d![{HXI'԰An O[-ul$Eص 'axkawRDQ#jVz! /Qi Zȵn}{{0;u/6(ض;8rZ.l{X5z(D-X*t\s696Pt]ĭnj` ׹nY+d}SkhX pP}6 u0zxYt ZM.l#lA[ `OAXmL`Lw糑,FcڿטAw*!SF؍ 텨S 5$~`"%\FƓrŹ$̱ݻ׉LqB:f{ұ;AXm$-24yI8R{PQ+Oh1:hn0_8#WYcFN7GPB]egsF:ÆrD_y4)a׾FÞSkia߂cupk!|mTzL5ҮшˎQ=dvjNey{uE֜ZņtroNCpl&(vݡ,]{BiҠ6?X3lN:q릯jl˚i .:6L0N&'–l{4 SDUS|B`$5ȵ#@i:95IQQ2f@ux`%\_A m;p]IA.GBՁC1k_k;N7 6E;F#ܺo/ƍccNɄ i܆56=lv)04m5GwA8 pЎTM)L/`CQ[UqoEH\07aTj][Jv@٘ TR "aS85n lɺ۝v{?Oб u ekb]v!/v aLLئc`CNߋkJԈj'&:UVBFnj TNlsCN+cP V( xkVmpߏvu-3طYv58 䰡3c7#docQd`,QZ;Ak .OS$:`T:-'b[طhڬt1 c:ldpm !&hƺ;ΠY|0l`;1ks;.0l=whܰVC;Ǿ@2<ljI3Wqhh$pC2D 63/xMx`&G"agSD9T`̈́; [δH}cհs]3k.ljٶq4D^Շ}?{'zfGؑ7y$s-zDc/$}{Fܶ=|?t1g@[P.Ô@-v{,*$Oavuc- 1 ҥ'/Ƽx=i Ҿ_宣^|lA{T:cn;oM,xz:_~M:,+=tw-p^۽lWda1Yym&즨M9GlړZ0m{>8pEm4;TmȰZ'9ΦWl^Zob`480zI~zo}-Ijw(+r)_3ݓR@}4ƶGGшw`s$aG@暈Ob00܊c1_6UPNCG.ZDf Z8* 琰Pa6p1x©H9L!ƚ5V=u=XS?M )ZwhU@ æ<#SF\3{LD悝ؖ 6YJRLX r9Oh?WéܱsܚzY{qRNi.ҵeowpX9F-p`$hd7N3|MBԌfz42! 0~,|))x{A}`э&ARLlSe)ugj;:5J؝]PTv?!a{y?% &i#!-M`A#x/nnXwɐ2W0܍В#;6+70eTﰡ |!ax%(9Ll{n2 ]^ RUc=$x|~GJMoXG!M^^p0>Z8?qG#HMBfyo?-Loc=LolAzŞZ\"q:! BBuǙR~Z,lR}\~~FC*TUu[UܔxO;$sP(vCӴ<ݣ1xXHGKر۠? Զ}_ l Ӭp{8_"6P֢sw0:k}(jJ{6ŬZ+]xduG[S5[`8]aC;cݰT`YcX<>^^Z5՟\4>}l~ `6"z2Gc E%-n /Q[!_p.;\g'Q0[:% c7 |* ]NGca-TCk}1wCxѭ: wU!lcmD -@m]&m;袒x2  çIa}d6-yJ S~~~6vGP!1K'3fJU7&cOǒӸ<ʞvHB*$6IHͻ;Zy7k79X C8K]qf ^,s=hC-:IDTtNf- {&▏N=q?v(e:}ub=B:#>~ d^X&lxtQa,l h=jTKۛƒTC><n[U~PhP{B`}4=2[v?H^Qϐh_XpzX=n6:5.p⽚ VMĞu4b`%)̷G9ꛣx=1HuPt3U a*N2wbZdpȦPϚ&paȓEbH5NgΘ%܂Jq!l"ua.o'EO}nWyzRX`%{>S{Ragi6 v0J'4bgL8)XE/>)p Ƕ4Z(807@?/ ߃=fqyI ;+ۇ. kFa`8`RxZZ-#~;ꁚ?d7v^n5eG M hZ1) 6i%؞ŽOS^ `cs؃9`&md2ndL{"l͑v)vYv}7n0H[[X)+wI%"E~fCag4XwlH4VI.ђXIð|dH}){/4 k4asѺ676sqL+M{0W\Q6m4Qc}(د:l;72f &8tq0H$-J%/ aSq$Wv|N(Dvxvad=='Aڜ#4㥑LErFמVP!Tx`8#H^5%kܾx" ^;핱uתg&:p|H&ll ^R&#D-Mws4;챼g07g&ƫ9=l>OȮP52W3]P`Op)w卌"㳒:(6FxwW#!DVld,^0#W`o:limDBaU|6EBt=awSA5m3;v̳ E_bQ'q?;L.?OTt/z(ilR6kwԇ!M&s k>MFf;O|3Ad3-^S~Ƈxs.-@3=|{;E3v0~v63ks;yTCpr ;%̘ț<5u lI[ 6{Xr Q<|vB7|͉/-llRBoLIbو"{g@x#lŇJUwMZH?^Pl_웛ۍ԰;W[f [ɵ$y[zč{pu1;o3_^<|j&7\5\Fb5 2ѡ; q F{yYAl"c&Wg=FaR>}SaUVl$B w>v<ƣ[1?z [vߙ-1"d&w-N\HTުZ(AX(Ev:;84vz!̘eo|1<Dzl񂸟1Lƃ."n3l9P2[E )Xʣ7B/TÖ`=4Msdcof-9^f_6æ -?zJ>+ۿWrv^Ζ}4O/"=kgLe͝*ǑQF5[E!Z=t!cg#X&5l=^k`=b1t`?`{mCB\ohR>׻? c'?[y)F_q]%c&l),lcaP;{6Czc4l5!V~oy: CZʎl#µWT;#`)wqm%lstw;\; ʞ^ʑOf *$!muU [Cif>tMө՟WKKH@-` JF^JًK<6ĬA*"!:[b\lB7}Ͱ e^,bx節ݦޑ=K7x\h$_e 7~uZcv=`"1}#VoDwXҗUj")a6OIvSȯEG%8= \IIxm|uA8_bQu"CO?Ia-J}oy%%wbf=/l϶3YFS|#:q!G'as;t]oo[cUFҞg>iv(A+a%W7t3b;l@oڍW(UQrya%ˎM̿/.o!rUG0aϓ פ?g am^^~eGAҏ\5UA]-*)ZhSOM{#l{]7w qX6|fͱ, ucW5mkakb P֖G:ʬ;:-\7wsS;ªu֓Oi^lƇ:YEM=|-$Ħy}=c$~l?)9q = idx.iter().zip(bg1.buffer.iter()).map(|(px, bg)| { let palpx = pal[*px as usize]; if palpx.a > 0 { palpx } else { *bg } }).collect(); lodepng::encode32_file("/tmp/testr2-r6.png", &buf, fg.width(), fg.height()).unwrap(); assert!(idx.iter().zip(bg1.buffer.iter()).map(|(px, bg)| { let palpx = pal[*px as usize]; if palpx.a > 0 { palpx } else { *bg } }).zip(&fg1.buffer).all(|(px, fg)| { let d = px.map(|c| c as i16) - fg.map(|c| c as i16); d.map(|c| (c as i32).pow(2) as u32); d.r + d.g + d.b + d.a < 120 })); } #[test] fn remap_bg7() { let fg1 = lodepng::decode32_file("tests/frame-7-a.png").unwrap(); let bg1 = lodepng::decode32_file("tests/frame-7-bg.png").unwrap(); let pal = lodepng::decode32_file("tests/frame-7-pal.png").unwrap(); let mut attr = new(); let mut fg = attr.new_image_stride(&fg1.buffer, fg1.width, fg1.height, fg1.width, 0.).unwrap(); let bg = attr.new_image_stride(&bg1.buffer, bg1.width, bg1.height, bg1.width, 0.).unwrap(); fg.set_background(bg).unwrap(); for c in &pal.buffer { fg.add_fixed_color(*c).unwrap(); } attr.set_max_colors(pal.buffer.len() as _).unwrap(); let mut res = attr.quantize(&mut fg).unwrap(); res.set_dithering_level(0.).unwrap(); let (pal, idx) = res.remapped(&mut fg).unwrap(); let buf: Vec<_> = idx.iter().zip(bg1.buffer.iter()).map(|(px, bg)| { let palpx = pal[*px as usize]; if palpx.a > 0 { palpx } else { *bg } }).collect(); lodepng::encode32_file("/tmp/testr2-r7.png", &buf, fg.width(), fg.height()).unwrap(); assert!(idx.iter().zip(bg1.buffer.iter()).map(|(px, bg)| { let palpx = pal[*px as usize]; if palpx.a > 0 { palpx } else { *bg } }).zip(&fg1.buffer).all(|(px, fg)| { let d = px.map(|c| c as i16) - fg.map(|c| c as i16); d.map(|c| (c as i32).pow(2) as u32); d.r + d.g + d.b + d.a < 160 })); } libimagequant-2.18.0/version.txt000066400000000000000000000000071436525270400166570ustar00rootroot000000000000002.17.1